2006-06-14 Ami Tavory <atavory@gmail.com>

	    Benjamin Kosnik  <bkoz@redhat.com>

	* include/ext/pb_assoc: Delete.
	* include/ext/pb_ds: Add.
	* docs/html/ext/pb_assoc: Delete.
	* docs/html/ext/pb_ds: Add.
	* testsuite/ext/pb_assoc: Delete.
	* testsuite/ext/pb_ds: Add.
	* testsuite/performance/ext: Add.
	* testsuite/performance/ext/pb_ds: Add.	

	* testsuite/util/regression: New.
	* testsuite/util/rng: New.
	* testsuite/util/native_type: New.
	* testsuite/util/common_type: New.
	* testsuite/util/performance: New.
	* testsuite/util/hash_fn: New.
	* testsuite/util/io: New.
	* testsuite/util/statistic: New.

	* scripts/make_graph.py: New.
	* scripts/make_graphs.py: New.
	* testsuite/data/thirty_years_among_the_dead_preproc.txt: Add.
	* testsuite/data/make_graph_htmls.xml: Add.
	* testsuite/data/make_graph_test_infos.xml: Add.	

	* testsuite/lib/libstdc++.exp (v3-build_support): Add in new
	object files for regression testing.
	* docs/html/documentation.html: Adjust links.
	* include/Makefile.am (install-headers): Update for new sources,
	directories.
	* include/Makefine.in: Regenerate.
	* scripts/testsuite_flags.in: Adjust to testsuite/util path.
	* scripts/check_performance: Simplify, adjust for new testsuite output.
	* testsuite/Makefile.am (check-performance): Adjust.
	(doc-performance): New.
	* testsuite/Makefile.in: Regenerate.

	* include/ext/pb_ds: New.
	* include/ext/pb_ds/assoc_container.hpp: Same.
	* include/ext/pb_ds/detail: New.
	* include/ext/pb_ds/detail/binomial_heap_base_: New.
	* include/ext/pb_ds/detail/binomial_heap_base_/erase_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/binomial_heap_base_/find_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/binomial_heap_base_/insert_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/binomial_heap_base_/binomial_heap_base_.hpp: Same.
	* include/ext/pb_ds/detail/binomial_heap_base_/debug_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/binomial_heap_base_/constructors_destructor_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/binomial_heap_base_/split_join_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/resize_policy: New.
	* include/ext/pb_ds/detail/resize_policy/sample_size_policy.hpp: Same.
	* include/ext/pb_ds/detail/resize_policy/hash_prime_size_policy_imp.hpp: Same.
	* include/ext/pb_ds/detail/resize_policy/cc_hash_max_collision_check_resize_trigger_imp.hpp: Same.
	* include/ext/pb_ds/detail/resize_policy/sample_resize_policy.hpp: Same.
	* include/ext/pb_ds/detail/resize_policy/sample_resize_trigger.hpp: Same.
	* include/ext/pb_ds/detail/resize_policy/hash_load_check_resize_trigger_size_base.hpp: Same.
	* include/ext/pb_ds/detail/resize_policy/hash_exponential_size_policy_imp.hpp: Same.
	* include/ext/pb_ds/detail/resize_policy/hash_load_check_resize_trigger_imp.hpp: Same.
	* include/ext/pb_ds/detail/resize_policy/hash_standard_resize_policy_imp.hpp: Same.
	* include/ext/pb_ds/detail/container_base_dispatch.hpp: Same.
	* include/ext/pb_ds/detail/cc_hash_table_map_: New.
	* include/ext/pb_ds/detail/cc_hash_table_map_/constructor_destructor_no_store_hash_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/cc_hash_table_map_/erase_store_hash_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/cc_hash_table_map_/cmp_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/cc_hash_table_map_/insert_no_store_hash_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/cc_hash_table_map_/resize_store_hash_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/cc_hash_table_map_/policy_access_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/cc_hash_table_map_/find_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/cc_hash_table_map_/constructor_destructor_store_hash_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/cc_hash_table_map_/insert_store_hash_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/cc_hash_table_map_/debug_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/cc_hash_table_map_/info_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/cc_hash_table_map_/entry_list_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/cc_hash_table_map_/trace_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/cc_hash_table_map_/find_store_hash_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/cc_hash_table_map_/erase_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/cc_hash_table_map_/resize_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/cc_hash_table_map_/cc_ht_map_.hpp: Same.
	* include/ext/pb_ds/detail/cc_hash_table_map_/debug_no_store_hash_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/cc_hash_table_map_/constructor_destructor_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/cc_hash_table_map_/cond_key_dtor_entry_dealtor.hpp: Same.
	* include/ext/pb_ds/detail/cc_hash_table_map_/insert_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/cc_hash_table_map_/debug_store_hash_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/cc_hash_table_map_/erase_no_store_hash_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/cc_hash_table_map_/size_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/cc_hash_table_map_/standard_policies.hpp: Same.
	* include/ext/pb_ds/detail/cc_hash_table_map_/iterators_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/cc_hash_table_map_/resize_no_store_hash_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/typelist_assoc_container.hpp: Same.
	* include/ext/pb_ds/detail/tree_trace_base.hpp: Same.
	* include/ext/pb_ds/detail/unordered_iterator: New.
	* include/ext/pb_ds/detail/unordered_iterator/iterator.hpp: Same.
	* include/ext/pb_ds/detail/unordered_iterator/const_iterator.hpp: Same.
	* include/ext/pb_ds/detail/unordered_iterator/point_iterator.hpp: Same.
	* include/ext/pb_ds/detail/unordered_iterator/const_point_iterator.hpp: Same.
	* include/ext/pb_ds/detail/typelist.hpp: Same.
	* include/ext/pb_ds/detail/pat_trie_: New.
	* include/ext/pb_ds/detail/pat_trie_/r_erase_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/pat_trie_/policy_access_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/pat_trie_/find_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/pat_trie_/child_iterator.hpp: Same.
	* include/ext/pb_ds/detail/pat_trie_/update_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/pat_trie_/insert_join_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/pat_trie_/split_join_branch_bag.hpp: Same.
	* include/ext/pb_ds/detail/pat_trie_/constructors_destructor_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/pat_trie_/debug_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/pat_trie_/head.hpp: Same.
	* include/ext/pb_ds/detail/pat_trie_/const_child_iterator.hpp: Same.
	* include/ext/pb_ds/detail/pat_trie_/split_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/pat_trie_/traits.hpp: Same.
	* include/ext/pb_ds/detail/pat_trie_/cond_dtor_entry_dealtor.hpp: Same.
	* include/ext/pb_ds/detail/pat_trie_/pat_trie_.hpp: Same.
	* include/ext/pb_ds/detail/pat_trie_/info_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/pat_trie_/leaf.hpp: Same.
	* include/ext/pb_ds/detail/pat_trie_/trace_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/pat_trie_/rotate_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/pat_trie_/erase_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/pat_trie_/node_base.hpp: Same.
	* include/ext/pb_ds/detail/pat_trie_/node_metadata_base.hpp: Same.
	* include/ext/pb_ds/detail/pat_trie_/synth_e_access_traits.hpp: Same.
	* include/ext/pb_ds/detail/pat_trie_/node_iterators.hpp: Same.
	* include/ext/pb_ds/detail/pat_trie_/internal_node.hpp: Same.
	* include/ext/pb_ds/detail/pat_trie_/point_iterators.hpp: Same.
	* include/ext/pb_ds/detail/pat_trie_/iterators_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/bin_search_tree_: New.
	* include/ext/pb_ds/detail/bin_search_tree_/policy_access_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/bin_search_tree_/find_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/bin_search_tree_/r_erase_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/bin_search_tree_/constructors_destructor_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/bin_search_tree_/debug_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/bin_search_tree_/cond_dtor_entry_dealtor.hpp: Same.
	* include/ext/pb_ds/detail/bin_search_tree_/traits.hpp: Same.
	* include/ext/pb_ds/detail/bin_search_tree_/info_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/bin_search_tree_/rotate_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/bin_search_tree_/erase_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/bin_search_tree_/bin_search_tree_.hpp: Same.
	* include/ext/pb_ds/detail/bin_search_tree_/cond_key_dtor_entry_dealtor.hpp: Same.
	* include/ext/pb_ds/detail/bin_search_tree_/insert_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/bin_search_tree_/node_iterators.hpp: Same.
	* include/ext/pb_ds/detail/bin_search_tree_/point_iterators.hpp: Same.
	* include/ext/pb_ds/detail/bin_search_tree_/split_join_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/bin_search_tree_/iterators_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/gp_hash_table_map_: New.
	* include/ext/pb_ds/detail/gp_hash_table_map_/constructor_destructor_no_store_hash_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/gp_hash_table_map_/erase_store_hash_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/gp_hash_table_map_/insert_no_store_hash_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/gp_hash_table_map_/resize_store_hash_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/gp_hash_table_map_/policy_access_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/gp_hash_table_map_/find_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/gp_hash_table_map_/gp_ht_map_.hpp: Same.
	* include/ext/pb_ds/detail/gp_hash_table_map_/constructor_destructor_store_hash_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/gp_hash_table_map_/insert_store_hash_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/gp_hash_table_map_/debug_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/gp_hash_table_map_/iterator_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/gp_hash_table_map_/info_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/gp_hash_table_map_/find_no_store_hash_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/gp_hash_table_map_/trace_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/gp_hash_table_map_/erase_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/gp_hash_table_map_/find_store_hash_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/gp_hash_table_map_/resize_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/gp_hash_table_map_/debug_no_store_hash_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/gp_hash_table_map_/constructor_destructor_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/gp_hash_table_map_/insert_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/gp_hash_table_map_/debug_store_hash_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/gp_hash_table_map_/erase_no_store_hash_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/gp_hash_table_map_/standard_policies.hpp: Same.
	* include/ext/pb_ds/detail/gp_hash_table_map_/resize_no_store_hash_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/standard_policies.hpp: Same.
	* include/ext/pb_ds/detail/typelist: New.
	* include/ext/pb_ds/detail/typelist/typelist_flatten.hpp: Same.
	* include/ext/pb_ds/detail/typelist/typelist_contains.hpp: Same.
	* include/ext/pb_ds/detail/typelist/typelist_typelist_append.hpp: Same.
	* include/ext/pb_ds/detail/typelist/typelist_apply.hpp: Same.
	* include/ext/pb_ds/detail/typelist/typelist_filter.hpp: Same.
	* include/ext/pb_ds/detail/typelist/typelist_append.hpp: Same.
	* include/ext/pb_ds/detail/typelist/typelist_assoc_container_find.hpp: Same.
	* include/ext/pb_ds/detail/typelist/typelist_transform.hpp: Same.
	* include/ext/pb_ds/detail/typelist/typelist_at_index.hpp: Same.
	* include/ext/pb_ds/detail/tree_policy: New.
	* include/ext/pb_ds/detail/tree_policy/order_statistics_imp.hpp: Same.
	* include/ext/pb_ds/detail/tree_policy/node_metadata_selector.hpp: Same.
	* include/ext/pb_ds/detail/tree_policy/null_node_update_imp.hpp: Same.
	* include/ext/pb_ds/detail/tree_policy/sample_tree_node_update.hpp: Same.
	* include/ext/pb_ds/detail/basic_tree_policy: New.
	* include/ext/pb_ds/detail/basic_tree_policy/basic_tree_policy_base.hpp: Same.
	* include/ext/pb_ds/detail/basic_tree_policy/null_node_metadata.hpp: Same.
	* include/ext/pb_ds/detail/basic_tree_policy/traits.hpp: Same.
	* include/ext/pb_ds/detail/types_traits.hpp: Same.
	* include/ext/pb_ds/detail/binary_heap_: New.
	* include/ext/pb_ds/detail/binary_heap_/policy_access_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/binary_heap_/find_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/binary_heap_/const_iterator.hpp: Same.
	* include/ext/pb_ds/detail/binary_heap_/entry_cmp.hpp: Same.
	* include/ext/pb_ds/detail/binary_heap_/constructors_destructor_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/binary_heap_/debug_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/binary_heap_/info_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/binary_heap_/const_point_iterator.hpp: Same.
	* include/ext/pb_ds/detail/binary_heap_/trace_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/binary_heap_/erase_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/binary_heap_/entry_pred.hpp: Same.
	* include/ext/pb_ds/detail/binary_heap_/insert_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/binary_heap_/resize_policy.hpp: Same.
	* include/ext/pb_ds/detail/binary_heap_/binary_heap_.hpp: Same.
	* include/ext/pb_ds/detail/binary_heap_/split_join_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/binary_heap_/iterators_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/trie_policy: New.
	* include/ext/pb_ds/detail/trie_policy/string_trie_e_access_traits_imp.hpp: Same.
	* include/ext/pb_ds/detail/trie_policy/order_statistics_imp.hpp: Same.
	* include/ext/pb_ds/detail/trie_policy/sample_trie_node_update.hpp: Same.
	* include/ext/pb_ds/detail/trie_policy/trie_policy_base.hpp: Same.
	* include/ext/pb_ds/detail/trie_policy/prefix_search_node_update_imp.hpp: Same.
	* include/ext/pb_ds/detail/trie_policy/sample_trie_e_access_traits.hpp: Same.
	* include/ext/pb_ds/detail/trie_policy/node_metadata_selector.hpp: Same.
	* include/ext/pb_ds/detail/trie_policy/null_node_update_imp.hpp: Same.
	* include/ext/pb_ds/detail/cond_dealtor.hpp: Same.
	* include/ext/pb_ds/detail/priority_queue_base_dispatch.hpp: Same.
	* include/ext/pb_ds/detail/pairing_heap_: Name.
	* include/ext/pb_ds/detail/pairing_heap_/erase_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/pairing_heap_/find_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/pairing_heap_/insert_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/pairing_heap_/debug_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/pairing_heap_/constructors_destructor_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/pairing_heap_/pairing_heap_.hpp: Same.
	* include/ext/pb_ds/detail/pairing_heap_/split_join_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/binomial_heap_: New.
	* include/ext/pb_ds/detail/binomial_heap_/debug_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/binomial_heap_/constructors_destructor_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/binomial_heap_/binomial_heap_.hpp: Same.
	* include/ext/pb_ds/detail/constructors_destructor_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/type_utils.hpp: Same.
	* include/ext/pb_ds/detail/eq_fn: New.
	* include/ext/pb_ds/detail/eq_fn/hash_eq_fn.hpp: Same.
	* include/ext/pb_ds/detail/eq_fn/eq_by_less.hpp: Same.
	* include/ext/pb_ds/detail/basic_types.hpp: Same.
	* include/ext/pb_ds/detail/list_update_policy: New.
	* include/ext/pb_ds/detail/list_update_policy/mtf_lu_policy_imp.hpp: Same.
	* include/ext/pb_ds/detail/list_update_policy/counter_lu_metadata.hpp: Same.
	* include/ext/pb_ds/detail/list_update_policy/sample_update_policy.hpp: Same.
	* include/ext/pb_ds/detail/list_update_policy/counter_lu_policy_imp.hpp: Same.
	* include/ext/pb_ds/detail/thin_heap_: New.
	* include/ext/pb_ds/detail/thin_heap_/trace_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/thin_heap_/erase_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/thin_heap_/find_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/thin_heap_/thin_heap_.hpp: Same.
	* include/ext/pb_ds/detail/thin_heap_/insert_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/thin_heap_/debug_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/thin_heap_/constructors_destructor_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/thin_heap_/split_join_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/left_child_next_sibling_heap_: New.
	* include/ext/pb_ds/detail/left_child_next_sibling_heap_/trace_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/left_child_next_sibling_heap_/erase_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/left_child_next_sibling_heap_/null_metadata.hpp: Same.
	* include/ext/pb_ds/detail/left_child_next_sibling_heap_/policy_access_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/left_child_next_sibling_heap_/left_child_next_sibling_heap_.hpp: Same.
	* include/ext/pb_ds/detail/left_child_next_sibling_heap_/insert_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/left_child_next_sibling_heap_/const_iterator.hpp: Same.
	* include/ext/pb_ds/detail/left_child_next_sibling_heap_/debug_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/left_child_next_sibling_heap_/constructors_destructor_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/left_child_next_sibling_heap_/node.hpp: Same.
	* include/ext/pb_ds/detail/left_child_next_sibling_heap_/info_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/left_child_next_sibling_heap_/iterators_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/left_child_next_sibling_heap_/const_point_iterator.hpp: Same.
	* include/ext/pb_ds/detail/ov_tree_map_: New.
	* include/ext/pb_ds/detail/ov_tree_map_/erase_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/ov_tree_map_/policy_access_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/ov_tree_map_/cond_dtor.hpp: Same.
	* include/ext/pb_ds/detail/ov_tree_map_/insert_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/ov_tree_map_/ov_tree_map_.hpp: Same.
	* include/ext/pb_ds/detail/ov_tree_map_/node_iterators.hpp: Same.
	* include/ext/pb_ds/detail/ov_tree_map_/debug_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/ov_tree_map_/constructors_destructor_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/ov_tree_map_/split_join_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/ov_tree_map_/traits.hpp: Same.
	* include/ext/pb_ds/detail/ov_tree_map_/info_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/ov_tree_map_/iterators_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/map_debug_base.hpp: Same.
	* include/ext/pb_ds/detail/hash_fn: New.
	* include/ext/pb_ds/detail/hash_fn/linear_probe_fn_imp.hpp: Same.
	* include/ext/pb_ds/detail/hash_fn/mod_based_range_hashing.hpp: Same.
	* include/ext/pb_ds/detail/hash_fn/ranged_probe_fn.hpp: Same.
	* include/ext/pb_ds/detail/hash_fn/sample_probe_fn.hpp: Same.
	* include/ext/pb_ds/detail/hash_fn/direct_mod_range_hashing_imp.hpp: Same.
	* include/ext/pb_ds/detail/hash_fn/sample_ranged_probe_fn.hpp: Same.
	* include/ext/pb_ds/detail/hash_fn/quadratic_probe_fn_imp.hpp: Same.
	* include/ext/pb_ds/detail/hash_fn/sample_range_hashing.hpp: Same.
	* include/ext/pb_ds/detail/hash_fn/probe_fn_base.hpp: Same.
	* include/ext/pb_ds/detail/hash_fn/ranged_hash_fn.hpp: Same.
	* include/ext/pb_ds/detail/hash_fn/mask_based_range_hashing.hpp: Same.
	* include/ext/pb_ds/detail/hash_fn/sample_ranged_hash_fn.hpp: Same.
	* include/ext/pb_ds/detail/hash_fn/direct_mask_range_hashing_imp.hpp: Same.
	* include/ext/pb_ds/detail/splay_tree_: New.
	* include/ext/pb_ds/detail/splay_tree_/erase_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/splay_tree_/find_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/splay_tree_/insert_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/splay_tree_/debug_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/splay_tree_/constructors_destructor_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/splay_tree_/splay_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/splay_tree_/node.hpp: Same.
	* include/ext/pb_ds/detail/splay_tree_/split_join_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/splay_tree_/splay_tree_.hpp: Same.
	* include/ext/pb_ds/detail/splay_tree_/traits.hpp: Same.
	* include/ext/pb_ds/detail/splay_tree_/info_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/list_update_map_: New.
	* include/ext/pb_ds/detail/list_update_map_/trace_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/list_update_map_/erase_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/list_update_map_/find_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/list_update_map_/entry_metadata_base.hpp: Same.
	* include/ext/pb_ds/detail/list_update_map_/lu_map_.hpp: Same.
	* include/ext/pb_ds/detail/list_update_map_/constructor_destructor_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/list_update_map_/insert_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/list_update_map_/debug_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/list_update_map_/info_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/list_update_map_/iterators_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/rc_binomial_heap_: New.
	* include/ext/pb_ds/detail/rc_binomial_heap_/trace_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/rc_binomial_heap_/erase_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/rc_binomial_heap_/rc_binomial_heap_.hpp: Same.
	* include/ext/pb_ds/detail/rc_binomial_heap_/insert_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/rc_binomial_heap_/debug_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/rc_binomial_heap_/constructors_destructor_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/rc_binomial_heap_/rc.hpp: Same.
	* include/ext/pb_ds/detail/rc_binomial_heap_/split_join_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/rb_tree_map_: New.
	* include/ext/pb_ds/detail/rb_tree_map_/erase_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/rb_tree_map_/find_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/rb_tree_map_/insert_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/rb_tree_map_/rb_tree_.hpp: Same.
	* include/ext/pb_ds/detail/rb_tree_map_/debug_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/rb_tree_map_/constructors_destructor_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/rb_tree_map_/node.hpp: Same.
	* include/ext/pb_ds/detail/rb_tree_map_/split_join_fn_imps.hpp: Same.
	* include/ext/pb_ds/detail/rb_tree_map_/traits.hpp: Same.
	* include/ext/pb_ds/detail/rb_tree_map_/info_fn_imps.hpp: Same.
	* include/ext/pb_ds/list_update_policy.hpp: Same.
	* include/ext/pb_ds/exception.hpp: Same.
	* include/ext/pb_ds/tree_policy.hpp: Same.
	* include/ext/pb_ds/tag_and_trait.hpp: Same.
	* include/ext/pb_ds/hash_policy.hpp: Same.
	* include/ext/pb_ds/trie_policy.hpp: Same.
	* include/ext/pb_ds/priority_queue.hpp: Same.

	* docs/html/ext/pb_ds: New.
	* docs/html/ext/pb_ds/container_tag.html: Same.
	* docs/html/ext/pb_ds/trivial_iterator_tag.html: Same.
	* docs/html/ext/pb_ds/tree_text_lor_find_timing_test_local.png
	* docs/html/ext/pb_ds/sample_trie_e_access_traits.html: Same.
	* docs/html/ext/pb_ds/gp_hash_table.html: Same.
	* docs/html/ext/pb_ds/priority_queue_tag_cd.svg
	* docs/html/ext/pb_ds/container_cd.svg
	* docs/html/ext/pb_ds/linear_probe_fn.html: Same.
	* docs/html/ext/pb_ds/hash_random_int_erase_mem_usage_test_local.png
	* docs/html/ext/pb_ds/quadratic_probe_fn.html: Same.
	* docs/html/ext/pb_ds/assoc_regression_tests.html: Same.
	* docs/html/ext/pb_ds/tree_tag.html: Same.
	* docs/html/ext/pb_ds/hash_random_int_erase_mem_usage_test.html: Same.
	* docs/html/ext/pb_ds/interface.html: Same.
	* docs/html/ext/pb_ds/hash_zlob_random_int_find_timing_test_msvc.png
	* docs/html/ext/pb_ds/hash_random_int_subscript_find_timing_test.html: Same.
	* docs/html/ext/pb_ds/lu_based_containers.html: Same.
	* docs/html/ext/pb_ds/embedded_lists_3.png
	* docs/html/ext/pb_ds/tree_text_find_find_timing_test.html: Same.
	* docs/html/ext/pb_ds/multimap_text_insert_mem_usage_test_small_s2p_hash_local.png
	* docs/html/ext/pb_ds/assoc_performance_tests.html: Same.
	* docs/html/ext/pb_ds/list_update.html: Same.
	* docs/html/ext/pb_ds/priority_queue_random_int_push_pop_timing_test_gcc.png
	* docs/html/ext/pb_ds/tree_text_insert_timing_test_pat_trie_local.png
	* docs/html/ext/pb_ds/point_iterators_range_ops_1.png
	* docs/html/ext/pb_ds/gp_hash_random_int_subscript_timing_test_insert_msvc.png
	* docs/html/ext/pb_ds/hash_zlob_random_int_find_timing_test_gcc.png
	* docs/html/ext/pb_ds/text_find_timing_test_tree_like_msvc.png
	* docs/html/ext/pb_ds/multimap_text_insert_mem_usage_test_small_s2p_tree_local.png
	* docs/html/ext/pb_ds/priority_queue_text_modify_down_timing_test_local.png
	* docs/html/ext/pb_ds/tree_text_insert_timing_test_pat_trie_msvc.png
	* docs/html/ext/pb_ds/priority_queue_text_modify_down_timing_test.html: Same.
	* docs/html/ext/pb_ds/move_to_front_lu_policy.html: Same.
	* docs/html/ext/pb_ds/multimap_text_find_timing_test_large_s2p_hash_gcc.png
	* docs/html/ext/pb_ds/hash_random_int_find_find_timing_test.html: Same.
	* docs/html/ext/pb_ds/string_trie_e_access_traits.html: Same.
	* docs/html/ext/pb_ds/prerequisites.html: Same.
	* docs/html/ext/pb_ds/gp_hash_tag.html: Same.
	* docs/html/ext/pb_ds/priority_queue_tag_cd.png
	* docs/html/ext/pb_ds/container_cd.png
	* docs/html/ext/pb_ds/priority_queue_text_join_timing_test_gcc.png
	* docs/html/ext/pb_ds/container_base.html: Same.
	* docs/html/ext/pb_ds/multimap_text_insert_timing_test_small_s2p_hash_msvc.png
	* docs/html/ext/pb_ds/tree_random_int_find_find_timing_test.html: Same.
	* docs/html/ext/pb_ds/binary_priority_queue_random_int_push_timing_test_msvc.png
	* docs/html/ext/pb_ds/gp_hash_random_int_subscript_timing_test_find_local.png
	* docs/html/ext/pb_ds/gp_hash_random_int_subscript_timing_test_find_gcc.png
	* docs/html/ext/pb_ds/priority_queue_text_push_pop_timing_test_msvc.png
	* docs/html/ext/pb_ds/random_int_find_find_timing_test_tree_msvc.png
	* docs/html/ext/pb_ds/text_find_timing_test_hash_local.png
	* docs/html/ext/pb_ds/tree_text_insert_timing_test_node_tree_msvc.png
	* docs/html/ext/pb_ds/ov_tree_tag.html: Same.
	* docs/html/ext/pb_ds/multimap_text_insert_timing_test_small_s2p_hash_local.png
	* docs/html/ext/pb_ds/multimap_text_insert_timing_test_large_s2p_hash_msvc.png
	* docs/html/ext/pb_ds/priority_queue_text_pop_mem_usage_test_msvc.png
	* docs/html/ext/pb_ds/priority_queue_text_modify_down_timing_test_pairing_thin_msvc.png
	* docs/html/ext/pb_ds/list_update_tag.html: Same.
	* docs/html/ext/pb_ds/balls_and_bins.png
	* docs/html/ext/pb_ds/multimap_text_insert_timing_test_small_s2p_tree_local.png
	* docs/html/ext/pb_ds/disclaimer.html: Same.
	* docs/html/ext/pb_ds/insert_error.html: Same.
	* docs/html/ext/pb_ds/multimap_text_find_timing_test_small_s2p_hash_gcc.png
	* docs/html/ext/pb_ds/ccgp_hash_random_int_subscript_timing_test_insert_gcc.png
	* docs/html/ext/pb_ds/examples.html: Same.
	* docs/html/ext/pb_ds/multimap_text_insert_timing_test_small.html: Same.
	* docs/html/ext/pb_ds/pairing_priority_queue_text_push_pop_timing_test_gcc.png
	* docs/html/ext/pb_ds/sample_probe_fn.html: Same.
	* docs/html/ext/pb_ds/multimap_text_insert_mem_usage_test_large_s2p_hash_local.png
	* docs/html/ext/pb_ds/priority_queue_text_push_timing_test.html: Same.
	* docs/html/ext/pb_ds/priority_queue_random_int_push_timing_test_gcc.png
	* docs/html/ext/pb_ds/null_mapped_type.html: Same.
	* docs/html/ext/pb_ds/binary_priority_queue_random_int_push_timing_test_gcc.png
	* docs/html/ext/pb_ds/tree_order_statistics_timing_test_gcc.png
	* docs/html/ext/pb_ds/associative_container_tag.html: Same.
	* docs/html/ext/pb_ds/multimap_text_insert_mem_usage_test_large_s2p_tree_local.png
	* docs/html/ext/pb_ds/design.html: Same.
	* docs/html/ext/pb_ds/cc_hash_max_collision_check_resize_trigger.html: Same.
	* docs/html/ext/pb_ds/pairing_heap_tag.html: Same.
	* docs/html/ext/pb_ds/tree_text_lor_find_timing_test_gcc.png
	* docs/html/ext/pb_ds/references.html: Same.
	* docs/html/ext/pb_ds/tree_order_statistics_timing_test_msvc.png
	* docs/html/ext/pb_ds/hash_load_check_resize_trigger.html: Same.
	* docs/html/ext/pb_ds/priority_queue_text_pop_mem_usage_test_gcc.png
	* docs/html/ext/pb_ds/priority_queue_text_modify_down_timing_test_pairing_thin_gcc.png
	* docs/html/ext/pb_ds/hash_random_int_erase_mem_usage_test_gcc.png
	* docs/html/ext/pb_ds/pq_different_underlying_dss.png
	* docs/html/ext/pb_ds/insert_resize_sequence_diagram1.png
	* docs/html/ext/pb_ds/pq_regression_tests.html: Same.
	* docs/html/ext/pb_ds/sample_tree_node_update.html: Same.
	* docs/html/ext/pb_ds/invalidation_guarantee_erase.png
	* docs/html/ext/pb_ds/basic_invalidation_guarantee.html: Same.
	* docs/html/ext/pb_ds/multimap_text_insert_timing_test_large_s2p_hash_local.png
	* docs/html/ext/pb_ds/multimap_text_insert_timing_test_large_s2p_hash_gcc.png
	* docs/html/ext/pb_ds/hash_zlob_random_int_find_timing_test_local.png
	* docs/html/ext/pb_ds/point_iterators_range_ops_2.png
	* docs/html/ext/pb_ds/null_probe_fn.html: Same.
	* docs/html/ext/pb_ds/hash_prime_size_policy.html: Same.
	* docs/html/ext/pb_ds/multimap_text_insert_mem_usage_test_small_s2p_hash_msvc.png
	* docs/html/ext/pb_ds/priority_queue_text_modify_down_timing_test_gcc.png
	* docs/html/ext/pb_ds/multimap_text_insert_timing_test_large_s2p_tree_local.png
	* docs/html/ext/pb_ds/binary_priority_queue_random_int_push_timing_test_local.png
	* docs/html/ext/pb_ds/multimap_text_insert_mem_usage_test_large_s2p_hash_msvc.png
	* docs/html/ext/pb_ds/multimap_text_insert_mem_usage_test_large_s2p_tree_gcc.png
	* docs/html/ext/pb_ds/multimap_text_find_timing_test_large.html: Same.
	* docs/html/ext/pb_ds/sample_resize_policy.html: Same.
	* docs/html/ext/pb_ds/binomial_heap_tag.html: Same.
	* docs/html/ext/pb_ds/priority_queue_text_pop_mem_usage_test_local.png
	* docs/html/ext/pb_ds/priority_queue_text_modify_down_timing_test_pairing_thin_local.png
	* docs/html/ext/pb_ds/tree_text_lor_find_find_timing_test.html: Same.
	* docs/html/ext/pb_ds/priority_queue_text_join_timing_test_msvc.png
	* docs/html/ext/pb_ds/trie_based_containers.html: Same.
	* docs/html/ext/pb_ds/cc_hash_random_int_subscript_timing_test_insert_gcc.png
	* docs/html/ext/pb_ds/tree_split_join_timing_test_local.png
	* docs/html/ext/pb_ds/text_find_timing_test_hash_gcc.png
	* docs/html/ext/pb_ds/motivation.html: Same.
	* docs/html/ext/pb_ds/multimap_text_insert_timing_test_small_s2p_tree_msvc.png
	* docs/html/ext/pb_ds/tree_split_join_timing_test_gcc.png
	* docs/html/ext/pb_ds/tree.html: Same.
	* docs/html/ext/pb_ds/multimap_text_insert_timing_test_small_s2p_hash_gcc.png
	* docs/html/ext/pb_ds/cc_hash_random_int_subscript_timing_test_insert_msvc.png
	* docs/html/ext/pb_ds/invalidation_guarantee_cd.png
	* docs/html/ext/pb_ds/tutorial.html: Same.
	* docs/html/ext/pb_ds/null_trie_node_update.html: Same.
	* docs/html/ext/pb_ds/priority_queue_text_modify_up_timing_test_gcc.png
	* docs/html/ext/pb_ds/multimap_text_insert_timing_test_large_s2p_tree_msvc.png
	* docs/html/ext/pb_ds/ccgp_hash_random_int_subscript_timing_test_insert_local.png
	* docs/html/ext/pb_ds/point_iterators_cd.png
	* docs/html/ext/pb_ds/multimap_text_find_timing_test_small_s2p_hash_local.png
	* docs/html/ext/pb_ds/priority_queue_random_int_push_pop_timing_test_local.png
	* docs/html/ext/pb_ds/rb_tree_tag.html: Same.
	* docs/html/ext/pb_ds/cc_hash_random_int_subscript_timing_test_find_msvc.png
	* docs/html/ext/pb_ds/pairing_priority_queue_text_push_timing_test_msvc.png
	* docs/html/ext/pb_ds/tree_text_insert_timing_test_pat_trie_gcc.png
	* docs/html/ext/pb_ds/exceptions.html: Same.
	* docs/html/ext/pb_ds/priority_queue_text_modify_up_timing_test_msvc.png
	* docs/html/ext/pb_ds/multimap_text_find_timing_test_small_s2p_tree_local.png
	* docs/html/ext/pb_ds/hash_policy_cd.png
	* docs/html/ext/pb_ds/multimap_text_insert_mem_usage_test_small_s2p_tree_gcc.png
	* docs/html/ext/pb_ds/multimap_text_insert_mem_usage_test_small.html: Same.
	* docs/html/ext/pb_ds/ds_gen.html: Same.
	* docs/html/ext/pb_ds/hash_exponential_size_policy.html: Same.
	* docs/html/ext/pb_ds/gp_hash_random_int_subscript_timing_test_insert_local.png
	* docs/html/ext/pb_ds/hash_random_int_erase_mem_usage_test_msvc.png
	* docs/html/ext/pb_ds/index.html: Same.
	* docs/html/ext/pb_ds/binary_heap_tag.html: Same.
	* docs/html/ext/pb_ds/basic_hash_tag.html: Same.
	* docs/html/ext/pb_ds/trie_order_statistics_node_update.html: Same.
	* docs/html/ext/pb_ds/sample_resize_trigger.html: Same.
	* docs/html/ext/pb_ds/priority_queue_text_push_timing_test_local.png
	* docs/html/ext/pb_ds/hash_text_find_find_timing_test.html: Same.
	* docs/html/ext/pb_ds/tree_text_insert_timing_test.html: Same.
	* docs/html/ext/pb_ds/trie_tag.html: Same.
	* docs/html/ext/pb_ds/cc_hash_random_int_subscript_timing_test_find_local.png
	* docs/html/ext/pb_ds/pq_tests.html: Same.
	* docs/html/ext/pb_ds/insert_resize_sequence_diagram2.png
	* docs/html/ext/pb_ds/node_invariant_invalidations.png
	* docs/html/ext/pb_ds/priority_queue_text_modify_down_timing_test_msvc.png
	* docs/html/ext/pb_ds/resize_policy_cd.png
	* docs/html/ext/pb_ds/embedded_lists_1.png
	* docs/html/ext/pb_ds/hash_ranged_hash_range_hashing_fns.png
	* docs/html/ext/pb_ds/null_lu_metadata.html: Same.
	* docs/html/ext/pb_ds/tree_order_statistics_timing_test.html: Same.
	* docs/html/ext/pb_ds/trie_prefix_search_node_update.html: Same.
	* docs/html/ext/pb_ds/hash_range_hashing_seq_diagram.png
	* docs/html/ext/pb_ds/point_invalidation_guarantee.html: Same.
	* docs/html/ext/pb_ds/direct_mod_range_hashing.html: Same.
	* docs/html/ext/pb_ds/tree_text_insert_timing_test_vector_tree_local.png
	* docs/html/ext/pb_ds/priority_queue_random_int_push_pop_timing_test_msvc.png
	* docs/html/ext/pb_ds/misc.html: Same.
	* docs/html/ext/pb_ds/multimap_text_find_timing_test_large_s2p_hash_local.png
	* docs/html/ext/pb_ds/counter_lu_policy.html: Same.
	* docs/html/ext/pb_ds/different_underlying_dss.png
	* docs/html/ext/pb_ds/restoring_node_invariants.png
	* docs/html/ext/pb_ds/multimap_text_insert_timing_test_large.html: Same.
	* docs/html/ext/pb_ds/pairing_priority_queue_text_push_timing_test_local.png
	* docs/html/ext/pb_ds/sample_update_policy.html: Same.
	* docs/html/ext/pb_ds/pairing_priority_queue_text_push_timing_test_gcc.png
	* docs/html/ext/pb_ds/tree_order_statistics_timing_test_local.png
	* docs/html/ext/pb_ds/multimap_text_insert_mem_usage_test_small_s2p_tree_msvc.png
	* docs/html/ext/pb_ds/simple_list.png
	* docs/html/ext/pb_ds/text_find_timing_test_hash_msvc.png
	* docs/html/ext/pb_ds/assoc_examples.html: Same.
	* docs/html/ext/pb_ds/priority_queue_text_push_pop_timing_test_local.png
	* docs/html/ext/pb_ds/hash_based_containers.html: Same.
	* docs/html/ext/pb_ds/text_find_timing_test_tree_like_local.png
	* docs/html/ext/pb_ds/multimap_text_find_timing_test_large_s2p_tree_local.png
	* docs/html/ext/pb_ds/multimap_text_find_timing_test_large_s2p_tree_gcc.png
	* docs/html/ext/pb_ds/tree_node_iterator.html: Same.
	* docs/html/ext/pb_ds/priority_queue_text_modify_up_timing_test_pairing_thin_msvc.png
	* docs/html/ext/pb_ds/trie_node_iterator.html: Same.
	* docs/html/ext/pb_ds/tree_based_containers.html: Same.
	* docs/html/ext/pb_ds/hash_random_int_subscript_insert_timing_test.html: Same.
	* docs/html/ext/pb_ds/multimap_text_insert_mem_usage_test_large_s2p_tree_msvc.png
	* docs/html/ext/pb_ds/ccgp_hash_random_int_subscript_timing_test_insert_msvc.png
	* docs/html/ext/pb_ds/multimap_text_find_timing_test_small_s2p_hash_msvc.png
	* docs/html/ext/pb_ds/priority_queue_text_push_timing_test_gcc.png
	* docs/html/ext/pb_ds/rationale_null_node_updator.png
	* docs/html/ext/pb_ds/priority_queue_text_modify_up_timing_test_pairing_thin_local.png
	* docs/html/ext/pb_ds/lu.png
	* docs/html/ext/pb_ds/assoc_container_traits.html: Same.
	* docs/html/ext/pb_ds/gp_hash_random_int_find_timing_test_msvc.png
	* docs/html/ext/pb_ds/assoc_design.html: Same.
	* docs/html/ext/pb_ds/splay_tree_tag.html: Same.
	* docs/html/ext/pb_ds/cc_hash_random_int_subscript_timing_test_find_gcc.png
	* docs/html/ext/pb_ds/priority_queue_random_int_push_timing_test.html: Same.
	* docs/html/ext/pb_ds/assoc_container_tag_cd.svg
	* docs/html/ext/pb_ds/resize_error.html: Same.
	* docs/html/ext/pb_ds/multimap_text_find_timing_test_large_s2p_hash_msvc.png
	* docs/html/ext/pb_ds/tree_text_insert_timing_test_node_tree_gcc.png
	* docs/html/ext/pb_ds/priority_queue_text_join_timing_test.html: Same.
	* docs/html/ext/pb_ds/basic_tree_assoc_container_const_node_iterator.html: Same.
	* docs/html/ext/pb_ds/gp_hash_random_int_find_timing_test_gcc.png
	* docs/html/ext/pb_ds/trie_const_node_iterator.html: Same.
	* docs/html/ext/pb_ds/hash_zlob_random_int_find_find_timing_test.html: Same.
	* docs/html/ext/pb_ds/multimap_text_find_timing_test_small_s2p_tree_gcc.png
	* docs/html/ext/pb_ds/sample_size_policy.html: Same.
	* docs/html/ext/pb_ds/tree_text_insert_timing_test_vector_tree_gcc.png
	* docs/html/ext/pb_ds/cc_hash_table.html: Same.
	* docs/html/ext/pb_ds/node_invariants.png
	* docs/html/ext/pb_ds/tree_split_join_timing_test_msvc.png
	* docs/html/ext/pb_ds/priority_queue_text_modify_up_timing_test.html: Same.
	* docs/html/ext/pb_ds/tree_order_statistics_node_update.html: Same.
	* docs/html/ext/pb_ds/cc_hash_random_int_find_timing_test_msvc.png
	* docs/html/ext/pb_ds/cc_hash_random_int_subscript_timing_test_insert_local.png
	* docs/html/ext/pb_ds/priority_queue.html: Same.
	* docs/html/ext/pb_ds/assoc_tests.html: Same.
	* docs/html/ext/pb_ds/assoc_container_tag_cd.png
	* docs/html/ext/pb_ds/basic_hash_table.html: Same.
	* docs/html/ext/pb_ds/basic_tree_tag.html: Same.
	* docs/html/ext/pb_ds/tree_split_join_timing_test.html: Same.
	* docs/html/ext/pb_ds/priority_queue_text_modify_up_timing_test_local.png
	* docs/html/ext/pb_ds/insert_resize_sequence_diagram3.png
	* docs/html/ext/pb_ds/embedded_lists_2.png
	* docs/html/ext/pb_ds/random_int_find_find_timing_test_tree_local.png
	* docs/html/ext/pb_ds/sample_ranged_probe_fn.html: Same.
	* docs/html/ext/pb_ds/random_int_find_find_timing_test_tree_gcc.png
	* docs/html/ext/pb_ds/sample_trie_node_update.html: Same.
	* docs/html/ext/pb_ds/introduction.html: Same.
	* docs/html/ext/pb_ds/pq_performance_tests.html: Same.
	* docs/html/ext/pb_ds/pat_trie.png
	* docs/html/ext/pb_ds/range_invalidation_guarantee.html: Same.
	* docs/html/ext/pb_ds/contact.html: Same.
	* docs/html/ext/pb_ds/sample_range_hashing.html: Same.
	* docs/html/ext/pb_ds/priority_queue_random_int_push_timing_test_local.png
	* docs/html/ext/pb_ds/multimap_text_insert_mem_usage_test_large_s2p_hash_gcc.png
	* docs/html/ext/pb_ds/update_seq_diagram.png
	* docs/html/ext/pb_ds/multimap_text_insert_timing_test_large_s2p_tree_gcc.png
	* docs/html/ext/pb_ds/direct_mask_range_hashing.html: Same.
	* docs/html/ext/pb_ds/tests.html: Same.
	* docs/html/ext/pb_ds/cc_hash_random_int_find_timing_test_gcc.png
	* docs/html/ext/pb_ds/tree_node_updator_policy_cd.png
	* docs/html/ext/pb_ds/text_find_timing_test_tree_like_gcc.png
	* docs/html/ext/pb_ds/multimap_text_insert_mem_usage_test_large.html: Same.
	* docs/html/ext/pb_ds/trie_node_updator_policy_cd.png
	* docs/html/ext/pb_ds/priority_queue_random_int_push_timing_test_msvc.png
	* docs/html/ext/pb_ds/concepts.html: Same.
	* docs/html/ext/pb_ds/pq_examples.html: Same.
	* docs/html/ext/pb_ds/priority_queue_tag.html: Same.
	* docs/html/ext/pb_ds/priority_queue_random_int_push_pop_timing_test.html: Same.
	* docs/html/ext/pb_ds/update_policy_cd.png
	* docs/html/ext/pb_ds/thin_heap_tag.html: Same.
	* docs/html/ext/pb_ds/pairing_priority_queue_text_push_pop_timing_test_msvc.png
	* docs/html/ext/pb_ds/basic_tree.html: Same.
	* docs/html/ext/pb_ds/null_hash_fn.html: Same.
	* docs/html/ext/pb_ds/null_tree_node_update.html: Same.
	* docs/html/ext/pb_ds/priority_queue_text_modify_up_timing_test_pairing_thin_gcc.png
	* docs/html/ext/pb_ds/trie.html: Same.
	* docs/html/ext/pb_ds/multimap_text_find_timing_test_small_s2p_tree_msvc.png
	* docs/html/ext/pb_ds/rc_binomial_heap_tag.html: Same.
	* docs/html/ext/pb_ds/priority_queue_text_push_timing_test_msvc.png
	* docs/html/ext/pb_ds/pq_container_traits.html: Same.
	* docs/html/ext/pb_ds/pq_design.html: Same.
	* docs/html/ext/pb_ds/checked_by_tidy.gif
	* docs/html/ext/pb_ds/tree_text_insert_timing_test_node_tree_local.png
	* docs/html/ext/pb_ds/multimap_text_insert_mem_usage_test_small_s2p_hash_gcc.png
	* docs/html/ext/pb_ds/priority_queue_text_push_pop_timing_test.html: Same.
	* docs/html/ext/pb_ds/multimap_text_insert_timing_test_small_s2p_tree_gcc.png
	* docs/html/ext/pb_ds/pairing_priority_queue_text_push_pop_timing_test_local.png
	* docs/html/ext/pb_ds/acks.html: Same.
	* docs/html/ext/pb_ds/gp_hash_random_int_find_timing_test_local.png
	* docs/html/ext/pb_ds/cc_hash_tag.html: Same.
	* docs/html/ext/pb_ds/sample_ranged_hash_fn.html: Same.
	* docs/html/ext/pb_ds/multimap_text_find_timing_test_large_s2p_tree_msvc.png
	* docs/html/ext/pb_ds/priority_queue_text_pop_mem_usage_test.html: Same.
	* docs/html/ext/pb_ds/multimap_text_find_timing_test_small.html: Same.
	* docs/html/ext/pb_ds/tree_text_lor_find_timing_test_msvc.png
	* docs/html/ext/pb_ds/hash_range_hashing_seq_diagram2.png
	* docs/html/ext/pb_ds/gp_hash_random_int_subscript_timing_test_find_msvc.png
	* docs/html/ext/pb_ds/PythonPoweredSmall.gif
	* docs/html/ext/pb_ds/cc_hash_random_int_find_timing_test_local.png
	* docs/html/ext/pb_ds/pat_trie_tag.html: Same.
	* docs/html/ext/pb_ds/hash_standard_resize_policy.html: Same.
	* docs/html/ext/pb_ds/tree_text_insert_timing_test_vector_tree_msvc.png
	* docs/html/ext/pb_ds/gp_hash_random_int_subscript_timing_test_insert_gcc.png
	* docs/html/ext/pb_ds/join_error.html: Same.
	* docs/html/ext/pb_ds/priority_queue_text_push_pop_timing_test_gcc.png
	* docs/html/ext/pb_ds/priority_queue_text_join_timing_test_local.png

	* testsuite/ext/pb_ds: New.
	* testsuite/ext/pb_ds/regression: New.
	* testsuite/ext/pb_ds/regression/trie_data_map_rand.cc: Same.
	* testsuite/ext/pb_ds/regression/hash_data_map_rand.cc: Same.
	* testsuite/ext/pb_ds/regression/associative_containers.cc: Same.
	* testsuite/ext/pb_ds/regression/list_update_no_data_map_rand.cc: Same.
	* testsuite/ext/pb_ds/regression/tree_no_data_map_rand.cc: Same.
	* testsuite/ext/pb_ds/regression/list_update_data_map_rand.cc: Same.
	* testsuite/ext/pb_ds/regression/priority_queues.cc: Same.
	* testsuite/ext/pb_ds/regression/hash_no_data_map_rand.cc: Same.
	* testsuite/ext/pb_ds/regression/priority_queue_rand.cc: Same.
	* testsuite/ext/pb_ds/regression/trie_no_data_map_rand.cc: Same.
	* testsuite/ext/pb_ds/regression/tree_data_map_rand.cc: Same.
	* testsuite/ext/pb_ds/example: New.
	* testsuite/ext/pb_ds/example/hash_shift_mask.cc: Same.
	* testsuite/ext/pb_ds/example/basic_set.cc: Same.
	* testsuite/ext/pb_ds/example/hash_illegal_resize.cc: Same.
	* testsuite/ext/pb_ds/example/hash_resize_neg.cc: Same.
	* testsuite/ext/pb_ds/example/store_hash.cc: Same.
	* testsuite/ext/pb_ds/example/assoc_container_traits.cc: Same.
	* testsuite/ext/pb_ds/example/hash_load_set_change.cc: Same.
	* testsuite/ext/pb_ds/example/ranged_hash.cc: Same.
	* testsuite/ext/pb_ds/example/hash_resize.cc: Same.
	* testsuite/ext/pb_ds/example/tree_order_statistics.cc: Same.
	* testsuite/ext/pb_ds/example/trie_prefix_search.cc: Same.
	* testsuite/ext/pb_ds/example/basic_multiset.cc: Same.
	* testsuite/ext/pb_ds/example/priority_queue_xref.cc: Same.
	* testsuite/ext/pb_ds/example/hash_find_neg.cc: Same.
	* testsuite/ext/pb_ds/example/erase_if.cc: Same.
	* testsuite/ext/pb_ds/example/priority_queue_container_traits.cc: Same.
	* testsuite/ext/pb_ds/example/tree_join.cc: Same.
	* testsuite/ext/pb_ds/example/basic_map.cc: Same.
	* testsuite/ext/pb_ds/example/trie_split.cc: Same.
	* testsuite/ext/pb_ds/example/priority_queue_split_join.cc: Same.
	* testsuite/ext/pb_ds/example/priority_queue_dijkstra.cc: Same.
	* testsuite/ext/pb_ds/example/priority_queue_erase_if.cc: Same.
	* testsuite/ext/pb_ds/example/hash_mod.cc: Same.
	* testsuite/ext/pb_ds/example/tree_order_statistics_join.cc: Same.
	* testsuite/ext/pb_ds/example/trie_dna.cc: Same.
	* testsuite/ext/pb_ds/example/hash_initial_size.cc: Same.
	* testsuite/ext/pb_ds/example/basic_priority_queue.cc: Same.
	* testsuite/ext/pb_ds/example/tree_intervals.cc: Same.
	* testsuite/ext/pb_ds/example/basic_multimap.cc: Same.
	* testsuite/performance/ext: New.
	* testsuite/performance/ext/pb_ds: New.
	* testsuite/performance/ext/pb_ds/multimap_text_find_timing_small.cc: Same.
	* testsuite/performance/ext/pb_ds/text_find_timing.cc: Same.
	* testsuite/performance/ext/pb_ds/hash_random_int_erase_mem_usage.cc: Same.
	* testsuite/performance/ext/pb_ds/tree_text_insert_timing.cc: Same.
	* testsuite/performance/ext/pb_ds/priority_queue_text_modify_down_timing.cc: Same.
	* testsuite/performance/ext/pb_ds/random_int_subscript_find_timing.cc: Same.
	* testsuite/performance/ext/pb_ds/priority_queue_text_push_timing.cc: Same.
	* testsuite/performance/ext/pb_ds/tree_split_join_timing.cc: Same.
	* testsuite/performance/ext/pb_ds/random_int_find_timing.cc: Same.
	* testsuite/performance/ext/pb_ds/multimap_text_insert_timing_large.cc: Same.
	* testsuite/performance/ext/pb_ds/multimap_text_insert_mem_usage.hpp: Same.
	* testsuite/performance/ext/pb_ds/priority_queue_random_int_push_timing.cc: Same.
	* testsuite/performance/ext/pb_ds/multimap_text_find_timing.hpp: Same.
	* testsuite/performance/ext/pb_ds/priority_queue_text_modify_timing.hpp: Same.
	* testsuite/performance/ext/pb_ds/tree_order_statistics_timing.cc: Same.
	* testsuite/performance/ext/pb_ds/priority_queue_text_modify_up_timing.cc: Same.
	* testsuite/performance/ext/pb_ds/multimap_text_insert_mem_usage_large.cc: Same.
	* testsuite/performance/ext/pb_ds/priority_queue_text_push_pop_timing.cc: Same.
	* testsuite/performance/ext/pb_ds/multimap_text_find_timing_large.cc: Same.
	* testsuite/performance/ext/pb_ds/priority_queue_text_join_timing.cc: Same.
	* testsuite/performance/ext/pb_ds/multimap_text_insert_timing_small.cc: Same.
	* testsuite/performance/ext/pb_ds/priority_queue_random_int_push_pop_timing.cc: Same.
	* testsuite/performance/ext/pb_ds/random_int_subscript_insert_timing.cc: Same.
	* testsuite/performance/ext/pb_ds/tree_text_lor_find_timing.cc: Same.
	* testsuite/performance/ext/pb_ds/priority_queue_text_pop_mem_usage.cc: Same.
	* testsuite/performance/ext/pb_ds/multimap_text_insert_timing.hpp: Same.
	* testsuite/performance/ext/pb_ds/hash_zlob_random_int_find_timing.cc: Same.
	* testsuite/performance/ext/pb_ds/multimap_text_insert_mem_usage_small.cc: Same.
	* testsuite/data/make_graph_test_infos.xml: Same.
	* testsuite/data/thirty_years_among_the_dead_preproc.txt: New.
	* testsuite/data/make_graph_htmls.xml: Same.
	* testsuite/util/regression: New.
	* testsuite/util/regression/trait: New.
	* testsuite/util/regression/trait/priority_queue: New.
	* testsuite/util/regression/trait/priority_queue/trait.hpp: Same.
	* testsuite/util/regression/trait/erase_if_fn.hpp: Same.
	* testsuite/util/regression/trait/assoc: New.
	* testsuite/util/regression/trait/assoc/native_type_trait.hpp: Same.
	* testsuite/util/regression/trait/assoc/node_update_trait.hpp: Same.
	* testsuite/util/regression/trait/assoc/get_set_load_trait.hpp: Same.
	* testsuite/util/regression/trait/assoc/get_set_loads_trait.hpp: Same.
	* testsuite/util/regression/trait/assoc/trait.hpp: Same.
	* testsuite/util/regression/trait/assoc/type_trait.hpp: Same.
	* testsuite/util/regression/trait/assoc/resize_trait.hpp: Same.
	* testsuite/util/regression/trait/assoc/to_string.hpp: Same.
	* testsuite/util/regression/rand: New.
	* testsuite/util/regression/rand/priority_queue: New.
	* testsuite/util/regression/rand/priority_queue/detail: New.
	* testsuite/util/regression/rand/priority_queue/detail/erase_fn_imps.hpp: Same.
	* testsuite/util/regression/rand/priority_queue/detail/cmp_fn_imps.hpp: Same.
	* testsuite/util/regression/rand/priority_queue/detail/policy_access_fn_imps.hpp: Same.
	* testsuite/util/regression/rand/priority_queue/detail/defs_fn_imps.hpp: Same.
	* testsuite/util/regression/rand/priority_queue/detail/it_conversion_fn_imps.hpp: Same.
	* testsuite/util/regression/rand/priority_queue/detail/constructor_destructor_fn_imps.hpp: Same.
	* testsuite/util/regression/rand/priority_queue/detail/diagnostic_fn_imps.hpp: Same.
	* testsuite/util/regression/rand/priority_queue/detail/insert_fn_imps.hpp: Same.
	* testsuite/util/regression/rand/priority_queue/detail/clear_fn_imps.hpp: Same.
	* testsuite/util/regression/rand/priority_queue/detail/modify_fn_imps.hpp: Same.
	* testsuite/util/regression/rand/priority_queue/detail/split_join_fn_imps.hpp: Same.
	* testsuite/util/regression/rand/priority_queue/detail/operator_fn_imps.hpp: Same.
	* testsuite/util/regression/rand/priority_queue/rand_regression_test.hpp: Same.
	* testsuite/util/regression/rand/priority_queue/container_rand_regression_test.hpp: Same.
	* testsuite/util/regression/rand/io: New.
	* testsuite/util/regression/rand/io/priority_queue: New.
	* testsuite/util/regression/rand/io/priority_queue/xml_formatter.hpp: Same.
	* testsuite/util/regression/rand/io/assoc: New.
	* testsuite/util/regression/rand/io/assoc/xml_formatter.hpp: Same.
	* testsuite/util/regression/rand/io/xml_formatter.hpp: Same.
	* testsuite/util/regression/rand/assoc: New.
	* testsuite/util/regression/rand/assoc/detail: New.
	* testsuite/util/regression/rand/assoc/detail/subscript_fn_imps.hpp: Same.
	* testsuite/util/regression/rand/assoc/detail/cmp_fn_imps.hpp: Same.
	* testsuite/util/regression/rand/assoc/detail/policy_access_fn_imps.hpp: Same.
	* testsuite/util/regression/rand/assoc/detail/defs_fn_imps.hpp: Same.
	* testsuite/util/regression/rand/assoc/detail/it_conversion_fn_imps.hpp: Same.
	* testsuite/util/regression/rand/assoc/detail/diagnostic_fn_imps.hpp: Same.
	* testsuite/util/regression/rand/assoc/detail/clear_fn_imps.hpp: Same.
	* testsuite/util/regression/rand/assoc/detail/get_set_load_fn_imps.hpp: Same.
	* testsuite/util/regression/rand/assoc/detail/operator_fn_imps.hpp: Same.
	* testsuite/util/regression/rand/assoc/detail/erase_fn_imps.hpp: Same.
	* testsuite/util/regression/rand/assoc/detail/resize_fn_imps.hpp: Same.
	* testsuite/util/regression/rand/assoc/detail/constructor_destructor_fn_imps.hpp: Same.
	* testsuite/util/regression/rand/assoc/detail/insert_fn_imps.hpp: Same.
	* testsuite/util/regression/rand/assoc/detail/split_join_fn_imps.hpp: Same.
	* testsuite/util/regression/rand/assoc/detail/get_set_loads_fn_imps.hpp: Same.
	* testsuite/util/regression/rand/assoc/rand_regression_test.hpp: Same.
	* testsuite/util/regression/rand/assoc/container_rand_regression_test.hpp: Same.
	* testsuite/util/regression/priority_queue: New.
	* testsuite/util/regression/priority_queue/common_type.hpp: Same.
	* testsuite/util/regression/basic_type.hpp: Same.
	* testsuite/util/regression/assoc: New.
	* testsuite/util/regression/assoc/common_type.hpp: Same.
	* testsuite/util/regression/res_mng: New.
	* testsuite/util/regression/res_mng/forced_exception.hpp: Same.
	* testsuite/util/regression/res_mng/dbg_ex_allocator_base.cc: Same.
	* testsuite/util/regression/res_mng/dbg_ex_allocator_base.hpp: Same.
	* testsuite/util/regression/res_mng/dbg_ex_allocator.hpp: Same.
	* testsuite/util/rng: New.
	* testsuite/util/rng/twister_rand_gen.cc: Same.
	* testsuite/util/rng/twister_rand_gen.hpp: Same.
	* testsuite/util/native_type: New.
	* testsuite/util/native_type/priority_queue: New.
	* testsuite/util/native_type/priority_queue/native_priority_queue.hpp: Same.
	* testsuite/util/native_type/priority_queue/native_pq_tag.hpp: Same.
	* testsuite/util/native_type/assoc: New.
	* testsuite/util/native_type/assoc/native_multimap.hpp: Same.
	* testsuite/util/native_type/assoc/native_tree_tag.hpp: Same.
	* testsuite/util/native_type/assoc/native_set.hpp: Same.
	* testsuite/util/native_type/assoc/native_hash_multimap.hpp: Same.
	* testsuite/util/native_type/assoc/native_map.hpp: Same.
	* testsuite/util/native_type/assoc/native_hash_tag.hpp: Same.
	* testsuite/util/native_type/assoc/native_hash_set.hpp: Same.
	* testsuite/util/native_type/assoc/native_hash_map.hpp: Same.
	* testsuite/util/common_type: New.
	* testsuite/util/common_type/priority_queue
	* testsuite/util/common_type/priority_queue/common_type.hpp: Same.
	* testsuite/util/common_type/priority_queue/string_form.hpp: Same.
	* testsuite/util/common_type/priority_queue/detail
	* testsuite/util/common_type/priority_queue/detail/ds_string_form.hpp: Same.
	* testsuite/util/common_type/assoc: New.
	* testsuite/util/common_type/assoc/common_type.hpp: Same.
	* testsuite/util/common_type/assoc/string_form.hpp: Same.
	* testsuite/util/common_type/assoc/template_policy.hpp: Same.
	* testsuite/util/common_type/assoc/detail: New.
	* testsuite/util/common_type/assoc/detail/resize_policy_string_form.hpp: Same.
	* testsuite/util/common_type/assoc/detail/trigger_policy_string_form.hpp: Same.
	* testsuite/util/common_type/assoc/detail/ds_string_form.hpp: Same.
	* testsuite/util/common_type/assoc/detail/comb_hash_fn_string_form.hpp: Same.
	* testsuite/util/common_type/assoc/detail/size_policy_string_form.hpp: Same.
	* testsuite/util/common_type/assoc/detail/probe_fn_string_form.hpp: Same.
	* testsuite/util/common_type/assoc/detail/tree_supports_order_statistics.hpp: Same.
	* testsuite/util/common_type/assoc/detail/trie_supports_prefix_search.hpp: Same.
	* testsuite/util/common_type/assoc/detail/list_update_policy_string_form.hpp: Same.
	* testsuite/util/common_type/assoc/detail/trie_supports_order_statistics.hpp: Same.
	* testsuite/util/common_type/assoc/detail/store_hash_string_form.hpp: Same.
	* testsuite/util/common_type/assoc/native_set.hpp: Same.
	* testsuite/util/performance: New.
	* testsuite/util/performance/priority_queue: New.
	* testsuite/util/performance/priority_queue/mem_usage: New.
	* testsuite/util/performance/priority_queue/mem_usage/pop_test.hpp: Same.
	* testsuite/util/performance/priority_queue/timing: New.
	* testsuite/util/performance/priority_queue/timing/push_pop_test.hpp: Same.
	* testsuite/util/performance/priority_queue/timing/push_test.hpp: Same.
	* testsuite/util/performance/priority_queue/timing/join_test.hpp: Same.
	* testsuite/util/performance/priority_queue/timing/modify_test.hpp: Same.
	* testsuite/util/performance/io: New.
	* testsuite/util/performance/io/xml_formatter.hpp: Same.
	* testsuite/util/performance/assoc: New.
	* testsuite/util/performance/assoc/mem_usage: New.
	* testsuite/util/performance/assoc/mem_usage/multimap_insert_test.hpp: Same.
	* testsuite/util/performance/assoc/mem_usage/erase_test.hpp: Same.
	* testsuite/util/performance/assoc/multimap_common_type.hpp: Same.
	* testsuite/util/performance/assoc/timing: New.
	* testsuite/util/performance/assoc/timing/common_type.hpp: Same.
	* testsuite/util/performance/assoc/timing/multimap_insert_test.hpp: Same.
	* testsuite/util/performance/assoc/timing/subscript_find_test.hpp: Same.
	* testsuite/util/performance/assoc/timing/find_test.hpp: Same.
	* testsuite/util/performance/assoc/timing/subscript_insert_test.hpp: Same.
	* testsuite/util/performance/assoc/timing/insert_test.hpp: Same.
	* testsuite/util/performance/assoc/timing/tree_order_statistics_test.hpp: Same.
	* testsuite/util/performance/assoc/timing/multimap_find_test.hpp: Same.
	* testsuite/util/performance/assoc/timing/tree_split_join_test.hpp: Same.
	* testsuite/util/performance/time: New.
	* testsuite/util/performance/time/elapsed_timer.cc: Same.
	* testsuite/util/performance/time/elapsed_timer.hpp: Same.
	* testsuite/util/performance/time/timing_test_base.hpp: Same.
	* testsuite/util/performance/mem: New.
	* testsuite/util/performance/mem/mem_track_allocator_base.hpp: Same.
	* testsuite/util/performance/mem/mem_track_allocator.hpp: Same.
	* testsuite/util/hash_fn: New.
	* testsuite/util/hash_fn/limit_string_hash_fn.hpp: Same.
	* testsuite/util/hash_fn/string_ranged_hash_fn.hpp: Same.
	* testsuite/util/hash_fn/string_hash_fn.hpp: Same.
	* testsuite/util/hash_fn/string_ranged_probe_fn.hpp: Same.
	* testsuite/util/hash_fn/dna_str_limit.hpp: Same.
	* testsuite/util/io: New.
	* testsuite/util/io/prog_bar.cc: Same.
	* testsuite/util/io/prog_bar.hpp: Same.
	* testsuite/util/io/text_populate.hpp: Same.
	* testsuite/util/io/xml.hpp: Same.
	* testsuite/util/io/illegal_input_error.hpp: Same.
	* testsuite/util/io/xml_test_formatter.hpp: Same.
	* testsuite/util/io/verified_cmd_line_input.cc: Same.
	* testsuite/util/io/verified_cmd_line_input.hpp: Same.
	* testsuite/util/statistic: New.
	* testsuite/util/statistic/sample_var.hpp: Same.
	* testsuite/util/statistic/res_recorder.hpp: Same.
	* testsuite/util/statistic/sample_mean.hpp: Same.
	* testsuite/util/statistic/sample_mean_confidence_checker.hpp: Same.




git-svn-id: https://gcc.gnu.org/svn/gcc/trunk@114659 138bc75d-0d04-0410-961f-82ee72b054a4

1146 files changed, 295307 insertions, 61696 deletions

diff --git a/libstdc++-v3/ChangeLog b/libstdc++-v3/ChangeLog
index f1c463207ae..008f1d8b16d 100644
--- a/libstdc++-v3/ChangeLog
+++ b/libstdc++-v3/ChangeLog
@@ -1,3 +1,879 @@
+2006-06-14  Ami Tavory  <atavory@gmail.com>
+	    Benjamin Kosnik  <bkoz@redhat.com>
+
+	* include/ext/pb_assoc: Delete.
+	* include/ext/pb_ds: Add.
+	* docs/html/ext/pb_assoc: Delete.
+	* docs/html/ext/pb_ds: Add.
+	* testsuite/ext/pb_assoc: Delete.
+	* testsuite/ext/pb_ds: Add.
+	* testsuite/performance/ext: Add.
+	* testsuite/performance/ext/pb_ds: Add.	
+
+	* testsuite/util/regression: New.
+	* testsuite/util/rng: New.
+	* testsuite/util/native_type: New.
+	* testsuite/util/common_type: New.
+	* testsuite/util/performance: New.
+	* testsuite/util/hash_fn: New.
+	* testsuite/util/io: New.
+	* testsuite/util/statistic: New.
+
+	* scripts/make_graph.py: New.
+	* scripts/make_graphs.py: New.
+	* testsuite/data/thirty_years_among_the_dead_preproc.txt: Add.
+	* testsuite/data/make_graph_htmls.xml: Add.
+	* testsuite/data/make_graph_test_infos.xml: Add.	
+
+	* testsuite/lib/libstdc++.exp (v3-build_support): Add in new
+	object files for regression testing.
+	* docs/html/documentation.html: Adjust links.
+	* include/Makefile.am (install-headers): Update for new sources,
+	directories.
+	* include/Makefine.in: Regenerate.
+	* scripts/testsuite_flags.in: Adjust to testsuite/util path.
+	* scripts/check_performance: Simplify, adjust for new testsuite output.
+	* testsuite/Makefile.am (check-performance): Adjust.
+	(doc-performance): New.
+	* testsuite/Makefile.in: Regenerate.
+
+	* include/ext/pb_ds: New.
+	* include/ext/pb_ds/assoc_container.hpp: Same.
+	* include/ext/pb_ds/detail: New.
+	* include/ext/pb_ds/detail/binomial_heap_base_: New.
+	* include/ext/pb_ds/detail/binomial_heap_base_/erase_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/binomial_heap_base_/find_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/binomial_heap_base_/insert_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/binomial_heap_base_/binomial_heap_base_.hpp: Same.
+	* include/ext/pb_ds/detail/binomial_heap_base_/debug_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/binomial_heap_base_/constructors_destructor_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/binomial_heap_base_/split_join_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/resize_policy: New.
+	* include/ext/pb_ds/detail/resize_policy/sample_size_policy.hpp: Same.
+	* include/ext/pb_ds/detail/resize_policy/hash_prime_size_policy_imp.hpp: Same.
+	* include/ext/pb_ds/detail/resize_policy/cc_hash_max_collision_check_resize_trigger_imp.hpp: Same.
+	* include/ext/pb_ds/detail/resize_policy/sample_resize_policy.hpp: Same.
+	* include/ext/pb_ds/detail/resize_policy/sample_resize_trigger.hpp: Same.
+	* include/ext/pb_ds/detail/resize_policy/hash_load_check_resize_trigger_size_base.hpp: Same.
+	* include/ext/pb_ds/detail/resize_policy/hash_exponential_size_policy_imp.hpp: Same.
+	* include/ext/pb_ds/detail/resize_policy/hash_load_check_resize_trigger_imp.hpp: Same.
+	* include/ext/pb_ds/detail/resize_policy/hash_standard_resize_policy_imp.hpp: Same.
+	* include/ext/pb_ds/detail/container_base_dispatch.hpp: Same.
+	* include/ext/pb_ds/detail/cc_hash_table_map_: New.
+	* include/ext/pb_ds/detail/cc_hash_table_map_/constructor_destructor_no_store_hash_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/cc_hash_table_map_/erase_store_hash_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/cc_hash_table_map_/cmp_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/cc_hash_table_map_/insert_no_store_hash_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/cc_hash_table_map_/resize_store_hash_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/cc_hash_table_map_/policy_access_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/cc_hash_table_map_/find_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/cc_hash_table_map_/constructor_destructor_store_hash_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/cc_hash_table_map_/insert_store_hash_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/cc_hash_table_map_/debug_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/cc_hash_table_map_/info_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/cc_hash_table_map_/entry_list_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/cc_hash_table_map_/trace_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/cc_hash_table_map_/find_store_hash_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/cc_hash_table_map_/erase_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/cc_hash_table_map_/resize_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/cc_hash_table_map_/cc_ht_map_.hpp: Same.
+	* include/ext/pb_ds/detail/cc_hash_table_map_/debug_no_store_hash_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/cc_hash_table_map_/constructor_destructor_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/cc_hash_table_map_/cond_key_dtor_entry_dealtor.hpp: Same.
+	* include/ext/pb_ds/detail/cc_hash_table_map_/insert_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/cc_hash_table_map_/debug_store_hash_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/cc_hash_table_map_/erase_no_store_hash_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/cc_hash_table_map_/size_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/cc_hash_table_map_/standard_policies.hpp: Same.
+	* include/ext/pb_ds/detail/cc_hash_table_map_/iterators_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/cc_hash_table_map_/resize_no_store_hash_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/typelist_assoc_container.hpp: Same.
+	* include/ext/pb_ds/detail/tree_trace_base.hpp: Same.
+	* include/ext/pb_ds/detail/unordered_iterator: New.
+	* include/ext/pb_ds/detail/unordered_iterator/iterator.hpp: Same.
+	* include/ext/pb_ds/detail/unordered_iterator/const_iterator.hpp: Same.
+	* include/ext/pb_ds/detail/unordered_iterator/point_iterator.hpp: Same.
+	* include/ext/pb_ds/detail/unordered_iterator/const_point_iterator.hpp: Same.
+	* include/ext/pb_ds/detail/typelist.hpp: Same.
+	* include/ext/pb_ds/detail/pat_trie_: New.
+	* include/ext/pb_ds/detail/pat_trie_/r_erase_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/pat_trie_/policy_access_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/pat_trie_/find_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/pat_trie_/child_iterator.hpp: Same.
+	* include/ext/pb_ds/detail/pat_trie_/update_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/pat_trie_/insert_join_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/pat_trie_/split_join_branch_bag.hpp: Same.
+	* include/ext/pb_ds/detail/pat_trie_/constructors_destructor_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/pat_trie_/debug_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/pat_trie_/head.hpp: Same.
+	* include/ext/pb_ds/detail/pat_trie_/const_child_iterator.hpp: Same.
+	* include/ext/pb_ds/detail/pat_trie_/split_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/pat_trie_/traits.hpp: Same.
+	* include/ext/pb_ds/detail/pat_trie_/cond_dtor_entry_dealtor.hpp: Same.
+	* include/ext/pb_ds/detail/pat_trie_/pat_trie_.hpp: Same.
+	* include/ext/pb_ds/detail/pat_trie_/info_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/pat_trie_/leaf.hpp: Same.
+	* include/ext/pb_ds/detail/pat_trie_/trace_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/pat_trie_/rotate_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/pat_trie_/erase_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/pat_trie_/node_base.hpp: Same.
+	* include/ext/pb_ds/detail/pat_trie_/node_metadata_base.hpp: Same.
+	* include/ext/pb_ds/detail/pat_trie_/synth_e_access_traits.hpp: Same.
+	* include/ext/pb_ds/detail/pat_trie_/node_iterators.hpp: Same.
+	* include/ext/pb_ds/detail/pat_trie_/internal_node.hpp: Same.
+	* include/ext/pb_ds/detail/pat_trie_/point_iterators.hpp: Same.
+	* include/ext/pb_ds/detail/pat_trie_/iterators_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/bin_search_tree_: New.
+	* include/ext/pb_ds/detail/bin_search_tree_/policy_access_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/bin_search_tree_/find_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/bin_search_tree_/r_erase_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/bin_search_tree_/constructors_destructor_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/bin_search_tree_/debug_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/bin_search_tree_/cond_dtor_entry_dealtor.hpp: Same.
+	* include/ext/pb_ds/detail/bin_search_tree_/traits.hpp: Same.
+	* include/ext/pb_ds/detail/bin_search_tree_/info_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/bin_search_tree_/rotate_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/bin_search_tree_/erase_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/bin_search_tree_/bin_search_tree_.hpp: Same.
+	* include/ext/pb_ds/detail/bin_search_tree_/cond_key_dtor_entry_dealtor.hpp: Same.
+	* include/ext/pb_ds/detail/bin_search_tree_/insert_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/bin_search_tree_/node_iterators.hpp: Same.
+	* include/ext/pb_ds/detail/bin_search_tree_/point_iterators.hpp: Same.
+	* include/ext/pb_ds/detail/bin_search_tree_/split_join_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/bin_search_tree_/iterators_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/gp_hash_table_map_: New.
+	* include/ext/pb_ds/detail/gp_hash_table_map_/constructor_destructor_no_store_hash_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/gp_hash_table_map_/erase_store_hash_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/gp_hash_table_map_/insert_no_store_hash_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/gp_hash_table_map_/resize_store_hash_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/gp_hash_table_map_/policy_access_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/gp_hash_table_map_/find_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/gp_hash_table_map_/gp_ht_map_.hpp: Same.
+	* include/ext/pb_ds/detail/gp_hash_table_map_/constructor_destructor_store_hash_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/gp_hash_table_map_/insert_store_hash_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/gp_hash_table_map_/debug_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/gp_hash_table_map_/iterator_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/gp_hash_table_map_/info_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/gp_hash_table_map_/find_no_store_hash_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/gp_hash_table_map_/trace_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/gp_hash_table_map_/erase_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/gp_hash_table_map_/find_store_hash_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/gp_hash_table_map_/resize_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/gp_hash_table_map_/debug_no_store_hash_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/gp_hash_table_map_/constructor_destructor_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/gp_hash_table_map_/insert_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/gp_hash_table_map_/debug_store_hash_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/gp_hash_table_map_/erase_no_store_hash_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/gp_hash_table_map_/standard_policies.hpp: Same.
+	* include/ext/pb_ds/detail/gp_hash_table_map_/resize_no_store_hash_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/standard_policies.hpp: Same.
+	* include/ext/pb_ds/detail/typelist: New.
+	* include/ext/pb_ds/detail/typelist/typelist_flatten.hpp: Same.
+	* include/ext/pb_ds/detail/typelist/typelist_contains.hpp: Same.
+	* include/ext/pb_ds/detail/typelist/typelist_typelist_append.hpp: Same.
+	* include/ext/pb_ds/detail/typelist/typelist_apply.hpp: Same.
+	* include/ext/pb_ds/detail/typelist/typelist_filter.hpp: Same.
+	* include/ext/pb_ds/detail/typelist/typelist_append.hpp: Same.
+	* include/ext/pb_ds/detail/typelist/typelist_assoc_container_find.hpp: Same.
+	* include/ext/pb_ds/detail/typelist/typelist_transform.hpp: Same.
+	* include/ext/pb_ds/detail/typelist/typelist_at_index.hpp: Same.
+	* include/ext/pb_ds/detail/tree_policy: New.
+	* include/ext/pb_ds/detail/tree_policy/order_statistics_imp.hpp: Same.
+	* include/ext/pb_ds/detail/tree_policy/node_metadata_selector.hpp: Same.
+	* include/ext/pb_ds/detail/tree_policy/null_node_update_imp.hpp: Same.
+	* include/ext/pb_ds/detail/tree_policy/sample_tree_node_update.hpp: Same.
+	* include/ext/pb_ds/detail/basic_tree_policy: New.
+	* include/ext/pb_ds/detail/basic_tree_policy/basic_tree_policy_base.hpp: Same.
+	* include/ext/pb_ds/detail/basic_tree_policy/null_node_metadata.hpp: Same.
+	* include/ext/pb_ds/detail/basic_tree_policy/traits.hpp: Same.
+	* include/ext/pb_ds/detail/types_traits.hpp: Same.
+	* include/ext/pb_ds/detail/binary_heap_: New.
+	* include/ext/pb_ds/detail/binary_heap_/policy_access_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/binary_heap_/find_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/binary_heap_/const_iterator.hpp: Same.
+	* include/ext/pb_ds/detail/binary_heap_/entry_cmp.hpp: Same.
+	* include/ext/pb_ds/detail/binary_heap_/constructors_destructor_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/binary_heap_/debug_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/binary_heap_/info_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/binary_heap_/const_point_iterator.hpp: Same.
+	* include/ext/pb_ds/detail/binary_heap_/trace_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/binary_heap_/erase_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/binary_heap_/entry_pred.hpp: Same.
+	* include/ext/pb_ds/detail/binary_heap_/insert_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/binary_heap_/resize_policy.hpp: Same.
+	* include/ext/pb_ds/detail/binary_heap_/binary_heap_.hpp: Same.
+	* include/ext/pb_ds/detail/binary_heap_/split_join_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/binary_heap_/iterators_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/trie_policy: New.
+	* include/ext/pb_ds/detail/trie_policy/string_trie_e_access_traits_imp.hpp: Same.
+	* include/ext/pb_ds/detail/trie_policy/order_statistics_imp.hpp: Same.
+	* include/ext/pb_ds/detail/trie_policy/sample_trie_node_update.hpp: Same.
+	* include/ext/pb_ds/detail/trie_policy/trie_policy_base.hpp: Same.
+	* include/ext/pb_ds/detail/trie_policy/prefix_search_node_update_imp.hpp: Same.
+	* include/ext/pb_ds/detail/trie_policy/sample_trie_e_access_traits.hpp: Same.
+	* include/ext/pb_ds/detail/trie_policy/node_metadata_selector.hpp: Same.
+	* include/ext/pb_ds/detail/trie_policy/null_node_update_imp.hpp: Same.
+	* include/ext/pb_ds/detail/cond_dealtor.hpp: Same.
+	* include/ext/pb_ds/detail/priority_queue_base_dispatch.hpp: Same.
+	* include/ext/pb_ds/detail/pairing_heap_: Name.
+	* include/ext/pb_ds/detail/pairing_heap_/erase_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/pairing_heap_/find_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/pairing_heap_/insert_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/pairing_heap_/debug_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/pairing_heap_/constructors_destructor_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/pairing_heap_/pairing_heap_.hpp: Same.
+	* include/ext/pb_ds/detail/pairing_heap_/split_join_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/binomial_heap_: New.
+	* include/ext/pb_ds/detail/binomial_heap_/debug_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/binomial_heap_/constructors_destructor_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/binomial_heap_/binomial_heap_.hpp: Same.
+	* include/ext/pb_ds/detail/constructors_destructor_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/type_utils.hpp: Same.
+	* include/ext/pb_ds/detail/eq_fn: New.
+	* include/ext/pb_ds/detail/eq_fn/hash_eq_fn.hpp: Same.
+	* include/ext/pb_ds/detail/eq_fn/eq_by_less.hpp: Same.
+	* include/ext/pb_ds/detail/basic_types.hpp: Same.
+	* include/ext/pb_ds/detail/list_update_policy: New.
+	* include/ext/pb_ds/detail/list_update_policy/mtf_lu_policy_imp.hpp: Same.
+	* include/ext/pb_ds/detail/list_update_policy/counter_lu_metadata.hpp: Same.
+	* include/ext/pb_ds/detail/list_update_policy/sample_update_policy.hpp: Same.
+	* include/ext/pb_ds/detail/list_update_policy/counter_lu_policy_imp.hpp: Same.
+	* include/ext/pb_ds/detail/thin_heap_: New.
+	* include/ext/pb_ds/detail/thin_heap_/trace_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/thin_heap_/erase_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/thin_heap_/find_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/thin_heap_/thin_heap_.hpp: Same.
+	* include/ext/pb_ds/detail/thin_heap_/insert_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/thin_heap_/debug_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/thin_heap_/constructors_destructor_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/thin_heap_/split_join_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/left_child_next_sibling_heap_: New.
+	* include/ext/pb_ds/detail/left_child_next_sibling_heap_/trace_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/left_child_next_sibling_heap_/erase_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/left_child_next_sibling_heap_/null_metadata.hpp: Same.
+	* include/ext/pb_ds/detail/left_child_next_sibling_heap_/policy_access_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/left_child_next_sibling_heap_/left_child_next_sibling_heap_.hpp: Same.
+	* include/ext/pb_ds/detail/left_child_next_sibling_heap_/insert_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/left_child_next_sibling_heap_/const_iterator.hpp: Same.
+	* include/ext/pb_ds/detail/left_child_next_sibling_heap_/debug_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/left_child_next_sibling_heap_/constructors_destructor_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/left_child_next_sibling_heap_/node.hpp: Same.
+	* include/ext/pb_ds/detail/left_child_next_sibling_heap_/info_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/left_child_next_sibling_heap_/iterators_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/left_child_next_sibling_heap_/const_point_iterator.hpp: Same.
+	* include/ext/pb_ds/detail/ov_tree_map_: New.
+	* include/ext/pb_ds/detail/ov_tree_map_/erase_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/ov_tree_map_/policy_access_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/ov_tree_map_/cond_dtor.hpp: Same.
+	* include/ext/pb_ds/detail/ov_tree_map_/insert_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/ov_tree_map_/ov_tree_map_.hpp: Same.
+	* include/ext/pb_ds/detail/ov_tree_map_/node_iterators.hpp: Same.
+	* include/ext/pb_ds/detail/ov_tree_map_/debug_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/ov_tree_map_/constructors_destructor_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/ov_tree_map_/split_join_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/ov_tree_map_/traits.hpp: Same.
+	* include/ext/pb_ds/detail/ov_tree_map_/info_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/ov_tree_map_/iterators_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/map_debug_base.hpp: Same.
+	* include/ext/pb_ds/detail/hash_fn: New.
+	* include/ext/pb_ds/detail/hash_fn/linear_probe_fn_imp.hpp: Same.
+	* include/ext/pb_ds/detail/hash_fn/mod_based_range_hashing.hpp: Same.
+	* include/ext/pb_ds/detail/hash_fn/ranged_probe_fn.hpp: Same.
+	* include/ext/pb_ds/detail/hash_fn/sample_probe_fn.hpp: Same.
+	* include/ext/pb_ds/detail/hash_fn/direct_mod_range_hashing_imp.hpp: Same.
+	* include/ext/pb_ds/detail/hash_fn/sample_ranged_probe_fn.hpp: Same.
+	* include/ext/pb_ds/detail/hash_fn/quadratic_probe_fn_imp.hpp: Same.
+	* include/ext/pb_ds/detail/hash_fn/sample_range_hashing.hpp: Same.
+	* include/ext/pb_ds/detail/hash_fn/probe_fn_base.hpp: Same.
+	* include/ext/pb_ds/detail/hash_fn/ranged_hash_fn.hpp: Same.
+	* include/ext/pb_ds/detail/hash_fn/mask_based_range_hashing.hpp: Same.
+	* include/ext/pb_ds/detail/hash_fn/sample_ranged_hash_fn.hpp: Same.
+	* include/ext/pb_ds/detail/hash_fn/direct_mask_range_hashing_imp.hpp: Same.
+	* include/ext/pb_ds/detail/splay_tree_: New.
+	* include/ext/pb_ds/detail/splay_tree_/erase_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/splay_tree_/find_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/splay_tree_/insert_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/splay_tree_/debug_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/splay_tree_/constructors_destructor_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/splay_tree_/splay_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/splay_tree_/node.hpp: Same.
+	* include/ext/pb_ds/detail/splay_tree_/split_join_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/splay_tree_/splay_tree_.hpp: Same.
+	* include/ext/pb_ds/detail/splay_tree_/traits.hpp: Same.
+	* include/ext/pb_ds/detail/splay_tree_/info_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/list_update_map_: New.
+	* include/ext/pb_ds/detail/list_update_map_/trace_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/list_update_map_/erase_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/list_update_map_/find_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/list_update_map_/entry_metadata_base.hpp: Same.
+	* include/ext/pb_ds/detail/list_update_map_/lu_map_.hpp: Same.
+	* include/ext/pb_ds/detail/list_update_map_/constructor_destructor_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/list_update_map_/insert_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/list_update_map_/debug_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/list_update_map_/info_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/list_update_map_/iterators_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/rc_binomial_heap_: New.
+	* include/ext/pb_ds/detail/rc_binomial_heap_/trace_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/rc_binomial_heap_/erase_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/rc_binomial_heap_/rc_binomial_heap_.hpp: Same.
+	* include/ext/pb_ds/detail/rc_binomial_heap_/insert_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/rc_binomial_heap_/debug_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/rc_binomial_heap_/constructors_destructor_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/rc_binomial_heap_/rc.hpp: Same.
+	* include/ext/pb_ds/detail/rc_binomial_heap_/split_join_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/rb_tree_map_: New.
+	* include/ext/pb_ds/detail/rb_tree_map_/erase_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/rb_tree_map_/find_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/rb_tree_map_/insert_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/rb_tree_map_/rb_tree_.hpp: Same.
+	* include/ext/pb_ds/detail/rb_tree_map_/debug_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/rb_tree_map_/constructors_destructor_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/rb_tree_map_/node.hpp: Same.
+	* include/ext/pb_ds/detail/rb_tree_map_/split_join_fn_imps.hpp: Same.
+	* include/ext/pb_ds/detail/rb_tree_map_/traits.hpp: Same.
+	* include/ext/pb_ds/detail/rb_tree_map_/info_fn_imps.hpp: Same.
+	* include/ext/pb_ds/list_update_policy.hpp: Same.
+	* include/ext/pb_ds/exception.hpp: Same.
+	* include/ext/pb_ds/tree_policy.hpp: Same.
+	* include/ext/pb_ds/tag_and_trait.hpp: Same.
+	* include/ext/pb_ds/hash_policy.hpp: Same.
+	* include/ext/pb_ds/trie_policy.hpp: Same.
+	* include/ext/pb_ds/priority_queue.hpp: Same.
+
+	* docs/html/ext/pb_ds: New.
+	* docs/html/ext/pb_ds/container_tag.html: Same.
+	* docs/html/ext/pb_ds/trivial_iterator_tag.html: Same.
+	* docs/html/ext/pb_ds/tree_text_lor_find_timing_test_local.png
+	* docs/html/ext/pb_ds/sample_trie_e_access_traits.html: Same.
+	* docs/html/ext/pb_ds/gp_hash_table.html: Same.
+	* docs/html/ext/pb_ds/priority_queue_tag_cd.svg
+	* docs/html/ext/pb_ds/container_cd.svg
+	* docs/html/ext/pb_ds/linear_probe_fn.html: Same.
+	* docs/html/ext/pb_ds/hash_random_int_erase_mem_usage_test_local.png
+	* docs/html/ext/pb_ds/quadratic_probe_fn.html: Same.
+	* docs/html/ext/pb_ds/assoc_regression_tests.html: Same.
+	* docs/html/ext/pb_ds/tree_tag.html: Same.
+	* docs/html/ext/pb_ds/hash_random_int_erase_mem_usage_test.html: Same.
+	* docs/html/ext/pb_ds/interface.html: Same.
+	* docs/html/ext/pb_ds/hash_zlob_random_int_find_timing_test_msvc.png
+	* docs/html/ext/pb_ds/hash_random_int_subscript_find_timing_test.html: Same.
+	* docs/html/ext/pb_ds/lu_based_containers.html: Same.
+	* docs/html/ext/pb_ds/embedded_lists_3.png
+	* docs/html/ext/pb_ds/tree_text_find_find_timing_test.html: Same.
+	* docs/html/ext/pb_ds/multimap_text_insert_mem_usage_test_small_s2p_hash_local.png
+	* docs/html/ext/pb_ds/assoc_performance_tests.html: Same.
+	* docs/html/ext/pb_ds/list_update.html: Same.
+	* docs/html/ext/pb_ds/priority_queue_random_int_push_pop_timing_test_gcc.png
+	* docs/html/ext/pb_ds/tree_text_insert_timing_test_pat_trie_local.png
+	* docs/html/ext/pb_ds/point_iterators_range_ops_1.png
+	* docs/html/ext/pb_ds/gp_hash_random_int_subscript_timing_test_insert_msvc.png
+	* docs/html/ext/pb_ds/hash_zlob_random_int_find_timing_test_gcc.png
+	* docs/html/ext/pb_ds/text_find_timing_test_tree_like_msvc.png
+	* docs/html/ext/pb_ds/multimap_text_insert_mem_usage_test_small_s2p_tree_local.png
+	* docs/html/ext/pb_ds/priority_queue_text_modify_down_timing_test_local.png
+	* docs/html/ext/pb_ds/tree_text_insert_timing_test_pat_trie_msvc.png
+	* docs/html/ext/pb_ds/priority_queue_text_modify_down_timing_test.html: Same.
+	* docs/html/ext/pb_ds/move_to_front_lu_policy.html: Same.
+	* docs/html/ext/pb_ds/multimap_text_find_timing_test_large_s2p_hash_gcc.png
+	* docs/html/ext/pb_ds/hash_random_int_find_find_timing_test.html: Same.
+	* docs/html/ext/pb_ds/string_trie_e_access_traits.html: Same.
+	* docs/html/ext/pb_ds/prerequisites.html: Same.
+	* docs/html/ext/pb_ds/gp_hash_tag.html: Same.
+	* docs/html/ext/pb_ds/priority_queue_tag_cd.png
+	* docs/html/ext/pb_ds/container_cd.png
+	* docs/html/ext/pb_ds/priority_queue_text_join_timing_test_gcc.png
+	* docs/html/ext/pb_ds/container_base.html: Same.
+	* docs/html/ext/pb_ds/multimap_text_insert_timing_test_small_s2p_hash_msvc.png
+	* docs/html/ext/pb_ds/tree_random_int_find_find_timing_test.html: Same.
+	* docs/html/ext/pb_ds/binary_priority_queue_random_int_push_timing_test_msvc.png
+	* docs/html/ext/pb_ds/gp_hash_random_int_subscript_timing_test_find_local.png
+	* docs/html/ext/pb_ds/gp_hash_random_int_subscript_timing_test_find_gcc.png
+	* docs/html/ext/pb_ds/priority_queue_text_push_pop_timing_test_msvc.png
+	* docs/html/ext/pb_ds/random_int_find_find_timing_test_tree_msvc.png
+	* docs/html/ext/pb_ds/text_find_timing_test_hash_local.png
+	* docs/html/ext/pb_ds/tree_text_insert_timing_test_node_tree_msvc.png
+	* docs/html/ext/pb_ds/ov_tree_tag.html: Same.
+	* docs/html/ext/pb_ds/multimap_text_insert_timing_test_small_s2p_hash_local.png
+	* docs/html/ext/pb_ds/multimap_text_insert_timing_test_large_s2p_hash_msvc.png
+	* docs/html/ext/pb_ds/priority_queue_text_pop_mem_usage_test_msvc.png
+	* docs/html/ext/pb_ds/priority_queue_text_modify_down_timing_test_pairing_thin_msvc.png
+	* docs/html/ext/pb_ds/list_update_tag.html: Same.
+	* docs/html/ext/pb_ds/balls_and_bins.png
+	* docs/html/ext/pb_ds/multimap_text_insert_timing_test_small_s2p_tree_local.png
+	* docs/html/ext/pb_ds/disclaimer.html: Same.
+	* docs/html/ext/pb_ds/insert_error.html: Same.
+	* docs/html/ext/pb_ds/multimap_text_find_timing_test_small_s2p_hash_gcc.png
+	* docs/html/ext/pb_ds/ccgp_hash_random_int_subscript_timing_test_insert_gcc.png
+	* docs/html/ext/pb_ds/examples.html: Same.
+	* docs/html/ext/pb_ds/multimap_text_insert_timing_test_small.html: Same.
+	* docs/html/ext/pb_ds/pairing_priority_queue_text_push_pop_timing_test_gcc.png
+	* docs/html/ext/pb_ds/sample_probe_fn.html: Same.
+	* docs/html/ext/pb_ds/multimap_text_insert_mem_usage_test_large_s2p_hash_local.png
+	* docs/html/ext/pb_ds/priority_queue_text_push_timing_test.html: Same.
+	* docs/html/ext/pb_ds/priority_queue_random_int_push_timing_test_gcc.png
+	* docs/html/ext/pb_ds/null_mapped_type.html: Same.
+	* docs/html/ext/pb_ds/binary_priority_queue_random_int_push_timing_test_gcc.png
+	* docs/html/ext/pb_ds/tree_order_statistics_timing_test_gcc.png
+	* docs/html/ext/pb_ds/associative_container_tag.html: Same.
+	* docs/html/ext/pb_ds/multimap_text_insert_mem_usage_test_large_s2p_tree_local.png
+	* docs/html/ext/pb_ds/design.html: Same.
+	* docs/html/ext/pb_ds/cc_hash_max_collision_check_resize_trigger.html: Same.
+	* docs/html/ext/pb_ds/pairing_heap_tag.html: Same.
+	* docs/html/ext/pb_ds/tree_text_lor_find_timing_test_gcc.png
+	* docs/html/ext/pb_ds/references.html: Same.
+	* docs/html/ext/pb_ds/tree_order_statistics_timing_test_msvc.png
+	* docs/html/ext/pb_ds/hash_load_check_resize_trigger.html: Same.
+	* docs/html/ext/pb_ds/priority_queue_text_pop_mem_usage_test_gcc.png
+	* docs/html/ext/pb_ds/priority_queue_text_modify_down_timing_test_pairing_thin_gcc.png
+	* docs/html/ext/pb_ds/hash_random_int_erase_mem_usage_test_gcc.png
+	* docs/html/ext/pb_ds/pq_different_underlying_dss.png
+	* docs/html/ext/pb_ds/insert_resize_sequence_diagram1.png
+	* docs/html/ext/pb_ds/pq_regression_tests.html: Same.
+	* docs/html/ext/pb_ds/sample_tree_node_update.html: Same.
+	* docs/html/ext/pb_ds/invalidation_guarantee_erase.png
+	* docs/html/ext/pb_ds/basic_invalidation_guarantee.html: Same.
+	* docs/html/ext/pb_ds/multimap_text_insert_timing_test_large_s2p_hash_local.png
+	* docs/html/ext/pb_ds/multimap_text_insert_timing_test_large_s2p_hash_gcc.png
+	* docs/html/ext/pb_ds/hash_zlob_random_int_find_timing_test_local.png
+	* docs/html/ext/pb_ds/point_iterators_range_ops_2.png
+	* docs/html/ext/pb_ds/null_probe_fn.html: Same.
+	* docs/html/ext/pb_ds/hash_prime_size_policy.html: Same.
+	* docs/html/ext/pb_ds/multimap_text_insert_mem_usage_test_small_s2p_hash_msvc.png
+	* docs/html/ext/pb_ds/priority_queue_text_modify_down_timing_test_gcc.png
+	* docs/html/ext/pb_ds/multimap_text_insert_timing_test_large_s2p_tree_local.png
+	* docs/html/ext/pb_ds/binary_priority_queue_random_int_push_timing_test_local.png
+	* docs/html/ext/pb_ds/multimap_text_insert_mem_usage_test_large_s2p_hash_msvc.png
+	* docs/html/ext/pb_ds/multimap_text_insert_mem_usage_test_large_s2p_tree_gcc.png
+	* docs/html/ext/pb_ds/multimap_text_find_timing_test_large.html: Same.
+	* docs/html/ext/pb_ds/sample_resize_policy.html: Same.
+	* docs/html/ext/pb_ds/binomial_heap_tag.html: Same.
+	* docs/html/ext/pb_ds/priority_queue_text_pop_mem_usage_test_local.png
+	* docs/html/ext/pb_ds/priority_queue_text_modify_down_timing_test_pairing_thin_local.png
+	* docs/html/ext/pb_ds/tree_text_lor_find_find_timing_test.html: Same.
+	* docs/html/ext/pb_ds/priority_queue_text_join_timing_test_msvc.png
+	* docs/html/ext/pb_ds/trie_based_containers.html: Same.
+	* docs/html/ext/pb_ds/cc_hash_random_int_subscript_timing_test_insert_gcc.png
+	* docs/html/ext/pb_ds/tree_split_join_timing_test_local.png
+	* docs/html/ext/pb_ds/text_find_timing_test_hash_gcc.png
+	* docs/html/ext/pb_ds/motivation.html: Same.
+	* docs/html/ext/pb_ds/multimap_text_insert_timing_test_small_s2p_tree_msvc.png
+	* docs/html/ext/pb_ds/tree_split_join_timing_test_gcc.png
+	* docs/html/ext/pb_ds/tree.html: Same.
+	* docs/html/ext/pb_ds/multimap_text_insert_timing_test_small_s2p_hash_gcc.png
+	* docs/html/ext/pb_ds/cc_hash_random_int_subscript_timing_test_insert_msvc.png
+	* docs/html/ext/pb_ds/invalidation_guarantee_cd.png
+	* docs/html/ext/pb_ds/tutorial.html: Same.
+	* docs/html/ext/pb_ds/null_trie_node_update.html: Same.
+	* docs/html/ext/pb_ds/priority_queue_text_modify_up_timing_test_gcc.png
+	* docs/html/ext/pb_ds/multimap_text_insert_timing_test_large_s2p_tree_msvc.png
+	* docs/html/ext/pb_ds/ccgp_hash_random_int_subscript_timing_test_insert_local.png
+	* docs/html/ext/pb_ds/point_iterators_cd.png
+	* docs/html/ext/pb_ds/multimap_text_find_timing_test_small_s2p_hash_local.png
+	* docs/html/ext/pb_ds/priority_queue_random_int_push_pop_timing_test_local.png
+	* docs/html/ext/pb_ds/rb_tree_tag.html: Same.
+	* docs/html/ext/pb_ds/cc_hash_random_int_subscript_timing_test_find_msvc.png
+	* docs/html/ext/pb_ds/pairing_priority_queue_text_push_timing_test_msvc.png
+	* docs/html/ext/pb_ds/tree_text_insert_timing_test_pat_trie_gcc.png
+	* docs/html/ext/pb_ds/exceptions.html: Same.
+	* docs/html/ext/pb_ds/priority_queue_text_modify_up_timing_test_msvc.png
+	* docs/html/ext/pb_ds/multimap_text_find_timing_test_small_s2p_tree_local.png
+	* docs/html/ext/pb_ds/hash_policy_cd.png
+	* docs/html/ext/pb_ds/multimap_text_insert_mem_usage_test_small_s2p_tree_gcc.png
+	* docs/html/ext/pb_ds/multimap_text_insert_mem_usage_test_small.html: Same.
+	* docs/html/ext/pb_ds/ds_gen.html: Same.
+	* docs/html/ext/pb_ds/hash_exponential_size_policy.html: Same.
+	* docs/html/ext/pb_ds/gp_hash_random_int_subscript_timing_test_insert_local.png
+	* docs/html/ext/pb_ds/hash_random_int_erase_mem_usage_test_msvc.png
+	* docs/html/ext/pb_ds/index.html: Same.
+	* docs/html/ext/pb_ds/binary_heap_tag.html: Same.
+	* docs/html/ext/pb_ds/basic_hash_tag.html: Same.
+	* docs/html/ext/pb_ds/trie_order_statistics_node_update.html: Same.
+	* docs/html/ext/pb_ds/sample_resize_trigger.html: Same.
+	* docs/html/ext/pb_ds/priority_queue_text_push_timing_test_local.png
+	* docs/html/ext/pb_ds/hash_text_find_find_timing_test.html: Same.
+	* docs/html/ext/pb_ds/tree_text_insert_timing_test.html: Same.
+	* docs/html/ext/pb_ds/trie_tag.html: Same.
+	* docs/html/ext/pb_ds/cc_hash_random_int_subscript_timing_test_find_local.png
+	* docs/html/ext/pb_ds/pq_tests.html: Same.
+	* docs/html/ext/pb_ds/insert_resize_sequence_diagram2.png
+	* docs/html/ext/pb_ds/node_invariant_invalidations.png
+	* docs/html/ext/pb_ds/priority_queue_text_modify_down_timing_test_msvc.png
+	* docs/html/ext/pb_ds/resize_policy_cd.png
+	* docs/html/ext/pb_ds/embedded_lists_1.png
+	* docs/html/ext/pb_ds/hash_ranged_hash_range_hashing_fns.png
+	* docs/html/ext/pb_ds/null_lu_metadata.html: Same.
+	* docs/html/ext/pb_ds/tree_order_statistics_timing_test.html: Same.
+	* docs/html/ext/pb_ds/trie_prefix_search_node_update.html: Same.
+	* docs/html/ext/pb_ds/hash_range_hashing_seq_diagram.png
+	* docs/html/ext/pb_ds/point_invalidation_guarantee.html: Same.
+	* docs/html/ext/pb_ds/direct_mod_range_hashing.html: Same.
+	* docs/html/ext/pb_ds/tree_text_insert_timing_test_vector_tree_local.png
+	* docs/html/ext/pb_ds/priority_queue_random_int_push_pop_timing_test_msvc.png
+	* docs/html/ext/pb_ds/misc.html: Same.
+	* docs/html/ext/pb_ds/multimap_text_find_timing_test_large_s2p_hash_local.png
+	* docs/html/ext/pb_ds/counter_lu_policy.html: Same.
+	* docs/html/ext/pb_ds/different_underlying_dss.png
+	* docs/html/ext/pb_ds/restoring_node_invariants.png
+	* docs/html/ext/pb_ds/multimap_text_insert_timing_test_large.html: Same.
+	* docs/html/ext/pb_ds/pairing_priority_queue_text_push_timing_test_local.png
+	* docs/html/ext/pb_ds/sample_update_policy.html: Same.
+	* docs/html/ext/pb_ds/pairing_priority_queue_text_push_timing_test_gcc.png
+	* docs/html/ext/pb_ds/tree_order_statistics_timing_test_local.png
+	* docs/html/ext/pb_ds/multimap_text_insert_mem_usage_test_small_s2p_tree_msvc.png
+	* docs/html/ext/pb_ds/simple_list.png
+	* docs/html/ext/pb_ds/text_find_timing_test_hash_msvc.png
+	* docs/html/ext/pb_ds/assoc_examples.html: Same.
+	* docs/html/ext/pb_ds/priority_queue_text_push_pop_timing_test_local.png
+	* docs/html/ext/pb_ds/hash_based_containers.html: Same.
+	* docs/html/ext/pb_ds/text_find_timing_test_tree_like_local.png
+	* docs/html/ext/pb_ds/multimap_text_find_timing_test_large_s2p_tree_local.png
+	* docs/html/ext/pb_ds/multimap_text_find_timing_test_large_s2p_tree_gcc.png
+	* docs/html/ext/pb_ds/tree_node_iterator.html: Same.
+	* docs/html/ext/pb_ds/priority_queue_text_modify_up_timing_test_pairing_thin_msvc.png
+	* docs/html/ext/pb_ds/trie_node_iterator.html: Same.
+	* docs/html/ext/pb_ds/tree_based_containers.html: Same.
+	* docs/html/ext/pb_ds/hash_random_int_subscript_insert_timing_test.html: Same.
+	* docs/html/ext/pb_ds/multimap_text_insert_mem_usage_test_large_s2p_tree_msvc.png
+	* docs/html/ext/pb_ds/ccgp_hash_random_int_subscript_timing_test_insert_msvc.png
+	* docs/html/ext/pb_ds/multimap_text_find_timing_test_small_s2p_hash_msvc.png
+	* docs/html/ext/pb_ds/priority_queue_text_push_timing_test_gcc.png
+	* docs/html/ext/pb_ds/rationale_null_node_updator.png
+	* docs/html/ext/pb_ds/priority_queue_text_modify_up_timing_test_pairing_thin_local.png
+	* docs/html/ext/pb_ds/lu.png
+	* docs/html/ext/pb_ds/assoc_container_traits.html: Same.
+	* docs/html/ext/pb_ds/gp_hash_random_int_find_timing_test_msvc.png
+	* docs/html/ext/pb_ds/assoc_design.html: Same.
+	* docs/html/ext/pb_ds/splay_tree_tag.html: Same.
+	* docs/html/ext/pb_ds/cc_hash_random_int_subscript_timing_test_find_gcc.png
+	* docs/html/ext/pb_ds/priority_queue_random_int_push_timing_test.html: Same.
+	* docs/html/ext/pb_ds/assoc_container_tag_cd.svg
+	* docs/html/ext/pb_ds/resize_error.html: Same.
+	* docs/html/ext/pb_ds/multimap_text_find_timing_test_large_s2p_hash_msvc.png
+	* docs/html/ext/pb_ds/tree_text_insert_timing_test_node_tree_gcc.png
+	* docs/html/ext/pb_ds/priority_queue_text_join_timing_test.html: Same.
+	* docs/html/ext/pb_ds/basic_tree_assoc_container_const_node_iterator.html: Same.
+	* docs/html/ext/pb_ds/gp_hash_random_int_find_timing_test_gcc.png
+	* docs/html/ext/pb_ds/trie_const_node_iterator.html: Same.
+	* docs/html/ext/pb_ds/hash_zlob_random_int_find_find_timing_test.html: Same.
+	* docs/html/ext/pb_ds/multimap_text_find_timing_test_small_s2p_tree_gcc.png
+	* docs/html/ext/pb_ds/sample_size_policy.html: Same.
+	* docs/html/ext/pb_ds/tree_text_insert_timing_test_vector_tree_gcc.png
+	* docs/html/ext/pb_ds/cc_hash_table.html: Same.
+	* docs/html/ext/pb_ds/node_invariants.png
+	* docs/html/ext/pb_ds/tree_split_join_timing_test_msvc.png
+	* docs/html/ext/pb_ds/priority_queue_text_modify_up_timing_test.html: Same.
+	* docs/html/ext/pb_ds/tree_order_statistics_node_update.html: Same.
+	* docs/html/ext/pb_ds/cc_hash_random_int_find_timing_test_msvc.png
+	* docs/html/ext/pb_ds/cc_hash_random_int_subscript_timing_test_insert_local.png
+	* docs/html/ext/pb_ds/priority_queue.html: Same.
+	* docs/html/ext/pb_ds/assoc_tests.html: Same.
+	* docs/html/ext/pb_ds/assoc_container_tag_cd.png
+	* docs/html/ext/pb_ds/basic_hash_table.html: Same.
+	* docs/html/ext/pb_ds/basic_tree_tag.html: Same.
+	* docs/html/ext/pb_ds/tree_split_join_timing_test.html: Same.
+	* docs/html/ext/pb_ds/priority_queue_text_modify_up_timing_test_local.png
+	* docs/html/ext/pb_ds/insert_resize_sequence_diagram3.png
+	* docs/html/ext/pb_ds/embedded_lists_2.png
+	* docs/html/ext/pb_ds/random_int_find_find_timing_test_tree_local.png
+	* docs/html/ext/pb_ds/sample_ranged_probe_fn.html: Same.
+	* docs/html/ext/pb_ds/random_int_find_find_timing_test_tree_gcc.png
+	* docs/html/ext/pb_ds/sample_trie_node_update.html: Same.
+	* docs/html/ext/pb_ds/introduction.html: Same.
+	* docs/html/ext/pb_ds/pq_performance_tests.html: Same.
+	* docs/html/ext/pb_ds/pat_trie.png
+	* docs/html/ext/pb_ds/range_invalidation_guarantee.html: Same.
+	* docs/html/ext/pb_ds/contact.html: Same.
+	* docs/html/ext/pb_ds/sample_range_hashing.html: Same.
+	* docs/html/ext/pb_ds/priority_queue_random_int_push_timing_test_local.png
+	* docs/html/ext/pb_ds/multimap_text_insert_mem_usage_test_large_s2p_hash_gcc.png
+	* docs/html/ext/pb_ds/update_seq_diagram.png
+	* docs/html/ext/pb_ds/multimap_text_insert_timing_test_large_s2p_tree_gcc.png
+	* docs/html/ext/pb_ds/direct_mask_range_hashing.html: Same.
+	* docs/html/ext/pb_ds/tests.html: Same.
+	* docs/html/ext/pb_ds/cc_hash_random_int_find_timing_test_gcc.png
+	* docs/html/ext/pb_ds/tree_node_updator_policy_cd.png
+	* docs/html/ext/pb_ds/text_find_timing_test_tree_like_gcc.png
+	* docs/html/ext/pb_ds/multimap_text_insert_mem_usage_test_large.html: Same.
+	* docs/html/ext/pb_ds/trie_node_updator_policy_cd.png
+	* docs/html/ext/pb_ds/priority_queue_random_int_push_timing_test_msvc.png
+	* docs/html/ext/pb_ds/concepts.html: Same.
+	* docs/html/ext/pb_ds/pq_examples.html: Same.
+	* docs/html/ext/pb_ds/priority_queue_tag.html: Same.
+	* docs/html/ext/pb_ds/priority_queue_random_int_push_pop_timing_test.html: Same.
+	* docs/html/ext/pb_ds/update_policy_cd.png
+	* docs/html/ext/pb_ds/thin_heap_tag.html: Same.
+	* docs/html/ext/pb_ds/pairing_priority_queue_text_push_pop_timing_test_msvc.png
+	* docs/html/ext/pb_ds/basic_tree.html: Same.
+	* docs/html/ext/pb_ds/null_hash_fn.html: Same.
+	* docs/html/ext/pb_ds/null_tree_node_update.html: Same.
+	* docs/html/ext/pb_ds/priority_queue_text_modify_up_timing_test_pairing_thin_gcc.png
+	* docs/html/ext/pb_ds/trie.html: Same.
+	* docs/html/ext/pb_ds/multimap_text_find_timing_test_small_s2p_tree_msvc.png
+	* docs/html/ext/pb_ds/rc_binomial_heap_tag.html: Same.
+	* docs/html/ext/pb_ds/priority_queue_text_push_timing_test_msvc.png
+	* docs/html/ext/pb_ds/pq_container_traits.html: Same.
+	* docs/html/ext/pb_ds/pq_design.html: Same.
+	* docs/html/ext/pb_ds/checked_by_tidy.gif
+	* docs/html/ext/pb_ds/tree_text_insert_timing_test_node_tree_local.png
+	* docs/html/ext/pb_ds/multimap_text_insert_mem_usage_test_small_s2p_hash_gcc.png
+	* docs/html/ext/pb_ds/priority_queue_text_push_pop_timing_test.html: Same.
+	* docs/html/ext/pb_ds/multimap_text_insert_timing_test_small_s2p_tree_gcc.png
+	* docs/html/ext/pb_ds/pairing_priority_queue_text_push_pop_timing_test_local.png
+	* docs/html/ext/pb_ds/acks.html: Same.
+	* docs/html/ext/pb_ds/gp_hash_random_int_find_timing_test_local.png
+	* docs/html/ext/pb_ds/cc_hash_tag.html: Same.
+	* docs/html/ext/pb_ds/sample_ranged_hash_fn.html: Same.
+	* docs/html/ext/pb_ds/multimap_text_find_timing_test_large_s2p_tree_msvc.png
+	* docs/html/ext/pb_ds/priority_queue_text_pop_mem_usage_test.html: Same.
+	* docs/html/ext/pb_ds/multimap_text_find_timing_test_small.html: Same.
+	* docs/html/ext/pb_ds/tree_text_lor_find_timing_test_msvc.png
+	* docs/html/ext/pb_ds/hash_range_hashing_seq_diagram2.png
+	* docs/html/ext/pb_ds/gp_hash_random_int_subscript_timing_test_find_msvc.png
+	* docs/html/ext/pb_ds/PythonPoweredSmall.gif
+	* docs/html/ext/pb_ds/cc_hash_random_int_find_timing_test_local.png
+	* docs/html/ext/pb_ds/pat_trie_tag.html: Same.
+	* docs/html/ext/pb_ds/hash_standard_resize_policy.html: Same.
+	* docs/html/ext/pb_ds/tree_text_insert_timing_test_vector_tree_msvc.png
+	* docs/html/ext/pb_ds/gp_hash_random_int_subscript_timing_test_insert_gcc.png
+	* docs/html/ext/pb_ds/join_error.html: Same.
+	* docs/html/ext/pb_ds/priority_queue_text_push_pop_timing_test_gcc.png
+	* docs/html/ext/pb_ds/priority_queue_text_join_timing_test_local.png
+
+	* testsuite/ext/pb_ds: New.
+	* testsuite/ext/pb_ds/regression: New.
+	* testsuite/ext/pb_ds/regression/trie_data_map_rand.cc: Same.
+	* testsuite/ext/pb_ds/regression/hash_data_map_rand.cc: Same.
+	* testsuite/ext/pb_ds/regression/associative_containers.cc: Same.
+	* testsuite/ext/pb_ds/regression/list_update_no_data_map_rand.cc: Same.
+	* testsuite/ext/pb_ds/regression/tree_no_data_map_rand.cc: Same.
+	* testsuite/ext/pb_ds/regression/list_update_data_map_rand.cc: Same.
+	* testsuite/ext/pb_ds/regression/priority_queues.cc: Same.
+	* testsuite/ext/pb_ds/regression/hash_no_data_map_rand.cc: Same.
+	* testsuite/ext/pb_ds/regression/priority_queue_rand.cc: Same.
+	* testsuite/ext/pb_ds/regression/trie_no_data_map_rand.cc: Same.
+	* testsuite/ext/pb_ds/regression/tree_data_map_rand.cc: Same.
+	* testsuite/ext/pb_ds/example: New.
+	* testsuite/ext/pb_ds/example/hash_shift_mask.cc: Same.
+	* testsuite/ext/pb_ds/example/basic_set.cc: Same.
+	* testsuite/ext/pb_ds/example/hash_illegal_resize.cc: Same.
+	* testsuite/ext/pb_ds/example/hash_resize_neg.cc: Same.
+	* testsuite/ext/pb_ds/example/store_hash.cc: Same.
+	* testsuite/ext/pb_ds/example/assoc_container_traits.cc: Same.
+	* testsuite/ext/pb_ds/example/hash_load_set_change.cc: Same.
+	* testsuite/ext/pb_ds/example/ranged_hash.cc: Same.
+	* testsuite/ext/pb_ds/example/hash_resize.cc: Same.
+	* testsuite/ext/pb_ds/example/tree_order_statistics.cc: Same.
+	* testsuite/ext/pb_ds/example/trie_prefix_search.cc: Same.
+	* testsuite/ext/pb_ds/example/basic_multiset.cc: Same.
+	* testsuite/ext/pb_ds/example/priority_queue_xref.cc: Same.
+	* testsuite/ext/pb_ds/example/hash_find_neg.cc: Same.
+	* testsuite/ext/pb_ds/example/erase_if.cc: Same.
+	* testsuite/ext/pb_ds/example/priority_queue_container_traits.cc: Same.
+	* testsuite/ext/pb_ds/example/tree_join.cc: Same.
+	* testsuite/ext/pb_ds/example/basic_map.cc: Same.
+	* testsuite/ext/pb_ds/example/trie_split.cc: Same.
+	* testsuite/ext/pb_ds/example/priority_queue_split_join.cc: Same.
+	* testsuite/ext/pb_ds/example/priority_queue_dijkstra.cc: Same.
+	* testsuite/ext/pb_ds/example/priority_queue_erase_if.cc: Same.
+	* testsuite/ext/pb_ds/example/hash_mod.cc: Same.
+	* testsuite/ext/pb_ds/example/tree_order_statistics_join.cc: Same.
+	* testsuite/ext/pb_ds/example/trie_dna.cc: Same.
+	* testsuite/ext/pb_ds/example/hash_initial_size.cc: Same.
+	* testsuite/ext/pb_ds/example/basic_priority_queue.cc: Same.
+	* testsuite/ext/pb_ds/example/tree_intervals.cc: Same.
+	* testsuite/ext/pb_ds/example/basic_multimap.cc: Same.
+	* testsuite/performance/ext: New.
+	* testsuite/performance/ext/pb_ds: New.
+	* testsuite/performance/ext/pb_ds/multimap_text_find_timing_small.cc: Same.
+	* testsuite/performance/ext/pb_ds/text_find_timing.cc: Same.
+	* testsuite/performance/ext/pb_ds/hash_random_int_erase_mem_usage.cc: Same.
+	* testsuite/performance/ext/pb_ds/tree_text_insert_timing.cc: Same.
+	* testsuite/performance/ext/pb_ds/priority_queue_text_modify_down_timing.cc: Same.
+	* testsuite/performance/ext/pb_ds/random_int_subscript_find_timing.cc: Same.
+	* testsuite/performance/ext/pb_ds/priority_queue_text_push_timing.cc: Same.
+	* testsuite/performance/ext/pb_ds/tree_split_join_timing.cc: Same.
+	* testsuite/performance/ext/pb_ds/random_int_find_timing.cc: Same.
+	* testsuite/performance/ext/pb_ds/multimap_text_insert_timing_large.cc: Same.
+	* testsuite/performance/ext/pb_ds/multimap_text_insert_mem_usage.hpp: Same.
+	* testsuite/performance/ext/pb_ds/priority_queue_random_int_push_timing.cc: Same.
+	* testsuite/performance/ext/pb_ds/multimap_text_find_timing.hpp: Same.
+	* testsuite/performance/ext/pb_ds/priority_queue_text_modify_timing.hpp: Same.
+	* testsuite/performance/ext/pb_ds/tree_order_statistics_timing.cc: Same.
+	* testsuite/performance/ext/pb_ds/priority_queue_text_modify_up_timing.cc: Same.
+	* testsuite/performance/ext/pb_ds/multimap_text_insert_mem_usage_large.cc: Same.
+	* testsuite/performance/ext/pb_ds/priority_queue_text_push_pop_timing.cc: Same.
+	* testsuite/performance/ext/pb_ds/multimap_text_find_timing_large.cc: Same.
+	* testsuite/performance/ext/pb_ds/priority_queue_text_join_timing.cc: Same.
+	* testsuite/performance/ext/pb_ds/multimap_text_insert_timing_small.cc: Same.
+	* testsuite/performance/ext/pb_ds/priority_queue_random_int_push_pop_timing.cc: Same.
+	* testsuite/performance/ext/pb_ds/random_int_subscript_insert_timing.cc: Same.
+	* testsuite/performance/ext/pb_ds/tree_text_lor_find_timing.cc: Same.
+	* testsuite/performance/ext/pb_ds/priority_queue_text_pop_mem_usage.cc: Same.
+	* testsuite/performance/ext/pb_ds/multimap_text_insert_timing.hpp: Same.
+	* testsuite/performance/ext/pb_ds/hash_zlob_random_int_find_timing.cc: Same.
+	* testsuite/performance/ext/pb_ds/multimap_text_insert_mem_usage_small.cc: Same.
+	* testsuite/data/make_graph_test_infos.xml: Same.
+	* testsuite/data/thirty_years_among_the_dead_preproc.txt: New.
+	* testsuite/data/make_graph_htmls.xml: Same.
+	* testsuite/util/regression: New.
+	* testsuite/util/regression/trait: New.
+	* testsuite/util/regression/trait/priority_queue: New.
+	* testsuite/util/regression/trait/priority_queue/trait.hpp: Same.
+	* testsuite/util/regression/trait/erase_if_fn.hpp: Same.
+	* testsuite/util/regression/trait/assoc: New.
+	* testsuite/util/regression/trait/assoc/native_type_trait.hpp: Same.
+	* testsuite/util/regression/trait/assoc/node_update_trait.hpp: Same.
+	* testsuite/util/regression/trait/assoc/get_set_load_trait.hpp: Same.
+	* testsuite/util/regression/trait/assoc/get_set_loads_trait.hpp: Same.
+	* testsuite/util/regression/trait/assoc/trait.hpp: Same.
+	* testsuite/util/regression/trait/assoc/type_trait.hpp: Same.
+	* testsuite/util/regression/trait/assoc/resize_trait.hpp: Same.
+	* testsuite/util/regression/trait/assoc/to_string.hpp: Same.
+	* testsuite/util/regression/rand: New.
+	* testsuite/util/regression/rand/priority_queue: New.
+	* testsuite/util/regression/rand/priority_queue/detail: New.
+	* testsuite/util/regression/rand/priority_queue/detail/erase_fn_imps.hpp: Same.
+	* testsuite/util/regression/rand/priority_queue/detail/cmp_fn_imps.hpp: Same.
+	* testsuite/util/regression/rand/priority_queue/detail/policy_access_fn_imps.hpp: Same.
+	* testsuite/util/regression/rand/priority_queue/detail/defs_fn_imps.hpp: Same.
+	* testsuite/util/regression/rand/priority_queue/detail/it_conversion_fn_imps.hpp: Same.
+	* testsuite/util/regression/rand/priority_queue/detail/constructor_destructor_fn_imps.hpp: Same.
+	* testsuite/util/regression/rand/priority_queue/detail/diagnostic_fn_imps.hpp: Same.
+	* testsuite/util/regression/rand/priority_queue/detail/insert_fn_imps.hpp: Same.
+	* testsuite/util/regression/rand/priority_queue/detail/clear_fn_imps.hpp: Same.
+	* testsuite/util/regression/rand/priority_queue/detail/modify_fn_imps.hpp: Same.
+	* testsuite/util/regression/rand/priority_queue/detail/split_join_fn_imps.hpp: Same.
+	* testsuite/util/regression/rand/priority_queue/detail/operator_fn_imps.hpp: Same.
+	* testsuite/util/regression/rand/priority_queue/rand_regression_test.hpp: Same.
+	* testsuite/util/regression/rand/priority_queue/container_rand_regression_test.hpp: Same.
+	* testsuite/util/regression/rand/io: New.
+	* testsuite/util/regression/rand/io/priority_queue: New.
+	* testsuite/util/regression/rand/io/priority_queue/xml_formatter.hpp: Same.
+	* testsuite/util/regression/rand/io/assoc: New.
+	* testsuite/util/regression/rand/io/assoc/xml_formatter.hpp: Same.
+	* testsuite/util/regression/rand/io/xml_formatter.hpp: Same.
+	* testsuite/util/regression/rand/assoc: New.
+	* testsuite/util/regression/rand/assoc/detail: New.
+	* testsuite/util/regression/rand/assoc/detail/subscript_fn_imps.hpp: Same.
+	* testsuite/util/regression/rand/assoc/detail/cmp_fn_imps.hpp: Same.
+	* testsuite/util/regression/rand/assoc/detail/policy_access_fn_imps.hpp: Same.
+	* testsuite/util/regression/rand/assoc/detail/defs_fn_imps.hpp: Same.
+	* testsuite/util/regression/rand/assoc/detail/it_conversion_fn_imps.hpp: Same.
+	* testsuite/util/regression/rand/assoc/detail/diagnostic_fn_imps.hpp: Same.
+	* testsuite/util/regression/rand/assoc/detail/clear_fn_imps.hpp: Same.
+	* testsuite/util/regression/rand/assoc/detail/get_set_load_fn_imps.hpp: Same.
+	* testsuite/util/regression/rand/assoc/detail/operator_fn_imps.hpp: Same.
+	* testsuite/util/regression/rand/assoc/detail/erase_fn_imps.hpp: Same.
+	* testsuite/util/regression/rand/assoc/detail/resize_fn_imps.hpp: Same.
+	* testsuite/util/regression/rand/assoc/detail/constructor_destructor_fn_imps.hpp: Same.
+	* testsuite/util/regression/rand/assoc/detail/insert_fn_imps.hpp: Same.
+	* testsuite/util/regression/rand/assoc/detail/split_join_fn_imps.hpp: Same.
+	* testsuite/util/regression/rand/assoc/detail/get_set_loads_fn_imps.hpp: Same.
+	* testsuite/util/regression/rand/assoc/rand_regression_test.hpp: Same.
+	* testsuite/util/regression/rand/assoc/container_rand_regression_test.hpp: Same.
+	* testsuite/util/regression/priority_queue: New.
+	* testsuite/util/regression/priority_queue/common_type.hpp: Same.
+	* testsuite/util/regression/basic_type.hpp: Same.
+	* testsuite/util/regression/assoc: New.
+	* testsuite/util/regression/assoc/common_type.hpp: Same.
+	* testsuite/util/regression/res_mng: New.
+	* testsuite/util/regression/res_mng/forced_exception.hpp: Same.
+	* testsuite/util/regression/res_mng/dbg_ex_allocator_base.cc: Same.
+	* testsuite/util/regression/res_mng/dbg_ex_allocator_base.hpp: Same.
+	* testsuite/util/regression/res_mng/dbg_ex_allocator.hpp: Same.
+	* testsuite/util/rng: New.
+	* testsuite/util/rng/twister_rand_gen.cc: Same.
+	* testsuite/util/rng/twister_rand_gen.hpp: Same.
+	* testsuite/util/native_type: New.
+	* testsuite/util/native_type/priority_queue: New.
+	* testsuite/util/native_type/priority_queue/native_priority_queue.hpp: Same.
+	* testsuite/util/native_type/priority_queue/native_pq_tag.hpp: Same.
+	* testsuite/util/native_type/assoc: New.
+	* testsuite/util/native_type/assoc/native_multimap.hpp: Same.
+	* testsuite/util/native_type/assoc/native_tree_tag.hpp: Same.
+	* testsuite/util/native_type/assoc/native_set.hpp: Same.
+	* testsuite/util/native_type/assoc/native_hash_multimap.hpp: Same.
+	* testsuite/util/native_type/assoc/native_map.hpp: Same.
+	* testsuite/util/native_type/assoc/native_hash_tag.hpp: Same.
+	* testsuite/util/native_type/assoc/native_hash_set.hpp: Same.
+	* testsuite/util/native_type/assoc/native_hash_map.hpp: Same.
+	* testsuite/util/common_type: New.
+	* testsuite/util/common_type/priority_queue
+	* testsuite/util/common_type/priority_queue/common_type.hpp: Same.
+	* testsuite/util/common_type/priority_queue/string_form.hpp: Same.
+	* testsuite/util/common_type/priority_queue/detail
+	* testsuite/util/common_type/priority_queue/detail/ds_string_form.hpp: Same.
+	* testsuite/util/common_type/assoc: New.
+	* testsuite/util/common_type/assoc/common_type.hpp: Same.
+	* testsuite/util/common_type/assoc/string_form.hpp: Same.
+	* testsuite/util/common_type/assoc/template_policy.hpp: Same.
+	* testsuite/util/common_type/assoc/detail: New.
+	* testsuite/util/common_type/assoc/detail/resize_policy_string_form.hpp: Same.
+	* testsuite/util/common_type/assoc/detail/trigger_policy_string_form.hpp: Same.
+	* testsuite/util/common_type/assoc/detail/ds_string_form.hpp: Same.
+	* testsuite/util/common_type/assoc/detail/comb_hash_fn_string_form.hpp: Same.
+	* testsuite/util/common_type/assoc/detail/size_policy_string_form.hpp: Same.
+	* testsuite/util/common_type/assoc/detail/probe_fn_string_form.hpp: Same.
+	* testsuite/util/common_type/assoc/detail/tree_supports_order_statistics.hpp: Same.
+	* testsuite/util/common_type/assoc/detail/trie_supports_prefix_search.hpp: Same.
+	* testsuite/util/common_type/assoc/detail/list_update_policy_string_form.hpp: Same.
+	* testsuite/util/common_type/assoc/detail/trie_supports_order_statistics.hpp: Same.
+	* testsuite/util/common_type/assoc/detail/store_hash_string_form.hpp: Same.
+	* testsuite/util/common_type/assoc/native_set.hpp: Same.
+	* testsuite/util/performance: New.
+	* testsuite/util/performance/priority_queue: New.
+	* testsuite/util/performance/priority_queue/mem_usage: New.
+	* testsuite/util/performance/priority_queue/mem_usage/pop_test.hpp: Same.
+	* testsuite/util/performance/priority_queue/timing: New.
+	* testsuite/util/performance/priority_queue/timing/push_pop_test.hpp: Same.
+	* testsuite/util/performance/priority_queue/timing/push_test.hpp: Same.
+	* testsuite/util/performance/priority_queue/timing/join_test.hpp: Same.
+	* testsuite/util/performance/priority_queue/timing/modify_test.hpp: Same.
+	* testsuite/util/performance/io: New.
+	* testsuite/util/performance/io/xml_formatter.hpp: Same.
+	* testsuite/util/performance/assoc: New.
+	* testsuite/util/performance/assoc/mem_usage: New.
+	* testsuite/util/performance/assoc/mem_usage/multimap_insert_test.hpp: Same.
+	* testsuite/util/performance/assoc/mem_usage/erase_test.hpp: Same.
+	* testsuite/util/performance/assoc/multimap_common_type.hpp: Same.
+	* testsuite/util/performance/assoc/timing: New.
+	* testsuite/util/performance/assoc/timing/common_type.hpp: Same.
+	* testsuite/util/performance/assoc/timing/multimap_insert_test.hpp: Same.
+	* testsuite/util/performance/assoc/timing/subscript_find_test.hpp: Same.
+	* testsuite/util/performance/assoc/timing/find_test.hpp: Same.
+	* testsuite/util/performance/assoc/timing/subscript_insert_test.hpp: Same.
+	* testsuite/util/performance/assoc/timing/insert_test.hpp: Same.
+	* testsuite/util/performance/assoc/timing/tree_order_statistics_test.hpp: Same.
+	* testsuite/util/performance/assoc/timing/multimap_find_test.hpp: Same.
+	* testsuite/util/performance/assoc/timing/tree_split_join_test.hpp: Same.
+	* testsuite/util/performance/time: New.
+	* testsuite/util/performance/time/elapsed_timer.cc: Same.
+	* testsuite/util/performance/time/elapsed_timer.hpp: Same.
+	* testsuite/util/performance/time/timing_test_base.hpp: Same.
+	* testsuite/util/performance/mem: New.
+	* testsuite/util/performance/mem/mem_track_allocator_base.hpp: Same.
+	* testsuite/util/performance/mem/mem_track_allocator.hpp: Same.
+	* testsuite/util/hash_fn: New.
+	* testsuite/util/hash_fn/limit_string_hash_fn.hpp: Same.
+	* testsuite/util/hash_fn/string_ranged_hash_fn.hpp: Same.
+	* testsuite/util/hash_fn/string_hash_fn.hpp: Same.
+	* testsuite/util/hash_fn/string_ranged_probe_fn.hpp: Same.
+	* testsuite/util/hash_fn/dna_str_limit.hpp: Same.
+	* testsuite/util/io: New.
+	* testsuite/util/io/prog_bar.cc: Same.
+	* testsuite/util/io/prog_bar.hpp: Same.
+	* testsuite/util/io/text_populate.hpp: Same.
+	* testsuite/util/io/xml.hpp: Same.
+	* testsuite/util/io/illegal_input_error.hpp: Same.
+	* testsuite/util/io/xml_test_formatter.hpp: Same.
+	* testsuite/util/io/verified_cmd_line_input.cc: Same.
+	* testsuite/util/io/verified_cmd_line_input.hpp: Same.
+	* testsuite/util/statistic: New.
+	* testsuite/util/statistic/sample_var.hpp: Same.
+	* testsuite/util/statistic/res_recorder.hpp: Same.
+	* testsuite/util/statistic/sample_mean.hpp: Same.
+	* testsuite/util/statistic/sample_mean_confidence_checker.hpp: Same.
+	
 2006-06-12  Paolo Carlini  <pcarlini@suse.de>
 
 	PR libstdc++/26970
diff --git a/libstdc++-v3/docs/html/documentation.html b/libstdc++-v3/docs/html/documentation.html
index f45bde8df95..f211165cca7 100644
--- a/libstdc++-v3/docs/html/documentation.html
+++ b/libstdc++-v3/docs/html/documentation.html
@@ -224,7 +224,7 @@
 
    <li>Extensions to the Standard Library
    <ul>
-     <li><a href="ext/pb_assoc/index.html">Policy Based Associative Containers</a></li>
+     <li><a href="ext/pb_ds/index.html">Policy Based Data Structures</a></li>
      <li><a href="ext/howto.html#1">Ropes and trees and hashes, oh my!</a></li>
      <li><a href="ext/howto.html#2">Added members and types</a></li>
      <li><a href="ext/mt_allocator.html"><code>__mt_alloc</code> </a></li>
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
deleted file mode 100644
index ff7bae0eec3..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/Std_hash_set_impl.jpg
+++ /dev/null
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/acks.html b/libstdc++-v3/docs/html/ext/pb_assoc/acks.html
deleted file mode 100644
index a4971d120c3..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/acks.html
+++ /dev/null
@@ -1,46 +0,0 @@
-<!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
deleted file mode 100644
index d9f7e8bb048..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/balls_and_bins.jpg
+++ /dev/null
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
deleted file mode 100644
index ca91c332eda..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/basic_assoc_cntnr.html
+++ /dev/null
@@ -1,1229 +0,0 @@
-
-<!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
deleted file mode 100644
index 4cde4dbb8b1..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/basic_assoc_cntnr_compound_data.html
+++ /dev/null
@@ -1,1244 +0,0 @@
-
-<!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
deleted file mode 100644
index 8dd0a39a51e..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/basic_assoc_cntnr_no_data.html
+++ /dev/null
@@ -1,1046 +0,0 @@
-
-<!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
deleted file mode 100644
index ca10f35de56..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/basic_ds_tag.html
+++ /dev/null
@@ -1,41 +0,0 @@
-
-<!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
deleted file mode 100644
index 94939ab30d8..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/basic_hash_assoc_cntnr.html
+++ /dev/null
@@ -1,609 +0,0 @@
-
-<!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
deleted file mode 100644
index af421d813a4..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/basic_hash_ds_tag.html
+++ /dev/null
@@ -1,74 +0,0 @@
-
-<!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
deleted file mode 100644
index 8bba96c22a8..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/basic_invalidation_guarantee.html
+++ /dev/null
@@ -1,41 +0,0 @@
-
-<!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
deleted file mode 100644
index a4e7dd078bd..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/basic_ms_tag.html
+++ /dev/null
@@ -1,41 +0,0 @@
-
-<!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
deleted file mode 100644
index 73595b788ab..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/basic_tree_assoc_cntnr.html
+++ /dev/null
@@ -1,940 +0,0 @@
-
-<!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
deleted file mode 100644
index 47095a62ae5..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/basic_tree_assoc_cntnr_const_node_iterator.html
+++ /dev/null
@@ -1,488 +0,0 @@
-
-<!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/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/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/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/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/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/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/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/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/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/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
deleted file mode 100644
index c9f4fb703c0..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/basic_tree_assoc_cntnr_node_iterator.html
+++ /dev/null
@@ -1,250 +0,0 @@
-
-<!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/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/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/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/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
deleted file mode 100644
index b9596f388dc..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/basic_tree_assoc_cntnr_rev.html
+++ /dev/null
@@ -1,771 +0,0 @@
-
-<!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
deleted file mode 100644
index b9596f388dc..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/basic_tree_assoc_cntnr_rev_it.html
+++ /dev/null
@@ -1,771 +0,0 @@
-
-<!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
deleted file mode 100644
index e28c0b35c17..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/basic_tree_ds_tag.html
+++ /dev/null
@@ -1,74 +0,0 @@
-
-<!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
deleted file mode 100644
index 8124e4bcb20..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/cc_hash_assoc_cntnr.html
+++ /dev/null
@@ -1,679 +0,0 @@
-
-<!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
deleted file mode 100644
index 87b724ef056..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/cc_hash_ds_tag.html
+++ /dev/null
@@ -1,74 +0,0 @@
-
-<!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
deleted file mode 100644
index 0b19045d274..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/cc_hash_max_collision_check_resize_trigger.html
+++ /dev/null
@@ -1,701 +0,0 @@
-
-<!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
deleted file mode 100644
index 63891a851b3..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/cc_hash_policy_cd.jpg
+++ /dev/null
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/cd.jpg b/libstdc++-v3/docs/html/ext/pb_assoc/cd.jpg
deleted file mode 100644
index 1b5554484e3..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/cd.jpg
+++ /dev/null
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/component_requirements.html b/libstdc++-v3/docs/html/ext/pb_assoc/component_requirements.html
deleted file mode 100644
index 703e4e0f6d4..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/component_requirements.html
+++ /dev/null
@@ -1,51 +0,0 @@
-<!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
deleted file mode 100644
index 6b70c3fceba..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/compound_data_enabled_ms_tag.html
+++ /dev/null
@@ -1,41 +0,0 @@
-
-<!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
deleted file mode 100644
index c9fd7e0f481..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/compound_data_type.html
+++ /dev/null
@@ -1,128 +0,0 @@
-
-<!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
deleted file mode 100644
index c1cb9ce3ceb..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/compound_ds_tag.html
+++ /dev/null
@@ -1,77 +0,0 @@
-
-<!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
deleted file mode 100644
index cd7295891e8..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/concepts.html
+++ /dev/null
@@ -1,124 +0,0 @@
-<!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
deleted file mode 100644
index 2eb28be483b..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/contact.html
+++ /dev/null
@@ -1,19 +0,0 @@
-<!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
deleted file mode 100644
index fb56b1a0ae2..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/counter_update_metadata.html
+++ /dev/null
@@ -1,101 +0,0 @@
-
-<!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
deleted file mode 100644
index c54fe3739d0..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/counter_update_policy.html
+++ /dev/null
@@ -1,380 +0,0 @@
-
-<!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
deleted file mode 100644
index 7ae1ac06738..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/data_enabled_ms_tag.html
+++ /dev/null
@@ -1,41 +0,0 @@
-
-<!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
deleted file mode 100644
index 4eace5f70cd..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/design.html
+++ /dev/null
@@ -1,23 +0,0 @@
-<!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
deleted file mode 100644
index 2ddd2571814..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/different_underlying_dss.jpg
+++ /dev/null
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
deleted file mode 100644
index f1915c31be5..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/direct_mask_range_hashing.html
+++ /dev/null
@@ -1,251 +0,0 @@
-
-<!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
deleted file mode 100644
index b9096ccb35c..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/direct_mod_range_hashing.html
+++ /dev/null
@@ -1,228 +0,0 @@
-
-<!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
deleted file mode 100644
index c5dcb864b4c..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/disclaimer.html
+++ /dev/null
@@ -1,25 +0,0 @@
-<!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
deleted file mode 100644
index d7cc0aad22a..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/ds_gen.html
+++ /dev/null
@@ -1,368 +0,0 @@
-<!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
deleted file mode 100644
index 0526f8649fc..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/ds_tag_cd.jpg
+++ /dev/null
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/ds_traits.html b/libstdc++-v3/docs/html/ext/pb_assoc/ds_traits.html
deleted file mode 100644
index c646af2f883..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/ds_traits.html
+++ /dev/null
@@ -1,41 +0,0 @@
-
-<!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
deleted file mode 100644
index 0d6569ad566..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/embedded_lists_1.jpg
+++ /dev/null
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
deleted file mode 100644
index d6e4aa10a91..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/embedded_lists_2.jpg
+++ /dev/null
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/examples.html b/libstdc++-v3/docs/html/ext/pb_assoc/examples.html
deleted file mode 100644
index af20aad5072..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/examples.html
+++ /dev/null
@@ -1,185 +0,0 @@
-<!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
deleted file mode 100644
index 48f12bcfbfd..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/exception_guarantees_specifics.html
+++ /dev/null
@@ -1,31 +0,0 @@
-<!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
deleted file mode 100644
index 38d94470bac..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/find_invalidation_guarantee.html
+++ /dev/null
@@ -1,74 +0,0 @@
-
-<!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
deleted file mode 100644
index 5b0e80dedea..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/find_iterators_cd.jpg
+++ /dev/null
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
deleted file mode 100644
index 6cc788fc4fd..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/find_iterators_range_ops_1.jpg
+++ /dev/null
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
deleted file mode 100644
index 5e567e42cb3..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/find_iterators_range_ops_2.jpg
+++ /dev/null
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/generics.html b/libstdc++-v3/docs/html/ext/pb_assoc/generics.html
deleted file mode 100644
index 5b7f2fb7fc1..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/generics.html
+++ /dev/null
@@ -1,25 +0,0 @@
-<!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
deleted file mode 100644
index 3451380f5ca..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/gp_hash_assoc_cntnr.html
+++ /dev/null
@@ -1,816 +0,0 @@
-
-<!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
deleted file mode 100644
index 247a193d1ae..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/gp_hash_ds_tag.html
+++ /dev/null
@@ -1,74 +0,0 @@
-
-<!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
deleted file mode 100644
index 395349fae8d..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/gp_hash_policy_cd.jpg
+++ /dev/null
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
deleted file mode 100644
index c4b4833872d..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/hash_and_probe_general.html
+++ /dev/null
@@ -1,45 +0,0 @@
-<!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
deleted file mode 100644
index 527885128c8..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/hash_based_containers.html
+++ /dev/null
@@ -1,1056 +0,0 @@
-<!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 = "hash_standard_resize_policy.html"><tt>hash_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 = "hash_standard_resize_policy.html"><tt>hash_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,
-  ...
-  hash_standard_resize_policy&lt;
-    some_trigger_policy,
-    some_size_policy,
-    ...&gt; &gt;
-</pre>
-
-<p>
- The sole function of
-<a href = "hash_standard_resize_policy.html"><tt>hash_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 = "hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a> implements
-    a load check trigger policy.
-    </li>
-    <li>
-        <a href = "cc_hash_max_collision_check_resize_trigger.html"><tt>cc_hash_max_collision_check_resize_trigger</tt></a>
-    implements a collision check trigger policy.
-    </li>
-    <li>
-<a href = "hash_exponential_size_policy.html"><tt>hash_exponential_size_policy</tt></a> implemens
-an exponential-size policy (which should be used with mask range hashing).
-    </li>
-    <li>
-<a href = "hash_prime_size_policy.html"><tt>hash_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 = "hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>.
-<a href = "hash_standard_resize_policy.html"><tt>hash_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 = "hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>,
-or
-<a href = "cc_hash_max_collision_check_resize_trigger.html"><tt>cc_hash_max_collision_check_resize_trigger</tt></a>; <tt>Size_Policy</tt> is instantiated by
-<a href = "hash_exponential_size_policy.html"><tt>hash_exponential_size_policy</tt></a>,
-or
-<a href = "hash_prime_size_policy.html"><tt>hash_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
deleted file mode 100644
index 6c26a177985..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/hash_cd.jpg
+++ /dev/null
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
deleted file mode 100644
index f0fc5a7624b..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/hash_exponential_size_policy.html
+++ /dev/null
@@ -1,267 +0,0 @@
-
-<!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
deleted file mode 100644
index 6ef435b0ab8..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/hash_fn.html
+++ /dev/null
@@ -1,25 +0,0 @@
-<!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
deleted file mode 100644
index 6670d696860..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/hash_load_check_resize_trigger.html
+++ /dev/null
@@ -1,744 +0,0 @@
-
-<!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
deleted file mode 100644
index c5bc2aadafa..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/hash_policies.html
+++ /dev/null
@@ -1,375 +0,0 @@
-<!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
deleted file mode 100644
index c5d22903513..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/hash_policy_cd.jpg
+++ /dev/null
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
deleted file mode 100644
index 5b6d0ac2224..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/hash_prime_size_policy.html
+++ /dev/null
@@ -1,211 +0,0 @@
-
-<!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
deleted file mode 100644
index f675cea6302..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/hash_range_hashing_seq_diagram.jpg
+++ /dev/null
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
deleted file mode 100644
index a292d5aaaa1..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/hash_range_hashing_seq_diagram2.jpg
+++ /dev/null
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
deleted file mode 100644
index ba5f6cd1c5d..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/hash_ranged_hash_range_hashing_fns.jpg
+++ /dev/null
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
deleted file mode 100644
index 151ecfc1be9..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/hash_standard_resize_policy.html
+++ /dev/null
@@ -1,986 +0,0 @@
-
-<!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 = "hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_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
deleted file mode 100644
index 79b80662062..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/home.html
+++ /dev/null
@@ -1,56 +0,0 @@
-<!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
deleted file mode 100644
index 1e0864126e7..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/index.html
+++ /dev/null
@@ -1,12 +0,0 @@
-<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
deleted file mode 100644
index 6e8a94d3d00..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/insert_resize_sequence_diagram1.jpg
+++ /dev/null
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
deleted file mode 100644
index 4aa2c6cb8ce..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/insert_resize_sequence_diagram2.jpg
+++ /dev/null
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
deleted file mode 100644
index e7cadf1755a..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/insert_resize_sequence_diagram3.jpg
+++ /dev/null
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
deleted file mode 100644
index 3687a5b3176..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/insert_type_methods.html
+++ /dev/null
@@ -1,42 +0,0 @@
-<!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
deleted file mode 100644
index d5b5eb66f9d..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/interface.html
+++ /dev/null
@@ -1,342 +0,0 @@
-<!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="hash_standard_resize_policy.html"><tt>hash_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="hash_exponential_size_policy.html"><tt>hash_exponential_size_policy</tt></a></li>
-        <li> <a href="hash_prime_size_policy.html"><tt>hash_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="hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a></li>
-        <li> <a href="cc_hash_max_collision_check_resize_trigger.html"><tt>cc_hash_max_collision_check_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
deleted file mode 100644
index 0f4db9671a3..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/interval_node_invariants.jpg
+++ /dev/null
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/introduction.html b/libstdc++-v3/docs/html/ext/pb_assoc/introduction.html
deleted file mode 100644
index e31dfc71a2f..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/introduction.html
+++ /dev/null
@@ -1,31 +0,0 @@
-<!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
deleted file mode 100644
index dde670039b7..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/invalidation_guarantee_cd.jpg
+++ /dev/null
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
deleted file mode 100644
index d1670978b6b..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/invalidation_guarantee_erase.jpg
+++ /dev/null
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/lib_download.html b/libstdc++-v3/docs/html/ext/pb_assoc/lib_download.html
deleted file mode 100644
index 20076319af1..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/lib_download.html
+++ /dev/null
@@ -1,47 +0,0 @@
-<!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
deleted file mode 100644
index 65943f2701e..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/linear_probe_fn.html
+++ /dev/null
@@ -1,238 +0,0 @@
-
-<!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
deleted file mode 100644
index d0086d171a2..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/list_updates.html
+++ /dev/null
@@ -1,138 +0,0 @@
-<!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_ops.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
deleted file mode 100644
index c9d0c75f1b0..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/lu_assoc_cntnr.html
+++ /dev/null
@@ -1,570 +0,0 @@
-
-<!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
deleted file mode 100644
index 30dc90f611d..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/lu_based_containers.html
+++ /dev/null
@@ -1,225 +0,0 @@
-<!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_ops.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
deleted file mode 100644
index c69cdc5348e..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/lu_cd.jpg
+++ /dev/null
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
deleted file mode 100644
index e906de7e5f9..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/lu_ds_tag.html
+++ /dev/null
@@ -1,74 +0,0 @@
-
-<!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
deleted file mode 100644
index fa26e84d987..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/lu_ops.jpg
+++ /dev/null
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
deleted file mode 100644
index dd0846ea62a..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/mmap_value_utils.html
+++ /dev/null
@@ -1,128 +0,0 @@
-<!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
deleted file mode 100644
index 11eca4a421f..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/motivation.html
+++ /dev/null
@@ -1,281 +0,0 @@
-<!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
deleted file mode 100644
index 8a73408016e..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/move_to_front_update_metadata.html
+++ /dev/null
@@ -1,41 +0,0 @@
-
-<!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
deleted file mode 100644
index f9a47e3b221..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/move_to_front_update_policy.html
+++ /dev/null
@@ -1,256 +0,0 @@
-
-<!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
deleted file mode 100644
index 885319daac8..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/ms_cd.jpg
+++ /dev/null
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/ms_gen.html b/libstdc++-v3/docs/html/ext/pb_assoc/ms_gen.html
deleted file mode 100644
index 468c121a70b..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/ms_gen.html
+++ /dev/null
@@ -1,440 +0,0 @@
-<!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
deleted file mode 100644
index b114d935798..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/ms_tag_cd.jpg
+++ /dev/null
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/ms_traits.html b/libstdc++-v3/docs/html/ext/pb_assoc/ms_traits.html
deleted file mode 100644
index 93369930769..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/ms_traits.html
+++ /dev/null
@@ -1,131 +0,0 @@
-
-<!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
deleted file mode 100644
index ea03b42be4d..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/node_invariant_invalidations.jpg
+++ /dev/null
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/node_invariants.html b/libstdc++-v3/docs/html/ext/pb_assoc/node_invariants.html
deleted file mode 100644
index 9d23841402f..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/node_invariants.html
+++ /dev/null
@@ -1,154 +0,0 @@
-<!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
deleted file mode 100644
index d9b96ddecb0..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/node_invariants.jpg
+++ /dev/null
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
deleted file mode 100644
index 866ea5229c6..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/non_unique_mapping.html
+++ /dev/null
@@ -1,404 +0,0 @@
-<!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
deleted file mode 100644
index 3bdacd005fa..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/non_unique_mapping_containers.jpg
+++ /dev/null
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
deleted file mode 100644
index b5d0120c88c..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/null_data_type.html
+++ /dev/null
@@ -1,41 +0,0 @@
-
-<!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
deleted file mode 100644
index 083de7efb54..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/null_hash_fn.html
+++ /dev/null
@@ -1,44 +0,0 @@
-
-<!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
deleted file mode 100644
index 1088b6bfd7b..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/null_probe_fn.html
+++ /dev/null
@@ -1,44 +0,0 @@
-
-<!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
deleted file mode 100644
index 0b37f5399b5..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/order_by_key.html
+++ /dev/null
@@ -1,254 +0,0 @@
-
-<!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
deleted file mode 100644
index 74179105d26..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/order_statistics_key.html
+++ /dev/null
@@ -1,373 +0,0 @@
-
-<!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
deleted file mode 100644
index d85f4fa9900..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/order_statistics_key_cmp.html
+++ /dev/null
@@ -1,422 +0,0 @@
-
-<!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
deleted file mode 100644
index a9acbb40867..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/order_statistics_node_updator.html
+++ /dev/null
@@ -1,278 +0,0 @@
-
-<!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
deleted file mode 100644
index 38878b6e0ae..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/ov_tree_ds_tag.html
+++ /dev/null
@@ -1,74 +0,0 @@
-
-<!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
deleted file mode 100644
index 0caa3708fd7..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/overview.html
+++ /dev/null
@@ -1,139 +0,0 @@
-<!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
deleted file mode 100644
index 8895bc263a0..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/pb_assoc_ex.html
+++ /dev/null
@@ -1,74 +0,0 @@
-
-<!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
deleted file mode 100644
index ab7e9c85ef7..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/portability.html
+++ /dev/null
@@ -1,26 +0,0 @@
-<!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
deleted file mode 100644
index 1e3dea17c01..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/quadratic_probe_fn.html
+++ /dev/null
@@ -1,238 +0,0 @@
-
-<!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
deleted file mode 100644
index f91e45227ed..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/range_invalidation_guarantee.html
+++ /dev/null
@@ -1,74 +0,0 @@
-
-<!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
deleted file mode 100644
index ea01b0a0794..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/rank_node_invariants.jpg
+++ /dev/null
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
deleted file mode 100644
index c798ec1451b..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/rationale_null_node_updator.jpg
+++ /dev/null
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
deleted file mode 100644
index 5c594144927..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/rb_tree_ds_tag.html
+++ /dev/null
@@ -1,74 +0,0 @@
-
-<!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
deleted file mode 100644
index a9cc63e5d20..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/reference_iterator.jpg
+++ /dev/null
diff --git a/libstdc++-v3/docs/html/ext/pb_assoc/references.html b/libstdc++-v3/docs/html/ext/pb_assoc/references.html
deleted file mode 100644
index 17e6790f186..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/references.html
+++ /dev/null
@@ -1,94 +0,0 @@
-<!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
deleted file mode 100644
index 491be1ffc0f..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/regression_tests.html
+++ /dev/null
@@ -1,25 +0,0 @@
-<!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
deleted file mode 100644
index 118e07529ac..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/resize_general.html
+++ /dev/null
@@ -1,28 +0,0 @@
-<!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
deleted file mode 100644
index 63819dc7077..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/resize_policies.html
+++ /dev/null
@@ -1,487 +0,0 @@
-<!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 = "hash_standard_resize_policy.html"><tt>hash_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 = "hash_standard_resize_policy.html"><tt>hash_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,
-  ...
-  hash_standard_resize_policy&lt;
-    some_trigger_policy,
-    some_size_policy,
-    ...&gt; &gt;
-</pre>
-
-<p>
- The sole function of
-<a href = "hash_standard_resize_policy.html"><tt>hash_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 = "hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a> implements
-    a load check trigger policy.
-    </li>
-    <li>
-        <a href = "cc_hash_max_collision_check_resize_trigger.html"><tt>cc_hash_max_collision_check_resize_trigger</tt></a>
-    implements a collision check trigger policy.
-    </li>
-    <li>
-<a href = "hash_exponential_size_policy.html"><tt>hash_exponential_size_policy</tt></a> implemens
-an exponential-size policy (which should be used with mask range hashing).
-    </li>
-    <li>
-<a href = "hash_prime_size_policy.html"><tt>hash_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 = "hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>.
-<a href = "hash_standard_resize_policy.html"><tt>hash_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 = "hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>,
-or
-<a href = "cc_hash_max_collision_check_resize_trigger.html"><tt>cc_hash_max_collision_check_resize_trigger</tt></a>; <tt>Size_Policy</tt> is instantiated by
-<a href = "hash_exponential_size_policy.html"><tt>hash_exponential_size_policy</tt></a>,
-or
-<a href = "hash_prime_size_policy.html"><tt>hash_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
deleted file mode 100644
index 1d85438a174..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/resize_policy_cd.jpg
+++ /dev/null
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
deleted file mode 100644
index 626b730c1aa..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/restoring_node_invariants.jpg
+++ /dev/null
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
deleted file mode 100644
index f862353bc1e..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/sample_node_updator.hpp
+++ /dev/null
@@ -1,116 +0,0 @@
-/* 

-* @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
deleted file mode 100644
index 1117418e224..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/sample_probe_fn.hpp
+++ /dev/null
@@ -1,121 +0,0 @@
-/** 

-* @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
deleted file mode 100644
index 360ab6037ec..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/sample_probe_fn.html
+++ /dev/null
@@ -1,177 +0,0 @@
-
-<!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 = "../pb_assoc/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
deleted file mode 100644
index d22f8e23d1c..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/sample_range_hashing.hpp
+++ /dev/null
@@ -1,147 +0,0 @@
-/** 

-* @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
deleted file mode 100644
index 86d179e8fd1..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/sample_range_hashing.html
+++ /dev/null
@@ -1,213 +0,0 @@
-
-<!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 = "../pb_assoc/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
deleted file mode 100644
index 32c5a49859b..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/sample_ranged_hash_fn.hpp
+++ /dev/null
@@ -1,141 +0,0 @@
-/** 

-* @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
deleted file mode 100644
index f43c3006610..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/sample_ranged_hash_fn.html
+++ /dev/null
@@ -1,129 +0,0 @@
-
-<!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 = "../pb_assoc/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
deleted file mode 100644
index 2aaab0e3d47..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/sample_ranged_probe_fn.hpp
+++ /dev/null
@@ -1,143 +0,0 @@
-/** 

-* @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
deleted file mode 100644
index 5ce7ef20ec3..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/sample_ranged_probe_fn.html
+++ /dev/null
@@ -1,129 +0,0 @@
-
-<!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 = "../pb_assoc/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
deleted file mode 100644
index 4101a70fb3c..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/sample_resize_policy.hpp
+++ /dev/null
@@ -1,310 +0,0 @@
-/** 

-* @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
deleted file mode 100644
index b1e3794c443..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/sample_resize_policy.html
+++ /dev/null
@@ -1,536 +0,0 @@
-
-<!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 = "../pb_assoc/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
deleted file mode 100644
index b2799cfb783..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/sample_resize_trigger.hpp
+++ /dev/null
@@ -1,341 +0,0 @@
-/** 

-* @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
deleted file mode 100644
index a8642700b26..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/sample_size_policy.hpp
+++ /dev/null
@@ -1,140 +0,0 @@
-/** 

-* @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
deleted file mode 100644
index 70a1bd438ba..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/sample_update_policy.hpp
+++ /dev/null
@@ -1,171 +0,0 @@
-/** 

-* @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
deleted file mode 100644
index d79d68af9a4..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/size_policies_general.html
+++ /dev/null
@@ -1,22 +0,0 @@
-<!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
deleted file mode 100644
index 71d8e3f78ad..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/splay_tree_ds_tag.html
+++ /dev/null
@@ -1,74 +0,0 @@
-
-<!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
deleted file mode 100644
index 8fd034ccd80..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/timing_tests.html
+++ /dev/null
@@ -1,60 +0,0 @@
-<!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
deleted file mode 100644
index c46f16094f2..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/toc.html
+++ /dev/null
@@ -1,35 +0,0 @@
-<!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
deleted file mode 100644
index f524f96eb26..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/tree_assoc_cntnr.html
+++ /dev/null
@@ -1,493 +0,0 @@
-
-<!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
deleted file mode 100644
index aa0954c655e..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/tree_assoc_cntnr_const_node_iterator.html
+++ /dev/null
@@ -1,488 +0,0 @@
-
-<!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/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/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/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/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/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/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/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/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/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/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
deleted file mode 100644
index edcdd0f2ddd..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/tree_assoc_cntnr_node_iterator.html
+++ /dev/null
@@ -1,250 +0,0 @@
-
-<!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/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/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/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/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
deleted file mode 100644
index 08ee428ecf1..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/tree_based_containers.html
+++ /dev/null
@@ -1,246 +0,0 @@
-<!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
deleted file mode 100644
index 95afe317c5d..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/tree_cd.jpg
+++ /dev/null
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
deleted file mode 100644
index 5535bb9781d..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/trigger_policies_general.html
+++ /dev/null
@@ -1,23 +0,0 @@
-<!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
deleted file mode 100644
index b5dd0f51265..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/tutorial.html
+++ /dev/null
@@ -1,66 +0,0 @@
-<!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
deleted file mode 100644
index d3221cbb98b..00000000000
--- a/libstdc++-v3/docs/html/ext/pb_assoc/update_seq_diagram.jpg
+++ /dev/null
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/PythonPoweredSmall.gif b/libstdc++-v3/docs/html/ext/pb_ds/PythonPoweredSmall.gif
new file mode 100644
index 00000000000..268980706ab
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/PythonPoweredSmall.gif
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/acks.html b/libstdc++-v3/docs/html/ext/pb_ds/acks.html
new file mode 100644
index 00000000000..6612a4a8184
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/acks.html
@@ -0,0 +1,65 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+  <meta name="generator" content=
+  "HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+
+  <title>Acknowledgments</title>
+  <meta http-equiv="Content-Type" content=
+  "text/html; charset=us-ascii" />
+  </head>
+
+<body>
+  <div id="page">
+    <h1>Acknowledgments</h1>
+
+    <ol>
+      <li>This library was partially written at <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#alexandrescu01modern">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="middle" width="55" height="22" alt="[Python Powered]"
+      border="0" /></a> (especially through <a href=
+      "http://home.gna.org/pychart/">PyChart</a>, <a href=
+      "http://www.crummy.com/software/BeautifulSoup/">Beautiful
+      Soup</a>, and <a href=
+      "http://starship.python.net/crew/aaron_watters/kjbuckets/">kjbuckets</a>)
+      and uses <a href="http://tidy.sourceforge.net/"><img src=
+      "checked_by_tidy.gif" align="middle" width="55" height="45"
+      alt="[HTML tidy]" border="0" /></a>. The CSS-driven menus are
+      slightly modified from <a href=
+      "http://www.brothercake.com/scripts/navmeister/page.php">Brothercake</a>
+      (hopefully without introducing errors).</li>
+    </ol>
+  </div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/assoc_container_tag_cd.png b/libstdc++-v3/docs/html/ext/pb_ds/assoc_container_tag_cd.png
new file mode 100644
index 00000000000..16cc6da870d
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/assoc_container_tag_cd.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/assoc_container_tag_cd.svg b/libstdc++-v3/docs/html/ext/pb_ds/assoc_container_tag_cd.svg
new file mode 100644
index 00000000000..02be6241647
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/assoc_container_tag_cd.svg
@@ -0,0 +1,491 @@
+<?xml version="1.0" encoding="UTF-8" standalone="no"?>
+<!-- Created with Inkscape (http://www.inkscape.org/) -->
+<svg
+   xmlns:dc="http://purl.org/dc/elements/1.1/"
+   xmlns:cc="http://web.resource.org/cc/"
+   xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
+   xmlns:svg="http://www.w3.org/2000/svg"
+   xmlns="http://www.w3.org/2000/svg"
+   xmlns:sodipodi="http://inkscape.sourceforge.net/DTD/sodipodi-0.dtd"
+   xmlns:inkscape="http://www.inkscape.org/namespaces/inkscape"
+   width="11in"
+   height="8.5in"
+   id="svg2"
+   sodipodi:version="0.32"
+   inkscape:version="0.43"
+   version="1.0"
+   sodipodi:docbase="/mnt/share/src/policy_based_data_structures/pb_ds_images"
+   sodipodi:docname="assoc_tag_diagram_2.svg"
+   inkscape:export-filename="/mnt/share/src/policy_based_data_structures/pb_ds_images/assoc_tag_diagram_2.png"
+   inkscape:export-xdpi="90"
+   inkscape:export-ydpi="90">
+  <defs
+     id="defs4">
+    <marker
+       inkscape:stockid="Arrow1Mstart"
+       orient="auto"
+       refY="0.0"
+       refX="0.0"
+       id="Arrow1Mstart"
+       style="overflow:visible">
+      <path
+         id="path3311"
+         d="M 0.0,0.0 L 5.0,-5.0 L -12.5,0.0 L 5.0,5.0 L 0.0,0.0 z "
+         style="fill-rule:evenodd;stroke:#000000;stroke-width:1.0pt;marker-start:none"
+         transform="scale(0.4)" />
+    </marker>
+    <marker
+       inkscape:stockid="Arrow2Sstart"
+       orient="auto"
+       refY="0"
+       refX="0"
+       id="Arrow2Sstart"
+       style="overflow:visible">
+      <path
+         id="path3319"
+         style="font-size:12px;fill-rule:evenodd;stroke-width:0.625;stroke-linejoin:round"
+         d="M 8.7185878,4.0337352 L -2.2072895,0.016013256 L 8.7185884,-4.0017078 C 6.97309,-1.6296469 6.9831476,1.6157441 8.7185878,4.0337352 z "
+         transform="matrix(0.3,0,0,0.3,-1.5,0)" />
+    </marker>
+    <marker
+       inkscape:stockid="Arrow1Sstart"
+       orient="auto"
+       refY="0"
+       refX="0"
+       id="Arrow1Sstart"
+       style="overflow:visible">
+      <path
+         id="path3337"
+         d="M 0,0 L 5,-5 L -12.5,0 L 5,5 L 0,0 z "
+         style="fill-rule:evenodd;stroke:#000000;stroke-width:1pt;marker-start:none"
+         transform="scale(0.2,0.2)" />
+    </marker>
+    <marker
+       inkscape:stockid="Arrow2Send"
+       orient="auto"
+       refY="0"
+       refX="0"
+       id="Arrow2Send"
+       style="overflow:visible">
+      <path
+         id="path3316"
+         style="font-size:12px;fill-rule:evenodd;stroke-width:0.625;stroke-linejoin:round"
+         d="M 8.7185878,4.0337352 L -2.2072895,0.016013256 L 8.7185884,-4.0017078 C 6.97309,-1.6296469 6.9831476,1.6157441 8.7185878,4.0337352 z "
+         transform="matrix(-0.3,0,0,-0.3,1.5,0)" />
+    </marker>
+    <marker
+       inkscape:stockid="Arrow2Mend"
+       orient="auto"
+       refY="0"
+       refX="0"
+       id="Arrow2Mend"
+       style="overflow:visible">
+      <path
+         id="path3322"
+         style="font-size:12px;fill-rule:evenodd;stroke-width:0.625;stroke-linejoin:round"
+         d="M 8.7185878,4.0337352 L -2.2072895,0.016013256 L 8.7185884,-4.0017078 C 6.97309,-1.6296469 6.9831476,1.6157441 8.7185878,4.0337352 z "
+         transform="matrix(-0.6,0,0,-0.6,3,0)" />
+    </marker>
+    <marker
+       inkscape:stockid="Arrow1Lend"
+       orient="auto"
+       refY="0"
+       refX="0"
+       id="Arrow1Lend"
+       style="overflow:visible">
+      <path
+         id="path3346"
+         d="M 0,0 L 5,-5 L -12.5,0 L 5,5 L 0,0 z "
+         style="fill-rule:evenodd;stroke:#000000;stroke-width:1pt;marker-start:none"
+         transform="scale(-0.8,-0.8)" />
+    </marker>
+    <marker
+       inkscape:stockid="Arrow2Lstart"
+       orient="auto"
+       refY="0"
+       refX="0"
+       id="Arrow2Lstart"
+       style="overflow:visible">
+      <path
+         id="path3331"
+         style="font-size:12px;fill-rule:evenodd;stroke-width:0.625;stroke-linejoin:round"
+         d="M 8.7185878,4.0337352 L -2.2072895,0.016013256 L 8.7185884,-4.0017078 C 6.97309,-1.6296469 6.9831476,1.6157441 8.7185878,4.0337352 z "
+         transform="matrix(1.1,0,0,1.1,-5.5,0)" />
+    </marker>
+    <marker
+       inkscape:stockid="Arrow2Lend"
+       orient="auto"
+       refY="0"
+       refX="0"
+       id="Arrow2Lend"
+       style="overflow:visible">
+      <path
+         id="path3328"
+         style="font-size:12px;fill-rule:evenodd;stroke-width:0.625;stroke-linejoin:round"
+         d="M 8.7185878,4.0337352 L -2.2072895,0.016013256 L 8.7185884,-4.0017078 C 6.97309,-1.6296469 6.9831476,1.6157441 8.7185878,4.0337352 z "
+         transform="matrix(-1.1,0,0,-1.1,5.5,0)" />
+    </marker>
+  </defs>
+  <sodipodi:namedview
+     id="base"
+     pagecolor="#ffffff"
+     bordercolor="#666666"
+     borderopacity="1.0"
+     inkscape:pageopacity="0.0"
+     inkscape:pageshadow="2"
+     inkscape:zoom="2"
+     inkscape:cx="613.85775"
+     inkscape:cy="310.05621"
+     inkscape:document-units="in"
+     inkscape:current-layer="layer1"
+     showguides="true"
+     inkscape:guide-bbox="true"
+     inkscape:window-width="1278"
+     inkscape:window-height="973"
+     inkscape:window-x="0"
+     inkscape:window-y="0"
+     gridtolerance="0.125in"
+     guidetolerance="0.125in">
+    <sodipodi:guide
+       orientation="horizontal"
+       position="629"
+       id="guide1307" />
+    <sodipodi:guide
+       orientation="horizontal"
+       position="449"
+       id="guide1309" />
+    <sodipodi:guide
+       orientation="horizontal"
+       position="269"
+       id="guide1311" />
+    <sodipodi:guide
+       orientation="vertical"
+       position="496"
+       id="guide1313" />
+    <sodipodi:guide
+       orientation="vertical"
+       position="361"
+       id="guide1315" />
+    <sodipodi:guide
+       orientation="vertical"
+       position="226"
+       id="guide1317" />
+    <sodipodi:guide
+       orientation="vertical"
+       position="631"
+       id="guide1319" />
+    <sodipodi:guide
+       orientation="vertical"
+       position="766"
+       id="guide1321" />
+    <sodipodi:guide
+       orientation="vertical"
+       position="91"
+       id="guide1345" />
+    <sodipodi:guide
+       orientation="vertical"
+       position="901"
+       id="guide1347" />
+    <sodipodi:guide
+       orientation="horizontal"
+       position="539"
+       id="guide3390" />
+    <sodipodi:guide
+       orientation="horizontal"
+       position="359"
+       id="guide3392" />
+    <sodipodi:guide
+       orientation="vertical"
+       position="280.5"
+       id="guide3324" />
+    <sodipodi:guide
+       orientation="vertical"
+       position="172"
+       id="guide3326" />
+    <sodipodi:guide
+       orientation="vertical"
+       position="427"
+       id="guide3328" />
+    <sodipodi:guide
+       orientation="vertical"
+       position="711.5"
+       id="guide3340" />
+    <sodipodi:guide
+       orientation="horizontal"
+       position="179"
+       id="guide1395" />
+  </sodipodi:namedview>
+  <metadata
+     id="metadata7">
+    <rdf:RDF>
+      <cc:Work
+         rdf:about="">
+        <dc:format>image/svg+xml</dc:format>
+        <dc:type
+           rdf:resource="http://purl.org/dc/dcmitype/StillImage" />
+        <dc:creator>
+          <cc:Agent>
+            <dc:title>Benjamin Kosnik</dc:title>
+          </cc:Agent>
+        </dc:creator>
+      </cc:Work>
+    </rdf:RDF>
+  </metadata>
+  <g
+     inkscape:label="Layer 1"
+     inkscape:groupmode="layer"
+     id="layer1">
+    <rect
+       y="562.32806"
+       x="237.8916"
+       height="23.200001"
+       width="80.769417"
+       id="rect1495"
+       style="fill:#ffffff;fill-opacity:1;stroke:#000000;stroke-width:0.94391561;stroke-miterlimit:4;stroke-dasharray:none;stroke-opacity:1" />
+    <rect
+       style="fill:#ffffff;fill-opacity:1;stroke:#000000;stroke-width:0.94391561;stroke-miterlimit:4;stroke-dasharray:none;stroke-opacity:1"
+       id="rect1497"
+       width="80.769417"
+       height="23.200001"
+       x="132.8916"
+       y="562.32806" />
+    <rect
+       style="fill:#ffffff;fill-opacity:1;stroke:#000000;stroke-width:0.94391561;stroke-miterlimit:4;stroke-dasharray:none;stroke-opacity:1"
+       id="rect1493"
+       width="80.769417"
+       height="23.200001"
+       x="21.891602"
+       y="562.32806" />
+    <rect
+       style="fill:#ffffff;fill-opacity:1;stroke:#000000;stroke-width:1.25;stroke-miterlimit:4;stroke-dasharray:none;stroke-opacity:1"
+       id="rect1425"
+       width="141.64481"
+       height="23.200001"
+       x="209.57762"
+       y="382.56177" />
+    <rect
+       style="fill:#ffffff;fill-opacity:1;stroke:#000000;stroke-width:1.25;stroke-miterlimit:4;stroke-dasharray:none;stroke-opacity:1"
+       id="rect3378"
+       width="141.64481"
+       height="23.200001"
+       x="640.77765"
+       y="382.56177" />
+    <text
+       xml:space="preserve"
+       style="font-size:9.60000038;font-style:normal;font-variant:normal;font-weight:normal;font-stretch:normal;text-align:center;line-height:100%;writing-mode:lr;text-anchor:middle;fill:#000000;fill-opacity:1;stroke:none;stroke-width:1.25;stroke-linecap:butt;stroke-linejoin:miter;stroke-opacity:1;font-family:Bitstream Vera Sans;stroke-miterlimit:4;stroke-dasharray:none"
+       x="710.40002"
+       y="397.09772"
+       id="use1337"
+       sodipodi:linespacing="100%"><tspan
+         sodipodi:role="line"
+         id="tspan1391"
+         x="710.40003"
+         y="397.09772">basic_hash_table_tag</tspan></text>
+    <text
+       xml:space="preserve"
+       style="font-size:9.60000038;font-style:normal;font-variant:normal;font-weight:normal;font-stretch:normal;text-align:center;line-height:100%;writing-mode:lr;text-anchor:middle;fill:#000000;fill-opacity:1;stroke:none;stroke-width:1px;stroke-linecap:butt;stroke-linejoin:miter;stroke-opacity:1;font-family:Bitstream Vera Sans"
+       x="280"
+       y="397.09772"
+       id="text1339"
+       sodipodi:linespacing="100%"><tspan
+         sodipodi:role="line"
+         id="tspan1385"
+         x="280"
+         y="397.09772">basic_tree_tag</tspan></text>
+    <rect
+       style="fill:#ffffff;fill-opacity:1;stroke:#000000;stroke-width:1.25;stroke-miterlimit:4;stroke-dasharray:none;stroke-opacity:1"
+       id="rect3418"
+       width="141.64481"
+       height="23.200001"
+       x="101.57762"
+       y="472.5618" />
+    <rect
+       y="472.5618"
+       x="317.57761"
+       height="23.200001"
+       width="141.64481"
+       id="rect3420"
+       style="fill:#ffffff;fill-opacity:1;stroke:#000000;stroke-width:1.25;stroke-miterlimit:4;stroke-dasharray:none;stroke-opacity:1" />
+    <text
+       xml:space="preserve"
+       style="font-size:9.60000038;font-style:normal;font-variant:normal;font-weight:normal;font-stretch:normal;text-align:center;line-height:100%;writing-mode:lr;text-anchor:middle;fill:#000000;fill-opacity:1;stroke:none;stroke-width:1px;stroke-linecap:butt;stroke-linejoin:miter;stroke-opacity:1;font-family:Bitstream Vera Sans"
+       x="171.20001"
+       y="486.29773"
+       id="text3394"
+       sodipodi:linespacing="100%"><tspan
+         sodipodi:role="line"
+         id="tspan1387"
+         x="171.20001"
+         y="486.29773">tree_tag</tspan></text>
+    <text
+       sodipodi:linespacing="100%"
+       id="text3400"
+       y="486.29773"
+       x="388.39999"
+       style="font-size:9.60000038px;font-style:normal;font-variant:normal;font-weight:normal;font-stretch:normal;text-align:center;line-height:100%;writing-mode:lr-tb;text-anchor:middle;fill:#000000;fill-opacity:1;stroke:none;stroke-width:1px;stroke-linecap:butt;stroke-linejoin:miter;stroke-opacity:1;font-family:Bitstream Vera Sans"
+       xml:space="preserve"><tspan
+         sodipodi:role="line"
+         id="tspan1389"
+         x="388.39999"
+         y="486.29773">trie_tag</tspan></text>
+    <rect
+       style="fill:#ffffff;fill-opacity:1;stroke:#000000;stroke-width:1.25;stroke-miterlimit:4;stroke-dasharray:none;stroke-opacity:1"
+       id="rect3380"
+       width="141.64481"
+       height="23.200001"
+       x="425.57764"
+       y="292.56177" />
+    <text
+       xml:space="preserve"
+       style="font-size:9.60000038;font-style:normal;font-variant:normal;font-weight:normal;font-stretch:normal;text-align:center;line-height:100%;writing-mode:lr;text-anchor:middle;fill:#000000;fill-opacity:1;stroke:none;stroke-width:1.5625;stroke-linecap:butt;stroke-linejoin:miter;stroke-miterlimit:4;stroke-dasharray:none;stroke-opacity:1;font-family:Bitstream Vera Sans"
+       x="495.20001"
+       y="307.09772"
+       id="text1323"
+       sodipodi:linespacing="100%"><tspan
+         sodipodi:role="line"
+         id="tspan1384"
+         x="495.20001"
+         y="307.09772">associative_container_tag</tspan></text>
+    <path
+       style="fill:none;fill-opacity:0.75;fill-rule:evenodd;stroke:#000000;stroke-width:1.25;stroke-linecap:butt;stroke-linejoin:miter;stroke-opacity:1;stroke-miterlimit:4;stroke-dasharray:none"
+       d="M 170.97058,472.5 L 170.97058,451 L 387.51871,450 L 387.51871,472.5"
+       id="path2244" />
+    <path
+       style="fill:none;fill-opacity:0.75;fill-rule:evenodd;stroke:#000000;stroke-width:1.25;stroke-linecap:butt;stroke-linejoin:miter;marker-end:url(#Arrow2Mend);stroke-miterlimit:4;stroke-dasharray:none;stroke-opacity:1"
+       d="M 280.5,450.53297 L 280.5,410.62445"
+       id="path3332" />
+    <rect
+       style="fill:#ffffff;fill-opacity:1;stroke:#000000;stroke-width:1.25;stroke-miterlimit:4;stroke-dasharray:none;stroke-opacity:1"
+       id="rect3422"
+       width="141.64481"
+       height="23.200001"
+       x="533.57764"
+       y="472.5618" />
+    <rect
+       y="472.5618"
+       x="748.77765"
+       height="23.200001"
+       width="141.64481"
+       id="rect3424"
+       style="fill:#ffffff;fill-opacity:1;stroke:#000000;stroke-width:1.25;stroke-miterlimit:4;stroke-dasharray:none;stroke-opacity:1" />
+    <text
+       sodipodi:linespacing="100%"
+       id="text3406"
+       y="486.29773"
+       x="601.20001"
+       style="font-size:9.60000038px;font-style:normal;font-variant:normal;font-weight:normal;font-stretch:normal;text-align:center;line-height:100%;writing-mode:lr-tb;text-anchor:middle;fill:#000000;fill-opacity:1;stroke:none;stroke-width:1.25;stroke-linecap:butt;stroke-linejoin:miter;stroke-miterlimit:4;stroke-dasharray:none;stroke-opacity:1;font-family:Bitstream Vera Sans"
+       xml:space="preserve"><tspan
+         sodipodi:role="line"
+         id="tspan1393"
+         x="601.20001"
+         y="486.29773">cc_hash_table_tag</tspan></text>
+    <text
+       xml:space="preserve"
+       style="font-size:9.60000038px;font-style:normal;font-variant:normal;font-weight:normal;font-stretch:normal;text-align:center;line-height:100%;writing-mode:lr-tb;text-anchor:middle;fill:#000000;fill-opacity:1;stroke:none;stroke-width:1.25;stroke-linecap:butt;stroke-linejoin:miter;stroke-miterlimit:4;stroke-dasharray:none;stroke-opacity:1;font-family:Bitstream Vera Sans"
+       x="818"
+       y="486.29773"
+       id="text3412"
+       sodipodi:linespacing="100%"><tspan
+         sodipodi:role="line"
+         id="tspan1395"
+         x="818"
+         y="486.29773">gp_hash_table_tag</tspan></text>
+    <path
+       id="path3353"
+       d="M 601.47058,472.5 L 601.47058,451 L 818.01871,450 L 818.01871,472.5"
+       style="fill:none;fill-opacity:0.75;fill-rule:evenodd;stroke:#000000;stroke-width:1.25;stroke-linecap:butt;stroke-linejoin:miter;stroke-opacity:1;stroke-miterlimit:4;stroke-dasharray:none" />
+    <path
+       id="path3355"
+       d="M 711,450.53297 L 711,410.62445"
+       style="fill:none;fill-opacity:0.75;fill-rule:evenodd;stroke:#000000;stroke-width:1.25;stroke-linecap:butt;stroke-linejoin:miter;marker-end:url(#Arrow2Mend);stroke-miterlimit:4;stroke-dasharray:none;stroke-opacity:1" />
+    <path
+       id="path3344"
+       d="M 281.18218,383.28102 L 281.18218,361.78102 L 711.79281,360.78102 L 711.79281,383.28102"
+       style="fill:none;fill-opacity:0.75;fill-rule:evenodd;stroke:#000000;stroke-width:1.25;stroke-linecap:butt;stroke-linejoin:miter;stroke-opacity:1;stroke-miterlimit:4;stroke-dasharray:none" />
+    <rect
+       y="383.1962"
+       x="425.625"
+       height="23.200001"
+       width="141.64481"
+       id="rect3376"
+       style="fill:#ffffff;fill-opacity:1;stroke:#000000;stroke-width:1.25;stroke-miterlimit:4;stroke-dasharray:none;stroke-opacity:1" />
+    <text
+       sodipodi:linespacing="100%"
+       id="use1329"
+       y="397.73215"
+       x="497.24741"
+       style="font-size:9.60000038px;font-style:normal;font-variant:normal;font-weight:normal;font-stretch:normal;text-align:center;line-height:100%;writing-mode:lr-tb;text-anchor:middle;fill:#000000;fill-opacity:1;stroke:none;stroke-width:1px;stroke-linecap:butt;stroke-linejoin:miter;stroke-opacity:1;font-family:Bitstream Vera Sans"
+       xml:space="preserve"><tspan
+         sodipodi:role="line"
+         id="tspan1382"
+         x="497.24741"
+         y="397.73215">list_update_tag</tspan></text>
+    <path
+       id="path3347"
+       d="M 497.79886,384.13056 L 497.79886,323.40547"
+       style="fill:none;fill-opacity:0.75;fill-rule:evenodd;stroke:#000000;stroke-width:1.25;stroke-linecap:butt;stroke-linejoin:miter;marker-end:url(#Arrow2Mend);stroke-miterlimit:4;stroke-dasharray:none;stroke-opacity:1" />
+    <text
+       xml:space="preserve"
+       style="font-size:9.60000038px;font-style:normal;font-variant:normal;font-weight:normal;font-stretch:normal;text-align:center;line-height:100%;writing-mode:lr-tb;text-anchor:middle;fill:#000000;fill-opacity:1;stroke:none;stroke-width:1.25;stroke-linecap:butt;stroke-linejoin:miter;stroke-miterlimit:4;stroke-dasharray:none;stroke-opacity:1;font-family:Bitstream Vera Sans"
+       x="61.152512"
+       y="577.07874"
+       id="text1423"
+       sodipodi:linespacing="100%"><tspan
+         sodipodi:role="line"
+         id="tspan1418"
+         x="61.152512"
+         y="577.07874">rb_tree_tag</tspan></text>
+    <text
+       sodipodi:linespacing="100%"
+       id="text1427"
+       y="577.07874"
+       x="277.95251"
+       style="font-size:9.60000038px;font-style:normal;font-variant:normal;font-weight:normal;font-stretch:normal;text-align:center;line-height:100%;writing-mode:lr-tb;text-anchor:middle;fill:#000000;fill-opacity:1;stroke:none;stroke-width:1.25;stroke-linecap:butt;stroke-linejoin:miter;stroke-miterlimit:4;stroke-dasharray:none;stroke-opacity:1;font-family:Bitstream Vera Sans"
+       xml:space="preserve"><tspan
+         sodipodi:role="line"
+         id="tspan1414"
+         x="277.95252"
+         y="577.07874">splay_tree_tag</tspan></text>
+    <path
+       style="fill:none;fill-opacity:0.75;fill-rule:evenodd;stroke:#000000;stroke-width:1.25;stroke-linecap:butt;stroke-linejoin:miter;stroke-opacity:1;stroke-miterlimit:4;stroke-dasharray:none"
+       d="M 61.42308,563.28102 L 61.42308,541.78102 L 277.97121,540.78102 L 277.97121,563.28102"
+       id="path1431" />
+    <path
+       style="fill:none;fill-opacity:0.75;fill-rule:evenodd;stroke:#000000;stroke-width:1.25;stroke-linecap:butt;stroke-linejoin:miter;marker-end:url(#Arrow2Mend);stroke-miterlimit:4;stroke-dasharray:none;stroke-opacity:1"
+       d="M 170.9525,561.5357 L 170.9525,503.81235"
+       id="path1433" />
+    <rect
+       y="562.17499"
+       x="347.8916"
+       height="23.200001"
+       width="80.769417"
+       id="rect1469"
+       style="fill:#ffffff;fill-opacity:1;stroke:#000000;stroke-width:0.94391561;stroke-miterlimit:4;stroke-dasharray:none;stroke-opacity:1" />
+    <text
+       sodipodi:linespacing="100%"
+       id="text1471"
+       y="576.71094"
+       x="388.80002"
+       style="font-size:9.60000038px;font-style:normal;font-variant:normal;font-weight:normal;font-stretch:normal;text-align:center;line-height:100%;writing-mode:lr-tb;text-anchor:middle;fill:#000000;fill-opacity:1;stroke:none;stroke-width:1px;stroke-linecap:butt;stroke-linejoin:miter;stroke-opacity:1;font-family:Bitstream Vera Sans"
+       xml:space="preserve"><tspan
+         sodipodi:role="line"
+         id="tspan1412"
+         x="388.80002"
+         y="576.71094">pat_trie_tag</tspan></text>
+    <path
+       id="path1475"
+       d="M 389.35146,563.10936 L 389.35146,502.38427"
+       style="fill:none;fill-opacity:0.75;fill-rule:evenodd;stroke:#000000;stroke-width:1.25;stroke-linecap:butt;stroke-linejoin:miter;marker-end:url(#Arrow2Mend);stroke-miterlimit:4;stroke-dasharray:none;stroke-opacity:1" />
+    <text
+       xml:space="preserve"
+       style="font-size:9.60000038px;font-style:normal;font-variant:normal;font-weight:normal;font-stretch:normal;text-align:center;line-height:100%;writing-mode:lr-tb;text-anchor:middle;fill:#000000;fill-opacity:1;stroke:none;stroke-width:1.25;stroke-linecap:butt;stroke-linejoin:miter;stroke-miterlimit:4;stroke-dasharray:none;stroke-opacity:1;font-family:Bitstream Vera Sans"
+       x="173.95251"
+       y="577.07874"
+       id="text1487"
+       sodipodi:linespacing="100%"><tspan
+         sodipodi:role="line"
+         id="tspan1416"
+         x="173.95251"
+         y="577.07874">ov_tree_tag</tspan></text>
+  </g>
+</svg>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/assoc_container_traits.html b/libstdc++-v3/docs/html/ext/pb_ds/assoc_container_traits.html
new file mode 100644
index 00000000000..245b81c9409
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/assoc_container_traits.html
@@ -0,0 +1,170 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+  <meta name="generator" content=
+  "HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+
+  <title>container_traits Interface</title>
+  <meta http-equiv="Content-Type" content=
+  "text/html; charset=us-ascii" />
+  </head>
+
+<body>
+  <div id="page">
+    <h1><tt>container_traits</tt> Interface</h1>
+
+    <p>Traits of an associative-container based on its underlying
+    data structure.</p>
+
+    <p>Defined in: <a href=
+    "../../../../include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
+
+    <h2><a name="link1" id="link1">Template Parameters</a></h2>
+
+    <table class="c1" width="100%" border="1" summary=
+    "Template Parameters">
+      <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="Cntnr59189" id="Cntnr59189"><b>class</b> Cntnr</a>
+</pre>
+        </td>
+
+        <td>
+          <p>Container type.</p>
+        </td>
+
+        <td>-</td>
+      </tr>
+    </table>
+
+    <h2><a name="link2" id="link2">Public Types and
+    Constants</a></h2>
+
+    <h3><a name="link3" id="link3">Container Attributes</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Types">
+      <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="invalidation_guarantee3793555937" id=
+"invalidation_guarantee3793555937">invalidation_guarantee</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+Invalidation guarantee.
+</pre>
+        </td>
+
+        <td>
+          <p>Invalidation-guarantee type.</p>
+
+          <p>This is either <a href=
+          "basic_invalidation_guarantee.html"><span class=
+          "c2"><tt>basic_invalidation_guarantee</tt></span></a>,
+          <a href="point_invalidation_guarantee.html"><span class=
+          "c2"><tt>point_invalidation_guarantee</tt></span></a>, or
+          <a href="range_invalidation_guarantee.html"><span class=
+          "c2"><tt>range_invalidation_guarantee</tt></span></a></p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="order_preserving1910229172" id=
+"order_preserving1910229172">order_preserving</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+True only if Cntnr objects guarantee storing  keys by order.
+</pre>
+        </td>
+
+        <td>
+          <p>Order-preserving indicator.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="erase_can_throw153323856" id=
+"erase_can_throw153323856">erase_can_throw</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+True only if erasing a key can throw.
+</pre>
+        </td>
+
+        <td>
+          <p>Erase-throw indicator.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="reverse_iteration894617078" id=
+"reverse_iteration894617078">reverse_iteration</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+True only reverse iterators are supported.
+</pre>
+        </td>
+
+        <td>
+          <p>Reverse iteration indicator.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="split_join_can_throw3200477759" id=
+"split_join_can_throw3200477759">split_join_can_throw</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+True only if split or join operations can throw.
+</pre>
+        </td>
+
+        <td>
+          <p>Split-join throw indicator.</p>
+        </td>
+      </tr>
+    </table>
+  </div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/assoc_design.html b/libstdc++-v3/docs/html/ext/pb_ds/assoc_design.html
new file mode 100644
index 00000000000..6c501e26bbd
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/assoc_design.html
@@ -0,0 +1,46 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+  <meta name="generator" content=
+  "HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+
+  <title>Associative Containers</title>
+  <meta http-equiv="Content-Type" content=
+  "text/html; charset=us-ascii" />
+  </head>
+
+<body>
+  <div id="page">
+    <h1>Associative-Container Design</h1>
+
+    <ol>
+      <li><a href="ds_gen.html">Data-Structure Genericity</a></li>
+
+      <li class="c1">Genericity discusses generic manipulation of
+      containers based on different underlying
+      data structures.</li>
+
+      <li class="c1">Genericity discusses generic manipulation of
+      containers with different mapping semantics.</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="trie_based_containers.html">Trie-Based
+      Containers</a> describes the design and policies of
+      trie-based containers.</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="lu_based_containers.html">List-Based
+      Containers</a> describes the design and policies of
+      list-based containers with update policies.</li>
+    </ol>
+  </div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/assoc_examples.html b/libstdc++-v3/docs/html/ext/pb_ds/assoc_examples.html
new file mode 100644
index 00000000000..6c166987fcb
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/assoc_examples.html
@@ -0,0 +1,174 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+  <meta name="generator" content=
+  "HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+
+  <title>Examples</title>
+  <meta http-equiv="Content-Type" content=
+  "text/html; charset=us-ascii" />
+  </head>
+
+<body>
+  <div id="page">
+    <h1>Associative-Container Examples</h1>
+
+    <h2><a name="basic_usage" id="basic_usage">Basic Use</a></h2>
+
+    <ol>
+      <li><a href=
+      "../../../../testsuite/ext/pb_ds/example/basic_map.cc"><tt>basic_map.cc</tt></a>
+      Basic use of "maps".</li>
+
+      <li><a href=
+      "../../../../testsuite/ext/pb_ds/example/basic_set.cc"><tt>basic_set.cc</tt></a>
+      Basic use of "sets".</li>
+
+      <li><a href=
+      "../../../../testsuite/ext/pb_ds/example/erase_if.cc"><tt>erase_if.cc</tt></a>
+      Conditionally erasing values from a container object.</li>
+    </ol>
+
+    <h2><a name="generics" id="generics">Generics</a></h2>
+
+    <ol>
+      <li><a href=
+      "../../../../testsuite/ext/pb_ds/example/assoc_container_traits.cc"><tt>assoc_container_traits.cc</tt></a>
+      Using <a href=
+      "assoc_container_traits.html"><tt>container_traits</tt></a> to query
+      about underlying data structure behavior.</li>
+
+      <li><a href=
+      "../../../../testsuite/ext/pb_ds/example/hash_find_neg.cc"><tt>hash_find_neg.cc</tt></a>
+      A non-compiling example showing wrong use of finding keys in
+      hash-based containers.</li>
+    </ol>
+
+    <h2><a name="hash_based" id="hash_based">Hash-Based
+    Containers</a></h2>
+
+  
+    <h3><a name="resize_related" id="resize_related">Resize
+    Related</a></h3>
+
+
+    <ol>
+      <li><a href=
+      "../../../../testsuite/ext/pb_ds/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_ds/example/hash_resize_neg.cc"><tt>hash_resize_neg.cc</tt></a>
+      A non-compiling example showing how not to resize a
+      hash-based container object.</li>
+
+      <li><a href=
+      "../../../../testsuite/ext/pb_ds/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_ds/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_ds/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><a name="hash_related" id="hash_related">Hash-Function
+    Related</a></h3>
+
+
+    <ol>
+      <li><a href=
+      "../../../../testsuite/ext/pb_ds/example/hash_mod.cc"><tt>hash_mod.cc</tt></a>
+      Using a modulo range-hashing function for the case of an
+      unknown skewed key distribution.</li>
+
+      <li><a href=
+      "../../../../testsuite/ext/pb_ds/example/hash_shift_mask.cc"><tt>shift_mask.cc</tt></a>
+      Writing a range-hashing functor for the case of a known
+      skewed key distribution.</li>
+
+      <li><a href=
+      "../../../../testsuite/ext/pb_ds/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_ds/example/ranged_hash.cc"><tt>ranged_hash.cc</tt></a>
+      Writing a ranged-hash functor.</li>
+    </ol>
+
+    <h2><a name="tree_like_based" id=
+    "tree_like_based">Tree-Like Containers (Trees and
+    Tries)</a></h2>
+
+ 
+    <h3><a name="node_invariants" id=
+    "node_invariants">Node-Invariants</a></h3>
+
+ 
+    <ol>
+      <li><a href=
+      "../../../../testsuite/ext/pb_ds/example/tree_order_statistics.cc"><tt>tree_order_statistics.cc</tt></a>
+      Using trees for order statistics.</li>
+
+      <li><a href=
+      "../../../../testsuite/ext/pb_ds/example/tree_intervals.cc"><tt>tree_intervals.cc</tt></a>
+      Augmenting trees to support operations on line
+      intervals.</li>
+    </ol>
+
+    <h3><a name="split_join" id="split_join">Split and
+    Join</a></h3>
+
+
+    <ol>
+      <li><a href=
+      "../../../../testsuite/ext/pb_ds/example/tree_join.cc"><tt>tree_join.cc</tt></a>
+      Joining two tree-based container objects.</li>
+
+      <li><a href=
+      "../../../../testsuite/ext/pb_ds/example/trie_split.cc"><tt>trie_split.cc</tt></a>
+      Splitting a PATRICIA trie container object.</li>
+
+      <li><a href=
+      "../../../../testsuite/ext/pb_ds/example/tree_order_statistics_join.cc"><tt>tree_order_statistics_join.cc</tt></a>
+      Order statistics while joining two tree-based container
+      objects.</li>
+    </ol>
+
+    <h2><a name="trie_based" id="trie_based">Trie-Based
+    Containers</a></h2>
+
+
+    <ol>
+      <li><a href=
+      "../../../../testsuite/ext/pb_ds/example/trie_dna.cc"><tt>trie_dna.cc</tt></a>
+      Using a PATRICIA trie for DNA strings.</li>
+
+      <li><a href=
+      "../../../../testsuite/ext/pb_ds/example/trie_prefix_search.cc"><tt>trie_prefix_search.cc</tt></a>
+      Using a PATRICIA trie for finding all entries whose key
+      matches a given prefix.</li>
+    </ol>
+
+    <h2><a name="mmaps" id="mmaps">"Multimaps" and
+    "Multisets".</a></h2>
+    <ol>
+      <li><a href=
+      "../../../../testsuite/ext/pb_ds/example/basic_multimap.cc"><tt>basic_multimap.cc</tt></a>
+      Basic use of "multimaps".</li>
+
+      <li><a href=
+      "../../../../testsuite/ext/pb_ds/example/basic_multiset.cc"><tt>basic_multiset.cc</tt></a>
+      Basic use of "multisets".</li>
+    </ol>
+  </div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/assoc_performance_tests.html b/libstdc++-v3/docs/html/ext/pb_ds/assoc_performance_tests.html
new file mode 100644
index 00000000000..642f8480953
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/assoc_performance_tests.html
@@ -0,0 +1,345 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+<meta name="generator" content="HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+<title>Associative-Container Performance Tests</title>
+<meta http-equiv="Content-Type" content="text/html; charset=us-ascii" />
+</head>
+<body>
+<div id="page">
+<h1><a name="assoc" id="assoc">Associative-Container
+    Performance Tests</a></h1>
+<h2><a name="settings" id="settings">Settings</a></h2>
+<p>This section describes performance tests and their results.
+    In the following, <a href="#gcc"><u>g++</u></a>, <a href="#msvc"><u>msvc++</u></a>, and <a href="#local"><u>local</u></a> (the build used for generating this
+    documentation) stand for three different builds:</p>
+<div id="gcc_settings_div">
+<div class="c1">
+<h3><a name="gcc" id="gcc"><u>g++</u></a></h3>
+<ul>
+<li>CPU speed - cpu MHz : 2660.644</li>
+<li>Memory - MemTotal: 484412 kB</li>
+<li>Platform -
+          Linux-2.6.12-9-386-i686-with-debian-testing-unstable</li>
+<li>Compiler - g++ (GCC) 4.0.2 20050808 (prerelease)
+          (Ubuntu 4.0.1-4ubuntu9) Copyright (C) 2005 Free Software
+          Foundation, Inc. This is free software; see the source
+          for copying conditions. There is NO warranty; not even
+          for MERCHANTABILITY or FITNESS FOR A PARTICULAR
+          PURPOSE.</li>
+</ul>
+</div>
+<div class="c2"></div>
+</div>
+<div id="msvc_settings_div">
+<div class="c1">
+<h3><a name="msvc" id="msvc"><u>msvc++</u></a></h3>
+<ul>
+<li>CPU speed - cpu MHz : 2660.554</li>
+<li>Memory - MemTotal: 484412 kB</li>
+<li>Platform - Windows XP Pro</li>
+<li>Compiler - Microsoft (R) 32-bit C/C++ Optimizing
+          Compiler Version 13.10.3077 for 80x86 Copyright (C)
+          Microsoft Corporation 1984-2002. All rights
+          reserved.</li>
+</ul>
+</div>
+<div class="c2"></div>
+</div>
+<div id="local_settings_div"><div style = "border-style: dotted; border-width: 1px; border-color: lightgray"><h3><a name = "local"><u>local</u></a></h3><ul>
+<li>CPU speed - cpu MHz		: 2250.000</li>
+<li>Memory - MemTotal:      2076248 kB</li>
+<li>Platform - Linux-2.6.16-1.2133_FC5-i686-with-redhat-5-Bordeaux</li>
+<li>Compiler - g++ (GCC) 4.1.1 20060525 (Red Hat 4.1.1-1)
+Copyright (C) 2006 Free Software Foundation, Inc.
+This is free software; see the source for copying conditions.  There is NO
+warranty; not even for MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
+</li>
+</ul>
+</div><div style = "width: 100%; height: 20px"></div></div>
+<h2><a name="assoc_tests" id="assoc_tests">Tests</a></h2>
+<h3><a name="hash_based" id="hash_based">Hash-Based
+    Containers</a></h3>
+<ol>
+<li><a href="hash_text_find_find_timing_test.html">Hash-Based
+      Text <tt>find</tt> Find Timing Test</a></li>
+<li><a href="hash_random_int_find_find_timing_test.html">Hash-Based
+      Random-Integer <tt>find</tt> Find Timing Test</a></li>
+<li><a href="hash_random_int_subscript_find_timing_test.html">Hash-Based
+      Random-Integer Subscript Find Timing Test</a></li>
+<li><a href="hash_random_int_subscript_insert_timing_test.html">Hash-Based
+      Random-Integer Subscript Insert Timing Test</a></li>
+<li><a href="hash_zlob_random_int_find_find_timing_test.html">Hash-Based
+      Skewed-Distribution Random-Integer <tt>find</tt> Find Timing
+      Test</a></li>
+<li><a href="hash_random_int_erase_mem_usage_test.html">Hash-Based Erase
+      Memory Use Test</a></li>
+</ol>
+<h3><a name="tree_like_based" id="tree_like_based">Tree-Like-Based Containers</a></h3>
+<ol>
+<li><a href="tree_text_insert_timing_test.html">Tree-Based
+      and Trie-Based Text Insert Timing Test</a></li>
+<li><a href="tree_text_find_find_timing_test.html">Tree-Based
+      and Trie-Based Text <tt>find</tt> Find Timing Test</a></li>
+<li><a href="tree_text_lor_find_find_timing_test.html">Tree-Based
+      Locality-of-Reference Text <tt>find</tt> Find Timing
+      Test</a></li>
+<li><a href="tree_random_int_find_find_timing_test.html">Tree-Based
+      Random-Integer <tt>find</tt> Find Timing Test</a></li>
+<li><a href="tree_split_join_timing_test.html">Tree Split and
+      Join Timing Test</a></li>
+<li><a href="tree_order_statistics_timing_test.html">Tree
+      Order-Statistics Timing Test</a></li>
+</ol>
+<h3><a name="multimaps" id="multimaps">Multimaps</a></h3>
+<ol>
+<li><a href="multimap_text_find_timing_test_small.html">"Multimap"
+      Text Find Timing Test with <u>Small</u> Average Secondary-Key
+      to Primary-Key Ratio</a></li>
+<li><a href="multimap_text_find_timing_test_large.html">"Multimap"
+      Text Find Timing Test with <u>Large</u> Average Secondary-Key
+      to Primary-Key Ratio</a></li>
+<li><a href="multimap_text_insert_timing_test_small.html">"Multimap"
+      Text Insert Timing Test with <u>Small</u> Average
+      Secondary-Key to Primary-Key Ratio</a></li>
+<li><a href="multimap_text_insert_timing_test_large.html">"Multimap"
+      Text Insert Timing Test with <u>Large</u> Average
+      Secondary-Key to Primary-Key Ratio</a></li>
+<li><a href="multimap_text_insert_mem_usage_test_small.html">"Multimap"
+      Text Insert Memory-Use Test with <u>Small</u> Average
+      Secondary-Key to Primary-Key Ratio</a></li>
+<li><a href="multimap_text_insert_mem_usage_test_large.html">"Multimap"
+      Text Insert Memory-Use Test with <u>Large</u> Average
+      Secondary-Key to Primary-Key Ratio</a></li>
+</ol>
+<h2><a name="assoc_observations" id="assoc_observations">Observations</a></h2>
+<h3><a name="dss_family_choice" id="dss_family_choice">Underlying Data-Structure Families</a></h3>
+<p>In general, hash-based containers (see <a href="hash_based_containers.html">Design::Associative
+    Containers::Hash-Based Containers</a>) have better timing
+    performance than containers based on different underlying-data
+    structures. The main reason to choose a tree-based (see
+    <a href="tree_based_containers.html">Design::Associative
+    Containers::Tree-Based Containers</a>) or trie-based container
+    (see <a href="trie_based_containers.html">Design::Associative
+    Containers::Trie-Based Containers</a>) is if a byproduct of the
+    tree-like structure is required: either order-preservation, or
+    the ability to utilize node invariants (see <a href="tree_based_containers.html#invariants">Design::Associative
+    Containers::Tree-Based Containers::Node Invariants</a> and
+    <a href="trie_based_containers.html#invariants">Design::Associative
+    Containers::Trie-Based Containers::Node Invariants</a>). If
+    memory-use is the major factor, an ordered-vector tree (see
+    <a href="tree_based_containers.html">Design::Associative
+    Containers::Tree-Based Containers</a>) gives optimal results
+    (albeit with high modificiation costs), and a list-based
+    container (see <a href="lu_based_containers.html">Design::Associative
+    Containers::List-Based Containers</a>) gives reasonable
+    results.</p>
+<h3><a name="hash_based_types" id="hash_based_types">Hash-Based
+    Container Types</a></h3>
+<p>Hash-based containers are typically either collision
+    chaining or probing (see <a href="hash_based_containers.html">Design::Associative
+    Containers::Hash-Based Containers</a>). Collision-chaining
+    containers are more flexible internally, and so offer better
+    timing performance. Probing containers, if used for simple
+    value-types, manage memory more efficiently (they perform far
+    fewer allocation-related calls). In general, therefore, a
+    collision-chaining table should be used. A probing container,
+    conversely, might be used efficiently for operations such as
+    eliminating duplicates in a sequence, or counting the number of
+    occurrences within a sequence. Probing containers might be more
+    useful also in multithreaded applications where each thread
+    manipulates a hash-based container: in the STL, allocators have
+    class-wise semantics (see [<a href="references.html#meyers96more">meyers96more</a>] - Item 10); a
+    probing container might incur less contention in this case.</p>
+<h3><a name="hash_based_policies" id="hash_based_policies">Hash-Based Containers' Policies</a></h3>
+<p>In hash-based containers, the range-hashing scheme (see
+    <a href="hash_based_containers.html#hash_policies">Design::Associative
+    Containers::Hash-Based Containers::Hash Policies</a>) seems to
+    affect performance more than other considerations. In most
+    settings, a mask-based scheme works well (or can be made to
+    work well). If the key-distribution can be estimated a-priori,
+    a simple hash function can produce nearly uniform hash-value
+    distribution. In many other cases (<i>e.g.</i>, text hashing,
+    floating-point hashing), the hash function is powerful enough
+    to generate hash values with good uniformity properties
+    [<a href="references.html#knuth98sorting">knuth98sorting</a>];
+    a modulo-based scheme, taking into account all bits of the hash
+    value, appears to overlap the hash function in its effort.</p>
+<p>The range-hashing scheme determines many of the other
+    policies (see <a href="hash_based_containers.html#policy_interaction">Design::Hash-Based
+    Containers::Policy Interaction</a>). A mask-based scheme works
+    well with an exponential-size policy (see <a href="hash_based_containers.html#resize_policies">Design::Associative
+    Containers::Hash-Based Containers::Resize Policies</a>) ; for
+    probing-based containers, it goes well with a linear-probe
+    function (see <a href="hash_based_containers.html#hash_policies">Design::Associative
+    Containers::Hash-Based Containers::Hash Policies</a>).</p>
+<p>An orthogonal consideration is the trigger policy (see
+    <a href="hash_based_containers.html#resize_policies">Design::Associative
+    Containers::Hash-Based Containers::Resize Policies</a>). This
+    presents difficult tradeoffs. <i>E.g.</i>, different load
+    factors in a load-check trigger policy yield a
+    space/amortized-cost tradeoff.</p>
+<h3><a name="tree_like_based_types" id="tree_like_based_types">Tree-Like-Based Container
+    Types</a></h3>
+<p>In general, there are several families of tree-based
+    underlying data structures: balanced node-based trees
+    (<i>e.g.</i>, red-black or AVL trees), high-probability
+    balanced node-based trees (<i>e.g.</i>, random treaps or
+    skip-lists), competitive node-based trees (<i>e.g.</i>, splay
+    trees), vector-based "trees", and tries. (Additionally, there
+    are disk-residing or network-residing trees, such as B-Trees
+    and their numerous variants. An interface for this would have
+    to deal with the execution model and ACID guarantees; this is
+    out of the scope of this library.) Following are some
+    observations on their application to different settings.</p>
+<p>Of the balanced node-based trees, this library includes a
+    red-black tree (see <a href="tree_based_containers.html">Design::Associative
+    Containers::Tree-Based Containers</a>), as does STL (in
+    practice). This type of tree is the "workhorse" of tree-based
+    containers: it offers both reasonable modification and
+    reasonable lookup time. Unfortunately, this data structure
+    stores a huge amount of metadata. Each node must contain,
+    besides a value, three pointers and a boolean. This type might
+    be avoided if space is at a premium [<a href="references.html#austern00noset">austern00noset</a>].</p>
+<p>High-probability balanced node-based trees suffer the
+    drawbacks of deterministic balanced trees. Although they are
+    fascinating data structures, preliminary tests with them showed
+    their performance was worse than red-black trees. The library
+    does not contain any such trees, therefore.</p>
+<p>Competitive node-based trees have two drawbacks. They are
+    usually somewhat unbalanced, and they perform a large number of
+    comparisons. Balanced trees perform one comparison per each
+    node they encounter on a search path; a splay tree performs two
+    comparisons. If the keys are complex objects, <i>e.g.</i>,
+    <tt>std::string</tt>, this can increase the running time.
+    Conversely, such trees do well when there is much locality of
+    reference. It is difficult to determine in which case to prefer
+    such trees over balanced trees. This library includes a splay
+    tree (see <a href="tree_based_containers.html">Design::Associative
+    Containers::Tree-Based Containers</a>).</p>
+<p>Ordered-vector trees (see <a href="tree_based_containers.html">Design::Associative
+    Containers::Tree-Based Containers</a>) use very little space
+    [<a href="references.html#austern00noset">austern00noset</a>].
+    They do not have any other advantages (at least in this
+    implementation).</p>
+<p>Large-fan-out PATRICIA tries (see <a href="trie_based_containers.html">Design::Associative
+    Containers::Trie-Based Containers</a>) have excellent lookup
+    performance, but they do so through maintaining, for each node,
+    a miniature "hash-table". Their space efficiency is low, and
+    their modification performance is bad. These tries might be
+    used for semi-static settings, where order preservation is
+    important. Alternatively, red-black trees cross-referenced with
+    hash tables can be used. [<a href="references.html#okasaki98mereable">okasaki98mereable</a>]
+    discusses small-fan-out PATRICIA tries for integers, but the
+    cited results seem to indicate that the amortized cost of
+    maintaining such trees is higher than that of balanced trees.
+    Moderate-fan-out trees might be useful for sequences where each
+    element has a limited number of choices, <i>e.g.</i>, DNA
+    strings (see <a href="assoc_examples.html#trie_based">Examples::Associative
+    Containers::Trie-Based Containers</a>).</p>
+<h3><a name="msc" id="msc">Mapping-Semantics
+    Considerations</a></h3>
+<p>Different mapping semantics were discussed in <a href="motivation.html#assoc_mapping_semantics">Motivation::Associative
+    Containers::Alternative to Multiple Equivalent Keys</a> and
+    <a href="tutorial.html#assoc_ms">Tutorial::Associative
+    Containers::Associative Containers Others than Maps</a>. We
+    will focus here on the case where a keys can be composed into
+    primary keys and secondary keys. (In the case where some keys
+    are completely identical, it is trivial that one should use an
+    associative container mapping values to size types.) In this
+    case there are (at least) five possibilities:</p>
+<ol>
+<li>Use an associative container that allows equivalent-key
+      values (such as <tt>std::multimap</tt>)</li>
+<li>Use a unique-key value associative container that maps
+      each primary key to some complex associative container of
+      secondary keys, say a tree-based or hash-based container (see
+      <a href="tree_based_containers.html">Design::Associative
+      Containers::Tree-Based Containers</a> and <a href="hash_based_containers.html">Design::Associative
+      Containers::Hash-Based Containers</a>)</li>
+<li>Use a unique-key value associative container that maps
+      each primary key to some simple associative container of
+      secondary keys, say a list-based container (see <a href="lu_based_containers.html">Design::Associative
+      Containers::List-Based Containers</a>)</li>
+<li>Use a unique-key value associative container that maps
+      each primary key to some non-associative container
+      (<i>e.g.</i>, <tt>std::vector</tt>)</li>
+<li>Use a unique-key value associative container that takes
+      into account both primary and secondary keys.</li>
+</ol>
+<p>We do not think there is a simple answer for this (excluding
+    option 1, which we think should be avoided in all cases).</p>
+<p>If the expected ratio of secondary keys to primary keys is
+    small, then 3 and 4 seem reasonable. Both types of secondary
+    containers are relatively lightweight (in terms of memory use
+    and construction time), and so creating an entire container
+    object for each primary key is not too expensive. Option 4
+    might be preferable to option 3 if changing the secondary key
+    of some primary key is frequent - one cannot modify an
+    associative container's key, and the only possibility,
+    therefore, is erasing the secondary key and inserting another
+    one instead; a non-associative container, conversely, can
+    support in-place modification. The actual cost of erasing a
+    secondary key and inserting another one depends also on the
+    allocator used for secondary associative-containers (The tests
+    above used the standard allocator, but in practice one might
+    choose to use, <i>e.g.</i>, [<a href="references.html#boost_pool">boost_pool</a>]). Option 2 is
+    definitely an overkill in this case. Option 1 loses out either
+    immediately (when there is one secondary key per primary key)
+    or almost immediately after that. Option 5 has the same
+    drawbacks as option 2, but it has the additional drawback that
+    finding all values whose primary key is equivalent to some key,
+    might be linear in the total number of values stored (for
+    example, if using a hash-based container).</p>
+<p>If the expected ratio of secondary keys to primary keys is
+    large, then the answer is more complicated. It depends on the
+    distribution of secondary keys to primary keys, the
+    distribution of accesses according to primary keys, and the
+    types of operations most frequent.</p>
+<p>To be more precise, assume there are <i>m</i> primary keys,
+    primary key <i>i</i> is mapped to <i>n<sub>i</sub></i>
+    secondary keys, and each primary key is mapped, on average, to
+    <i>n</i> secondary keys (<i>i.e.</i>,
+    <i><b>E</b>(n<sub>i</sub>) = n</i>).</p>
+<p>Suppose one wants to find a specific pair of primary and
+    secondary keys. Using 1 with a tree based container
+    (<tt>std::multimap</tt>), the expected cost is
+    <i><b>E</b>(&Theta;(log(m) + n<sub>i</sub>)) = &Theta;(log(m) +
+    n)</i>; using 1 with a hash-based container
+    (<tt>std::tr1::unordered_multimap</tt>), the expected cost is
+    <i>&Theta;(n)</i>. Using 2 with a primary hash-based container
+    and secondary hash-based containers, the expected cost is
+    <i>O(1)</i>; using 2 with a primary tree-based container and
+    secondary tree-based containers, the expected cost is (using
+    the Jensen inequality [<a href="references.html#motwani95random">motwani95random</a>])
+    <i><b>E</b>(O(log(m) + log(n<sub>i</sub>)) = O(log(m)) +
+    <b>E</b>(O(log(n<sub>i</sub>)) = O(log(m)) + O(log(n))</i>,
+    assuming that primary keys are accessed equiprobably. 3 and 4
+    are similar to 1, but with lower constants. Using 5 with a
+    hash-based container, the expected cost is <i>O(1)</i>; using 5
+    with a tree based container, the cost is
+    <i><b>E</b>(&Theta;(log(mn))) = &Theta;(log(m) +
+    log(n))</i>.</p>
+<p>Suppose one needs the values whose primary key matches some
+    given key. Using 1 with a hash-based container, the expected
+    cost is <i>&Theta;(n)</i>, but the values will not be ordered
+    by secondary keys (which may or may not be required); using 1
+    with a tree-based container, the expected cost is
+    <i>&Theta;(log(m) + n)</i>, but with high constants; again the
+    values will not be ordered by secondary keys. 2, 3, and 4 are
+    similar to 1, but typically with lower constants (and,
+    additionally, if one uses a tree-based container for secondary
+    keys, they will be ordered). Using 5 with a hash-based
+    container, the cost is <i>&Theta;(mn)</i>.</p>
+<p>Suppose one wants to assign to a primary key all secondary
+    keys assigned to a different primary key. Using 1 with a
+    hash-based container, the expected cost is <i>&Theta;(n)</i>,
+    but with very high constants; using 1 with a tree-based
+    container, the cost is <i>&Theta;(nlog(mn))</i>. Using 2, 3,
+    and 4, the expected cost is <i>&Theta;(n)</i>, but typically
+    with far lower costs than 1. 5 is similar to 1.</p>
+</div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/assoc_regression_tests.html b/libstdc++-v3/docs/html/ext/pb_ds/assoc_regression_tests.html
new file mode 100644
index 00000000000..178aadf985f
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/assoc_regression_tests.html
@@ -0,0 +1,96 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+  <meta name="generator" content=
+  "HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+
+  <title>Associative-Container Regression Tests</title>
+  <meta http-equiv="Content-Type" content=
+  "text/html; charset=us-ascii" />
+  </head>
+
+<body>
+  <div id="page">
+    <h1>Associative-Container Regression Tests</h1>
+
+    <h2><a name="assoc_desc" id="assoc_desc">Description</a></h2>
+
+    <p>The library contains a single comprehensive regression test.
+    For a given container type in <tt>pb_ds</tt>, the test creates
+    an object of the container type and an object of the
+    corresponding STL type (<i>e.g.</i>, <tt>std::set</tt>). It
+    then performs a random sequence of methods with random
+    arguments (<i>e.g.</i>, inserts, erases, and so forth) on both
+    objects. At each operation, the test checks the return value of
+    the method, and optionally both compares <tt>pb_ds</tt>'s
+    object with the STL's object as well as performing other
+    consistency checks on <tt>pb_ds</tt>'s object (<i>e.g.</i>,
+    order preservation, when applicable, or node invariants, when
+    applicable).</p>
+
+    <p>Additionally, the test integrally checks exception safety
+    and resource leaks. This is done as follows. A special
+    allocator type, written for the purpose of the test, both
+    randomly throws an exceptions when allocations are performed,
+    and tracks allocations and de-allocations. The exceptions thrown
+    at allocations simulate memory-allocation failures; the
+    tracking mechanism checks for memory-related bugs (<i>e.g.</i>,
+    resource leaks and multiple de-allocations). Both
+    <tt>pb_ds</tt>'s containers and the containers' value-types are
+    configured to use this allocator.</p>
+
+    <p>Due to compiler constraints, the test is split into the
+    several sources, each checking only some containers.</p>
+
+    <h2><a name="assoc_tests" id="assoc_tests">Tests</a></h2>
+
+    <h3><a name="assoc_tests_set" id="assoc_tests_set">"Set"
+    Tests</a></h3>
+
+    <p>The following check all "set" types:</p>
+
+    <ol>
+      <li><a href=
+      "../../../../testsuite/ext/pb_ds/regression/hash_no_data_map_rand.cc"><tt>hash_no_data_map_rand.cc</tt></a>
+      checks all hash-based "set" types.</li>
+
+      <li><a href=
+      "../../../../testsuite/ext/pb_ds/regression/list_update_no_data_map_rand.cc"><tt>list_update_no_data_map_rand.cc</tt></a>
+      checks all list-based "set" types.</li>
+
+      <li><a href=
+      "../../../../testsuite/ext/pb_ds/regression/tree_no_data_map_rand.cc"><tt>tree_no_data_map_rand.cc</tt></a>
+      checks all tree-based "set" types.</li>
+
+      <li><a href=
+      "../../../../testsuite/ext/pb_ds/regression/trie_no_data_map_rand.cc"><tt>trie_no_data_map_rand.cc</tt></a>
+      checks all PATRICIA-trie-based "set" types.</li>
+    </ol>
+
+    <h3><a name="assoc_tests_map" id="assoc_tests_map">"Map"
+    Tests</a></h3>
+
+    <p>The following check all "map" types:</p>
+
+    <ol>
+      <li><a href=
+      "../../../../testsuite/ext/pb_ds/regression/hash_data_map_rand.cc"><tt>hash_data_map_rand.cc</tt></a>
+      checks all hash-based "map" types.</li>
+
+      <li><a href=
+      "../../../../testsuite/ext/pb_ds/regression/list_update_data_map_rand.cc"><tt>list_update_data_map_rand.cc</tt></a>
+      checks all list-based "map" types.</li>
+
+      <li><a href=
+      "../../../../testsuite/ext/pb_ds/regression/tree_data_map_rand.cc"><tt>tree_data_map_rand.cc</tt></a>
+      checks all tree-based "map" types.</li>
+
+      <li><a href=
+      "../../../../testsuite/ext/pb_ds/regression/trie_data_map_rand.cc"><tt>trie_data_map_rand.cc</tt></a>
+      checks all PATRICIA-trie-based "map" types.</li>
+    </ol>
+  </div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/assoc_tests.html b/libstdc++-v3/docs/html/ext/pb_ds/assoc_tests.html
new file mode 100644
index 00000000000..6e4474945d3
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/assoc_tests.html
@@ -0,0 +1,24 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+  <meta name="generator" content=
+  "HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+
+  <title>Associative-Container Tests</title>
+  <meta http-equiv="Content-Type" content=
+  "text/html; charset=us-ascii" />
+  </head>
+
+<body>
+  <div id="page">
+    <h1>Associative-Container Tests</h1>
+
+    <p><a href="assoc_regression_tests.html">Associative-Container
+    Regression Tests</a> describes the regression tests; <a href=
+    "assoc_performance_tests.html">Associative-Container
+    Performance Tests</a> describes the performance tests.</p>
+  </div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/associative_container_tag.html b/libstdc++-v3/docs/html/ext/pb_ds/associative_container_tag.html
new file mode 100644
index 00000000000..5c44efe231c
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/associative_container_tag.html
@@ -0,0 +1,47 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+  <meta name="generator" content=
+  "HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+
+  <title>associative_container_tag Interface</title>
+  <meta http-equiv="Content-Type" content=
+  "text/html; charset=us-ascii" />
+  </head>
+
+<body>
+  <div id="page">
+    <h1><tt>associative_container_tag</tt> Interface</h1>
+
+    <p>Basic associative-container data structure tag.</p>
+
+    <p>Defined in: <a href=
+    "../../../../include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
+
+    <h2><a name="link1" id="link1">Base Classes</a></h2>
+
+    <table class="c1" width="100%" border="1" summary="Bases">
+      <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="container_tag.html"><span class=
+"c2"><tt>container_tag</tt></span></a>
+</pre>
+        </td>
+
+        <td>
+          <p>public</p>
+        </td>
+      </tr>
+    </table>
+  </div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/balls_and_bins.png b/libstdc++-v3/docs/html/ext/pb_ds/balls_and_bins.png
new file mode 100644
index 00000000000..529c3ae41bc
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/balls_and_bins.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/basic_hash_table.html b/libstdc++-v3/docs/html/ext/pb_ds/basic_hash_table.html
new file mode 100644
index 00000000000..a6c569c2bb1
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/basic_hash_table.html
@@ -0,0 +1,436 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+  <meta name="generator" content=
+  "HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+
+  <title>basic_hash_table Interface</title>
+  <meta http-equiv="Content-Type" content=
+  "text/html; charset=us-ascii" />
+  </head>
+
+<body>
+  <div id="page">
+    <h1><tt>basic_hash_table</tt> Interface</h1>
+
+    <p>An abstract basic hash-based associative container.</p>
+
+    <p>Defined in: <a href=
+    "../../../../include/ext/pb_ds/assoc_container.hpp"><tt>assoc_container.hpp</tt></a></p>
+
+    <h2><a name="link1" id="link1">Template Parameters</a></h2>
+
+    <table class="c1" width="100%" border="1" summary=
+    "Template Parameters">
+      <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="Key2501" id="Key2501"><b>typename</b> Key</a>
+</pre>
+        </td>
+
+        <td>
+          <p>Key type.</p>
+        </td>
+
+        <td>-</td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="Mapped318655" id="Mapped318655"><b>typename</b> Mapped</a>
+</pre>
+        </td>
+
+        <td>
+          <p>Mapped type.</p>
+        </td>
+
+        <td>-</td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="Hash_Fn1515835" id=
+"Hash_Fn1515835"><b>class</b> Hash_Fn</a>
+</pre>
+        </td>
+
+        <td>
+          <p>Hash functor.</p>
+        </td>
+
+        <td>-</td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="Eq_Fn60085" id="Eq_Fn60085"><b>class</b> Eq_Fn</a>
+</pre>
+        </td>
+
+        <td>
+          <p>Equivalence functor.</p>
+        </td>
+
+        <td>-</td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="Resize_Policy566860465" id=
+"Resize_Policy566860465"><b>class</b> Resize_Policy</a>
+</pre>
+        </td>
+
+        <td>
+          <p>Resize policy.</p>
+        </td>
+
+        <td>-</td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="Store_Hash218262104" id=
+"Store_Hash218262104"><b>bool</b> 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="Tag278938" id="Tag278938"><b>class</b> Tag</a>
+</pre>
+        </td>
+
+        <td>
+          <p>Mapped-structure tag.</p>
+        </td>
+
+        <td>-</td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="Allocator35940069" id=
+"Allocator35940069"><b>class</b> Allocator</a>
+</pre>
+        </td>
+
+        <td>
+          <p>Allocator type.</p>
+        </td>
+
+        <td>-</td>
+      </tr>
+    </table>
+
+    <h2><a name="link2" id="link2">Base Classes</a></h2>
+
+    <table class="c1" width="100%" border="1" summary="Bases">
+      <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_Policy566860465"><tt>Resize_Policy</tt></a>
+</pre>
+        </td>
+
+        <td>
+          <p>public</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a href="container_base.html"><span class=
+"c2"><tt>container_base</tt></span></a>
+</pre>
+        </td>
+
+        <td>
+          <p>public</p>
+        </td>
+      </tr>
+    </table>
+
+    <h2><a name="link3" id="link3">Public Types and
+    Constants</a></h2>
+
+    <h3><a name="link4" id="link4">Policy Definitions</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Types">
+      <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_fn2015995" id="hash_fn2015995">hash_fn</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<a href="#Hash_Fn1515835"><tt>Hash_Fn</tt></a>
+</pre>
+        </td>
+
+        <td>
+          <p>Hash functor type.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="eq_fn80245" id="eq_fn80245">eq_fn</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<a href="#Eq_Fn60085"><tt>Eq_Fn</tt></a>
+</pre>
+        </td>
+
+        <td>
+          <p>Equivalence functor type.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="resize_policy4084493169" id=
+"resize_policy4084493169">resize_policy</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<a href="#Resize_Policy566860465"><tt>Resize_Policy</tt></a>
+</pre>
+        </td>
+
+        <td>
+          <p>Resize policy type.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="store_hash280766104" id=
+"store_hash280766104">store_hash</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<a href="#Store_Hash218262104"><tt>Store_Hash</tt></a>
+</pre>
+        </td>
+
+        <td>
+          <p>Indicates whether a hash value is stored with each
+          entry.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h2><a name="link5" id="link5">Public Methods</a></h2>
+
+    <h3><a name="link6" id="link6">Constructors, Destructor, and
+    Related</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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_table
+  ()
+</pre>
+        </td>
+
+        <td>
+          <p>Destructor.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h3><a name="link7" id="link7">Policy Access Methods</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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_fn2015995"><tt>hash_fn</tt></a> &amp;
+  get_hash_fn
+  ()
+</pre>
+        </td>
+
+        <td>
+          <p>Access to the <a href=
+          "#hash_fn2015995"><tt>hash_fn</tt></a> object.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<b>const</b> <a href="#hash_fn2015995"><tt>hash_fn</tt></a> &amp;
+  get_hash_fn
+  () <b>const</b>
+</pre>
+        </td>
+
+        <td>
+          <p>Const access to the <a href=
+          "#hash_fn2015995"><tt>hash_fn</tt></a> object.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a href="#eq_fn80245"><tt>eq_fn</tt></a> &amp;
+  get_eq_fn
+  ()
+</pre>
+        </td>
+
+        <td>
+          <p>Access to the <a href="#eq_fn80245"><tt>eq_fn</tt></a>
+          object.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<b>const</b> <a href="#eq_fn80245"><tt>eq_fn</tt></a> &amp;
+  get_eq_fn
+  () <b>const</b>
+</pre>
+        </td>
+
+        <td>
+          <p>Const access to the <a href=
+          "#eq_fn80245"><tt>eq_fn</tt></a> object.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a href="#resize_policy4084493169"><tt>resize_policy</tt></a> &amp;
+  get_resize_policy
+  ()
+</pre>
+        </td>
+
+        <td>
+          <p>Access to the <a href=
+          "#resize_policy4084493169"><tt>resize_policy</tt></a>
+          object.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<b>const</b> <a href=
+"#resize_policy4084493169"><tt>resize_policy</tt></a> &amp;
+  get_resize_policy
+  () <b>const</b>
+</pre>
+        </td>
+
+        <td>
+          <p>Const access to the <a href=
+          "#resize_policy4084493169"><tt>resize_policy</tt></a>
+          object.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h2><a name="link8" id="link8">Private Methods</a></h2>
+
+    <h3><a name="link9" id="link9">Resize Methods</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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 <span class=
+          "c1"><tt>new_size</tt></span>.</p>
+        </td>
+      </tr>
+    </table>
+  </div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/basic_hash_tag.html b/libstdc++-v3/docs/html/ext/pb_ds/basic_hash_tag.html
new file mode 100644
index 00000000000..8110c0dfc4f
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/basic_hash_tag.html
@@ -0,0 +1,47 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+  <meta name="generator" content=
+  "HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+
+  <title>basic_hash_tag Interface</title>
+  <meta http-equiv="Content-Type" content=
+  "text/html; charset=us-ascii" />
+  </head>
+
+<body>
+  <div id="page">
+    <h1><tt>basic_hash_tag</tt> Interface</h1>
+
+    <p>Basic hash data structure tag.</p>
+
+    <p>Defined in: <a href=
+    "../../../../include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
+
+    <h2><a name="link1" id="link1">Base Classes</a></h2>
+
+    <table class="c1" width="100%" border="1" summary="Bases">
+      <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="associative_container_tag.html"><span class=
+"c2"><tt>associative_container_tag</tt></span></a>
+</pre>
+        </td>
+
+        <td>
+          <p>public</p>
+        </td>
+      </tr>
+    </table>
+  </div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/basic_invalidation_guarantee.html b/libstdc++-v3/docs/html/ext/pb_ds/basic_invalidation_guarantee.html
new file mode 100644
index 00000000000..c4c242bbded
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/basic_invalidation_guarantee.html
@@ -0,0 +1,26 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+  <meta name="generator" content=
+  "HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+
+  <title>basic_invalidation_guarantee Interface</title>
+  <meta http-equiv="Content-Type" content=
+  "text/html; charset=us-ascii" />
+  </head>
+
+<body>
+  <div id="page">
+    <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>
+
+    <p>Defined in: <a href=
+    "../../../../include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
+  </div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/basic_tree.html b/libstdc++-v3/docs/html/ext/pb_ds/basic_tree.html
new file mode 100644
index 00000000000..f66d7a9f7a6
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/basic_tree.html
@@ -0,0 +1,660 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+  <meta name="generator" content=
+  "HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+
+  <title>basic_tree Interface</title>
+  <meta http-equiv="Content-Type" content=
+  "text/html; charset=us-ascii" />
+  </head>
+
+<body>
+  <div id="page">
+    <h1><tt>basic_tree</tt> Interface</h1>
+
+    <p>An abstract basic tree-like-based associative container.</p>
+
+    <p>Defined in: <a href=
+    "../../../../include/ext/pb_ds/assoc_container.hpp"><tt>assoc_container.hpp</tt></a></p>
+
+    <h2><a name="link1" id="link1">Template Parameters</a></h2>
+
+    <table class="c1" width="100%" border="1" summary=
+    "Template Parameters">
+      <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="Key2501" id="Key2501"><b>typename</b> Key</a>
+</pre>
+        </td>
+
+        <td>
+          <p>Key type.</p>
+        </td>
+
+        <td>-</td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="Mapped318655" id="Mapped318655"><b>typename</b> Mapped</a>
+</pre>
+        </td>
+
+        <td>
+          <p>Mapped type.</p>
+        </td>
+
+        <td>-</td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="Tag278938" id="Tag278938"><b>class</b> Tag</a>
+</pre>
+        </td>
+
+        <td>
+          <p>Mapped-structure tag.</p>
+        </td>
+
+        <td>-</td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="Node_Update841554648" id=
+"Node_Update841554648"><b>class</b> Node_Update</a>
+</pre>
+        </td>
+
+        <td>
+          <p>Node updater.</p>
+
+          <p>Restores node-invariants when invalidated.</p>
+        </td>
+
+        <td>-</td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="Policy_Tl42017403" id=
+"Policy_Tl42017403"><b>class</b> Policy_Tl</a>
+</pre>
+        </td>
+
+        <td>
+          <p>Policy typelist.</p>
+
+          <p>Contains subclasses' policies.</p>
+        </td>
+
+        <td>-</td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="Allocator35940069" id=
+"Allocator35940069"><b>class</b> Allocator</a>
+</pre>
+        </td>
+
+        <td>
+          <p>Allocator type.</p>
+        </td>
+
+        <td>-</td>
+      </tr>
+    </table>
+
+    <h2><a name="link2" id="link2">Base Classes</a></h2>
+
+    <table class="c1" width="100%" border="1" summary="Bases">
+      <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_Update841554648"><tt>Node_Update</tt></a>
+</pre>
+        </td>
+
+        <td>
+          <p>public</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a href="container_base.html"><span class=
+"c2"><tt>container_base</tt></span></a>
+</pre>
+        </td>
+
+        <td>
+          <p>public</p>
+        </td>
+      </tr>
+    </table>
+
+    <h2><a name="link3" id="link3">Public Types and
+    Constants</a></h2>
+
+    <h3><a name="link4" id="link4">Key-Type Definitions</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Types">
+      <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_reference3185471705" id=
+"const_key_reference3185471705">const_key_reference</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<b>typename</b> <a href="container_base.html"><span class=
+"c2"><tt>container_base</tt></span></a>::const_key_reference
+</pre>
+        </td>
+
+        <td>
+          <p>Const key reference type.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h3><a name="link5" id="link5">Policy Definitions</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Types">
+      <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="node_update2404554648" id=
+"node_update2404554648">node_update</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<a href="#Node_Update841554648"><tt>Node_Update</tt></a>
+</pre>
+        </td>
+
+        <td>
+          <p>Node updater type.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h3><a name="link6" id="link6">Iterator Definitions</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Types">
+      <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_iterator98626788" id=
+"const_iterator98626788">const_iterator</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<b>typename</b> <a href="container_base.html"><span class=
+"c2"><tt>container_base</tt></span></a>::const_iterator
+</pre>
+        </td>
+
+        <td>
+          <p>Const range-type iterator.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="iterator10418194" id="iterator10418194">iterator</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<b>typename</b> <a href="container_base.html"><span class=
+"c2"><tt>container_base</tt></span></a>::iterator
+</pre>
+        </td>
+
+        <td>
+          <p>Range-type iterator.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="const_reverse_iterator4151293083" id=
+"const_reverse_iterator4151293083">const_reverse_iterator</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+Const reverse range-type iterator.
+</pre>
+        </td>
+
+        <td>
+          <p>Const reverse range-type <a href=
+          "#iterator10418194"><tt>iterator</tt></a>.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="reverse_iterator1896910345" id=
+"reverse_iterator1896910345">reverse_iterator</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+Reverse range-type iterator.<br />
+If <a href="#Mapped318655"><tt>Mapped</tt></a> is <a href=
+"null_mapped_type.html"><span class=
+"c2"><tt>null_mapped_type</tt></span></a>, then this is synonymous to <a href="#const_reverse_iterator4151293083"><tt>const_reverse_iterator</tt></a>
+</pre>
+        </td>
+
+        <td>
+          <p>Reverse range-type <a href=
+          "#iterator10418194"><tt>iterator</tt></a>.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h2><a name="link7" id="link7">Public Methods</a></h2>
+
+    <h3><a name="link8" id="link8">Constructors, Destructor, and
+    Related</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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
+  ()
+</pre>
+        </td>
+
+        <td>
+          <p>Destructor.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h3><a name="link9" id="link9">Policy Access Methods</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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="#node_update2404554648"><tt>node_update</tt></a> &amp;
+  get_node_update
+  ()
+</pre>
+        </td>
+
+        <td>
+          <p>Access to the <a href=
+          "#node_update2404554648"><tt>node_update</tt></a>
+          object.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<b>const</b> <a href=
+"#node_update2404554648"><tt>node_update</tt></a> &amp;
+  get_node_update
+  () <b>const</b>
+</pre>
+        </td>
+
+        <td>
+          <p>Const access to the <a href=
+          "#node_update2404554648"><tt>node_update</tt></a>
+          object.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h3><a name="link10" id="link10">Find Methods</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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="#iterator10418194"><tt>iterator</tt></a>
+  lower_bound
+  (<a href=
+"#const_key_reference3185471705"><tt>const_key_reference</tt></a> r_key)
+</pre>
+        </td>
+
+        <td>
+          <p>Returns an <a href=
+          "#iterator10418194"><tt>iterator</tt></a> corresponding
+          to the entry whose key is the smallest one at least as
+          large as <span class="c1"><tt>r_key</tt></span>.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a href="#const_iterator98626788"><tt>const_iterator</tt></a>
+  lower_bound
+  (<a href=
+"#const_key_reference3185471705"><tt>const_key_reference</tt></a> r_key) <b>const</b>
+</pre>
+        </td>
+
+        <td>
+          <p>Returns a <tt><b>const</b></tt> <a href=
+          "#iterator10418194"><tt>iterator</tt></a> corresponding
+          to the entry whose key is the smallest one at least as
+          large as <span class="c1"><tt>r_key</tt></span>.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a href="#iterator10418194"><tt>iterator</tt></a>
+  upper_bound
+  (<a href=
+"#const_key_reference3185471705"><tt>const_key_reference</tt></a> r_key)
+</pre>
+        </td>
+
+        <td>
+          <p>Returns an <a href=
+          "#iterator10418194"><tt>iterator</tt></a> corresponding
+          to the entry whose key is the smallest one larger than
+          <span class="c1"><tt>r_key</tt></span>.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a href="#const_iterator98626788"><tt>const_iterator</tt></a>
+  upper_bound
+  (<a href=
+"#const_key_reference3185471705"><tt>const_key_reference</tt></a> r_key) <b>const</b>
+</pre>
+        </td>
+
+        <td>
+          <p>Returns a <a href=
+          "#const_iterator98626788"><tt>const_iterator</tt></a>
+          corresponding to the entry whose key is the smallest one
+          larger than <span class="c1"><tt>r_key</tt></span>.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h3><a name="link11" id="link11">Erase Methods</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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="#iterator10418194"><tt>iterator</tt></a>
+  erase
+  (<a href="#iterator10418194"><tt>iterator</tt></a> it)
+</pre>
+        </td>
+
+        <td>
+          <p>Erases the value_type corresponding to the <a href=
+          "#iterator10418194"><tt>iterator</tt></a> <span class=
+          "c1"><tt>it</tt></span>. Returns the <a href=
+          "#iterator10418194"><tt>iterator</tt></a> corresponding
+          to the next value_type.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a href="#reverse_iterator1896910345"><tt>reverse_iterator</tt></a>
+  erase
+  (<a href=
+"#reverse_iterator1896910345"><tt>reverse_iterator</tt></a> it)
+</pre>
+        </td>
+
+        <td>
+          <p>Erases the value_type corresponding to the <a href=
+          "#reverse_iterator1896910345"><tt>reverse_iterator</tt></a>
+          <span class="c1"><tt>it</tt></span>. Returns the <a href=
+          "#reverse_iterator1896910345"><tt>reverse_iterator</tt></a>
+          corresponding to the previous value_type.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h3><a name="link12" id="link12">Iteration Methods</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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="#reverse_iterator1896910345"><tt>reverse_iterator</tt></a>
+  rbegin
+  ()
+</pre>
+        </td>
+
+        <td>
+          <p>Returns a <a href=
+          "#reverse_iterator1896910345"><tt>reverse_iterator</tt></a>
+          corresponding to the last value_type in the
+          container.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a href=
+"#const_reverse_iterator4151293083"><tt>const_reverse_iterator</tt></a>
+  rbegin
+  () <b>const</b>
+</pre>
+        </td>
+
+        <td>
+          <p>Returns a <a href=
+          "#const_reverse_iterator4151293083"><tt>const_reverse_iterator</tt></a>
+          corresponding to the last value_type in the
+          container.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a href="#reverse_iterator1896910345"><tt>reverse_iterator</tt></a>
+  rend
+  ()
+</pre>
+        </td>
+
+        <td>
+          <p>Returns a <a href=
+          "#reverse_iterator1896910345"><tt>reverse_iterator</tt></a>
+          corresponding to the just-before-first value_type in the
+          container.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a href=
+"#const_reverse_iterator4151293083"><tt>const_reverse_iterator</tt></a>
+  rend
+  () <b>const</b>
+</pre>
+        </td>
+
+        <td>
+          <p>Returns a <a href=
+          "#const_reverse_iterator4151293083"><tt>const_reverse_iterator</tt></a>
+          corresponding to the just-before-first value_type in the
+          container.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h3><a name="link13" id="link13">Split and join
+    Methods</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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
+  (<span class=
+"c2"><tt>basic_tree</tt></span> &amp;other)
+</pre>
+        </td>
+
+        <td>
+          <p>Joins two trees. When this function returns,
+          <span class="c1"><tt>other</tt></span> will be
+          empty.</p>
+
+          <p>When calling this method, <span class=
+          "c1"><tt>other</tt></span>'s keys must be all larger or
+          all smaller than this object's keys, and <span class=
+          "c1"><tt>other</tt></span>'s policies must be
+          equivalent to this object's policies.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<b>void</b>
+  split
+  (<a href=
+"#const_key_reference3185471705"><tt>const_key_reference</tt></a> r_key, 
+    <span class=
+"c2"><tt>basic_tree</tt></span> &amp;other)
+</pre>
+        </td>
+
+        <td>
+          <p>Splits into two trees. When this function returns,
+          <span class="c1"><tt>other</tt></span> will contain
+          only keys larger than <span class=
+          "c1"><tt>r_key</tt></span>.</p>
+
+          <p>When calling this method, <span class=
+          "c1"><tt>other</tt></span>'s policies must be
+          equivalent to this object's policies.</p>
+        </td>
+      </tr>
+    </table>
+  </div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/basic_tree_assoc_container_const_node_iterator.html b/libstdc++-v3/docs/html/ext/pb_ds/basic_tree_assoc_container_const_node_iterator.html
new file mode 100644
index 00000000000..5647f551e95
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/basic_tree_assoc_container_const_node_iterator.html
@@ -0,0 +1,383 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+  <meta name="generator" content=
+  "HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+
+  <title>tree::const_node_iterator
+  Interface</title>
+  <meta http-equiv="Content-Type" content=
+  "text/html; charset=us-ascii" />
+  </head>
+
+<body>
+  <div id="page">
+    <h1><tt><span class=
+    "c2"><tt>tree</tt></span>::const_node_iterator</tt>
+    Interface</h1>
+
+    <p>Const node iterator.</p>
+
+    <p>This is an &amp;qout;iterator to an iterator&amp;qout; - it
+    iterates over nodes, and de-referencing it returns one of the
+    tree's iterators</p>
+
+    <h2><a name="link1" id="link1">Public Types and
+    Constants</a></h2>
+
+    <h3><a name="link2" id="link2">Iterator Definitions</a></h3>
+
+    <table class="c2" width="100%" border="1" summary="Types">
+      <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_category2821876439" id=
+"iterator_category2821876439">iterator_category</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+trivial_iterator_tag
+</pre>
+        </td>
+
+        <td>
+          <p>Category.</p>
+
+          <p>This tag identifies that the iterator has none of the
+          STL's iterators' movement abilities.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="difference_type868028452" id=
+"difference_type868028452">difference_type</a>
+</pre>
+        </td>
+
+        <td>
+          <pre class="c1">
+void
+</pre>
+        </td>
+
+        <td>
+          <p>Difference type.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h3><a name="link3" id="link3">Value-Type Definitions</a></h3>
+
+    <p>Note that a node iterator's value type is actually a tree
+    iterator.</p>
+
+    <table class="c2" width="100%" border="1" summary="Types">
+      <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_type279018186" id=
+"value_type279018186">value_type</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<a href=
+"container_base.html#const_iterator98626788"><span class="c2"><tt>container_base</tt></span>::const_iterator</a>
+</pre>
+        </td>
+
+        <td>
+          <p>Iterator's value type.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="reference54418471" id="reference54418471">reference</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<a href=
+"container_base.html#const_iterator98626788"><span class="c2"><tt>container_base</tt></span>::const_iterator</a>
+</pre>
+        </td>
+
+        <td>
+          <p>Iterator's reference type.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="const_reference495461441" id=
+"const_reference495461441">const_reference</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<a href=
+"container_base.html#const_iterator98626788"><span class="c2"><tt>container_base</tt></span>::const_iterator</a>
+</pre>
+        </td>
+
+        <td>
+          <p>Iterator's const <a href=
+          "#reference54418471"><tt>reference</tt></a> type.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h3><a name="link4" id="link4">Metadata Definitions</a></h3>
+
+    <p>These are only defined if <a href=
+    "basic_tree.html#Node_Update841554648"><span class="c2">
+    <tt>basic_tree</tt></span>::Node_Update</a>
+    is not <a href="null_tree_node_update.html"><span class=
+    "c2"><tt>null_tree_node_update</tt></span></a></p>
+
+    <table class="c2" width="100%" border="1" summary="Types">
+      <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_type2849297114" id=
+"metadata_type2849297114">metadata_type</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<tt><b>typename</b></tt> <a href=
+"basic_tree.html#Node_Update841554648"><span class="c2"><tt>basic_tree</tt></span>::Node_Update</a><tt>::metadata_type</tt>
+</pre>
+        </td>
+
+        <td>
+          <p>Metadata type.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="const_metadata_reference1108857465" id=
+"const_metadata_reference1108857465">const_metadata_reference</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<b>typename</b> Allocator::<b>template</b> rebind&lt;
+    <a href=
+"#metadata_type2849297114"><tt>metadata_type</tt></a>&gt;::other::<a href="#const_reference495461441"><tt>const_reference</tt></a>
+</pre>
+        </td>
+
+        <td>
+          <p>Const metadata <a href=
+          "#reference54418471"><tt>reference</tt></a> type.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h2><a name="link5" id="link5">Public Methods</a></h2>
+
+    <h3><a name="link6" id="link6">Constructors, Destructor, and
+    Related</a></h3>
+
+    <table class="c2" width="100%" border="1" summary="Methods">
+      <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> 
+  const_node_iterator
+  ()
+</pre>
+        </td>
+
+        <td>
+          <p>Default constructor.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h3><a name="link7" id="link7">Access Methods</a></h3>
+
+    <table class="c2" width="100%" border="1" summary="Methods">
+      <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=
+"#const_reference495461441"><tt>const_reference</tt></a>
+  <b>operator</b>*
+  () <b>const</b>
+</pre>
+        </td>
+
+        <td>
+          <p>Access.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h3><a name="link8" id="link8">Metadata Access Methods</a></h3>
+
+    <p>These are only defined if <a href=
+    "basic_tree.html#Node_Update841554648"><span class="c2">
+    <tt>basic_tree</tt></span>::Node_Update</a>
+    is not <a href="null_tree_node_update.html"><span class=
+    "c2"><tt>null_tree_node_update</tt></span></a></p>
+
+    <table class="c2" width="100%" border="1" summary="Methods">
+      <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=
+"#const_metadata_reference1108857465"><tt>const_metadata_reference</tt></a>
+  get_metadata
+  () <b>const</b>
+</pre>
+        </td>
+
+        <td>
+          <p>Metadata access.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h3><a name="link9" id="link9">Movement Methods</a></h3>
+
+    <table class="c2" width="100%" border="1" summary="Methods">
+      <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> <span class="c2"><tt>const_node_iterator</tt></span>
+  get_l_child
+  () <b>const</b>
+</pre>
+        </td>
+
+        <td>
+          <p>Returns the const node iterator associated with the
+          left node.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<b>inline</b> <span class="c2"><tt>const_node_iterator</tt></span>
+  get_r_child
+  () <b>const</b>
+</pre>
+        </td>
+
+        <td>
+          <p>Returns the const node iterator associated with the
+          right node.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h3><a name="link10" id="link10">Comparison Methods</a></h3>
+
+    <table class="c2" width="100%" border="1" summary="Methods">
+      <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>==
+  (<b>const</b> <span class=
+"c2"><tt>const_node_iterator</tt></span> &amp;other) <b>const</b>
+</pre>
+        </td>
+
+        <td>
+          <p>Compares to a different iterator object.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<b>inline</b> <b>bool</b>
+  <b>operator</b>!=
+  (<b>const</b> <span class=
+"c2"><tt>const_node_iterator</tt></span> &amp;other) <b>const</b>
+</pre>
+        </td>
+
+        <td>
+          <p>Compares (negatively) to a different iterator
+          object.</p>
+        </td>
+      </tr>
+    </table>
+  </div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/basic_tree_tag.html b/libstdc++-v3/docs/html/ext/pb_ds/basic_tree_tag.html
new file mode 100644
index 00000000000..c35ecad4a2d
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/basic_tree_tag.html
@@ -0,0 +1,47 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+  <meta name="generator" content=
+  "HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+
+  <title>basic_tree_tag Interface</title>
+  <meta http-equiv="Content-Type" content=
+  "text/html; charset=us-ascii" />
+  </head>
+
+<body>
+  <div id="page">
+    <h1><tt>basic_tree_tag</tt> Interface</h1>
+
+    <p>Basic tree-like data structure tag.</p>
+
+    <p>Defined in: <a href=
+    "../../../../include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
+
+    <h2><a name="link1" id="link1">Base Classes</a></h2>
+
+    <table class="c1" width="100%" border="1" summary="Bases">
+      <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="associative_container_tag.html"><span class=
+"c2"><tt>associative_container_tag</tt></span></a>
+</pre>
+        </td>
+
+        <td>
+          <p>public</p>
+        </td>
+      </tr>
+    </table>
+  </div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/binary_heap_tag.html b/libstdc++-v3/docs/html/ext/pb_ds/binary_heap_tag.html
new file mode 100644
index 00000000000..47f42477be3
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/binary_heap_tag.html
@@ -0,0 +1,47 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+  <meta name="generator" content=
+  "HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+
+  <title>binary_heap_tag Interface</title>
+  <meta http-equiv="Content-Type" content=
+  "text/html; charset=us-ascii" />
+  </head>
+
+<body>
+  <div id="page">
+    <h1><tt>binary_heap_tag</tt> Interface</h1>
+
+    <p>Binary-heap (array-based) data structure tag.</p>
+
+    <p>Defined in: <a href=
+    "../../../../include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
+
+    <h2><a name="link1" id="link1">Base Classes</a></h2>
+
+    <table class="c1" width="100%" border="1" summary="Bases">
+      <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="priority_queue_tag.html"><span class=
+"c2"><tt>priority_queue_tag</tt></span></a>
+</pre>
+        </td>
+
+        <td>
+          <p>public</p>
+        </td>
+      </tr>
+    </table>
+  </div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/binary_priority_queue_random_int_push_timing_test_gcc.png b/libstdc++-v3/docs/html/ext/pb_ds/binary_priority_queue_random_int_push_timing_test_gcc.png
new file mode 100644
index 00000000000..07f0953a661
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/binary_priority_queue_random_int_push_timing_test_gcc.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/binary_priority_queue_random_int_push_timing_test_local.png b/libstdc++-v3/docs/html/ext/pb_ds/binary_priority_queue_random_int_push_timing_test_local.png
new file mode 100644
index 00000000000..76e02f134f0
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/binary_priority_queue_random_int_push_timing_test_local.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/binary_priority_queue_random_int_push_timing_test_msvc.png b/libstdc++-v3/docs/html/ext/pb_ds/binary_priority_queue_random_int_push_timing_test_msvc.png
new file mode 100644
index 00000000000..b8a3b237124
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/binary_priority_queue_random_int_push_timing_test_msvc.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/binomial_heap_tag.html b/libstdc++-v3/docs/html/ext/pb_ds/binomial_heap_tag.html
new file mode 100644
index 00000000000..6b5e849e42b
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/binomial_heap_tag.html
@@ -0,0 +1,47 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+  <meta name="generator" content=
+  "HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+
+  <title>binomial_heap_tag Interface</title>
+  <meta http-equiv="Content-Type" content=
+  "text/html; charset=us-ascii" />
+  </head>
+
+<body>
+  <div id="page">
+    <h1><tt>binomial_heap_tag</tt> Interface</h1>
+
+    <p>Binomial-heap data structure tag.</p>
+
+    <p>Defined in: <a href=
+    "../../../../include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
+
+    <h2><a name="link1" id="link1">Base Classes</a></h2>
+
+    <table class="c1" width="100%" border="1" summary="Bases">
+      <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="priority_queue_tag.html"><span class=
+"c2"><tt>priority_queue_tag</tt></span></a>
+</pre>
+        </td>
+
+        <td>
+          <p>public</p>
+        </td>
+      </tr>
+    </table>
+  </div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/cc_hash_max_collision_check_resize_trigger.html b/libstdc++-v3/docs/html/ext/pb_ds/cc_hash_max_collision_check_resize_trigger.html
new file mode 100644
index 00000000000..e07c51e3a64
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/cc_hash_max_collision_check_resize_trigger.html
@@ -0,0 +1,532 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+  <meta name="generator" content=
+  "HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+
+  <title>cc_hash_max_collision_check_resize_trigger
+  Interface</title>
+  <meta http-equiv="Content-Type" content=
+  "text/html; charset=us-ascii" />
+  </head>
+
+<body>
+  <div id="page">
+    <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>
+
+    <p>Defined in: <a href=
+    "../../../../include/ext/pb_ds/hash_policy.hpp"><tt>hash_policy.hpp</tt></a></p>
+
+    <h2><a name="link1" id="link1">Template Parameters</a></h2>
+
+    <table class="c1" width="100%" border="1" summary=
+    "Template Parameters">
+      <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_Access1313998607" id=
+"External_Load_Access1313998607"><b>bool</b> External_Load_Access </a>
+</pre>
+        </td>
+
+        <td>
+          <p>Specifies whether the load factor can be accessed
+          externally. The two options have different trade-offs in
+          terms of flexibility, genericity, and encapsulation.</p>
+        </td>
+
+        <td><tt><b>false</b></tt></td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="Size_Type42920436" id=
+"Size_Type42920436"><b>typename</b> Size_Type </a>
+</pre>
+        </td>
+
+        <td>
+          <p>Size type.</p>
+        </td>
+
+        <td>size_t</td>
+      </tr>
+    </table>
+
+    <h2><a name="link2" id="link2">Public Types and
+    Constants</a></h2>
+
+    <h3><a name="link3" id="link3">General Definitions</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Types">
+      <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_type55424436" id="size_type55424436">size_type</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<a href="#Size_Type42920436"><tt>Size_Type</tt></a>
+</pre>
+        </td>
+
+        <td>
+          <p>Size type.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="external_load_access3976598639" id=
+"external_load_access3976598639">external_load_access</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<a href=
+"#External_Load_Access1313998607"><tt>External_Load_Access</tt></a>
+</pre>
+        </td>
+
+        <td>
+          <p>Indicates whether loads can be accessed externally</p>
+        </td>
+      </tr>
+    </table>
+
+    <h2><a name="link4" id="link4">Public Methods</a></h2>
+
+    <h3><a name="link5" id="link5">Constructors, Destructor, and
+    Related</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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
+          <span class="c1"><tt>load</tt></span>, a load factor
+          which it will attempt to maintain.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<b>void</b>
+  swap
+  (<span class=
+"c2"><tt>cc_hash_max_collision_check_resize_trigger</tt></span> &amp;other)
+</pre>
+        </td>
+
+        <td>
+          <p>Swaps content.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h3><a name="link6" id="link6">Load Access Methods</a></h3>
+
+    <p>These methods are only available if the external access
+    parameter is set.</p>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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 the current load.</p>
+
+          <p>Calling this method will not compile when <a href=
+          "#External_Load_Access1313998607"><tt>External_Load_Access</tt></a>
+          == <tt><b>false</b></tt>.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<b>void</b> 
+  set_load
+  (float load)
+</pre>
+        </td>
+
+        <td>
+          <p>Sets the <span class="c1"><tt>load</tt></span>; does
+          not resize the container.</p>
+
+          <p>It is the responsibility of the user to pass an
+          appropriate <span class="c1"><tt>load</tt></span> to this
+          function. Calling this method will not compile when
+          <a href=
+          "#External_Load_Access1313998607"><tt>External_Load_Access</tt></a>
+          == <tt><b>false</b></tt>.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h2><a name="link7" id="link7">Protected Methods</a></h2>
+
+    <h3><a name="link8" id="link8">Insert Search
+    Notifications.</a></h3>
+
+    <p>Notifications called during an insert operation.</p>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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>
+
+    <h3><a name="link9" id="link9">Find Search
+    Notifications.</a></h3>
+
+    <p>Notifications called during a find operation.</p>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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>
+
+    <h3><a name="link10" id="link10">Erase Search
+    Notifications.</a></h3>
+
+    <p>Notifications called during an insert operation.</p>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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>
+
+    <h3><a name="link11" id="link11">Content Change
+    Notifications</a></h3>
+
+    <p>Notifications called when the content of the table changes
+    in a way that can affect the resize policy.</p>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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_type55424436"><tt>size_type</tt></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_type55424436"><tt>size_type</tt></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>
+
+    <h3><a name="link12" id="link12">Size Change
+    Notifications</a></h3>
+
+    <p>Notifications called when the table changes size.</p>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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_type55424436"><tt>size_type</tt></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_type55424436"><tt>size_type</tt></a> new_size)
+</pre>
+        </td>
+
+        <td>
+          <p>Notifies the table was resized externally.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h3><a name="link13" id="link13">Queries</a></h3>
+
+    <p>Called to query whether/how to resize.</p>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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_type55424436"><tt>size_type</tt></a> size, <a href=
+"#size_type55424436"><tt>size_type</tt></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>
+    </table>
+  </div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/cc_hash_random_int_find_timing_test_gcc.png b/libstdc++-v3/docs/html/ext/pb_ds/cc_hash_random_int_find_timing_test_gcc.png
new file mode 100644
index 00000000000..85b9eca4ff6
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/cc_hash_random_int_find_timing_test_gcc.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/cc_hash_random_int_find_timing_test_local.png b/libstdc++-v3/docs/html/ext/pb_ds/cc_hash_random_int_find_timing_test_local.png
new file mode 100644
index 00000000000..4f578c65b1e
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/cc_hash_random_int_find_timing_test_local.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/cc_hash_random_int_find_timing_test_msvc.png b/libstdc++-v3/docs/html/ext/pb_ds/cc_hash_random_int_find_timing_test_msvc.png
new file mode 100644
index 00000000000..d1234aa11d8
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/cc_hash_random_int_find_timing_test_msvc.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/cc_hash_random_int_subscript_timing_test_find_gcc.png b/libstdc++-v3/docs/html/ext/pb_ds/cc_hash_random_int_subscript_timing_test_find_gcc.png
new file mode 100644
index 00000000000..1db2cc0c6a8
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/cc_hash_random_int_subscript_timing_test_find_gcc.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/cc_hash_random_int_subscript_timing_test_find_local.png b/libstdc++-v3/docs/html/ext/pb_ds/cc_hash_random_int_subscript_timing_test_find_local.png
new file mode 100644
index 00000000000..ca4db96f457
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/cc_hash_random_int_subscript_timing_test_find_local.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/cc_hash_random_int_subscript_timing_test_find_msvc.png b/libstdc++-v3/docs/html/ext/pb_ds/cc_hash_random_int_subscript_timing_test_find_msvc.png
new file mode 100644
index 00000000000..0b51d9432a9
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/cc_hash_random_int_subscript_timing_test_find_msvc.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/cc_hash_random_int_subscript_timing_test_insert_gcc.png b/libstdc++-v3/docs/html/ext/pb_ds/cc_hash_random_int_subscript_timing_test_insert_gcc.png
new file mode 100644
index 00000000000..6e494038125
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/cc_hash_random_int_subscript_timing_test_insert_gcc.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/cc_hash_random_int_subscript_timing_test_insert_local.png b/libstdc++-v3/docs/html/ext/pb_ds/cc_hash_random_int_subscript_timing_test_insert_local.png
new file mode 100644
index 00000000000..48fcf76c048
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/cc_hash_random_int_subscript_timing_test_insert_local.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/cc_hash_random_int_subscript_timing_test_insert_msvc.png b/libstdc++-v3/docs/html/ext/pb_ds/cc_hash_random_int_subscript_timing_test_insert_msvc.png
new file mode 100644
index 00000000000..39c96ad8daf
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/cc_hash_random_int_subscript_timing_test_insert_msvc.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/cc_hash_table.html b/libstdc++-v3/docs/html/ext/pb_ds/cc_hash_table.html
new file mode 100644
index 00000000000..fec6bec1b51
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/cc_hash_table.html
@@ -0,0 +1,724 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+  <meta name="generator" content=
+  "HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+
+  <title>cc_hash_table Interface</title>
+  <meta http-equiv="Content-Type" content=
+  "text/html; charset=us-ascii" />
+  </head>
+
+<body>
+  <div id="page">
+    <h1><tt>cc_hash_table</tt> Interface</h1>
+
+    <p>A concrete collision-chaining hash-based associative
+    container.</p>
+
+    <p>Defined in: <a href=
+    "../../../../include/ext/pb_ds/assoc_container.hpp"><tt>assoc_container.hpp</tt></a></p>
+
+    <h2><a name="link1" id="link1">Template Parameters</a></h2>
+
+    <table class="c1" width="100%" border="1" summary=
+    "Template Parameters">
+      <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="Key2501" id="Key2501"><b>typename</b> Key</a>
+</pre>
+        </td>
+
+        <td>
+          <p>Key type.</p>
+        </td>
+
+        <td>-</td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="Mapped318655" id="Mapped318655"><b>typename</b> Mapped</a>
+</pre>
+        </td>
+
+        <td>
+          <p>Mapped type.</p>
+        </td>
+
+        <td>-</td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="Hash_Fn1515835" id=
+"Hash_Fn1515835"><b>class</b> Hash_Fn </a>
+</pre>
+        </td>
+
+        <td>
+          <p>Hash functor.</p>
+        </td>
+
+        <td>
+          <pre>
+__gnu_cxx::hash&lt;<a href="#Key2501"><tt>Key</tt></a>&gt;
+</pre>if using gcc;
+          <pre>
+stdext::hash_value&lt;<a href="#Key2501"><tt>Key</tt></a>&gt;
+</pre>if using Visual C++ .net
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="Eq_Fn60085" id="Eq_Fn60085"><b>class</b> Eq_Fn </a>
+</pre>
+        </td>
+
+        <td>
+          <p>Equivalence functor.</p>
+        </td>
+
+        <td>
+          <pre>
+std::equal_to&lt;<a href="#Key2501"><tt>Key</tt></a>&gt;
+</pre>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="Comb_Hash_Fn320611039" id=
+"Comb_Hash_Fn320611039"><b>class</b> Comb_Hash_Fn </a>
+</pre>
+        </td>
+
+        <td>
+          <p>Combining hash functor.</p>
+
+          <p>If <a href="#Hash_Fn1515835"><tt>Hash_Fn</tt></a> is
+          not <a href="null_hash_fn.html"><span class=
+          "c2"><tt>null_hash_fn</tt></span></a>, then this is the
+          ranged-hash functor; otherwise, this is the range-hashing
+          functor.</p>
+
+          <p>(See <a href=
+          "hash_based_containers.html#hash_policies">Design::Hash-Based
+          Containers::Hash Policies</a>.)</p>
+        </td>
+
+        <td>
+          <pre>
+<a href="direct_mask_range_hashing.html"><span class=
+"c2"><tt>direct_mask_range_hashing</tt></span></a>
+</pre>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="Resize_Policy566860465" id=
+"Resize_Policy566860465"><b>class</b> Resize_Policy </a>
+</pre>
+        </td>
+
+        <td>
+          <p>Resize policy.</p>
+        </td>
+
+        <td>
+          If <tt><a href=
+          "#Comb_Hash_Fn320611039"><tt>Comb_Hash_Fn</tt></a></tt>
+          is <tt><a href=
+          "direct_mask_range_hashing.html"><span class=
+          "c2"><tt>direct_mask_range_hashing</tt></span></a></tt>,
+          then
+          <pre>
+<a href="hash_standard_resize_policy.html"><span class=
+"c2"><tt>hash_standard_resize_policy</tt></span></a>&lt;
+  <a href="hash_exponential_size_policy.html"><span class=
+"c2"><tt>hash_exponential_size_policy</tt></span></a>&lt;
+    <b>typename</b> <a href=
+"#Comb_Hash_Fn320611039"><tt>Comb_Hash_Fn</tt></a>::size_type&gt;,
+  <a href="hash_load_check_resize_trigger.html"><span class=
+"c2"><tt>hash_load_check_resize_trigger</tt></span></a>&lt;
+    <b>typename</b> <a href=
+"#Comb_Hash_Fn320611039"><tt>Comb_Hash_Fn</tt></a>::size_type&gt;,
+  <b>false</b>,
+  <b>typename</b> <a href=
+"#Comb_Hash_Fn320611039"><tt>Comb_Hash_Fn</tt></a>::size_type&gt;
+</pre>otherwise,
+          <pre>
+<a href="hash_standard_resize_policy.html"><span class=
+"c2"><tt>hash_standard_resize_policy</tt></span></a>&lt;
+  <a href="hash_exponential_size_policy.html"><span class=
+"c2"><tt>hash_exponential_size_policy</tt></span></a>&lt;
+    <b>typename</b> <a href=
+"#Comb_Hash_Fn320611039"><tt>Comb_Hash_Fn</tt></a>::size_type&gt;,
+  <a href="hash_load_check_resize_trigger.html"><span class=
+"c2"><tt>hash_load_check_resize_trigger</tt></span></a>&lt;
+    <b>typename</b> <a href=
+"#Comb_Hash_Fn320611039"><tt>Comb_Hash_Fn</tt></a>::size_type&gt;,
+  <b>false</b>,
+  <b>typename</b> <a href=
+"#Comb_Hash_Fn320611039"><tt>Comb_Hash_Fn</tt></a>::size_type&gt;
+</pre>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="Store_Hash218262104" id=
+"Store_Hash218262104"><b>bool</b> 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_fn2015995"><tt>hash_fn</tt></a></tt> is <a href=
+          "null_hash_fn.html"><span class=
+          "c2"><tt>null_hash_fn</tt></span></a>, 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="Allocator35940069" id=
+"Allocator35940069"><b>class</b> 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" id="link2">Base Classes</a></h2>
+
+    <table class="c1" width="100%" border="1" summary="Bases">
+      <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_table.html"><span class=
+"c2"><tt>basic_hash_table</tt></span></a>
+</pre>
+        </td>
+
+        <td>
+          <p>public</p>
+        </td>
+      </tr>
+    </table>
+
+    <h2><a name="link3" id="link3">Public Types and
+    Constants</a></h2>
+
+    <h3><a name="link4" id="link4">Policy Definitions</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Types">
+      <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_fn2015995" id="hash_fn2015995">hash_fn</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<a href="#Hash_Fn1515835"><tt>Hash_Fn</tt></a>
+</pre>
+        </td>
+
+        <td>
+          <p>Hash functor type.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="eq_fn80245" id="eq_fn80245">eq_fn</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<a href="#Eq_Fn60085"><tt>Eq_Fn</tt></a>
+</pre>
+        </td>
+
+        <td>
+          <p>Equivalence functor type.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="resize_policy4084493169" id=
+"resize_policy4084493169">resize_policy</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<a href="#Resize_Policy566860465"><tt>Resize_Policy</tt></a>
+</pre>
+        </td>
+
+        <td>
+          <p>Resize policy type.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="comb_hash_fn1883611199" id=
+"comb_hash_fn1883611199">comb_hash_fn</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<a href="#Comb_Hash_Fn320611039"><tt>Comb_Hash_Fn</tt></a>
+</pre>
+        </td>
+
+        <td>
+          <p>Combining hash functor type.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h2><a name="link5" id="link5">Public Methods</a></h2>
+
+    <h3><a name="link6" id="link6">Constructors, Destructor, and
+    Related</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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_table
+  ()
+</pre>
+        </td>
+
+        <td>
+          <p>Default constructor.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+  cc_hash_table
+  (<b>const</b> <a href=
+"#hash_fn2015995"><tt>hash_fn</tt></a> &amp;r_hash_fn)
+</pre>
+        </td>
+
+        <td>
+          <p>Constructor taking some policy objects. <span class=
+          "c1"><tt>r_hash_fn</tt></span> will be copied by the
+          <a href="#Hash_Fn1515835"><tt>Hash_Fn</tt></a> object of
+          the container object.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+  cc_hash_table
+  (<b>const</b> <a href=
+"#hash_fn2015995"><tt>hash_fn</tt></a> &amp;r_hash_fn, 
+    <b>const</b> <a href=
+"#eq_fn80245"><tt>eq_fn</tt></a> &amp;r_eq_fn)
+</pre>
+        </td>
+
+        <td>
+          <p>Constructor taking some policy objects. <span class=
+          "c1"><tt>r_hash_fn</tt></span> will be copied by the
+          <a href="#hash_fn2015995"><tt>hash_fn</tt></a> object of
+          the container object, and <span class=
+          "c1"><tt>r_eq_fn</tt></span> will be copied by the
+          <a href="#eq_fn80245"><tt>eq_fn</tt></a> object of the
+          container object.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+  cc_hash_table
+  (<b>const</b> <a href=
+"#hash_fn2015995"><tt>hash_fn</tt></a> &amp;r_hash_fn, 
+    <b>const</b> <a href=
+"#eq_fn80245"><tt>eq_fn</tt></a> &amp;r_eq_fn, 
+    <b>const</b> <a href=
+"#comb_hash_fn1883611199"><tt>comb_hash_fn</tt></a> &amp;r_comb_hash_fn)
+</pre>
+        </td>
+
+        <td>
+          <p>Constructor taking some policy objects. <span class=
+          "c1"><tt>r_hash_fn</tt></span> will be copied by the
+          <a href="#hash_fn2015995"><tt>hash_fn</tt></a> object of
+          the container object, <span class=
+          "c1"><tt>r_eq_fn</tt></span> will be copied by the
+          <a href="#eq_fn80245"><tt>eq_fn</tt></a> object of the
+          container object, and <span class=
+          "c1"><tt>r_comb_hash_fn</tt></span> will be copied by the
+          <a href=
+          "#comb_hash_fn1883611199"><tt>comb_hash_fn</tt></a>
+          object of the container object.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+  cc_hash_table
+  (<b>const</b> <a href=
+"#hash_fn2015995"><tt>hash_fn</tt></a> &amp;r_hash_fn, 
+    <b>const</b> <a href=
+"#eq_fn80245"><tt>eq_fn</tt></a> &amp;r_eq_fn, 
+    <b>const</b> <a href=
+"#comb_hash_fn1883611199"><tt>comb_hash_fn</tt></a> &amp;r_comb_hash_fn, 
+    <b>const</b> <a href=
+"#resize_policy4084493169"><tt>resize_policy</tt></a> &amp;r_resize_policy)
+</pre>
+        </td>
+
+        <td>
+          <p>Constructor taking some policy objects. <span class=
+          "c1"><tt>r_hash_fn</tt></span> will be copied by the
+          <a href="#hash_fn2015995"><tt>hash_fn</tt></a> object of
+          the container object, <span class=
+          "c1"><tt>r_eq_fn</tt></span> will be copied by the
+          <a href="#eq_fn80245"><tt>eq_fn</tt></a> object of the
+          container object, <span class=
+          "c1"><tt>r_comb_hash_fn</tt></span> will be copied by the
+          <a href=
+          "#comb_hash_fn1883611199"><tt>comb_hash_fn</tt></a>
+          object of the container object, and <span class=
+          "c1"><tt>r_resize_policy</tt></span> will be copied by
+          the <a href=
+          "#resize_policy4084493169"><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_table
+  (It first_it, 
+    It last_it)
+</pre>
+        </td>
+
+        <td>
+          <p>Constructor taking iterators to a range of
+          value_types. The value_types between <span class=
+          "c1"><tt>first_it</tt></span> and <span class=
+          "c1"><tt>last_it</tt></span> will be inserted into the
+          container object.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<b>template</b>&lt;
+    <b>class</b> It&gt;
+  cc_hash_table
+  (It first_it, 
+    It last_it,
+    <b>const</b> <a href=
+"#hash_fn2015995"><tt>hash_fn</tt></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
+          <span class="c1"><tt>first_it</tt></span> and
+          <span class="c1"><tt>last_it</tt></span> will be inserted
+          into the container object.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<b>template</b>&lt;
+    <b>class</b> It&gt;
+  cc_hash_table
+  (It first_it, 
+    It last_it,
+    <b>const</b> <a href=
+"#hash_fn2015995"><tt>hash_fn</tt></a> &amp;r_hash_fn, 
+    <b>const</b> <a href=
+"#eq_fn80245"><tt>eq_fn</tt></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
+          <span class="c1"><tt>first_it</tt></span> and
+          <span class="c1"><tt>last_it</tt></span> will be inserted
+          into the container object. <span class=
+          "c1"><tt>r_hash_fn</tt></span> will be copied by the
+          <a href="#hash_fn2015995"><tt>hash_fn</tt></a> object of
+          the container object, and <span class=
+          "c1"><tt>r_eq_fn</tt></span> will be copied by the
+          <a href="#eq_fn80245"><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_table
+  (It first_it, 
+    It last_it,
+    <b>const</b> <a href=
+"#hash_fn2015995"><tt>hash_fn</tt></a> &amp;r_hash_fn, 
+    <b>const</b> <a href=
+"#eq_fn80245"><tt>eq_fn</tt></a> &amp;r_eq_fn, 
+    <b>const</b> <a href=
+"#comb_hash_fn1883611199"><tt>comb_hash_fn</tt></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
+          <span class="c1"><tt>first_it</tt></span> and
+          <span class="c1"><tt>last_it</tt></span> will be inserted
+          into the container object. <span class=
+          "c1"><tt>r_hash_fn</tt></span> will be copied by the
+          <a href="#hash_fn2015995"><tt>hash_fn</tt></a> object of
+          the container object, <span class=
+          "c1"><tt>r_eq_fn</tt></span> will be copied by the
+          <a href="#eq_fn80245"><tt>eq_fn</tt></a> object of the
+          container object, and <span class=
+          "c1"><tt>r_comb_hash_fn</tt></span> will be copied by the
+          <a href=
+          "#comb_hash_fn1883611199"><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_table
+  (It first_it, 
+    It last_it,
+    <b>const</b> <a href=
+"#hash_fn2015995"><tt>hash_fn</tt></a> &amp;r_hash_fn, 
+    <b>const</b> <a href=
+"#eq_fn80245"><tt>eq_fn</tt></a> &amp;r_eq_fn, 
+    <b>const</b> <a href=
+"#comb_hash_fn1883611199"><tt>comb_hash_fn</tt></a> &amp;r_comb_hash_fn, 
+    <b>const</b> <a href=
+"#resize_policy4084493169"><tt>resize_policy</tt></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
+          <span class="c1"><tt>first_it</tt></span> and
+          <span class="c1"><tt>last_it</tt></span> will be inserted
+          into the container object. <span class=
+          "c1"><tt>r_hash_fn</tt></span> will be copied by the
+          <a href="#hash_fn2015995"><tt>hash_fn</tt></a> object of
+          the container object, <span class=
+          "c1"><tt>r_eq_fn</tt></span> will be copied by the
+          <a href="#eq_fn80245"><tt>eq_fn</tt></a> object of the
+          container object, <span class=
+          "c1"><tt>r_comb_hash_fn</tt></span> will be copied by the
+          <a href=
+          "#comb_hash_fn1883611199"><tt>comb_hash_fn</tt></a>
+          object of the container object, and <span class=
+          "c1"><tt>r_resize_policy</tt></span> will be copied by
+          the <a href=
+          "#resize_policy4084493169"><tt>resize_policy</tt></a>
+          object of the container object.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+  cc_hash_table
+  (<b>const</b> <span class=
+"c2"><tt>cc_hash_table</tt></span> &amp;other)
+</pre>
+        </td>
+
+        <td>
+          <p>Copy constructor.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<b>virtual</b> 
+  ~cc_hash_table
+  ()
+</pre>
+        </td>
+
+        <td>
+          <p>Destructor.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<span class="c2"><tt>cc_hash_table</tt></span> &amp;
+  <b>operator</b>=
+  (<b>const</b> <span class=
+"c2"><tt>cc_hash_table</tt></span> &amp;other)
+</pre>
+        </td>
+
+        <td>
+          <p>Assignment operator.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<b>void</b>
+  swap
+  (<span class=
+"c2"><tt>cc_hash_table</tt></span> &amp;other)
+</pre>
+        </td>
+
+        <td>
+          <p>Swaps content.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h3><a name="link7" id="link7">Policy Access Methods</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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_fn1883611199"><tt>comb_hash_fn</tt></a> &amp;
+  get_comb_hash_fn
+  ()
+</pre>
+        </td>
+
+        <td>
+          <p>Access to the <a href=
+          "#comb_hash_fn1883611199"><tt>comb_hash_fn</tt></a>
+          object.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<b>const</b> <a href=
+"#comb_hash_fn1883611199"><tt>comb_hash_fn</tt></a> &amp;
+  get_comb_hash_fn
+  () <b>const</b>
+</pre>
+        </td>
+
+        <td>
+          <p>Const access to the <a href=
+          "#comb_hash_fn1883611199"><tt>comb_hash_fn</tt></a>
+          object.</p>
+        </td>
+      </tr>
+    </table>
+  </div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/cc_hash_tag.html b/libstdc++-v3/docs/html/ext/pb_ds/cc_hash_tag.html
new file mode 100644
index 00000000000..fb6f5935830
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/cc_hash_tag.html
@@ -0,0 +1,47 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+  <meta name="generator" content=
+  "HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+
+  <title>cc_hash_tag Interface</title>
+  <meta http-equiv="Content-Type" content=
+  "text/html; charset=us-ascii" />
+  </head>
+
+<body>
+  <div id="page">
+    <h1><tt>cc_hash_tag</tt> Interface</h1>
+
+    <p>Collision-chaining hash data structure tag.</p>
+
+    <p>Defined in: <a href=
+    "../../../../include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
+
+    <h2><a name="link1" id="link1">Base Classes</a></h2>
+
+    <table class="c1" width="100%" border="1" summary="Bases">
+      <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_tag.html"><span class=
+"c2"><tt>basic_hash_tag</tt></span></a>
+</pre>
+        </td>
+
+        <td>
+          <p>public</p>
+        </td>
+      </tr>
+    </table>
+  </div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/ccgp_hash_random_int_subscript_timing_test_insert_gcc.png b/libstdc++-v3/docs/html/ext/pb_ds/ccgp_hash_random_int_subscript_timing_test_insert_gcc.png
new file mode 100644
index 00000000000..fde6b41bf94
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/ccgp_hash_random_int_subscript_timing_test_insert_gcc.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/ccgp_hash_random_int_subscript_timing_test_insert_local.png b/libstdc++-v3/docs/html/ext/pb_ds/ccgp_hash_random_int_subscript_timing_test_insert_local.png
new file mode 100644
index 00000000000..2449e1de324
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/ccgp_hash_random_int_subscript_timing_test_insert_local.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/ccgp_hash_random_int_subscript_timing_test_insert_msvc.png b/libstdc++-v3/docs/html/ext/pb_ds/ccgp_hash_random_int_subscript_timing_test_insert_msvc.png
new file mode 100644
index 00000000000..11dca77fcfe
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/ccgp_hash_random_int_subscript_timing_test_insert_msvc.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/checked_by_tidy.gif b/libstdc++-v3/docs/html/ext/pb_ds/checked_by_tidy.gif
new file mode 100644
index 00000000000..47c2c4859c5
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/checked_by_tidy.gif
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/concepts.html b/libstdc++-v3/docs/html/ext/pb_ds/concepts.html
new file mode 100644
index 00000000000..9f6c2246254
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/concepts.html
@@ -0,0 +1,118 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+  <meta name="generator" content=
+  "HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+
+  <title>Concepts</title>
+  <meta http-equiv="Content-Type" content=
+  "text/html; charset=us-ascii" />
+  </head>
+
+<body>
+  <div id="page">
+    <h1>Concepts</h1>
+
+    <h2><a name="concepts_find_and_range_iterators" id=
+    "concepts_find_and_range_iterators">Point and Range Methods and
+    Iterators</a></h2>
+
+    <p>A point-type iterator is an iterator that refers to a
+    specific element, <i>e.g.</i> as returned through an
+    associative-container's <tt>find</tt> method; a range-type
+    iterator is an iterator that is used to go over a sequence of
+    elements, <i>e.g.</i>, as returned by a container's
+    <tt>find</tt> method. A point-type method is a method that
+    returns a point-type iterator; a range-type method is a method
+    that returns a range-type iterator.</p>
+
+    <p>For most containers, these types are synonymous; for
+    self-organizing containers, such as hash-based containers or
+    priority queues, these are inherently different (in any
+    implementation, including that of the STL), but in
+    <tt>pb_ds</tt> this is made explicit - they are distinct
+    types.</p>
+
+ 
+    <h2><a name="invalidation_guarantees" id=
+    "invalidation_guarantees">Invalidation Guarantees</a></h2>
+
+    <p>If one manipulates a container object, then iterators
+    previously obtained from it can be invalidated. In some cases a
+    previously-obtained iterator cannot be de-referenced; in other
+    cases, the iterator's next or previous element might have
+    changed unpredictably. This corresponds exactly to the question
+    whether a point-type or range-type iterator (see previous
+    concept) is valid or not. In <tt>pb_ds</tt> one can query a
+    container (in compile time) what are its invalidation
+    guarantees.</p>
+
+     <h2><a name="prm_sec" id="prm_sec">Primary and Secondary Keys
+    and Associative Containers</a></h2>
+
+    <p>In <tt>pb_ds</tt> there are no associative containers which
+    allow multiple values with equivalent keys (such as the STL's
+    <tt>std::multimap</tt>, for example). Instead, one maps the
+    unique part of a key - the primary key, into an
+    associative-container of the (originally) non-unique parts of
+    the key - the secondary key. A primary associative-container is
+    an associative container of primary keys; a secondary
+    associative-container is an associative container of secondary
+    keys.</p>
+
+ 
+    <h2><a name="concepts_null_policies" id=
+    "concepts_null_policies">Null Policy Classes</a></h2>
+
+    <p>Associative containers are typically parametrized by
+    various policies. For example, a hash-based associative
+    container is parametrized 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>irrelevant</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 irrelevant.</p>
+
+    <p><tt>pb_ds</tt> uses special pre-defined "null policies"
+    classes for these cases. Some null policies in <tt>pb_ds</tt>
+    are:</p>
+
+    <ol>
+      <li><a href=
+      "null_mapped_type.html"><tt>null_mapped_type</tt></a></li>
+
+      <li><a href=
+      "null_tree_node_update.html"><tt>null_tree_node_update</tt></a></li>
+
+      <li><a href=
+      "null_trie_node_update.html"><tt>null_trie_node_update</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 "set" in <tt>pb_ds</tt>, for example, is an associative
+    container with its <tt>Data_Parameter</tt> instantiated by
+    <a href="null_mapped_type.html"><tt>null_mapped_type</tt></a>.
+    <a href=
+    "tree_based_containers.html#invariants">Design::Tree-Based
+    Containers::Node Invariants</a> explains another case where a
+    null policy is needed.</p>
+  </div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/contact.html b/libstdc++-v3/docs/html/ext/pb_ds/contact.html
new file mode 100644
index 00000000000..3d506c975c7
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/contact.html
@@ -0,0 +1,22 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+  <meta name="generator" content=
+  "HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+
+  <title>Contact</title>
+  <meta http-equiv="Content-Type" content=
+  "text/html; charset=us-ascii" />
+  </head>
+
+<body>
+  <div id="page">
+    <h1>Contact</h1>
+
+    <p>For anything relevant, please write to <a href=
+    "mailto:pbassoc@gmail.com">pbassoc@gmail.com</a></p>
+  </div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/container_base.html b/libstdc++-v3/docs/html/ext/pb_ds/container_base.html
new file mode 100644
index 00000000000..a0741307e0f
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/container_base.html
@@ -0,0 +1,1063 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+  <meta name="generator" content=
+  "HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+
+  <title>container_base Interface</title>
+  <meta http-equiv="Content-Type" content=
+  "text/html; charset=us-ascii" />
+  </head>
+
+<body>
+  <div id="page">
+    <h1><tt>container_base</tt> Interface</h1>
+
+    <p>An abstract basic associative container.</p>
+
+    <p>Defined in: <a href=
+    "../../../../include/ext/pb_ds/assoc_container.hpp"><tt>assoc_container.hpp</tt></a></p>
+
+    <h2><a name="link1" id="link1">Template Parameters</a></h2>
+
+    <table class="c1" width="100%" border="1" summary=
+    "Template Parameters">
+      <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="Key2501" id="Key2501"><b>typename</b> Key</a>
+</pre>
+        </td>
+
+        <td>
+          <p>Key type.</p>
+        </td>
+
+        <td>-</td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="Mapped318655" id="Mapped318655"><b>typename</b> Mapped</a>
+</pre>
+        </td>
+
+        <td>
+          <p>Mapped type.</p>
+        </td>
+
+        <td>-</td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="Tag278938" id="Tag278938"><b>class</b> Tag</a>
+</pre>
+        </td>
+
+        <td>
+          <p>Data structure tag.</p>
+        </td>
+
+        <td>-</td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="Policy_Tl42017403" id=
+"Policy_Tl42017403"><b>class</b> Policy_Tl</a>
+</pre>
+        </td>
+
+        <td>
+          <p>Policy typelist.</p>
+
+          <p>Contains subclasses' policies.</p>
+        </td>
+
+        <td>-</td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="Allocator35940069" id=
+"Allocator35940069"><b>class</b> Allocator</a>
+</pre>
+        </td>
+
+        <td>
+          <p>Allocator type.</p>
+        </td>
+
+        <td>-</td>
+      </tr>
+    </table>
+
+    <h2><a name="link2" id="link2">Public Types and
+    Constants</a></h2>
+
+    <h3><a name="link3" id="link3">General Container
+    Definitions</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Types">
+      <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_type55424436" id="size_type55424436">size_type</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<b>typename</b> <a href=
+"#Allocator35940069"><tt>Allocator</tt></a>::size_type
+</pre>
+        </td>
+
+        <td>
+          <p>Size type.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="difference_type868028452" id=
+"difference_type868028452">difference_type</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<b>typename</b> <a href=
+"#Allocator35940069"><tt>Allocator</tt></a>::difference_type
+</pre>
+        </td>
+
+        <td>
+          <p>Difference type.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h3><a name="link4" id="link4">Categories</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Types">
+      <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="container_category1247973216" id=
+"container_category1247973216">container_category</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<a href="#Tag278938"><tt>Tag</tt></a>
+</pre>
+        </td>
+
+        <td>
+          <p>The underlying mapped-structure tag of the
+          container.</p>
+
+          <p>This is one of:</p>
+
+          <ol>
+            <li><a href="cc_hash_tag.html"><span class=
+            "c2"><tt>cc_hash_tag</tt></span></a></li>
+
+            <li><a href="gp_hash_tag.html"><span class=
+            "c2"><tt>gp_hash_tag</tt></span></a></li>
+
+            <li><a href="rb_tree_tag.html"><span class=
+            "c2"><tt>rb_tree_tag</tt></span></a></li>
+
+            <li><a href="ov_tree_tag.html"><span class=
+            "c2"><tt>ov_tree_tag</tt></span></a></li>
+
+            <li><a href="splay_tree_tag.html"><span class=
+            "c2"><tt>splay_tree_tag</tt></span></a></li>
+
+            <li><a href="pat_trie_tag.html"><span class=
+            "c2"><tt>pat_trie_tag</tt></span></a></li>
+
+            <li><a href="list_update_tag.html"><span class=
+            "c2"><tt>list_update_tag</tt></span></a></li>
+          </ol>
+        </td>
+      </tr>
+    </table>
+
+    <h3><a name="link5" id="link5">Policy Definitions</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Types">
+      <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="allocator48440069" id="allocator48440069">allocator</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<a href="#Allocator35940069"><tt>Allocator</tt></a>
+</pre>
+        </td>
+
+        <td>
+          <p><a href="#Allocator35940069"><tt>Allocator</tt></a>
+          type.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h3><a name="link6" id="link6">Key-Type Definitions</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Types">
+      <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_type10393186" id="key_type10393186">key_type</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<b>typename</b> <a href=
+"#allocator48440069"><tt>allocator</tt></a>::<b>template</b> rebind&lt;
+    <a href="#Key2501"><tt>Key</tt></a>&gt;::other::value_type
+</pre>
+        </td>
+
+        <td>
+          <p><a href="#Key2501"><tt>Key</tt></a> type.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="key_reference2411522399" id=
+"key_reference2411522399">key_reference</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<b>typename</b> <a href=
+"#allocator48440069"><tt>allocator</tt></a>::<b>template</b> rebind&lt;
+    <a href=
+"#key_type10393186"><tt>key_type</tt></a>&gt;::other::reference
+</pre>
+        </td>
+
+        <td>
+          <p><a href="#Key2501"><tt>Key</tt></a> reference
+          type.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="const_key_reference3185471705" id=
+"const_key_reference3185471705">const_key_reference</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<b>typename</b> <a href=
+"#allocator48440069"><tt>allocator</tt></a>::<b>template</b> rebind&lt;
+    <a href=
+"#key_type10393186"><tt>key_type</tt></a>&gt;::other::const_reference
+</pre>
+        </td>
+
+        <td>
+          <p>Const key reference type.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="key_pointer1299054769" id=
+"key_pointer1299054769">key_pointer</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<b>typename</b> <a href=
+"#allocator48440069"><tt>allocator</tt></a>::<b>template</b> rebind&lt;
+    <a href=
+"#key_type10393186"><tt>key_type</tt></a>&gt;::other::pointer
+</pre>
+        </td>
+
+        <td>
+          <p><a href="#Key2501"><tt>Key</tt></a> pointer type.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="const_key_pointer3735194427" id=
+"const_key_pointer3735194427">const_key_pointer</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<b>typename</b> <a href=
+"#allocator48440069"><tt>allocator</tt></a>::<b>template</b> rebind&lt;
+    <a href=
+"#key_type10393186"><tt>key_type</tt></a>&gt;::other::const_pointer
+</pre>
+        </td>
+
+        <td>
+          <p>Const key pointer type.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h3><a name="link7" id="link7">Mapped-Type Definitions</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Types">
+      <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="mapped_type1308374436" id=
+"mapped_type1308374436">mapped_type</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<a href="#Mapped318655"><tt>Mapped</tt></a>
+</pre>
+        </td>
+
+        <td>
+          <p><a href="#Mapped318655"><tt>Mapped</tt></a> type.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="mapped_reference4153801225" id=
+"mapped_reference4153801225">mapped_reference</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<b>typename</b> <a href=
+"#allocator48440069"><tt>allocator</tt></a>::<b>template</b> rebind&lt;
+    <a href=
+"#mapped_type1308374436"><tt>mapped_type</tt></a>&gt;::other::reference
+</pre>
+        </td>
+
+        <td>
+          <p><a href="#Mapped318655"><tt>Mapped</tt></a> reference
+          type.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="const_mapped_reference2113216667" id=
+"const_mapped_reference2113216667">const_mapped_reference</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<b>typename</b> <a href=
+"#allocator48440069"><tt>allocator</tt></a>::<b>template</b> rebind&lt;
+    <a href=
+"#mapped_type1308374436"><tt>mapped_type</tt></a>&gt;::other::const_reference
+</pre>
+        </td>
+
+        <td>
+          <p>Const mapped reference type.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="mapped_pointer337953771" id=
+"mapped_pointer337953771">mapped_pointer</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<b>typename</b> <a href=
+"#allocator48440069"><tt>allocator</tt></a>::<b>template</b> rebind&lt;
+    <a href=
+"#mapped_type1308374436"><tt>mapped_type</tt></a>&gt;::other::pointer
+</pre>
+        </td>
+
+        <td>
+          <p><a href="#Mapped318655"><tt>Mapped</tt></a> pointer
+          type.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="const_mapped_pointer4207700301" id=
+"const_mapped_pointer4207700301">const_mapped_pointer</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<b>typename</b> <a href=
+"#allocator48440069"><tt>allocator</tt></a>::<b>template</b> rebind&lt;
+    <a href=
+"#mapped_type1308374436"><tt>mapped_type</tt></a>&gt;::other::const_pointer
+</pre>
+        </td>
+
+        <td>
+          <p>Const mapped pointer type.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h3><a name="link8" id="link8">Value-Type Definitions</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Types">
+      <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_type279018186" id=
+"value_type279018186">value_type</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<br />
+If <a href="#Mapped318655"><tt>Mapped</tt></a> is <a href=
+"null_mapped_type.html"><span class=
+"c2"><tt>null_mapped_type</tt></span></a>, then <a href=
+"#Key2501"><tt>Key</tt></a><br />
+Otherwise, <a href="#Mapped318655"><tt>Mapped</tt></a>
+</pre>
+        </td>
+
+        <td>
+          <p>Value type.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="reference54418471" id="reference54418471">reference</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<b>typename</b> <a href=
+"#allocator48440069"><tt>allocator</tt></a>::<b>template</b> rebind&lt;
+    <a href=
+"#value_type279018186"><tt>value_type</tt></a>&gt;::other::reference
+</pre>
+        </td>
+
+        <td>
+          <p>Value reference type.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="const_reference495461441" id=
+"const_reference495461441">const_reference</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<b>typename</b> <a href=
+"#allocator48440069"><tt>allocator</tt></a>::<b>template</b> rebind&lt;
+    <a href=
+"#value_type279018186"><tt>value_type</tt></a>&gt;::other::const_reference
+</pre>
+        </td>
+
+        <td>
+          <p>Const value <a href=
+          "#reference54418471"><tt>reference</tt></a> type.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="pointer2179769" id="pointer2179769">pointer</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<b>typename</b> <a href=
+"#allocator48440069"><tt>allocator</tt></a>::<b>template</b> rebind&lt;
+    <a href=
+"#value_type279018186"><tt>value_type</tt></a>&gt;::other::pointer
+</pre>
+        </td>
+
+        <td>
+          <p>Value pointer type.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="const_pointer878814947" id=
+"const_pointer878814947">const_pointer</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<b>typename</b> <a href=
+"#allocator48440069"><tt>allocator</tt></a>::<b>template</b> rebind&lt;
+    <a href=
+"#value_type279018186"><tt>value_type</tt></a>&gt;::other::const_pointer
+</pre>
+        </td>
+
+        <td>
+          <p>Const Value <a href=
+          "#pointer2179769"><tt>pointer</tt></a> type.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h3><a name="link9" id="link9">Iterator Definitions</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Types">
+      <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_point_iterator2364676009" id=
+"const_point_iterator2364676009">const_point_iterator</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+Const point-type iterator.
+</pre>
+        </td>
+
+        <td>
+          <p>Const point-type iterator.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="point_iterator2789896775" id=
+"point_iterator2789896775">point_iterator</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<br />
+Point-type iterator.<br />
+If <a href="#Mapped318655"><tt>Mapped</tt></a> is <a href=
+"null_mapped_type.html"><span class=
+"c2"><tt>null_mapped_type</tt></span></a>, then this is synonymous to <a href="#const_point_iterator2364676009"><tt>const_point_iterator</tt></a>
+</pre>
+        </td>
+
+        <td>
+          <p>Point-type iterator.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="const_iterator98626788" id=
+"const_iterator98626788">const_iterator</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+Const range-type iterator.
+</pre>
+        </td>
+
+        <td>
+          <p>Const range-type iterator.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="iterator10418194" id="iterator10418194">iterator</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<br />
+Range-type iterator.<br />
+If <a href="#Mapped318655"><tt>Mapped</tt></a> is <a href=
+"null_mapped_type.html"><span class=
+"c2"><tt>null_mapped_type</tt></span></a>, then this is synonymous to <a href="#const_iterator98626788"><tt>const_iterator</tt></a>
+</pre>
+        </td>
+
+        <td>
+          <p>Range-type iterator.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h2><a name="link10" id="link10">Public Methods</a></h2>
+
+    <h3><a name="link11" id="link11">Constructors, Destructor, and
+    Related</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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> 
+  ~container_base
+  ()
+</pre>
+        </td>
+
+        <td>
+          <p>Destructor.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h3><a name="link12" id="link12">Information Methods</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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_type55424436"><tt>size_type</tt></a>
+  size
+  () <b>const</b>
+</pre>
+        </td>
+
+        <td>
+          <p>Returns the number of distinct <a href=
+          "#value_type279018186"><tt>value_type</tt></a> objects
+          the container object is storing.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<b>inline</b> <a href="#size_type55424436"><tt>size_type</tt></a>
+  max_size
+  () <b>const</b>
+</pre>
+        </td>
+
+        <td>
+          <p>Returns an upper bound on the number of distinct
+          <a href="#value_type279018186"><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_type279018186"><tt>value_type</tt></a>
+          objects.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h3><a name="link13" id="link13">Insert Methods</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <tr>
+        <td width="45%" align="left"><b>Method</b></td>
+
+        <td width="55%" align="left"><b>Description</b></td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+std::pair&lt;<a href=
+"#point_iterator2789896775"><tt>point_iterator</tt></a>, <b>bool</b>&gt;
+  insert
+  (<a href=
+"#const_reference495461441"><tt>const_reference</tt></a> r_val)
+</pre>
+        </td>
+
+        <td>
+          <p>Inserts a <a href=
+          "#value_type279018186"><tt>value_type</tt></a> object. If
+          no <a href="#value_type279018186"><tt>value_type</tt></a>
+          with <span class="c1"><tt>r_val</tt></span>'s key was in
+          the container object, inserts and returns (<a href=
+          "#point_iterator2789896775"><tt>point_iterator</tt></a>
+          object associated with <span class=
+          "c1"><tt>r_val</tt></span>, <tt><b>true</b></tt>);
+          otherwise just returns (<a href=
+          "#point_iterator2789896775"><tt>point_iterator</tt></a>
+          object associated with <span class=
+          "c1"><tt>r_val</tt></span>'s key,
+          <tt><b>false</b></tt>).</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a href="#mapped_reference4153801225"><tt>mapped_reference</tt></a>
+  <b>operator</b>[]
+  (<a href=
+"#const_key_reference3185471705"><tt>const_key_reference</tt></a> r_key)
+</pre>
+        </td>
+
+        <td>
+          <p>Subscript operator.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h3><a name="link14" id="link14">Find Methods</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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="#point_iterator2789896775"><tt>point_iterator</tt></a> 
+  find
+  (<a href=
+"#const_key_reference3185471705"><tt>const_key_reference</tt></a> r_key)
+</pre>
+        </td>
+
+        <td>
+          <p>Returns the <a href=
+          "#point_iterator2789896775"><tt>point_iterator</tt></a>
+          corresponding to the <a href=
+          "#value_type279018186"><tt>value_type</tt></a> with
+          <span class="c1"><tt>r_key</tt></span> as its key, or the
+          <a href=
+          "#point_iterator2789896775"><tt>point_iterator</tt></a>
+          corresponding to the just-after-last entry if no such
+          <a href=
+          "#value_type279018186"><tt>value_type</tt></a>.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a href=
+"#const_point_iterator2364676009"><tt>const_point_iterator</tt></a> 
+  find
+  (<a href=
+"#const_key_reference3185471705"><tt>const_key_reference</tt></a> r_key) <b>const</b>
+</pre>
+        </td>
+
+        <td>
+          <p>Returns the <a href=
+          "#const_point_iterator2364676009"><tt>const_point_iterator</tt></a>
+          corresponding to the <a href=
+          "#value_type279018186"><tt>value_type</tt></a> with
+          <span class="c1"><tt>r_key</tt></span> as its key, or the
+          <a href=
+          "#const_point_iterator2364676009"><tt>const_point_iterator</tt></a>
+          corresponding to the just-after-last entry if no such
+          <a href=
+          "#value_type279018186"><tt>value_type</tt></a>.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h3><a name="link15" id="link15">Erase Methods</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <tr>
+        <td width="45%" align="left"><b>Method</b></td>
+
+        <td width="55%" align="left"><b>Description</b></td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<b>bool</b>
+  erase
+  (<a href=
+"#const_key_reference3185471705"><tt>const_key_reference</tt></a> r_key)
+</pre>
+        </td>
+
+        <td>
+          <p>Erases the <a href=
+          "#value_type279018186"><tt>value_type</tt></a> associated
+          with <span class="c1"><tt>r_key</tt></span>. returns
+          <tt><b>false</b></tt> iff <span class=
+          "c1"><tt>r_key</tt></span> was not contained.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<b>template</b>&lt;
+  <b>class</b> Pred&gt;
+<a href="#size_type55424436"><tt>size_type</tt></a> 
+  erase_if
+  (Pred prd)
+</pre>
+        </td>
+
+        <td>
+          <p>Erases any <a href=
+          "#value_type279018186"><tt>value_type</tt></a> satisfying
+          the predicate <span class="c1"><tt>prd</tt></span> (this
+          is transactional, either all matching <a href=
+          "#value_type279018186"><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_type279018186"><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>
+
+    <h3><a name="link16" id="link16">Iteration Methods</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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="#iterator10418194"><tt>iterator</tt></a>
+  begin
+  ()
+</pre>
+        </td>
+
+        <td>
+          <p>Returns an <a href=
+          "#iterator10418194"><tt>iterator</tt></a> corresponding
+          to the first <a href=
+          "#value_type279018186"><tt>value_type</tt></a> in the
+          container.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a href="#const_iterator98626788"><tt>const_iterator</tt></a>
+  begin
+  () <b>const</b>
+</pre>
+        </td>
+
+        <td>
+          <p>Returns a <a href=
+          "#const_iterator98626788"><tt>const_iterator</tt></a>
+          corresponding to the first <a href=
+          "#value_type279018186"><tt>value_type</tt></a> in the
+          container.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a href="#iterator10418194"><tt>iterator</tt></a>
+  end
+  ()
+</pre>
+        </td>
+
+        <td>
+          <p>Returns an <a href=
+          "#iterator10418194"><tt>iterator</tt></a> corresponding
+          to the just-after-last <a href=
+          "#value_type279018186"><tt>value_type</tt></a> in the
+          container.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a href="#const_iterator98626788"><tt>const_iterator</tt></a>
+  end
+  () <b>const</b>
+</pre>
+        </td>
+
+        <td>
+          <p>Returns a <a href=
+          "#const_iterator98626788"><tt>const_iterator</tt></a>
+          corresponding to the just-after-last <a href=
+          "#value_type279018186"><tt>value_type</tt></a> in the
+          container.</p>
+        </td>
+      </tr>
+    </table>
+  </div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/container_cd.png b/libstdc++-v3/docs/html/ext/pb_ds/container_cd.png
new file mode 100644
index 00000000000..52553278cac
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/container_cd.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/container_cd.svg b/libstdc++-v3/docs/html/ext/pb_ds/container_cd.svg
new file mode 100644
index 00000000000..3b5a9818967
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/container_cd.svg
@@ -0,0 +1,418 @@
+<?xml version="1.0" encoding="UTF-8" standalone="no"?>
+<!-- Created with Inkscape (http://www.inkscape.org/) -->
+<svg
+   xmlns:dc="http://purl.org/dc/elements/1.1/"
+   xmlns:cc="http://web.resource.org/cc/"
+   xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
+   xmlns:svg="http://www.w3.org/2000/svg"
+   xmlns="http://www.w3.org/2000/svg"
+   xmlns:sodipodi="http://inkscape.sourceforge.net/DTD/sodipodi-0.dtd"
+   xmlns:inkscape="http://www.inkscape.org/namespaces/inkscape"
+   width="11in"
+   height="8.5in"
+   id="svg2"
+   sodipodi:version="0.32"
+   inkscape:version="0.43"
+   version="1.0"
+   sodipodi:docbase="/mnt/share/src/policy_based_data_structures/current/pb_ds/doc"
+   sodipodi:docname="container_cd.svg"
+   inkscape:export-filename="/mnt/share/src/policy_based_data_structures/current/pb_ds/doc/container_cd.png"
+   inkscape:export-xdpi="90"
+   inkscape:export-ydpi="90">
+  <defs
+     id="defs4">
+    <marker
+       inkscape:stockid="Arrow1Mstart"
+       orient="auto"
+       refY="0.0"
+       refX="0.0"
+       id="Arrow1Mstart"
+       style="overflow:visible">
+      <path
+         id="path3311"
+         d="M 0.0,0.0 L 5.0,-5.0 L -12.5,0.0 L 5.0,5.0 L 0.0,0.0 z "
+         style="fill-rule:evenodd;stroke:#000000;stroke-width:1.0pt;marker-start:none"
+         transform="scale(0.4)" />
+    </marker>
+    <marker
+       inkscape:stockid="Arrow2Sstart"
+       orient="auto"
+       refY="0"
+       refX="0"
+       id="Arrow2Sstart"
+       style="overflow:visible">
+      <path
+         id="path3319"
+         style="font-size:12px;fill-rule:evenodd;stroke-width:0.625;stroke-linejoin:round"
+         d="M 8.7185878,4.0337352 L -2.2072895,0.016013256 L 8.7185884,-4.0017078 C 6.97309,-1.6296469 6.9831476,1.6157441 8.7185878,4.0337352 z "
+         transform="matrix(0.3,0,0,0.3,-1.5,0)" />
+    </marker>
+    <marker
+       inkscape:stockid="Arrow1Sstart"
+       orient="auto"
+       refY="0"
+       refX="0"
+       id="Arrow1Sstart"
+       style="overflow:visible">
+      <path
+         id="path3337"
+         d="M 0,0 L 5,-5 L -12.5,0 L 5,5 L 0,0 z "
+         style="fill-rule:evenodd;stroke:#000000;stroke-width:1pt;marker-start:none"
+         transform="scale(0.2,0.2)" />
+    </marker>
+    <marker
+       inkscape:stockid="Arrow2Send"
+       orient="auto"
+       refY="0"
+       refX="0"
+       id="Arrow2Send"
+       style="overflow:visible">
+      <path
+         id="path3316"
+         style="font-size:12px;fill-rule:evenodd;stroke-width:0.625;stroke-linejoin:round"
+         d="M 8.7185878,4.0337352 L -2.2072895,0.016013256 L 8.7185884,-4.0017078 C 6.97309,-1.6296469 6.9831476,1.6157441 8.7185878,4.0337352 z "
+         transform="matrix(-0.3,0,0,-0.3,1.5,0)" />
+    </marker>
+    <marker
+       inkscape:stockid="Arrow2Mend"
+       orient="auto"
+       refY="0"
+       refX="0"
+       id="Arrow2Mend"
+       style="overflow:visible">
+      <path
+         id="path3322"
+         style="font-size:12px;fill-rule:evenodd;stroke-width:0.625;stroke-linejoin:round"
+         d="M 8.7185878,4.0337352 L -2.2072895,0.016013256 L 8.7185884,-4.0017078 C 6.97309,-1.6296469 6.9831476,1.6157441 8.7185878,4.0337352 z "
+         transform="matrix(-0.6,0,0,-0.6,3,0)" />
+    </marker>
+    <marker
+       inkscape:stockid="Arrow1Lend"
+       orient="auto"
+       refY="0"
+       refX="0"
+       id="Arrow1Lend"
+       style="overflow:visible">
+      <path
+         id="path3346"
+         d="M 0,0 L 5,-5 L -12.5,0 L 5,5 L 0,0 z "
+         style="fill-rule:evenodd;stroke:#000000;stroke-width:1pt;marker-start:none"
+         transform="scale(-0.8,-0.8)" />
+    </marker>
+    <marker
+       inkscape:stockid="Arrow2Lstart"
+       orient="auto"
+       refY="0"
+       refX="0"
+       id="Arrow2Lstart"
+       style="overflow:visible">
+      <path
+         id="path3331"
+         style="font-size:12px;fill-rule:evenodd;stroke-width:0.625;stroke-linejoin:round"
+         d="M 8.7185878,4.0337352 L -2.2072895,0.016013256 L 8.7185884,-4.0017078 C 6.97309,-1.6296469 6.9831476,1.6157441 8.7185878,4.0337352 z "
+         transform="matrix(1.1,0,0,1.1,-5.5,0)" />
+    </marker>
+    <marker
+       inkscape:stockid="Arrow2Lend"
+       orient="auto"
+       refY="0"
+       refX="0"
+       id="Arrow2Lend"
+       style="overflow:visible">
+      <path
+         id="path3328"
+         style="font-size:12px;fill-rule:evenodd;stroke-width:0.625;stroke-linejoin:round"
+         d="M 8.7185878,4.0337352 L -2.2072895,0.016013256 L 8.7185884,-4.0017078 C 6.97309,-1.6296469 6.9831476,1.6157441 8.7185878,4.0337352 z "
+         transform="matrix(-1.1,0,0,-1.1,5.5,0)" />
+    </marker>
+  </defs>
+  <sodipodi:namedview
+     id="base"
+     pagecolor="#ffffff"
+     bordercolor="#666666"
+     borderopacity="1.0"
+     inkscape:pageopacity="0.0"
+     inkscape:pageshadow="2"
+     inkscape:zoom="2"
+     inkscape:cx="396.81316"
+     inkscape:cy="280"
+     inkscape:document-units="in"
+     inkscape:current-layer="layer1"
+     showguides="true"
+     inkscape:guide-bbox="true"
+     inkscape:window-width="1278"
+     inkscape:window-height="973"
+     inkscape:window-x="0"
+     inkscape:window-y="0"
+     gridtolerance="0.125in"
+     guidetolerance="0.125in">
+    <sodipodi:guide
+       orientation="horizontal"
+       position="629"
+       id="guide1307" />
+    <sodipodi:guide
+       orientation="horizontal"
+       position="449"
+       id="guide1309" />
+    <sodipodi:guide
+       orientation="horizontal"
+       position="269"
+       id="guide1311" />
+    <sodipodi:guide
+       orientation="vertical"
+       position="496"
+       id="guide1313" />
+    <sodipodi:guide
+       orientation="vertical"
+       position="361"
+       id="guide1315" />
+    <sodipodi:guide
+       orientation="vertical"
+       position="226"
+       id="guide1317" />
+    <sodipodi:guide
+       orientation="vertical"
+       position="631"
+       id="guide1319" />
+    <sodipodi:guide
+       orientation="vertical"
+       position="766"
+       id="guide1321" />
+    <sodipodi:guide
+       orientation="vertical"
+       position="91"
+       id="guide1345" />
+    <sodipodi:guide
+       orientation="vertical"
+       position="901"
+       id="guide1347" />
+    <sodipodi:guide
+       orientation="horizontal"
+       position="539"
+       id="guide3390" />
+    <sodipodi:guide
+       orientation="horizontal"
+       position="359"
+       id="guide3392" />
+    <sodipodi:guide
+       orientation="vertical"
+       position="280.5"
+       id="guide3324" />
+    <sodipodi:guide
+       orientation="vertical"
+       position="172"
+       id="guide3326" />
+    <sodipodi:guide
+       orientation="vertical"
+       position="388"
+       id="guide3328" />
+    <sodipodi:guide
+       orientation="vertical"
+       position="711.5"
+       id="guide3340" />
+  </sodipodi:namedview>
+  <metadata
+     id="metadata7">
+    <rdf:RDF>
+      <cc:Work
+         rdf:about="">
+        <dc:format>image/svg+xml</dc:format>
+        <dc:type
+           rdf:resource="http://purl.org/dc/dcmitype/StillImage" />
+        <dc:creator>
+          <cc:Agent>
+            <dc:title>Benjamin Kosnik</dc:title>
+          </cc:Agent>
+        </dc:creator>
+      </cc:Work>
+    </rdf:RDF>
+  </metadata>
+  <g
+     inkscape:label="Layer 1"
+     inkscape:groupmode="layer"
+     id="layer1">
+    <rect
+       style="fill:#ffffff;fill-opacity:1;stroke:#000000;stroke-width:1.25;stroke-miterlimit:4;stroke-dasharray:none;stroke-opacity:1"
+       id="rect1425"
+       width="141.64481"
+       height="23.200001"
+       x="209.57762"
+       y="382.56177" />
+    <rect
+       y="382.56177"
+       x="425.57761"
+       height="23.200001"
+       width="141.64481"
+       id="rect3376"
+       style="fill:#ffffff;fill-opacity:1;stroke:#000000;stroke-width:1.25;stroke-miterlimit:4;stroke-dasharray:none;stroke-opacity:1" />
+    <rect
+       style="fill:#ffffff;fill-opacity:1;stroke:#000000;stroke-width:1.25;stroke-miterlimit:4;stroke-dasharray:none;stroke-opacity:1"
+       id="rect3378"
+       width="141.64481"
+       height="23.200001"
+       x="640.77765"
+       y="382.56177" />
+    <text
+       sodipodi:linespacing="100%"
+       id="use1329"
+       y="397.09772"
+       x="497.20001"
+       style="font-size:9.60000038px;font-style:normal;font-variant:normal;font-weight:normal;font-stretch:normal;text-align:center;line-height:100%;writing-mode:lr-tb;text-anchor:middle;fill:#000000;fill-opacity:1;stroke:none;stroke-width:1px;stroke-linecap:butt;stroke-linejoin:miter;stroke-opacity:1;font-family:Bitstream Vera Sans"
+       xml:space="preserve"><tspan
+         sodipodi:role="line"
+         id="tspan1703"
+         x="497.20001"
+         y="397.09772">list_update</tspan><tspan
+         sodipodi:role="line"
+         id="tspan1705"
+         x="497.20001"
+         y="406.69772" /></text>
+    <text
+       xml:space="preserve"
+       style="font-size:9.60000038px;font-style:normal;font-variant:normal;font-weight:normal;font-stretch:normal;text-align:center;line-height:100%;writing-mode:lr-tb;text-anchor:middle;fill:#000000;fill-opacity:1;stroke:none;stroke-width:1.25;stroke-linecap:butt;stroke-linejoin:miter;stroke-miterlimit:4;stroke-dasharray:none;stroke-opacity:1;font-family:Bitstream Vera Sans"
+       x="712.40002"
+       y="397.09772"
+       id="use1337"
+       sodipodi:linespacing="100%"><tspan
+         sodipodi:role="line"
+         id="tspan1707"
+         x="712.40002"
+         y="397.09772">basic_hash_table</tspan></text>
+    <text
+       xml:space="preserve"
+       style="font-size:9.60000038px;font-style:normal;font-variant:normal;font-weight:normal;font-stretch:normal;text-align:center;line-height:100%;writing-mode:lr-tb;text-anchor:middle;fill:#000000;fill-opacity:1;stroke:none;stroke-width:1px;stroke-linecap:butt;stroke-linejoin:miter;stroke-opacity:1;font-family:Bitstream Vera Sans"
+       x="282"
+       y="397.09772"
+       id="text1339"
+       sodipodi:linespacing="100%"><tspan
+         sodipodi:role="line"
+         id="tspan1701"
+         x="282"
+         y="397.09772">basic_tree</tspan></text>
+    <rect
+       style="fill:#ffffff;fill-opacity:1;stroke:#000000;stroke-width:1.25;stroke-miterlimit:4;stroke-dasharray:none;stroke-opacity:1"
+       id="rect3418"
+       width="141.64481"
+       height="23.200001"
+       x="101.57762"
+       y="472.5618" />
+    <rect
+       y="472.5618"
+       x="317.57761"
+       height="23.200001"
+       width="141.64481"
+       id="rect3420"
+       style="fill:#ffffff;fill-opacity:1;stroke:#000000;stroke-width:1.25;stroke-miterlimit:4;stroke-dasharray:none;stroke-opacity:1" />
+    <rect
+       style="fill:#ffffff;fill-opacity:1;stroke:#000000;stroke-width:1.25;stroke-miterlimit:4;stroke-dasharray:none;stroke-opacity:1"
+       id="rect3422"
+       width="141.64481"
+       height="23.200001"
+       x="533.57764"
+       y="472.5618" />
+    <rect
+       y="472.5618"
+       x="748.77765"
+       height="23.200001"
+       width="141.64481"
+       id="rect3424"
+       style="fill:#ffffff;fill-opacity:1;stroke:#000000;stroke-width:1.25;stroke-miterlimit:4;stroke-dasharray:none;stroke-opacity:1" />
+    <text
+       xml:space="preserve"
+       style="font-size:9.60000038;font-style:normal;font-variant:normal;font-weight:normal;font-stretch:normal;text-align:center;line-height:100%;writing-mode:lr;text-anchor:middle;fill:#000000;fill-opacity:1;stroke:none;stroke-width:1px;stroke-linecap:butt;stroke-linejoin:miter;stroke-opacity:1;font-family:Bitstream Vera Sans"
+       x="171.20001"
+       y="486.29773"
+       id="text3394"
+       sodipodi:linespacing="100%"><tspan
+         sodipodi:role="line"
+         id="tspan1715"
+         x="171.20001"
+         y="486.29773">tree</tspan><tspan
+         sodipodi:role="line"
+         id="tspan1717"
+         x="171.20001"
+         y="495.89773" /></text>
+    <text
+       sodipodi:linespacing="100%"
+       id="text3400"
+       y="486.29773"
+       x="386.39999"
+       style="font-size:9.60000038;font-style:normal;font-variant:normal;font-weight:normal;font-stretch:normal;text-align:center;line-height:100%;writing-mode:lr;text-anchor:middle;fill:#000000;fill-opacity:1;stroke:none;stroke-width:1px;stroke-linecap:butt;stroke-linejoin:miter;stroke-opacity:1;font-family:Bitstream Vera Sans"
+       xml:space="preserve"><tspan
+         sodipodi:role="line"
+         id="tspan1709"
+         x="386.39999"
+         y="486.29773">trie</tspan><tspan
+         sodipodi:role="line"
+         id="tspan1711"
+         x="386.39999"
+         y="495.89773" /></text>
+    <text
+       sodipodi:linespacing="100%"
+       id="text3406"
+       y="486.29773"
+       x="601.20001"
+       style="font-size:9.60000038px;font-style:normal;font-variant:normal;font-weight:normal;font-stretch:normal;text-align:center;line-height:100%;writing-mode:lr-tb;text-anchor:middle;fill:#000000;fill-opacity:1;stroke:none;stroke-width:1.25;stroke-linecap:butt;stroke-linejoin:miter;stroke-miterlimit:4;stroke-dasharray:none;stroke-opacity:1;font-family:Bitstream Vera Sans"
+       xml:space="preserve"><tspan
+         sodipodi:role="line"
+         id="tspan1713"
+         x="601.20001"
+         y="486.29773">cc_hash_table</tspan></text>
+    <text
+       xml:space="preserve"
+       style="font-size:9.60000038;font-style:normal;font-variant:normal;font-weight:normal;font-stretch:normal;text-align:center;line-height:100%;writing-mode:lr;text-anchor:middle;fill:#000000;fill-opacity:1;stroke:none;stroke-width:1.25;stroke-linecap:butt;stroke-linejoin:miter;stroke-miterlimit:4;stroke-dasharray:none;stroke-opacity:1;font-family:Bitstream Vera Sans"
+       x="818"
+       y="486.29773"
+       id="text3412"
+       sodipodi:linespacing="100%"><tspan
+         sodipodi:role="line"
+         id="tspan1719"
+         x="818"
+         y="486.29773">gp_hash_table</tspan></text>
+    <rect
+       style="fill:#ffffff;fill-opacity:1;stroke:#000000;stroke-width:1.25;stroke-miterlimit:4;stroke-dasharray:none;stroke-opacity:1"
+       id="rect3380"
+       width="141.64481"
+       height="23.200001"
+       x="425.57764"
+       y="292.56177" />
+    <text
+       xml:space="preserve"
+       style="font-size:9.60000038;font-style:normal;font-variant:normal;font-weight:normal;font-stretch:normal;text-align:center;line-height:100%;writing-mode:lr;text-anchor:middle;fill:#000000;fill-opacity:1;stroke:none;stroke-width:1.5625;stroke-linecap:butt;stroke-linejoin:miter;stroke-miterlimit:4;stroke-dasharray:none;stroke-opacity:1;font-family:Bitstream Vera Sans"
+       x="497.20001"
+       y="307.09772"
+       id="text1323"
+       sodipodi:linespacing="100%"
+       inkscape:export-xdpi="90"
+       inkscape:export-ydpi="90"
+       inkscape:export-filename="/mnt/share/src/policy_based_data_structures/pb_ds_images/container_diagram.png"><tspan
+         sodipodi:role="line"
+         id="tspan1369"
+         x="497.20001"
+         y="307.09772">container_base</tspan></text>
+    <path
+       style="fill:none;fill-opacity:0.75;fill-rule:evenodd;stroke:#000000;stroke-width:0.97031623px;stroke-linecap:butt;stroke-linejoin:miter;stroke-opacity:1"
+       d="M 170.97058,472.5 L 170.97058,451 L 387.51871,450 L 387.51871,472.5"
+       id="path2244" />
+    <path
+       style="fill:none;fill-opacity:0.75;fill-rule:evenodd;stroke:#000000;stroke-width:1.25;stroke-linecap:butt;stroke-linejoin:miter;marker-end:url(#Arrow2Mend);stroke-miterlimit:4;stroke-dasharray:none;stroke-opacity:1"
+       d="M 280.5,450.53297 L 280.5,410.62445"
+       id="path3332" />
+    <path
+       id="path3353"
+       d="M 601.47058,472.5 L 601.47058,451 L 818.01871,450 L 818.01871,472.5"
+       style="fill:none;fill-opacity:0.75;fill-rule:evenodd;stroke:#000000;stroke-width:0.97031623px;stroke-linecap:butt;stroke-linejoin:miter;stroke-opacity:1" />
+    <path
+       id="path3355"
+       d="M 711,450.53297 L 711,410.62445"
+       style="fill:none;fill-opacity:0.75;fill-rule:evenodd;stroke:#000000;stroke-width:1.25;stroke-linecap:butt;stroke-linejoin:miter;marker-end:url(#Arrow2Mend);stroke-miterlimit:4;stroke-dasharray:none;stroke-opacity:1" />
+    <path
+       id="path3344"
+       d="M 281.18218,383.28102 L 281.18218,361.78102 L 711.79281,360.78102 L 711.79281,383.28102"
+       style="fill:none;fill-opacity:0.75;fill-rule:evenodd;stroke:#000000;stroke-width:1.3682909px;stroke-linecap:butt;stroke-linejoin:miter;stroke-opacity:1" />
+    <path
+       id="path3347"
+       d="M 497.75146,383.49616 L 497.75146,322.77107"
+       style="fill:none;fill-opacity:0.75;fill-rule:evenodd;stroke:#000000;stroke-width:1.25;stroke-linecap:butt;stroke-linejoin:miter;marker-end:url(#Arrow2Mend);stroke-miterlimit:4;stroke-dasharray:none;stroke-opacity:1" />
+  </g>
+</svg>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/container_tag.html b/libstdc++-v3/docs/html/ext/pb_ds/container_tag.html
new file mode 100644
index 00000000000..b9f05319dc2
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/container_tag.html
@@ -0,0 +1,24 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+  <meta name="generator" content=
+  "HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+
+  <title>container _tag Interface</title>
+  <meta http-equiv="Content-Type" content=
+  "text/html; charset=us-ascii" />
+  </head>
+
+<body>
+  <div id="page">
+    <h1><tt>container _tag</tt> Interface</h1>
+
+    <p>Basic data structure tag.</p>
+
+    <p>Defined in: <a href=
+    "../../../../include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
+  </div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/counter_lu_policy.html b/libstdc++-v3/docs/html/ext/pb_ds/counter_lu_policy.html
new file mode 100644
index 00000000000..142cca19570
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/counter_lu_policy.html
@@ -0,0 +1,259 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+  <meta name="generator" content=
+  "HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+
+  <title>counter_lu_policy Interface</title>
+  <meta http-equiv="Content-Type" content=
+  "text/html; charset=us-ascii" />
+  </head>
+
+<body>
+  <div id="page">
+    <h1><tt>counter_lu_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>Defined in: <a href=
+    "../../../../include/ext/pb_ds/list_update_policy.hpp"><tt>list_update_policy.hpp</tt></a></p>
+
+    <h2><a name="link1" id="link1">Template Parameters</a></h2>
+
+    <table class="c1" width="100%" border="1" summary=
+    "Template Parameters">
+      <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="Max_Count39887466" id=
+"Max_Count39887466">size_t Max_Count </a>
+</pre>
+        </td>
+
+        <td>
+          <p>Maximum count.</p>
+
+          <p>When some element is accessed this number of times, it
+          will be moved to the front of the list.</p>
+        </td>
+
+        <td>5</td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="Allocator35940069" id=
+"Allocator35940069"><b>class</b> Allocator </a>
+</pre>
+        </td>
+
+        <td>
+          <p>Allocator type.</p>
+
+          <p>This is used only for definitions, e.g., the size
+          type.</p>
+        </td>
+
+        <td>
+          <pre>
+std::allocator&lt;<b>char</b>&gt;
+</pre>
+        </td>
+      </tr>
+    </table>
+
+    <h2><a name="link2" id="link2">Public Types and
+    Constants</a></h2>
+
+    <h3><a name="link3" id="link3">Policy Definitions</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Types">
+      <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="allocator48440069" id="allocator48440069">allocator</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<a href="#Allocator35940069"><tt>Allocator</tt></a>
+</pre>
+        </td>
+
+        <td>
+          <p><a href="#Allocator35940069"><tt>Allocator</tt></a>
+          type.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="max_count52407466" id="max_count52407466">max_count</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<a href="#Max_Count39887466"><tt>Max_Count</tt></a>
+}
+</pre>
+        </td>
+
+        <td>
+          <p>Maximum count.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h3><a name="link4" id="link4">General Definitions</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Types">
+      <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_type55424436" id="size_type55424436">size_type</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<b>typename</b> <a href=
+"#allocator48440069"><tt>allocator</tt></a>::size_type
+</pre>
+        </td>
+
+        <td>
+          <p>Size type.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h3><a name="link5" id="link5">Metadata-Type
+    Definitions</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Types">
+      <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_type2849297114" id=
+"metadata_type2849297114">metadata_type</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+Some class containing a counter.
+</pre>
+        </td>
+
+        <td>
+          <p>Metadata on which this functor operates.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="metadata_reference583863863" id=
+"metadata_reference583863863">metadata_reference</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<b>typename</b> <a href=
+"#Allocator35940069"><tt>Allocator</tt></a>::<b>template</b> rebind&lt;
+    <a href=
+"#metadata_type2849297114"><tt>metadata_type</tt></a>&gt;::other::reference
+</pre>
+        </td>
+
+        <td>
+          <p>Reference to metadata on which this functor
+          operates.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h2><a name="link6" id="link6">Public Methods</a></h2>
+
+    <h3><a name="link7" id="link7">Metadata Methods</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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_type2849297114"><tt>metadata_type</tt></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_reference583863863"><tt>metadata_reference</tt></a> r_metadata) <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>
+  </div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/design.html b/libstdc++-v3/docs/html/ext/pb_ds/design.html
new file mode 100644
index 00000000000..e83bd4dd20a
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/design.html
@@ -0,0 +1,96 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+  <meta name="generator" content=
+  "HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+
+  <title>Design</title>
+  <meta http-equiv="Content-Type" content=
+  "text/html; charset=us-ascii" />
+  </head>
+
+<body>
+  <div id="page">
+    <h1>Design</h1>
+
+    <p>The <tt>pb_ds</tt> namespace contains:</p>
+
+    <ol>
+      <li>Exception classes (see <a href=
+      "interface.html#exceptions_common">Interface::Exceptions::Common</a>)</li>
+
+      <li>Invalidation-guarantee tags (see <a href=
+      "ds_gen.html#inv_guar">Design::Invalidation Guarantees</a>
+      and <a href=
+      "interface.html#ds_inv_tag">Interface::Data-Structure Tags
+      and Traits::Invalidation-Guarantee Tags</a>).</li>
+
+      <li>Associative Containers (see <a href=
+      "tree_based_containers.html">Design::Associative
+      Containers::Tree-Based Containers</a>, <a href=
+      "trie_based_containers.html">Design::Associative
+      Containers::Trie-Based Containers</a>, <a href=
+      "hash_based_containers.html">Design::Associative
+      Containers::Hash-Based Containers</a>, and <a href=
+      "lu_based_containers.html">Design::Associative
+      Containers::List-Based Containers</a>, and <a href=
+      "interface.html#containers_assoc">Interface::Containers::Associative
+      Containers</a>).</li>
+
+      <li>Associative Container tags and traits
+      (see <a href="ds_gen.html">Design::Associative
+      Containers::Data-Structure Genericity</a>, <a href=
+      "interface.html#ds_ts_assoc">Interface::Data-Structure Tags
+      and Traits::Data-Structure Tags::Associative-Containers</a>,
+      and <a href=
+      "interface.html#container_traits">Interface::Data-Structure Tags and
+      Traits::Data-Structure
+      Traits::Associative-Containers</a>).</li>
+
+     <li>Associative Container policies (see
+      <a href="tree_based_containers.html">Design::Associative
+      Containers::Tree-Based Containers</a>, <a href=
+      "trie_based_containers.html">Design::Associative
+      Containers::Trie-Based Containers</a>, <a href=
+      "hash_based_containers.html">Design::Associative
+      Containers::Hash-Based Containers</a>, and <a href=
+      "lu_based_containers.html">Design::Associative
+      Containers::List-Based Containers</a>, and <a href=
+      "interface.html#ds_policy_classes">Interface::Container
+      Policy Classes</a>).</li>
+
+
+      <li>Mapped types for setting the mapping semantics of
+      associative containers (see <a href=
+      "tutorial.html#assoc_ms">Tutorial::Associative
+      Containers::Associative Containers Others than Maps</a> and
+      <a href="interface.html#ds_pol">Interface::Mapped-Type
+      Policies</a>).</li>
+
+
+      <li>Priority Queues (see <a href="pq_design.html">Design::Priority
+      Queues</a> and <a href=
+      "interface.html#containers_pq">Interface::Containers::Priority
+      Queues</a>).</li>
+
+      <li>Priority Queue tags and traits
+      (see <a href="pq_design.html#pq_traits">Design::Priority
+      Queues::Traits</a>, <a href=
+      "interface.html#ds_ts_pq">Interface::Data-Structure Tags and
+      Traits::Data-Structure Tags::Priority Queues</a>, and
+      <a href="interface.html#container_traits">Interface::Data-Structure
+      Tags and Traits::Data-Structure Traits::Priority
+      Queues</a>).</li>
+   </ol>
+
+
+    <p><a href="assoc_design.html">Associative-Container Design</a>
+    describes associative-container design.</p>
+
+    <p><a href="pq_design.html">Priority-Queue Design</a> describes
+    priority-queue design.</p>
+  </div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/different_underlying_dss.png b/libstdc++-v3/docs/html/ext/pb_ds/different_underlying_dss.png
new file mode 100644
index 00000000000..adee1263600
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/different_underlying_dss.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/direct_mask_range_hashing.html b/libstdc++-v3/docs/html/ext/pb_ds/direct_mask_range_hashing.html
new file mode 100644
index 00000000000..1a7d39b70c2
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/direct_mask_range_hashing.html
@@ -0,0 +1,167 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+  <meta name="generator" content=
+  "HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+
+  <title>direct_mask_range_hashing Interface</title>
+  <meta http-equiv="Content-Type" content=
+  "text/html; charset=us-ascii" />
+  </head>
+
+<body>
+  <div id="page">
+    <h1><tt>direct_mask_range_hashing</tt> Interface</h1>
+
+    <p>A mask range-hashing class (uses a bit-mask).</p>
+
+    <p>Defined in: <a href=
+    "../../../../include/ext/pb_ds/hash_policy.hpp"><tt>hash_policy.hpp</tt></a></p>
+
+    <h2><a name="link1" id="link1">Template Parameters</a></h2>
+
+    <table class="c1" width="100%" border="1" summary=
+    "Template Parameters">
+      <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_Type42920436" id=
+"Size_Type42920436"><b>typename</b> Size_Type </a>
+</pre>
+        </td>
+
+        <td>
+          <p>Size type.</p>
+        </td>
+
+        <td>size_t</td>
+      </tr>
+    </table>
+
+    <h2><a name="link2" id="link2">Public Types and
+    Constants</a></h2>
+
+    <h3><a name="link3" id="link3">General Definitions</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Types">
+      <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_type55424436" id="size_type55424436">size_type</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<a href="#Size_Type42920436"><tt>Size_Type</tt></a>
+</pre>
+        </td>
+
+        <td>
+          <p>Size type.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h2><a name="link4" id="link4">Public Methods</a></h2>
+
+    <h3><a name="link5" id="link5">Constructors, Destructor, and
+    Related</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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
+  (<span class=
+"c2"><tt>direct_mask_range_hashing</tt></span> &amp;other)
+</pre>
+        </td>
+
+        <td>
+          <p>Swaps content.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h2><a name="link6" id="link6">Protected Methods</a></h2>
+
+    <h3><a name="link7" id="link7">Notification Methods</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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_type55424436"><tt>size_type</tt></a> size)
+</pre>
+        </td>
+
+        <td>
+          <p>Notifies the policy object that the container's size
+          has changed to <span class="c1"><tt>size</tt></span>.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h3><a name="link8" id="link8">Operators.</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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_type55424436"><tt>size_type</tt></a>
+  <b>operator</b>()
+  (<a href=
+"#size_type55424436"><tt>size_type</tt></a> hash) <b>const</b>
+</pre>
+        </td>
+
+        <td>
+          <p>Transforms the hash value <span class=
+          "c1"><tt>hash</tt></span> into a ranged-hash value (using
+          a bit-mask).</p>
+        </td>
+      </tr>
+    </table>
+  </div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/direct_mod_range_hashing.html b/libstdc++-v3/docs/html/ext/pb_ds/direct_mod_range_hashing.html
new file mode 100644
index 00000000000..33c99338ad1
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/direct_mod_range_hashing.html
@@ -0,0 +1,144 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+  <meta name="generator" content=
+  "HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+
+  <title>direct_mod_range_hashing Interface</title>
+  <meta http-equiv="Content-Type" content=
+  "text/html; charset=us-ascii" />
+  </head>
+
+<body>
+  <div id="page">
+    <h1><tt>direct_mod_range_hashing</tt> Interface</h1>
+
+    <p>A mod range-hashing class (uses the modulo function).</p>
+
+    <p>Defined in: <a href=
+    "../../../../include/ext/pb_ds/hash_policy.hpp"><tt>hash_policy.hpp</tt></a></p>
+
+    <h2><a name="link1" id="link1">Template Parameters</a></h2>
+
+    <table class="c1" width="100%" border="1" summary=
+    "Template Parameters">
+      <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_Type42920436" id=
+"Size_Type42920436"><b>typename</b> Size_Type </a>
+</pre>
+        </td>
+
+        <td>
+          <p>Size type.</p>
+        </td>
+
+        <td>size_t</td>
+      </tr>
+    </table>
+
+    <h2><a name="link2" id="link2">Public Types and
+    Constants</a></h2>
+
+    <h3><a name="link3" id="link3">General Definitions</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Types">
+      <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_type55424436" id="size_type55424436">size_type</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<a href="#Size_Type42920436"><tt>Size_Type</tt></a>
+</pre>
+        </td>
+
+        <td>
+          <p>Size type.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h2><a name="link4" id="link4">Public Methods</a></h2>
+
+    <h3><a name="link5" id="link5">Constructors, Destructor, and
+    Related</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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
+  (<span class=
+"c2"><tt>direct_mod_range_hashing</tt></span> &amp;other)
+</pre>
+        </td>
+
+        <td>
+          <p>Swaps content.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h2><a name="link6" id="link6">Protected Methods</a></h2>
+
+    <h3><a name="link7" id="link7">Notification Methods</a></h3>
+
+    <h3><a name="link8" id="link8">Operators.</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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_type55424436"><tt>size_type</tt></a>
+  <b>operator</b>()
+  (<a href=
+"#size_type55424436"><tt>size_type</tt></a> hash) <b>const</b>
+</pre>
+        </td>
+
+        <td>
+          <p>Transforms the hash value <span class=
+          "c1"><tt>hash</tt></span> into a ranged-hash value (using
+          a modulo operation).</p>
+        </td>
+      </tr>
+    </table>
+  </div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/disclaimer.html b/libstdc++-v3/docs/html/ext/pb_ds/disclaimer.html
new file mode 100644
index 00000000000..681af4edf72
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/disclaimer.html
@@ -0,0 +1,34 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+  <meta name="generator" content=
+  "HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+
+  <title>What, me worry?</title>
+  <meta http-equiv="Content-Type" content=
+  "text/html; charset=us-ascii" />
+  </head>
+
+<body>
+  <div id="page">
+    <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>
+  </div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/ds_gen.html b/libstdc++-v3/docs/html/ext/pb_ds/ds_gen.html
new file mode 100644
index 00000000000..5c3eea6a423
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/ds_gen.html
@@ -0,0 +1,344 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+  <meta name="generator" content=
+  "HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+
+  <title>Data-Structure Genericity</title>
+  <meta http-equiv="Content-Type" content=
+  "text/html; charset=us-ascii" />
+  </head>
+
+<body>
+  <div id="page">
+    <h1>Data-Structure Genericity</h1>
+
+    <h2><a name="problem" id="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 behavior of the object? <i>E.g.</i>, suppose one
+    writes</p>
+    <pre>
+<b>template</b>&lt;<b>typename</b> Cntnr&gt;
+<b>void</b>
+some_op_sequence(Cntnr &amp;r_container)
+{
+    ...
+}
+</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? Tree-based
+      and Trie-based containers store elements by key order;
+      others, typically, do not. A container based on a splay trees
+      or lists with update policies "cache" "frequently accessed"
+      elements; containers based on most other underlying
+      data structures do not.</li>
+    </ol>
+
+    <p>The remainder of this section deals with these issues.</p>
+
+    <h2><a name="ds_hierarchy" id="ds_hierarchy">Container
+    Hierarchy</a></h2>
+
+    <p>Figure <a href="#cd">Container class hierarchy</a> shows the
+    container hierarchy.</p>
+
+    <h6 class="c1"><a name="cd" id="cd"><img src="container_cd.png" alt=
+    "no image" /></a></h6>
+
+    <h6 class="c1">Container class hierarchy.</h6>
+
+    <ol>
+      <li><a href=
+      "container_base.html"><tt>container_base</tt></a> is an
+      abstract base class for associative containers.</li>
+
+      <li>Tree-Like-Based Associative-Containers:
+
+        <ol>
+          <li><a href=
+          "basic_tree.html"><tt>basic_tree</tt></a>
+          is an abstract base class for tree-like-based
+          associative-containers</li>
+
+          <li><a href=
+          "tree.html"><tt>tree</tt></a>
+          is a concrete base class for tree-based
+          associative-containers</li>
+
+          <li><a href=
+          "trie.html"><tt>trie</tt></a>
+          is a concrete base class trie-based
+          associative-containers</li>
+        </ol>
+      </li>
+
+      <li>Hash-Based Associative-Containers:
+
+        <ol>
+          <li><a href=
+          "basic_hash_table.html"><tt>basic_hash_table</tt></a>
+          is an abstract base class for hash-based
+          associative-containers</li>
+
+          <li><a href=
+          "cc_hash_table.html"><tt>cc_hash_table</tt></a>
+          is a concrete collision-chaining hash-based
+          associative-containers</li>
+
+          <li><a href=
+          "gp_hash_table.html"><tt>gp_hash_table</tt></a>
+          is a concrete (general) probing hash-based
+          associative-containers</li>
+        </ol>
+      </li>
+
+      <li>List-Based Associative-Containers:
+
+        <ol>
+          <li><a href=
+          "list_update.html"><tt>list_update</tt></a> -
+          list-based update-policy associative container</li>
+        </ol>
+      </li>
+    </ol>
+
+    <p>The hierarchy is composed naturally so that commonality is
+    captured by base classes. Thus <tt><b>operator[]</b></tt> is
+    defined <a href=
+    "container_base.html"><tt>container_base</tt></a>, since
+    all containers support it. Conversely <tt>split</tt> is defined
+    in <a href=
+    "basic_tree.html"><tt>basic_tree</tt></a>,
+    since only tree-like containers support it. <a href=
+    "#container_traits">Data-Structure Tags and Traits</a> discusses how
+    to query which types and methods each container supports.</p>
+
+    <h2><a name="container_traits" id="container_traits">Data-Structure Tags and
+    Traits</a></h2>
+
+    <p>Tags and traits are very useful for manipulating generic
+    types. For example, if <tt>It</tt> is an iterator class, then
+    <tt><b>typename</b> It::iterator_category</tt> or
+    <tt><b>typename</b>
+    std::iterator_traits&lt;It&gt;::iterator_category</tt> will
+    yield its category, and <tt><b>typename</b>
+    std::iterator_traits&lt;It&gt;::value_type</tt> will yield its
+    value type.</p>
+
+    <p><tt>pb_ds</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=
+    "#tag_cd">Data-structure tag class hierarchy</a>.</p>
+
+    <h6 class="c1"><a name="tag_cd" id="tag_cd"><img src=
+    "assoc_container_tag_cd.png" alt="no image" /></a></h6>
+
+    <h6 class="c1">Data-structure tag class hierarchy.</h6>
+
+    <p><a href=
+    "container_base.html"><tt>container_base</tt></a>
+    publicly defines <tt>container_category</tt> as one of the classes in
+    Figure <a href="#tag_cd">Data-structure tag class
+    hierarchy</a>. Given any container <tt>Cntnr</tt>, the tag of
+    the underlying data structure can be found via
+    <tt><b>typename</b> Cntnr::container_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=
+    "assoc_container_traits.html">pb_ds::container_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=
+    "assoc_container_traits.html"><tt>container_traits</tt></a><tt>&lt;Cntnr&gt;::erase_can_throw</tt>,
+    for example.
+
+    <p>Some of the definitions in <a href=
+    "assoc_container_traits.html"><tt>container_traits</tt></a> are
+    dependent on other definitions. <i>E.g.</i>, if <a href=
+    "assoc_container_traits.html"><tt>container_traits</tt></a><tt>&lt;Cntnr&gt;::order_preserving</tt>
+    is <tt><b>true</b></tt> (which is the case for containers based
+    on trees and tries), then the container can be split or joined;
+    in this case, <a href=
+    "assoc_container_traits.html"><tt>container_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=
+    "assoc_container_traits.html"><tt>container_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>]).</p>
+
+    <h2><a name="find_range" id="find_range">Point-Type and
+    Range-Type Methods and Iterators</a></h2>
+
+    <h3><a name="it_unordered" id="it_unordered">Iterators in
+    Unordered Container Types</a></h3>
+
+    <p><tt>pb_ds</tt> differentiates between two types of methods
+    and iterators: point-type methods and iterators, and range-type
+    methods and iterators (see <a href=
+    "motivation.html#assoc_diff_it">Motivation::Associative
+    Containers::Differentiating between Iterator Types</a> and
+    <a href="tutorial.html#assoc_find_range">Tutorial::Associative
+    Containers::Point-Type and Range-Type Methods and
+    Iterators</a>). Each associative container's interface includes
+    the methods:</p>
+    <pre>
+const_point_iterator
+find(const_key_reference r_key) const;                
+
+point_iterator
+find(const_key_reference r_key);         
+    
+std::pair&lt;point_iterator,<b>bool</b>&gt;
+insert(const_reference r_val);
+</pre>
+
+    <p>The relationship between these iterator types varies between
+    container types. Figure <a href=
+    "#point_iterators_cd">Point-type and range-type iterators</a>-A
+    shows the most general invariant between point-type and
+    range-type iterators: <tt>iterator</tt>, <i>e.g.</i>, can
+    always be converted to <tt>point_iterator</tt>. Figure <a href=
+    "#point_iterators_cd">Point-type and range-type iterators</a>-B
+    shows invariants for order-preserving containers: point-type
+    iterators are synonymous with range-type iterators.
+    Orthogonally, Figure <a href="#point_iterators_cd">Point-type
+    and range-type iterators</a>-C shows invariants for "set"
+    containers: iterators are synonymous with const iterators.</p>
+
+    <h6 class="c1"><a name="point_iterators_cd" id=
+    "point_iterators_cd"><img src="point_iterators_cd.png" alt=
+    "no image" /></a></h6>
+
+    <h6 class="c1">Point-type and range-type iterators.</h6>
+
+    <p>Note that point-type iterators in self-organizing containers
+    (<i>e.g.</i>, hash-based associative containers) lack movement
+    operators, such as <tt><b>operator++</b></tt> - in fact, this
+    is the reason why <tt>pb_ds</tt> differentiates from the STL's
+    design on this point.</p>
+
+    <p>Typically, one can determine an iterator's movement
+    capabilities in the STL using
+    <tt>std::iterator_traits&lt;It&gt;iterator_category</tt>, which
+    is a <tt><b>struct</b></tt> indicating the iterator's movement
+    capabilities. Unfortunately, none of the STL's predefined
+    categories reflect a pointer's <u>not</u> having any movement
+    capabilities whatsoever. Consequently, <tt>pb_ds</tt> adds a
+    type <a href=
+    "trivial_iterator_tag.html"><tt>trivial_iterator_tag</tt></a>
+    (whose name is taken from a concept in [<a href=
+    "references.html#sgi_stl">sgi_stl</a>]), which is the category
+    of iterators with no movement capabilities. All other STL tags,
+    such as <tt>forward_iterator_tag</tt> retain their common
+    use.</p>
+
+    <h3><a name="inv_guar" id="inv_guar">Invalidation
+    Guarantees</a></h3>
+
+    <p><a href=
+    "motivation.html#assoc_inv_guar">Motivation::Associative
+    Containers::Differentiating between Iterator
+    Types::Invalidation Guarantees</a> posed a problem. Given three
+    different types of associative containers, a modifying
+    operation (in that example, <tt>erase</tt>) invalidated
+    iterators in three different ways: the iterator of one
+    container remained completely valid - it could be de-referenced
+    and incremented; the iterator of a different container could
+    not even be de-referenced; the iterator of the third container
+    could be de-referenced, but its "next" iterator changed
+    unpredictably.</p>
+
+    <p>Distinguishing between find and range types allows
+    fine-grained invalidation guarantees, because these questions
+    correspond exactly to the question of whether point-type
+    iterators and range-type iterators are valid. <a href=
+    "#invalidation_guarantee_cd">Invalidation guarantees class
+    hierarchy</a> shows tags corresponding to different types of
+    invalidation guarantees.</p>
+
+    <h6 class="c1"><a name="invalidation_guarantee_cd" id=
+    "invalidation_guarantee_cd"><img src=
+    "invalidation_guarantee_cd.png" alt="no image" /></a></h6>
+
+    <h6 class="c1">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 point-type iterator,
+      a found pointer, or a found reference, remains valid as long
+      as the container object is not modified.</li>
+
+      <li><a href=
+      "point_invalidation_guarantee.html"><tt>point_invalidation_guarantee</tt></a>
+      corresponds to a guarantee that a point-type iterator, a
+      found pointer, or a found reference, remains valid even if
+      the container 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 container object is modified.</li>
+    </ol>
+
+    <p>As shown in <a href=
+    "tutorial.html#assoc_find_range">Tutorial::Associative
+    Containers::Point-Type and Range-Type Methods and
+    Iterators</a>, to find the invalidation guarantee of a
+    container, one can use</p>
+    <pre>
+<b>typename</b> <a href=
+"assoc_container_traits.html">container_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>
+
+    <p>Note that this hierarchy corresponds to the logic it
+    represents: if a container has range-invalidation guarantees,
+    then it must also have find invalidation guarantees;
+    correspondingly, its invalidation guarantee (in this case
+    <a href=
+    "range_invalidation_guarantee.html"><tt>range_invalidation_guarantee</tt></a>)
+    can be cast to its base class (in this case <a href=
+    "point_invalidation_guarantee.html"><tt>point_invalidation_guarantee</tt></a>).
+    This means that this this hierarchy can be used easily using
+    standard metaprogramming techniques, by specializing on the
+    type of <tt>invalidation_guarantee</tt>.</p>
+
+    <p>(These types of problems were addressed, in a more general
+    setting, in [<a href=
+    "references.html#meyers96more">meyers96more</a>] - Item 2. In
+    our opinion, an invalidation-guarantee hierarchy would solve
+    these problems in all container types - not just associative
+    containers.)</p>
+  </div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/embedded_lists_1.png b/libstdc++-v3/docs/html/ext/pb_ds/embedded_lists_1.png
new file mode 100644
index 00000000000..9470a65b568
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/embedded_lists_1.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/embedded_lists_2.png b/libstdc++-v3/docs/html/ext/pb_ds/embedded_lists_2.png
new file mode 100644
index 00000000000..d2ac91c1ab0
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/embedded_lists_2.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/embedded_lists_3.png b/libstdc++-v3/docs/html/ext/pb_ds/embedded_lists_3.png
new file mode 100644
index 00000000000..08ecb0ffe16
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/embedded_lists_3.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/examples.html b/libstdc++-v3/docs/html/ext/pb_ds/examples.html
new file mode 100644
index 00000000000..03c7a391003
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/examples.html
@@ -0,0 +1,24 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+  <meta name="generator" content=
+  "HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+
+  <title>Examples</title>
+  <meta http-equiv="Content-Type" content=
+  "text/html; charset=us-ascii" />
+  </head>
+
+<body>
+  <div id="page">
+    <h1>Examples</h1>
+
+    <p><a href="assoc_examples.html">Associative-Container
+    Examples</a> shows examples for associative containers;
+    <a href="pq_examples.html">Priority-Queue Examples</a> shows
+    examples for priority queues.</p>
+  </div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/exceptions.html b/libstdc++-v3/docs/html/ext/pb_ds/exceptions.html
new file mode 100644
index 00000000000..3b50c27aa04
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/exceptions.html
@@ -0,0 +1,46 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
+ "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+<meta name="generator" content=
+ "HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+
+<title>container_error Interface</title>
+<meta http-equiv="Content-Type" content=
+ "text/html; charset=us-ascii" />
+</head>
+
+<body>
+<div id="page">
+<h1><tt>container_error</tt> Interface</h1>
+
+<p>Base class for associative-container exceptions.</p>
+
+<p>Defined in: <a href=
+		"../../../../include/ext/pb_ds/exception.hpp"><tt>exception.hpp</tt></a></p>
+
+<h2><a name="link1" id="link1">Base Classes</a></h2>
+
+<table class="c1" width="100%" border="1" summary="Bases">
+<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>
+</div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/gp_hash_random_int_find_timing_test_gcc.png b/libstdc++-v3/docs/html/ext/pb_ds/gp_hash_random_int_find_timing_test_gcc.png
new file mode 100644
index 00000000000..d86299b7e3e
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/gp_hash_random_int_find_timing_test_gcc.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/gp_hash_random_int_find_timing_test_local.png b/libstdc++-v3/docs/html/ext/pb_ds/gp_hash_random_int_find_timing_test_local.png
new file mode 100644
index 00000000000..1b31b7f27ca
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/gp_hash_random_int_find_timing_test_local.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/gp_hash_random_int_find_timing_test_msvc.png b/libstdc++-v3/docs/html/ext/pb_ds/gp_hash_random_int_find_timing_test_msvc.png
new file mode 100644
index 00000000000..b7082f28605
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/gp_hash_random_int_find_timing_test_msvc.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/gp_hash_random_int_subscript_timing_test_find_gcc.png b/libstdc++-v3/docs/html/ext/pb_ds/gp_hash_random_int_subscript_timing_test_find_gcc.png
new file mode 100644
index 00000000000..b9fbe00deff
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/gp_hash_random_int_subscript_timing_test_find_gcc.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/gp_hash_random_int_subscript_timing_test_find_local.png b/libstdc++-v3/docs/html/ext/pb_ds/gp_hash_random_int_subscript_timing_test_find_local.png
new file mode 100644
index 00000000000..c693ed3869b
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/gp_hash_random_int_subscript_timing_test_find_local.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/gp_hash_random_int_subscript_timing_test_find_msvc.png b/libstdc++-v3/docs/html/ext/pb_ds/gp_hash_random_int_subscript_timing_test_find_msvc.png
new file mode 100644
index 00000000000..248ff6b8872
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/gp_hash_random_int_subscript_timing_test_find_msvc.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/gp_hash_random_int_subscript_timing_test_insert_gcc.png b/libstdc++-v3/docs/html/ext/pb_ds/gp_hash_random_int_subscript_timing_test_insert_gcc.png
new file mode 100644
index 00000000000..ac4f838fe26
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/gp_hash_random_int_subscript_timing_test_insert_gcc.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/gp_hash_random_int_subscript_timing_test_insert_local.png b/libstdc++-v3/docs/html/ext/pb_ds/gp_hash_random_int_subscript_timing_test_insert_local.png
new file mode 100644
index 00000000000..9fa08a0c2c3
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/gp_hash_random_int_subscript_timing_test_insert_local.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/gp_hash_random_int_subscript_timing_test_insert_msvc.png b/libstdc++-v3/docs/html/ext/pb_ds/gp_hash_random_int_subscript_timing_test_insert_msvc.png
new file mode 100644
index 00000000000..5f1d740b817
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/gp_hash_random_int_subscript_timing_test_insert_msvc.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/gp_hash_table.html b/libstdc++-v3/docs/html/ext/pb_ds/gp_hash_table.html
new file mode 100644
index 00000000000..446359b4a89
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/gp_hash_table.html
@@ -0,0 +1,891 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+  <meta name="generator" content=
+  "HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+
+  <title>gp_hash_table Interface</title>
+  <meta http-equiv="Content-Type" content=
+  "text/html; charset=us-ascii" />
+  </head>
+
+<body>
+  <div id="page">
+    <h1><tt>gp_hash_table</tt> Interface</h1>
+
+    <p>A concrete general-probing hash-based associative
+    container.</p>
+
+    <p>Defined in: <a href=
+    "../../../../include/ext/pb_ds/assoc_container.hpp"><tt>assoc_container.hpp</tt></a></p>
+
+    <h2><a name="link1" id="link1">Template Parameters</a></h2>
+
+    <table class="c1" width="100%" border="1" summary=
+    "Template Parameters">
+      <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="Key2501" id="Key2501"><b>typename</b> Key</a>
+</pre>
+        </td>
+
+        <td>
+          <p>Key type.</p>
+        </td>
+
+        <td>-</td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="Mapped318655" id="Mapped318655"><b>typename</b> Mapped</a>
+</pre>
+        </td>
+
+        <td>
+          <p>Mapped type.</p>
+        </td>
+
+        <td>-</td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="Hash_Fn1515835" id=
+"Hash_Fn1515835"><b>class</b> Hash_Fn </a>
+</pre>
+        </td>
+
+        <td>
+          <p>Hash functor.</p>
+        </td>
+
+        <td>
+          <pre>
+__gnu_cxx::hash&lt;<a href="#Key2501"><tt>Key</tt></a>&gt;
+</pre>if using gcc;
+          <pre>
+stdext::hash_value&lt;<a href="#Key2501"><tt>Key</tt></a>&gt;
+</pre>if using Visual C++ .net
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="Eq_Fn60085" id="Eq_Fn60085"><b>class</b> Eq_Fn </a>
+</pre>
+        </td>
+
+        <td>
+          <p>Equivalence functor.</p>
+        </td>
+
+        <td>
+          <pre>
+std::equal_to&lt;<a href="#Key2501"><tt>Key</tt></a>&gt;
+</pre>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="Comb_Probe_Fn1603930855" id=
+"Comb_Probe_Fn1603930855"><b>class</b> Comb_Probe_Fn </a>
+</pre>
+        </td>
+
+        <td>
+          <p>Combining probe functor.</p>
+
+          <p>If <a href="#Hash_Fn1515835"><tt>Hash_Fn</tt></a> is
+          <a href="null_hash_fn.html"><span class=
+          "c2"><tt>null_hash_fn</tt></span></a>, and <a href=
+          "#Probe_Fn8454835"><tt>Probe_Fn</tt></a> is <a href=
+          "null_probe_fn.html"><span class=
+          "c2"><tt>null_probe_fn</tt></span></a>, then this is the
+          ranged-probe functor; otherwise, this is the
+          range-hashing functor.</p>
+
+          <p>(See <a href=
+          "hash_based_containers.html#hash_policies">Design::Hash-Based
+          Containers::Hash Policies</a>.)</p>
+        </td>
+
+        <td><a href="direct_mask_range_hashing.html"><span class=
+        "c2"><tt>direct_mask_range_hashing</tt></span></a></td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="Probe_Fn8454835" id=
+"Probe_Fn8454835"><b>class</b> Probe_Fn </a>
+</pre>
+        </td>
+
+        <td>
+          <p>Probe functor.</p>
+        </td>
+
+        <td>
+          If <tt><a href=
+          "#Comb_Probe_Fn1603930855"><tt>Comb_Probe_Fn</tt></a></tt>
+          is <a href="direct_mask_range_hashing.html"><span class=
+          "c2"><tt>direct_mask_range_hashing</tt></span></a>, then
+          <pre>
+<a href="linear_probe_fn.html"><span class=
+"c2"><tt>linear_probe_fn</tt></span></a>&lt;
+  <b>typename</b> <a href=
+"#Comb_Probe_Fn1603930855"><tt>Comb_Probe_Fn</tt></a>::size_type&gt;
+</pre>otherwise,
+          <pre>
+<a href="quadratic_probe_fn.html"><span class=
+"c2"><tt>quadratic_probe_fn</tt></span></a>&lt;
+  <b>typename</b> <a href=
+"#Comb_Probe_Fn1603930855"><tt>Comb_Probe_Fn</tt></a>::size_type&gt;
+</pre>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="Resize_Policy566860465" id=
+"Resize_Policy566860465"><b>class</b> Resize_Policy </a>
+</pre>
+        </td>
+
+        <td>
+          <p>Resize policy.</p>
+        </td>
+
+        <td>
+          If <tt><a href=
+          "#Comb_Probe_Fn1603930855"><tt>Comb_Probe_Fn</tt></a></tt>
+          is <tt><a href=
+          "direct_mask_range_hashing.html"><span class=
+          "c2"><tt>direct_mask_range_hashing</tt></span></a></tt>,
+          then
+          <pre>
+<a href="hash_standard_resize_policy.html"><span class=
+"c2"><tt>hash_standard_resize_policy</tt></span></a>&lt;
+  <a href="hash_exponential_size_policy.html"><span class=
+"c2"><tt>hash_exponential_size_policy</tt></span></a>&lt;
+    <b>typename</b> <a href=
+"#Comb_Probe_Fn1603930855"><tt>Comb_Probe_Fn</tt></a>::size_type&gt;,
+  <a href="hash_load_check_resize_trigger.html"><span class=
+"c2"><tt>hash_load_check_resize_trigger</tt></span></a>&lt;
+    <b>typename</b> <a href=
+"#Comb_Probe_Fn1603930855"><tt>Comb_Probe_Fn</tt></a>::size_type&gt;,
+  <b>false</b>,
+  <b>typename</b> <a href=
+"#Comb_Probe_Fn1603930855"><tt>Comb_Probe_Fn</tt></a>::size_type&gt;
+</pre>otherwise,
+          <pre>
+<a href="hash_standard_resize_policy.html"><span class=
+"c2"><tt>hash_standard_resize_policy</tt></span></a>&lt;
+  <a href="hash_exponential_size_policy.html"><span class=
+"c2"><tt>hash_exponential_size_policy</tt></span></a>&lt;
+    <b>typename</b> <a href=
+"#Comb_Probe_Fn1603930855"><tt>Comb_Probe_Fn</tt></a>::size_type&gt;,
+  <a href="hash_load_check_resize_trigger.html"><span class=
+"c2"><tt>hash_load_check_resize_trigger</tt></span></a>&lt;
+    <b>typename</b> <a href=
+"#Comb_Probe_Fn1603930855"><tt>Comb_Probe_Fn</tt></a>::size_type&gt;,
+  <b>false</b>,
+  <b>typename</b> <a href=
+"#Comb_Probe_Fn1603930855"><tt>Comb_Probe_Fn</tt></a>::size_type&gt;
+</pre>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="Store_Hash218262104" id=
+"Store_Hash218262104"><b>bool</b> 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_fn2015995"><tt>hash_fn</tt></a></tt> is <a href=
+          "null_hash_fn.html"><span class=
+          "c2"><tt>null_hash_fn</tt></span></a>, 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="Allocator35940069" id=
+"Allocator35940069"><b>class</b> 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" id="link2">Base Classes</a></h2>
+
+    <table class="c1" width="100%" border="1" summary="Bases">
+      <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_table.html"><span class=
+"c2"><tt>basic_hash_table</tt></span></a>
+</pre>
+        </td>
+
+        <td>
+          <p>public</p>
+        </td>
+      </tr>
+    </table>
+
+    <h2><a name="link3" id="link3">Public Types and
+    Constants</a></h2>
+
+    <h3><a name="link4" id="link4">Policy Definitions</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Types">
+      <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_fn2015995" id="hash_fn2015995">hash_fn</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<a href="#Hash_Fn1515835"><tt>Hash_Fn</tt></a>
+</pre>
+        </td>
+
+        <td>
+          <p>Hash functor type.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="eq_fn80245" id="eq_fn80245">eq_fn</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<a href="#Eq_Fn60085"><tt>Eq_Fn</tt></a>
+</pre>
+        </td>
+
+        <td>
+          <p>Equivalence functor type.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="comb_probe_fn828996423" id=
+"comb_probe_fn828996423">comb_probe_fn</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<a href="#Comb_Probe_Fn1603930855"><tt>Comb_Probe_Fn</tt></a>
+</pre>
+        </td>
+
+        <td>
+          <p>Combining probe functor type.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="probe_fn10954995" id="probe_fn10954995">probe_fn</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<a href="#Probe_Fn8454835"><tt>Probe_Fn</tt></a>
+</pre>
+        </td>
+
+        <td>
+          <p>Probe functor type.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="resize_policy4084493169" id=
+"resize_policy4084493169">resize_policy</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<a href="#Resize_Policy566860465"><tt>Resize_Policy</tt></a>
+</pre>
+        </td>
+
+        <td>
+          <p>Resize policy type.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h2><a name="link5" id="link5">Public Methods</a></h2>
+
+    <h3><a name="link6" id="link6">Constructors, Destructor, and
+    Related</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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_table
+  ()
+</pre>
+        </td>
+
+        <td>
+          <p>Default constructor.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+  gp_hash_table
+  (<b>const</b> <a href=
+"#hash_fn2015995"><tt>hash_fn</tt></a> &amp;r_hash_fn)
+</pre>
+        </td>
+
+        <td>
+          <p>Constructor taking some policy objects. <span class=
+          "c1"><tt>r_hash_fn</tt></span> will be copied by the
+          <a href="#hash_fn2015995"><tt>hash_fn</tt></a> object of
+          the container object.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+  gp_hash_table
+  (<b>const</b> <a href=
+"#hash_fn2015995"><tt>hash_fn</tt></a> &amp;r_hash_fn, 
+    <b>const</b> <a href=
+"#eq_fn80245"><tt>eq_fn</tt></a> &amp;r_eq_fn)
+</pre>
+        </td>
+
+        <td>
+          <p>Constructor taking some policy objects. <span class=
+          "c1"><tt>r_hash_fn</tt></span> will be copied by the
+          <a href="#hash_fn2015995"><tt>hash_fn</tt></a> object of
+          the container object, and <span class=
+          "c1"><tt>r_eq_fn</tt></span> will be copied by the
+          <a href="#eq_fn80245"><tt>eq_fn</tt></a> object of the
+          container object.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+  gp_hash_table
+  (<b>const</b> <a href=
+"#hash_fn2015995"><tt>hash_fn</tt></a> &amp;r_hash_fn, 
+    <b>const</b> <a href=
+"#eq_fn80245"><tt>eq_fn</tt></a> &amp;r_eq_fn, 
+    <b>const</b> <a href=
+"#comb_probe_fn828996423"><tt>comb_probe_fn</tt></a> &amp;r_comb_probe_fn)
+</pre>
+        </td>
+
+        <td>
+          <p>Constructor taking some policy objects. <span class=
+          "c1"><tt>r_hash_fn</tt></span> will be copied by the
+          <a href="#hash_fn2015995"><tt>hash_fn</tt></a> object of
+          the container object, <span class=
+          "c1"><tt>r_eq_fn</tt></span> will be copied by the
+          <a href="#eq_fn80245"><tt>eq_fn</tt></a> object of the
+          container object, and <span class=
+          "c1"><tt>r_comb_probe_fn</tt></span> will be copied by
+          the <a href=
+          "#comb_probe_fn828996423"><tt>comb_probe_fn</tt></a>
+          object of the container object.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+  gp_hash_table
+  (<b>const</b> <a href=
+"#hash_fn2015995"><tt>hash_fn</tt></a> &amp;r_hash_fn, 
+    <b>const</b> <a href=
+"#eq_fn80245"><tt>eq_fn</tt></a> &amp;r_eq_fn, 
+    <b>const</b> <a href=
+"#comb_probe_fn828996423"><tt>comb_probe_fn</tt></a> &amp;r_comb_probe_fn,
+    <b>const</b> <a href=
+"#probe_fn10954995"><tt>probe_fn</tt></a> &amp;r_probe_fn)
+</pre>
+        </td>
+
+        <td>
+          <p>Constructor taking some policy objects. <span class=
+          "c1"><tt>r_hash_fn</tt></span> will be copied by the
+          <a href="#hash_fn2015995"><tt>hash_fn</tt></a> object of
+          the container object, <span class=
+          "c1"><tt>r_eq_fn</tt></span> will be copied by the
+          <a href="#eq_fn80245"><tt>eq_fn</tt></a> object of the
+          container object, <span class=
+          "c1"><tt>r_comb_probe_fn</tt></span> will be copied by
+          the <a href=
+          "#comb_probe_fn828996423"><tt>comb_probe_fn</tt></a>
+          object of the container object, and <span class=
+          "c1"><tt>r_probe_fn</tt></span> will be copied by the
+          <a href="#probe_fn10954995"><tt>probe_fn</tt></a> object
+          of the container object.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+  gp_hash_table
+  (<b>const</b> <a href=
+"#hash_fn2015995"><tt>hash_fn</tt></a> &amp;r_hash_fn, 
+    <b>const</b> <a href=
+"#eq_fn80245"><tt>eq_fn</tt></a> &amp;r_eq_fn, 
+    <b>const</b> <a href=
+"#comb_probe_fn828996423"><tt>comb_probe_fn</tt></a> &amp;r_comb_probe_fn, 
+    <b>const</b> <a href=
+"#probe_fn10954995"><tt>probe_fn</tt></a> &amp;r_probe_fn,
+    <b>const</b> <a href=
+"#resize_policy4084493169"><tt>resize_policy</tt></a> &amp;r_resize_policy)
+</pre>
+        </td>
+
+        <td>
+          <p>Constructor taking some policy objects. <span class=
+          "c1"><tt>r_hash_fn</tt></span> will be copied by the
+          <a href="#hash_fn2015995"><tt>hash_fn</tt></a> object of
+          the container object, <span class=
+          "c1"><tt>r_eq_fn</tt></span> will be copied by the
+          <a href="#eq_fn80245"><tt>eq_fn</tt></a> object of the
+          container object, <span class=
+          "c1"><tt>r_comb_probe_fn</tt></span> will be copied by
+          the <a href=
+          "#comb_probe_fn828996423"><tt>comb_probe_fn</tt></a>
+          object of the container object, <span class=
+          "c1"><tt>r_probe_fn</tt></span> will be copied by the
+          <a href="#probe_fn10954995"><tt>probe_fn</tt></a> object
+          of the container object, and <span class=
+          "c1"><tt>r_resize_policy</tt></span> will be copied by
+          the <a href=
+          "#Resize_Policy566860465"><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_table
+  (It first_it, 
+    It last_it)
+</pre>
+        </td>
+
+        <td>
+          <p>Constructor taking iterators to a range of
+          value_types. The value_types between <span class=
+          "c1"><tt>first_it</tt></span> and <span class=
+          "c1"><tt>last_it</tt></span> will be inserted into the
+          container object.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<b>template</b>&lt;
+    <b>class</b> It&gt;
+  gp_hash_table
+  (It first_it, 
+    It last_it,
+    <b>const</b> <a href=
+"#hash_fn2015995"><tt>hash_fn</tt></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
+          <span class="c1"><tt>first_it</tt></span> and
+          <span class="c1"><tt>last_it</tt></span> will be inserted
+          into the container object. <span class=
+          "c1"><tt>r_hash_fn</tt></span> will be copied by the
+          <a href="#hash_fn2015995"><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_table
+  (It first_it, 
+    It last_it,
+    <b>const</b> <a href=
+"#hash_fn2015995"><tt>hash_fn</tt></a> &amp;r_hash_fn, 
+    <b>const</b> <a href=
+"#eq_fn80245"><tt>eq_fn</tt></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
+          <span class="c1"><tt>first_it</tt></span> and
+          <span class="c1"><tt>last_it</tt></span> will be inserted
+          into the container object. <span class=
+          "c1"><tt>r_hash_fn</tt></span> will be copied by the
+          <a href="#hash_fn2015995"><tt>hash_fn</tt></a> object of
+          the container object, and <span class=
+          "c1"><tt>r_eq_fn</tt></span> will be copied by the
+          <a href="#eq_fn80245"><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_table
+  (It first_it, 
+    It last_it,
+    <b>const</b> <a href=
+"#hash_fn2015995"><tt>hash_fn</tt></a> &amp;r_hash_fn, 
+    <b>const</b> <a href=
+"#eq_fn80245"><tt>eq_fn</tt></a> &amp;r_eq_fn, 
+    <b>const</b> <a href=
+"#comb_probe_fn828996423"><tt>comb_probe_fn</tt></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
+          <span class="c1"><tt>first_it</tt></span> and
+          <span class="c1"><tt>last_it</tt></span> will be inserted
+          into the container object. <span class=
+          "c1"><tt>r_hash_fn</tt></span> will be copied by the
+          <a href="#hash_fn2015995"><tt>hash_fn</tt></a> object of
+          the container object, <span class=
+          "c1"><tt>r_eq_fn</tt></span> will be copied by the
+          <a href="#eq_fn80245"><tt>eq_fn</tt></a> object of the
+          container object, and <span class=
+          "c1"><tt>r_comb_probe_fn</tt></span> will be copied by
+          the <a href=
+          "#comb_probe_fn828996423"><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_table
+  (It first_it, 
+    It last_it,
+    <b>const</b> <a href=
+"#hash_fn2015995"><tt>hash_fn</tt></a> &amp;r_hash_fn, 
+    <b>const</b> <a href=
+"#eq_fn80245"><tt>eq_fn</tt></a> &amp;r_eq_fn, 
+    <b>const</b> <a href=
+"#comb_probe_fn828996423"><tt>comb_probe_fn</tt></a> &amp;r_comb_probe_fn,
+    <b>const</b> <a href=
+"#probe_fn10954995"><tt>probe_fn</tt></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
+          <span class="c1"><tt>first_it</tt></span> and
+          <span class="c1"><tt>last_it</tt></span> will be inserted
+          into the container object. <span class=
+          "c1"><tt>r_hash_fn</tt></span> will be copied by the
+          <a href="#hash_fn2015995"><tt>hash_fn</tt></a> object of
+          the container object, <span class=
+          "c1"><tt>r_eq_fn</tt></span> will be copied by the
+          <a href="#eq_fn80245"><tt>eq_fn</tt></a> object of the
+          container object, <span class=
+          "c1"><tt>r_comb_probe_fn</tt></span> will be copied by
+          the <a href=
+          "#comb_probe_fn828996423"><tt>comb_probe_fn</tt></a>
+          object of the container object, and <span class=
+          "c1"><tt>r_probe_fn</tt></span> will be copied by the
+          <a href="#probe_fn10954995"><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_table
+  (It first_it, 
+    It last_it,
+    <b>const</b> <a href=
+"#hash_fn2015995"><tt>hash_fn</tt></a> &amp;r_hash_fn, 
+    <b>const</b> <a href=
+"#eq_fn80245"><tt>eq_fn</tt></a> &amp;r_eq_fn, 
+    <b>const</b> <a href=
+"#comb_probe_fn828996423"><tt>comb_probe_fn</tt></a> &amp;r_comb_probe_fn, 
+    <b>const</b> <a href=
+"#probe_fn10954995"><tt>probe_fn</tt></a> &amp;r_probe_fn,      
+    <b>const</b> <a href=
+"#resize_policy4084493169"><tt>resize_policy</tt></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
+          <span class="c1"><tt>first_it</tt></span> and
+          <span class="c1"><tt>last_it</tt></span> will be inserted
+          into the container object. <span class=
+          "c1"><tt>r_hash_fn</tt></span> will be copied by the
+          <a href="#hash_fn2015995"><tt>hash_fn</tt></a> object of
+          the container object, <span class=
+          "c1"><tt>r_eq_fn</tt></span> will be copied by the
+          <a href="#eq_fn80245"><tt>eq_fn</tt></a> object of the
+          container object, <span class=
+          "c1"><tt>r_comb_probe_fn</tt></span> will be copied by
+          the <a href=
+          "#comb_probe_fn828996423"><tt>comb_probe_fn</tt></a>
+          object of the container object, <span class=
+          "c1"><tt>r_probe_fn</tt></span> will be copied by the
+          <a href="#probe_fn10954995"><tt>probe_fn</tt></a> object
+          of the container object, and <span class=
+          "c1"><tt>r_resize_policy</tt></span> will be copied by
+          the <a href=
+          "#resize_policy4084493169"><tt>resize_policy</tt></a>
+          object of the container object.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+  gp_hash_table
+  (<b>const</b> <span class=
+"c2"><tt>gp_hash_table</tt></span> &amp;other)
+</pre>
+        </td>
+
+        <td>
+          <p>Copy constructor.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<b>virtual</b> 
+  ~gp_hash_table
+  ()
+</pre>
+        </td>
+
+        <td>
+          <p>Destructor.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<span class="c2"><tt>gp_hash_table</tt></span> &amp;
+  <b>operator</b>=
+  (<b>const</b> <span class=
+"c2"><tt>gp_hash_table</tt></span> &amp;other)
+</pre>
+        </td>
+
+        <td>
+          <p>Assignment operator.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<b>void</b>
+  swap
+  (<span class=
+"c2"><tt>gp_hash_table</tt></span> &amp;other)
+</pre>
+        </td>
+
+        <td>
+          <p>Swaps content.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h3><a name="link7" id="link7">Policy Access Methods</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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_fn828996423"><tt>comb_probe_fn</tt></a> &amp;
+  get_comb_probe_fn
+  ()
+</pre>
+        </td>
+
+        <td>
+          <p>Access to the <a href=
+          "#comb_probe_fn828996423"><tt>comb_probe_fn</tt></a>
+          object.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<b>const</b> <a href=
+"#comb_probe_fn828996423"><tt>comb_probe_fn</tt></a> &amp;
+  get_comb_probe_fn
+  () <b>const</b>
+</pre>
+        </td>
+
+        <td>
+          <p>Const access to the <a href=
+          "#comb_probe_fn828996423"><tt>comb_probe_fn</tt></a>
+          object.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a href="#probe_fn10954995"><tt>probe_fn</tt></a> &amp;
+  get_probe_fn
+  ()
+</pre>
+        </td>
+
+        <td>
+          <p>Access to the <a href=
+          "#probe_fn10954995"><tt>probe_fn</tt></a> object.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<b>const</b> <a href=
+"#probe_fn10954995"><tt>probe_fn</tt></a> &amp;
+  get_probe_fn
+  () <b>const</b>
+</pre>
+        </td>
+
+        <td>
+          <p>Const access to the <a href=
+          "#probe_fn10954995"><tt>probe_fn</tt></a> object.</p>
+        </td>
+      </tr>
+    </table>
+  </div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/gp_hash_tag.html b/libstdc++-v3/docs/html/ext/pb_ds/gp_hash_tag.html
new file mode 100644
index 00000000000..720984fff2f
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/gp_hash_tag.html
@@ -0,0 +1,47 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+  <meta name="generator" content=
+  "HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+
+  <title>gp_hash_tag Interface</title>
+  <meta http-equiv="Content-Type" content=
+  "text/html; charset=us-ascii" />
+  </head>
+
+<body>
+  <div id="page">
+    <h1><tt>gp_hash_tag</tt> Interface</h1>
+
+    <p>General-probing hash data structure tag.</p>
+
+    <p>Defined in: <a href=
+    "../../../../include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
+
+    <h2><a name="link1" id="link1">Base Classes</a></h2>
+
+    <table class="c1" width="100%" border="1" summary="Bases">
+      <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_tag.html"><span class=
+"c2"><tt>basic_hash_tag</tt></span></a>
+</pre>
+        </td>
+
+        <td>
+          <p>public</p>
+        </td>
+      </tr>
+    </table>
+  </div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/hash_based_containers.html b/libstdc++-v3/docs/html/ext/pb_ds/hash_based_containers.html
new file mode 100644
index 00000000000..fed7a4869d0
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/hash_based_containers.html
@@ -0,0 +1,835 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+  <meta name="generator" content=
+  "HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+
+  <title>Hash-Based Containers</title>
+  <meta http-equiv="Content-Type" content=
+  "text/html; charset=us-ascii" />
+  </head>
+
+<body>
+  <div id="page">
+    <h1>Hash Table Design</h1>
+
+    <h2><a name="overview" id="overview">Overview</a></h2>
+
+    <p>The collision-chaining hash-based container has the
+    following declaration.</p>
+    <pre>
+<b>template</b>&lt;
+    <b>typename</b> Key,
+    <b>typename</b> Mapped,
+    <b>typename</b> Hash_Fn = std::hash&lt;Key&gt;,
+    <b>typename</b> Eq_Fn = std::equal_to&lt;Key&gt;,
+    <b>typename</b> Comb_Hash_Fn = <a href=
+"direct_mask_range_hashing.html">direct_mask_range_hashing</a>&lt;&gt;
+    <b>typename</b> Resize_Policy = <i>default explained below.</i>
+     <b>bool</b> Store_Hash = <b>false</b>,
+     <b>typename</b> Allocator = std::allocator&lt;<b>char</b>&gt; &gt;
+<b>class</b> <a href=
+"cc_hash_table.html">cc_hash_table</a>;
+</pre>
+
+    <p>The parameters have the following meaning:</p>
+
+    <ol>
+      <li><tt>Key</tt> is the key type.</li>
+
+      <li><tt>Mapped</tt> is the mapped-policy, and is explained in
+      <a href="tutorial.html#assoc_ms">Tutorial::Associative
+      Containers::Associative Containers Others than Maps</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 href=
+      "#hash_policies">Hash Policies</a>.</li>
+
+      <li><tt>Resize_Policy</tt> describes how a container object
+      should change its internal size. This is described in
+      <a href="#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 href="#policy_interaction">Policy Interaction</a>.</li>
+
+      <li><tt>Allocator</tt> is 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> Mapped,
+    <b>typename</b> Hash_Fn = std::hash&lt;Key&gt;,
+    <b>typename</b> Eq_Fn = std::equal_to&lt;Key&gt;,
+    <b>typename</b> Comb_Probe_Fn = <a href=
+"direct_mask_range_hashing.html">direct_mask_range_hashing</a>&lt;&gt;
+    <b>typename</b> Probe_Fn = <i>default explained below.</i>
+    <b>typename</b> Resize_Policy = <i>default explained below.</i>
+    <b>bool</b> Store_Hash = <b>false</b>,
+    <b>typename</b> Allocator =  std::allocator&lt;<b>char</b>&gt; &gt;
+<b>class</b> <a href=
+"gp_hash_table.html">gp_hash_table</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 href=
+    "#policy_interaction">Policy Interaction</a>.</p>
+
+    <h2><a name="hash_policies" id="hash_policies">Hash
+    Policies</a></h2>
+
+    <h3><a name="general_terms" id="general_terms">General
+    Terms</a></h3>
+
+    <p>Following is an explanation of some functions which hashing
+    involves. Figure <a href=
+    "#hash_ranged_hash_range_hashing_fns">Hash functions,
+    ranged-hash functions, and range-hashing functions</a>)
+    illustrates the discussion.</p>
+
+    <h6 class="c1"><a name="hash_ranged_hash_range_hashing_fns" id=
+    "hash_ranged_hash_range_hashing_fns"><img src=
+    "hash_ranged_hash_range_hashing_fns.png" alt=
+    "no image" /></a></h6>
+
+    <h6 class="c1">Hash functions, 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 class="c2">g : Z<sub>+</sub> &times; Z<sub>+</sub> &rarr;
+    Z<sub>+</sub>,</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="ranged_hash_composed_of_hash_and_range_hashing"
+    id="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 positions</i> within a table,
+    <i>e.g.</i>, in a probing table. 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 achieved 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" id=
+    "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="division_method" id="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="division_method_prime_mod" id=
+    "division_method_prime_mod">g(r, m) = r % m</a></i> (3) ,</p>
+
+    <p>and</p>
+
+    <p><i><a name="division_method_bit_mask" id=
+    "division_method_bit_mask">g(r, m) = r &amp; m - 1, (m =
+    2<sup>k</sup>)</a></i> for some <i>k)</i> (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 bit-wise 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" id=
+    "hash_policies_ranged_hash_policies">Ranged-Hash
+    Functions</a></h3>
+
+    <p>In 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 class="c2">s = [ s<sub>0</sub>,..., s<sub>t - 1</sub>]</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="total_string_dna_hash" id=
+    "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="only_k_string_dna_hash" id=
+    "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</i><sup>r<sub>0</sub> + k - 1</sup> s<sub>i</sub>
+    a<sup>i</sup> 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</i> a<sup>r<sub>i</sub></sup> mod
+    <i>m</i> ,</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>
+
+    <p>It should be noted that the above functions cannot be
+    decomposed as <a href=
+    "#ranged_hash_composed_of_hash_and_range_hashing">(1)</a> .</p>
+
+    <h3><a name="pb_ds_imp" id="pb_ds_imp">Implementation</a></h3>
+
+    <p>This sub-subsection describes the implementation of the
+    above in <tt>pb_ds</tt>. It first explains range-hashing
+    functions in collision-chaining tables, then ranged-hash
+    functions in collision-chaining tables, then probing-based
+    tables, and, finally, lists the relevant classes in
+    <tt>pb_ds</tt>.</p>
+
+    <h4>Range-Hashing and Ranged-Hashes in Collision-Chaining
+    Tables</h4>
+
+    <p><a href=
+    "cc_hash_table.html"><tt>cc_hash_table</tt></a> is
+    parametrized by <tt>Hash_Fn</tt> and <tt>Comb_Hash_Fn</tt>, a
+    hash functor and a combining hash functor, respectively.</p>
+
+    <p>In general, <tt>Comb_Hash_Fn</tt> is considered a
+    range-hashing functor. <a href=
+    "cc_hash_table.html"><tt>cc_hash_table</tt></a>
+    synthesizes a ranged-hash function from <tt>Hash_Fn</tt> and
+    <tt>Comb_Hash_Fn</tt> (see <a href=
+    "#ranged_hash_composed_of_hash_and_range_hashing">(1)</a>
+    above). Figure <a href="#hash_range_hashing_seq_diagram">Insert
+    hash sequence diagram</a> shows an <tt>insert</tt> sequence
+    diagram for this case. 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 class="c1"><a name="hash_range_hashing_seq_diagram" id=
+    "hash_range_hashing_seq_diagram"><img src=
+    "hash_range_hashing_seq_diagram.png" alt="no image" /></a></h6>
+
+    <h6 class="c1">Insert hash sequence diagram.</h6>
+
+    <p>If <a href=
+    "cc_hash_table.html"><tt>cc_hash_table</tt></a>'s
+    hash-functor, <tt>Hash_Fn</tt> is instantiated by <a href=
+    "null_hash_fn.html"><tt>null_hash_fn</tt></a> (see <a href=
+    "concepts.html#concepts_null_policies">Interface::Concepts::Null
+    Policy Classes</a>), then <tt>Comb_Hash_Fn</tt> is taken to be
+    a ranged-hash function. Figure <a href=
+    "#hash_range_hashing_seq_diagram2">Insert hash sequence diagram
+    with a null hash 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 class="c1"><a name="hash_range_hashing_seq_diagram2" id=
+    "hash_range_hashing_seq_diagram2"><img src=
+    "hash_range_hashing_seq_diagram2.png" alt=
+    "no image" /></a></h6>
+
+    <h6 class="c1">Insert hash sequence diagram with a null hash
+    policy.</h6>
+
+    <h4>Probing Tables</h4>
+
+    <p><a href=
+    "gp_hash_table.html"></a><tt>gp_hash_table</tt> is
+    parametrized 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>
+
+    <h4>Pre-Defined Policies</h4>
+
+    <p><tt>pb_ds</tt> contains some pre-defined classes
+    implementing range-hashing and probing functions:</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
+      a linear probe and a quadratic probe function,
+      respectively.</li>
+    </ol>Figure <a href="#hash_policy_cd">Hash policy class
+    diagram</a> shows a class diagram.
+
+    <h6 class="c1"><a name="hash_policy_cd" id=
+    "hash_policy_cd"><img src="hash_policy_cd.png" alt=
+    "no image" /></a></h6>
+
+    <h6 class="c1">Hash policy class diagram.</h6>
+
+    <h2><a name="resize_policies" id="resize_policies">Resize
+    Policies</a></h2>
+
+    <h3><a name="general" id="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. Usually, resize
+    policies can be decomposed into 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" id="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 <a href=
+    "#hash_policies">Range-Hashing Policies</a>), 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 <a href="#hash_policies">Range-Hashing
+    Policies</a>), 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" id="trigger_policies">Trigger
+    Policies</a></h3>
+
+    <p>Trigger policies determine when a hash table changes size.
+    Following is a description of two policies: <i>load-check</i>
+    policies, and 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="load_factor_min_max" id=
+    "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 longest
+    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 class="c1"><a name="balls_and_bins" id=
+    "balls_and_bins"><img src="balls_and_bins.png" alt=
+    "no image" /></a></h6>
+
+    <h6 class="c1">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="prob_of_p1" id=
+    "prob_of_p1"><i>p<sub>1</sub></i></a> = (3)</p>
+
+    <p class="c2"><b>P</b>(l<sub>1</sub> &ge; k) =</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>
+
+    <p><a name="at_least_k_i_n_some_bin" id=
+    "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 class="c2"><b>P</b> ( &sum; <sub>i = 1</sub><sup>m</sup>
+    <b>I</b>(l<sub>i</sub> &ge; k) &ge; 1 ) =</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 class="c2">e ^ ( ( - m p<sub>1</sub> ( 1 / (m p<sub>1</sub>)
+    - 1 ) <sup>2</sup> ) / 2 ) ,</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_ds" id="imp_pb_ds">Implementation</a></h3>
+
+    <p>This sub-subsection describes the implementation of the
+    above in <tt>pb_ds</tt>. It first describes resize policies and
+    their decomposition into trigger and size policies, then
+    describes pre-defined classes, and finally discusses controlled
+    access the policies' internals.</p>
+
+    <h4>Resize Policies and Their Decomposition</h4>
+
+    <p>Each hash-based container is parametrized by a
+    <tt>Resize_Policy</tt> parameter; the container derives
+    <tt><b>public</b></tt>ly from <tt>Resize_Policy</tt>. For
+    example:</p>
+    <pre>
+<a href="cc_hash_table.html">cc_hash_table</a>&lt;
+    <b>typename</b> Key,
+    <b>typename</b> Mapped,
+    ...
+    <b>typename</b> Resize_Policy
+    ...&gt; :
+        <b>public</b> Resize_Policy
+</pre>
+
+    <p>As a container object is modified, it continuously notifies
+    its <tt>Resize_Policy</tt> base of internal changes
+    (<i>e.g.</i>, collisions encountered and elements being
+    inserted). It queries its <tt>Resize_Policy</tt> base whether
+    it needs to be resized, and if so, to what size.</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 class="c1"><a name="insert_resize_sequence_diagram1" id=
+    "insert_resize_sequence_diagram1"><img src=
+    "insert_resize_sequence_diagram1.png" alt=
+    "no image" /></a></h6>
+
+    <h6 class="c1">Insert resize sequence diagram.</h6>
+
+    <p>In practice, a resize policy can be usually orthogonally
+    decomposed to a size policy and a trigger policy. Consequently,
+    the library contains a single class for instantiating a resize
+    policy: <a href=
+    "hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>
+    is parametrized by <tt>Size_Policy</tt> and
+    <tt>Trigger_Policy</tt>, derives <tt><b>public</b></tt>ly from
+    both, and acts as a standard delegate [<a href=
+    "references.html#gamma95designpatterns">gamma95designpatterns</a>]
+    to these policies.</p>
+
+    <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 class="c1"><a name="insert_resize_sequence_diagram2" id=
+    "insert_resize_sequence_diagram2"><img src=
+    "insert_resize_sequence_diagram2.png" alt=
+    "no image" /></a></h6>
+
+    <h6 class="c1">Standard resize policy trigger sequence
+    diagram.</h6>
+
+    <h6 class="c1"><a name="insert_resize_sequence_diagram3" id=
+    "insert_resize_sequence_diagram3"><img src=
+    "insert_resize_sequence_diagram3.png" alt=
+    "no image" /></a></h6>
+
+    <h6 class="c1">Standard resize policy size sequence
+    diagram.</h6>
+
+    <h4>Pre-Defined Policies</h4>
+
+    <p>The library includes the following
+    instantiations of size and trigger policies:</p>
+
+    <ol>
+      <li><a href=
+      "hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>
+      implements a load check trigger policy.</li>
+
+      <li><a href=
+      "cc_hash_max_collision_check_resize_trigger.html"><tt>cc_hash_max_collision_check_resize_trigger</tt></a>
+      implements a collision check trigger policy.</li>
+
+      <li><a href=
+      "hash_exponential_size_policy.html"><tt>hash_exponential_size_policy</tt></a>
+      implements an exponential-size policy (which should be used
+      with mask range hashing).</li>
+
+      <li><a href=
+      "hash_prime_size_policy.html"><tt>hash_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>Figure <a href="#resize_policy_cd">Resize policy class
+    diagram</a> gives an overall picture of the resize-related
+    classes. <a href=
+    "basic_hash_table.html"><tt>basic_hash_table</tt></a>
+    is parametrized by <tt>Resize_Policy</tt>, which it subclasses
+    publicly. This class is currently instantiated only by <a href=
+    "hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>.
+    <a href=
+    "hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>
+    itself is parametrized by <tt>Trigger_Policy</tt> and
+    <tt>Size_Policy</tt>. Currently, <tt>Trigger_Policy</tt> is
+    instantiated by <a href=
+    "hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>,
+    or <a href=
+    "cc_hash_max_collision_check_resize_trigger.html"><tt>cc_hash_max_collision_check_resize_trigger</tt></a>;
+    <tt>Size_Policy</tt> is instantiated by <a href=
+    "hash_exponential_size_policy.html"><tt>hash_exponential_size_policy</tt></a>,
+    or <a href=
+    "hash_prime_size_policy.html"><tt>hash_prime_size_policy</tt></a>.</p>
+
+    <h6 class="c1"><a name="resize_policy_cd" id=
+    "resize_policy_cd"><img src="resize_policy_cd.png" alt=
+    "no image" /></a></h6>
+
+    <h6 class="c1">Resize policy class diagram.</h6>
+
+    <h4>Controlled Access to Policies' Internals</h4>
+
+    <p>There are cases where (controlled) access to resize
+    policies' internals is beneficial. <i>E.g.</i>, it is sometimes
+    useful to query a hash-table for the table's actual size (as
+    opposed to its <tt>size()</tt> - the number of values it
+    currently holds); it is sometimes useful to set a table's
+    initial size, externally resize it, or change load factors.</p>
+
+    <p>Clearly, supporting such methods both decreases the
+    encapsulation of hash-based containers, and increases the
+    diversity between different associative-containers' interfaces.
+    Conversely, omitting such methods can decrease containers'
+    flexibility.</p>
+
+    <p>In order to avoid, to the extent possible, the above
+    conflict, the hash-based containers themselves do not address
+    any of these questions; this is deferred to the resize policies,
+    which are easier to change or replace. Thus, for example,
+    neither <a href=
+    "cc_hash_table.html"><tt>cc_hash_table</tt></a> nor
+    <a href=
+    "gp_hash_table.html"><tt>gp_hash_table</tt></a>
+    contain methods for querying the actual size of the table; this
+    is deferred to <a href=
+    "hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>.</p>
+
+    <p>Furthermore, the policies themselves are parametrized by
+    template arguments that determine the methods they support
+    ([<a href=
+    "references.html#alexandrescu01modern">alexandrescu01modern</a>]
+    shows techniques for doing so). <a href=
+    "hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>
+    is parametrized by <tt>External_Size_Access</tt> that
+    determines whether it supports methods for querying the actual
+    size of the table or resizing it. <a href=
+    "hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>
+    is parametrized by <tt>External_Load_Access</tt> that
+    determines whether it supports methods for querying or
+    modifying the loads. <a href=
+    "cc_hash_max_collision_check_resize_trigger.html"><tt>cc_hash_max_collision_check_resize_trigger</tt></a>
+    is parametrized by <tt>External_Load_Access</tt> that
+    determines whether it supports methods for querying the
+    load.</p>
+
+    <p>Some operations, for example, resizing a container at
+    run time, or changing the load factors of a load-check trigger
+    policy, require the container itself to resize. As mentioned
+    above, the hash-based containers themselves do not contain
+    these types of methods, only their resize policies.
+    Consequently, there must be some mechanism for a resize policy
+    to manipulate the hash-based container. As the hash-based
+    container is a subclass of the resize policy, this is done
+    through virtual methods. Each hash-based container has a
+    <tt><b>private</b></tt> <tt><b>virtual</b></tt> method:</p>
+    <pre>
+<b>virtual void</b>
+    do_resize
+    (size_type new_size);
+</pre>
+
+    <p>which resizes the container. Implementations of
+    <tt>Resize_Policy</tt> can export public methods for resizing
+    the container externally; these methods internally call
+    <tt>do_resize</tt> to resize the table.</p>
+
+    <h2><a name="policy_interaction" id="policy_interaction">Policy
+    Interaction</a></h2>
+
+    <p>Hash-tables are unfortunately especially susceptible to
+    choice of policies. One of the more complicated aspects of this
+    is that poor combinations of good policies can form a poor
+    container. Following are some considerations.</p>
+
+    <h3><a name="policy_interaction_probe_size_trigger" id=
+    "policy_interaction_probe_size_trigger">Probe Policies, Size
+    Policies, and Trigger Policies</a></h3>
+
+    <p>Some combinations do not work well for probing containers.
+    For example, combining a quadratic probe policy with an
+    exponential size policy can yield a poor container: when an
+    element is inserted, a trigger policy might decide that there
+    is no need to resize, as the table still contains unused
+    entries; the probe sequence, however, might never reach any of
+    the unused entries.</p>
+
+    <p>Unfortunately, <tt>pb_ds</tt> cannot detect such problems at
+    compilation (they are halting reducible). It therefore defines
+    an exception class <a href=
+    "insert_error.html"><tt>insert_error</tt></a> to throw an
+    exception in this case.</p>
+
+    <h3><a name="policy_interaction_hash_trigger" id=
+    "policy_interaction_hash_trigger">Hash Policies and Trigger
+    Policies</a></h3>
+
+    <p>Some trigger policies are especially susceptible to poor
+    hash functions. Suppose, as an extreme case, that the hash
+    function transforms each key to the same hash value. After some
+    inserts, a collision detecting policy will always indicate that
+    the container needs to grow.</p>
+
+    <p>The library, therefore, by design, limits each operation to
+    one resize. For each <tt>insert</tt>, for example, it queries
+    only once whether a resize is needed.</p>
+
+    <h3><a name="policy_interaction_eq_sth_hash" id=
+    "policy_interaction_eq_sth_hash">Equivalence Functors, Storing
+    Hash Values, and Hash Functions</a></h3>
+
+    <p><a href=
+    "cc_hash_table.html"><tt>cc_hash_table</tt></a> and
+    <a href=
+    "gp_hash_table.html"><tt>gp_hash_table</tt></a> are
+    parametrized by an equivalence 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_ds</tt>'s container will
+    fail at compilation, by design, if this is attempted.</p>
+
+    <h3><a name="policy_interaction_size_load_check" id=
+    "policy_interaction_size_load_check">Size Policies and
+    Load-Check Trigger Policies</a></h3>
+
+    <p>Assume a size policy issues an increasing sequence of sizes
+    <i>a, a q, a q<sup>1</sup>, a q<sup>2</sup>, ...</i> For
+    example, an exponential size policy might issue the sequence of
+    sizes <i>8, 16, 32, 64, ...</i></p>
+
+    <p>If a load-check trigger policy is used, with loads
+    <i>&alpha;<sub>min</sub></i> and <i>&alpha;<sub>max</sub></i>,
+    respectively, then it is a good idea to have:</p>
+
+    <ol>
+      <li><i>&alpha;<sub>max</sub> ~ 1 / q</i></li>
+
+      <li><i>&alpha;<sub>min</sub> &lt; 1 / (2 q)</i></li>
+    </ol>
+
+    <p>This will ensure that the amortized hash cost of each
+    modifying operation is at most approximately 3.</p>
+
+    <p><i>&alpha;<sub>min</sub> ~ &alpha;<sub>max</sub></i> is, in
+    any case, a bad choice, and <i>&alpha;<sub>min</sub> &gt;
+    &alpha;<sub>max</sub></i> is horrendous.</p>
+  </div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/hash_exponential_size_policy.html b/libstdc++-v3/docs/html/ext/pb_ds/hash_exponential_size_policy.html
new file mode 100644
index 00000000000..059fa48d7f5
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/hash_exponential_size_policy.html
@@ -0,0 +1,183 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+  <meta name="generator" content=
+  "HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+
+  <title>hash_exponential_size_policy Interface</title>
+  <meta http-equiv="Content-Type" content=
+  "text/html; charset=us-ascii" />
+  </head>
+
+<body>
+  <div id="page">
+    <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>
+
+    <p>Defined in: <a href=
+    "../../../../include/ext/pb_ds/hash_policy.hpp"><tt>hash_policy.hpp</tt></a></p>
+
+    <h2><a name="link1" id="link1">Template Parameters</a></h2>
+
+    <table class="c1" width="100%" border="1" summary=
+    "Template Parameters">
+      <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_Type42920436" id=
+"Size_Type42920436"><b>typename</b> Size_Type </a>
+</pre>
+        </td>
+
+        <td>
+          <p>Size type.</p>
+        </td>
+
+        <td>size_t</td>
+      </tr>
+    </table>
+
+    <h2><a name="link2" id="link2">Public Types and
+    Constants</a></h2>
+
+    <h3><a name="link3" id="link3">General Definitions</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Types">
+      <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_type55424436" id="size_type55424436">size_type</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<a href="#Size_Type42920436"><tt>Size_Type</tt></a>
+</pre>
+        </td>
+
+        <td>
+          <p>Size type.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h2><a name="link4" id="link4">Public Methods</a></h2>
+
+    <h3><a name="link5" id="link5">Constructors, Destructor, and
+    Related</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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_type55424436"><tt>size_type</tt></a> start_size = 8, 
+    <a href=
+"#size_type55424436"><tt>size_type</tt></a> grow_factor = 2)
+</pre>
+        </td>
+
+        <td>
+          <p>Default constructor, or constructor taking a
+          <span class="c1"><tt>start_size</tt></span>, or
+          constructor taking a start size and <span class=
+          "c1"><tt>grow_factor</tt></span>. The policy will use the
+          sequence of sizes <span class=
+          "c1"><tt>start_size</tt></span>, <span class=
+          "c1"><tt>start_size</tt></span> * <span class=
+          "c1"><tt>grow_factor</tt></span>, <span class=
+          "c1"><tt>start_size</tt></span> * <span class=
+          "c1"><tt>grow_factor</tt></span>^2, ...</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<b>void</b> 
+  swap
+  (<span class=
+"c2"><tt>hash_exponential_size_policy</tt></span> &amp;other)
+</pre>
+        </td>
+
+        <td>
+          <p>Swaps content.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h2><a name="link6" id="link6">Protected Methods</a></h2>
+
+    <h3><a name="link7" id="link7">Size methods</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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_type55424436"><tt>size_type</tt></a>
+  get_nearest_larger_size
+  (<a href=
+"#size_type55424436"><tt>size_type</tt></a> size) <b>const</b>
+</pre>
+        </td>
+
+        <td>
+          <p>Given a size <span class="c1"><tt>size</tt></span>,
+          returns a size that is larger.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a href="#size_type55424436"><tt>size_type</tt></a>
+  get_nearest_smaller_size
+  (<a href=
+"#size_type55424436"><tt>size_type</tt></a> size) <b>const</b>
+</pre>
+        </td>
+
+        <td>
+          <p>Given a size <span class="c1"><tt>size</tt></span>,
+          returns a size that is smaller.</p>
+        </td>
+      </tr>
+    </table>
+  </div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/hash_load_check_resize_trigger.html b/libstdc++-v3/docs/html/ext/pb_ds/hash_load_check_resize_trigger.html
new file mode 100644
index 00000000000..0013e0127c0
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/hash_load_check_resize_trigger.html
@@ -0,0 +1,583 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+  <meta name="generator" content=
+  "HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+
+  <title>hash_load_check_resize_trigger Interface</title>
+  <meta http-equiv="Content-Type" content=
+  "text/html; charset=us-ascii" />
+  </head>
+
+<body>
+  <div id="page">
+    <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>
+
+    <p>Defined in: <a href=
+    "../../../../include/ext/pb_ds/hash_policy.hpp"><tt>hash_policy.hpp</tt></a></p>
+
+    <h2><a name="link1" id="link1">Template Parameters</a></h2>
+
+    <table class="c1" width="100%" border="1" summary=
+    "Template Parameters">
+      <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_Access1313998607" id=
+"External_Load_Access1313998607"><b>bool</b> External_Load_Access </a>
+</pre>
+        </td>
+
+        <td>
+          <p>Specifies whether the load factor can be accessed
+          externally. The two options have different trade-offs in
+          terms of flexibility, genericity, and encapsulation.</p>
+        </td>
+
+        <td><tt><b>false</b></tt></td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="Size_Type42920436" id=
+"Size_Type42920436"><b>typename</b> Size_Type </a>
+</pre>
+        </td>
+
+        <td>
+          <p>Size type.</p>
+        </td>
+
+        <td>size_t</td>
+      </tr>
+    </table>
+
+    <h2><a name="link2" id="link2">Public Types and
+    Constants</a></h2>
+
+    <h3><a name="link3" id="link3">General Definitions</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Types">
+      <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_type55424436" id="size_type55424436">size_type</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<a href="#Size_Type42920436"><tt>Size_Type</tt></a>
+</pre>
+        </td>
+
+        <td>
+          <p>Size type.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="external_load_access3976598639" id=
+"external_load_access3976598639">external_load_access</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<a href=
+"#External_Load_Access1313998607"><tt>External_Load_Access</tt></a>
+</pre>
+        </td>
+
+        <td>
+          <p>Indicates whether loads can be accessed externally</p>
+        </td>
+      </tr>
+    </table>
+
+    <h2><a name="link4" id="link4">Public Methods</a></h2>
+
+    <h3><a name="link5" id="link5">Constructors, Destructor, and
+    Related</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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
+          <span class="c1"><tt>load_min</tt></span> and
+          <span class="c1"><tt>load_max</tt></span> load factors
+          between which this policy will keep the actual load.</p>
+
+          <p>It is the responsibility of the user to ensure that
+          <span class="c1"><tt>load_min</tt></span> is smaller than
+          <span class="c1"><tt>load_max</tt></span>.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<b>void</b>
+  swap
+  (<span class=
+"c2"><tt>hash_load_check_resize_trigger</tt></span> &amp;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>
+
+    <h3><a name="link6" id="link6">Load Access Methods</a></h3>
+
+    <p>These methods are only available if the external access
+    parameter is set.</p>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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_Access1313998607"><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_Access1313998607"><tt>External_Load_Access</tt></a>
+          == <tt><b>false</b></tt>.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h2><a name="link7" id="link7">Protected Methods</a></h2>
+
+    <h3><a name="link8" id="link8">Insert Search
+    Notifications.</a></h3>
+
+    <p>Notifications called during an insert operation.</p>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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>
+
+    <h3><a name="link9" id="link9">Find Search
+    Notifications.</a></h3>
+
+    <p>Notifications called during a find operation.</p>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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>
+
+    <h3><a name="link10" id="link10">Erase Search
+    Notifications.</a></h3>
+
+    <p>Notifications called during an insert operation.</p>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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>
+
+    <h3><a name="link11" id="link11">Content Change
+    Notifications.</a></h3>
+
+    <p>Notifications called when the content of the table changes
+    in a way that can affect the resize policy.</p>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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_type55424436"><tt>size_type</tt></a> num_entries)
+</pre>
+        </td>
+
+        <td>
+          <p>Notifies an element was inserted. the total number of
+          entries in the table is <span class=
+          "c1"><tt>num_entries</tt></span>.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<b>inline</b> <b>void</b>
+  notify_erased
+  (<a href="#size_type55424436"><tt>size_type</tt></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>
+
+    <h3><a name="link12" id="link12">Size Change
+    Notifications.</a></h3>
+
+    <p>Notifications called when the table changes size.</p>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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_type55424436"><tt>size_type</tt></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_type55424436"><tt>size_type</tt></a> new_size)
+</pre>
+        </td>
+
+        <td>
+          <p>Notifies the table was resized externally.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h3><a name="link13" id="link13">Queries</a></h3>
+
+    <p>Called to query whether/how to resize.</p>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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_type55424436"><tt>size_type</tt></a> size, 
+    <a href=
+"#size_type55424436"><tt>size_type</tt></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 <span class=
+          "c1"><tt>size</tt></span> of the table is <span class=
+          "c1"><tt>size</tt></span>, and the number of entries in
+          it is <span class="c1"><tt>num_entries</tt></span>.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h2><a name="link14" id="link14">Private Methods</a></h2>
+
+    <h3><a name="link15" id="link15">Overrides</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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
+  (<a href="#size_type55424436"><tt>size_type</tt></a> new_size)
+</pre>
+        </td>
+
+        <td>
+          <p>Resizes to <span class=
+          "c1"><tt>new_size</tt></span>.</p>
+        </td>
+      </tr>
+    </table>
+  </div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/hash_policy_cd.png b/libstdc++-v3/docs/html/ext/pb_ds/hash_policy_cd.png
new file mode 100644
index 00000000000..f3122a112fc
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/hash_policy_cd.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/hash_prime_size_policy.html b/libstdc++-v3/docs/html/ext/pb_ds/hash_prime_size_policy.html
new file mode 100644
index 00000000000..cf67dabe078
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/hash_prime_size_policy.html
@@ -0,0 +1,149 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+  <meta name="generator" content=
+  "HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+
+  <title>hash_prime_size_policy Interface</title>
+  <meta http-equiv="Content-Type" content=
+  "text/html; charset=us-ascii" />
+  </head>
+
+<body>
+  <div id="page">
+    <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>
+
+    <p>Defined in: <a href=
+    "../../../../include/ext/pb_ds/hash_policy.hpp"><tt>hash_policy.hpp</tt></a></p>
+
+    <h2><a name="link1" id="link1">Public Types and
+    Constants</a></h2>
+
+    <h3><a name="link2" id="link2">General Definitions</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Types">
+      <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_type55424436" id="size_type55424436">size_type</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+size_t
+</pre>
+        </td>
+
+        <td>
+          <p>Size type.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h2><a name="link3" id="link3">Public Methods</a></h2>
+
+    <h3><a name="link4" id="link4">Constructors, Destructor, and
+    Related</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <tr>
+        <td width="45%" align="left"><b>Method</b></td>
+
+        <td width="55%" align="left"><b>Description</b></td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+  hash_prime_size_policy
+  (<a href=
+"#size_type55424436"><tt>size_type</tt></a> start_size = 8)
+</pre>
+        </td>
+
+        <td>
+          <p>Default constructor, or constructor taking a
+          <span class="c1"><tt>start_size</tt></span> The policy
+          will use the sequence of sizes approximately <span class=
+          "c1"><tt>start_size</tt></span>, <span class=
+          "c1"><tt>start_size</tt></span> * 2, <span class=
+          "c1"><tt>start_size</tt></span> * 2^2, ...</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<b>inline</b> <b>void</b>
+  swap
+  (<span class=
+"c2"><tt>hash_prime_size_policy</tt></span> &amp;other)
+</pre>
+        </td>
+
+        <td>
+          <p>Swaps content.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h2><a name="link5" id="link5">Protected Methods</a></h2>
+
+    <h3><a name="link6" id="link6">Size methods</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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_type55424436"><tt>size_type</tt></a>
+  get_nearest_larger_size
+  (<a href=
+"#size_type55424436"><tt>size_type</tt></a> size) <b>const</b>
+</pre>
+        </td>
+
+        <td>
+          <p>Given a size <span class="c1"><tt>size</tt></span>,
+          returns a size that is larger.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a href="#size_type55424436"><tt>size_type</tt></a>
+  get_nearest_smaller_size
+  (<a href=
+"#size_type55424436"><tt>size_type</tt></a> size) <b>const</b>
+</pre>
+        </td>
+
+        <td>
+          <p>Given a size <span class="c1"><tt>size</tt></span>,
+          returns a size that is smaller.</p>
+        </td>
+      </tr>
+    </table>
+  </div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/hash_random_int_erase_mem_usage_test.html b/libstdc++-v3/docs/html/ext/pb_ds/hash_random_int_erase_mem_usage_test.html
new file mode 100644
index 00000000000..073c84c2bba
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/hash_random_int_erase_mem_usage_test.html
@@ -0,0 +1,173 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+<meta name="generator" content="HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+<title>Tree Text Locality of Reference Timing Test</title>
+<meta http-equiv="Content-Type" content="text/html; charset=us-ascii" />
+</head>
+<body>
+<div id="page">
+<h1>Hash-Based Erase Memory-Use Test</h1>
+<h2><a name="description" id="description">Description</a></h2>
+<p>This test inserts a number of uniform i.i.d. integer keys
+    into a container, then erases all keys except one. It measures
+    the final size of the container.</p>
+<p>(The test was executed with <a href="../../../../testsuite/performance/ext/pb_ds/hash_random_int_erase_mem_usage.cc"><tt>hash_random_int_erase_mem_usage.cc</tt></a>
+    2000 2000 2100)</p>
+<h2><a name="purpose" id="purpose">Purpose</a></h2>
+<p>The test checks how containers adjust internally as their
+    logical size decreases (see <a href="motivation.html#assoc_ers_methods">Motivation::Associative
+    Containers::Slightly Different Methods::Methods Related to
+    Erase</a>).</p>
+<h2><a name="results" id="results">Results</a></h2>
+<p>Figures <a href="#NHG">NHG</a>, <a href="#NHM">NHM</a> and
+    <a href="#NHL">NHL</a> show the results for the native and
+    collision-chaining types in <a href="assoc_performance_tests.html#gcc"><u>g++</u></a>, <a href="assoc_performance_tests.html#msvc"><u>msvc++</u></a> and
+    <a href="assoc_performance_tests.html#local"><u>local</u></a>,
+    respectively.</p>
+<div id="NHG_res_div">
+<div id="NHG_gcc">
+<div id="NHG_hash_random_int_erase_mem_usage_test">
+<div id="NHG_assoc">
+<div id="NHG_Native_456_collision-chaing_456_and_probing_456_hash_random_int_erase_test"><div style="border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NHG" id="NHG"><img src="hash_random_int_erase_mem_usage_test_gcc.png" alt="no image" /></a></h6>NHG: Native, collision-chaing, and probing, hash random int erase test - <a href="assoc_performance_tests.html#gcc">g++</a><p>In the above figure, the names in the legends have the following meaning:</p>
+<ol>
+<li>
+n_hash_set_ncah-
+<tt>std::tr1::unordered_set</tt> with <tt>cache_hash_code</tt> = <tt><b>false</b></tt></li>
+<li>
+gp_hash_mask_linp_exp_nea_lc_1div8_1div2_nsth_set-
+<a href="gp_hash_table.html"><tt>gp_hash_table</tt></a>
+ with <tt>Comb_Hash_Fn</tt> = <a href="direct_mask_range_hashing.html"><tt>direct_mask_range_hashing</tt></a>
+, <tt>Resize_Policy</tt> = <a href="hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>
+ with <tt>Size_Policy</tt> = <a href="hash_exponential_size_policy.html"><tt>hash_exponential_size_policy</tt></a>
+, and <tt>Trigger_Policy</tt> = <a href="hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>
+ with <i>&alpha;<sub>min</sub></i> = <i>1/8</i> and <i>&alpha;<sub>max</sub></i> = <i>1/2</i>, and <tt>Probe_Fn</tt> = <a href="linear_probe_fn.html"><tt>linear_probe_fn</tt></a>
+</li>
+<li>
+cc_hash_mod_prime_nea_lc_1div8_1div1_nsth_set-
+<a href="cc_hash_table.html"><tt>cc_hash_table</tt></a>
+with <tt>Comb_Hash_Fn</tt> = <a href="direct_mod_range_hashing.html"><tt>direct_mod_range_hashing</tt></a>
+, and <tt>Resize_Policy</tt> = <a href="hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>
+ with <tt>Size_Policy</tt> = <a href="hash_prime_size_policy.html"><tt>hash_prime_size_policy</tt></a>
+, and <tt>Trigger_Policy</tt> = <a href="hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>
+ with <i>&alpha;<sub>min</sub></i> = <i>1/8</i> and <i>&alpha;<sub>max</sub></i> = <i>1/1</i></li>
+<li>
+cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_set-
+<a href="cc_hash_table.html"><tt>cc_hash_table</tt></a>
+with <tt>Comb_Hash_Fn</tt> = <a href="direct_mask_range_hashing.html"><tt>direct_mask_range_hashing</tt></a>
+, and <tt>Resize_Policy</tt> = <a href="hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>
+ with <tt>Size_Policy</tt> = <a href="hash_exponential_size_policy.html"><tt>hash_exponential_size_policy</tt></a>
+, and <tt>Trigger_Policy</tt> = <a href="hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>
+ with <i>&alpha;<sub>min</sub></i> = <i>1/8</i> and <i>&alpha;<sub>max</sub></i> = <i>1/2</i></li>
+</ol>
+</div><div style="width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<div id="NHM_res_div">
+<div id="NHM_msvc">
+<div id="NHM_hash_random_int_erase_mem_usage_test">
+<div id="NHM_assoc">
+<div id="NHM_Native_456_collision-chaing_456_and_probing_456_hash_random_int_erase_test"><div style="border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NHM" id="NHM"><img src="hash_random_int_erase_mem_usage_test_msvc.png" alt="no image" /></a></h6>NHM: Native, collision-chaing, and probing, hash random int erase test - <a href="assoc_performance_tests.html#msvc">msvc++</a><p>In the above figure, the names in the legends have the following meaning:</p>
+<ol>
+<li>
+n_hash_set_ncah-
+<tt>stdext::hash_set</tt></li>
+<li>
+gp_hash_mask_linp_exp_nea_lc_1div8_1div2_nsth_set-
+<a href="gp_hash_table.html"><tt>gp_hash_table</tt></a>
+ with <tt>Comb_Hash_Fn</tt> = <a href="direct_mask_range_hashing.html"><tt>direct_mask_range_hashing</tt></a>
+, <tt>Resize_Policy</tt> = <a href="hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>
+ with <tt>Size_Policy</tt> = <a href="hash_exponential_size_policy.html"><tt>hash_exponential_size_policy</tt></a>
+, and <tt>Trigger_Policy</tt> = <a href="hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>
+ with <i>&alpha;<sub>min</sub></i> = <i>1/8</i> and <i>&alpha;<sub>max</sub></i> = <i>1/2</i>, and <tt>Probe_Fn</tt> = <a href="linear_probe_fn.html"><tt>linear_probe_fn</tt></a>
+</li>
+<li>
+cc_hash_mod_prime_nea_lc_1div8_1div1_nsth_set-
+<a href="cc_hash_table.html"><tt>cc_hash_table</tt></a>
+with <tt>Comb_Hash_Fn</tt> = <a href="direct_mod_range_hashing.html"><tt>direct_mod_range_hashing</tt></a>
+, and <tt>Resize_Policy</tt> = <a href="hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>
+ with <tt>Size_Policy</tt> = <a href="hash_prime_size_policy.html"><tt>hash_prime_size_policy</tt></a>
+, and <tt>Trigger_Policy</tt> = <a href="hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>
+ with <i>&alpha;<sub>min</sub></i> = <i>1/8</i> and <i>&alpha;<sub>max</sub></i> = <i>1/1</i></li>
+<li>
+cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_set-
+<a href="cc_hash_table.html"><tt>cc_hash_table</tt></a>
+with <tt>Comb_Hash_Fn</tt> = <a href="direct_mask_range_hashing.html"><tt>direct_mask_range_hashing</tt></a>
+, and <tt>Resize_Policy</tt> = <a href="hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>
+ with <tt>Size_Policy</tt> = <a href="hash_exponential_size_policy.html"><tt>hash_exponential_size_policy</tt></a>
+, and <tt>Trigger_Policy</tt> = <a href="hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>
+ with <i>&alpha;<sub>min</sub></i> = <i>1/8</i> and <i>&alpha;<sub>max</sub></i> = <i>1/2</i></li>
+</ol>
+</div><div style="width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<div id="NHM_res_div">
+<div id="NHM_msvc">
+<div id="NHM_hash_random_int_erase_mem_usage_test">
+<div id="NHM_assoc">
+<div id="NHM_Native_456_collision-chaing_456_and_probing_456_hash_random_int_erase_test"><div style="border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NHM" id="NHM"><img src="hash_random_int_erase_mem_usage_test_msvc.png" alt="no image" /></a></h6>NHM: Native, collision-chaing, and probing, hash random int erase test - <a href="assoc_performance_tests.html#msvc">msvc++</a><p>In the above figure, the names in the legends have the following meaning:</p>
+<ol>
+<li>
+n_hash_set_ncah-
+<tt>stdext::hash_set</tt></li>
+<li>
+gp_hash_mask_linp_exp_nea_lc_1div8_1div2_nsth_set-
+<a href="gp_hash_table.html"><tt>gp_hash_table</tt></a>
+ with <tt>Comb_Hash_Fn</tt> = <a href="direct_mask_range_hashing.html"><tt>direct_mask_range_hashing</tt></a>
+, <tt>Resize_Policy</tt> = <a href="hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>
+ with <tt>Size_Policy</tt> = <a href="hash_exponential_size_policy.html"><tt>hash_exponential_size_policy</tt></a>
+, and <tt>Trigger_Policy</tt> = <a href="hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>
+ with <i>&alpha;<sub>min</sub></i> = <i>1/8</i> and <i>&alpha;<sub>max</sub></i> = <i>1/2</i>, and <tt>Probe_Fn</tt> = <a href="linear_probe_fn.html"><tt>linear_probe_fn</tt></a>
+</li>
+<li>
+cc_hash_mod_prime_nea_lc_1div8_1div1_nsth_set-
+<a href="cc_hash_table.html"><tt>cc_hash_table</tt></a>
+with <tt>Comb_Hash_Fn</tt> = <a href="direct_mod_range_hashing.html"><tt>direct_mod_range_hashing</tt></a>
+, and <tt>Resize_Policy</tt> = <a href="hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>
+ with <tt>Size_Policy</tt> = <a href="hash_prime_size_policy.html"><tt>hash_prime_size_policy</tt></a>
+, and <tt>Trigger_Policy</tt> = <a href="hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>
+ with <i>&alpha;<sub>min</sub></i> = <i>1/8</i> and <i>&alpha;<sub>max</sub></i> = <i>1/1</i></li>
+<li>
+cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_set-
+<a href="cc_hash_table.html"><tt>cc_hash_table</tt></a>
+with <tt>Comb_Hash_Fn</tt> = <a href="direct_mask_range_hashing.html"><tt>direct_mask_range_hashing</tt></a>
+, and <tt>Resize_Policy</tt> = <a href="hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>
+ with <tt>Size_Policy</tt> = <a href="hash_exponential_size_policy.html"><tt>hash_exponential_size_policy</tt></a>
+, and <tt>Trigger_Policy</tt> = <a href="hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>
+ with <i>&alpha;<sub>min</sub></i> = <i>1/8</i> and <i>&alpha;<sub>max</sub></i> = <i>1/2</i></li>
+</ol>
+</div><div style="width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<div id="NHL_res_div">
+<div id="NHL_local">
+<div id="NHL_hash_random_int_erase_mem_usage_test">
+<div id="NHL_assoc">
+<div id="NHL_Native_456_collision-chaing_456_and_probing_456_hash_random_int_erase_test"><div style = "border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NHL" id= "NHL"><img src="hash_random_int_erase_mem_usage_test_local.png" alt="no image" /></a></h6>NHL: Native, collision-chaing, and probing, hash random int erase test - <a href = "assoc_performance_tests.html#local">local</a></div><div style = "width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<h2><a name="observations" id="observations">Observations</a></h2>
+<p>STL hash-based containers act very differently than trees in
+    this respect. When erasing numerous keys from an STL
+    associative-container, the resulting memory user varies greatly
+    depending on whether the container is tree-based or hash-based.
+    As noted in <a href="motivation.html#assoc_methods">Motivation::Choice of
+    Methods</a> , this is a fundamental consequence of the STL's
+    associative containers' interface, it is not due to a specific
+    implementation.</p>
+<p>(See <a href="priority_queue_text_pop_mem_usage_test.html">Priority Queue
+    Text <tt>pop</tt> Memory Use Test</a> for a similar phenomenon
+    regarding priority queues.)</p>
+</div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/hash_random_int_erase_mem_usage_test_gcc.png b/libstdc++-v3/docs/html/ext/pb_ds/hash_random_int_erase_mem_usage_test_gcc.png
new file mode 100644
index 00000000000..c552506a755
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/hash_random_int_erase_mem_usage_test_gcc.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/hash_random_int_erase_mem_usage_test_local.png b/libstdc++-v3/docs/html/ext/pb_ds/hash_random_int_erase_mem_usage_test_local.png
new file mode 100644
index 00000000000..dbd3ee9d3c0
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/hash_random_int_erase_mem_usage_test_local.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/hash_random_int_erase_mem_usage_test_msvc.png b/libstdc++-v3/docs/html/ext/pb_ds/hash_random_int_erase_mem_usage_test_msvc.png
new file mode 100644
index 00000000000..8c23d46da39
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/hash_random_int_erase_mem_usage_test_msvc.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/hash_random_int_find_find_timing_test.html b/libstdc++-v3/docs/html/ext/pb_ds/hash_random_int_find_find_timing_test.html
new file mode 100644
index 00000000000..7e7f2084b08
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/hash_random_int_find_find_timing_test.html
@@ -0,0 +1,247 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+<meta name="generator" content="HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+<title>Hash Random Int Find Timing Test</title>
+<meta http-equiv="Content-Type" content="text/html; charset=us-ascii" />
+</head>
+<body>
+<div id="page">
+<h1>Hash-Based Random-Integer <tt>find</tt> Find Timing
+    Test</h1>
+<h2><a name="description" id="description">Description</a></h2>
+<p>This test inserts a number of values with uniform i.i.d.
+    integer keys into a container, then performs a series of finds
+    using <tt>find</tt>. It measures the average time
+    for<tt>find</tt> as a function of the number of values
+    inserted.</p>
+<p>(The test was executed with <a href="../../../../testsuite/performance/ext/pb_ds/random_int_find_timing.cc"><tt>random_int_find_timing_test</tt></a>
+    200 200 2100)</p>
+<h2><a name="purpose" id="purpose">Purpose</a></h2>
+<p>The test checks the effect of different underlying
+    hash-tables (see <a href="hash_based_containers.html">Design::Associative
+    Containers::Associative Containers::Hash-Based Containers</a>),
+    range-hashing functions, and trigger policies (see <a href="hash_based_containers.html#hash_policies">Design::Associative
+    Containers::Hash-Based Containers::Hash Policies</a> and
+    <a href="hash_based_containers.html#resize_policies">Design::Associative
+    Containers::Hash-Based Containers::Resize Policies</a>).</p>
+<h2><a name="results" id="results">Results</a></h2>
+<p>Figures <a href="#NCCG">NCCG</a>, <a href="#NCCM">NCCM</a>,
+    and <a href="#NCCL">NCCL</a> show the results for the native
+    and collision-chaining types in <a href="assoc_performance_tests.html#gcc"><u>g++</u></a>, <a href="assoc_performance_tests.html#msvc"><u>MSVC++</u></a>, and
+    <a href="assoc_performance_tests.html#local"><u>local</u></a>,
+    respectively; Figures <a href="#NGPG">NGPG</a>, <a href="#NGPM">NGPM</a>, and <a href="#NGPL">NGPL</a> show the results
+    for the native and probing types in <a href="assoc_performance_tests.html#gcc"><u>g++</u></a>, <a href="assoc_performance_tests.html#msvc"><u>MSVC++</u></a>, and
+    <a href="assoc_performance_tests.html#local"><u>local</u></a>
+    respectively.</p>
+<div id="NCCG_res_div">
+<div id="NCCG_gcc">
+<div id="NCCG_cc_hash_random_int_find_timing_test">
+<div id="NCCG_assoc">
+<div id="NCCG_Native_and_collision-chaining_hash_random_int_find_timing_test_using__tt_find_455tt_"><div style="border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NCCG" id="NCCG"><img src="cc_hash_random_int_find_timing_test_gcc.png" alt="no image" /></a></h6>NCCG: Native and collision-chaining hash random int find timing test using <tt>find</tt> - <a href="assoc_performance_tests.html#gcc">g++</a><p>In the above figure, the names in the legends have the following meaning:</p>
+<ol>
+<li>
+n_hash_map_ncah-
+<tt>std::tr1::unordered_map</tt> with <tt>cache_hash_code</tt> = <tt><b>false</b></tt></li>
+<li>
+cc_hash_mod_prime_nea_lc_1div8_1div1_nsth_map-
+<a href="cc_hash_table.html"><tt>cc_hash_table</tt></a>
+with <tt>Comb_Hash_Fn</tt> = <a href="direct_mod_range_hashing.html"><tt>direct_mod_range_hashing</tt></a>
+, and <tt>Resize_Policy</tt> = <a href="hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>
+ with <tt>Size_Policy</tt> = <a href="hash_prime_size_policy.html"><tt>hash_prime_size_policy</tt></a>
+, and <tt>Trigger_Policy</tt> = <a href="hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>
+ with <i>&alpha;<sub>min</sub></i> = <i>1/8</i> and <i>&alpha;<sub>max</sub></i> = <i>1/1</i></li>
+<li>
+cc_hash_mod_prime_nea_lc_1div8_1div2_nsth_map-
+<a href="cc_hash_table.html"><tt>cc_hash_table</tt></a>
+with <tt>Comb_Hash_Fn</tt> = <a href="direct_mod_range_hashing.html"><tt>direct_mod_range_hashing</tt></a>
+, and <tt>Resize_Policy</tt> = <a href="hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>
+ with <tt>Size_Policy</tt> = <a href="hash_prime_size_policy.html"><tt>hash_prime_size_policy</tt></a>
+, and <tt>Trigger_Policy</tt> = <a href="hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>
+ with <i>&alpha;<sub>min</sub></i> = <i>1/8</i> and <i>&alpha;<sub>max</sub></i> = <i>1/2</i></li>
+<li>
+cc_hash_mask_exp_nea_lc_1div8_1div1_nsth_map-
+<a href="cc_hash_table.html"><tt>cc_hash_table</tt></a>
+with <tt>Comb_Hash_Fn</tt> = <a href="direct_mask_range_hashing.html"><tt>direct_mask_range_hashing</tt></a>
+, and <tt>Resize_Policy</tt> = <a href="hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>
+ with <tt>Size_Policy</tt> = <a href="hash_exponential_size_policy.html"><tt>hash_exponential_size_policy</tt></a>
+, and <tt>Trigger_Policy</tt> = <a href="hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>
+ with <i>&alpha;<sub>min</sub></i> = <i>1/8</i> and <i>&alpha;<sub>max</sub></i> = <i>1/1</i></li>
+<li>
+cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_map-
+<a href="cc_hash_table.html"><tt>cc_hash_table</tt></a>
+with <tt>Comb_Hash_Fn</tt> = <a href="direct_mask_range_hashing.html"><tt>direct_mask_range_hashing</tt></a>
+, and <tt>Resize_Policy</tt> = <a href="hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>
+ with <tt>Size_Policy</tt> = <a href="hash_exponential_size_policy.html"><tt>hash_exponential_size_policy</tt></a>
+, and <tt>Trigger_Policy</tt> = <a href="hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>
+ with <i>&alpha;<sub>min</sub></i> = <i>1/8</i> and <i>&alpha;<sub>max</sub></i> = <i>1/2</i></li>
+</ol>
+</div><div style="width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<div id="NCCM_res_div">
+<div id="NCCM_msvc">
+<div id="NCCM_cc_hash_random_int_find_timing_test">
+<div id="NCCM_assoc">
+<div id="NCCM_Native_and_collision-chaining_hash_random_int_find_timing_test_using__tt_find_455tt_"><div style="border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NCCM" id="NCCM"><img src="cc_hash_random_int_find_timing_test_msvc.png" alt="no image" /></a></h6>NCCM: Native and collision-chaining hash random int find timing test using <tt>find</tt> - <a href="assoc_performance_tests.html#msvc">msvc++</a><p>In the above figure, the names in the legends have the following meaning:</p>
+<ol>
+<li>
+cc_hash_mod_prime_nea_lc_1div8_1div1_nsth_map-
+<a href="cc_hash_table.html"><tt>cc_hash_table</tt></a>
+with <tt>Comb_Hash_Fn</tt> = <a href="direct_mod_range_hashing.html"><tt>direct_mod_range_hashing</tt></a>
+, and <tt>Resize_Policy</tt> = <a href="hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>
+ with <tt>Size_Policy</tt> = <a href="hash_prime_size_policy.html"><tt>hash_prime_size_policy</tt></a>
+, and <tt>Trigger_Policy</tt> = <a href="hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>
+ with <i>&alpha;<sub>min</sub></i> = <i>1/8</i> and <i>&alpha;<sub>max</sub></i> = <i>1/1</i></li>
+<li>
+cc_hash_mod_prime_nea_lc_1div8_1div2_nsth_map-
+<a href="cc_hash_table.html"><tt>cc_hash_table</tt></a>
+with <tt>Comb_Hash_Fn</tt> = <a href="direct_mod_range_hashing.html"><tt>direct_mod_range_hashing</tt></a>
+, and <tt>Resize_Policy</tt> = <a href="hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>
+ with <tt>Size_Policy</tt> = <a href="hash_prime_size_policy.html"><tt>hash_prime_size_policy</tt></a>
+, and <tt>Trigger_Policy</tt> = <a href="hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>
+ with <i>&alpha;<sub>min</sub></i> = <i>1/8</i> and <i>&alpha;<sub>max</sub></i> = <i>1/2</i></li>
+<li>
+n_hash_map_ncah-
+<tt>stdext::hash_map</tt></li>
+<li>
+cc_hash_mask_exp_nea_lc_1div8_1div1_nsth_map-
+<a href="cc_hash_table.html"><tt>cc_hash_table</tt></a>
+with <tt>Comb_Hash_Fn</tt> = <a href="direct_mask_range_hashing.html"><tt>direct_mask_range_hashing</tt></a>
+, and <tt>Resize_Policy</tt> = <a href="hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>
+ with <tt>Size_Policy</tt> = <a href="hash_exponential_size_policy.html"><tt>hash_exponential_size_policy</tt></a>
+, and <tt>Trigger_Policy</tt> = <a href="hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>
+ with <i>&alpha;<sub>min</sub></i> = <i>1/8</i> and <i>&alpha;<sub>max</sub></i> = <i>1/1</i></li>
+<li>
+cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_map-
+<a href="cc_hash_table.html"><tt>cc_hash_table</tt></a>
+with <tt>Comb_Hash_Fn</tt> = <a href="direct_mask_range_hashing.html"><tt>direct_mask_range_hashing</tt></a>
+, and <tt>Resize_Policy</tt> = <a href="hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>
+ with <tt>Size_Policy</tt> = <a href="hash_exponential_size_policy.html"><tt>hash_exponential_size_policy</tt></a>
+, and <tt>Trigger_Policy</tt> = <a href="hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>
+ with <i>&alpha;<sub>min</sub></i> = <i>1/8</i> and <i>&alpha;<sub>max</sub></i> = <i>1/2</i></li>
+</ol>
+</div><div style="width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<div id="NCCL_res_div">
+<div id="NCCL_local">
+<div id="NCCL_cc_hash_random_int_find_timing_test">
+<div id="NCCL_assoc">
+<div id="NCCL_Native_and_collision-chaining_hash_random_int_find_timing_test_using__tt_find_455tt_"><div style = "border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NCCL" id= "NCCL"><img src="cc_hash_random_int_find_timing_test_local.png" alt="no image" /></a></h6>NCCL: Native and collision-chaining hash random int find timing test using <tt>find</tt> - <a href = "assoc_performance_tests.html#local">local</a></div><div style = "width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<div id="NGPG_res_div">
+<div id="NGPG_gcc">
+<div id="NGPG_gp_hash_random_int_find_timing_test">
+<div id="NGPG_assoc">
+<div id="NGPG_Native_and_collision-chaining_hash_random_int_find_timing_test_using__tt_find_455tt_"><div style="border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NGPG" id="NGPG"><img src="gp_hash_random_int_find_timing_test_gcc.png" alt="no image" /></a></h6>NGPG: Native and collision-chaining hash random int find timing test using <tt>find</tt> - <a href="assoc_performance_tests.html#gcc">g++</a><p>In the above figure, the names in the legends have the following meaning:</p>
+<ol>
+<li>
+gp_hash_mod_quadp_prime_nea_lc_1div8_1div2_nsth_map-
+<a href="gp_hash_table.html"><tt>gp_hash_table</tt></a>
+ with <tt>Comb_Hash_Fn</tt> = <a href="direct_mod_range_hashing.html"><tt>direct_mod_range_hashing</tt></a>
+, <tt>Resize_Policy</tt> = <a href="hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>
+ with <tt>Size_Policy</tt> = <a href="hash_prime_size_policy.html"><tt>hash_prime_size_policy</tt></a>
+, and <tt>Trigger_Policy</tt> = <a href="hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>
+ with <i>&alpha;<sub>min</sub></i> = <i>1/8</i> and <i>&alpha;<sub>max</sub></i> = <i>1/2</i>, and <tt>Probe_Fn</tt> = <a href="quadratic_probe_fn.html"><tt>quadratic_probe_fn</tt></a>
+</li>
+<li>
+n_hash_map_ncah-
+<tt>std::tr1::unordered_map</tt> with <tt>cache_hash_code</tt> = <tt><b>false</b></tt></li>
+<li>
+gp_hash_mask_linp_exp_nea_lc_1div8_1div2_nsth_map-
+<a href="gp_hash_table.html"><tt>gp_hash_table</tt></a>
+ with <tt>Comb_Hash_Fn</tt> = <a href="direct_mask_range_hashing.html"><tt>direct_mask_range_hashing</tt></a>
+, <tt>Resize_Policy</tt> = <a href="hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>
+ with <tt>Size_Policy</tt> = <a href="hash_exponential_size_policy.html"><tt>hash_exponential_size_policy</tt></a>
+, and <tt>Trigger_Policy</tt> = <a href="hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>
+ with <i>&alpha;<sub>min</sub></i> = <i>1/8</i> and <i>&alpha;<sub>max</sub></i> = <i>1/2</i>, and <tt>Probe_Fn</tt> = <a href="linear_probe_fn.html"><tt>linear_probe_fn</tt></a>
+</li>
+</ol>
+</div><div style="width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<div id="NGPM_res_div">
+<div id="NGPM_msvc">
+<div id="NGPM_gp_hash_random_int_find_timing_test">
+<div id="NGPM_assoc">
+<div id="NGPM_Native_and_collision-chaining_hash_random_int_find_timing_test_using__tt_find_455tt_"><div style="border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NGPM" id="NGPM"><img src="gp_hash_random_int_find_timing_test_msvc.png" alt="no image" /></a></h6>NGPM: Native and collision-chaining hash random int find timing test using <tt>find</tt> - <a href="assoc_performance_tests.html#msvc">msvc++</a><p>In the above figure, the names in the legends have the following meaning:</p>
+<ol>
+<li>
+gp_hash_mod_quadp_prime_nea_lc_1div8_1div2_nsth_map-
+<a href="gp_hash_table.html"><tt>gp_hash_table</tt></a>
+ with <tt>Comb_Hash_Fn</tt> = <a href="direct_mod_range_hashing.html"><tt>direct_mod_range_hashing</tt></a>
+, <tt>Resize_Policy</tt> = <a href="hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>
+ with <tt>Size_Policy</tt> = <a href="hash_prime_size_policy.html"><tt>hash_prime_size_policy</tt></a>
+, and <tt>Trigger_Policy</tt> = <a href="hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>
+ with <i>&alpha;<sub>min</sub></i> = <i>1/8</i> and <i>&alpha;<sub>max</sub></i> = <i>1/2</i>, and <tt>Probe_Fn</tt> = <a href="quadratic_probe_fn.html"><tt>quadratic_probe_fn</tt></a>
+</li>
+<li>
+n_hash_map_ncah-
+<tt>stdext::hash_map</tt></li>
+<li>
+gp_hash_mask_linp_exp_nea_lc_1div8_1div2_nsth_map-
+<a href="gp_hash_table.html"><tt>gp_hash_table</tt></a>
+ with <tt>Comb_Hash_Fn</tt> = <a href="direct_mask_range_hashing.html"><tt>direct_mask_range_hashing</tt></a>
+, <tt>Resize_Policy</tt> = <a href="hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>
+ with <tt>Size_Policy</tt> = <a href="hash_exponential_size_policy.html"><tt>hash_exponential_size_policy</tt></a>
+, and <tt>Trigger_Policy</tt> = <a href="hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>
+ with <i>&alpha;<sub>min</sub></i> = <i>1/8</i> and <i>&alpha;<sub>max</sub></i> = <i>1/2</i>, and <tt>Probe_Fn</tt> = <a href="linear_probe_fn.html"><tt>linear_probe_fn</tt></a>
+</li>
+</ol>
+</div><div style="width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<div id="NGPL_res_div">
+<div id="NGPL_local">
+<div id="NGPL_gp_hash_random_int_find_timing_test">
+<div id="NGPL_assoc">
+<div id="NGPL_Native_and_collision-chaining_hash_random_int_find_timing_test_using__tt_find_455tt_"><div style = "border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NGPL" id= "NGPL"><img src="gp_hash_random_int_find_timing_test_local.png" alt="no image" /></a></h6>NGPL: Native and collision-chaining hash random int find timing test using <tt>find</tt> - <a href = "assoc_performance_tests.html#local">local</a></div><div style = "width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<h2><a name="observations" id="observations">Observations</a></h2>
+<p>In this setting, the choice of underlying hash-table (see
+    <a href="hash_based_containers.html">Design::Associative
+    Containers::Hash-Based Containers</a> ) affects performance
+    most, then the range-hashing scheme (See <a href="hash_based_containers.html#hash_policies">Design::Associative
+    Containers::Hash-Based Containers::Hash Policies</a> ), and,
+    only finally, other policies.</p>
+<p>When comparing Figures <a href="#NCCG">NCCG</a> and <a href="#NCCM">NCCM</a> to <a href="#NGPG">NGPG</a> and <a href="#NGPM">NGPM</a> , respectively, it is apparent that the
+    probing containers are less efficient than the
+    collision-chaining containers (both
+    <tt>std::tr1::unordered_map</tt> and <tt>stdext::hash_map</tt>
+    use collision-chaining) in this case.</p>
+<p>( <a href="hash_random_int_subscript_insert_timing_test.html">Hash-Based
+    Random-Integer Subscript Insert Timing Test</a> shows a
+    different case, where the situation is reversed; <a href="assoc_performance_tests.html#hash_based_types">Observations::Hash-Based
+    Container Types</a> discusses some further considerations.)</p>
+<p>Within each type of hash-table, the range-hashing scheme
+    affects performance more than other policies; <a href="hash_text_find_find_timing_test.html#observations">Hash-Based
+    Text <tt>find</tt> Find Timing Test::Observations</a> discusses
+    this. In Figures <a href="#NCCG">NCCG</a> , <a href="#NCCM">NCCM</a> , <a href="#NGPG">NGPG</a> , and <a href="#NGPM">NGPM</a> , it should be noted that
+    <tt>std::tr1::unordered_map</tt> and <tt>stdext::hash_map</tt>
+    are hard-wired currently to mod-based and mask-based schemes,
+    respectively.</p>
+<p><a href="assoc_performance_tests.html#hash_based_types">Observations::Hash-Based
+    Container Types</a> summarizes some observations on hash-based
+    containers; <a href="assoc_performance_tests.html#hash_based_policies">Observations::Hash-Based
+    Containers' Policies</a> summarizes some observations on
+    hash-based containers' policies.</p>
+</div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/hash_random_int_subscript_find_timing_test.html b/libstdc++-v3/docs/html/ext/pb_ds/hash_random_int_subscript_find_timing_test.html
new file mode 100644
index 00000000000..adee8f0b1bd
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/hash_random_int_subscript_find_timing_test.html
@@ -0,0 +1,220 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+<meta name="generator" content="HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+<title>Hash Random Int Subscript Find Timing Test</title>
+<meta http-equiv="Content-Type" content="text/html; charset=us-ascii" />
+</head>
+<body>
+<div id="page">
+<h1>Hash-Based Random-Integer <tt><b>operator</b>[]</tt>
+    FindTiming Test</h1>
+<h2><a name="description" id="description">Description</a></h2>
+<p>This test inserts a number of values with uniform i.i.d.
+    integer keys into a container, then performs a series of finds
+    using <tt><b>operator</b>[]</tt>. It measures the average time
+    for <tt><b>operator</b>[]</tt> as a function of the number of
+    values inserted.</p>
+<p>(The test was executed with <a href="../../../../testsuite/performance/ext/pb_ds/random_int_subscript_find_timing.cc"><tt>hash_random_int_subscript_find_timing_test</tt></a>
+    200 200 2100)</p>
+<h2><a name="purpose" id="purpose">Purpose</a></h2>
+<p>The test checks the effect of different underlying
+    hash-tables (see <a href="hash_based_containers.html">Design::Hash-Based Containers</a>
+    ), range-hashing functions, and trigger policies (see <a href="hash_based_containers.html#hash_policies">Design::Hash-Based
+    Containers::Hash Policies</a> and <a href="hash_based_containers.html#resize_policies">Design::Hash-Based
+    Containers::Resize Policies</a> ).</p>
+<h2><a name="results" id="results">Results</a></h2>
+<p>Figures <a href="#NCCG">NCCG</a>, <a href="#NCCM">NCCM</a>,
+    and <a href="#NCCL">NCCL</a> show the results for the native
+    and collision-chaining types in <a href="assoc_performance_tests.html#gcc"><u>g++</u></a>, <a href="assoc_performance_tests.html#msvc"><u>MSVC++</u></a>, and
+    <a href="assoc_performance_tests.html#local"><u>local</u></a>,
+    respectively; Figures <a href="#NGPG">NGPG</a>, <a href="#NGPM">NGPM</a>, and <a href="#NGPL">NGPL</a> show the results
+    for the native and probing types in <a href="assoc_performance_tests.html#gcc"><u>g++</u></a>, <a href="assoc_performance_tests.html#msvc"><u>MSVC++</u></a>, and
+    <a href="assoc_performance_tests.html#local"><u>local</u></a>,
+    respectively.</p>
+<div id="NCCG_res_div">
+<div id="NCCG_gcc">
+<div id="NCCG_cc_hash_random_int_subscript_timing_test_find">
+<div id="NCCG_assoc">
+<div id="NCCG_Native_and_collision-chaining_hash_random_int_find_timing_test_using__tt__b_operator_455b__455tt__457"><div style="border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NCCG" id="NCCG"><img src="cc_hash_random_int_subscript_timing_test_find_gcc.png" alt="no image" /></a></h6>NCCG: Native and collision-chaining hash random int find timing test using <tt><b>operator</b></tt>[] - <a href="assoc_performance_tests.html#gcc">g++</a><p>In the above figure, the names in the legends have the following meaning:</p>
+<ol>
+<li>
+n_hash_map_ncah-
+<tt>std::tr1::unordered_map</tt> with <tt>cache_hash_code</tt> = <tt><b>false</b></tt></li>
+<li>
+cc_hash_mod_prime_nea_lc_1div8_1div1_nsth_map-
+<a href="cc_hash_table.html"><tt>cc_hash_table</tt></a>
+with <tt>Comb_Hash_Fn</tt> = <a href="direct_mod_range_hashing.html"><tt>direct_mod_range_hashing</tt></a>
+, and <tt>Resize_Policy</tt> = <a href="hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>
+ with <tt>Size_Policy</tt> = <a href="hash_prime_size_policy.html"><tt>hash_prime_size_policy</tt></a>
+, and <tt>Trigger_Policy</tt> = <a href="hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>
+ with <i>&alpha;<sub>min</sub></i> = <i>1/8</i> and <i>&alpha;<sub>max</sub></i> = <i>1/1</i></li>
+<li>
+cc_hash_mod_prime_nea_lc_1div8_1div2_nsth_map-
+<a href="cc_hash_table.html"><tt>cc_hash_table</tt></a>
+with <tt>Comb_Hash_Fn</tt> = <a href="direct_mod_range_hashing.html"><tt>direct_mod_range_hashing</tt></a>
+, and <tt>Resize_Policy</tt> = <a href="hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>
+ with <tt>Size_Policy</tt> = <a href="hash_prime_size_policy.html"><tt>hash_prime_size_policy</tt></a>
+, and <tt>Trigger_Policy</tt> = <a href="hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>
+ with <i>&alpha;<sub>min</sub></i> = <i>1/8</i> and <i>&alpha;<sub>max</sub></i> = <i>1/2</i></li>
+<li>
+cc_hash_mask_exp_nea_lc_1div8_1div1_nsth_map-
+<a href="cc_hash_table.html"><tt>cc_hash_table</tt></a>
+with <tt>Comb_Hash_Fn</tt> = <a href="direct_mask_range_hashing.html"><tt>direct_mask_range_hashing</tt></a>
+, and <tt>Resize_Policy</tt> = <a href="hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>
+ with <tt>Size_Policy</tt> = <a href="hash_exponential_size_policy.html"><tt>hash_exponential_size_policy</tt></a>
+, and <tt>Trigger_Policy</tt> = <a href="hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>
+ with <i>&alpha;<sub>min</sub></i> = <i>1/8</i> and <i>&alpha;<sub>max</sub></i> = <i>1/1</i></li>
+<li>
+cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_map-
+<a href="cc_hash_table.html"><tt>cc_hash_table</tt></a>
+with <tt>Comb_Hash_Fn</tt> = <a href="direct_mask_range_hashing.html"><tt>direct_mask_range_hashing</tt></a>
+, and <tt>Resize_Policy</tt> = <a href="hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>
+ with <tt>Size_Policy</tt> = <a href="hash_exponential_size_policy.html"><tt>hash_exponential_size_policy</tt></a>
+, and <tt>Trigger_Policy</tt> = <a href="hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>
+ with <i>&alpha;<sub>min</sub></i> = <i>1/8</i> and <i>&alpha;<sub>max</sub></i> = <i>1/2</i></li>
+</ol>
+</div><div style="width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<div id="NCCM_res_div">
+<div id="NCCM_msvc">
+<div id="NCCM_cc_hash_random_int_subscript_timing_test_find">
+<div id="NCCM_assoc">
+<div id="NCCM_Native_and_collision-chaining_hash_random_int_find_timing_test_using__tt__b_operator_455b__455tt__457"><div style="border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NCCM" id="NCCM"><img src="cc_hash_random_int_subscript_timing_test_find_msvc.png" alt="no image" /></a></h6>NCCM: Native and collision-chaining hash random int find timing test using <tt><b>operator</b></tt>[] - <a href="assoc_performance_tests.html#msvc">msvc++</a><p>In the above figure, the names in the legends have the following meaning:</p>
+<ol>
+<li>
+cc_hash_mod_prime_nea_lc_1div8_1div1_nsth_map-
+<a href="cc_hash_table.html"><tt>cc_hash_table</tt></a>
+with <tt>Comb_Hash_Fn</tt> = <a href="direct_mod_range_hashing.html"><tt>direct_mod_range_hashing</tt></a>
+, and <tt>Resize_Policy</tt> = <a href="hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>
+ with <tt>Size_Policy</tt> = <a href="hash_prime_size_policy.html"><tt>hash_prime_size_policy</tt></a>
+, and <tt>Trigger_Policy</tt> = <a href="hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>
+ with <i>&alpha;<sub>min</sub></i> = <i>1/8</i> and <i>&alpha;<sub>max</sub></i> = <i>1/1</i></li>
+<li>
+cc_hash_mod_prime_nea_lc_1div8_1div2_nsth_map-
+<a href="cc_hash_table.html"><tt>cc_hash_table</tt></a>
+with <tt>Comb_Hash_Fn</tt> = <a href="direct_mod_range_hashing.html"><tt>direct_mod_range_hashing</tt></a>
+, and <tt>Resize_Policy</tt> = <a href="hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>
+ with <tt>Size_Policy</tt> = <a href="hash_prime_size_policy.html"><tt>hash_prime_size_policy</tt></a>
+, and <tt>Trigger_Policy</tt> = <a href="hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>
+ with <i>&alpha;<sub>min</sub></i> = <i>1/8</i> and <i>&alpha;<sub>max</sub></i> = <i>1/2</i></li>
+<li>
+n_hash_map_ncah-
+<tt>stdext::hash_map</tt></li>
+<li>
+cc_hash_mask_exp_nea_lc_1div8_1div1_nsth_map-
+<a href="cc_hash_table.html"><tt>cc_hash_table</tt></a>
+with <tt>Comb_Hash_Fn</tt> = <a href="direct_mask_range_hashing.html"><tt>direct_mask_range_hashing</tt></a>
+, and <tt>Resize_Policy</tt> = <a href="hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>
+ with <tt>Size_Policy</tt> = <a href="hash_exponential_size_policy.html"><tt>hash_exponential_size_policy</tt></a>
+, and <tt>Trigger_Policy</tt> = <a href="hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>
+ with <i>&alpha;<sub>min</sub></i> = <i>1/8</i> and <i>&alpha;<sub>max</sub></i> = <i>1/1</i></li>
+<li>
+cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_map-
+<a href="cc_hash_table.html"><tt>cc_hash_table</tt></a>
+with <tt>Comb_Hash_Fn</tt> = <a href="direct_mask_range_hashing.html"><tt>direct_mask_range_hashing</tt></a>
+, and <tt>Resize_Policy</tt> = <a href="hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>
+ with <tt>Size_Policy</tt> = <a href="hash_exponential_size_policy.html"><tt>hash_exponential_size_policy</tt></a>
+, and <tt>Trigger_Policy</tt> = <a href="hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>
+ with <i>&alpha;<sub>min</sub></i> = <i>1/8</i> and <i>&alpha;<sub>max</sub></i> = <i>1/2</i></li>
+</ol>
+</div><div style="width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<div id="NCCL_res_div">
+<div id="NCCL_local">
+<div id="NCCL_cc_hash_random_int_subscript_timing_test_find">
+<div id="NCCL_assoc">
+<div id="NCCL_Native_and_collision-chaining_hash_random_int_find_timing_test_using__tt__b_operator_455b__455tt__457"><div style = "border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NCCL" id= "NCCL"><img src="cc_hash_random_int_subscript_timing_test_find_local.png" alt="no image" /></a></h6>NCCL: Native and collision-chaining hash random int find timing test using <tt><b>operator</b></tt>[] - <a href = "assoc_performance_tests.html#local">local</a></div><div style = "width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<div id="NGPG_res_div">
+<div id="NGPG_gcc">
+<div id="NGPG_gp_hash_random_int_subscript_timing_test_find">
+<div id="NGPG_assoc">
+<div id="NGPG_Native_and_probing_hash_random_int_find_timing_test_using__tt__b_operator_455b__455tt__457"><div style="border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NGPG" id="NGPG"><img src="gp_hash_random_int_subscript_timing_test_find_gcc.png" alt="no image" /></a></h6>NGPG: Native and probing hash random int find timing test using <tt><b>operator</b></tt>[] - <a href="assoc_performance_tests.html#gcc">g++</a><p>In the above figure, the names in the legends have the following meaning:</p>
+<ol>
+<li>
+n_hash_map_ncah-
+<tt>std::tr1::unordered_map</tt> with <tt>cache_hash_code</tt> = <tt><b>false</b></tt></li>
+<li>
+gp_hash_mod_quadp_prime_nea_lc_1div8_1div2_nsth_map-
+<a href="gp_hash_table.html"><tt>gp_hash_table</tt></a>
+ with <tt>Comb_Hash_Fn</tt> = <a href="direct_mod_range_hashing.html"><tt>direct_mod_range_hashing</tt></a>
+, <tt>Resize_Policy</tt> = <a href="hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>
+ with <tt>Size_Policy</tt> = <a href="hash_prime_size_policy.html"><tt>hash_prime_size_policy</tt></a>
+, and <tt>Trigger_Policy</tt> = <a href="hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>
+ with <i>&alpha;<sub>min</sub></i> = <i>1/8</i> and <i>&alpha;<sub>max</sub></i> = <i>1/2</i>, and <tt>Probe_Fn</tt> = <a href="quadratic_probe_fn.html"><tt>quadratic_probe_fn</tt></a>
+</li>
+<li>
+gp_hash_mask_linp_exp_nea_lc_1div8_1div2_nsth_map-
+<a href="gp_hash_table.html"><tt>gp_hash_table</tt></a>
+ with <tt>Comb_Hash_Fn</tt> = <a href="direct_mask_range_hashing.html"><tt>direct_mask_range_hashing</tt></a>
+, <tt>Resize_Policy</tt> = <a href="hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>
+ with <tt>Size_Policy</tt> = <a href="hash_exponential_size_policy.html"><tt>hash_exponential_size_policy</tt></a>
+, and <tt>Trigger_Policy</tt> = <a href="hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>
+ with <i>&alpha;<sub>min</sub></i> = <i>1/8</i> and <i>&alpha;<sub>max</sub></i> = <i>1/2</i>, and <tt>Probe_Fn</tt> = <a href="linear_probe_fn.html"><tt>linear_probe_fn</tt></a>
+</li>
+</ol>
+</div><div style="width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<div id="NGPM_res_div">
+<div id="NGPM_msvc">
+<div id="NGPM_gp_hash_random_int_subscript_timing_test_find">
+<div id="NGPM_assoc">
+<div id="NGPM_Native_and_probing_hash_random_int_find_timing_test_using__tt__b_operator_455b__455tt__457"><div style="border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NGPM" id="NGPM"><img src="gp_hash_random_int_subscript_timing_test_find_msvc.png" alt="no image" /></a></h6>NGPM: Native and probing hash random int find timing test using <tt><b>operator</b></tt>[] - <a href="assoc_performance_tests.html#msvc">msvc++</a><p>In the above figure, the names in the legends have the following meaning:</p>
+<ol>
+<li>
+gp_hash_mod_quadp_prime_nea_lc_1div8_1div2_nsth_map-
+<a href="gp_hash_table.html"><tt>gp_hash_table</tt></a>
+ with <tt>Comb_Hash_Fn</tt> = <a href="direct_mod_range_hashing.html"><tt>direct_mod_range_hashing</tt></a>
+, <tt>Resize_Policy</tt> = <a href="hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>
+ with <tt>Size_Policy</tt> = <a href="hash_prime_size_policy.html"><tt>hash_prime_size_policy</tt></a>
+, and <tt>Trigger_Policy</tt> = <a href="hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>
+ with <i>&alpha;<sub>min</sub></i> = <i>1/8</i> and <i>&alpha;<sub>max</sub></i> = <i>1/2</i>, and <tt>Probe_Fn</tt> = <a href="quadratic_probe_fn.html"><tt>quadratic_probe_fn</tt></a>
+</li>
+<li>
+n_hash_map_ncah-
+<tt>stdext::hash_map</tt></li>
+<li>
+gp_hash_mask_linp_exp_nea_lc_1div8_1div2_nsth_map-
+<a href="gp_hash_table.html"><tt>gp_hash_table</tt></a>
+ with <tt>Comb_Hash_Fn</tt> = <a href="direct_mask_range_hashing.html"><tt>direct_mask_range_hashing</tt></a>
+, <tt>Resize_Policy</tt> = <a href="hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>
+ with <tt>Size_Policy</tt> = <a href="hash_exponential_size_policy.html"><tt>hash_exponential_size_policy</tt></a>
+, and <tt>Trigger_Policy</tt> = <a href="hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>
+ with <i>&alpha;<sub>min</sub></i> = <i>1/8</i> and <i>&alpha;<sub>max</sub></i> = <i>1/2</i>, and <tt>Probe_Fn</tt> = <a href="linear_probe_fn.html"><tt>linear_probe_fn</tt></a>
+</li>
+</ol>
+</div><div style="width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<div id="NGPL_res_div">
+<div id="NGPL_local">
+<div id="NGPL_gp_hash_random_int_subscript_timing_test_find">
+<div id="NGPL_assoc">
+<div id="NGPL_Native_and_probing_hash_random_int_find_timing_test_using__tt__b_operator_455b__455tt__457"><div style = "border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NGPL" id= "NGPL"><img src="gp_hash_random_int_subscript_timing_test_find_local.png" alt="no image" /></a></h6>NGPL: Native and probing hash random int find timing test using <tt><b>operator</b></tt>[] - <a href = "assoc_performance_tests.html#local">local</a></div><div style = "width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<h2><a name="observations" id="observations">Observations</a></h2>
+<p>This test shows similar results to <a href="hash_random_int_find_find_timing_test.html">Hash-Based
+    Random-Integer <tt>find</tt> Find Timing Test</a> .</p>
+</div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/hash_random_int_subscript_insert_timing_test.html b/libstdc++-v3/docs/html/ext/pb_ds/hash_random_int_subscript_insert_timing_test.html
new file mode 100644
index 00000000000..37a8644a496
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/hash_random_int_subscript_insert_timing_test.html
@@ -0,0 +1,365 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+<meta name="generator" content="HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+<title>Hash Random Int Subscript Insert Timing Test</title>
+<meta http-equiv="Content-Type" content="text/html; charset=us-ascii" />
+</head>
+<body>
+<div id="page">
+<h1>Hash-Based Random-Integer <tt><b>operator</b>[]</tt> Insert
+    Timing Test</h1>
+<h2><a name="description" id="description">Description</a></h2>
+<p>This test inserts a number of values with uniform i.i.d.
+    integer keys into a container, using
+    <tt><b>operator</b>[]</tt>. It measures the average time for
+    <tt><b>operator</b>[]</tt> as a function of the number of
+    values inserted.</p>
+<p>(The test was executed with <a href="../../../../testsuite/performance/ext/pb_ds/random_int_subscript_insert_timing.cc"><tt>hash_random_int_subscript_insert_timing_test</tt></a>
+    200 200 2100)</p>
+<h2><a name="purpose" id="purpose">Purpose</a></h2>
+<p>The test primarily checks the effect of different underlying
+    hash-tables (see <a href="hash_based_containers.html">Design::Associative
+    Containers::Associative Containers::Hash-Based
+    Containers</a>).</p>
+<h2><a name="results" id="results">Results</a></h2>
+<p>Figures <a href="#NCCG">NCCG</a>, <a href="#NCCM">NCCM</a>,
+    and <a href="#NCCL">NCCL</a> show the results for the native
+    and collision-chaining types in <a href="assoc_performance_tests.html#gcc"><u>g++</u></a>, <a href="assoc_performance_tests.html#msvc"><u>MSVC++</u></a>, and
+    <a href="assoc_performance_tests.html#local"><u>local</u></a>,
+    respectively; Figures <a href="#NGPG">NGPG</a>, <a href="#NGPM">NGPM</a>, and <a href="#NGPL">NGPL</a> show the results
+    for the native and probing types in <a href="assoc_performance_tests.html#gcc"><u>g++</u></a>, <a href="assoc_performance_tests.html#msvc"><u>msvc++</u></a>, and
+    <a href="assoc_performance_tests.html#local"><u>local</u></a>
+    respectively; Figures <a href="#CCGPG">CCGPG</a>, <a href="#CCGPM">CCGPM</a>, and <a href="#CCGPL">CCGPL</a> compare the
+    results for the collision-chaining and probing types of
+    <tt>pb_ds</tt> only, in <a href="assoc_performance_tests.html#gcc"><u>g++</u></a>, <a href="assoc_performance_tests.html#msvc"><u>MSVC++</u></a>, and
+    <a href="assoc_performance_tests.html#local"><u>local</u></a>
+    respectively.</p>
+<div id="NCCG_res_div">
+<div id="NCCG_gcc">
+<div id="NCCG_cc_hash_random_int_subscript_timing_test_insert">
+<div id="NCCG_assoc">
+<div id="NCCG_Native_and_collision-chaining_hash_random_int_insert_timing_test_using__tt__b_operator_455b__455tt_"><div style="border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NCCG" id="NCCG"><img src="cc_hash_random_int_subscript_timing_test_insert_gcc.png" alt="no image" /></a></h6>NCCG: Native and collision-chaining hash random int insert timing test using <tt><b>operator</b></tt> - <a href="assoc_performance_tests.html#gcc">g++</a><p>In the above figure, the names in the legends have the following meaning:</p>
+<ol>
+<li>
+cc_hash_mod_prime_nea_lc_1div8_1div2_nsth_map-
+<a href="cc_hash_table.html"><tt>cc_hash_table</tt></a>
+with <tt>Comb_Hash_Fn</tt> = <a href="direct_mod_range_hashing.html"><tt>direct_mod_range_hashing</tt></a>
+, and <tt>Resize_Policy</tt> = <a href="hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>
+ with <tt>Size_Policy</tt> = <a href="hash_prime_size_policy.html"><tt>hash_prime_size_policy</tt></a>
+, and <tt>Trigger_Policy</tt> = <a href="hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>
+ with <i>&alpha;<sub>min</sub></i> = <i>1/8</i> and <i>&alpha;<sub>max</sub></i> = <i>1/2</i></li>
+<li>
+n_hash_map_ncah-
+<tt>std::tr1::unordered_map</tt> with <tt>cache_hash_code</tt> = <tt><b>false</b></tt></li>
+<li>
+cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_map-
+<a href="cc_hash_table.html"><tt>cc_hash_table</tt></a>
+with <tt>Comb_Hash_Fn</tt> = <a href="direct_mask_range_hashing.html"><tt>direct_mask_range_hashing</tt></a>
+, and <tt>Resize_Policy</tt> = <a href="hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>
+ with <tt>Size_Policy</tt> = <a href="hash_exponential_size_policy.html"><tt>hash_exponential_size_policy</tt></a>
+, and <tt>Trigger_Policy</tt> = <a href="hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>
+ with <i>&alpha;<sub>min</sub></i> = <i>1/8</i> and <i>&alpha;<sub>max</sub></i> = <i>1/2</i></li>
+<li>
+cc_hash_mod_prime_nea_lc_1div8_1div1_nsth_map-
+<a href="cc_hash_table.html"><tt>cc_hash_table</tt></a>
+with <tt>Comb_Hash_Fn</tt> = <a href="direct_mod_range_hashing.html"><tt>direct_mod_range_hashing</tt></a>
+, and <tt>Resize_Policy</tt> = <a href="hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>
+ with <tt>Size_Policy</tt> = <a href="hash_prime_size_policy.html"><tt>hash_prime_size_policy</tt></a>
+, and <tt>Trigger_Policy</tt> = <a href="hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>
+ with <i>&alpha;<sub>min</sub></i> = <i>1/8</i> and <i>&alpha;<sub>max</sub></i> = <i>1/1</i></li>
+<li>
+cc_hash_mask_exp_nea_lc_1div8_1div1_nsth_map-
+<a href="cc_hash_table.html"><tt>cc_hash_table</tt></a>
+with <tt>Comb_Hash_Fn</tt> = <a href="direct_mask_range_hashing.html"><tt>direct_mask_range_hashing</tt></a>
+, and <tt>Resize_Policy</tt> = <a href="hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>
+ with <tt>Size_Policy</tt> = <a href="hash_exponential_size_policy.html"><tt>hash_exponential_size_policy</tt></a>
+, and <tt>Trigger_Policy</tt> = <a href="hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>
+ with <i>&alpha;<sub>min</sub></i> = <i>1/8</i> and <i>&alpha;<sub>max</sub></i> = <i>1/1</i></li>
+</ol>
+</div><div style="width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<div id="NCCM_res_div">
+<div id="NCCM_msvc">
+<div id="NCCM_cc_hash_random_int_subscript_timing_test_insert">
+<div id="NCCM_assoc">
+<div id="NCCM_Native_and_collision-chaining_hash_random_int_insert_timing_test_using__tt__b_operator_455b__455tt_"><div style="border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NCCM" id="NCCM"><img src="cc_hash_random_int_subscript_timing_test_insert_msvc.png" alt="no image" /></a></h6>NCCM: Native and collision-chaining hash random int insert timing test using <tt><b>operator</b></tt> - <a href="assoc_performance_tests.html#msvc">msvc++</a><p>In the above figure, the names in the legends have the following meaning:</p>
+<ol>
+<li>
+n_hash_map_ncah-
+<tt>stdext::hash_map</tt></li>
+<li>
+cc_hash_mod_prime_nea_lc_1div8_1div2_nsth_map-
+<a href="cc_hash_table.html"><tt>cc_hash_table</tt></a>
+with <tt>Comb_Hash_Fn</tt> = <a href="direct_mod_range_hashing.html"><tt>direct_mod_range_hashing</tt></a>
+, and <tt>Resize_Policy</tt> = <a href="hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>
+ with <tt>Size_Policy</tt> = <a href="hash_prime_size_policy.html"><tt>hash_prime_size_policy</tt></a>
+, and <tt>Trigger_Policy</tt> = <a href="hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>
+ with <i>&alpha;<sub>min</sub></i> = <i>1/8</i> and <i>&alpha;<sub>max</sub></i> = <i>1/2</i></li>
+<li>
+cc_hash_mod_prime_nea_lc_1div8_1div1_nsth_map-
+<a href="cc_hash_table.html"><tt>cc_hash_table</tt></a>
+with <tt>Comb_Hash_Fn</tt> = <a href="direct_mod_range_hashing.html"><tt>direct_mod_range_hashing</tt></a>
+, and <tt>Resize_Policy</tt> = <a href="hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>
+ with <tt>Size_Policy</tt> = <a href="hash_prime_size_policy.html"><tt>hash_prime_size_policy</tt></a>
+, and <tt>Trigger_Policy</tt> = <a href="hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>
+ with <i>&alpha;<sub>min</sub></i> = <i>1/8</i> and <i>&alpha;<sub>max</sub></i> = <i>1/1</i></li>
+<li>
+cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_map-
+<a href="cc_hash_table.html"><tt>cc_hash_table</tt></a>
+with <tt>Comb_Hash_Fn</tt> = <a href="direct_mask_range_hashing.html"><tt>direct_mask_range_hashing</tt></a>
+, and <tt>Resize_Policy</tt> = <a href="hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>
+ with <tt>Size_Policy</tt> = <a href="hash_exponential_size_policy.html"><tt>hash_exponential_size_policy</tt></a>
+, and <tt>Trigger_Policy</tt> = <a href="hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>
+ with <i>&alpha;<sub>min</sub></i> = <i>1/8</i> and <i>&alpha;<sub>max</sub></i> = <i>1/2</i></li>
+<li>
+cc_hash_mask_exp_nea_lc_1div8_1div1_nsth_map-
+<a href="cc_hash_table.html"><tt>cc_hash_table</tt></a>
+with <tt>Comb_Hash_Fn</tt> = <a href="direct_mask_range_hashing.html"><tt>direct_mask_range_hashing</tt></a>
+, and <tt>Resize_Policy</tt> = <a href="hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>
+ with <tt>Size_Policy</tt> = <a href="hash_exponential_size_policy.html"><tt>hash_exponential_size_policy</tt></a>
+, and <tt>Trigger_Policy</tt> = <a href="hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>
+ with <i>&alpha;<sub>min</sub></i> = <i>1/8</i> and <i>&alpha;<sub>max</sub></i> = <i>1/1</i></li>
+</ol>
+</div><div style="width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<div id="NCCL_res_div">
+<div id="NCCL_local">
+<div id="NCCL_cc_hash_random_int_subscript_timing_test_insert">
+<div id="NCCL_assoc">
+<div id="NCCL_Native_and_collision-chaining_hash_random_int_insert_timing_test_using__tt__b_operator_455b__455tt_"><div style = "border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NCCL" id= "NCCL"><img src="cc_hash_random_int_subscript_timing_test_insert_local.png" alt="no image" /></a></h6>NCCL: Native and collision-chaining hash random int insert timing test using <tt><b>operator</b></tt> - <a href = "assoc_performance_tests.html#local">local</a></div><div style = "width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<div id="NGPG_res_div">
+<div id="NGPG_gcc">
+<div id="NGPG_gp_hash_random_int_subscript_timing_test_insert">
+<div id="NGPG_assoc">
+<div id="NGPG_Native_and_probing_hash_random_int_insert_timing_test_using__tt__b_operator_455b__455tt_"><div style="border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NGPG" id="NGPG"><img src="gp_hash_random_int_subscript_timing_test_insert_gcc.png" alt="no image" /></a></h6>NGPG: Native and probing hash random int insert timing test using <tt><b>operator</b></tt> - <a href="assoc_performance_tests.html#gcc">g++</a><p>In the above figure, the names in the legends have the following meaning:</p>
+<ol>
+<li>
+gp_hash_mod_quadp_prime_nea_lc_1div8_1div2_nsth_map-
+<a href="gp_hash_table.html"><tt>gp_hash_table</tt></a>
+ with <tt>Comb_Hash_Fn</tt> = <a href="direct_mod_range_hashing.html"><tt>direct_mod_range_hashing</tt></a>
+, <tt>Resize_Policy</tt> = <a href="hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>
+ with <tt>Size_Policy</tt> = <a href="hash_prime_size_policy.html"><tt>hash_prime_size_policy</tt></a>
+, and <tt>Trigger_Policy</tt> = <a href="hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>
+ with <i>&alpha;<sub>min</sub></i> = <i>1/8</i> and <i>&alpha;<sub>max</sub></i> = <i>1/2</i>, and <tt>Probe_Fn</tt> = <a href="quadratic_probe_fn.html"><tt>quadratic_probe_fn</tt></a>
+</li>
+<li>
+n_hash_map_ncah-
+<tt>std::tr1::unordered_map</tt> with <tt>cache_hash_code</tt> = <tt><b>false</b></tt></li>
+<li>
+gp_hash_mask_linp_exp_nea_lc_1div8_1div2_nsth_map-
+<a href="gp_hash_table.html"><tt>gp_hash_table</tt></a>
+ with <tt>Comb_Hash_Fn</tt> = <a href="direct_mask_range_hashing.html"><tt>direct_mask_range_hashing</tt></a>
+, <tt>Resize_Policy</tt> = <a href="hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>
+ with <tt>Size_Policy</tt> = <a href="hash_exponential_size_policy.html"><tt>hash_exponential_size_policy</tt></a>
+, and <tt>Trigger_Policy</tt> = <a href="hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>
+ with <i>&alpha;<sub>min</sub></i> = <i>1/8</i> and <i>&alpha;<sub>max</sub></i> = <i>1/2</i>, and <tt>Probe_Fn</tt> = <a href="linear_probe_fn.html"><tt>linear_probe_fn</tt></a>
+</li>
+</ol>
+</div><div style="width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<div id="NGPM_res_div">
+<div id="NGPM_msvc">
+<div id="NGPM_gp_hash_random_int_subscript_timing_test_insert">
+<div id="NGPM_assoc">
+<div id="NGPM_Native_and_probing_hash_random_int_insert_timing_test_using__tt__b_operator_455b__455tt_"><div style="border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NGPM" id="NGPM"><img src="gp_hash_random_int_subscript_timing_test_insert_msvc.png" alt="no image" /></a></h6>NGPM: Native and probing hash random int insert timing test using <tt><b>operator</b></tt> - <a href="assoc_performance_tests.html#msvc">msvc++</a><p>In the above figure, the names in the legends have the following meaning:</p>
+<ol>
+<li>
+n_hash_map_ncah-
+<tt>stdext::hash_map</tt></li>
+<li>
+gp_hash_mod_quadp_prime_nea_lc_1div8_1div2_nsth_map-
+<a href="gp_hash_table.html"><tt>gp_hash_table</tt></a>
+ with <tt>Comb_Hash_Fn</tt> = <a href="direct_mod_range_hashing.html"><tt>direct_mod_range_hashing</tt></a>
+, <tt>Resize_Policy</tt> = <a href="hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>
+ with <tt>Size_Policy</tt> = <a href="hash_prime_size_policy.html"><tt>hash_prime_size_policy</tt></a>
+, and <tt>Trigger_Policy</tt> = <a href="hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>
+ with <i>&alpha;<sub>min</sub></i> = <i>1/8</i> and <i>&alpha;<sub>max</sub></i> = <i>1/2</i>, and <tt>Probe_Fn</tt> = <a href="quadratic_probe_fn.html"><tt>quadratic_probe_fn</tt></a>
+</li>
+<li>
+gp_hash_mask_linp_exp_nea_lc_1div8_1div2_nsth_map-
+<a href="gp_hash_table.html"><tt>gp_hash_table</tt></a>
+ with <tt>Comb_Hash_Fn</tt> = <a href="direct_mask_range_hashing.html"><tt>direct_mask_range_hashing</tt></a>
+, <tt>Resize_Policy</tt> = <a href="hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>
+ with <tt>Size_Policy</tt> = <a href="hash_exponential_size_policy.html"><tt>hash_exponential_size_policy</tt></a>
+, and <tt>Trigger_Policy</tt> = <a href="hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>
+ with <i>&alpha;<sub>min</sub></i> = <i>1/8</i> and <i>&alpha;<sub>max</sub></i> = <i>1/2</i>, and <tt>Probe_Fn</tt> = <a href="linear_probe_fn.html"><tt>linear_probe_fn</tt></a>
+</li>
+</ol>
+</div><div style="width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<div id="NGPL_res_div">
+<div id="NGPL_local">
+<div id="NGPL_gp_hash_random_int_subscript_timing_test_insert">
+<div id="NGPL_assoc">
+<div id="NGPL_Native_and_probing_hash_random_int_insert_timing_test_using__tt__b_operator_455b__455tt_"><div style = "border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NGPL" id= "NGPL"><img src="gp_hash_random_int_subscript_timing_test_insert_local.png" alt="no image" /></a></h6>NGPL: Native and probing hash random int insert timing test using <tt><b>operator</b></tt> - <a href = "assoc_performance_tests.html#local">local</a></div><div style = "width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<div id="CCGPG_res_div">
+<div id="CCGPG_gcc">
+<div id="CCGPG_ccgp_hash_random_int_subscript_timing_test_insert">
+<div id="CCGPG_assoc">
+<div id="CCGPG_Collision-chaining_and_probing_hash_random_int_insert_timing_test_using__tt__b_operator_455b__455tt_"><div style="border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="CCGPG" id="CCGPG"><img src="ccgp_hash_random_int_subscript_timing_test_insert_gcc.png" alt="no image" /></a></h6>CCGPG: Collision-chaining and probing hash random int insert timing test using <tt><b>operator</b></tt> - <a href="assoc_performance_tests.html#gcc">g++</a><p>In the above figure, the names in the legends have the following meaning:</p>
+<ol>
+<li>
+gp_hash_mod_quadp_prime_nea_lc_1div8_1div2_nsth_map-
+<a href="gp_hash_table.html"><tt>gp_hash_table</tt></a>
+ with <tt>Comb_Hash_Fn</tt> = <a href="direct_mod_range_hashing.html"><tt>direct_mod_range_hashing</tt></a>
+, <tt>Resize_Policy</tt> = <a href="hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>
+ with <tt>Size_Policy</tt> = <a href="hash_prime_size_policy.html"><tt>hash_prime_size_policy</tt></a>
+, and <tt>Trigger_Policy</tt> = <a href="hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>
+ with <i>&alpha;<sub>min</sub></i> = <i>1/8</i> and <i>&alpha;<sub>max</sub></i> = <i>1/2</i>, and <tt>Probe_Fn</tt> = <a href="quadratic_probe_fn.html"><tt>quadratic_probe_fn</tt></a>
+</li>
+<li>
+cc_hash_mod_prime_nea_lc_1div8_1div2_nsth_map-
+<a href="cc_hash_table.html"><tt>cc_hash_table</tt></a>
+with <tt>Comb_Hash_Fn</tt> = <a href="direct_mod_range_hashing.html"><tt>direct_mod_range_hashing</tt></a>
+, and <tt>Resize_Policy</tt> = <a href="hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>
+ with <tt>Size_Policy</tt> = <a href="hash_prime_size_policy.html"><tt>hash_prime_size_policy</tt></a>
+, and <tt>Trigger_Policy</tt> = <a href="hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>
+ with <i>&alpha;<sub>min</sub></i> = <i>1/8</i> and <i>&alpha;<sub>max</sub></i> = <i>1/2</i></li>
+<li>
+cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_map-
+<a href="cc_hash_table.html"><tt>cc_hash_table</tt></a>
+with <tt>Comb_Hash_Fn</tt> = <a href="direct_mask_range_hashing.html"><tt>direct_mask_range_hashing</tt></a>
+, and <tt>Resize_Policy</tt> = <a href="hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>
+ with <tt>Size_Policy</tt> = <a href="hash_exponential_size_policy.html"><tt>hash_exponential_size_policy</tt></a>
+, and <tt>Trigger_Policy</tt> = <a href="hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>
+ with <i>&alpha;<sub>min</sub></i> = <i>1/8</i> and <i>&alpha;<sub>max</sub></i> = <i>1/2</i></li>
+<li>
+gp_hash_mask_linp_exp_nea_lc_1div8_1div2_nsth_map-
+<a href="gp_hash_table.html"><tt>gp_hash_table</tt></a>
+ with <tt>Comb_Hash_Fn</tt> = <a href="direct_mask_range_hashing.html"><tt>direct_mask_range_hashing</tt></a>
+, <tt>Resize_Policy</tt> = <a href="hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>
+ with <tt>Size_Policy</tt> = <a href="hash_exponential_size_policy.html"><tt>hash_exponential_size_policy</tt></a>
+, and <tt>Trigger_Policy</tt> = <a href="hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>
+ with <i>&alpha;<sub>min</sub></i> = <i>1/8</i> and <i>&alpha;<sub>max</sub></i> = <i>1/2</i>, and <tt>Probe_Fn</tt> = <a href="linear_probe_fn.html"><tt>linear_probe_fn</tt></a>
+</li>
+</ol>
+</div><div style="width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<div id="CCGPM_res_div">
+<div id="CCGPM_msvc">
+<div id="CCGPM_ccgp_hash_random_int_subscript_timing_test_insert">
+<div id="CCGPM_assoc">
+<div id="CCGPM_Collision-chaining_and_probing_hash_random_int_insert_timing_test_using__tt__b_operator_455b__455tt_"><div style="border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="CCGPM" id="CCGPM"><img src="ccgp_hash_random_int_subscript_timing_test_insert_msvc.png" alt="no image" /></a></h6>CCGPM: Collision-chaining and probing hash random int insert timing test using <tt><b>operator</b></tt> - <a href="assoc_performance_tests.html#msvc">msvc++</a><p>In the above figure, the names in the legends have the following meaning:</p>
+<ol>
+<li>
+cc_hash_mod_prime_nea_lc_1div8_1div2_nsth_map-
+<a href="cc_hash_table.html"><tt>cc_hash_table</tt></a>
+with <tt>Comb_Hash_Fn</tt> = <a href="direct_mod_range_hashing.html"><tt>direct_mod_range_hashing</tt></a>
+, and <tt>Resize_Policy</tt> = <a href="hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>
+ with <tt>Size_Policy</tt> = <a href="hash_prime_size_policy.html"><tt>hash_prime_size_policy</tt></a>
+, and <tt>Trigger_Policy</tt> = <a href="hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>
+ with <i>&alpha;<sub>min</sub></i> = <i>1/8</i> and <i>&alpha;<sub>max</sub></i> = <i>1/2</i></li>
+<li>
+cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_map-
+<a href="cc_hash_table.html"><tt>cc_hash_table</tt></a>
+with <tt>Comb_Hash_Fn</tt> = <a href="direct_mask_range_hashing.html"><tt>direct_mask_range_hashing</tt></a>
+, and <tt>Resize_Policy</tt> = <a href="hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>
+ with <tt>Size_Policy</tt> = <a href="hash_exponential_size_policy.html"><tt>hash_exponential_size_policy</tt></a>
+, and <tt>Trigger_Policy</tt> = <a href="hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>
+ with <i>&alpha;<sub>min</sub></i> = <i>1/8</i> and <i>&alpha;<sub>max</sub></i> = <i>1/2</i></li>
+<li>
+gp_hash_mod_quadp_prime_nea_lc_1div8_1div2_nsth_map-
+<a href="gp_hash_table.html"><tt>gp_hash_table</tt></a>
+ with <tt>Comb_Hash_Fn</tt> = <a href="direct_mod_range_hashing.html"><tt>direct_mod_range_hashing</tt></a>
+, <tt>Resize_Policy</tt> = <a href="hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>
+ with <tt>Size_Policy</tt> = <a href="hash_prime_size_policy.html"><tt>hash_prime_size_policy</tt></a>
+, and <tt>Trigger_Policy</tt> = <a href="hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>
+ with <i>&alpha;<sub>min</sub></i> = <i>1/8</i> and <i>&alpha;<sub>max</sub></i> = <i>1/2</i>, and <tt>Probe_Fn</tt> = <a href="quadratic_probe_fn.html"><tt>quadratic_probe_fn</tt></a>
+</li>
+<li>
+gp_hash_mask_linp_exp_nea_lc_1div8_1div2_nsth_map-
+<a href="gp_hash_table.html"><tt>gp_hash_table</tt></a>
+ with <tt>Comb_Hash_Fn</tt> = <a href="direct_mask_range_hashing.html"><tt>direct_mask_range_hashing</tt></a>
+, <tt>Resize_Policy</tt> = <a href="hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>
+ with <tt>Size_Policy</tt> = <a href="hash_exponential_size_policy.html"><tt>hash_exponential_size_policy</tt></a>
+, and <tt>Trigger_Policy</tt> = <a href="hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>
+ with <i>&alpha;<sub>min</sub></i> = <i>1/8</i> and <i>&alpha;<sub>max</sub></i> = <i>1/2</i>, and <tt>Probe_Fn</tt> = <a href="linear_probe_fn.html"><tt>linear_probe_fn</tt></a>
+</li>
+</ol>
+</div><div style="width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<div id="CCGPL_res_div">
+<div id="CCGPL_local">
+<div id="CCGPL_ccgp_hash_random_int_subscript_timing_test_insert">
+<div id="CCGPL_assoc">
+<div id="CCGPL_Collision-chaining_and_probing_hash_random_int_insert_timing_test_using__tt__b_operator_455b__455tt_"><div style = "border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="CCGPL" id= "CCGPL"><img src="ccgp_hash_random_int_subscript_timing_test_insert_local.png" alt="no image" /></a></h6>CCGPL: Collision-chaining and probing hash random int insert timing test using <tt><b>operator</b></tt> - <a href = "assoc_performance_tests.html#local">local</a></div><div style = "width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<h2><a name="observations" id="observations">Observations</a></h2>
+<p>In this setting, as in <a href="hash_text_find_find_timing_test.html">Hash-Based Text
+    <tt>find</tt> Find Timing Test</a> and <a href="hash_random_int_find_find_timing_test.html">Hash-Based
+    Random-Integer <tt>find</tt> Find Timing Test</a> , the choice
+    of underlying hash-table underlying hash-table (see <a href="hash_based_containers.html">Design::Associative
+    Containers::Hash-Based Containers</a> ) affects performance
+    most, then the range-hashing scheme (See <a href="hash_based_containers.html#hash_policies">Design::Associative
+    Containers::Hash-Based Containers::Hash Policies</a> ), and,
+    only finally, other policies.</p>
+<p>There are some differences, however:</p>
+<ol>
+<li>In this setting, probing tables function sometimes more
+      efficiently than collision-chaining tables (see Figures
+      <a href="#CCGPG">CCGPG</a> and <a href="#CCGPM">CCGPM</a> ).
+      This is explained shortly.</li>
+<li>The performance graphs have a "saw-tooth" shape. The
+      average insert time rises and falls. As values are inserted
+      into the container, the load factor grows larger. Eventually,
+      a resize occurs. The reallocations and rehashing are
+      relatively expensive. After this, the load factor is smaller
+      than before.</li>
+</ol>
+<p>Collision-chaining containers use indirection for greater
+    flexibility; probing containers store values contiguously, in
+    an array (see Figure <a href="motivation.html#different_underlying_data_structures">Motivation::Different
+    underlying data structures</a> A and B, respectively). It
+    follows that for simple data types, probing containers access
+    their allocator less frequently than collision-chaining
+    containers, (although they still have less efficient probing
+    sequences). This explains why some probing containers fare
+    better than collision-chaining containers in this case.</p>
+<p>Within each type of hash-table, the range-hashing scheme
+    affects performance more than other policies. This is similar
+    to the situation in <a href="hash_text_find_find_timing_test.html">Hash-Based Text
+    <tt>find</tt> Find Timing Test</a> and <a href="hash_random_int_find_find_timing_test.html">Hash-Based
+    Random-Integer <tt>find</tt> Find Timing Test</a>.
+    Unsurprisingly, however, containers with <u>lower</u>
+<i>alpha<sub>max</sub></i> perform <u>worse</u> in this case,
+    since more re-hashes are performed.</p>
+<p><a href="assoc_performance_tests.html#hash_based_types">Observations::Hash-Based
+    Container Types</a> summarizes some observations on hash-based
+    containers; <a href="assoc_performance_tests.html#hash_based_policies">Observations::Hash-Based
+    Containers' Policies</a> summarizes some observations on
+    hash-based containers' policies.</p>
+</div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/hash_range_hashing_seq_diagram.png b/libstdc++-v3/docs/html/ext/pb_ds/hash_range_hashing_seq_diagram.png
new file mode 100644
index 00000000000..5c37407dda6
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/hash_range_hashing_seq_diagram.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/hash_range_hashing_seq_diagram2.png b/libstdc++-v3/docs/html/ext/pb_ds/hash_range_hashing_seq_diagram2.png
new file mode 100644
index 00000000000..87763caacc7
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/hash_range_hashing_seq_diagram2.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/hash_ranged_hash_range_hashing_fns.png b/libstdc++-v3/docs/html/ext/pb_ds/hash_ranged_hash_range_hashing_fns.png
new file mode 100644
index 00000000000..5e0d7f4037b
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/hash_ranged_hash_range_hashing_fns.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/hash_standard_resize_policy.html b/libstdc++-v3/docs/html/ext/pb_ds/hash_standard_resize_policy.html
new file mode 100644
index 00000000000..70d6086d503
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/hash_standard_resize_policy.html
@@ -0,0 +1,795 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+  <meta name="generator" content=
+  "HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+
+  <title>hash_standard_resize_policy Interface</title>
+  <meta http-equiv="Content-Type" content=
+  "text/html; charset=us-ascii" />
+  </head>
+
+<body>
+  <div id="page">
+    <h1><tt>hash_standard_resize_policy</tt> Interface</h1>
+
+    <p>A resize policy which delegates operations to size and
+    trigger policies.</p>
+
+    <p>Defined in: <a href=
+    "../../../../include/ext/pb_ds/hash_policy.hpp"><tt>hash_policy.hpp</tt></a></p>
+
+    <h2><a name="link1" id="link1">Template Parameters</a></h2>
+
+    <table class="c1" width="100%" border="1" summary=
+    "Template Parameters">
+      <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_Policy1072992366" id=
+"Size_Policy1072992366"><b>class</b> Size_Policy </a>
+</pre>
+        </td>
+
+        <td>
+          <p>Size policy type.</p>
+        </td>
+
+        <td><a href=
+        "hash_exponential_size_policy.html"><span class="c2"><tt>hash_exponential_size_policy</tt></span></a></td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="Trigger_Policy3611271815" id=
+"Trigger_Policy3611271815"><b>class</b> Trigger_Policy </a>
+</pre>
+        </td>
+
+        <td>
+          <p>Trigger policy type.</p>
+        </td>
+
+        <td><a href=
+        "hash_load_check_resize_trigger.html"><span class=
+        "c2"><tt>hash_load_check_resize_trigger</tt></span></a></td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="External_Size_Access1380482982" id=
+"External_Size_Access1380482982"><b>bool</b> 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_Type42920436" id=
+"Size_Type42920436"><b>typename</b> Size_Type </a>
+</pre>
+        </td>
+
+        <td>
+          <p>Size type.</p>
+        </td>
+
+        <td>size_t</td>
+      </tr>
+    </table>
+
+    <h2><a name="link2" id="link2">Base Classes</a></h2>
+
+    <table class="c1" width="100%" border="1" summary="Bases">
+      <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_Policy1072992366"><tt>Size_Policy</tt></a>
+</pre>
+        </td>
+
+        <td>
+          <p>public</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a href="#Trigger_Policy3611271815"><tt>Trigger_Policy</tt></a>
+</pre>
+        </td>
+
+        <td>
+          <p>public</p>
+        </td>
+      </tr>
+    </table>
+
+    <h2><a name="link3" id="link3">Public Types and
+    Constants</a></h2>
+
+    <h3><a name="link4" id="link4">General Definitions</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Types">
+      <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_type55424436" id="size_type55424436">size_type</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<a href="#Size_Type42920436"><tt>Size_Type</tt></a>
+</pre>
+        </td>
+
+        <td>
+          <p>Size type.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h3><a name="link5" id="link5">Policy Definitions</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Types">
+      <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_policy4019166151" id=
+"trigger_policy4019166151">trigger_policy</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<a href="#Trigger_Policy3611271815"><tt>Trigger_Policy</tt></a>
+</pre>
+        </td>
+
+        <td>
+          <p>Trigger policy type.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="size_policy1385592366" id=
+"size_policy1385592366">size_policy</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<a href="#Size_Policy1072992366"><tt>Size_Policy</tt></a>
+</pre>
+        </td>
+
+        <td>
+          <p>Size policy type.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="external_size_access4043083014" id=
+"external_size_access4043083014">external_size_access</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<a href=
+"#External_Size_Access1380482982"><tt>External_Size_Access</tt></a>
+</pre>
+        </td>
+
+        <td>
+          <p>Indicates whether sizes can be accessed
+          externally.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h2><a name="link6" id="link6">Public Methods</a></h2>
+
+    <h3><a name="link7" id="link7">Constructors, Destructor, and
+    Related</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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
+  ()
+</pre>
+        </td>
+
+        <td>
+          <p>Default constructor.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+  hash_standard_resize_policy
+  (<b>const</b> <a href=
+"#Size_Policy1072992366"><tt>Size_Policy</tt></a> &amp;r_size_policy)
+</pre>
+        </td>
+
+        <td>
+          <p>constructor taking some policies <span class=
+          "c1"><tt>r_size_policy</tt></span> will be copied by the
+          <a href="#Size_Policy1072992366"><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_Policy1072992366"><tt>Size_Policy</tt></a> &amp;r_size_policy,
+    <b>const</b> <a href=
+"#Trigger_Policy3611271815"><tt>Trigger_Policy</tt></a> &amp;r_trigger_policy)
+</pre>
+        </td>
+
+        <td>
+          <p>constructor taking some policies. <span class=
+          "c1"><tt>r_size_policy</tt></span> will be copied by the
+          <a href="#Size_Policy1072992366"><tt>Size_Policy</tt></a>
+          object of this object. <span class=
+          "c1"><tt>r_trigger_policy</tt></span> will be copied by
+          the <a href=
+          "#Trigger_Policy3611271815"><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
+  (<span class=
+"c2"><tt>hash_standard_resize_policy</tt></span> &amp;other)
+</pre>
+        </td>
+
+        <td>
+          <p>Swaps content.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h3><a name="link8" id="link8">Policy Access Methods</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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_Policy1072992366"><tt>Size_Policy</tt></a> &amp;
+  get_size_policy
+  ()
+</pre>
+        </td>
+
+        <td>
+          <p>Access to the <a href=
+          "#Size_Policy1072992366"><tt>Size_Policy</tt></a> object
+          used.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<b>const</b> <a href=
+"#Size_Policy1072992366"><tt>Size_Policy</tt></a> &amp;
+  get_size_policy
+  () <b>const</b>
+</pre>
+        </td>
+
+        <td>
+          <p>Const access to the <a href=
+          "#Size_Policy1072992366"><tt>Size_Policy</tt></a> object
+          used.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a href=
+"#Trigger_Policy3611271815"><tt>Trigger_Policy</tt></a> &amp;
+  get_trigger_policy
+  ()
+</pre>
+        </td>
+
+        <td>
+          <p>Access to the <a href=
+          "#Trigger_Policy3611271815"><tt>Trigger_Policy</tt></a>
+          object used.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<b>const</b> <a href=
+"#Trigger_Policy3611271815"><tt>Trigger_Policy</tt></a> &amp;
+  get_trigger_policy
+  () <b>const</b>
+</pre>
+        </td>
+
+        <td>
+          <p>Access to the <a href=
+          "#Trigger_Policy3611271815"><tt>Trigger_Policy</tt></a>
+          object used.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h3><a name="link9" id="link9">Size Access Methods</a></h3>
+
+    <p>These methods are available only if the external size
+    parameter indicates that external size access is allowed.</p>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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_type55424436"><tt>size_type</tt></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_Access1380482982"><tt>External_Size_Access</tt></a>
+          == <tt><b>false</b></tt>.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<b>void</b> 
+  resize
+  (<a href=
+"#size_type55424436"><tt>size_type</tt></a> suggested_new_size)
+</pre>
+        </td>
+
+        <td>
+          <p>Resizes the container to <span class=
+          "c1"><tt>suggested_new_size</tt></span>, a suggested size
+          (the actual size will be determined by the <a href=
+          "#Size_Policy1072992366"><tt>Size_Policy</tt></a>
+          object).</p>
+
+          <p>Calling this method will not compile when <a href=
+          "#External_Size_Access1380482982"><tt>External_Size_Access</tt></a>
+          == <tt><b>false</b></tt>.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h2><a name="link10" id="link10">Protected Methods</a></h2>
+
+    <h3><a name="link11" id="link11">Insert Search
+    Notifications.</a></h3>
+
+    <p>Notifications called during an insert operation.</p>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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>
+
+    <h3><a name="link12" id="link12">Find Search
+    Notifications.</a></h3>
+
+    <p>Notifications called during a find operation.</p>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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>
+
+    <h3><a name="link13" id="link13">Erase Search
+    Notifications.</a></h3>
+
+    <p>Notifications called during an insert operation.</p>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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>
+
+    <h3><a name="link14" id="link14">Content Change
+    Notifications</a></h3>
+
+    <p>Notifications called when the content of the table changes
+    in a way that can affect the resize policy.</p>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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_type55424436"><tt>size_type</tt></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_type55424436"><tt>size_type</tt></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>
+
+    <h3><a name="link15" id="link15">Size Change
+    Notifications</a></h3>
+
+    <p>Notifications called when the table changes size.</p>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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_type55424436"><tt>size_type</tt></a> new_size)
+</pre>
+        </td>
+
+        <td>
+          <p>Notifies the table was resized to <span class=
+          "c1"><tt>new_size</tt></span>.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h3><a name="link16" id="link16">Queries</a></h3>
+
+    <p>Called to query whether/how to resize.</p>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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>
+<a href="#size_type55424436"><tt>size_type</tt></a>
+  get_new_size
+  (<a href="#size_type55424436"><tt>size_type</tt></a> size, 
+    <a href=
+"#size_type55424436"><tt>size_type</tt></a> num_used_e) <b>const</b>
+</pre>
+        </td>
+
+        <td>
+          <p>Queries what the new <span class=
+          "c1"><tt>size</tt></span> should be, when the container
+          is resized naturally. The current size of the container
+          is <span class="c1"><tt>size</tt></span>, and the number
+          of used entries within the container is <span class=
+          "c1"><tt>num_used_e</tt></span>.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h2><a name="link17" id="link17">Private Methods</a></h2>
+
+    <h3><a name="link18" id="link18">Overrides</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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
+  (<a href="#size_type55424436"><tt>size_type</tt></a> new_size)
+</pre>
+        </td>
+
+        <td>
+          <p>Resizes to <span class=
+          "c1"><tt>new_size</tt></span>.</p>
+        </td>
+      </tr>
+    </table>
+  </div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/hash_text_find_find_timing_test.html b/libstdc++-v3/docs/html/ext/pb_ds/hash_text_find_find_timing_test.html
new file mode 100644
index 00000000000..fafa245a93f
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/hash_text_find_find_timing_test.html
@@ -0,0 +1,164 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml">
+<head>
+<meta name="generator" content="HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+<title>Hash Text Find Timing Test</title>
+<meta http-equiv="Content-Type" content="text/html; charset=us-ascii" />
+</head>
+<body>
+<div id="page">
+<h1>Hash-Based Text <tt>find</tt> Find Timing Test</h1>
+<h2><a name="description" id="description">Description</a></h2>
+<p>This test inserts a number of values with keys from an
+    arbitrary text ([ <a href="references.html#wickland96thirty">wickland96thirty</a> ]) into
+    a container, then performs a series of finds using
+    <tt>find</tt> . It measures the average time for <tt>find</tt>
+    as a function of the number of values inserted.</p>
+<p>(The test was executed with <a href="../../../../testsuite/performance/ext/pb_ds/text_find_timing.cc"><tt>text_find_timing_test</tt></a>
+    thirty_years_among_the_dead_preproc.txt 200 200 2100)</p>
+<h2><a name="purpose" id="purpose">Purpose</a></h2>
+<p>The test checks the effect of different range-hashing
+    functions, trigger policies, and cache-hashing policies (see
+    <a href="hash_based_containers.html#hash_policies">Design::Associative
+    Containers::Associative Containers::Hash-Based Containers::Hash
+    Policies</a> and <a href="hash_based_containers.html#resize_policies">Design::Associative
+    Containers::Hash-Based Containers::Resize Policies</a> ).</p>
+<h2><a name="results" id="results">Results</a></h2>
+<p>Figures <a href="#NCCG">NCCG</a>, <a href="#NCCM">NCCM</a>
+    and <a href="#NCCL">NCCL</a> show the results for the native
+    and collision-chaining types in <a href="assoc_performance_tests.html#gcc"><u>g++</u></a>, <a href="assoc_performance_tests.html#msvc"><u>msvc++</u></a>, and
+    <a href="assoc_performance_tests.html#local"><u>local</u></a>,
+    respetively.</p>
+<div id="NCCG_res_div">
+<div id="NCCG_gcc">
+<div id="NCCG_text_find_timing_test_hash">
+<div id="NCCG_assoc">
+<div id="NCCG_Native_and_collision-chaining_hash_text_find_timing_test_using__tt_find_455tt_"><div style="border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NCCG" id="NCCG"><img src="text_find_timing_test_hash_gcc.png" alt="no image" /></a></h6>NCCG: Native and collision-chaining hash text find timing test using <tt>find</tt> - <a href="assoc_performance_tests.html#gcc">g++</a><p>In the above figure, the names in the legends have the following meaning:</p>
+<ol>
+<li>
+n_hash_map_ncah-
+<tt>std::tr1::unordered_map</tt> with <tt>cache_hash_code</tt> = <tt><b>false</b></tt></li>
+<li>
+cc_hash_mod_prime_nea_lc_1div8_1div1_nsth_map-
+<a href="cc_hash_table.html"><tt>cc_hash_table</tt></a>
+with <tt>Comb_Hash_Fn</tt> = <a href="direct_mod_range_hashing.html"><tt>direct_mod_range_hashing</tt></a>
+, and <tt>Resize_Policy</tt> = <a href="hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>
+ with <tt>Size_Policy</tt> = <a href="hash_prime_size_policy.html"><tt>hash_prime_size_policy</tt></a>
+, and <tt>Trigger_Policy</tt> = <a href="hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>
+ with <i>&alpha;<sub>min</sub></i> = <i>1/8</i> and <i>&alpha;<sub>max</sub></i> = <i>1/1</i></li>
+<li>
+cc_hash_mask_exp_nea_lc_1div8_1div2_sth_map-
+<a href="cc_hash_table.html"><tt>cc_hash_table</tt></a>
+with <tt>Comb_Hash_Fn</tt> = <a href="direct_mask_range_hashing.html"><tt>direct_mask_range_hashing</tt></a>
+, and <tt>Resize_Policy</tt> = <a href="hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>
+ with <tt>Size_Policy</tt> = <a href="hash_exponential_size_policy.html"><tt>hash_exponential_size_policy</tt></a>
+, and <tt>Trigger_Policy</tt> = <a href="hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>
+ with <i>&alpha;<sub>min</sub></i> = <i>1/8</i> and <i>&alpha;<sub>max</sub></i> = <i>1/2</i></li>
+<li>
+cc_hash_mask_exp_nea_lc_1div8_1div1_nsth_map-
+<a href="cc_hash_table.html"><tt>cc_hash_table</tt></a>
+with <tt>Comb_Hash_Fn</tt> = <a href="direct_mask_range_hashing.html"><tt>direct_mask_range_hashing</tt></a>
+, and <tt>Resize_Policy</tt> = <a href="hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>
+ with <tt>Size_Policy</tt> = <a href="hash_exponential_size_policy.html"><tt>hash_exponential_size_policy</tt></a>
+, and <tt>Trigger_Policy</tt> = <a href="hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>
+ with <i>&alpha;<sub>min</sub></i> = <i>1/8</i> and <i>&alpha;<sub>max</sub></i> = <i>1/1</i></li>
+<li>
+cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_map-
+<a href="cc_hash_table.html"><tt>cc_hash_table</tt></a>
+with <tt>Comb_Hash_Fn</tt> = <a href="direct_mask_range_hashing.html"><tt>direct_mask_range_hashing</tt></a>
+, and <tt>Resize_Policy</tt> = <a href="hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>
+ with <tt>Size_Policy</tt> = <a href="hash_exponential_size_policy.html"><tt>hash_exponential_size_policy</tt></a>
+, and <tt>Trigger_Policy</tt> = <a href="hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>
+ with <i>&alpha;<sub>min</sub></i> = <i>1/8</i> and <i>&alpha;<sub>max</sub></i> = <i>1/2</i></li>
+</ol>
+</div><div style="width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<div id="NCCM_res_div">
+<div id="NCCM_msvc">
+<div id="NCCM_text_find_timing_test_hash">
+<div id="NCCM_assoc">
+<div id="NCCM_Native_and_collision-chaining_hash_text_find_timing_test_using__tt_find_455tt_"><div style="border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NCCM" id="NCCM"><img src="text_find_timing_test_hash_msvc.png" alt="no image" /></a></h6>NCCM: Native and collision-chaining hash text find timing test using <tt>find</tt> - <a href="assoc_performance_tests.html#msvc">msvc++</a><p>In the above figure, the names in the legends have the following meaning:</p>
+<ol>
+<li>
+n_hash_map_ncah-
+<tt>stdext::hash_map</tt></li>
+<li>
+cc_hash_mod_prime_nea_lc_1div8_1div1_nsth_map-
+<a href="cc_hash_table.html"><tt>cc_hash_table</tt></a>
+with <tt>Comb_Hash_Fn</tt> = <a href="direct_mod_range_hashing.html"><tt>direct_mod_range_hashing</tt></a>
+, and <tt>Resize_Policy</tt> = <a href="hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>
+ with <tt>Size_Policy</tt> = <a href="hash_prime_size_policy.html"><tt>hash_prime_size_policy</tt></a>
+, and <tt>Trigger_Policy</tt> = <a href="hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>
+ with <i>&alpha;<sub>min</sub></i> = <i>1/8</i> and <i>&alpha;<sub>max</sub></i> = <i>1/1</i></li>
+<li>
+cc_hash_mask_exp_nea_lc_1div8_1div1_nsth_map-
+<a href="cc_hash_table.html"><tt>cc_hash_table</tt></a>
+with <tt>Comb_Hash_Fn</tt> = <a href="direct_mask_range_hashing.html"><tt>direct_mask_range_hashing</tt></a>
+, and <tt>Resize_Policy</tt> = <a href="hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>
+ with <tt>Size_Policy</tt> = <a href="hash_exponential_size_policy.html"><tt>hash_exponential_size_policy</tt></a>
+, and <tt>Trigger_Policy</tt> = <a href="hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>
+ with <i>&alpha;<sub>min</sub></i> = <i>1/8</i> and <i>&alpha;<sub>max</sub></i> = <i>1/1</i></li>
+<li>
+cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_map-
+<a href="cc_hash_table.html"><tt>cc_hash_table</tt></a>
+with <tt>Comb_Hash_Fn</tt> = <a href="direct_mask_range_hashing.html"><tt>direct_mask_range_hashing</tt></a>
+, and <tt>Resize_Policy</tt> = <a href="hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>
+ with <tt>Size_Policy</tt> = <a href="hash_exponential_size_policy.html"><tt>hash_exponential_size_policy</tt></a>
+, and <tt>Trigger_Policy</tt> = <a href="hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>
+ with <i>&alpha;<sub>min</sub></i> = <i>1/8</i> and <i>&alpha;<sub>max</sub></i> = <i>1/2</i></li>
+<li>
+cc_hash_mask_exp_nea_lc_1div8_1div2_sth_map-
+<a href="cc_hash_table.html"><tt>cc_hash_table</tt></a>
+with <tt>Comb_Hash_Fn</tt> = <a href="direct_mask_range_hashing.html"><tt>direct_mask_range_hashing</tt></a>
+, and <tt>Resize_Policy</tt> = <a href="hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>
+ with <tt>Size_Policy</tt> = <a href="hash_exponential_size_policy.html"><tt>hash_exponential_size_policy</tt></a>
+, and <tt>Trigger_Policy</tt> = <a href="hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>
+ with <i>&alpha;<sub>min</sub></i> = <i>1/8</i> and <i>&alpha;<sub>max</sub></i> = <i>1/2</i></li>
+</ol>
+</div><div style="width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<div id="NCCL_res_div">
+<div id="NCCL_local">
+<div id="NCCL_text_find_timing_test_hash">
+<div id="NCCL_assoc">
+<div id="NCCL_Native_and_collision-chaining_hash_text_find_timing_test_using__tt_find_455tt_"><div style = "border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NCCL" id= "NCCL"><img src="text_find_timing_test_hash_local.png" alt="no image" /></a></h6>NCCL: Native and collision-chaining hash text find timing test using <tt>find</tt> - <a href = "assoc_performance_tests.html#local">local</a></div><div style = "width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<h2><a name="observations" id="observations">Observations</a></h2>
+<p>In this setting, the range-hashing scheme (See <a href="hash_based_containers.html#hash_policies">Design::Associative
+    Containers::Hash-Based Containers::Hash Policies</a> ) affects
+    performance more than other policies. As Figure <a href="#NCCG">NCCG</a> shows, containers using mod-based
+    range-hashing (including the native hash-based container, which
+    is currently hard-wired to this scheme) have lower performance
+    than those using mask-based range-hashing. A modulo-based
+    range-hashing scheme's main benefit is that it takes into
+    account all hash-value bits. Standard string hash-functions are
+    designed to create hash values that are nearly-uniform as is [
+    <a href="references.html#knuth98sorting">knuth98sorting</a>
+    ].</p>
+<p>Trigger policies (see <a href="hash_based_containers.html#resize_policies">Design::Associative
+    Containers::Hash-Based Containers::Resize Policies</a> ),
+    <i>i.e.</i> the load-checks constants, affect performance to a
+    lesser extent.</p>
+<p>Perhaps surprisingly, storing the hash value alongside each
+    entry affects performance only marginally, at least in
+    <tt>pb_ds</tt> 's implementation. (Unfortunately, it was not
+    possible to run the tests with <tt>std::tr1::unordered_map</tt>
+    's <tt>cache_hash_code = <b>true</b></tt> , as it appeared to
+    malfuntion.)</p>
+<p><a href="assoc_performance_tests.html#hash_based_policies">Observations::Hash-Based
+    Containers' Policies</a> summarizes some observations on
+    hash-based containers' policies.</p>
+</div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/hash_zlob_random_int_find_find_timing_test.html b/libstdc++-v3/docs/html/ext/pb_ds/hash_zlob_random_int_find_find_timing_test.html
new file mode 100644
index 00000000000..f7156b1b7a6
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/hash_zlob_random_int_find_find_timing_test.html
@@ -0,0 +1,163 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+<meta name="generator" content="HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+<title>Hash Skewed Distribution Memory Use Test</title>
+<meta http-equiv="Content-Type" content="text/html; charset=us-ascii" />
+</head>
+<body>
+<div id="page">
+<h1>Hash-Based Skewed-Distribution Random-Integer <tt>find</tt>
+    Find Timing Test</h1>
+<h2><a name="description" id="description">Description</a></h2>
+<p>This test inserts a number of values with a markedly
+    non-uniform i.i.d. integer keys into a container, then performs
+    a series of finds using <tt>find</tt> . It measures the average
+    time for <tt>find</tt> as a function of the number of values in
+    the containers. The keys are generated as follows. First, a
+    uniform integer is created; it is then shifted left 8 bits.</p>
+<p>(The test was executed with <a href="../../../../testsuite/performance/ext/pb_ds/hash_zlob_random_int_find_timing.cc"><tt>hash_zlob_random_int_find_timing_test</tt></a>
+    200 200 2100)</p>
+<h2><a name="purpose" id="purpose">Purpose</a></h2>
+<p>The test checks the effect of different range-hashing
+    functions and trigger policies (see <a href="hash_based_containers.html#hash_policies">Design::Associative
+    Containers::Hash-Based Containers::Hash Policies</a> and
+    <a href="hash_based_containers.html#resize_policies">Design::Associative
+    Containers::Hash-Based Containers::Resize Policies</a>).</p>
+<h2><a name="results" id="results">Results</a></h2>
+<p>Figures <a href="#NHG">NHG</a>, <a href="#NHM">NHM</a>, and
+    <a href="#NHL">NHL</a> show the results for various hash-based
+    associative-containers in <a href="assoc_performance_tests.html#gcc"><u>g++</u></a>, <a href="assoc_performance_tests.html#msvc"><u>MSVC++</u></a>, and
+    <a href="assoc_performance_tests.html#local"><u>local</u></a>,
+    respectively.</p>
+<div id="NHG_res_div">
+<div id="NHG_gcc">
+<div id="NHG_hash_zlob_random_int_find_timing_test">
+<div id="NHG_assoc">
+<div id="NHG_Skewed-distribution_random_int_find_timing_test_using__tt_find_455tt_"><div style="border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NHG" id="NHG"><img src="hash_zlob_random_int_find_timing_test_gcc.png" alt="no image" /></a></h6>NHG: Skewed-distribution random int find timing test using <tt>find</tt> - <a href="assoc_performance_tests.html#gcc">g++</a><p>In the above figure, the names in the legends have the following meaning:</p>
+<ol>
+<li>
+cc_hash_mask_exp_nea_lc_1div8_1div1_nsth_map-
+<a href="cc_hash_table.html"><tt>cc_hash_table</tt></a>
+with <tt>Comb_Hash_Fn</tt> = <a href="direct_mask_range_hashing.html"><tt>direct_mask_range_hashing</tt></a>
+, and <tt>Resize_Policy</tt> = <a href="hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>
+ with <tt>Size_Policy</tt> = <a href="hash_exponential_size_policy.html"><tt>hash_exponential_size_policy</tt></a>
+, and <tt>Trigger_Policy</tt> = <a href="hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>
+ with <i>&alpha;<sub>min</sub></i> = <i>1/8</i> and <i>&alpha;<sub>max</sub></i> = <i>1/1</i></li>
+<li>
+gp_hash_mod_quadp_prime_nea_lc_1div8_1div2_nsth_map-
+<a href="gp_hash_table.html"><tt>gp_hash_table</tt></a>
+ with <tt>Comb_Hash_Fn</tt> = <a href="direct_mod_range_hashing.html"><tt>direct_mod_range_hashing</tt></a>
+, <tt>Resize_Policy</tt> = <a href="hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>
+ with <tt>Size_Policy</tt> = <a href="hash_prime_size_policy.html"><tt>hash_prime_size_policy</tt></a>
+, and <tt>Trigger_Policy</tt> = <a href="hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>
+ with <i>&alpha;<sub>min</sub></i> = <i>1/8</i> and <i>&alpha;<sub>max</sub></i> = <i>1/2</i>, and <tt>Probe_Fn</tt> = <a href="quadratic_probe_fn.html"><tt>quadratic_probe_fn</tt></a>
+</li>
+<li>
+n_hash_map_ncah-
+<tt>std::tr1::unordered_map</tt> with <tt>cache_hash_code</tt> = <tt><b>false</b></tt></li>
+<li>
+cc_hash_mod_prime_nea_lc_1div8_1div1_nsth_map-
+<a href="cc_hash_table.html"><tt>cc_hash_table</tt></a>
+with <tt>Comb_Hash_Fn</tt> = <a href="direct_mod_range_hashing.html"><tt>direct_mod_range_hashing</tt></a>
+, and <tt>Resize_Policy</tt> = <a href="hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>
+ with <tt>Size_Policy</tt> = <a href="hash_prime_size_policy.html"><tt>hash_prime_size_policy</tt></a>
+, and <tt>Trigger_Policy</tt> = <a href="hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>
+ with <i>&alpha;<sub>min</sub></i> = <i>1/8</i> and <i>&alpha;<sub>max</sub></i> = <i>1/1</i></li>
+</ol>
+</div><div style="width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<div id="NHM_res_div">
+<div id="NHM_msvc">
+<div id="NHM_hash_zlob_random_int_find_timing_test">
+<div id="NHM_assoc">
+<div id="NHM_Skewed-distribution_random_int_find_timing_test_using__tt_find_455tt_"><div style="border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NHM" id="NHM"><img src="hash_zlob_random_int_find_timing_test_msvc.png" alt="no image" /></a></h6>NHM: Skewed-distribution random int find timing test using <tt>find</tt> - <a href="assoc_performance_tests.html#msvc">msvc++</a><p>In the above figure, the names in the legends have the following meaning:</p>
+<ol>
+<li>
+n_hash_map_ncah-
+<tt>stdext::hash_map</tt></li>
+<li>
+cc_hash_mask_exp_nea_lc_1div8_1div1_nsth_map-
+<a href="cc_hash_table.html"><tt>cc_hash_table</tt></a>
+with <tt>Comb_Hash_Fn</tt> = <a href="direct_mask_range_hashing.html"><tt>direct_mask_range_hashing</tt></a>
+, and <tt>Resize_Policy</tt> = <a href="hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>
+ with <tt>Size_Policy</tt> = <a href="hash_exponential_size_policy.html"><tt>hash_exponential_size_policy</tt></a>
+, and <tt>Trigger_Policy</tt> = <a href="hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>
+ with <i>&alpha;<sub>min</sub></i> = <i>1/8</i> and <i>&alpha;<sub>max</sub></i> = <i>1/1</i></li>
+<li>
+gp_hash_mod_quadp_prime_nea_lc_1div8_1div2_nsth_map-
+<a href="gp_hash_table.html"><tt>gp_hash_table</tt></a>
+ with <tt>Comb_Hash_Fn</tt> = <a href="direct_mod_range_hashing.html"><tt>direct_mod_range_hashing</tt></a>
+, <tt>Resize_Policy</tt> = <a href="hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>
+ with <tt>Size_Policy</tt> = <a href="hash_prime_size_policy.html"><tt>hash_prime_size_policy</tt></a>
+, and <tt>Trigger_Policy</tt> = <a href="hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>
+ with <i>&alpha;<sub>min</sub></i> = <i>1/8</i> and <i>&alpha;<sub>max</sub></i> = <i>1/2</i>, and <tt>Probe_Fn</tt> = <a href="quadratic_probe_fn.html"><tt>quadratic_probe_fn</tt></a>
+</li>
+<li>
+cc_hash_mod_prime_nea_lc_1div8_1div1_nsth_map-
+<a href="cc_hash_table.html"><tt>cc_hash_table</tt></a>
+with <tt>Comb_Hash_Fn</tt> = <a href="direct_mod_range_hashing.html"><tt>direct_mod_range_hashing</tt></a>
+, and <tt>Resize_Policy</tt> = <a href="hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>
+ with <tt>Size_Policy</tt> = <a href="hash_prime_size_policy.html"><tt>hash_prime_size_policy</tt></a>
+, and <tt>Trigger_Policy</tt> = <a href="hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>
+ with <i>&alpha;<sub>min</sub></i> = <i>1/8</i> and <i>&alpha;<sub>max</sub></i> = <i>1/1</i></li>
+</ol>
+</div><div style="width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<div id="NHL_res_div">
+<div id="NHL_local">
+<div id="NHL_hash_zlob_random_int_find_timing_test">
+<div id="NHL_assoc">
+<div id="NHL_Skewed-distribution_random_int_find_timing_test_using__tt_find_455tt_"><div style = "border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NHL" id= "NHL"><img src="hash_zlob_random_int_find_timing_test_local.png" alt="no image" /></a></h6>NHL: Skewed-distribution random int find timing test using <tt>find</tt> - <a href = "assoc_performance_tests.html#local">local</a></div><div style = "width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<h2><a name="observations" id="observations">Observations</a></h2>
+<p>In this setting, the keys' distribution is so skewed that
+    the unerlying hash-table type affects performance marginally.
+    (This is in contrast with <a href="hash_text_find_find_timing_test.html">Hash-Based Text
+    <tt>find</tt> Find Timing Test</a> , <a href="hash_random_int_find_find_timing_test.html">Hash-Based
+    Random-Integer <tt>find</tt> Find Timing Test</a> , <a href="hash_random_int_subscript_find_timing_test.html">Hash-Based
+    Random-Integer Subscript Find Timing Test</a> and <a href="hash_random_int_subscript_insert_timing_test.html">Hash-Based
+    Random-Integer Subscript Insert Timing Test</a> .)</p>
+<p>The range-hashing scheme affects performance dramatically. A
+    mask-based range-hashing scheme effectively maps all values
+    into the same bucket. Access degenerates into a search within
+    an unordered linked-list. In Figures <a href="#NHG">NHG</a> and
+    <a href="#NHM">NHM</a> , it should be noted that
+    <tt>std::tr1::unordered_map</tt> and <tt>stdext::hash_map</tt>
+    are hard-wired currently to mod-based and mask-based schemes,
+    respectively.</p>
+<p>When observing the settings of this test, it is apparent
+    that the keys' distribution is far from natural. One might ask
+    if the test is not contrived to show that, in some cases,
+    mod-based range hashing does better than mask-based range
+    hashing. This is, in fact just the case. We did not encounter a
+    more natural case in which mod-based range hashing is better.
+    In our opnion, real-life key distributions are handled better
+    with an appropriate hash function and a mask-based
+    range-hashing function. (<a href="../../../../testsuite/ext/pb_ds/example/hash_shift_mask.cc"><tt>shift_mask.cc</tt></a>
+    shows an example of handling this a-priori known skewed
+    distribution with a mask-based range-hashing function). If hash
+    performance is bad, a <i>&Chi;<sup>2</sup></i> test can be used
+    to check how to transform it into a more uniform
+    distribution.</p>
+<p>For this reason, <tt>pb_ds</tt>'s default range-hashing
+    function is mask-based.</p>
+<p><a href="assoc_performance_tests.html#hash_based_types">Observations::Hash-Based
+    Container Types</a> summarizes some observations on hash-based
+    containers; <a href="assoc_performance_tests.html#hash_based_policies">Observations::Hash-Based
+    Containers' Policies</a> summarizes some observations on
+    hash-based containers' policies.</p>
+</div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/hash_zlob_random_int_find_timing_test_gcc.png b/libstdc++-v3/docs/html/ext/pb_ds/hash_zlob_random_int_find_timing_test_gcc.png
new file mode 100644
index 00000000000..8d170db1a2a
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/hash_zlob_random_int_find_timing_test_gcc.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/hash_zlob_random_int_find_timing_test_local.png b/libstdc++-v3/docs/html/ext/pb_ds/hash_zlob_random_int_find_timing_test_local.png
new file mode 100644
index 00000000000..0be2f00fa63
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/hash_zlob_random_int_find_timing_test_local.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/hash_zlob_random_int_find_timing_test_msvc.png b/libstdc++-v3/docs/html/ext/pb_ds/hash_zlob_random_int_find_timing_test_msvc.png
new file mode 100644
index 00000000000..874e7a780e6
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/hash_zlob_random_int_find_timing_test_msvc.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/index.html b/libstdc++-v3/docs/html/ext/pb_ds/index.html
new file mode 100644
index 00000000000..9288544d04c
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/index.html
@@ -0,0 +1,146 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+  <meta name="generator" content=
+  "HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+
+  <title>Policy-Based Data Structures</title>
+  <meta http-equiv="Content-Type" content=
+  "text/html; charset=us-ascii" />
+  </head>
+
+<body>
+  <div id="page">
+    <h1>Policy-Based Data Structures</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>This is a library of policy-based elementary
+    data structures: associative containers and priority queues. It
+    is designed for high-performance, flexibility, semantic safety,
+    and conformance to the corresponding containers in <tt>std</tt>
+    and std::tr1 (except for some points where it differs by
+    design).</p>
+
+    <p>The documentation is organized as follows:</p>
+
+    <ol>
+      <li>
+        <a href="introduction.html">Introductory</a>
+
+        <ol>
+          <li><a href="introduction.html">Introduction</a></li>
+
+          <li><a href="motivation.html">Motivation</a></li>
+
+          <li><a href="prerequisites.html">Usage
+          Prerequisites</a></li>
+        </ol>
+      </li>
+
+      <li>
+        <a href="interface.html">Interface</a>
+
+        <ol>
+          <li><a href="tutorial.html">Short Tutorial</a></li>
+
+          <li><a href="concepts.html">Concepts</a></li>
+
+          <li><a href="interface.html">Specifics</a</li>
+        </ol>
+      </li>
+
+      <li>
+        <a href="design.html">Design</a>
+
+        <ol>
+          <li>
+            <a href="assoc_design.html">Associative Containers</a>
+
+            <ol>
+              <li><a href="ds_gen.html">Data-Structure
+              Genericity and Interface</a> </li>
+
+              <li><a href="tree_based_containers.html">Tree-Based
+              Containers</a></li>
+
+              <li><a href="trie_based_containers.html">Trie-Based
+              Containers</a></li>
+
+              <li><a href="hash_based_containers.html">Hash-Based
+              Containers</a></li>
+
+              <li><a href="lu_based_containers.html">List-Based
+              Containers</a> </li>
+            </ol>
+          </li>
+
+          <li><a href="pq_design.html">Priority Queues</a></li>
+        </ol>
+      </li>
+
+      <li>
+        <a href="examples.html">Examples</a>
+
+        <ol>
+          <li><a href="assoc_examples.html">Associative
+          Containers</a></li>
+
+          <li><a href="pq_examples.html">Priority Queues</a></li>
+        </ol>
+      </li>
+
+      <li>
+        <a href="tests.html">Tests</a>
+
+        <ol>
+          <li>
+            <a href="assoc_tests.html">Associative Containers</a>
+
+            <ol>
+              <li><a href="assoc_regression_tests.html">Regression
+              Tests</a></li>
+
+              <li><a href=
+              "assoc_performance_tests.html">Performance
+              Tests</a></li>
+            </ol>
+          </li>
+
+          <li>
+            <a href="pq_tests.html">Priority Queues</a>
+
+            <ol>
+              <li><a href="pq_regression_tests.html">Regression
+              Tests</a></li>
+
+              <li><a href="pq_performance_tests.html">Performance
+              Tests</a></li>
+            </ol>
+          </li>
+        </ol>
+      </li>
+
+      <li>
+        <a href="misc.html">Misc.</a>
+
+        <ol>
+          <li><a href="acks.html">Acknowledgments</a></li>
+
+          <li><a href="contact.html">Contact</a></li>
+
+          <li><a href="disclaimer.html">Disclaimer and
+          Copyright</a></li>
+
+          <li><a href="references.html">References</a></li>
+        </ol>
+      </li>
+    </ol>
+  </div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/insert_error.html b/libstdc++-v3/docs/html/ext/pb_ds/insert_error.html
new file mode 100644
index 00000000000..f67160fe582
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/insert_error.html
@@ -0,0 +1,53 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
+ "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+<meta name="generator" content=
+ "HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+
+<title>insert_error Interface</title>
+<meta http-equiv="Content-Type" content=
+ "text/html; charset=us-ascii" />
+</head>
+
+<body>
+<div id="page">
+<h1><tt>insert_error</tt> Interface</h1>
+
+<p>An entry cannot be inserted into a container object for logical
+reasons (not, e.g., if memory is unavailable, in which case the
+allocator's exception will be thrown).</p>
+
+    <p>This exception may be thrown, e.g., when a probe sequence in
+    a probing hash table does not encounter any free positions,
+    even though free positions are available.</p>
+
+    <p>Defined in: <a href=
+    "../../../../include/ext/pb_ds/exception.hpp"><tt>exception.hpp</tt></a></p>
+
+    <h2><a name="link1" id="link1">Base Classes</a></h2>
+
+    <table class="c1" width="100%" border="1" summary="Bases">
+      <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="exceptions.html"><span class=
+"c2"><tt>insert_error</tt></span></a>
+</pre>
+        </td>
+
+        <td>
+          <p>public</p>
+        </td>
+      </tr>
+    </table>
+  </div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/insert_resize_sequence_diagram1.png b/libstdc++-v3/docs/html/ext/pb_ds/insert_resize_sequence_diagram1.png
new file mode 100644
index 00000000000..f64764ec931
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/insert_resize_sequence_diagram1.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/insert_resize_sequence_diagram2.png b/libstdc++-v3/docs/html/ext/pb_ds/insert_resize_sequence_diagram2.png
new file mode 100644
index 00000000000..e4645973eeb
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/insert_resize_sequence_diagram2.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/insert_resize_sequence_diagram3.png b/libstdc++-v3/docs/html/ext/pb_ds/insert_resize_sequence_diagram3.png
new file mode 100644
index 00000000000..5535c5fe603
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/insert_resize_sequence_diagram3.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/interface.html b/libstdc++-v3/docs/html/ext/pb_ds/interface.html
new file mode 100644
index 00000000000..a48a8bbadde
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/interface.html
@@ -0,0 +1,446 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN"
+ "http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+<meta name="generator" content=
+ "HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+
+<title>Interface</title>
+<meta http-equiv="Content-Type" content=
+ "text/html; charset=us-ascii" />
+</head>
+
+<body>
+<div id="page">
+<h1>Interface Specifics</h1>
+
+<p>Following are the library's interface specifics. <a href=
+    "tutorial.html">Short Tutorial</a> is a short tutorial, and
+    <a href="concepts.html">Concepts</a> describes some
+    concepts.</p>
+    <hr />
+
+    <h2><a name="namespaces" id="namespaces">Namespace</a></h2>
+
+    <p>All code is enclosed in namespace <tt>pb_ds</tt>. Nested within
+    this is namespace <tt>detail</tt>, which contains the parts of this
+    library that are considered implementation details.</p>
+    <hr />
+
+    <h2><a name="containers" id="containers">Containers</a></h2>
+
+    <h3><a name="containers_assoc" id=
+    "containers_assoc">Associative Containers</a></h3>
+
+    <ol>
+      <li><a href=
+      "container_base.html"><tt>container_base</tt></a> -
+      abstract base class for associative containers.</li>
+
+      <li>Hash-based:
+
+        <ol>
+          <li><a href=
+          "basic_hash_table.html"><tt>basic_hash_table</tt></a>
+          - abstract base class for hash-based
+          containers</li>
+
+          <li><a href=
+          "cc_hash_table.html"><tt>cc_hash_table</tt></a>
+          - concrete collision-chaining hash-based
+          containers</li>
+
+          <li><a href=
+          "gp_hash_table.html"><tt>gp_hash_table</tt></a>
+          - concrete (general) probing hash-based
+          containers</li>
+        </ol>
+      </li>
+
+      <li>Tree-based:
+
+        <ol>
+          <li><a href=
+          "basic_tree.html"><tt>basic_tree</tt></a>
+          - abstract base class for tree and trie based
+          containers</li>
+
+          <li><a href=
+          "tree.html"><tt>tree</tt></a>
+          - concrete base class for tree-based
+          containers</li>
+
+          <li><a href=
+          "trie.html"><tt>trie</tt></a>
+          - concrete base class for trie-based
+          containers</li>
+        </ol>
+      </li>
+
+      <li>List-based:
+
+        <ol>
+          <li><a href=
+          "list_update.html"><tt>list_update</tt></a> -
+          singly-linked list with update-policy container</li>
+        </ol>
+      </li>
+    </ol>
+
+    <h3><a name="containers_pq" id="containers_pq">Priority
+    Queues</a></h3>
+
+    <ol>
+      <li><a href="priority_queue.html"><tt>priority_queue</tt></a>
+      - priority queue</li>
+    </ol>
+    <hr />
+
+    <h2><a name="tag" id="tag">Container Tags and
+    Traits</a></h2>
+
+    <h3><a name="ds_ts" id="ds_ts">Container Tags</a></h3>
+
+    <h4><a name="ds_ts_common" id="ds_ts_common">Common</a></h4>
+
+    <ol>
+      <li><a href="container_tag.html"><tt>container_tag</tt></a> -
+      base class for data structure tags</li>
+    </ol>
+
+    <h4><a name="ds_ts_assoc" id=
+    "ds_ts_assoc">Associative-Containers</a></h4>
+
+     <ol>
+      <li><a href=
+      "associative_container_tag.html"><tt>associative_container_tag</tt></a> -
+      base class for associative-container data structure tags</li>
+
+      <li><a href=
+      "basic_hash_tag.html"><tt>basic_hash_tag</tt></a> -
+      base class for hash-based structure tags</li>
+
+      <li><a href="cc_hash_tag.html"><tt>cc_hash_tag</tt></a>
+      - collision-chaining hash structure tag</li>
+
+      <li><a href="gp_hash_tag.html"><tt>gp_hash_tag</tt></a>
+      - (general) probing hash structure tag</li>
+
+      <li><a href=
+      "basic_tree_tag.html"><tt>basic_tree_tag</tt></a>
+      - base class for tree-like structure tags</li>
+
+      <li><a href=
+      "tree_tag.html"><tt>tree_tag</tt></a> -
+      base class for tree structure tags</li>
+
+      <li><a href="rb_tree_tag.html"><tt>rb_tree_tag</tt></a>
+      - red-black tree structure tag/li&gt;</li>
+
+      <li><a href=
+      "splay_tree_tag.html"><tt>splay_tree_tag</tt></a> -
+      splay tree structure tag</li>
+
+      <li><a href="ov_tree_tag.html"><tt>ov_tree_tag</tt></a>
+      - ordered-vector tree structure tag</li>
+
+      <li><a href=
+      "trie_tag.html"><tt>trie_tag</tt></a> -
+      trie structure tag</li>
+
+      <li><a href=
+      "pat_trie_tag.html"><tt>pat_trie_tag</tt></a> -
+      PATRICIA trie structure tag</li>
+
+      <li><a href="list_update_tag.html"><tt>list_update_tag</tt></a> - list
+      (with updates) structure tag</li>
+    </ol>
+
+    <h4><a name="ds_ts_pq" id="ds_ts_pq">Priority-Queues</a></h4>
+
+     <ol>
+      <li><a href=
+      "priority_queue_tag.html"><tt>priority_queue_tag</tt></a> - base
+      class for priority-queue data structure tags</li>
+
+      <li><a href=
+      "pairing_heap_tag.html"><tt>pairing_heap_tag</tt></a> -
+      pairing-heap structure tag.</li>
+
+      <li><a href=
+      "binomial_heap_tag.html"><tt>binomial_heap_tag</tt></a>
+      - binomial-heap structure tag</li>
+
+      <li><a href=
+      "rc_binomial_heap_tag.html"><tt>rc_binomial_heap_tag</tt></a>
+      - redundant-counter binomial-heap (<i>i.e.</i>, a heap where
+      binomial trees form a sequence that is similar to a
+      de-amortized bit-addition algorithm) structure tag</li>
+
+      <li><a href=
+      "binary_heap_tag.html"><tt>binary_heap_tag</tt></a> -
+      binary heap (based on an array or an array of nodes)
+      structure tag</li>
+
+      <li><a href=
+      "thin_heap_tag.html"><tt>thin_heap_tag</tt></a> - thin
+      heap (an alternative [<a href=
+      "references.html#kt99fat_heaps">kt99fat_heaps</a>] to
+      Fibonacci heap) data structure tag.</li>
+    </ol>
+
+    <h3><a name="ds_inv_tag" id="ds_inv_tag">Invalidation-Guarantee
+    Tags</a></h3>
+
+    <ol>
+      <li><a href=
+      "basic_invalidation_guarantee.html"><tt>basic_invalidation_guarantee</tt></a>
+      - weakest invalidation guarantee</li>
+
+      <li><a href=
+      "point_invalidation_guarantee.html"><tt>point_invalidation_guarantee</tt></a>
+      - stronger invalidation guarantee</li>
+
+      <li><a href=
+      "range_invalidation_guarantee.html"><tt>range_invalidation_guarantee</tt></a>
+      - strongest invalidation guarantee</li>
+    </ol>
+
+    <h3><a name="container_traits" id="container_traits">Container
+    Traits</a></h3>
+
+    <ol>
+      <li><a href="pq_container_traits.html"><tt>container_traits</tt></a> -
+      traits for determining underlying data structure 
+      properties</li>
+    </ol>
+    <hr />
+
+    <h2><a name="ds_policy_classes" id=
+    "ds_policy_classes">Container Policy Classes</a></h2>
+
+    <h3><a name="hash_related_policies" id=
+    "hash_related_policies">Hash Policies</a></h3>
+
+    <h4>Hash and Probe Policies</h4>
+
+    <ol>
+      <li>Hash Functions:
+
+        <ol>
+          <li><a href="null_hash_fn.html"><tt>null_hash_fn</tt></a>
+          - type indicating one-step range-hashing</li>
+        </ol>
+      </li>
+
+      <li>Range-Hashing Functions:
+
+        <ol>
+          <li><a href="sample_range_hashing.html">Sample
+          range-hashing function</a> - interface required of a
+          range-hashing functor</li>
+
+          <li><a href=
+          "direct_mask_range_hashing.html"><tt>direct_mask_range_hashing</tt></a>
+          - (bit) mask-based range hashing functor</li>
+
+          <li><a href=
+          "direct_mod_range_hashing.html"><tt>direct_mod_range_hashing</tt></a>
+          - modulo-based range hashing functor</li>
+        </ol>
+      </li>
+
+      <li>Probe Functions:
+
+        <ol>
+          <li><a href="sample_probe_fn.html">Sample probe
+          function</a> - interface required of a probe functor</li>
+
+          <li><a href=
+          "null_probe_fn.html"><tt>null_probe_fn</tt></a> - type
+          indicating one-step ranged-probe</li>
+
+          <li><a href=
+          "linear_probe_fn.html"><tt>linear_probe_fn</tt></a> -
+          linear-probe functor</li>
+
+          <li><a href=
+          "quadratic_probe_fn.html"><tt>quadratic_probe_fn</tt></a>-
+          quadratic-probe functor</li>
+        </ol>
+      </li>
+
+      <li>Ranged-Hash Functions:
+
+        <ol>
+          <li><a href="sample_ranged_hash_fn.html">Sample
+          ranged-hash function</a> - interface required of a
+          ranged-hash functor</li>
+        </ol>
+      </li>
+
+      <li>Ranged-Probe Functions:
+
+        <ol>
+          <li><a href="sample_ranged_probe_fn.html">Sample
+          ranged-probe function</a> - interface required of a
+          ranged-probe functor</li>
+        </ol>
+      </li>
+    </ol>
+
+    <h4>Resize Policies</h4>
+    <ol>
+      <li>Resize Policies:
+
+        <ol>
+          <li><a href="sample_resize_policy.html">Sample resize
+          policy</a> - interface required of a resize policy</li>
+
+          <li><a href=
+          "hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>
+          - standard resize policy</li>
+        </ol>
+      </li>
+
+      <li>Size Policies:
+
+        <ol>
+          <li><a href="sample_size_policy.html">Sample size
+          policy</a> - interface required of a size policy</li>
+
+          <li><a href=
+          "hash_exponential_size_policy.html"><tt>hash_exponential_size_policy</tt></a>
+          - exponential size policy (typically used with (bit) mask
+          range-hashing)</li>
+
+          <li><a href=
+          "hash_prime_size_policy.html"><tt>hash_prime_size_policy</tt></a>
+          - prime size policy (typically used with modulo
+          range-hashing)</li>
+        </ol>
+      </li>
+
+      <li>Trigger Policies:
+
+        <ol>
+          <li><a href="sample_resize_trigger.html">Sample trigger
+          policy</a> - interface required of a trigger policy</li>
+
+          <li><a href=
+          "hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>
+          - trigger policy based on load checks</li>
+
+          <li><a href=
+          "cc_hash_max_collision_check_resize_trigger.html"><tt>cc_hash_max_collision_check_resize_trigger</tt></a>
+          - trigger policy based on collision checks</li>
+        </ol>
+      </li>
+    </ol>
+
+    <h3><a name="tree_related_policies" id=
+    "tree_related_policies">Tree Policies</a></h3>
+
+    <h4>Tree Node-Update Policies</h4>
+
+
+<ol>
+<li><a href="sample_tree_node_update.html">Sample node
+updater policy</a> - interface required of a tree
+node-updating functor</li>
+
+<li><a href=
+     "null_tree_node_update.html"><tt>null_tree_node_update</tt></a>
+- null policy indicating no updates are required</li>
+
+<li><a href=
+     "tree_order_statistics_node_update.html"><tt>tree_order_statistics_node_update</tt></a>
+- updater enabling order statistics queries</li>
+</ol>
+
+<h3><a name="trie_related_policies" id=
+     "trie_related_policies">Trie Policies</a></h3>
+
+
+<h4>Trie Element-Access Traits</h4>
+
+    <ol>
+      <li><a href="sample_trie_e_access_traits.html">Sample
+      element-access traits</a> - interface required of
+      element-access traits</li>
+
+      <li><a href=
+      "string_trie_e_access_traits.html"><tt>string_trie_e_access_traits</tt></a>
+      - String element-access traits</li>
+    </ol>
+
+    <h4>Trie Node-Update Policies</h4>
+
+
+<ol>
+<li><a href="sample_trie_node_update.html">Sample node
+updater policy</a> - interface required of a trie node
+updater</li>
+
+<li><a href=
+     "null_trie_node_update.html"><tt>null_trie_node_update</tt></a>
+- null policy indicating no updates are required</li>
+
+<li><a href=
+     "trie_prefix_search_node_update.html"><tt>trie_prefix_search_node_update</tt></a>
+- updater enabling prefix searches</li>
+
+<li><a href=
+     "trie_order_statistics_node_update.html"><tt>trie_order_statistics_node_update</tt></a>
+- updater enabling order statistics queries</li>
+</ol>
+
+<h3><a name="list_related_policies" id=
+     "list_related_policies">List Policies</a></h3>
+
+<h4>List Update Policies</h4>
+
+
+    <ol>
+      <li><a href="sample_update_policy.html">Sample list update
+      policy</a> - interface required of a list update policy</li>
+
+      <li><a href=
+      "move_to_front_lu_policy.html"><tt>move_to_front_lu_policy</tt></a>
+      - move-to-front update algorithm</li>
+
+      <li><a href=
+      "counter_lu_policy.html"><tt>counter_lu_policy</tt></a> -
+      counter update algorithm</li>
+    </ol>
+
+    <h3><a name="ds_pol" id="ds_pol">Mapped-Type Policies</a></h3>
+
+
+    <ol>
+      <li><a href=
+      "null_mapped_type.html"><tt>null_mapped_type</tt></a> - data
+      policy indicating that a container is a "set"</li>
+    </ol>
+    <hr />
+
+    <h2><a name="exceptions" id="exceptions">Exceptions</a></h2>
+
+
+    <ol>
+      <li><a href="exceptions.html"><tt>container_error</tt></a>
+      - base class for all policy-based data structure errors</li>
+
+      <li><a href=
+      "insert_error.html"><tt>insert_error</tt></a></li>
+
+      <li><a href="join_error.html"><tt>join_error</tt></a></li>
+
+      <li><a href=
+      "resize_error.html"><tt>resize_error</tt></a></li>
+    </ol>
+
+  </div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/introduction.html b/libstdc++-v3/docs/html/ext/pb_ds/introduction.html
new file mode 100644
index 00000000000..b3ccbd76aee
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/introduction.html
@@ -0,0 +1,120 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+  <meta name="generator" content=
+  "HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+
+  <title>Introduction</title>
+  <meta http-equiv="Content-Type" content=
+  "text/html; charset=us-ascii" />
+  </head>
+
+<body>
+  <div id="page">
+    <h1>Introduction</h1>
+
+    <p>This section describes what problems the library attempts to
+    solve. <a href="motivation.html">Motivation</a> describes the
+    reasons we think it solves these problems better than similar
+    libraries.</p>
+
+    <h2><a name="assoc" id="assoc">Associative Containers</a></h2>
+
+    <ol>
+      <li>Associative containers depend on their policies to a very
+      large extent. Implicitly hard-wiring policies can hamper their
+      performance and limit their functionality. An efficient
+      hash-based container, for example, requires policies for
+      testing key equivalence, hashing keys, translating hash
+      values into positions within the hash table, and determining
+      when and how to resize the table internally. A tree-based
+      container can efficiently support order statistics,
+      <i>i.e.</i>, the ability to query what is the order of each
+      key within the sequence of keys in the container, but only if
+      the container is supplied with a policy to internally update
+      meta-data. There are many other such examples.<p></p></li>
+
+      <li>Ideally, all associative containers would share the same
+      interface. Unfortunately, underlying data structures and
+      mapping semantics differentiate between different containers.
+      For example, suppose one writes a generic function
+      manipulating an associative container <tt>Cntnr</tt>:
+        <pre>
+template&lt;typename Cntnr&gt;
+  void
+  some_op_sequence(Cntnr&amp; r_cnt)
+  {
+    ...
+  }
+</pre>
+
+then what can one assume about <tt>Cntnr</tt>? The answer
+varies according to its underlying data structure. If the
+underlying data structure of <tt>Cntnr</tt> is based on a tree or
+trie, then the order of elements is well defined; otherwise, it is
+not, in general. If the underlying data structure of <tt>Cntnr</tt>
+is based on a collision-chaining hash table, then modifying
+r_<tt>Cntnr</tt> will not invalidate its iterators' order; if the
+underlying data structure is a probing hash table, then this is not
+the case. If the underlying data structure is based on a tree or
+trie, then <tt>r_cnt</tt> can efficiently be split; otherwise, it
+cannot, in general. If the underlying data structure is a red-black
+tree, then splitting <tt>r_cnt</tt> is exception-free; if it is an
+ordered-vector tree, exceptions can be thrown.
+      <p></p></li>
+    </ol>
+
+    <h2><a name="pq" id="pq">Priority Queues</a></h2>
+
+    <p>Priority queues are useful when one needs to efficiently
+    access a minimum (or maximum) value as the set of values
+    changes.</p>
+
+    <ol>
+      <li>Most useful data structures for priority queues have a
+      relatively simple structure, as they are geared toward
+      relatively simple requirements. Unfortunately, these structures
+      do not support access to an arbitrary value, which turns out to
+      be necessary in many algorithms. Say, decreasing an arbitrary
+      value in a graph algorithm. Therefore, some extra mechanism is
+      necessary and must be invented for accessing arbitrary
+      values. There are at least two alternatives: embedding an
+      associative container in a priority queue, or allowing
+      cross-referencing through iterators. The first solution adds
+      significant overhead; the second solution requires a precise
+      definition of iterator invalidation. Which is the next
+      point...<p></p></li>
+
+      <li>Priority queues, like hash-based containers, store values in
+      an order that is meaningless and undefined externally.  For
+      example, a <tt>push</tt> operation can internally reorganize the
+      values. Because of this characteristic, describing a priority
+      queues' iterator is difficult: on one hand, the values to which
+      iterators point can remain valid, but on the other, the logical
+      order of iterators can change unpredictably.<p></p></li>
+
+      <li>Roughly speaking, any element that is both inserted to a
+      priority queue (<i>e.g.</i>, through <tt>push</tt>) and removed
+      from it (<i>e.g.</i>, through <tt>pop</tt>), incurs a
+      logarithmic overhead (in the amortized sense). Different
+      underlying data structures place the actual cost differently:
+      some are optimized for amortized complexity, whereas others
+      guarantee that specific operations only have a constant
+      cost. One underlying data structure might be chosen if modifying
+      a value is frequent (Dijkstra's shortest-path algorithm),
+      whereas a different one might be chosen
+      otherwise. Unfortunately, an array-based binary heap - an
+      underlying data structure that optimizes (in the amortized
+      sense) <tt>push</tt> and <tt>pop</tt> operations, differs from
+      the others in terms of its invalidation guarantees. Other design
+      decisions also impact the cost and placement of the overhead, at
+      the expense of more difference in the the kinds of operations
+      that the underlying data structure can support. These
+      differences pose a challenge when creating a uniform interface
+      for priority queues.<p></p></li>
+    </ol>
+  </div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/invalidation_guarantee_cd.png b/libstdc++-v3/docs/html/ext/pb_ds/invalidation_guarantee_cd.png
new file mode 100644
index 00000000000..1f9d1243c6a
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/invalidation_guarantee_cd.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/invalidation_guarantee_erase.png b/libstdc++-v3/docs/html/ext/pb_ds/invalidation_guarantee_erase.png
new file mode 100644
index 00000000000..940a27f7142
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/invalidation_guarantee_erase.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/join_error.html b/libstdc++-v3/docs/html/ext/pb_ds/join_error.html
new file mode 100644
index 00000000000..3441e1fb20b
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/join_error.html
@@ -0,0 +1,48 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
+ "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+<meta name="generator" content=
+ "HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+
+<title>join_error Interface</title>
+<meta http-equiv="Content-Type" content=
+ "text/html; charset=us-ascii" />
+</head>
+
+<body>
+<div id="page">
+<h1><tt>join_error</tt> Interface</h1>
+
+<p>A join cannot be performed logical reasons (i.e., the ranges of the
+					       two container objects
+					       being joined
+					       overlaps.</p>
+
+					       <p>Defined in: <a href=
+					       "../../../../include/ext/pb_ds/exception.hpp"><tt>exception.hpp</tt></a></p>
+
+					       <h2><a name="link1" id="link1">Base Classes</a></h2>
+
+					       <table class="c1" width="100%" border="1" summary="Bases">
+					       <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="exceptions.html"><span class="c2"><tt>join_error</tt></span></a>
+</pre>
+ </td>
+
+<td>
+<p>public</p>
+</td>
+</tr>
+					       </table>
+					       </div>
+					       </body>
+					       </html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/linear_probe_fn.html b/libstdc++-v3/docs/html/ext/pb_ds/linear_probe_fn.html
new file mode 100644
index 00000000000..2141c2657ce
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/linear_probe_fn.html
@@ -0,0 +1,140 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+  <meta name="generator" content=
+  "HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+
+  <title>linear_probe_fn Interface</title>
+  <meta http-equiv="Content-Type" content=
+  "text/html; charset=us-ascii" />
+  </head>
+
+<body>
+  <div id="page">
+    <h1><tt>linear_probe_fn</tt> Interface</h1>
+
+    <p>A probe sequence policy using fixed increments.</p>
+
+    <p>Defined in: <a href=
+    "../../../../include/ext/pb_ds/hash_policy.hpp"><tt>hash_policy.hpp</tt></a></p>
+
+    <h2><a name="link1" id="link1">Template Parameters</a></h2>
+
+    <table class="c1" width="100%" border="1" summary=
+    "Template Parameters">
+      <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_Type42920436" id=
+"Size_Type42920436"><b>typename</b> Size_Type </a>
+</pre>
+        </td>
+
+        <td>
+          <p>Size type.</p>
+        </td>
+
+        <td>size_t</td>
+      </tr>
+    </table>
+
+    <h2><a name="link2" id="link2">Public Types and
+    Constants</a></h2>
+
+    <h3><a name="link3" id="link3">General Definitions</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Types">
+      <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_type55424436" id="size_type55424436">size_type</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<a href="#Size_Type42920436"><tt>Size_Type</tt></a>
+</pre>
+        </td>
+
+        <td>
+          <p>Size type.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h2><a name="link4" id="link4">Public Methods</a></h2>
+
+    <h3><a name="link5" id="link5">Constructors, Destructor, and
+    Related</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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
+  (<span class="c2"><tt>linear_probe_fn</tt></span> &amp;other)
+</pre>
+        </td>
+
+        <td>
+          <p>Swaps content.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h2><a name="link6" id="link6">Protected Methods</a></h2>
+
+    <h3><a name="link7" id="link7">Offset Methods</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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_type55424436"><tt>size_type</tt></a>
+  <b>operator</b>()
+  (<a href=
+"#size_type55424436"><tt>size_type</tt></a> i) <b>const</b>
+</pre>
+        </td>
+
+        <td>
+          <p>Returns the <span class="c1"><tt>i</tt></span>-th
+          offset from the hash value.</p>
+        </td>
+      </tr>
+    </table>
+  </div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/list_update.html b/libstdc++-v3/docs/html/ext/pb_ds/list_update.html
new file mode 100644
index 00000000000..93785acfd9c
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/list_update.html
@@ -0,0 +1,316 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+  <meta name="generator" content=
+  "HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+
+  <title>list_update Interface</title>
+  <meta http-equiv="Content-Type" content=
+  "text/html; charset=us-ascii" />
+  </head>
+
+<body>
+  <div id="page">
+    <h1><tt>list_update</tt> Interface</h1>
+
+    <p>A list-update based associative container.</p>
+
+    <p>Defined in: <a href=
+    "../../../../include/ext/pb_ds/assoc_container.hpp"><tt>assoc_container.hpp</tt></a></p>
+
+    <h2><a name="link1" id="link1">Template Parameters</a></h2>
+
+    <table class="c1" width="100%" border="1" summary=
+    "Template Parameters">
+      <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="Key2501" id="Key2501"><b>typename</b> Key</a>
+</pre>
+        </td>
+
+        <td>
+          <p>Key type.</p>
+        </td>
+
+        <td>-</td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="Mapped318655" id="Mapped318655"><b>typename</b> Mapped</a>
+</pre>
+        </td>
+
+        <td>
+          <p>Mapped type.</p>
+        </td>
+
+        <td>-</td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="Eq_Fn60085" id="Eq_Fn60085"><b>class</b> Eq_Fn </a>
+</pre>
+        </td>
+
+        <td>
+          <p>Equivalence functor.</p>
+        </td>
+
+        <td>
+          <pre>
+std::equal_to&lt;<a href="#Key2501"><tt>Key</tt></a>&gt;
+</pre>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="Update_Policy1671938590" id=
+"Update_Policy1671938590"><b>class</b> 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_lu_policy.html"><span class=
+        "c2"><tt>move_to_front_lu_policy</tt></span></a></td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="Allocator35940069" id=
+"Allocator35940069"><b>class</b> 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" id="link2">Base Classes</a></h2>
+
+    <table class="c1" width="100%" border="1" summary="Bases">
+      <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="container_base.html"><span class=
+"c2"><tt>container_base</tt></span></a>
+</pre>
+        </td>
+
+        <td>
+          <p>public</p>
+        </td>
+      </tr>
+    </table>
+
+    <h2><a name="link3" id="link3">Public Types and
+    Constants</a></h2>
+
+    <h3><a name="link4" id="link4">Policy definitions.</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Types">
+      <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_fn80245" id="eq_fn80245">eq_fn</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<a href="#Eq_Fn60085"><tt>Eq_Fn</tt></a>
+</pre>
+        </td>
+
+        <td>
+          <p>Equivalence functor type.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="update_policy894603998" id=
+"update_policy894603998">update_policy</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<a href="#Update_Policy1671938590"><tt>Update_Policy</tt></a>
+</pre>
+        </td>
+
+        <td>
+          <p>List update policy type.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="allocator48440069" id="allocator48440069">allocator</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<a href="#Allocator35940069"><tt>Allocator</tt></a>
+</pre>
+        </td>
+
+        <td>
+          <p><a href="#Allocator35940069"><tt>Allocator</tt></a>
+          type.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h2><a name="link5" id="link5">Public Methods</a></h2>
+
+    <h3><a name="link6" id="link6">Constructors, Destructor, and
+    Related</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <tr>
+        <td width="45%" align="left"><b>Method</b></td>
+
+        <td width="55%" align="left"><b>Description</b></td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+  list_update
+  ()
+</pre>
+        </td>
+
+        <td>
+          <p>Default constructor.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<b>template</b>&lt;
+    <b>class</b> It&gt;
+  list_update
+  (It first_it, 
+    It last_it)
+</pre>
+        </td>
+
+        <td>
+          <p>Constructor taking iterators to a range of
+          value_types. The value_types between <span class=
+          "c1"><tt>first_it</tt></span> and <span class=
+          "c1"><tt>last_it</tt></span> will be inserted into the
+          container object.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+  list_update
+  (<b>const</b> <span class=
+"c2"><tt>list_update</tt></span> &amp;other)
+</pre>
+        </td>
+
+        <td>
+          <p>Copy constructor.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<b>virtual</b> 
+  ~list_update
+  ()
+</pre>
+        </td>
+
+        <td>
+          <p>Destructor.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<span class="c2"><tt>list_update</tt></span> &amp;
+  <b>operator</b>=
+  (<b>const</b> <span class=
+"c2"><tt>list_update</tt></span> &amp;other)
+</pre>
+        </td>
+
+        <td>
+          <p>Assignment operator.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<b>void</b>
+  swap
+  (<span class="c2"><tt>list_update</tt></span> &amp;other)
+</pre>
+        </td>
+
+        <td>
+          <p>Swaps content.</p>
+        </td>
+      </tr>
+    </table>
+  </div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/list_update_tag.html b/libstdc++-v3/docs/html/ext/pb_ds/list_update_tag.html
new file mode 100644
index 00000000000..a35dc8cdab8
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/list_update_tag.html
@@ -0,0 +1,47 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+  <meta name="generator" content=
+  "HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+
+  <title>list_update_tag Interface</title>
+  <meta http-equiv="Content-Type" content=
+  "text/html; charset=us-ascii" />
+  </head>
+
+<body>
+  <div id="page">
+    <h1><tt>list_update_tag</tt> Interface</h1>
+
+    <p>List-update data structure tag.</p>
+
+    <p>Defined in: <a href=
+    "../../../../include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
+
+    <h2><a name="link1" id="link1">Base Classes</a></h2>
+
+    <table class="c1" width="100%" border="1" summary="Bases">
+      <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="associative_container_tag.html"><span class=
+"c2"><tt>associative_container_tag</tt></span></a>
+</pre>
+        </td>
+
+        <td>
+          <p>public</p>
+        </td>
+      </tr>
+    </table>
+  </div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/lu.png b/libstdc++-v3/docs/html/ext/pb_ds/lu.png
new file mode 100644
index 00000000000..7c96dcaf665
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/lu.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/lu_based_containers.html b/libstdc++-v3/docs/html/ext/pb_ds/lu_based_containers.html
new file mode 100644
index 00000000000..c8693437d9e
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/lu_based_containers.html
@@ -0,0 +1,229 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+  <meta name="generator" content=
+  "HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+
+  <title>List-Based Containers</title>
+  <meta http-equiv="Content-Type" content=
+  "text/html; charset=us-ascii" />
+  </head>
+
+<body>
+  <div id="page">
+    <h1>List-Update Design</h1>
+
+    <h2><a name="overview" id="overview">Overview</a></h2>
+
+    <p>The list-based container has the following declaration:</p>
+    <pre>
+<b>template</b>&lt;
+    <b>typename</b> Key,
+    <b>typename</b> Mapped,
+    <b>typename</b> Eq_Fn = std::equal_to&lt;Key&gt;,
+    <b>typename</b> Update_Policy = <a href=
+"move_to_front_lu_policy.html">move_to_front_lu_policy&lt;&gt;</a>,
+    <b>typename</b> Allocator = std::allocator&lt;<b>char</b>&gt; &gt;
+<b>class</b> <a href="list_update.html">list_update</a>;
+</pre>
+
+    <p>The parameters have the following meaning:</p>
+
+    <ol>
+      <li><tt>Key</tt> is the key type.</li>
+
+      <li><tt>Mapped</tt> is the mapped-policy, and is explained in
+      <a href="tutorial.html#assoc_ms">Tutorial::Associative
+      Containers::Associative Containers Others than Maps</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 an allocator
+      type.</li>
+    </ol>
+
+    <p>A list-based associative container is a container that
+    stores elements in a linked-list. It does not order the
+    elements by any particular order related to the keys.
+    List-based containers are primarily useful for creating
+    "multimaps" (see <a href=
+    "motivation.html#assoc_mapping_semantics">Motivation::Associative
+    Containers::Avoiding Multiple Keys</a> and <a href=
+    "tutorial.html#assoc_ms">Tutorial::Associative
+    Containers::Associative Containers Others than Maps</a>). In
+    fact, list-based containers are designed in <tt>pb_ds</tt>
+    expressly for this purpose. This is explained further in
+    <a href="#mmaps">Use for "Multimaps"</a>.</p>
+
+    <p>List-based containers might also be useful for some rare
+    cases, where a key is encapsulated to the extent that only
+    key-equivalence can be tested. Hash-based containers need to
+    know how to transform a key into a size type, and tree-based
+    containers need to know if some key is larger than another.
+    List-based associative containers, conversely, only need to
+    know if two keys are equivalent.</p>
+
+    <p>Since a list-based associative container does not order
+    elements by keys, is it possible to order the list in some
+    useful manner? Remarkably, many on-line 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>
+
+    <h2><a name="list_updates" id="list_updates">List
+    Updates</a></h2>
+
+    <h3><a name="general" id="general">General Terms</a></h3>
+
+    <p>Figure <a href="#simple_list">A simple list</a> shows a
+    simple list of integer keys. If we search for the integer 6, we
+    are paying an overhead: the link with key 6 is only the fifth
+    link; if it were the first link, it could be accessed
+    faster.</p>
+
+    <h6 class="c1"><a name="simple_list" id="simple_list"><img src=
+    "simple_list.png" alt="no image" /></a></h6>
+
+    <h6 class="c1">A simple list.</h6>
+
+    <p>List-update algorithms reorder lists as elements are
+    accessed. They try to determine, by the access history, which
+    keys to move to the front of the list. Some of these algorithms
+    require adding some metadata alongside each entry.</p>
+
+    <p>For example, Figure <a href="#lu">The counter algorithm</a>
+    -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 class="c1"><a name="lu" id="lu"><img src="lu.png" alt=
+    "no image" /></a></h6>
+
+    <h6 class="c1">The counter algorithm.</h6>
+
+    <h3><a name="imp_pb_ds" id="imp_pb_ds">Implementation</a></h3>
+
+    <p><tt>pb_ds</tt> allows instantiating lists with policies
+    implementing any algorithm moving nodes to the front of the
+    list (policies implementing algorithms interchanging nodes are
+    unsupported).</p>
+
+    <p>Associative containers based on lists are parametrized 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.
+    Figure <a href="#update_policy_cd">A list and its update
+    policy</a> shows the scheme, as well as some predefined
+    policies (which are explained below).</p>
+
+    <h6 class="c1"><a name="update_policy_cd" id=
+    "update_policy_cd"><img src="update_policy_cd.png" alt=
+    "no image" /></a></h6>
+
+    <h6 class="c1">A list and its update policy.</h6>
+
+    <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 &amp;);
+</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>The library contains two predefined implementations of
+    list-update policies [<a href=
+    "references.html#andrew04mtf">andrew04mtf</a>]. The first is
+    <a href=
+    "counter_lu_policy.html"><tt>counter_lu_policy</tt></a>, which
+    implements the counter algorithm described above. The second is
+    <a href=
+    "move_to_front_lu_policy.html"><tt>move_to_front_lu_policy</tt></a>,
+    which unconditionally move an accessed element to the front of
+    the list. The latter type is very useful in <tt>pb_ds</tt>,
+    since there is no need to associate metadata with each element
+    (this is explained further in <a href="#mmaps">Use for
+    "Multimaps"</a>).</p>
+
+    <h2><a name="mmaps" id="mmaps">Use for "Multimaps"</a></h2>
+
+    <p>In <tt>pb_ds</tt>, there are no equivalents for the STL's
+    multimaps and multisets; instead one uses an associative
+    container mapping primary keys to secondary keys (see <a href=
+    "motivation.html#assoc_mapping_semantics">Motivation::Associative
+    Containers::Alternative to Multiple Equivalent Keys</a> and
+    <a href="tutorial.html#assoc_ms">Tutorial::Associative
+    Containers::Associative Containers Others than Maps</a>).</p>
+
+    <p>List-based containers are especially useful as associative
+    containers for secondary keys. In fact, they are implemented
+    here expressly for this purpose.</p>
+
+    <p>To begin with, these containers use very little per-entry
+    structure memory overhead, since they can be implemented as
+    singly-linked lists. (Arrays use even lower per-entry memory
+    overhead, but they are less flexible in moving around entries,
+    and have weaker invalidation guarantees).</p>
+
+    <p>More importantly, though, list-based containers use very
+    little per-container memory overhead. The memory overhead of an
+    empty list-based container is practically that of a pointer.
+    This is important for when they are used as secondary
+    associative-containers in situations where the average ratio of
+    secondary keys to primary keys is low (or even 1).</p>
+
+    <p>In order to reduce the per-container memory overhead as much
+    as possible, they are implemented as closely as possible to
+    singly-linked lists.</p>
+
+    <ol>
+      <li>List-based containers do not store internally the number
+      of values that they hold. This means that their <tt>size</tt>
+      method has linear complexity (just like <tt>std::list</tt>).
+      Note that finding the number of equivalent-key values in an
+      STL multimap also has linear complexity (because it must be
+      done, <i>e.g.</i>, via <tt>std::distance</tt> of the
+      multimap's <tt>equal_range</tt> method), but usually with
+      higher constants.</li>
+
+      <li>Most associative-container objects each hold a policy
+      object (<i>e.g.</i>, a hash-based container object holds a
+      hash functor). List-based containers, conversely, only have
+      class-wide policy objects.</li>
+    </ol>
+
+    <p>See also <a href=
+    "assoc_performance_tests.html#msc">Associative-Container
+    Performance Tests::Observations::Mapping-Semantics
+    Considerations</a>.</p>
+  </div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/misc.html b/libstdc++-v3/docs/html/ext/pb_ds/misc.html
new file mode 100644
index 00000000000..01029e13454
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/misc.html
@@ -0,0 +1,26 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+  <meta name="generator" content=
+  "HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+
+  <title>Misc.</title>
+  <meta http-equiv="Content-Type" content=
+  "text/html; charset=us-ascii" />
+  </head>
+
+<body>
+  <div id="page">
+    <h1>Misc.</h1>
+
+    <p><a href="acks.html" title="Acknowledgements">Acks</a>
+    contains acknowledgments; <a href="contact.html">Contact</a>
+    contains contact information;<a href=
+    "disclaimer.html">Disclaimer and Copyright</a> is a standard
+    disclaimer, and <a href="references.html">References</a>
+    contains references.</p>
+  </div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/motivation.html b/libstdc++-v3/docs/html/ext/pb_ds/motivation.html
new file mode 100644
index 00000000000..420fc645103
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/motivation.html
@@ -0,0 +1,993 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+  <meta name="generator" content=
+  "HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+
+  <title>Motivation</title>
+  <meta http-equiv="Content-Type" content=
+  "text/html; charset=us-ascii" />
+  </head>
+
+<body>
+  <div id="page">
+    <h1>Motivation</h1>
+
+    <p>Many fine associative-container libraries were already
+    written, most notably, the STL's associative containers. Why
+    then write another library? This section shows some possible
+    advantages of this library, when considering the challenges in
+    <a href="introduction.html">Introduction</a>. Many of these
+    points stem from the fact that the STL introduced
+    associative-containers in a two-step process (first
+    standardizing tree-based containers, only then adding
+    hash-based containers, which are fundamentally different), did
+    not standardize priority queues as containers, and (in our
+    opinion) overloads the iterator concept.</p>
+
+    <h2><a name="assoc" id="assoc">Associative Containers</a></h2>
+
+    <h3><a name="assoc_policies" id="assoc_policies">More
+    Configuration Choices</a></h3>
+
+    <p>Associative containers require a relatively large number of
+    policies to function efficiently in various settings. In some
+    cases this is needed for making their common operations more
+    efficient, and in other cases this allows them to support a
+    larger set of operations</p>
+
+    <ol>
+      <li>Hash-based containers, for example, support look-up and
+      insertion methods (<i>e.g.</i>, <tt>find</tt> and
+      <tt>insert</tt>). In order to locate elements quickly, they
+      are supplied a hash functor, which instruct how to transform
+      a key object into some size 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 size-type type in some specific domain;
+      <i>e.g.</i>, a hash table with a 128-long table might
+      transform <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 (see <a href=
+      "hash_based_containers.html#hash_policies">Design::Associative
+      Containers::Hash-Based Containers::Hash Policies</a>).
+      Hash-based containers also do not resize naturally (as
+      opposed to tree-based containers, for example). The
+      appropriate resize policy is unfortunately intertwined with
+      the policy that transforms hash value into a position within
+      the table (see <a href=
+      "hash_based_containers.html#resize_policies">Design::Associative
+      Containers::Hash-Based Containers::Resize Policies</a>).
+
+        <p><a href=
+        "assoc_performance_tests.html#hash_based">Associative-Container
+        Performance Tests::Hash-Based Containers</a> quantifies
+        some of these points.</p>
+      </li>
+
+      <li>Tree-based containers, for example, also support look-up
+      and insertion methods, and are primarily useful when
+      maintaining order between elements is important. In some
+      cases, though, one can utilize their balancing algorithms for
+      completely different purposes.
+
+        <p>Figure <a href="#node_invariants">Metadata for
+        order-statistics and interval intersections</a>-A, for
+        example, shows a tree whose each node contains two entries:
+        a floating-point key, and some size-type <i>metadata</i>
+        (in bold beneath it) that is the number of nodes in the
+        sub-tree. (<i>E.g.</i>, the root has key 0.99, and has 5
+        nodes (including itself) in its sub-tree.) A container based
+        on this data structure can obviously answer efficiently
+        whether 0.3 is in the container object, but it can also
+        answer what is the order of 0.3 among all those in the
+        container object [<a href=
+        "references.html#clrs2001">clrs2001</a>] (see <a href=
+        "assoc_examples.html#tree_like_based">Associative Container
+        Examples::Tree-Like-Based Containers (Trees and
+        Tries)</a>).</p>
+
+        <p>As another example, Figure <a href=
+        "#node_invariants">Metadata for order-statistics and
+        interval intersections</a>-B shows a tree whose each node
+        contains two entries: a half-open geometric line interval,
+        and a number <i>metadata</i> (in bold beneath it) that is
+        the largest endpoint of all intervals in its sub-tree.
+        (<i>E.g.</i>, the root describes the interval <i>[20,
+        36)</i>, and the largest endpoint in its sub-tree is 99.) A
+        container based on this data structure can obviously answer
+        efficiently whether <i>[3, 41)</i> is in the container
+        object, but it can also answer efficiently whether the
+        container object has intervals that intersect <i>[3,
+        41)</i> (see <a href=
+        "assoc_examples.html#tree_like_based">Associative Container
+        Examples::Tree-Like-Based Containers (Trees and
+        Tries)</a>). These types of queries are very useful in
+        geometric algorithms and lease-management algorithms.</p>
+
+        <p>It is important to note, however, that as the trees are
+        modified, their internal structure changes. To maintain
+        these invariants, one must supply some policy that is aware
+        of these changes (see <a href=
+        "tree_based_containers.html#invariants">Design::Associative
+        Containers::Tree-Based Containers::Node Invariants</a>);
+        without this, it would be better to use a linked list (in
+        itself very efficient for these purposes).</p>
+
+        <p><a href=
+        "assoc_performance_tests.html#tree_like_based">Associative-Container
+        Performance Tests::Tree-Like-Based Containers</a>
+        quantifies some of these points.</p>
+      </li>
+    </ol>
+
+    <h6 class="c1"><a name="node_invariants" id=
+    "node_invariants"><img src="node_invariants.png" alt=
+    "no image" /></a></h6>
+
+    <h6 class="c1">Metadata for order-statistics and interval
+    intersections.</h6>
+
+    <h3><a name="assoc_ds_genericity" id="assoc_ds_genericity">More
+    Data Structures and Traits</a></h3>
+
+    <p>The STL contains associative containers based on red-black
+    trees and collision-chaining hash tables. These are obviously
+    very useful, but they are not ideal for all types of
+    settings.</p>
+
+    <p>Figure <a href=
+    "#different_underlying_data_structures">Different underlying
+    data structures</a> shows different underlying data structures
+    (the ones currently supported in <tt>pb_ds</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(implicit in the order of the
+    elements), F shows a PATRICIA trie, and G shows a list-based
+    container with update policies.</p>
+
+    <p>Each of these data structures has some performance benefits,
+    in terms of speed, size or both (see <a href=
+    "assoc_performance_tests.html">Associative-Container
+    Performance Tests</a> and <a href=
+    "assoc_performance_tests.html#dss_family_choice">Associative-Container
+    Performance Tests::Observations::Underlying Data-Structure
+    Families</a>). For now, though, note that <i>e.g.</i>,
+    vector-based trees and probing hash tables manipulate memory
+    more efficiently than red-black trees and collision-chaining
+    hash tables, and that list-based associative containers are
+    very useful for constructing "multimaps" (see <a href=
+    "#assoc_mapping_semantics">Alternative to Multiple Equivalent
+    Keys</a>, <a href=
+    "assoc_performance_tests.html#multimaps">Associative Container
+    Performance Tests::Multimaps</a>, and <a href=
+    "assoc_performance_tests.html#msc">Associative Container
+    Performance Tests::Observations::Mapping-Semantics
+    Considerations</a>).</p>
+
+    <h6 class="c1"><a name="different_underlying_data_structures"
+    id="different_underlying_data_structures"><img src=
+    "different_underlying_dss.png" alt="no image" /></a></h6>
+
+    <h6 class="c1">Different underlying data structures.</h6>
+
+    <p>Now consider a function manipulating a generic associative
+    container, <i>e.g.</i>,</p>
+    <pre>
+<b>template</b>&lt;
+    <b>class</b> Cntnr&gt;
+<b>int</b> 
+    some_op_sequence
+    (Cntnr &amp;r_cnt)
+{
+    ...
+}
+</pre>
+
+    <p>Ideally, the underlying data structure of <tt>Cntnr</tt>
+    would not affect what can be done with <tt>r_cnt</tt>.
+    Unfortunately, this is not the case.</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>There are various other differences based on the container's
+    underlying data structure. For one, they can be constructed by,
+    and queried for, different policies. Furthermore:</p>
+
+    <ol>
+      <li>Containers based on C, D, E and F store elements in a
+      meaningful order; the others store elements in a meaningless
+      (and probably time-varying) order. By implication, only
+      containers based on C, D, E and F can support erase
+      operations taking an iterator and returning an iterator to
+      the following element without performance loss (see <a href=
+      "#assoc_ers_methods">Slightly Different Methods::Methods
+      Related to Erase</a>).</li>
+
+      <li>Containers based on C, D, E, and F can be split and
+      joined efficiently, while the others cannot. Containers based
+      on C and D, furthermore, 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
+      containers based on B and E cannot. Containers based on C, D,
+      and E can furthermore make a stronger guarantee, namely that
+      modifying an object of their type does not affect the order
+      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 (see <a href=
+    "tutorial.html#assoc_ds_gen">Tutorial::Associative
+    Containers::Determining Containers' Attributes</a> and <a href=
+    "ds_gen.html#container_traits">Design::Associative
+    Containers::Data-Structure Genericity::Data-Structure Tags and
+    Traits</a>).</p>
+
+    <h3><a name="assoc_diff_it" id="assoc_diff_it">Differentiating
+    between Iterator Types</a></h3>
+
+    <p>Iterators are centric to the STL's design, because of the
+    container/algorithm/iterator decomposition that allows an
+    algorithm to operate on a range through iterators of some
+    sequence (<i>e.g.</i>, one originating from a container).
+    Iterators, then, are useful because they allow going over a
+    <u>sequence</u>. The STL also uses iterators for accessing a
+    <u>specific</u> element - <i>e.g.</i>, when an associative
+    container returns one through <tt>find</tt>. The STL, however,
+    consistently uses the same types of iterators for both
+    purposes: going over a range, and accessing a specific found
+    element. Before the introduction of hash-based containers to
+    the STL, this made sense (with the exception of priority
+    queues, which are discussed in <a href="#pq">Priority
+    Queues</a>).</p>
+
+    <p>Using the STL's associative containers together with
+    non-order-preserving associative containers (and also because
+    of priority-queues container), there is a possible need for
+    different types of iterators for self-organizing containers -
+    the iterator concept seems overloaded to mean two different
+    things (in some cases). The following subsections explain this;
+    <a href="tutorial.html#assoc_find_range">Tutorial::Associative
+    Containers::Point-Type and Range-Type Methods</a> explains an
+    alternative design which does not complicate the use of
+    order-preserving containers, but is better for unordered
+    containers; <a href=
+    "ds_gen.html#find_range">Design::Associative
+    Containers::Data-Structure Genericity::Point-Type and
+    Range-Type Methods</a> explains the design further.</p>
+
+    <h4><a name="assoc_find_it_range_it" id=
+    "assoc_find_it_range_it">Using Point-Type Iterators for
+    Range-Type Operations</a></h4>
+
+    <p>Suppose <tt>cntnr</tt> is some associative container, and
+    say <tt>c</tt> is an object of type <tt>cntnr</tt>. Then what
+    will be the outcome of</p>
+    <pre>
+std::for_each(c.find(1), c.find(5), foo);
+</pre>
+
+    <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>c</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>
+
+    <h6 class="c1"><a name="range_it_in_hts" id=
+    "range_it_in_hts"><img src="point_iterators_range_ops_1.png"
+    alt="no image" /></a></h6>
+
+    <h6 class="c1">Range iteration in different
+    data structures.</h6>
+
+    <p>In our opinion, this problem is not caused just because
+    red-black trees are order preserving while collision-chaining
+    hash tables are (generally) not - it is more fundamental. Most
+    of the STL's containers order sequences in a well-defined
+    manner that is determined by their <u>interface</u>: calling
+    <tt>insert</tt> on a tree-based container modifies its sequence
+    in a predictable way, as does calling <tt>push_back</tt> on a
+    list or a vector. Conversely, collision-chaining hash tables,
+    probing hash tables, priority queues, and list-based containers
+    (which are very useful for "multimaps") are self-organizing
+    data structures; the effect of each operation modifies their
+    sequences in a manner that is (practically) determined by their
+    <u>implementation</u>.</p>
+
+    <p>Consequently, applying an algorithm to a sequence obtained
+    from most containers <u>may or may not</u> make sense, but
+    applying it to a sub-sequence of a self-organizing container
+    <u>does not</u>.</p>
+
+    <h4><a name="assoc_range_it_for_find_it" id=
+    "assoc_range_it_for_find_it">The Cost of Enabling Range
+    Capabilities to Point-Type Iterators</a></h4>
+
+    <p>Suppose <tt>c</tt> is some collision-chaining hash-based
+    container object, and one calls <tt>c.find(3)</tt>. Then what
+    composes the returned iterator?</p>
+
+    <p>Figure <a href="#find_its_in_hash_tables">Point-type
+    iterators in hash tables</a>-A shows the simplest (and most
+    efficient) implementation of a collision-chaining hash table.
+    The little box marked <tt>point_iterator</tt> shows an object
+    that contains a pointer to the element's node. Note that this
+    "iterator" has no way to move to the next element (<i>i.e.</i>,
+    it cannot support <tt><b>operator</b>++</tt>). Conversely, the
+    little box marked <tt>iterator</tt> stores both a pointer to
+    the element, as well as some other information (<i>e.g.</i>,
+    the bucket number of the element). the second iterator, then,
+    is "heavier" than the first one- it requires more time and
+    space. If we were to use a different container to
+    cross-reference into this hash-table using these iterators - it
+    would take much more space. As noted in <a href=
+    "#assoc_find_it_range_it">Using Point-Type Iterators for
+    Range-Type Operations</a>, nothing much can be done by
+    incrementing these iterators, so why is this extra information
+    needed?</p>
+
+    <p>Alternatively, one might create a collision-chaining
+    hash-table where the lists might be linked, forming a
+    monolithic total-element list, as in Figure <a href=
+    "#find_its_in_hash_tables">Point-type iterators in hash
+    tables</a>-B (this seems similar to the Dinkumware design
+    [<a href="references.html#dinkumware_stl">dinkumware_stl</a>]).
+    Here the iterators are as light as can be, but the hash-table's
+    operations are more complicated.</p>
+
+    <h6 class="c1"><a name="find_its_in_hash_tables" id=
+    "find_its_in_hash_tables"><img src=
+    "point_iterators_range_ops_2.png" alt="no image" /></a></h6>
+
+    <h6 class="c1">Point-type iterators in hash tables.</h6>
+
+    <p>It should be noted that containers based on
+    collision-chaining hash-tables are not the only ones with this
+    type of behavior; many other self-organizing data structures
+    display it as well.</p>
+
+    <h4><a name="assoc_inv_guar" id="assoc_inv_guar">Invalidation
+    Guarantees</a></h4>
+
+    <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 de-referenced? 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 a probing hash-table; C1
+    and C2 show a collision-chaining hash table.</p>
+
+    <h6 class="c1"><a name="invalidation_guarantee_erase" id=
+    "invalidation_guarantee_erase"><img src=
+    "invalidation_guarantee_erase.png" alt="no image" /></a></h6>
+
+    <h6 class="c1">Effect of erase in different underlying
+    data structures.</h6>
+
+    <ol>
+      <li>Erasing 5 from A1 yields A2. Clearly, an iterator to 3
+      can be de-referenced and incremented. The sequence of
+      iterators changed, but in a way that is well-defined by the
+      <u>interface</u>.</li>
+
+      <li>Erasing 5 from B1 yields B2. Clearly, an iterator to 3 is
+      not valid at all - it cannot be de-referenced or incremented;
+      the order of iterators changed in a way that is (practically)
+      determined by the <u>implementation</u> and not by the
+      <u>interface</u>.</li>
+
+      <li>Erasing 5 from C1 yields C2. Here the situation is more
+      complicated. On the one hand, there is no problem in
+      de-referencing <tt>it</tt>. On the other hand, the order of
+      iterators changed in a way that is (practically) determined
+      by the <u>implementation</u> and not by the
+      <u>interface</u>.</li>
+    </ol>
+
+    <p>So in classic STL, it is not always possible to express
+    whether <tt>it</tt> is valid or not. This is true also for
+    <tt>insert</tt>, <i>e.g.</i>. Again, the iterator concept seems
+    overloaded.</p>
+
+    <h3><a name="assoc_methods" id="assoc_methods">Slightly
+    Different Methods</a></h3>
+
+    <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 other methods which would be
+    better left out (<i>e.g.</i>, [<a href=
+    "references.html#sgi_stl">sgi_stl</a>] ).</p>
+
+    <h4><a name="assoc_ers_methods" id="assoc_ers_methods">Methods
+    Related to Erase</a></h4>
+
+    <ol>
+      <li>Order-preserving STL associative containers provide the
+      method
+        <pre>
+iterator 
+    erase
+    (iterator it)
+</pre>which takes an iterator, erases the corresponding element,
+and returns an iterator to the following element. Also hash-based
+STL associative containers provide this method. This <u>seemingly
+increases</u> genericity between associative containers, since, <i>
+        e.g.</i>, it is possible to use
+        <pre>
+<b>typename</b> C::iterator it = c.begin();
+<b>typename</b> C::iterator e_it = c.end();
+
+<b>while</b>(it != e_it)
+    it = pred(*it)? c.erase(it) : ++it;
+</pre>in order to erase from a container object <tt>
+        c</tt> all element which match a predicate <tt>pred</tt>.
+        However, in a different sense this actually
+        <u>decreases</u> genericity: an integral implication of
+        this method is that tree-based associative containers'
+        memory use is linear in the total number of elements they
+        store, while hash-based containers' memory use is unbounded
+        in the total number of elements they store. Assume a
+        hash-based container is allowed to decrease its size when
+        an element is erased. Then the elements might be rehashed,
+        which means that there is no "next" element - it is simply
+        undefined. Consequently, it is possible to infer from the
+        fact that STL hash-based containers provide this method
+        that they cannot downsize when elements are erased
+        (<a href="assoc_performance_tests.html#hash_based">Performance
+        Tests::Hash-Based Container Tests</a> quantifies this.) As
+        a consequence, different code is needed to manipulate
+        different containers, assuming that memory should be
+        conserved. <tt>pb_ds</tt>'s non-order preserving
+        associative containers omit this method.
+      </li>
+
+      <li>All of <tt>pb_ds</tt>'s associative containers include a
+      conditional-erase method
+        <pre>
+<b>template</b>&lt;
+    <b>class</b> Pred&gt;
+size_type
+    erase_if
+    (Pred pred)
+</pre>which erases all elements matching a predicate. This is
+probably the only way to ensure linear-time multiple-item erase
+which can actually downsize a container.
+      </li>
+
+      <li>STL associative containers provide methods for
+      multiple-item erase of the form
+        <pre>
+size_type
+    erase
+    (It b, 
+        It e)
+</pre>erasing a range of elements given by a pair of iterators. For
+tree-based or trie-based containers, this can implemented more
+efficiently as a (small) sequence of split and join operations. For
+other, unordered, containers, this method isn't much better than an
+external loop. Moreover, if <tt>c</tt> is a hash-based container,
+then, <i>e.g.</i>, <tt>c.erase(c.find(2), c.find(5))</tt> is almost
+certain to do something different than erasing all elements whose
+keys are between 2 and 5, and is likely to produce other undefined
+behavior.
+      </li>
+    </ol>
+
+    <h4><a name="assoc_split_join_methods" id=
+    "assoc_split_join_methods">Methods Related to Split and
+    Join</a></h4>
+
+    <p>It is well-known that tree-based and trie-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, especially, since as
+    noted just before, they are efficient replacements for erasing
+    sub-sequences. <a href=
+    "assoc_performance_tests.html#tree_like_based">Performance
+    Tests::Tree-Like-Based Container Tests</a> quantifies this.</p>
+
+    <h4><a name="assoc_insert_methods" id=
+    "assoc_insert_methods">Methods Related to Insert</a></h4>
+
+    <p>STL associative containers provide methods of the form</p>
+    <pre>
+<b>template</b>&lt;
+    <b>class</b> It&gt;
+size_type
+    insert
+    (It b,
+        It e);
+</pre>for inserting a range of elements given by a pair of
+iterators. At best, this can be implemented as an external loop,
+or, even more efficiently, as a join operation (for the case of
+tree-based or trie-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.
+
+    <h4><a name="assoc_equiv_comp_methods" id=
+    "assoc_equiv_comp_methods">Functions Related to
+    Comparison</a></h4>
+
+    <p>Associative containers are parametrized by policies
+    allowing to test key equivalence; <i>e.g.</i> a hash-based
+    container can do this through its equivalence functor, and a
+    tree-based container can do this through its comparison
+    functor. In addition, some STL associative containers have
+    global function operators, <i>e.g.</i>,
+    <tt><b>operator</b>==</tt> and <tt><b>operator</b>&lt;=</tt>,
+    that allow comparing entire associative containers.</p>
+
+    <p>In our opinion, these functions are better left out. To
+    begin with, they do not significantly improve over an external
+    loop. More importantly, however, they are possibly misleading -
+    <tt><b>operator</b>==</tt>, for example, usually checks for
+    equivalence, or interchangeability, but the associative
+    container cannot check for values' equivalence, only keys'
+    equivalence; also, are two containers considered equivalent if
+    they store the same values in different order? this is an
+    arbitrary decision.</p>
+
+    <h3><a name="assoc_mapping_semantics" id=
+    "assoc_mapping_semantics">Alternative to Multiple Equivalent
+    Keys</a></h3>
+
+    <p>Maps (or sets) allow mapping (or storing) unique-key values.
+    The STL, however, also supplies associative containers which
+    map (or store) multiple values with equivalent keys:
+    <tt>std::multimap</tt>, <tt>std::multiset</tt>,
+    <tt>std::tr1::unordered_multimap</tt>, and
+    <tt>unordered_multiset</tt>. We first discuss how these might
+    be used, then why we think it is best to avoid them.</p>
+
+    <p>Suppose one builds a simple bank-account application that
+    records for each client (identified by an <tt>std::string</tt>)
+    and account-id (marked by an <tt><b>unsigned long</b></tt>) -
+    the balance in the account (described by a
+    <tt><b>float</b></tt>). Suppose further that ordering this
+    information is not useful, so a hash-based container is
+    preferable to a tree based container. Then one can use</p>
+    <pre>
+std::tr1::unordered_map&lt;std::pair&lt;std::string, <b>unsigned long</b>&gt;, <b>float</b>, ...&gt;
+</pre>which <u>hashes every combination of client and
+account-id</u>. This might work well, except for the fact that it
+is now impossible to efficiently list all of the accounts of a
+specific client (this would practically require iterating over all
+entries). Instead, one can use
+    <pre>
+std::tr1::unordered_multimap&lt;std::pair&lt;std::string, <tt><b>unsigned long</b></tt>&gt;, <b>float</b>, ...&gt;
+</pre>which <u>hashes every client</u>, and <u>decides equivalence
+based on client</u> only. This will ensure that all accounts
+belonging to a specific user are stored consecutively.
+
+    <p>Also, suppose one wants an integers' priority queue
+    (<i>i.e.,</i> a container that supports <tt>push</tt>,
+    <tt>pop</tt>, and <tt>top</tt> operations, the last of which
+    returns the largest <tt><b>int</b></tt>) that also supports
+    operations such as <tt>find</tt> and <tt>lower_bound</tt>. A
+    reasonable solution is to build an adapter over
+    <tt>std::set&lt;<b>int</b>&gt;</tt>. In this adapter,
+    <i>e.g.</i>, <tt>push</tt> will just call the tree-based
+    associative container's <tt>insert</tt> method; <tt>pop</tt>
+    will call its <tt>end</tt> method, and use it to return the
+    preceding element (which must be the largest). Then this might
+    work well, except that the container object cannot hold
+    multiple instances of the same integer (<tt>push(4)</tt>,
+    <i>e.g.</i>, will be a no-op if <tt>4</tt> is already in the
+    container object). If multiple keys are necessary, then one
+    might build the adapter over an
+    <tt>std::multiset&lt;<b>int</b>&gt;</tt>.</p>
+
+    <p class="c1">STL non-unique-mapping containers, then, are
+    useful when (1) a key can be decomposed in to a primary key and
+    a secondary key, (2) a key is needed multiple times, or (3) any
+    combination of (1) and (2).</p>
+
+    <p>Figure <a href="#embedded_lists_1">Non-unique mapping
+    containers in the STL's design</a> shows how the STL's design
+    works internally; in this figure nodes shaded equally represent
+    equivalent-key values. Equivalent keys are stored consecutively
+    using the properties of the underlying data structure: binary
+    search trees (Figure <a href="#embedded_lists_1">Non-unique
+    mapping containers in the STL's design</a>-A) store
+    equivalent-key values consecutively (in the sense of an
+    in-order walk) naturally; collision-chaining hash tables
+    (Figure <a href="#embedded_lists_1">Non-unique mapping
+    containers in the STL's design</a>-B) store equivalent-key
+    values in the same bucket, the bucket can be arranged so that
+    equivalent-key values are consecutive.</p>
+
+    <h6 class="c1"><a name="embedded_lists_1" id=
+    "embedded_lists_1"><img src="embedded_lists_1.png" alt=
+    "no image" /></a></h6>
+
+    <h6 class="c1">Non-unique mapping containers in the STL's
+    design.</h6>
+
+    <p>Put differently, STL non-unique mapping
+    associative-containers are associative containers that map
+    primary keys to linked lists that are embedded into the
+    container. Figure <a href="#embedded_lists_2">Effect of
+    embedded lists in STL multimaps</a> shows again the two
+    containers from Figure <a href="#embedded_lists_1">Non-unique
+    mapping containers in the STL's design</a>, this time with the
+    embedded linked lists of the grayed nodes marked
+    explicitly.</p>
+
+    <h6 class="c1"><a name="embedded_lists_2" id=
+    "embedded_lists_2"><img src="embedded_lists_2.png" alt=
+    "no image" /></a></h6>
+
+    <h6 class="c1">Effect of embedded lists in STL multimaps.</h6>
+
+    <p>These embedded linked lists have several disadvantages.</p>
+
+    <ol>
+      <li>The underlying data structure embeds the linked lists
+      according to its own consideration, which means that the
+      search path for a value might include several different
+      equivalent-key values. For example, the search path for the
+      the black node in either of Figures <a href=
+      "#embedded_lists_1">Non-unique mapping containers in the
+      STL's design</a> A or B, includes more than a single gray
+      node.</li>
+
+      <li>The links of the linked lists are the underlying
+      data structures' nodes, which typically are quite structured.
+      <i>E.g.</i>, in the case of tree-based containers (Figure
+      <a href="#embedded_lists_2">Effect of embedded lists in STL
+      multimaps</a>-B), each "link" is actually a node with three
+      pointers (one to a parent and two to children), and a
+      relatively-complicated iteration algorithm. The linked lists,
+      therefore, can take up quite a lot of memory, and iterating
+      over all values equal to a given key (<i>e.g.</i>, through
+      the return value of the STL's <tt>equal_range</tt>) can be
+      expensive.</li>
+
+      <li>The primary key is stored multiply; this uses more
+      memory.</li>
+
+      <li>Finally, the interface of this design excludes several
+      useful underlying data structures. <i>E.g.</i>, of all the
+      unordered self-organizing data structures, practically only
+      collision-chaining hash tables can (efficiently) guarantee
+      that equivalent-key values are stored consecutively.</li>
+    </ol>
+
+    <p>The above reasons hold even when the ratio of secondary keys
+    to primary keys (or average number of identical keys) is small,
+    but when it is large, there are more severe problems:</p>
+
+    <ol>
+      <li>The underlying data structures order the links inside
+      each embedded linked-lists according to their internal
+      considerations, which effectively means that each of the
+      links is unordered. Irrespective of the underlying
+      data structure, searching for a specific value can degrade to
+      linear complexity.</li>
+
+      <li>Similarly to the above point, it is impossible to apply
+      to the secondary keys considerations that apply to primary
+      keys. For example, it is not possible to maintain secondary
+      keys by sorted order.</li>
+
+      <li>While the interface "understands" that all equivalent-key
+      values constitute a distinct list (<i>e.g.</i>, through
+      <tt>equal_range</tt>), the underlying data structure
+      typically does not. This means, <i>e.g.</i>, that operations
+      such as erasing from a tree-based container all values whose
+      keys are equivalent to a a given key can be super-linear in
+      the size of the tree; this is also true also for several
+      other operations that target a specific list.</li>
+    </ol>
+
+    <p>In <tt>pb_ds</tt>, therefore, all associative containers map
+    (or store) unique-key values. One can (1) map primary keys to
+    secondary associative-containers (<i>i.e.</i>, containers of
+    secondary keys) or non-associative containers (2) map identical
+    keys to a size-type representing the number of times they
+    occur, or (3) any combination of (1) and (2). Instead of
+    allowing multiple equivalent-key values, <tt>pb_ds</tt>
+    supplies associative containers based on underlying
+    data structures that are suitable as secondary
+    associative-containers (see <a href=
+    "assoc_performance_tests.html#msc">Associative-Container
+    Performance Tests::Observations::Mapping-Semantics
+    Considerations</a>).</p>
+
+    <p>Figures <a href="#embedded_lists_3">Non-unique mapping
+    containers in <tt>pb_ds</tt></a> A and B show the equivalent
+    structures in <tt>pb_ds</tt>'s design, to those in Figures
+    <a href="#embedded_lists_1">Non-unique mapping containers in
+    the STL's design</a> A and B, respectively. Each shaded box
+    represents some size-type or secondary
+    associative-container.</p>
+
+    <h6 class="c1"><a name="embedded_lists_3" id=
+    "embedded_lists_3"><img src="embedded_lists_3.png" alt=
+    "no image" /></a></h6>
+
+    <h6 class="c1">Non-unique mapping containers in the
+    <tt>pb_ds</tt>.</h6>
+
+    <p>In the first example above, then, one would use an
+    associative container mapping each user to an associative
+    container which maps each application id to a start time (see
+    <a href=
+    "../../../../testsuite/ext/pb_ds/example/basic_multimap.cc"><tt>basic_multimap.cc</tt></a>);
+    in the second example, one would use an associative container
+    mapping each <tt><b>int</b></tt> to some size-type indicating
+    the number of times it logically occurs (see <a href=
+    "../../../../testsuite/ext/pb_ds/example/basic_multiset.cc"><tt>basic_multiset.cc</tt></a>).</p>
+
+    <p><a href=
+    "assoc_performance_tests.html#multimaps">Associative-Container
+    Performance Tests::Multimaps</a> quantifies some of these
+    points, and <a href=
+    "assoc_performance_tests.html#msc">Associative-Container
+    Performance Tests::Observations::Mapping-Semantics
+    Considerations</a> shows some simple calculations.</p>
+
+    <p><a href="assoc_examples.html#mmaps">Associative-Container
+    Examples::Multimaps</a> shows some simple examples of using
+    "multimaps".</p>
+
+    <p><a href="lu_based_containers.html">Design::Associative
+    Containers::List-Based Containers</a> discusses types of
+    containers especially suited as secondary
+    associative-containers.</p>
+
+    <h2><a name="pq" id="pq">Priority Queues</a></h2>
+
+    <h3><a name="pq_more_ops" id="pq_more_ops">Slightly Different
+    Methods</a></h3>
+
+    <p>Priority queues are containers that allow efficiently
+    inserting values and accessing the maximal value (in the sense
+    of the container's comparison functor); <i>i.e.</i>, their
+    interface supports <tt>push</tt> and <tt>pop</tt>. The STL's
+    priority queues indeed support these methods, but they support
+    little else. For algorithmic and software-engineering purposes,
+    other methods are needed:</p>
+
+    <ol>
+      <li>Many graph algorithms [<a href=
+      "references.html#clrs2001">clrs2001</a>] require increasing a
+      value in a priority queue (again, in the sense of the
+      container's comparison functor), or joining two
+      priority-queue objects.</li>
+
+      <li>It is sometimes necessary to erase an arbitrary value in
+      a priority queue. For example, consider the <tt>select</tt>
+      function for monitoring file descriptors:
+        <pre>
+<b>int</b> 
+    select
+    (<b>int</b> nfds,             
+        fd_set *readfds,                
+        fd_set *writefds,
+        fd_set *errorfds, 
+        <b>struct</b> timeval *timeout);
+</pre>then, as the <tt>select</tt> manual page [<a href=
+"references.html#select_man">select_man</a>] states:
+
+        <p><q>The nfds argument specifies the range of file
+        descriptors to be tested. The select() function tests file
+        descriptors in the range of 0 to nfds-1.</q></p>
+
+        <p>It stands to reason, therefore, that we might wish to
+        maintain a minimal value for <tt>nfds</tt>, and priority
+        queues immediately come to mind. Note, though, that when a
+        socket is closed, the minimal file description might
+        change; in the absence of an efficient means to erase an
+        arbitrary value from a priority queue, we might as well
+        avoid its use altogether.</p>
+
+        <p><a href="pq_examples.html#xref">Priority-Queue
+        Examples::Cross-Referencing</a> shows examples for these
+        types of operations.</p>
+      </li>
+
+      <li>STL containers typically support iterators. It is
+      somewhat unusual for <tt>std::priority_queue</tt> to omit
+      them (see, <i>e.g.</i>, [<a href=
+      "references.html#meyers01stl">meyers01stl</a>]). One might
+      ask why do priority queues need to support iterators, since
+      they are self-organizing containers with a different purpose
+      than abstracting sequences. There are several reasons:
+
+        <ol>
+          <li>Iterators (even in self-organizing containers) are
+          useful for many purposes, <i>e.g.</i>, cross-referencing
+          containers, serialization, and debugging code that uses
+          these containers.</li>
+
+          <li>The STL's hash-based containers support iterators,
+          even though they too are self-organizing containers with
+          a different purpose than abstracting sequences.</li>
+
+          <li>In STL-like containers, it is natural to specify the
+          interface of operations for modifying a value or erasing
+          a value (discussed previously) in terms of a iterators.
+          This is discussed further in <a href=
+          "pq_design.html#pq_it">Design::Priority
+          Queues::Iterators</a>. It should be noted that the STL's
+          containers also use iterators for accessing and
+          manipulating a specific value. <i>E.g.</i>, in hash-based
+          containers, one checks the existence of a key by
+          comparing the iterator returned by <tt>find</tt> to the
+          iterator returned by <tt>end</tt>, and not by comparing a
+          pointer returned by <tt>find</tt> to <tt>NULL</tt>.</li>
+        </ol>
+      </li>
+    </ol>
+
+    <p><a href="pq_performance_tests.html">Performance
+    Tests::Priority Queues</a> quantifies some of these points.</p>
+
+    <h3><a name="pq_ds_genericity" id="pq_ds_genericity">More Data
+    Structures and Traits</a></h3>
+
+    <p>There are three main implementations of priority queues: the
+    first employs a binary heap, typically one which uses a
+    sequence; the second uses a tree (or forest of trees), which is
+    typically less structured than an associative container's tree;
+    the third simply uses an associative container. These are
+    shown, respectively, in Figures <a href=
+    "#pq_different_underlying_dss">Underlying Priority-Queue
+    Data-Structures</a> A1 and A2, B, and C.</p>
+
+    <h6 class="c1"><a name="pq_different_underlying_dss" id=
+    "pq_different_underlying_dss"><img src=
+    "pq_different_underlying_dss.png" alt="no image" /></a></h6>
+
+    <h6 class="c1">Underlying Priority-Queue Data-Structures.</h6>
+
+    <p>No single implementation can completely replace any of the
+    others. Some have better <tt>push</tt> and <tt>pop</tt>
+    amortized performance, some have better bounded (worst case)
+    response time than others, some optimize a single method at the
+    expense of others, <i>etc.</i>. In general the "best"
+    implementation is dictated by the problem (see <a href=
+    "pq_performance_tests.html#pq_observations">Performance
+    Tests::Priority Queues::Observations</a>).</p>
+
+    <p>As with associative containers (see <a href=
+    "#assoc_ds_genericity">Associative Containers::Traits for
+    Underlying Data-Structures</a>), the more implementations
+    co-exist, the more necessary a traits mechanism is for handling
+    generic containers safely and efficiently. This is especially
+    important for priority queues, since the invalidation
+    guarantees of one of the most useful data structures - binary
+    heaps - is markedly different than those of most of the
+    others.</p>
+
+    <p><a href="pq_design.html#pq_traits">Design::Priority
+    Queues::Traits</a> discusses this further.</p>
+
+    <h3><a name="pq_binary_heap" id="pq_binary_heap">Binary Heap
+    Implementation</a></h3>
+
+    <p>Binary heaps are one of the most useful underlying
+    data structures for priority queues. They are very efficient in
+    terms of memory (since they don't require per-value structure
+    metadata), and have the best amortized <tt>push</tt> and
+    <tt>pop</tt> performance for primitive types (<i>e.g.</i>,
+    <tt><b>int</b></tt>s).</p>
+
+    <p>The STL's <tt>priority_queue</tt> implements this data
+    structure as an adapter over a sequence, typically
+    <tt>std::vector</tt> or <tt>std::deque</tt>, which correspond
+    to Figures <a href="#pq_different_underlying_dss">Underlying
+    Priority-Queue Data-Structures</a> A1 and A2, respectively.</p>
+
+    <p>This is indeed an elegant example of the adapter concept and
+    the algorithm/container/iterator decomposition (see [<a href=
+    "references.html#nelson96stlpq">nelson96stlpql</a>]). There are
+    possibly reasons, however, why a binary-heap priority queue
+    would be better implemented as a container instead of a
+    sequence adapter:</p>
+
+    <ol>
+      <li><tt>std::priority_queue</tt> cannot erase values from its
+      adapted sequence (irrespective of the sequence type). This
+      means that the memory use of an <tt>std::priority_queue</tt>
+      object is always proportional to the maximal number of values
+      it ever contained, and not to the number of values that it
+      currently contains (see <a href=
+      "priority_queue_text_pop_mem_usage_test.html">Priority Queue
+      Text <tt>pop</tt> Memory Use Test</a>); this implementation
+      of binary heaps acts very differently than other underlying
+      data structures (<i>e.g.</i>, pairing heaps).</li>
+
+      <li>Some combinations of adapted sequences and value types
+      are very inefficient or just don't make sense. If one uses
+      <tt>std::priority_queue&lt;std::vector&lt;std::string&gt;
+      &gt; &gt;</tt>, for example, then not only will each
+      operation perform a logarithmic number of
+      <tt>std::string</tt> assignments, but, furthermore, any
+      operation (including <tt>pop</tt>) can render the container
+      useless due to exceptions. Conversely, if one uses
+      <tt>std::priority_queue&lt;std::deque&lt;<b>int</b>&gt; &gt;
+      &gt;</tt>, then each operation uses incurs a logarithmic
+      number of indirect accesses (through pointers) unnecessarily.
+      It might be better to let the container make a conservative
+      deduction whether to use the structure in Figures <a href=
+      "#pq_different_underlying_dss">Underlying Priority-Queue
+      Data-Structures</a> A1 or A2.</li>
+
+      <li>There does not seem to be a systematic way to determine
+      what exactly can be done with the priority queue.
+
+        <ol>
+          <li>If <tt>p</tt> is a priority queue adapting an
+          <tt>std::vector</tt>, then it is possible to iterate over
+          all values by using <tt>&amp;p.top()</tt> and
+          <tt>&amp;p.top() + p.size()</tt>, but this will not work
+          if <tt>p</tt> is adapting an <tt>std::deque</tt>; in any
+          case, one cannot use <tt>p.begin()</tt> and
+          <tt>p.end()</tt>. If a different sequence is adapted, it
+          is even more difficult to determine what can be
+          done.</li>
+
+          <li>If <tt>p</tt> is a priority queue adapting an
+          <tt>std::deque</tt>, then the reference return by
+          <tt>p.top()</tt> will remain valid until it is popped,
+          but if <tt>p</tt> adapts an <tt>std::vector</tt>, the
+          next <tt>push</tt> will invalidate it. If a different
+          sequence is adapted, it is even more difficult to
+          determine what can be done.</li>
+        </ol>
+      </li>
+
+      <li>Sequence-based binary heaps can still implement
+      linear-time <tt>erase</tt> and <tt>modify</tt> operations.
+      This means that if one needs, <i>e.g.</i>, to erase a small
+      (say logarithmic) number of values, then one might still
+      choose this underlying data structure. Using
+      <tt>std::priority_queue</tt>, however, this will generally
+      change the order of growth of the entire sequence of
+      operations.</li>
+    </ol>
+  </div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/move_to_front_lu_policy.html b/libstdc++-v3/docs/html/ext/pb_ds/move_to_front_lu_policy.html
new file mode 100644
index 00000000000..35190924e1e
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/move_to_front_lu_policy.html
@@ -0,0 +1,194 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+  <meta name="generator" content=
+  "HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+
+  <title>move_to_front_lu_policy Interface</title>
+  <meta http-equiv="Content-Type" content=
+  "text/html; charset=us-ascii" />
+  </head>
+
+<body>
+  <div id="page">
+    <h1><tt>move_to_front_lu_policy</tt> Interface</h1>
+
+    <p>A list-update policy that unconditionally moves elements to
+    the front of the list.</p>
+
+    <p>Defined in: <a href=
+    "../../../../include/ext/pb_ds/list_update_policy.hpp"><tt>list_update_policy.hpp</tt></a></p>
+
+    <h2><a name="link1" id="link1">Template Parameters</a></h2>
+
+    <table class="c1" width="100%" border="1" summary=
+    "Template Parameters">
+      <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="Allocator35940069" id=
+"Allocator35940069"><b>class</b> Allocator </a>
+</pre>
+        </td>
+
+        <td>
+          <p>Allocator type.</p>
+
+          <p>This is used only for definitions, e.g., the size
+          type.</p>
+        </td>
+
+        <td>
+          <pre>
+std::allocator&lt;<b>char</b>&gt;
+</pre>
+        </td>
+      </tr>
+    </table>
+
+    <h2><a name="link2" id="link2">Public Types and
+    Constants</a></h2>
+
+    <h3><a name="link3" id="link3">Policy Definitions</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Types">
+      <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="allocator48440069" id="allocator48440069">allocator</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<a href="#Allocator35940069"><tt>Allocator</tt></a>
+</pre>
+        </td>
+
+        <td>
+          <p><a href="#Allocator35940069"><tt>Allocator</tt></a>
+          type.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h3><a name="link4" id="link4">Metadata-Type
+    Definitions</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Types">
+      <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_type2849297114" id=
+"metadata_type2849297114">metadata_type</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<a href="null_lu_metadata.html"><span class=
+"c2"><tt>null_lu_metadata</tt></span></a>
+</pre>
+        </td>
+
+        <td>
+          <p>Metadata on which this functor operates.</p>
+
+          <p>In this case, none.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="metadata_reference583863863" id=
+"metadata_reference583863863">metadata_reference</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<b>typename</b> <a href=
+"#Allocator35940069"><tt>Allocator</tt></a>::<b>template</b> rebind&lt;  
+    <a href=
+"#metadata_type2849297114"><tt>metadata_type</tt></a>&gt;::other::reference
+</pre>
+        </td>
+
+        <td>
+          <p>Reference to metadata on which this functor
+          operates.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h2><a name="link5" id="link5">Public Methods</a></h2>
+
+    <h3><a name="link6" id="link6">Metadata Methods</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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_type2849297114"><tt>metadata_type</tt></a>
+  <b>operator</b>()
+  () <b>const</b>
+</pre>
+        </td>
+
+        <td>
+          <p>Creates a metadata object.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<b>inline</b> <b>bool</b> 
+  <b>operator</b>()
+  (<a href=
+"#metadata_reference583863863"><tt>metadata_reference</tt></a> r_metadata) <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>
+  </div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_find_timing_test_large.html b/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_find_timing_test_large.html
new file mode 100644
index 00000000000..e3b1a2cd6bc
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_find_timing_test_large.html
@@ -0,0 +1,215 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+<meta name="generator" content="HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+<title>"Multimap" Text Find Timing Test with Large Average
+  Secondary-Key to Primary-Key Ratio</title>
+<meta http-equiv="Content-Type" content="text/html; charset=us-ascii" />
+</head>
+<body>
+<div id="page">
+<h1>"Multimap" Text Find Timing Test with Large Average
+    Secondary-Key to Primary-Key Ratio</h1>
+<h2><a name="description" id="description">Description</a></h2>
+<p>This test inserts a number of pairs into a container. The
+    first item of each pair is a string from an arbitrary text
+    [<a href="references.html#wickland96thirty">wickland96thirty</a>], and
+    the second is a uniform i.i.d.integer. The container is a
+    "multimap" - it considers the first member of each pair as a
+    primary key, and the second member of each pair as a secondary
+    key (see <a href="motivation.html#assoc_mapping_semantics">Motivation::Associative
+    Containers::Alternative to Multiple Equivalent Keys</a>). There
+    are 100 distinct primary keys, and the ratio of secondary keys
+    to primary keys ranges to about 20.</p>
+<p>The test measures the average find-time as a function of the
+    number of values inserted. For <tt>pb_ds</tt>'s containers, it
+    finds the secondary key from a container obtained from finding
+    a primary key. For the native multimaps, it searches a range
+    obtained using <tt>std::equal_range</tt> on a primary key.</p>
+<p>(The test was executed with <a href="../../../../testsuite/performance/ext/pb_ds/multimap_text_find_timing.cc"><tt>multimap_text_find_timing_test</tt></a>
+    thirty_years_among_the_dead_preproc.txt 100 3 4 4)</p>
+<h2><a name="purpose" id="purpose">Purpose</a></h2>
+<p>The test checks the find-time scalability of different
+    "multimap" designs (see <a href="motivation.html#assoc_mapping_semantics">Motivation::Associative
+    Containers::Mapping Semantics</a>).</p>
+<h2><a name="results" id="results">Results</a></h2>
+<p>Figures <a href="#NTG">NTG</a>, <a href="#NTM">NTM</a>, and
+    <a href="#NTL">NTL</a> show the results for "multimaps" which
+    use a tree-based container for primary keys, in <a href="assoc_performance_tests.html#gcc"><u>g++</u></a>, <a href="assoc_performance_tests.html#msvc"><u>msvc++</u></a>, and
+    <a href="assoc_performance_tests.html#local"><u>local</u></a>,
+    respectively; Figures <a href="#NHG"></a>NHG, <a href="#NHM">NHM</a>, and <a href="#NHL">NHL</a> show the results for
+    "multimaps" which use a hash-based container for primary keys,
+    in <a href="assoc_performance_tests.html#gcc"><u>g++</u></a>,
+    <a href="assoc_performance_tests.html#msvc"><u>msvc++</u></a>,
+    and <a href="assoc_performance_tests.html#local"><u>local</u></a>,
+    respectively.</p>
+<div id="NTG_res_div">
+<div id="NTG_gcc">
+<div id="NTG_multimap_text_find_timing_test_large_s2p_tree">
+<div id="NTG_assoc">
+<div id="NTG_Native_and_primary_tree-based_multimap_types_find_timing_test"><div style="border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NTG" id="NTG"><img src="multimap_text_find_timing_test_large_s2p_tree_gcc.png" alt="no image" /></a></h6>NTG: Native and primary tree-based multimap types find timing test - <a href="assoc_performance_tests.html#gcc">g++</a><p>In the above figure, the names in the legends have the following meaning:</p>
+<ol>
+<li>
+n_mmap-
+<tt>std::multimap</tt></li>
+<li>
+rb_tree_mmap_lu_mtf_set-
+<a href="tree.html"><tt>tree</tt></a>
+ with <tt>Tag</tt> = <a href="rb_tree_tag.html"><tt>rb_tree_tag</tt></a>
+, and <tt>Node_Update</tt> = <a href="null_tree_node_update.html"><tt>null_tree_node_update</tt></a>
+, mapping each key to <a href="list_update.html"><tt>list_update</tt></a>
+ with <tt>Update_Policy</tt> = <a href="move_to_front_lu_policy.html"><tt>move_to_front_lu_policy</tt></a>
+</li>
+<li>
+rb_tree_mmap_cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_set-
+<a href="tree.html"><tt>tree</tt></a>
+ with <tt>Tag</tt> = <a href="rb_tree_tag.html"><tt>rb_tree_tag</tt></a>
+, and <tt>Node_Update</tt> = <a href="null_tree_node_update.html"><tt>null_tree_node_update</tt></a>
+, mapping each key to <a href="cc_hash_table.html"><tt>cc_hash_table</tt></a>
+with <tt>Comb_Hash_Fn</tt> = <a href="direct_mask_range_hashing.html"><tt>direct_mask_range_hashing</tt></a>
+, and <tt>Resize_Policy</tt> = <a href="hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>
+ with <tt>Size_Policy</tt> = <a href="hash_exponential_size_policy.html"><tt>hash_exponential_size_policy</tt></a>
+, and <tt>Trigger_Policy</tt> = <a href="hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>
+ with <i>&alpha;<sub>min</sub></i> = <i>1/8</i> and <i>&alpha;<sub>max</sub></i> = <i>1/2</i></li>
+</ol>
+</div><div style="width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<div id="NTM_res_div">
+<div id="NTM_msvc">
+<div id="NTM_multimap_text_find_timing_test_large_s2p_tree">
+<div id="NTM_assoc">
+<div id="NTM_Native_and_primary_tree-based_multimap_types_find_timing_test"><div style="border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NTM" id="NTM"><img src="multimap_text_find_timing_test_large_s2p_tree_msvc.png" alt="no image" /></a></h6>NTM: Native and primary tree-based multimap types find timing test - <a href="assoc_performance_tests.html#msvc">msvc++</a><p>In the above figure, the names in the legends have the following meaning:</p>
+<ol>
+<li>
+n_mmap-
+<tt>std::multimap</tt></li>
+<li>
+rb_tree_mmap_lu_mtf_set-
+<a href="tree.html"><tt>tree</tt></a>
+ with <tt>Tag</tt> = <a href="rb_tree_tag.html"><tt>rb_tree_tag</tt></a>
+, and <tt>Node_Update</tt> = <a href="null_tree_node_update.html"><tt>null_tree_node_update</tt></a>
+, mapping each key to <a href="list_update.html"><tt>list_update</tt></a>
+ with <tt>Update_Policy</tt> = <a href="move_to_front_lu_policy.html"><tt>move_to_front_lu_policy</tt></a>
+</li>
+<li>
+rb_tree_mmap_cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_set-
+<a href="tree.html"><tt>tree</tt></a>
+ with <tt>Tag</tt> = <a href="rb_tree_tag.html"><tt>rb_tree_tag</tt></a>
+, and <tt>Node_Update</tt> = <a href="null_tree_node_update.html"><tt>null_tree_node_update</tt></a>
+, mapping each key to <a href="cc_hash_table.html"><tt>cc_hash_table</tt></a>
+with <tt>Comb_Hash_Fn</tt> = <a href="direct_mask_range_hashing.html"><tt>direct_mask_range_hashing</tt></a>
+, and <tt>Resize_Policy</tt> = <a href="hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>
+ with <tt>Size_Policy</tt> = <a href="hash_exponential_size_policy.html"><tt>hash_exponential_size_policy</tt></a>
+, and <tt>Trigger_Policy</tt> = <a href="hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>
+ with <i>&alpha;<sub>min</sub></i> = <i>1/8</i> and <i>&alpha;<sub>max</sub></i> = <i>1/2</i></li>
+</ol>
+</div><div style="width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<div id="NTL_res_div">
+<div id="NTL_local">
+<div id="NTL_multimap_text_find_timing_test_large_s2p_tree">
+<div id="NTL_assoc">
+<div id="NTL_Native_and_primary_tree-based_multimap_types_find_timing_test"><div style = "border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NTL" id= "NTL"><img src="multimap_text_find_timing_test_large_s2p_tree_local.png" alt="no image" /></a></h6>NTL: Native and primary tree-based multimap types find timing test - <a href = "assoc_performance_tests.html#local">local</a></div><div style = "width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<div id="NHG_res_div">
+<div id="NHG_gcc">
+<div id="NHG_multimap_text_find_timing_test_large_s2p_hash">
+<div id="NHG_assoc">
+<div id="NHG_Native_and_primary_hash-based_multimap_types_find_timing_test"><div style="border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NHG" id="NHG"><img src="multimap_text_find_timing_test_large_s2p_hash_gcc.png" alt="no image" /></a></h6>NHG: Native and primary hash-based multimap types find timing test - <a href="assoc_performance_tests.html#gcc">g++</a><p>In the above figure, the names in the legends have the following meaning:</p>
+<ol>
+<li>
+n_hash_mmap-
+<tt>__gnucxx::hash_multimap</tt></li>
+<li>
+cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_mmap_lu_mtf_set-
+<a href="cc_hash_table.html"><tt>cc_hash_table</tt></a>
+with <tt>Comb_Hash_Fn</tt> = <a href="direct_mask_range_hashing.html"><tt>direct_mask_range_hashing</tt></a>
+, and <tt>Resize_Policy</tt> = <a href="hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>
+ with <tt>Size_Policy</tt> = <a href="hash_exponential_size_policy.html"><tt>hash_exponential_size_policy</tt></a>
+, and <tt>Trigger_Policy</tt> = <a href="hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>
+ with <i>&alpha;<sub>min</sub></i> = <i>1/8</i> and <i>&alpha;<sub>max</sub></i> = <i>1/2</i>, mapping each key to <a href="list_update.html"><tt>list_update</tt></a>
+ with <tt>Update_Policy</tt> = <a href="move_to_front_lu_policy.html"><tt>move_to_front_lu_policy</tt></a>
+</li>
+<li>
+cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_mmap_cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_set-
+<a href="cc_hash_table.html"><tt>cc_hash_table</tt></a>
+with <tt>Comb_Hash_Fn</tt> = <a href="direct_mask_range_hashing.html"><tt>direct_mask_range_hashing</tt></a>
+, and <tt>Resize_Policy</tt> = <a href="hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>
+ with <tt>Size_Policy</tt> = <a href="hash_exponential_size_policy.html"><tt>hash_exponential_size_policy</tt></a>
+, and <tt>Trigger_Policy</tt> = <a href="hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>
+ with <i>&alpha;<sub>min</sub></i> = <i>1/8</i> and <i>&alpha;<sub>max</sub></i> = <i>1/2</i>, mapping each key to <a href="cc_hash_table.html"><tt>cc_hash_table</tt></a>
+with <tt>Comb_Hash_Fn</tt> = <a href="direct_mask_range_hashing.html"><tt>direct_mask_range_hashing</tt></a>
+, and <tt>Resize_Policy</tt> = <a href="hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>
+ with <tt>Size_Policy</tt> = <a href="hash_exponential_size_policy.html"><tt>hash_exponential_size_policy</tt></a>
+, and <tt>Trigger_Policy</tt> = <a href="hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>
+ with <i>&alpha;<sub>min</sub></i> = <i>1/8</i> and <i>&alpha;<sub>max</sub></i> = <i>1/2</i></li>
+</ol>
+</div><div style="width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<div id="NHM_res_div">
+<div id="NHM_msvc">
+<div id="NHM_multimap_text_find_timing_test_large_s2p_hash">
+<div id="NHM_assoc">
+<div id="NHM_Native_and_primary_hash-based_multimap_types_find_timing_test"><div style="border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NHM" id="NHM"><img src="multimap_text_find_timing_test_large_s2p_hash_msvc.png" alt="no image" /></a></h6>NHM: Native and primary hash-based multimap types find timing test - <a href="assoc_performance_tests.html#msvc">msvc++</a><p>In the above figure, the names in the legends have the following meaning:</p>
+<ol>
+<li>
+n_hash_mmap-
+<tt>stdext::hash_multimap</tt></li>
+<li>
+cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_mmap_lu_mtf_set-
+<a href="cc_hash_table.html"><tt>cc_hash_table</tt></a>
+with <tt>Comb_Hash_Fn</tt> = <a href="direct_mask_range_hashing.html"><tt>direct_mask_range_hashing</tt></a>
+, and <tt>Resize_Policy</tt> = <a href="hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>
+ with <tt>Size_Policy</tt> = <a href="hash_exponential_size_policy.html"><tt>hash_exponential_size_policy</tt></a>
+, and <tt>Trigger_Policy</tt> = <a href="hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>
+ with <i>&alpha;<sub>min</sub></i> = <i>1/8</i> and <i>&alpha;<sub>max</sub></i> = <i>1/2</i>, mapping each key to <a href="list_update.html"><tt>list_update</tt></a>
+ with <tt>Update_Policy</tt> = <a href="move_to_front_lu_policy.html"><tt>move_to_front_lu_policy</tt></a>
+</li>
+<li>
+cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_mmap_cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_set-
+<a href="cc_hash_table.html"><tt>cc_hash_table</tt></a>
+with <tt>Comb_Hash_Fn</tt> = <a href="direct_mask_range_hashing.html"><tt>direct_mask_range_hashing</tt></a>
+, and <tt>Resize_Policy</tt> = <a href="hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>
+ with <tt>Size_Policy</tt> = <a href="hash_exponential_size_policy.html"><tt>hash_exponential_size_policy</tt></a>
+, and <tt>Trigger_Policy</tt> = <a href="hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>
+ with <i>&alpha;<sub>min</sub></i> = <i>1/8</i> and <i>&alpha;<sub>max</sub></i> = <i>1/2</i>, mapping each key to <a href="cc_hash_table.html"><tt>cc_hash_table</tt></a>
+with <tt>Comb_Hash_Fn</tt> = <a href="direct_mask_range_hashing.html"><tt>direct_mask_range_hashing</tt></a>
+, and <tt>Resize_Policy</tt> = <a href="hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>
+ with <tt>Size_Policy</tt> = <a href="hash_exponential_size_policy.html"><tt>hash_exponential_size_policy</tt></a>
+, and <tt>Trigger_Policy</tt> = <a href="hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>
+ with <i>&alpha;<sub>min</sub></i> = <i>1/8</i> and <i>&alpha;<sub>max</sub></i> = <i>1/2</i></li>
+</ol>
+</div><div style="width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<div id="NHL_res_div">
+<div id="NHL_local">
+<div id="NHL_multimap_text_find_timing_test_large_s2p_hash">
+<div id="NHL_assoc">
+<div id="NHL__Native_and_primary_hash-based_multimap_types_find_timing_test"><div style = "border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NHL" id= "NHL"><img src="multimap_text_find_timing_test_large_s2p_hash_local.png" alt="no image" /></a></h6>NHL:  Native and primary hash-based multimap types find timing test - <a href = "assoc_performance_tests.html#local">local</a></div><div style = "width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<h2><a name="observations" id="observations">Observations</a></h2>
+<p>See <a href="assoc_performance_tests.html#msc">Observations::Mapping-Semantics
+    Considerations</a>.</p>
+</div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_find_timing_test_large_s2p_hash_gcc.png b/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_find_timing_test_large_s2p_hash_gcc.png
new file mode 100644
index 00000000000..03a62f52b04
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_find_timing_test_large_s2p_hash_gcc.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_find_timing_test_large_s2p_hash_local.png b/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_find_timing_test_large_s2p_hash_local.png
new file mode 100644
index 00000000000..32a61cac9bd
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_find_timing_test_large_s2p_hash_local.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_find_timing_test_large_s2p_hash_msvc.png b/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_find_timing_test_large_s2p_hash_msvc.png
new file mode 100644
index 00000000000..4462d289afd
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_find_timing_test_large_s2p_hash_msvc.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_find_timing_test_large_s2p_tree_gcc.png b/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_find_timing_test_large_s2p_tree_gcc.png
new file mode 100644
index 00000000000..89e464481fd
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_find_timing_test_large_s2p_tree_gcc.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_find_timing_test_large_s2p_tree_local.png b/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_find_timing_test_large_s2p_tree_local.png
new file mode 100644
index 00000000000..10b3980edab
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_find_timing_test_large_s2p_tree_local.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_find_timing_test_large_s2p_tree_msvc.png b/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_find_timing_test_large_s2p_tree_msvc.png
new file mode 100644
index 00000000000..20320953e0d
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_find_timing_test_large_s2p_tree_msvc.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_find_timing_test_small.html b/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_find_timing_test_small.html
new file mode 100644
index 00000000000..cec52ff8090
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_find_timing_test_small.html
@@ -0,0 +1,215 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+<meta name="generator" content="HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+<title>"Multimap" Text Find Timing Test with Small Average
+  Secondary-Key to Primary-Key Ratio</title>
+<meta http-equiv="Content-Type" content="text/html; charset=us-ascii" />
+</head>
+<body>
+<div id="page">
+<h1>"Multimap" Text Find Timing Test with Small Average
+    Secondary-Key to Primary-Key Ratio</h1>
+<h2><a name="description" id="description">Description</a></h2>
+<p>This test inserts a number of pairs into a container. The
+    first item of each pair is a string from an arbitrary text
+    [<a href="references.html#wickland96thirty">wickland96thirty</a>], and
+    the second is a uniform i.i.d.integer. The container is a
+    "multimap" - it considers the first member of each pair as a
+    primary key, and the second member of each pair as a secondary
+    key (see <a href="motivation.html#assoc_mapping_semantics">Motivation::Associative
+    Containers::Alternative to Multiple Equivalent Keys</a>). There
+    are 400 distinct primary keys, and the ratio of secondary keys
+    to primary keys ranges from 1 to 5.</p>
+<p>The test measures the average find-time as a function of the
+    number of values inserted. For <tt>pb_ds</tt>'s containers, it
+    finds the secondary key from a container obtained from finding
+    a primary key. For the native multimaps, it searches a range
+    obtained using <tt>std::equal_range</tt> on a primary key.</p>
+<p>(The test was executed with <a href="../../../../testsuite/performance/ext/pb_ds/multimap_text_find_timing.cc"><tt>multimap_text_find_timing_test</tt></a>
+    thirty_years_among_the_dead_preproc.txt 400 1 1 6)</p>
+<h2><a name="purpose" id="purpose">Purpose</a></h2>
+<p>The test checks the find-time scalability of different
+    "multimap" designs (see <a href="motivation.html#assoc_mapping_semantics">Motivation::Associative
+    Containers::Mapping Semantics</a>).</p>
+<h2><a name="results" id="results">Results</a></h2>
+<p>Figures <a href="#NTG">NTG</a>, <a href="#NTM">NTM</a>, and
+    <a href="#NTL">NTL</a> show the results for "multimaps" which
+    use a tree-based container for primary keys, in <a href="assoc_performance_tests.html#gcc"><u>g++</u></a>, <a href="assoc_performance_tests.html#msvc"><u>msvc++</u></a>, and
+    <a href="assoc_performance_tests.html#local"><u>local</u></a>,
+    respectively; Figures <a href="#NHG"></a>NHG, <a href="#NHM">NHM</a>, and <a href="#NHL">NHL</a> show the results for
+    "multimaps" which use a hash-based container for primary keys,
+    in <a href="assoc_performance_tests.html#gcc"><u>g++</u></a>,
+    <a href="assoc_performance_tests.html#msvc"><u>msvc++</u></a>,
+    and <a href="assoc_performance_tests.html#local"><u>local</u></a>,
+    respectively.</p>
+<div id="NTG_res_div">
+<div id="NTG_gcc">
+<div id="NTG_multimap_text_find_timing_test_small_s2p_tree">
+<div id="NTG_assoc">
+<div id="NHG_Native_and_primary_tree-based_multimap_types_find_timing_test"><div style="border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NTG" id="NTG"><img src="multimap_text_find_timing_test_small_s2p_tree_gcc.png" alt="no image" /></a></h6>NTG: NHG Native and primary tree-based multimap types find timing test - <a href="assoc_performance_tests.html#gcc">g++</a><p>In the above figure, the names in the legends have the following meaning:</p>
+<ol>
+<li>
+n_mmap-
+<tt>std::multimap</tt></li>
+<li>
+rb_tree_mmap_lu_mtf_set-
+<a href="tree.html"><tt>tree</tt></a>
+ with <tt>Tag</tt> = <a href="rb_tree_tag.html"><tt>rb_tree_tag</tt></a>
+, and <tt>Node_Update</tt> = <a href="null_tree_node_update.html"><tt>null_tree_node_update</tt></a>
+, mapping each key to <a href="list_update.html"><tt>list_update</tt></a>
+ with <tt>Update_Policy</tt> = <a href="move_to_front_lu_policy.html"><tt>move_to_front_lu_policy</tt></a>
+</li>
+<li>
+rb_tree_mmap_cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_set-
+<a href="tree.html"><tt>tree</tt></a>
+ with <tt>Tag</tt> = <a href="rb_tree_tag.html"><tt>rb_tree_tag</tt></a>
+, and <tt>Node_Update</tt> = <a href="null_tree_node_update.html"><tt>null_tree_node_update</tt></a>
+, mapping each key to <a href="cc_hash_table.html"><tt>cc_hash_table</tt></a>
+with <tt>Comb_Hash_Fn</tt> = <a href="direct_mask_range_hashing.html"><tt>direct_mask_range_hashing</tt></a>
+, and <tt>Resize_Policy</tt> = <a href="hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>
+ with <tt>Size_Policy</tt> = <a href="hash_exponential_size_policy.html"><tt>hash_exponential_size_policy</tt></a>
+, and <tt>Trigger_Policy</tt> = <a href="hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>
+ with <i>&alpha;<sub>min</sub></i> = <i>1/8</i> and <i>&alpha;<sub>max</sub></i> = <i>1/2</i></li>
+</ol>
+</div><div style="width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<div id="NTM_res_div">
+<div id="NTM_msvc">
+<div id="NTM_multimap_text_find_timing_test_small_s2p_tree">
+<div id="NTM_assoc">
+<div id="NHM_Native_and_primary_tree-based_multimap_types_find_timing_test"><div style="border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NTM" id="NTM"><img src="multimap_text_find_timing_test_small_s2p_tree_msvc.png" alt="no image" /></a></h6>NTM: NHM Native and primary tree-based multimap types find timing test - <a href="assoc_performance_tests.html#msvc">msvc++</a><p>In the above figure, the names in the legends have the following meaning:</p>
+<ol>
+<li>
+n_mmap-
+<tt>std::multimap</tt></li>
+<li>
+rb_tree_mmap_lu_mtf_set-
+<a href="tree.html"><tt>tree</tt></a>
+ with <tt>Tag</tt> = <a href="rb_tree_tag.html"><tt>rb_tree_tag</tt></a>
+, and <tt>Node_Update</tt> = <a href="null_tree_node_update.html"><tt>null_tree_node_update</tt></a>
+, mapping each key to <a href="list_update.html"><tt>list_update</tt></a>
+ with <tt>Update_Policy</tt> = <a href="move_to_front_lu_policy.html"><tt>move_to_front_lu_policy</tt></a>
+</li>
+<li>
+rb_tree_mmap_cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_set-
+<a href="tree.html"><tt>tree</tt></a>
+ with <tt>Tag</tt> = <a href="rb_tree_tag.html"><tt>rb_tree_tag</tt></a>
+, and <tt>Node_Update</tt> = <a href="null_tree_node_update.html"><tt>null_tree_node_update</tt></a>
+, mapping each key to <a href="cc_hash_table.html"><tt>cc_hash_table</tt></a>
+with <tt>Comb_Hash_Fn</tt> = <a href="direct_mask_range_hashing.html"><tt>direct_mask_range_hashing</tt></a>
+, and <tt>Resize_Policy</tt> = <a href="hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>
+ with <tt>Size_Policy</tt> = <a href="hash_exponential_size_policy.html"><tt>hash_exponential_size_policy</tt></a>
+, and <tt>Trigger_Policy</tt> = <a href="hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>
+ with <i>&alpha;<sub>min</sub></i> = <i>1/8</i> and <i>&alpha;<sub>max</sub></i> = <i>1/2</i></li>
+</ol>
+</div><div style="width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<div id="NTL_res_div">
+<div id="NTL_local">
+<div id="NTL_multimap_text_find_timing_test_small_s2p_tree">
+<div id="NTL_assoc">
+<div id="NTL_Native_and_primary_tree-based_multimap_types_find_timing_test"><div style = "border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NTL" id= "NTL"><img src="multimap_text_find_timing_test_small_s2p_tree_local.png" alt="no image" /></a></h6>NTL: Native and primary tree-based multimap types find timing test - <a href = "assoc_performance_tests.html#local">local</a></div><div style = "width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<div id="NHG_res_div">
+<div id="NHG_gcc">
+<div id="NHG_multimap_text_find_timing_test_small_s2p_hash">
+<div id="NHG_assoc">
+<div id="NHG_Native_and_primary_hash-based_multimap_types_find_timing_test"><div style="border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NHG" id="NHG"><img src="multimap_text_find_timing_test_small_s2p_hash_gcc.png" alt="no image" /></a></h6>NHG: Native and primary hash-based multimap types find timing test - <a href="assoc_performance_tests.html#gcc">g++</a><p>In the above figure, the names in the legends have the following meaning:</p>
+<ol>
+<li>
+n_hash_mmap-
+<tt>__gnucxx::hash_multimap</tt></li>
+<li>
+cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_mmap_lu_mtf_set-
+<a href="cc_hash_table.html"><tt>cc_hash_table</tt></a>
+with <tt>Comb_Hash_Fn</tt> = <a href="direct_mask_range_hashing.html"><tt>direct_mask_range_hashing</tt></a>
+, and <tt>Resize_Policy</tt> = <a href="hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>
+ with <tt>Size_Policy</tt> = <a href="hash_exponential_size_policy.html"><tt>hash_exponential_size_policy</tt></a>
+, and <tt>Trigger_Policy</tt> = <a href="hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>
+ with <i>&alpha;<sub>min</sub></i> = <i>1/8</i> and <i>&alpha;<sub>max</sub></i> = <i>1/2</i>, mapping each key to <a href="list_update.html"><tt>list_update</tt></a>
+ with <tt>Update_Policy</tt> = <a href="move_to_front_lu_policy.html"><tt>move_to_front_lu_policy</tt></a>
+</li>
+<li>
+cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_mmap_cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_set-
+<a href="cc_hash_table.html"><tt>cc_hash_table</tt></a>
+with <tt>Comb_Hash_Fn</tt> = <a href="direct_mask_range_hashing.html"><tt>direct_mask_range_hashing</tt></a>
+, and <tt>Resize_Policy</tt> = <a href="hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>
+ with <tt>Size_Policy</tt> = <a href="hash_exponential_size_policy.html"><tt>hash_exponential_size_policy</tt></a>
+, and <tt>Trigger_Policy</tt> = <a href="hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>
+ with <i>&alpha;<sub>min</sub></i> = <i>1/8</i> and <i>&alpha;<sub>max</sub></i> = <i>1/2</i>, mapping each key to <a href="cc_hash_table.html"><tt>cc_hash_table</tt></a>
+with <tt>Comb_Hash_Fn</tt> = <a href="direct_mask_range_hashing.html"><tt>direct_mask_range_hashing</tt></a>
+, and <tt>Resize_Policy</tt> = <a href="hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>
+ with <tt>Size_Policy</tt> = <a href="hash_exponential_size_policy.html"><tt>hash_exponential_size_policy</tt></a>
+, and <tt>Trigger_Policy</tt> = <a href="hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>
+ with <i>&alpha;<sub>min</sub></i> = <i>1/8</i> and <i>&alpha;<sub>max</sub></i> = <i>1/2</i></li>
+</ol>
+</div><div style="width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<div id="NHM_res_div">
+<div id="NHM_msvc">
+<div id="NHM_multimap_text_find_timing_test_small_s2p_hash">
+<div id="NHM_assoc">
+<div id="NHM_Native_and_primary_hash-based_multimap_types_find_timing_test"><div style="border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NHM" id="NHM"><img src="multimap_text_find_timing_test_small_s2p_hash_msvc.png" alt="no image" /></a></h6>NHM: Native and primary hash-based multimap types find timing test - <a href="assoc_performance_tests.html#msvc">msvc++</a><p>In the above figure, the names in the legends have the following meaning:</p>
+<ol>
+<li>
+n_hash_mmap-
+<tt>stdext::hash_multimap</tt></li>
+<li>
+cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_mmap_lu_mtf_set-
+<a href="cc_hash_table.html"><tt>cc_hash_table</tt></a>
+with <tt>Comb_Hash_Fn</tt> = <a href="direct_mask_range_hashing.html"><tt>direct_mask_range_hashing</tt></a>
+, and <tt>Resize_Policy</tt> = <a href="hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>
+ with <tt>Size_Policy</tt> = <a href="hash_exponential_size_policy.html"><tt>hash_exponential_size_policy</tt></a>
+, and <tt>Trigger_Policy</tt> = <a href="hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>
+ with <i>&alpha;<sub>min</sub></i> = <i>1/8</i> and <i>&alpha;<sub>max</sub></i> = <i>1/2</i>, mapping each key to <a href="list_update.html"><tt>list_update</tt></a>
+ with <tt>Update_Policy</tt> = <a href="move_to_front_lu_policy.html"><tt>move_to_front_lu_policy</tt></a>
+</li>
+<li>
+cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_mmap_cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_set-
+<a href="cc_hash_table.html"><tt>cc_hash_table</tt></a>
+with <tt>Comb_Hash_Fn</tt> = <a href="direct_mask_range_hashing.html"><tt>direct_mask_range_hashing</tt></a>
+, and <tt>Resize_Policy</tt> = <a href="hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>
+ with <tt>Size_Policy</tt> = <a href="hash_exponential_size_policy.html"><tt>hash_exponential_size_policy</tt></a>
+, and <tt>Trigger_Policy</tt> = <a href="hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>
+ with <i>&alpha;<sub>min</sub></i> = <i>1/8</i> and <i>&alpha;<sub>max</sub></i> = <i>1/2</i>, mapping each key to <a href="cc_hash_table.html"><tt>cc_hash_table</tt></a>
+with <tt>Comb_Hash_Fn</tt> = <a href="direct_mask_range_hashing.html"><tt>direct_mask_range_hashing</tt></a>
+, and <tt>Resize_Policy</tt> = <a href="hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>
+ with <tt>Size_Policy</tt> = <a href="hash_exponential_size_policy.html"><tt>hash_exponential_size_policy</tt></a>
+, and <tt>Trigger_Policy</tt> = <a href="hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>
+ with <i>&alpha;<sub>min</sub></i> = <i>1/8</i> and <i>&alpha;<sub>max</sub></i> = <i>1/2</i></li>
+</ol>
+</div><div style="width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<div id="NHL_res_div">
+<div id="NHL_local">
+<div id="NHL_multimap_text_find_timing_test_small_s2p_hash">
+<div id="NHL_assoc">
+<div id="NHL__Native_and_primary_hash-based_multimap_types_find_timing_test"><div style = "border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NHL" id= "NHL"><img src="multimap_text_find_timing_test_small_s2p_hash_local.png" alt="no image" /></a></h6>NHL:  Native and primary hash-based multimap types find timing test - <a href = "assoc_performance_tests.html#local">local</a></div><div style = "width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<h2><a name="observations" id="observations">Observations</a></h2>
+<p>See <a href="assoc_performance_tests.html#msc">Observations::Mapping-Semantics
+    Considerations</a>.</p>
+</div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_find_timing_test_small_s2p_hash_gcc.png b/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_find_timing_test_small_s2p_hash_gcc.png
new file mode 100644
index 00000000000..60e850937a9
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_find_timing_test_small_s2p_hash_gcc.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_find_timing_test_small_s2p_hash_local.png b/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_find_timing_test_small_s2p_hash_local.png
new file mode 100644
index 00000000000..a8fa261177b
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_find_timing_test_small_s2p_hash_local.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_find_timing_test_small_s2p_hash_msvc.png b/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_find_timing_test_small_s2p_hash_msvc.png
new file mode 100644
index 00000000000..11aa9e07b6a
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_find_timing_test_small_s2p_hash_msvc.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_find_timing_test_small_s2p_tree_gcc.png b/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_find_timing_test_small_s2p_tree_gcc.png
new file mode 100644
index 00000000000..f54369b15b4
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_find_timing_test_small_s2p_tree_gcc.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_find_timing_test_small_s2p_tree_local.png b/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_find_timing_test_small_s2p_tree_local.png
new file mode 100644
index 00000000000..b3d10612f79
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_find_timing_test_small_s2p_tree_local.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_find_timing_test_small_s2p_tree_msvc.png b/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_find_timing_test_small_s2p_tree_msvc.png
new file mode 100644
index 00000000000..035fd9389b6
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_find_timing_test_small_s2p_tree_msvc.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_insert_mem_usage_test_large.html b/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_insert_mem_usage_test_large.html
new file mode 100644
index 00000000000..00d4146d7dc
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_insert_mem_usage_test_large.html
@@ -0,0 +1,210 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+<meta name="generator" content="HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+<title>Hash-List "Multimap" Text Memory Use Test with Large
+  Average Secondary-Key to Primary-Key Ratio</title>
+<meta http-equiv="Content-Type" content="text/html; charset=us-ascii" />
+</head>
+<body>
+<div id="page">
+<h1>"Multimap" Text Memory Use Test with Large Average
+    Secondary-Key to Primary-Key Ratio</h1>
+<h2><a name="description" id="description">Description</a></h2>
+<p>This test inserts a number of pairs into a container. The
+    first item of each pair is a string from an arbitrary text
+    [<a href="references.html#wickland96thirty">wickland96thirty</a>], and
+    the second is a uniform i.i.d.integer. The container is a
+    "multimap" - it considers the first member of each pair as a
+    primary key, and the second member of each pair as a secondary
+    key (see <a href="motivation.html#assoc_mapping_semantics">Motivation::Associative
+    Containers::Alternative to Multiple Equivalent Keys</a>). There
+    are 100 distinct primary keys. The test measures the memory use
+    as a function of the number of values inserted.</p>
+<p>(The test was executed with <a href="../../../../testsuite/performance/ext/pb_ds/multimap_text_insert_mem_usage.cc"><tt>multimap_text_insert_mem_usage_test</tt></a>
+    thirty_years_among_the_dead_preproc.txt 100 200 2100 100)</p>
+<h2><a name="purpose" id="purpose">Purpose</a></h2>
+<p>The test checks the memory scalability of different
+    "multimap" designs (see <a href="motivation.html#assoc_mapping_semantics">Motivation::Associative
+    Containers::Mapping Semantics</a>).</p>
+<h2><a name="results" id="results">Results</a></h2>
+<p>Figures <a href="#NTG">NTG</a>, <a href="#NTM">NTM</a>, and
+    <a href="#NTL">NTL</a> show the results for "multimaps" which
+    use a tree-based container for primary keys, in <a href="assoc_performance_tests.html#gcc"><u>g++</u></a>, <a href="assoc_performance_tests.html#msvc"><u>msvc++</u></a>, and
+    <a href="assoc_performance_tests.html#local"><u>local</u></a>,
+    respectively; Figures <a href="#NHG"></a>NHG, <a href="#NHM">NHM</a>, and <a href="#NHL">NHL</a> show the results for
+    "multimaps" which use a hash-based container for primary keys,
+    in <a href="assoc_performance_tests.html#gcc"><u>g++</u></a>,
+    <a href="assoc_performance_tests.html#msvc"><u>msvc++</u></a>,
+    and <a href="assoc_performance_tests.html#local"><u>local</u></a>,
+    respectively.</p>
+<div id="NTG_res_div">
+<div id="NTG_gcc">
+<div id="NTG_multimap_text_insert_mem_usage_test_large_s2p_tree">
+<div id="NTG_assoc">
+<div id="NHG_Native_and_primary_tree-based_multimap_types_mem_usage_test"><div style="border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NTG" id="NTG"><img src="multimap_text_insert_mem_usage_test_large_s2p_tree_gcc.png" alt="no image" /></a></h6>NTG: NHG Native and primary tree-based multimap types mem usage test - <a href="assoc_performance_tests.html#gcc">g++</a><p>In the above figure, the names in the legends have the following meaning:</p>
+<ol>
+<li>
+rb_tree_mmap_cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_set-
+<a href="tree.html"><tt>tree</tt></a>
+ with <tt>Tag</tt> = <a href="rb_tree_tag.html"><tt>rb_tree_tag</tt></a>
+, and <tt>Node_Update</tt> = <a href="null_tree_node_update.html"><tt>null_tree_node_update</tt></a>
+, mapping each key to <a href="cc_hash_table.html"><tt>cc_hash_table</tt></a>
+with <tt>Comb_Hash_Fn</tt> = <a href="direct_mask_range_hashing.html"><tt>direct_mask_range_hashing</tt></a>
+, and <tt>Resize_Policy</tt> = <a href="hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>
+ with <tt>Size_Policy</tt> = <a href="hash_exponential_size_policy.html"><tt>hash_exponential_size_policy</tt></a>
+, and <tt>Trigger_Policy</tt> = <a href="hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>
+ with <i>&alpha;<sub>min</sub></i> = <i>1/8</i> and <i>&alpha;<sub>max</sub></i> = <i>1/2</i></li>
+<li>
+n_mmap-
+<tt>std::multimap</tt></li>
+<li>
+rb_tree_mmap_lu_mtf_set-
+<a href="tree.html"><tt>tree</tt></a>
+ with <tt>Tag</tt> = <a href="rb_tree_tag.html"><tt>rb_tree_tag</tt></a>
+, and <tt>Node_Update</tt> = <a href="null_tree_node_update.html"><tt>null_tree_node_update</tt></a>
+, mapping each key to <a href="list_update.html"><tt>list_update</tt></a>
+ with <tt>Update_Policy</tt> = <a href="move_to_front_lu_policy.html"><tt>move_to_front_lu_policy</tt></a>
+</li>
+</ol>
+</div><div style="width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<div id="NTM_res_div">
+<div id="NTM_msvc">
+<div id="NTM_multimap_text_insert_mem_usage_test_large_s2p_tree">
+<div id="NTM_assoc">
+<div id="NHM_Native_and_primary_tree-based_multimap_types_mem_usage_test"><div style="border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NTM" id="NTM"><img src="multimap_text_insert_mem_usage_test_large_s2p_tree_msvc.png" alt="no image" /></a></h6>NTM: NHM Native and primary tree-based multimap types mem usage test - <a href="assoc_performance_tests.html#msvc">msvc++</a><p>In the above figure, the names in the legends have the following meaning:</p>
+<ol>
+<li>
+n_mmap-
+<tt>std::multimap</tt></li>
+<li>
+rb_tree_mmap_cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_set-
+<a href="tree.html"><tt>tree</tt></a>
+ with <tt>Tag</tt> = <a href="rb_tree_tag.html"><tt>rb_tree_tag</tt></a>
+, and <tt>Node_Update</tt> = <a href="null_tree_node_update.html"><tt>null_tree_node_update</tt></a>
+, mapping each key to <a href="cc_hash_table.html"><tt>cc_hash_table</tt></a>
+with <tt>Comb_Hash_Fn</tt> = <a href="direct_mask_range_hashing.html"><tt>direct_mask_range_hashing</tt></a>
+, and <tt>Resize_Policy</tt> = <a href="hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>
+ with <tt>Size_Policy</tt> = <a href="hash_exponential_size_policy.html"><tt>hash_exponential_size_policy</tt></a>
+, and <tt>Trigger_Policy</tt> = <a href="hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>
+ with <i>&alpha;<sub>min</sub></i> = <i>1/8</i> and <i>&alpha;<sub>max</sub></i> = <i>1/2</i></li>
+<li>
+rb_tree_mmap_lu_mtf_set-
+<a href="tree.html"><tt>tree</tt></a>
+ with <tt>Tag</tt> = <a href="rb_tree_tag.html"><tt>rb_tree_tag</tt></a>
+, and <tt>Node_Update</tt> = <a href="null_tree_node_update.html"><tt>null_tree_node_update</tt></a>
+, mapping each key to <a href="list_update.html"><tt>list_update</tt></a>
+ with <tt>Update_Policy</tt> = <a href="move_to_front_lu_policy.html"><tt>move_to_front_lu_policy</tt></a>
+</li>
+</ol>
+</div><div style="width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<div id="NTL_res_div">
+<div id="NTL_local">
+<div id="NTL_multimap_text_insert_mem_usage_test_large_s2p_tree">
+<div id="NTL_assoc">
+<div id="NTL_Native_and_primary_tree-based_multimap_types_mem_usage_test"><div style = "border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NTL" id= "NTL"><img src="multimap_text_insert_mem_usage_test_large_s2p_tree_local.png" alt="no image" /></a></h6>NTL: Native and primary tree-based multimap types mem usage test - <a href = "assoc_performance_tests.html#local">local</a></div><div style = "width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<div id="NHG_res_div">
+<div id="NHG_gcc">
+<div id="NHG_multimap_text_insert_mem_usage_test_large_s2p_hash">
+<div id="NHG_assoc">
+<div id="NHG_Native_and_primary_hash-based_multimap_types_mem_usage_test"><div style="border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NHG" id="NHG"><img src="multimap_text_insert_mem_usage_test_large_s2p_hash_gcc.png" alt="no image" /></a></h6>NHG: Native and primary hash-based multimap types mem usage test - <a href="assoc_performance_tests.html#gcc">g++</a><p>In the above figure, the names in the legends have the following meaning:</p>
+<ol>
+<li>
+cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_mmap_cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_set-
+<a href="cc_hash_table.html"><tt>cc_hash_table</tt></a>
+with <tt>Comb_Hash_Fn</tt> = <a href="direct_mask_range_hashing.html"><tt>direct_mask_range_hashing</tt></a>
+, and <tt>Resize_Policy</tt> = <a href="hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>
+ with <tt>Size_Policy</tt> = <a href="hash_exponential_size_policy.html"><tt>hash_exponential_size_policy</tt></a>
+, and <tt>Trigger_Policy</tt> = <a href="hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>
+ with <i>&alpha;<sub>min</sub></i> = <i>1/8</i> and <i>&alpha;<sub>max</sub></i> = <i>1/2</i>, mapping each key to <a href="cc_hash_table.html"><tt>cc_hash_table</tt></a>
+with <tt>Comb_Hash_Fn</tt> = <a href="direct_mask_range_hashing.html"><tt>direct_mask_range_hashing</tt></a>
+, and <tt>Resize_Policy</tt> = <a href="hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>
+ with <tt>Size_Policy</tt> = <a href="hash_exponential_size_policy.html"><tt>hash_exponential_size_policy</tt></a>
+, and <tt>Trigger_Policy</tt> = <a href="hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>
+ with <i>&alpha;<sub>min</sub></i> = <i>1/8</i> and <i>&alpha;<sub>max</sub></i> = <i>1/2</i></li>
+<li>
+n_hash_mmap-
+<tt>__gnucxx::hash_multimap</tt></li>
+<li>
+cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_mmap_lu_mtf_set-
+<a href="cc_hash_table.html"><tt>cc_hash_table</tt></a>
+with <tt>Comb_Hash_Fn</tt> = <a href="direct_mask_range_hashing.html"><tt>direct_mask_range_hashing</tt></a>
+, and <tt>Resize_Policy</tt> = <a href="hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>
+ with <tt>Size_Policy</tt> = <a href="hash_exponential_size_policy.html"><tt>hash_exponential_size_policy</tt></a>
+, and <tt>Trigger_Policy</tt> = <a href="hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>
+ with <i>&alpha;<sub>min</sub></i> = <i>1/8</i> and <i>&alpha;<sub>max</sub></i> = <i>1/2</i>, mapping each key to <a href="list_update.html"><tt>list_update</tt></a>
+ with <tt>Update_Policy</tt> = <a href="move_to_front_lu_policy.html"><tt>move_to_front_lu_policy</tt></a>
+</li>
+</ol>
+</div><div style="width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<div id="NHM_res_div">
+<div id="NHM_msvc">
+<div id="NHM_multimap_text_insert_mem_usage_test_large_s2p_hash">
+<div id="NHM_assoc">
+<div id="NHM_Native_and_primary_hash-based_multimap_types_mem_usage_test"><div style="border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NHM" id="NHM"><img src="multimap_text_insert_mem_usage_test_large_s2p_hash_msvc.png" alt="no image" /></a></h6>NHM: Native and primary hash-based multimap types mem usage test - <a href="assoc_performance_tests.html#msvc">msvc++</a><p>In the above figure, the names in the legends have the following meaning:</p>
+<ol>
+<li>
+n_hash_mmap-
+<tt>stdext::hash_multimap</tt></li>
+<li>
+cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_mmap_cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_set-
+<a href="cc_hash_table.html"><tt>cc_hash_table</tt></a>
+with <tt>Comb_Hash_Fn</tt> = <a href="direct_mask_range_hashing.html"><tt>direct_mask_range_hashing</tt></a>
+, and <tt>Resize_Policy</tt> = <a href="hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>
+ with <tt>Size_Policy</tt> = <a href="hash_exponential_size_policy.html"><tt>hash_exponential_size_policy</tt></a>
+, and <tt>Trigger_Policy</tt> = <a href="hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>
+ with <i>&alpha;<sub>min</sub></i> = <i>1/8</i> and <i>&alpha;<sub>max</sub></i> = <i>1/2</i>, mapping each key to <a href="cc_hash_table.html"><tt>cc_hash_table</tt></a>
+with <tt>Comb_Hash_Fn</tt> = <a href="direct_mask_range_hashing.html"><tt>direct_mask_range_hashing</tt></a>
+, and <tt>Resize_Policy</tt> = <a href="hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>
+ with <tt>Size_Policy</tt> = <a href="hash_exponential_size_policy.html"><tt>hash_exponential_size_policy</tt></a>
+, and <tt>Trigger_Policy</tt> = <a href="hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>
+ with <i>&alpha;<sub>min</sub></i> = <i>1/8</i> and <i>&alpha;<sub>max</sub></i> = <i>1/2</i></li>
+<li>
+cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_mmap_lu_mtf_set-
+<a href="cc_hash_table.html"><tt>cc_hash_table</tt></a>
+with <tt>Comb_Hash_Fn</tt> = <a href="direct_mask_range_hashing.html"><tt>direct_mask_range_hashing</tt></a>
+, and <tt>Resize_Policy</tt> = <a href="hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>
+ with <tt>Size_Policy</tt> = <a href="hash_exponential_size_policy.html"><tt>hash_exponential_size_policy</tt></a>
+, and <tt>Trigger_Policy</tt> = <a href="hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>
+ with <i>&alpha;<sub>min</sub></i> = <i>1/8</i> and <i>&alpha;<sub>max</sub></i> = <i>1/2</i>, mapping each key to <a href="list_update.html"><tt>list_update</tt></a>
+ with <tt>Update_Policy</tt> = <a href="move_to_front_lu_policy.html"><tt>move_to_front_lu_policy</tt></a>
+</li>
+</ol>
+</div><div style="width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<div id="NHL_res_div">
+<div id="NHL_local">
+<div id="NHL_multimap_text_insert_mem_usage_test_large_s2p_hash">
+<div id="NHL_assoc">
+<div id="NHL__Native_and_primary_hash-based_multimap_types_mem_usage_test"><div style = "border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NHL" id= "NHL"><img src="multimap_text_insert_mem_usage_test_large_s2p_hash_local.png" alt="no image" /></a></h6>NHL:  Native and primary hash-based multimap types mem usage test - <a href = "assoc_performance_tests.html#local">local</a></div><div style = "width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<h2><a name="observations" id="observations">Observations</a></h2>
+<p>See <a href="assoc_performance_tests.html#msc">Observations::Mapping-Semantics
+    Considerations</a>.</p>
+</div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_insert_mem_usage_test_large_s2p_hash_gcc.png b/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_insert_mem_usage_test_large_s2p_hash_gcc.png
new file mode 100644
index 00000000000..51a3f8d61c1
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_insert_mem_usage_test_large_s2p_hash_gcc.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_insert_mem_usage_test_large_s2p_hash_local.png b/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_insert_mem_usage_test_large_s2p_hash_local.png
new file mode 100644
index 00000000000..8af7100c6e7
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_insert_mem_usage_test_large_s2p_hash_local.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_insert_mem_usage_test_large_s2p_hash_msvc.png b/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_insert_mem_usage_test_large_s2p_hash_msvc.png
new file mode 100644
index 00000000000..3a938c0bb0f
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_insert_mem_usage_test_large_s2p_hash_msvc.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_insert_mem_usage_test_large_s2p_tree_gcc.png b/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_insert_mem_usage_test_large_s2p_tree_gcc.png
new file mode 100644
index 00000000000..a992d8f7cfb
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_insert_mem_usage_test_large_s2p_tree_gcc.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_insert_mem_usage_test_large_s2p_tree_local.png b/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_insert_mem_usage_test_large_s2p_tree_local.png
new file mode 100644
index 00000000000..63c0c8db797
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_insert_mem_usage_test_large_s2p_tree_local.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_insert_mem_usage_test_large_s2p_tree_msvc.png b/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_insert_mem_usage_test_large_s2p_tree_msvc.png
new file mode 100644
index 00000000000..26841bd1073
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_insert_mem_usage_test_large_s2p_tree_msvc.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_insert_mem_usage_test_small.html b/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_insert_mem_usage_test_small.html
new file mode 100644
index 00000000000..63ec4a9c9db
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_insert_mem_usage_test_small.html
@@ -0,0 +1,212 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+<meta name="generator" content="HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+<title>Hash-List "Multimap" Text Memory Use Test with Small
+  Average Secondary-Key to Primary-Key Ratio</title>
+<meta http-equiv="Content-Type" content="text/html; charset=us-ascii" />
+</head>
+<body>
+<div id="page">
+<h1>"Multimap" Text Memory Use Test with Small Average
+    Secondary-Key to Primary-Key Ratio</h1>
+<h2><a name="description" id="description">Description</a></h2>
+<p>This test inserts a number of pairs into a container. The
+    first item of each pair is a string from an arbitrary text
+    [<a href="references.html#wickland96thirty">wickland96thirty</a>], and
+    the second is a uniform i.i.d.integer. The container is a
+    "multimap" - it considers the first member of each pair as a
+    primary key, and the second member of each pair as a secondary
+    key (see <a href="motivation.html#assoc_mapping_semantics">Motivation::Associative
+    Containers::Alternative to Multiple Equivalent Keys</a>). There
+    are 100 distinct primary keys, and the ratio of secondary keys
+    to primary keys ranges to about 20.</p>
+<p>The test measures the memory use as a function of the number
+    of values inserted.</p>
+<p>(The test was executed with <a href="../../../../testsuite/performance/ext/pb_ds/multimap_text_insert_mem_usage.cc"><tt>multimap_text_insert_mem_usage_test</tt></a>
+    thirty_years_among_the_dead_preproc.txt 100 3 4 4)</p>
+<h2><a name="purpose" id="purpose">Purpose</a></h2>
+<p>The test checks the memory scalability of different
+    "multimap" designs (see <a href="motivation.html#assoc_mapping_semantics">Motivation::Associative
+    Containers::Mapping Semantics</a>).</p>
+<h2><a name="results" id="results">Results</a></h2>
+<p>Figures <a href="#NTG">NTG</a>, <a href="#NTM">NTM</a>, and
+    <a href="#NTL">NTL</a> show the results for "multimaps" which
+    use a tree-based container for primary keys, in <a href="assoc_performance_tests.html#gcc"><u>g++</u></a>, <a href="assoc_performance_tests.html#msvc"><u>msvc++</u></a>, and
+    <a href="assoc_performance_tests.html#local"><u>local</u></a>,
+    respectively; Figures <a href="#NHG"></a>NHG, <a href="#NHM">NHM</a>, and <a href="#NHL">NHL</a> show the results for
+    "multimaps" which use a hash-based container for primary keys,
+    in <a href="assoc_performance_tests.html#gcc"><u>g++</u></a>,
+    <a href="assoc_performance_tests.html#msvc"><u>msvc++</u></a>,
+    and <a href="assoc_performance_tests.html#local"><u>local</u></a>,
+    respectively.</p>
+<div id="NTG_res_div">
+<div id="NTG_gcc">
+<div id="NTG_multimap_text_insert_mem_usage_test_small_s2p_tree">
+<div id="NTG_assoc">
+<div id="NTG_Native_and_primary_tree-based_multimap_types_mem_usage_test"><div style="border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NTG" id="NTG"><img src="multimap_text_insert_mem_usage_test_small_s2p_tree_gcc.png" alt="no image" /></a></h6>NTG: Native and primary tree-based multimap types mem usage test - <a href="assoc_performance_tests.html#gcc">g++</a><p>In the above figure, the names in the legends have the following meaning:</p>
+<ol>
+<li>
+rb_tree_mmap_cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_set-
+<a href="tree.html"><tt>tree</tt></a>
+ with <tt>Tag</tt> = <a href="rb_tree_tag.html"><tt>rb_tree_tag</tt></a>
+, and <tt>Node_Update</tt> = <a href="null_tree_node_update.html"><tt>null_tree_node_update</tt></a>
+, mapping each key to <a href="cc_hash_table.html"><tt>cc_hash_table</tt></a>
+with <tt>Comb_Hash_Fn</tt> = <a href="direct_mask_range_hashing.html"><tt>direct_mask_range_hashing</tt></a>
+, and <tt>Resize_Policy</tt> = <a href="hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>
+ with <tt>Size_Policy</tt> = <a href="hash_exponential_size_policy.html"><tt>hash_exponential_size_policy</tt></a>
+, and <tt>Trigger_Policy</tt> = <a href="hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>
+ with <i>&alpha;<sub>min</sub></i> = <i>1/8</i> and <i>&alpha;<sub>max</sub></i> = <i>1/2</i></li>
+<li>
+n_mmap-
+<tt>std::multimap</tt></li>
+<li>
+rb_tree_mmap_lu_mtf_set-
+<a href="tree.html"><tt>tree</tt></a>
+ with <tt>Tag</tt> = <a href="rb_tree_tag.html"><tt>rb_tree_tag</tt></a>
+, and <tt>Node_Update</tt> = <a href="null_tree_node_update.html"><tt>null_tree_node_update</tt></a>
+, mapping each key to <a href="list_update.html"><tt>list_update</tt></a>
+ with <tt>Update_Policy</tt> = <a href="move_to_front_lu_policy.html"><tt>move_to_front_lu_policy</tt></a>
+</li>
+</ol>
+</div><div style="width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<div id="NTM_res_div">
+<div id="NTM_msvc">
+<div id="NTM_multimap_text_insert_mem_usage_test_small_s2p_tree">
+<div id="NTM_assoc">
+<div id="NHM_Native_and_primary_tree-based_multimap_types_mem_usage_test"><div style="border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NTM" id="NTM"><img src="multimap_text_insert_mem_usage_test_small_s2p_tree_msvc.png" alt="no image" /></a></h6>NTM: NHM Native and primary tree-based multimap types mem usage test - <a href="assoc_performance_tests.html#msvc">msvc++</a><p>In the above figure, the names in the legends have the following meaning:</p>
+<ol>
+<li>
+rb_tree_mmap_cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_set-
+<a href="tree.html"><tt>tree</tt></a>
+ with <tt>Tag</tt> = <a href="rb_tree_tag.html"><tt>rb_tree_tag</tt></a>
+, and <tt>Node_Update</tt> = <a href="null_tree_node_update.html"><tt>null_tree_node_update</tt></a>
+, mapping each key to <a href="cc_hash_table.html"><tt>cc_hash_table</tt></a>
+with <tt>Comb_Hash_Fn</tt> = <a href="direct_mask_range_hashing.html"><tt>direct_mask_range_hashing</tt></a>
+, and <tt>Resize_Policy</tt> = <a href="hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>
+ with <tt>Size_Policy</tt> = <a href="hash_exponential_size_policy.html"><tt>hash_exponential_size_policy</tt></a>
+, and <tt>Trigger_Policy</tt> = <a href="hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>
+ with <i>&alpha;<sub>min</sub></i> = <i>1/8</i> and <i>&alpha;<sub>max</sub></i> = <i>1/2</i></li>
+<li>
+n_mmap-
+<tt>std::multimap</tt></li>
+<li>
+rb_tree_mmap_lu_mtf_set-
+<a href="tree.html"><tt>tree</tt></a>
+ with <tt>Tag</tt> = <a href="rb_tree_tag.html"><tt>rb_tree_tag</tt></a>
+, and <tt>Node_Update</tt> = <a href="null_tree_node_update.html"><tt>null_tree_node_update</tt></a>
+, mapping each key to <a href="list_update.html"><tt>list_update</tt></a>
+ with <tt>Update_Policy</tt> = <a href="move_to_front_lu_policy.html"><tt>move_to_front_lu_policy</tt></a>
+</li>
+</ol>
+</div><div style="width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<div id="NTL_res_div">
+<div id="NTL_local">
+<div id="NTL_multimap_text_insert_mem_usage_test_small_s2p_tree">
+<div id="NTL_assoc">
+<div id="NTL_Native_and_primary_tree-based_multimap_types_mem_usage_test"><div style = "border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NTL" id= "NTL"><img src="multimap_text_insert_mem_usage_test_small_s2p_tree_local.png" alt="no image" /></a></h6>NTL: Native and primary tree-based multimap types mem usage test - <a href = "assoc_performance_tests.html#local">local</a></div><div style = "width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<div id="NHG_res_div">
+<div id="NHG_gcc">
+<div id="NHG_multimap_text_insert_mem_usage_test_small_s2p_hash">
+<div id="NHG_assoc">
+<div id="NHG_Native_and_primary_hash-based_multimap_types_mem_usage_test"><div style="border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NHG" id="NHG"><img src="multimap_text_insert_mem_usage_test_small_s2p_hash_gcc.png" alt="no image" /></a></h6>NHG: Native and primary hash-based multimap types mem usage test - <a href="assoc_performance_tests.html#gcc">g++</a><p>In the above figure, the names in the legends have the following meaning:</p>
+<ol>
+<li>
+cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_mmap_cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_set-
+<a href="cc_hash_table.html"><tt>cc_hash_table</tt></a>
+with <tt>Comb_Hash_Fn</tt> = <a href="direct_mask_range_hashing.html"><tt>direct_mask_range_hashing</tt></a>
+, and <tt>Resize_Policy</tt> = <a href="hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>
+ with <tt>Size_Policy</tt> = <a href="hash_exponential_size_policy.html"><tt>hash_exponential_size_policy</tt></a>
+, and <tt>Trigger_Policy</tt> = <a href="hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>
+ with <i>&alpha;<sub>min</sub></i> = <i>1/8</i> and <i>&alpha;<sub>max</sub></i> = <i>1/2</i>, mapping each key to <a href="cc_hash_table.html"><tt>cc_hash_table</tt></a>
+with <tt>Comb_Hash_Fn</tt> = <a href="direct_mask_range_hashing.html"><tt>direct_mask_range_hashing</tt></a>
+, and <tt>Resize_Policy</tt> = <a href="hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>
+ with <tt>Size_Policy</tt> = <a href="hash_exponential_size_policy.html"><tt>hash_exponential_size_policy</tt></a>
+, and <tt>Trigger_Policy</tt> = <a href="hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>
+ with <i>&alpha;<sub>min</sub></i> = <i>1/8</i> and <i>&alpha;<sub>max</sub></i> = <i>1/2</i></li>
+<li>
+n_hash_mmap-
+<tt>__gnucxx::hash_multimap</tt></li>
+<li>
+cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_mmap_lu_mtf_set-
+<a href="cc_hash_table.html"><tt>cc_hash_table</tt></a>
+with <tt>Comb_Hash_Fn</tt> = <a href="direct_mask_range_hashing.html"><tt>direct_mask_range_hashing</tt></a>
+, and <tt>Resize_Policy</tt> = <a href="hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>
+ with <tt>Size_Policy</tt> = <a href="hash_exponential_size_policy.html"><tt>hash_exponential_size_policy</tt></a>
+, and <tt>Trigger_Policy</tt> = <a href="hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>
+ with <i>&alpha;<sub>min</sub></i> = <i>1/8</i> and <i>&alpha;<sub>max</sub></i> = <i>1/2</i>, mapping each key to <a href="list_update.html"><tt>list_update</tt></a>
+ with <tt>Update_Policy</tt> = <a href="move_to_front_lu_policy.html"><tt>move_to_front_lu_policy</tt></a>
+</li>
+</ol>
+</div><div style="width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<div id="NHM_res_div">
+<div id="NHM_msvc">
+<div id="NHM_multimap_text_insert_mem_usage_test_small_s2p_hash">
+<div id="NHM_assoc">
+<div id="NHM_Native_and_primary_hash-based_multimap_types_mem_usage_test"><div style="border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NHM" id="NHM"><img src="multimap_text_insert_mem_usage_test_small_s2p_hash_msvc.png" alt="no image" /></a></h6>NHM: Native and primary hash-based multimap types mem usage test - <a href="assoc_performance_tests.html#msvc">msvc++</a><p>In the above figure, the names in the legends have the following meaning:</p>
+<ol>
+<li>
+cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_mmap_cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_set-
+<a href="cc_hash_table.html"><tt>cc_hash_table</tt></a>
+with <tt>Comb_Hash_Fn</tt> = <a href="direct_mask_range_hashing.html"><tt>direct_mask_range_hashing</tt></a>
+, and <tt>Resize_Policy</tt> = <a href="hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>
+ with <tt>Size_Policy</tt> = <a href="hash_exponential_size_policy.html"><tt>hash_exponential_size_policy</tt></a>
+, and <tt>Trigger_Policy</tt> = <a href="hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>
+ with <i>&alpha;<sub>min</sub></i> = <i>1/8</i> and <i>&alpha;<sub>max</sub></i> = <i>1/2</i>, mapping each key to <a href="cc_hash_table.html"><tt>cc_hash_table</tt></a>
+with <tt>Comb_Hash_Fn</tt> = <a href="direct_mask_range_hashing.html"><tt>direct_mask_range_hashing</tt></a>
+, and <tt>Resize_Policy</tt> = <a href="hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>
+ with <tt>Size_Policy</tt> = <a href="hash_exponential_size_policy.html"><tt>hash_exponential_size_policy</tt></a>
+, and <tt>Trigger_Policy</tt> = <a href="hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>
+ with <i>&alpha;<sub>min</sub></i> = <i>1/8</i> and <i>&alpha;<sub>max</sub></i> = <i>1/2</i></li>
+<li>
+n_hash_mmap-
+<tt>stdext::hash_multimap</tt></li>
+<li>
+cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_mmap_lu_mtf_set-
+<a href="cc_hash_table.html"><tt>cc_hash_table</tt></a>
+with <tt>Comb_Hash_Fn</tt> = <a href="direct_mask_range_hashing.html"><tt>direct_mask_range_hashing</tt></a>
+, and <tt>Resize_Policy</tt> = <a href="hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>
+ with <tt>Size_Policy</tt> = <a href="hash_exponential_size_policy.html"><tt>hash_exponential_size_policy</tt></a>
+, and <tt>Trigger_Policy</tt> = <a href="hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>
+ with <i>&alpha;<sub>min</sub></i> = <i>1/8</i> and <i>&alpha;<sub>max</sub></i> = <i>1/2</i>, mapping each key to <a href="list_update.html"><tt>list_update</tt></a>
+ with <tt>Update_Policy</tt> = <a href="move_to_front_lu_policy.html"><tt>move_to_front_lu_policy</tt></a>
+</li>
+</ol>
+</div><div style="width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<div id="NHL_res_div">
+<div id="NHL_local">
+<div id="NHL_multimap_text_insert_mem_usage_test_small_s2p_hash">
+<div id="NHL_assoc">
+<div id="NHL__Native_and_primary_hash-based_multimap_types_mem_usage_test"><div style = "border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NHL" id= "NHL"><img src="multimap_text_insert_mem_usage_test_small_s2p_hash_local.png" alt="no image" /></a></h6>NHL:  Native and primary hash-based multimap types mem usage test - <a href = "assoc_performance_tests.html#local">local</a></div><div style = "width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<h2><a name="observations" id="observations">Observations</a></h2>
+<p>See <a href="assoc_performance_tests.html#msc">Observations::Mapping-Semantics
+    Considerations</a>.</p>
+</div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_insert_mem_usage_test_small_s2p_hash_gcc.png b/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_insert_mem_usage_test_small_s2p_hash_gcc.png
new file mode 100644
index 00000000000..d3eba9da47e
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_insert_mem_usage_test_small_s2p_hash_gcc.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_insert_mem_usage_test_small_s2p_hash_local.png b/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_insert_mem_usage_test_small_s2p_hash_local.png
new file mode 100644
index 00000000000..589dccdefa9
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_insert_mem_usage_test_small_s2p_hash_local.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_insert_mem_usage_test_small_s2p_hash_msvc.png b/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_insert_mem_usage_test_small_s2p_hash_msvc.png
new file mode 100644
index 00000000000..1828896ee5f
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_insert_mem_usage_test_small_s2p_hash_msvc.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_insert_mem_usage_test_small_s2p_tree_gcc.png b/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_insert_mem_usage_test_small_s2p_tree_gcc.png
new file mode 100644
index 00000000000..9334bc35bc7
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_insert_mem_usage_test_small_s2p_tree_gcc.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_insert_mem_usage_test_small_s2p_tree_local.png b/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_insert_mem_usage_test_small_s2p_tree_local.png
new file mode 100644
index 00000000000..d7322f287a8
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_insert_mem_usage_test_small_s2p_tree_local.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_insert_mem_usage_test_small_s2p_tree_msvc.png b/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_insert_mem_usage_test_small_s2p_tree_msvc.png
new file mode 100644
index 00000000000..2f20e57e555
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_insert_mem_usage_test_small_s2p_tree_msvc.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_insert_timing_test_large.html b/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_insert_timing_test_large.html
new file mode 100644
index 00000000000..770bae9bd64
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_insert_timing_test_large.html
@@ -0,0 +1,212 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+<meta name="generator" content="HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+<title>"Multimap" Text Insert Timing Test with Large Average
+  Secondary-Key to Primary-Key Ratio</title>
+<meta http-equiv="Content-Type" content="text/html; charset=us-ascii" />
+</head>
+<body>
+<div id="page">
+<h1>"Multimap" Text Insert Timing Test with Large Average
+    Secondary-Key to Primary-Key Ratio</h1>
+<h2><a name="description" id="description">Description</a></h2>
+<p>This test inserts a number of pairs into a container. The
+    first item of each pair is a string from an arbitrary text
+    [<a href="references.html#wickland96thirty">wickland96thirty</a>], and
+    the second is a uniform i.i.d.integer. The container is a
+    "multimap" - it considers the first member of each pair as a
+    primary key, and the second member of each pair as a secondary
+    key (see <a href="motivation.html#assoc_mapping_semantics">Motivation::Associative
+    Containers::Alternative to Multiple Equivalent Keys</a>). There
+    are 100 distinct primary keys, and the ratio of secondary keys
+    to primary keys ranges to about 20.</p>
+<p>The test measures the memory use as a function of the number
+    of values inserted.</p>
+<p>(The test was executed with <a href="../../../../testsuite/performance/ext/pb_ds/multimap_text_insert_mem_usage.cc"><tt>multimap_text_insert_mem_usage_test</tt></a>
+    thirty_years_among_the_dead_preproc.txt 400 1 6 6)</p>
+<h2><a name="purpose" id="purpose">Purpose</a></h2>
+<p>The test checks the insert-time scalability of different
+    "multimap" designs (see <a href="motivation.html#assoc_mapping_semantics">Motivation::Associative
+    Containers::Mapping Semantics</a>).</p>
+<h2><a name="results" id="results">Results</a></h2>
+<p>Figures <a href="#NTG">NTG</a>, <a href="#NTM">NTM</a>, and
+    <a href="#NTL">NTL</a> show the results for "multimaps" which
+    use a tree-based container for primary keys, in <a href="assoc_performance_tests.html#gcc"><u>g++</u></a>, <a href="assoc_performance_tests.html#msvc"><u>msvc++</u></a>, and
+    <a href="assoc_performance_tests.html#local"><u>local</u></a>,
+    respectively; Figures <a href="#NHG"></a>NHG, <a href="#NHM">NHM</a>, and <a href="#NHL">NHL</a> show the results for
+    "multimaps" which use a hash-based container for primary keys,
+    in <a href="assoc_performance_tests.html#gcc"><u>g++</u></a>,
+    <a href="assoc_performance_tests.html#msvc"><u>msvc++</u></a>,
+    and <a href="assoc_performance_tests.html#local"><u>local</u></a>,
+    respectively.</p>
+<div id="NTG_res_div">
+<div id="NTG_gcc">
+<div id="NTG_multimap_text_insert_timing_test_large_s2p_tree">
+<div id="NTG_assoc">
+<div id="NTG_Native_and_primary_tree-based_multimap_types_insert_timing_test"><div style="border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NTG" id="NTG"><img src="multimap_text_insert_timing_test_large_s2p_tree_gcc.png" alt="no image" /></a></h6>NTG: Native and primary tree-based multimap types insert timing test - <a href="assoc_performance_tests.html#gcc">g++</a><p>In the above figure, the names in the legends have the following meaning:</p>
+<ol>
+<li>
+n_mmap-
+<tt>std::multimap</tt></li>
+<li>
+rb_tree_mmap_cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_set-
+<a href="tree.html"><tt>tree</tt></a>
+ with <tt>Tag</tt> = <a href="rb_tree_tag.html"><tt>rb_tree_tag</tt></a>
+, and <tt>Node_Update</tt> = <a href="null_tree_node_update.html"><tt>null_tree_node_update</tt></a>
+, mapping each key to <a href="cc_hash_table.html"><tt>cc_hash_table</tt></a>
+with <tt>Comb_Hash_Fn</tt> = <a href="direct_mask_range_hashing.html"><tt>direct_mask_range_hashing</tt></a>
+, and <tt>Resize_Policy</tt> = <a href="hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>
+ with <tt>Size_Policy</tt> = <a href="hash_exponential_size_policy.html"><tt>hash_exponential_size_policy</tt></a>
+, and <tt>Trigger_Policy</tt> = <a href="hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>
+ with <i>&alpha;<sub>min</sub></i> = <i>1/8</i> and <i>&alpha;<sub>max</sub></i> = <i>1/2</i></li>
+<li>
+rb_tree_mmap_lu_mtf_set-
+<a href="tree.html"><tt>tree</tt></a>
+ with <tt>Tag</tt> = <a href="rb_tree_tag.html"><tt>rb_tree_tag</tt></a>
+, and <tt>Node_Update</tt> = <a href="null_tree_node_update.html"><tt>null_tree_node_update</tt></a>
+, mapping each key to <a href="list_update.html"><tt>list_update</tt></a>
+ with <tt>Update_Policy</tt> = <a href="move_to_front_lu_policy.html"><tt>move_to_front_lu_policy</tt></a>
+</li>
+</ol>
+</div><div style="width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<div id="NTM_res_div">
+<div id="NTM_msvc">
+<div id="NTM_multimap_text_insert_timing_test_large_s2p_tree">
+<div id="NTM_assoc">
+<div id="NHM_Native_and_primary_tree-based_multimap_types_insert_timing_test"><div style="border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NTM" id="NTM"><img src="multimap_text_insert_timing_test_large_s2p_tree_msvc.png" alt="no image" /></a></h6>NTM: NHM Native and primary tree-based multimap types insert timing test - <a href="assoc_performance_tests.html#msvc">msvc++</a><p>In the above figure, the names in the legends have the following meaning:</p>
+<ol>
+<li>
+rb_tree_mmap_cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_set-
+<a href="tree.html"><tt>tree</tt></a>
+ with <tt>Tag</tt> = <a href="rb_tree_tag.html"><tt>rb_tree_tag</tt></a>
+, and <tt>Node_Update</tt> = <a href="null_tree_node_update.html"><tt>null_tree_node_update</tt></a>
+, mapping each key to <a href="cc_hash_table.html"><tt>cc_hash_table</tt></a>
+with <tt>Comb_Hash_Fn</tt> = <a href="direct_mask_range_hashing.html"><tt>direct_mask_range_hashing</tt></a>
+, and <tt>Resize_Policy</tt> = <a href="hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>
+ with <tt>Size_Policy</tt> = <a href="hash_exponential_size_policy.html"><tt>hash_exponential_size_policy</tt></a>
+, and <tt>Trigger_Policy</tt> = <a href="hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>
+ with <i>&alpha;<sub>min</sub></i> = <i>1/8</i> and <i>&alpha;<sub>max</sub></i> = <i>1/2</i></li>
+<li>
+n_mmap-
+<tt>std::multimap</tt></li>
+<li>
+rb_tree_mmap_lu_mtf_set-
+<a href="tree.html"><tt>tree</tt></a>
+ with <tt>Tag</tt> = <a href="rb_tree_tag.html"><tt>rb_tree_tag</tt></a>
+, and <tt>Node_Update</tt> = <a href="null_tree_node_update.html"><tt>null_tree_node_update</tt></a>
+, mapping each key to <a href="list_update.html"><tt>list_update</tt></a>
+ with <tt>Update_Policy</tt> = <a href="move_to_front_lu_policy.html"><tt>move_to_front_lu_policy</tt></a>
+</li>
+</ol>
+</div><div style="width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<div id="NTL_res_div">
+<div id="NTL_local">
+<div id="NTL_multimap_text_insert_timing_test_large_s2p_tree">
+<div id="NTL_assoc">
+<div id="NTL_Native_and_primary_tree-based_multimap_types_insert_timing_test"><div style = "border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NTL" id= "NTL"><img src="multimap_text_insert_timing_test_large_s2p_tree_local.png" alt="no image" /></a></h6>NTL: Native and primary tree-based multimap types insert timing test - <a href = "assoc_performance_tests.html#local">local</a></div><div style = "width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<div id="NHG_res_div">
+<div id="NHG_gcc">
+<div id="NHG_multimap_text_insert_timing_test_large_s2p_hash">
+<div id="NHG_assoc">
+<div id="NHG_Native_and_primary_hash-based_multimap_types_insert_timing_test"><div style="border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NHG" id="NHG"><img src="multimap_text_insert_timing_test_large_s2p_hash_gcc.png" alt="no image" /></a></h6>NHG: Native and primary hash-based multimap types insert timing test - <a href="assoc_performance_tests.html#gcc">g++</a><p>In the above figure, the names in the legends have the following meaning:</p>
+<ol>
+<li>
+n_hash_mmap-
+<tt>__gnucxx::hash_multimap</tt></li>
+<li>
+cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_mmap_cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_set-
+<a href="cc_hash_table.html"><tt>cc_hash_table</tt></a>
+with <tt>Comb_Hash_Fn</tt> = <a href="direct_mask_range_hashing.html"><tt>direct_mask_range_hashing</tt></a>
+, and <tt>Resize_Policy</tt> = <a href="hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>
+ with <tt>Size_Policy</tt> = <a href="hash_exponential_size_policy.html"><tt>hash_exponential_size_policy</tt></a>
+, and <tt>Trigger_Policy</tt> = <a href="hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>
+ with <i>&alpha;<sub>min</sub></i> = <i>1/8</i> and <i>&alpha;<sub>max</sub></i> = <i>1/2</i>, mapping each key to <a href="cc_hash_table.html"><tt>cc_hash_table</tt></a>
+with <tt>Comb_Hash_Fn</tt> = <a href="direct_mask_range_hashing.html"><tt>direct_mask_range_hashing</tt></a>
+, and <tt>Resize_Policy</tt> = <a href="hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>
+ with <tt>Size_Policy</tt> = <a href="hash_exponential_size_policy.html"><tt>hash_exponential_size_policy</tt></a>
+, and <tt>Trigger_Policy</tt> = <a href="hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>
+ with <i>&alpha;<sub>min</sub></i> = <i>1/8</i> and <i>&alpha;<sub>max</sub></i> = <i>1/2</i></li>
+<li>
+cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_mmap_lu_mtf_set-
+<a href="cc_hash_table.html"><tt>cc_hash_table</tt></a>
+with <tt>Comb_Hash_Fn</tt> = <a href="direct_mask_range_hashing.html"><tt>direct_mask_range_hashing</tt></a>
+, and <tt>Resize_Policy</tt> = <a href="hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>
+ with <tt>Size_Policy</tt> = <a href="hash_exponential_size_policy.html"><tt>hash_exponential_size_policy</tt></a>
+, and <tt>Trigger_Policy</tt> = <a href="hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>
+ with <i>&alpha;<sub>min</sub></i> = <i>1/8</i> and <i>&alpha;<sub>max</sub></i> = <i>1/2</i>, mapping each key to <a href="list_update.html"><tt>list_update</tt></a>
+ with <tt>Update_Policy</tt> = <a href="move_to_front_lu_policy.html"><tt>move_to_front_lu_policy</tt></a>
+</li>
+</ol>
+</div><div style="width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<div id="NHM_res_div">
+<div id="NHM_msvc">
+<div id="NHM_multimap_text_insert_timing_test_large_s2p_hash">
+<div id="NHM_assoc">
+<div id="NHM_Native_and_primary_hash-based_multimap_types_insert_timing_test"><div style="border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NHM" id="NHM"><img src="multimap_text_insert_timing_test_large_s2p_hash_msvc.png" alt="no image" /></a></h6>NHM: Native and primary hash-based multimap types insert timing test - <a href="assoc_performance_tests.html#msvc">msvc++</a><p>In the above figure, the names in the legends have the following meaning:</p>
+<ol>
+<li>
+n_hash_mmap-
+<tt>stdext::hash_multimap</tt></li>
+<li>
+cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_mmap_cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_set-
+<a href="cc_hash_table.html"><tt>cc_hash_table</tt></a>
+with <tt>Comb_Hash_Fn</tt> = <a href="direct_mask_range_hashing.html"><tt>direct_mask_range_hashing</tt></a>
+, and <tt>Resize_Policy</tt> = <a href="hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>
+ with <tt>Size_Policy</tt> = <a href="hash_exponential_size_policy.html"><tt>hash_exponential_size_policy</tt></a>
+, and <tt>Trigger_Policy</tt> = <a href="hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>
+ with <i>&alpha;<sub>min</sub></i> = <i>1/8</i> and <i>&alpha;<sub>max</sub></i> = <i>1/2</i>, mapping each key to <a href="cc_hash_table.html"><tt>cc_hash_table</tt></a>
+with <tt>Comb_Hash_Fn</tt> = <a href="direct_mask_range_hashing.html"><tt>direct_mask_range_hashing</tt></a>
+, and <tt>Resize_Policy</tt> = <a href="hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>
+ with <tt>Size_Policy</tt> = <a href="hash_exponential_size_policy.html"><tt>hash_exponential_size_policy</tt></a>
+, and <tt>Trigger_Policy</tt> = <a href="hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>
+ with <i>&alpha;<sub>min</sub></i> = <i>1/8</i> and <i>&alpha;<sub>max</sub></i> = <i>1/2</i></li>
+<li>
+cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_mmap_lu_mtf_set-
+<a href="cc_hash_table.html"><tt>cc_hash_table</tt></a>
+with <tt>Comb_Hash_Fn</tt> = <a href="direct_mask_range_hashing.html"><tt>direct_mask_range_hashing</tt></a>
+, and <tt>Resize_Policy</tt> = <a href="hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>
+ with <tt>Size_Policy</tt> = <a href="hash_exponential_size_policy.html"><tt>hash_exponential_size_policy</tt></a>
+, and <tt>Trigger_Policy</tt> = <a href="hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>
+ with <i>&alpha;<sub>min</sub></i> = <i>1/8</i> and <i>&alpha;<sub>max</sub></i> = <i>1/2</i>, mapping each key to <a href="list_update.html"><tt>list_update</tt></a>
+ with <tt>Update_Policy</tt> = <a href="move_to_front_lu_policy.html"><tt>move_to_front_lu_policy</tt></a>
+</li>
+</ol>
+</div><div style="width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<div id="NHL_res_div">
+<div id="NHL_local">
+<div id="NHL_multimap_text_insert_timing_test_large_s2p_hash">
+<div id="NHL_assoc">
+<div id="NHL__Native_and_primary_hash-based_multimap_types_insert_timing_test"><div style = "border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NHL" id= "NHL"><img src="multimap_text_insert_timing_test_large_s2p_hash_local.png" alt="no image" /></a></h6>NHL:  Native and primary hash-based multimap types insert timing test - <a href = "assoc_performance_tests.html#local">local</a></div><div style = "width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<h2><a name="observations" id="observations">Observations</a></h2>
+<p>See <a href="assoc_performance_tests.html#msc">Observations::Mapping-Semantics
+    Considerations</a>.</p>
+</div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_insert_timing_test_large_s2p_hash_gcc.png b/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_insert_timing_test_large_s2p_hash_gcc.png
new file mode 100644
index 00000000000..55b0bf46732
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_insert_timing_test_large_s2p_hash_gcc.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_insert_timing_test_large_s2p_hash_local.png b/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_insert_timing_test_large_s2p_hash_local.png
new file mode 100644
index 00000000000..5f89460087a
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_insert_timing_test_large_s2p_hash_local.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_insert_timing_test_large_s2p_hash_msvc.png b/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_insert_timing_test_large_s2p_hash_msvc.png
new file mode 100644
index 00000000000..02f5d0b20ae
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_insert_timing_test_large_s2p_hash_msvc.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_insert_timing_test_large_s2p_tree_gcc.png b/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_insert_timing_test_large_s2p_tree_gcc.png
new file mode 100644
index 00000000000..83366eb3756
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_insert_timing_test_large_s2p_tree_gcc.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_insert_timing_test_large_s2p_tree_local.png b/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_insert_timing_test_large_s2p_tree_local.png
new file mode 100644
index 00000000000..2b496b48d78
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_insert_timing_test_large_s2p_tree_local.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_insert_timing_test_large_s2p_tree_msvc.png b/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_insert_timing_test_large_s2p_tree_msvc.png
new file mode 100644
index 00000000000..47196bff7f2
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_insert_timing_test_large_s2p_tree_msvc.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_insert_timing_test_small.html b/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_insert_timing_test_small.html
new file mode 100644
index 00000000000..bf9ff30b364
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_insert_timing_test_small.html
@@ -0,0 +1,217 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+<meta name="generator" content="HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+<title>"Multimap" Text Insert Timing Test with Small Average
+  Secondary-Key to Primary-Key Ratio</title>
+<meta http-equiv="Content-Type" content="text/html; charset=us-ascii" />
+</head>
+<body>
+<div id="page">
+<h1>"Multimap" Text Insert Timing Test with Small Average
+    Secondary-Key to Primary-Key Ratio</h1>
+<h2><a name="description" id="description">Description</a></h2>
+<p>This test inserts a number of pairs into a container. The
+    first item of each pair is a string from an arbitrary text
+    [<a href="references.html#wickland96thirty">wickland96thirty</a>], and
+    the second is a uniform i.i.d.integer. The container is a
+    "multimap" - it considers the first member of each pair as a
+    primary key, and the second member of each pair as a secondary
+    key (see <a href="motivation.html#assoc_mapping_semantics">Motivation::Associative
+    Containers::Alternative to Multiple Equivalent Keys</a>). There
+    are 400 distinct primary keys, and the ratio of secondary keys
+    to primary keys ranges from 1 to 5.</p>
+<p>The test measures the average insert-time as a function of
+    the number of values inserted. For <tt>pb_ds</tt>'s containers,
+    it inserts a primary key into the primary associative
+    container, then a secondary key into the secondary associative
+    container. For the native multimaps, it obtains a range using
+    <tt>std::equal_range</tt>, and inserts a value only if it was
+    not contained already.</p>
+<p>(The test was executed with <a href="../../../../testsuite/performance/ext/pb_ds/multimap_text_insert_timing.cc"><tt>multimap_text_insert_timing_test</tt></a>
+    thirty_years_among_the_dead_preproc.txt 400 1 1 6)</p>
+<h2><a name="purpose" id="purpose">Purpose</a></h2>
+<p>The test checks the insert-time scalability of different
+    "multimap" designs (see <a href="motivation.html#assoc_mapping_semantics">Motivation::Associative
+    Containers::Alternative to Multiple Equivalent Keys</a>).</p>
+<h2><a name="results" id="results">Results</a></h2>
+<p>Figures <a href="#NTG">NTG</a>, <a href="#NTM">NTM</a>, and
+    <a href="#NTL">NTL</a> show the results for "multimaps" which
+    use a tree-based container for primary keys, in <a href="assoc_performance_tests.html#gcc"><u>g++</u></a>, <a href="assoc_performance_tests.html#msvc"><u>msvc++</u></a>, and
+    <a href="assoc_performance_tests.html#local"><u>local</u></a>,
+    respectively; Figures <a href="#NHG"></a>NHG, <a href="#NHM">NHM</a>, and <a href="#NHL">NHL</a> show the results for
+    "multimaps" which use a hash-based container for primary keys,
+    in <a href="assoc_performance_tests.html#gcc"><u>g++</u></a>,
+    <a href="assoc_performance_tests.html#msvc"><u>msvc++</u></a>,
+    and <a href="assoc_performance_tests.html#local"><u>local</u></a>,
+    respectively.</p>
+<div id="NTG_res_div">
+<div id="NTG_gcc">
+<div id="NTG_multimap_text_insert_timing_test_small_s2p_tree">
+<div id="NTG_assoc">
+<div id="NTG_Native_and_primary_tree-based_multimap_types_insert_timing_test"><div style="border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NTG" id="NTG"><img src="multimap_text_insert_timing_test_small_s2p_tree_gcc.png" alt="no image" /></a></h6>NTG: Native and primary tree-based multimap types insert timing test - <a href="assoc_performance_tests.html#gcc">g++</a><p>In the above figure, the names in the legends have the following meaning:</p>
+<ol>
+<li>
+n_mmap-
+<tt>std::multimap</tt></li>
+<li>
+rb_tree_mmap_cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_set-
+<a href="tree.html"><tt>tree</tt></a>
+ with <tt>Tag</tt> = <a href="rb_tree_tag.html"><tt>rb_tree_tag</tt></a>
+, and <tt>Node_Update</tt> = <a href="null_tree_node_update.html"><tt>null_tree_node_update</tt></a>
+, mapping each key to <a href="cc_hash_table.html"><tt>cc_hash_table</tt></a>
+with <tt>Comb_Hash_Fn</tt> = <a href="direct_mask_range_hashing.html"><tt>direct_mask_range_hashing</tt></a>
+, and <tt>Resize_Policy</tt> = <a href="hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>
+ with <tt>Size_Policy</tt> = <a href="hash_exponential_size_policy.html"><tt>hash_exponential_size_policy</tt></a>
+, and <tt>Trigger_Policy</tt> = <a href="hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>
+ with <i>&alpha;<sub>min</sub></i> = <i>1/8</i> and <i>&alpha;<sub>max</sub></i> = <i>1/2</i></li>
+<li>
+rb_tree_mmap_lu_mtf_set-
+<a href="tree.html"><tt>tree</tt></a>
+ with <tt>Tag</tt> = <a href="rb_tree_tag.html"><tt>rb_tree_tag</tt></a>
+, and <tt>Node_Update</tt> = <a href="null_tree_node_update.html"><tt>null_tree_node_update</tt></a>
+, mapping each key to <a href="list_update.html"><tt>list_update</tt></a>
+ with <tt>Update_Policy</tt> = <a href="move_to_front_lu_policy.html"><tt>move_to_front_lu_policy</tt></a>
+</li>
+</ol>
+</div><div style="width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<div id="NTM_res_div">
+<div id="NTM_msvc">
+<div id="NTM_multimap_text_insert_timing_test_small_s2p_tree">
+<div id="NTM_assoc">
+<div id="NHM_Native_and_primary_tree-based_multimap_types_insert_timing_test"><div style="border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NTM" id="NTM"><img src="multimap_text_insert_timing_test_small_s2p_tree_msvc.png" alt="no image" /></a></h6>NTM: NHM Native and primary tree-based multimap types insert timing test - <a href="assoc_performance_tests.html#msvc">msvc++</a><p>In the above figure, the names in the legends have the following meaning:</p>
+<ol>
+<li>
+rb_tree_mmap_cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_set-
+<a href="tree.html"><tt>tree</tt></a>
+ with <tt>Tag</tt> = <a href="rb_tree_tag.html"><tt>rb_tree_tag</tt></a>
+, and <tt>Node_Update</tt> = <a href="null_tree_node_update.html"><tt>null_tree_node_update</tt></a>
+, mapping each key to <a href="cc_hash_table.html"><tt>cc_hash_table</tt></a>
+with <tt>Comb_Hash_Fn</tt> = <a href="direct_mask_range_hashing.html"><tt>direct_mask_range_hashing</tt></a>
+, and <tt>Resize_Policy</tt> = <a href="hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>
+ with <tt>Size_Policy</tt> = <a href="hash_exponential_size_policy.html"><tt>hash_exponential_size_policy</tt></a>
+, and <tt>Trigger_Policy</tt> = <a href="hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>
+ with <i>&alpha;<sub>min</sub></i> = <i>1/8</i> and <i>&alpha;<sub>max</sub></i> = <i>1/2</i></li>
+<li>
+n_mmap-
+<tt>std::multimap</tt></li>
+<li>
+rb_tree_mmap_lu_mtf_set-
+<a href="tree.html"><tt>tree</tt></a>
+ with <tt>Tag</tt> = <a href="rb_tree_tag.html"><tt>rb_tree_tag</tt></a>
+, and <tt>Node_Update</tt> = <a href="null_tree_node_update.html"><tt>null_tree_node_update</tt></a>
+, mapping each key to <a href="list_update.html"><tt>list_update</tt></a>
+ with <tt>Update_Policy</tt> = <a href="move_to_front_lu_policy.html"><tt>move_to_front_lu_policy</tt></a>
+</li>
+</ol>
+</div><div style="width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<div id="NTL_res_div">
+<div id="NTL_local">
+<div id="NTL_multimap_text_insert_timing_test_small_s2p_tree">
+<div id="NTL_assoc">
+<div id="NTL_Native_and_primary_tree-based_multimap_types_insert_timing_test"><div style = "border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NTL" id= "NTL"><img src="multimap_text_insert_timing_test_small_s2p_tree_local.png" alt="no image" /></a></h6>NTL: Native and primary tree-based multimap types insert timing test - <a href = "assoc_performance_tests.html#local">local</a></div><div style = "width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<div id="NHG_res_div">
+<div id="NHG_gcc">
+<div id="NHG_multimap_text_insert_timing_test_small_s2p_hash">
+<div id="NHG_assoc">
+<div id="NHG_Native_and_primary_hash-based_multimap_types_insert_timing_test"><div style="border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NHG" id="NHG"><img src="multimap_text_insert_timing_test_small_s2p_hash_gcc.png" alt="no image" /></a></h6>NHG: Native and primary hash-based multimap types insert timing test - <a href="assoc_performance_tests.html#gcc">g++</a><p>In the above figure, the names in the legends have the following meaning:</p>
+<ol>
+<li>
+n_hash_mmap-
+<tt>__gnucxx::hash_multimap</tt></li>
+<li>
+cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_mmap_cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_set-
+<a href="cc_hash_table.html"><tt>cc_hash_table</tt></a>
+with <tt>Comb_Hash_Fn</tt> = <a href="direct_mask_range_hashing.html"><tt>direct_mask_range_hashing</tt></a>
+, and <tt>Resize_Policy</tt> = <a href="hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>
+ with <tt>Size_Policy</tt> = <a href="hash_exponential_size_policy.html"><tt>hash_exponential_size_policy</tt></a>
+, and <tt>Trigger_Policy</tt> = <a href="hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>
+ with <i>&alpha;<sub>min</sub></i> = <i>1/8</i> and <i>&alpha;<sub>max</sub></i> = <i>1/2</i>, mapping each key to <a href="cc_hash_table.html"><tt>cc_hash_table</tt></a>
+with <tt>Comb_Hash_Fn</tt> = <a href="direct_mask_range_hashing.html"><tt>direct_mask_range_hashing</tt></a>
+, and <tt>Resize_Policy</tt> = <a href="hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>
+ with <tt>Size_Policy</tt> = <a href="hash_exponential_size_policy.html"><tt>hash_exponential_size_policy</tt></a>
+, and <tt>Trigger_Policy</tt> = <a href="hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>
+ with <i>&alpha;<sub>min</sub></i> = <i>1/8</i> and <i>&alpha;<sub>max</sub></i> = <i>1/2</i></li>
+<li>
+cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_mmap_lu_mtf_set-
+<a href="cc_hash_table.html"><tt>cc_hash_table</tt></a>
+with <tt>Comb_Hash_Fn</tt> = <a href="direct_mask_range_hashing.html"><tt>direct_mask_range_hashing</tt></a>
+, and <tt>Resize_Policy</tt> = <a href="hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>
+ with <tt>Size_Policy</tt> = <a href="hash_exponential_size_policy.html"><tt>hash_exponential_size_policy</tt></a>
+, and <tt>Trigger_Policy</tt> = <a href="hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>
+ with <i>&alpha;<sub>min</sub></i> = <i>1/8</i> and <i>&alpha;<sub>max</sub></i> = <i>1/2</i>, mapping each key to <a href="list_update.html"><tt>list_update</tt></a>
+ with <tt>Update_Policy</tt> = <a href="move_to_front_lu_policy.html"><tt>move_to_front_lu_policy</tt></a>
+</li>
+</ol>
+</div><div style="width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<div id="NHM_res_div">
+<div id="NHM_msvc">
+<div id="NHM_multimap_text_insert_timing_test_small_s2p_hash">
+<div id="NHM_assoc">
+<div id="NHM_Native_and_primary_hash-based_multimap_types_insert_timing_test"><div style="border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NHM" id="NHM"><img src="multimap_text_insert_timing_test_small_s2p_hash_msvc.png" alt="no image" /></a></h6>NHM: Native and primary hash-based multimap types insert timing test - <a href="assoc_performance_tests.html#msvc">msvc++</a><p>In the above figure, the names in the legends have the following meaning:</p>
+<ol>
+<li>
+cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_mmap_cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_set-
+<a href="cc_hash_table.html"><tt>cc_hash_table</tt></a>
+with <tt>Comb_Hash_Fn</tt> = <a href="direct_mask_range_hashing.html"><tt>direct_mask_range_hashing</tt></a>
+, and <tt>Resize_Policy</tt> = <a href="hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>
+ with <tt>Size_Policy</tt> = <a href="hash_exponential_size_policy.html"><tt>hash_exponential_size_policy</tt></a>
+, and <tt>Trigger_Policy</tt> = <a href="hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>
+ with <i>&alpha;<sub>min</sub></i> = <i>1/8</i> and <i>&alpha;<sub>max</sub></i> = <i>1/2</i>, mapping each key to <a href="cc_hash_table.html"><tt>cc_hash_table</tt></a>
+with <tt>Comb_Hash_Fn</tt> = <a href="direct_mask_range_hashing.html"><tt>direct_mask_range_hashing</tt></a>
+, and <tt>Resize_Policy</tt> = <a href="hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>
+ with <tt>Size_Policy</tt> = <a href="hash_exponential_size_policy.html"><tt>hash_exponential_size_policy</tt></a>
+, and <tt>Trigger_Policy</tt> = <a href="hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>
+ with <i>&alpha;<sub>min</sub></i> = <i>1/8</i> and <i>&alpha;<sub>max</sub></i> = <i>1/2</i></li>
+<li>
+n_hash_mmap-
+<tt>stdext::hash_multimap</tt></li>
+<li>
+cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_mmap_lu_mtf_set-
+<a href="cc_hash_table.html"><tt>cc_hash_table</tt></a>
+with <tt>Comb_Hash_Fn</tt> = <a href="direct_mask_range_hashing.html"><tt>direct_mask_range_hashing</tt></a>
+, and <tt>Resize_Policy</tt> = <a href="hash_standard_resize_policy.html"><tt>hash_standard_resize_policy</tt></a>
+ with <tt>Size_Policy</tt> = <a href="hash_exponential_size_policy.html"><tt>hash_exponential_size_policy</tt></a>
+, and <tt>Trigger_Policy</tt> = <a href="hash_load_check_resize_trigger.html"><tt>hash_load_check_resize_trigger</tt></a>
+ with <i>&alpha;<sub>min</sub></i> = <i>1/8</i> and <i>&alpha;<sub>max</sub></i> = <i>1/2</i>, mapping each key to <a href="list_update.html"><tt>list_update</tt></a>
+ with <tt>Update_Policy</tt> = <a href="move_to_front_lu_policy.html"><tt>move_to_front_lu_policy</tt></a>
+</li>
+</ol>
+</div><div style="width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<div id="NHL_res_div">
+<div id="NHL_local">
+<div id="NHL_multimap_text_insert_timing_test_small_s2p_hash">
+<div id="NHL_assoc">
+<div id="NHL_Native_and_primary_hash-based_multimap_types_insert_timing_test"><div style = "border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NHL" id= "NHL"><img src="multimap_text_insert_timing_test_small_s2p_hash_local.png" alt="no image" /></a></h6>NHL: Native and primary hash-based multimap types insert timing test - <a href = "assoc_performance_tests.html#local">local</a></div><div style = "width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<h2><a name="observations" id="observations">Observations</a></h2>
+<p>See <a href="assoc_performance_tests.html#msc">Observations::Mapping-Semantics
+    Considerations</a>.</p>
+</div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_insert_timing_test_small_s2p_hash_gcc.png b/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_insert_timing_test_small_s2p_hash_gcc.png
new file mode 100644
index 00000000000..3c2d87ecfac
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_insert_timing_test_small_s2p_hash_gcc.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_insert_timing_test_small_s2p_hash_local.png b/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_insert_timing_test_small_s2p_hash_local.png
new file mode 100644
index 00000000000..4af78faa524
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_insert_timing_test_small_s2p_hash_local.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_insert_timing_test_small_s2p_hash_msvc.png b/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_insert_timing_test_small_s2p_hash_msvc.png
new file mode 100644
index 00000000000..81d5839044e
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_insert_timing_test_small_s2p_hash_msvc.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_insert_timing_test_small_s2p_tree_gcc.png b/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_insert_timing_test_small_s2p_tree_gcc.png
new file mode 100644
index 00000000000..368f07350c2
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_insert_timing_test_small_s2p_tree_gcc.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_insert_timing_test_small_s2p_tree_local.png b/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_insert_timing_test_small_s2p_tree_local.png
new file mode 100644
index 00000000000..40b5b2c4327
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_insert_timing_test_small_s2p_tree_local.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_insert_timing_test_small_s2p_tree_msvc.png b/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_insert_timing_test_small_s2p_tree_msvc.png
new file mode 100644
index 00000000000..99f2d690fa5
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/multimap_text_insert_timing_test_small_s2p_tree_msvc.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/node_invariant_invalidations.png b/libstdc++-v3/docs/html/ext/pb_ds/node_invariant_invalidations.png
new file mode 100644
index 00000000000..bbd91842ba8
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/node_invariant_invalidations.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/node_invariants.png b/libstdc++-v3/docs/html/ext/pb_ds/node_invariants.png
new file mode 100644
index 00000000000..b375f5168d7
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/node_invariants.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/null_hash_fn.html b/libstdc++-v3/docs/html/ext/pb_ds/null_hash_fn.html
new file mode 100644
index 00000000000..5d952245975
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/null_hash_fn.html
@@ -0,0 +1,32 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+  <meta name="generator" content=
+  "HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+
+  <title>null_hash_fn Interface</title>
+  <meta http-equiv="Content-Type" content=
+  "text/html; charset=us-ascii" />
+  </head>
+
+<body>
+  <div id="page">
+    <h1><tt>null_hash_fn</tt> Interface</h1>
+
+    <p>A "null" hash function, indicating that the combining hash
+    function is actually a ranged hash function.</p>
+
+    <p><a href=
+    "concepts.html#concepts_null_policies">Interface::Concepts::Null
+    Policy Classes</a> explains the concept of a null policy. See
+    also <a href=
+    "hash_based_containers.html#hash_policies">Design::Hash-Based
+    Containers::Hash Policies</a>.</p>
+
+    <p>Defined in: <a href=
+    "../../../../include/ext/pb_ds/hash_policy.hpp"><tt>hash_policy.hpp</tt></a></p>
+  </div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/null_lu_metadata.html b/libstdc++-v3/docs/html/ext/pb_ds/null_lu_metadata.html
new file mode 100644
index 00000000000..1cbf9cc347d
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/null_lu_metadata.html
@@ -0,0 +1,25 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+  <meta name="generator" content=
+  "HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+
+  <title>null_lu_metadata Interface</title>
+  <meta http-equiv="Content-Type" content=
+  "text/html; charset=us-ascii" />
+  </head>
+
+<body>
+  <div id="page">
+    <h1><tt>null_lu_metadata</tt> Interface</h1>
+
+    <p>A null type that means that each link in a list-based
+    container does not actually need metadata.</p>
+
+    <p>Defined in: <a href=
+    "../../../../include/ext/pb_ds/list_update_policy.hpp"><tt>list_update_policy.hpp</tt></a></p>
+  </div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/null_mapped_type.html b/libstdc++-v3/docs/html/ext/pb_ds/null_mapped_type.html
new file mode 100644
index 00000000000..5be7359e09f
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/null_mapped_type.html
@@ -0,0 +1,25 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+  <meta name="generator" content=
+  "HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+
+  <title>null_mapped_type Interface</title>
+  <meta http-equiv="Content-Type" content=
+  "text/html; charset=us-ascii" />
+  </head>
+
+<body>
+  <div id="page">
+    <h1><tt>null_mapped_type</tt> Interface</h1>
+
+    <p>A mapped-policy indicating that an associative container is
+    a "set"</p>
+
+    <p>Defined in: <a href=
+    "../../../../include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
+  </div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/null_probe_fn.html b/libstdc++-v3/docs/html/ext/pb_ds/null_probe_fn.html
new file mode 100644
index 00000000000..af9379b8cf3
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/null_probe_fn.html
@@ -0,0 +1,29 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+  <meta name="generator" content=
+  "HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+
+  <title>null_probe_fn Interface</title>
+  <meta http-equiv="Content-Type" content=
+  "text/html; charset=us-ascii" />
+  </head>
+
+<body>
+  <div id="page">
+    <h1><tt>null_probe_fn</tt> Interface</h1>
+
+    <p>A "null" probe function, indicating that the combining probe
+    function is actually a ranged probe function.</p>
+
+    <p><a href=
+    "concepts.html#concepts_null_policies">Interface::Concepts::Null
+    Policy Classes</a> explains the concept of a null policy.</p>
+
+    <p>Defined in: <a href=
+    "../../../../include/ext/pb_ds/hash_policy.hpp"><tt>hash_policy.hpp</tt></a></p>
+  </div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/null_tree_node_update.html b/libstdc++-v3/docs/html/ext/pb_ds/null_tree_node_update.html
new file mode 100644
index 00000000000..98960ed9bf9
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/null_tree_node_update.html
@@ -0,0 +1,101 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+  <meta name="generator" content=
+  "HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+
+  <title>null_tree_node_update Interface</title>
+  <meta http-equiv="Content-Type" content=
+  "text/html; charset=us-ascii" />
+  </head>
+
+<body>
+  <div id="page">
+    <h1><tt>null_tree_node_update</tt> Interface</h1>
+
+    <p>A "null" node updater, indicating that no node updates are
+    required.</p>
+
+    <p><a href=
+    "concepts.html#concepts_null_policies">Interface::Concepts::Null
+    Policy Classes</a> explains the concept of a null policy.</p>
+
+    <p>Defined in: <a href=
+    "../../../../include/ext/pb_ds/tree_policy.hpp"><tt>tree_policy.hpp</tt></a></p>
+
+    <h2><a name="link1" id="link1">Template Parameters</a></h2>
+
+    <table class="c1" width="100%" border="1" summary=
+    "Template Parameters">
+      <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_Node_Iterator1933878761" id=
+"Const_Node_Iterator1933878761"><b>class</b> Const_Node_Iterator</a>
+</pre>
+        </td>
+
+        <td>
+          <p>Const node iterator type.</p>
+        </td>
+
+        <td>-</td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="Node_Iterator4206909839" id=
+"Node_Iterator4206909839"><b>class</b> Node_Iterator</a>
+</pre>
+        </td>
+
+        <td>
+          <p>Node iterator type.</p>
+        </td>
+
+        <td>-</td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="Cmp_Fn294335" id="Cmp_Fn294335"><b>class</b> Cmp_Fn</a>
+</pre>
+        </td>
+
+        <td>
+          <p>Comparison functor.</p>
+        </td>
+
+        <td>-</td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="Allocator35940069" id=
+"Allocator35940069"><b>class</b> Allocator</a>
+</pre>
+        </td>
+
+        <td>
+          <p>Allocator type.</p>
+        </td>
+
+        <td>-</td>
+      </tr>
+    </table>
+  </div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/null_trie_node_update.html b/libstdc++-v3/docs/html/ext/pb_ds/null_trie_node_update.html
new file mode 100644
index 00000000000..c6c0844bc60
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/null_trie_node_update.html
@@ -0,0 +1,102 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+  <meta name="generator" content=
+  "HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+
+  <title>null_trie_node_update Interface</title>
+  <meta http-equiv="Content-Type" content=
+  "text/html; charset=us-ascii" />
+  </head>
+
+<body>
+  <div id="page">
+    <h1><tt>null_trie_node_update</tt> Interface</h1>
+
+    <p>A "null" node updater, indicating that no node updates are
+    required.</p>
+
+    <p><a href=
+    "concepts.html#concepts_null_policies">Interface::Concepts::Null
+    Policy Classes</a> explains the concept of a null policy.</p>
+
+    <p>Defined in: <a href=
+    "../../../../include/ext/pb_ds/trie_policy.hpp"><tt>trie_policy.hpp</tt></a></p>
+
+    <h2><a name="link1" id="link1">Template Parameters</a></h2>
+
+    <table class="c1" width="100%" border="1" summary=
+    "Template Parameters">
+      <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_Node_Iterator1933878761" id=
+"Const_Node_Iterator1933878761"><b>class</b> Const_Node_Iterator</a>
+</pre>
+        </td>
+
+        <td>
+          <p>Const node iterator type.</p>
+        </td>
+
+        <td>-</td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="Node_Iterator4206909839" id=
+"Node_Iterator4206909839"><b>class</b> Node_Iterator</a>
+</pre>
+        </td>
+
+        <td>
+          <p>Node iterator type.</p>
+        </td>
+
+        <td>-</td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="E_Access_Traits686553840" id=
+"E_Access_Traits686553840"><b>class</b> E_Access_Traits</a>
+</pre>
+        </td>
+
+        <td>
+          <p>Comparison functor.</p>
+        </td>
+
+        <td>-</td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="Allocator35940069" id=
+"Allocator35940069"><b>class</b> Allocator</a>
+</pre>
+        </td>
+
+        <td>
+          <p>Allocator type.</p>
+        </td>
+
+        <td>-</td>
+      </tr>
+    </table>
+  </div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/ov_tree_tag.html b/libstdc++-v3/docs/html/ext/pb_ds/ov_tree_tag.html
new file mode 100644
index 00000000000..8da2d50d015
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/ov_tree_tag.html
@@ -0,0 +1,47 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+  <meta name="generator" content=
+  "HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+
+  <title>ov_tree_tag Interface</title>
+  <meta http-equiv="Content-Type" content=
+  "text/html; charset=us-ascii" />
+  </head>
+
+<body>
+  <div id="page">
+    <h1><tt>ov_tree_tag</tt> Interface</h1>
+
+    <p>Ordered-vector tree data structure tag.</p>
+
+    <p>Defined in: <a href=
+    "../../../../include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
+
+    <h2><a name="link1" id="link1">Base Classes</a></h2>
+
+    <table class="c1" width="100%" border="1" summary="Bases">
+      <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="tree_tag.html"><span class=
+"c2"><tt>tree_tag</tt></span></a>
+</pre>
+        </td>
+
+        <td>
+          <p>public</p>
+        </td>
+      </tr>
+    </table>
+  </div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/pairing_heap_tag.html b/libstdc++-v3/docs/html/ext/pb_ds/pairing_heap_tag.html
new file mode 100644
index 00000000000..756e886b6e6
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/pairing_heap_tag.html
@@ -0,0 +1,47 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+  <meta name="generator" content=
+  "HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+
+  <title>pairing_heap_tag Interface</title>
+  <meta http-equiv="Content-Type" content=
+  "text/html; charset=us-ascii" />
+  </head>
+
+<body>
+  <div id="page">
+    <h1><tt>pairing_heap_tag</tt> Interface</h1>
+
+    <p>Pairing-heap data structure tag.</p>
+
+    <p>Defined in: <a href=
+    "../../../../include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
+
+    <h2><a name="link1" id="link1">Base Classes</a></h2>
+
+    <table class="c1" width="100%" border="1" summary="Bases">
+      <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="priority_queue_tag.html"><span class=
+"c2"><tt>priority_queue_tag</tt></span></a>
+</pre>
+        </td>
+
+        <td>
+          <p>public</p>
+        </td>
+      </tr>
+    </table>
+  </div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/pairing_priority_queue_text_push_pop_timing_test_gcc.png b/libstdc++-v3/docs/html/ext/pb_ds/pairing_priority_queue_text_push_pop_timing_test_gcc.png
new file mode 100644
index 00000000000..4168787ecad
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/pairing_priority_queue_text_push_pop_timing_test_gcc.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/pairing_priority_queue_text_push_pop_timing_test_local.png b/libstdc++-v3/docs/html/ext/pb_ds/pairing_priority_queue_text_push_pop_timing_test_local.png
new file mode 100644
index 00000000000..97ca4e9daad
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/pairing_priority_queue_text_push_pop_timing_test_local.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/pairing_priority_queue_text_push_pop_timing_test_msvc.png b/libstdc++-v3/docs/html/ext/pb_ds/pairing_priority_queue_text_push_pop_timing_test_msvc.png
new file mode 100644
index 00000000000..42b707965ff
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/pairing_priority_queue_text_push_pop_timing_test_msvc.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/pairing_priority_queue_text_push_timing_test_gcc.png b/libstdc++-v3/docs/html/ext/pb_ds/pairing_priority_queue_text_push_timing_test_gcc.png
new file mode 100644
index 00000000000..9a7ce6c361f
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/pairing_priority_queue_text_push_timing_test_gcc.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/pairing_priority_queue_text_push_timing_test_local.png b/libstdc++-v3/docs/html/ext/pb_ds/pairing_priority_queue_text_push_timing_test_local.png
new file mode 100644
index 00000000000..cedcb4cf4b2
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/pairing_priority_queue_text_push_timing_test_local.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/pairing_priority_queue_text_push_timing_test_msvc.png b/libstdc++-v3/docs/html/ext/pb_ds/pairing_priority_queue_text_push_timing_test_msvc.png
new file mode 100644
index 00000000000..d5488efcf48
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/pairing_priority_queue_text_push_timing_test_msvc.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/pat_trie.png b/libstdc++-v3/docs/html/ext/pb_ds/pat_trie.png
new file mode 100644
index 00000000000..e7129a1a67b
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/pat_trie.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/pat_trie_tag.html b/libstdc++-v3/docs/html/ext/pb_ds/pat_trie_tag.html
new file mode 100644
index 00000000000..459546df778
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/pat_trie_tag.html
@@ -0,0 +1,47 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+  <meta name="generator" content=
+  "HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+
+  <title>pat_trie_tag Interface</title>
+  <meta http-equiv="Content-Type" content=
+  "text/html; charset=us-ascii" />
+  </head>
+
+<body>
+  <div id="page">
+    <h1><tt>pat_trie_tag</tt> Interface</h1>
+
+    <p>PATRICIA trie data structure tag.</p>
+
+    <p>Defined in: <a href=
+    "../../../../include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
+
+    <h2><a name="link1" id="link1">Base Classes</a></h2>
+
+    <table class="c1" width="100%" border="1" summary="Bases">
+      <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="tree_tag.html"><span class=
+"c2"><tt>tree_tag</tt></span></a>
+</pre>
+        </td>
+
+        <td>
+          <p>public</p>
+        </td>
+      </tr>
+    </table>
+  </div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/point_invalidation_guarantee.html b/libstdc++-v3/docs/html/ext/pb_ds/point_invalidation_guarantee.html
new file mode 100644
index 00000000000..ba2eee6dfc4
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/point_invalidation_guarantee.html
@@ -0,0 +1,51 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+  <meta name="generator" content=
+  "HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+
+  <title>point_invalidation_guarantee Interface</title>
+  <meta http-equiv="Content-Type" content=
+  "text/html; charset=us-ascii" />
+  </head>
+
+<body>
+  <div id="page">
+    <h1><tt>point_invalidation_guarantee</tt> Interface</h1>
+
+    <p>Signifies an invalidation guarantee that includes all those
+    of its base, and additionally, that any point-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>
+
+    <p>Defined in: <a href=
+    "../../../../include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
+
+    <h2><a name="link1" id="link1">Base Classes</a></h2>
+
+    <table class="c1" width="100%" border="1" summary="Bases">
+      <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"><span class=
+"c2"><tt>basic_invalidation_guarantee</tt></span></a>
+</pre>
+        </td>
+
+        <td>
+          <p>public</p>
+        </td>
+      </tr>
+    </table>
+  </div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/point_iterators_cd.png b/libstdc++-v3/docs/html/ext/pb_ds/point_iterators_cd.png
new file mode 100644
index 00000000000..25a69fc6e8b
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/point_iterators_cd.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/point_iterators_range_ops_1.png b/libstdc++-v3/docs/html/ext/pb_ds/point_iterators_range_ops_1.png
new file mode 100644
index 00000000000..c5bc8e5d6c0
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/point_iterators_range_ops_1.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/point_iterators_range_ops_2.png b/libstdc++-v3/docs/html/ext/pb_ds/point_iterators_range_ops_2.png
new file mode 100644
index 00000000000..c3f94ee93bc
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/point_iterators_range_ops_2.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/pq_container_traits.html b/libstdc++-v3/docs/html/ext/pb_ds/pq_container_traits.html
new file mode 100644
index 00000000000..2ff5ed7c644
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/pq_container_traits.html
@@ -0,0 +1,132 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+  <meta name="generator" content=
+  "HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+
+  <title>container_traits Interface</title>
+  <meta http-equiv="Content-Type" content=
+  "text/html; charset=us-ascii" />
+  </head>
+
+<body>
+  <div id="page">
+    <h1><tt>container_traits</tt> Interface</h1>
+
+    <p>Traits of a priority-queue container based on its underlying
+    data structure.</p>
+
+    <p>Defined in: <a href=
+    "../../../../include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
+
+    <h2><a name="link1" id="link1">Template Parameters</a></h2>
+
+    <table class="c1" width="100%" border="1" summary=
+    "Template Parameters">
+      <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="Cntnr59189" id="Cntnr59189"><b>class</b> Cntnr</a>
+</pre>
+        </td>
+
+        <td>
+          <p>Container type.</p>
+        </td>
+
+        <td>-</td>
+      </tr>
+    </table>
+
+    <h2><a name="link2" id="link2">Public Types and
+    Constants</a></h2>
+
+    <h3><a name="link3" id="link3">Container Attributes</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Types">
+      <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="container_category1247973216" id=
+"container_category1247973216">container_category</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+Underlying data structure.
+</pre>
+        </td>
+
+        <td>
+          <p>Data structure category.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="invalidation_guarantee3793555937" id=
+"invalidation_guarantee3793555937">invalidation_guarantee</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+Invalidation guarantee.
+</pre>
+        </td>
+
+        <td>
+          <p>Invalidation-guarantee type.</p>
+
+          <p>This is either <a href=
+          "basic_invalidation_guarantee.html"><span class=
+          "c2"><tt>basic_invalidation_guarantee</tt></span></a>,
+          <a href="point_invalidation_guarantee.html"><span class=
+          "c2"><tt>point_invalidation_guarantee</tt></span></a>, or
+          <a href="range_invalidation_guarantee.html"><span class=
+          "c2"><tt>range_invalidation_guarantee</tt></span></a></p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="split_join_can_throw3200477759" id=
+"split_join_can_throw3200477759">split_join_can_throw</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+True only if split or join operations can throw.
+</pre>
+        </td>
+
+        <td>
+          <p>Split-join throw indicator.</p>
+        </td>
+      </tr>
+    </table>
+  </div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/pq_design.html b/libstdc++-v3/docs/html/ext/pb_ds/pq_design.html
new file mode 100644
index 00000000000..f33d963a9ad
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/pq_design.html
@@ -0,0 +1,381 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+  <meta name="generator" content=
+  "HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+
+  <title>Priority-Queues</title>
+  <meta http-equiv="Content-Type" content=
+  "text/html; charset=us-ascii" />
+  </head>
+
+<body>
+  <div id="page">
+    <h1>Priority-Queue Design</h1>
+
+    <h2><a name="overview" id="overview">Overview</a></h2>
+
+    <p>The priority-queue container has the following
+    declaration:</p>
+    <pre>
+<b>template</b>&lt;
+    <b>typename</b> Value_Type,
+    <b>typename</b> Cmp_Fn = std::less&lt;Value_Type&gt;,
+    <b>typename</b> Tag = <a href="pairing_heap_tag.html">pairing_heap_tag</a>,
+    <b>typename</b> Allocator = std::allocator&lt;<b>char</b>&gt; &gt;
+<b>class</b> <a href="priority_queue.html">priority_queue</a>;
+</pre>
+
+    <p>The parameters have the following meaning:</p>
+
+    <ol>
+      <li><tt>Value_Type</tt> is the value type.</li>
+
+      <li><tt>Cmp_Fn</tt> is a value comparison functor</li>
+
+      <li><tt>Tag</tt> specifies which underlying data structure
+      to use.</li>
+
+      <li><tt>Allocator</tt> is an allocator
+      type.</li>
+    </ol>
+
+    <p>The <tt>Tag</tt> parameter specifies which underlying
+    data structure to use. Instantiating it by <a href=
+    "pairing_heap_tag.html"><tt>pairing_heap_tag</tt></a>,
+    <a href=
+    "binary_heap_tag.html"><tt>binary_heap_tag</tt></a>,
+    <a href=
+    "binomial_heap_tag.html"><tt>binomial_heap_tag</tt></a>,
+    <a href=
+    "rc_binomial_heap_tag.html"><tt>rc_binomial_heap_tag</tt></a>,
+    or <a href=
+    "thin_heap_tag.html"><tt>thin_heap_tag</tt></a>,
+    specifies, respectively, an underlying pairing heap [<a href=
+    "references.html#fredman86pairing">fredman86pairing</a>],
+    binary heap [<a href="references.html#clrs2001">clrs2001</a>],
+    binomial heap [<a href=
+    "references.html#clrs2001">clrs2001</a>], a binomial heap with
+    a redundant binary counter [<a href=
+    "references.html#maverik_lowerbounds">maverik_lowerbounds</a>],
+    or a thin heap [<a href=
+    "references.html#kt99fat_heaps">kt99fat_heas</a>]. These are
+    explained further in <a href="#pq_imp">Implementations</a>.</p>
+
+    <p>As mentioned in <a href=
+    "tutorial.html#pq">Tutorial::Priority Queues</a>, 
+    <a href=
+    "priority_queue.html"><tt>pb_ds::priority_queue</tt></a>
+    shares most of the same interface with <tt>std::priority_queue</tt>.
+    <i>E.g.</i> if <tt>q</tt> is a priority queue of type
+    <tt>Q</tt>, then <tt>q.top()</tt> will return the "largest"
+    value in the container (according to <tt><b>typename</b>
+    Q::cmp_fn</tt>). <a href=
+    "priority_queue.html"><tt>pb_ds::priority_queue</tt></a>
+    has a larger (and very slightly different) interface than
+    <tt>std::priority_queue</tt>, however, since typically
+    <tt>push</tt> and <tt>pop</tt> are deemed insufficient for
+    manipulating priority-queues. </p>
+
+    <p>Different settings require different priority-queue
+    implementations which are described in <a href=
+    "#pq_imp">Implementations</a>; <a href="#pq_traits">Traits</a>
+    discusses ways to differentiate between the different traits of
+    different implementations.</p>
+
+    <h2><a name="pq_it" id="pq_it">Iterators</a></h2>
+
+    <p>There are many different underlying-data structures for
+    implementing priority queues. Unfortunately, most such
+    structures are oriented towards making <tt>push</tt> and
+    <tt>top</tt> efficient, and consequently don't allow efficient
+    access of other elements: for instance, they cannot support an efficient
+    <tt>find</tt> method. In the use case where it
+    is important to both access and "do something with" an
+    arbitrary value, one would be out of luck. For example, many graph algorithms require
+    modifying a value (typically increasing it in the sense of the
+    priority queue's comparison functor).</p>
+
+    <p>In order to access and manipulate an arbitrary value in a
+    priority queue, one needs to reference the internals of the
+    priority queue from some form of an associative container -
+    this is unavoidable. Of course, in order to maintain the
+    encapsulation of the priority queue, this needs to be done in a
+    way that minimizes exposure to implementation internals.</p>
+
+    <p>In <tt>pb_ds</tt> the priority queue's <tt>insert</tt>
+    method returns an iterator, which if valid can be used for subsequent <tt>modify</tt> and
+    <tt>erase</tt> operations. This both preserves the priority
+    queue's encapsulation, and allows accessing arbitrary values (since the
+    returned iterators from the <tt>push</tt> operation can be
+    stored in some form of associative container).</p>
+
+    <p>Priority queues' iterators present a problem regarding their
+    invalidation guarantees. One assumes that calling
+    <tt><b>operator</b>++</tt> on an iterator will associate it
+    with the "next" value. Priority-queues are
+    self-organizing: each operation changes what the "next" value
+    means. Consequently, it does not make sense that <tt>push</tt>
+    will return an iterator that can be incremented - this can have
+    no possible use. Also, as in the case of hash-based containers,
+    it is awkward to define if a subsequent <tt>push</tt> operation
+    invalidates a prior returned iterator: it invalidates it in the
+    sense that its "next" value is not related to what it
+    previously considered to be its "next" value. However, it might not
+    invalidate it, in the sense that it can be
+    de-referenced and used for <tt>modify</tt> and <tt>erase</tt>
+    operations.</p>
+
+    <p>Similarly to the case of the other unordered associative
+    containers, <tt>pb_ds</tt> uses a distinction between
+    point-type and range type iterators. A priority queue's <tt>iterator</tt> can always be
+    converted to a <tt>point_iterator</tt>, and a
+    <tt>const_iterator</tt> can always be converted to a
+    <tt>const_point_iterator</tt>.</p>
+
+    <p>The following snippet demonstrates manipulating an arbitrary
+    value:</p>
+    <pre>
+<i>// A priority queue of integers.</i>
+<a href=
+"priority_queue.html">priority_queue</a>&lt;<b>int</b>&gt; p;
+
+<i>// Insert some values into the priority queue.</i>
+<a href=
+"priority_queue.html">priority_queue</a>&lt;<b>int</b>&gt;::point_iterator it = p.push(0);
+
+p.push(1);
+p.push(2);
+
+<i>// Now modify a value.</i>
+p.modify(it, 3);
+
+assert(p.top() == 3);
+</pre>
+
+    <p>(<a href="pq_examples.html#xref">Priority Queue
+    Examples::Cross-Referencing</a> shows a more detailed
+    example.)</p>
+
+    <p>It should be noted that an alternative design could embed an
+    associative container in a priority queue. Could, but most probably should not. To begin with, it should be noted that one
+    could always encapsulate a priority queue and an associative
+    container mapping values to priority queue iterators with no
+    performance loss. One cannot, however, "un-encapsulate" a
+    priority queue embedding an associative container, which might
+    lead to performance loss. Assume, that one needs to
+    associate each value with some data unrelated to priority
+    queues. Then using <tt>pb_ds</tt>'s design, one could use an
+    associative container mapping each value to a pair consisting
+    of this data and a priority queue's iterator. Using the
+    embedded method would need to use two associative
+    containers. Similar problems might arise in cases where a value
+    can reside simultaneously in many priority queues.</p>
+
+    <h2><a name="pq_imp" id="pq_imp">Implementations</a></h2>
+
+    <p>There are three main implementations of priority queues: the
+    first employs a binary heap, typically one which uses a
+    sequence; the second uses a tree (or forest of trees), which is
+    typically less structured than an associative container's tree;
+    the third simply uses an associative container. These are
+    shown, respectively, in Figures <a href=
+    "#pq_different_underlying_dss">Underlying Priority-Queue
+    Data-Structures</a> A1 and A2, Figure <a href=
+    "#pq_different_underlying_dss">Underlying Priority-Queue
+    Data-Structures</a> B, and Figures <a href=
+    "#pq_different_underlying_dss">Underlying Priority-Queue
+    Data-Structures</a> C.</p>
+
+    <h6 class="c1"><a name="pq_different_underlying_dss" id=
+    "pq_different_underlying_dss"><img src=
+    "pq_different_underlying_dss.png" alt="no image" /></a></h6>
+
+    <h6 class="c1">Underlying Priority-Queue Data-Structures.</h6>
+
+    <p>Roughly speaking, any value that is both pushed and popped
+    from a priority queue must incur a logarithmic expense (in the
+    amortized sense). Any priority queue implementation that would
+    avoid this, would violate known bounds on comparison-based
+    sorting (see, <i>e.g.</i>, [<a href=
+    "references.html#clrs2001">clrs2001</a>] and <a href=
+    "references.html#brodal96priority">brodal96priority</a>]).</p>
+
+    <p>Most implementations do
+    not differ in the asymptotic amortized complexity of
+    <tt>push</tt> and <tt>pop</tt> operations, but they differ in
+    the constants involved, in the complexity of other operations
+    (<i>e.g.</i>, <tt>modify</tt>), and in the worst-case
+    complexity of single operations. In general, the more
+    "structured" an implementation (<i>i.e.</i>, the more internal
+    invariants it possesses) - the higher its amortized complexity
+    of <tt>push</tt> and <tt>pop</tt> operations.</p>
+
+    <p><tt>pb_ds</tt> implements different algorithms using a
+    single class: <a href="priority_queue.html">priority_queue</a>.
+    Instantiating the <tt>Tag</tt> template parameter, "selects"
+    the implementation:</p>
+
+    <ol>
+      <li>Instantiating <tt>Tag = <a href=
+      "binary_heap_tag.html">binary_heap_tag</a></tt> creates
+      a binary heap of the form in Figures <a href=
+      "#pq_different_underlying_dss">Underlying Priority-Queue
+      Data-Structures</a> A1 or A2. The former is internally
+      selected by <a href="priority_queue.html">priority_queue</a>
+      if <tt>Value_Type</tt> is instantiated by a primitive type
+      (<i>e.g.</i>, an <tt><b>int</b></tt>); the latter is
+      internally selected for all other types (<i>e.g.</i>,
+      <tt>std::string</tt>). This implementations is relatively
+      unstructured, and so has good <tt>push</tt> and <tt>pop</tt>
+      performance; it is the "best-in-kind" for primitive
+      types, <i>e.g.</i>, <tt><b>int</b></tt>s. Conversely, it has
+      high worst-case performance, and can support only linear-time
+      <tt>modify</tt> and <tt>erase</tt> operations; this is
+      explained further in <a href="#pq_traits">Traits</a>.</li>
+
+      <li>Instantiating <tt>Tag = <a href=
+      "pairing_heap_tag.html">pairing_heap_tag</a></tt>
+      creates a pairing heap of the form in Figure <a href=
+      "#pq_different_underlying_dss">Underlying Priority-Queue
+      Data-Structures</a> B. This implementations too is relatively
+      unstructured, and so has good <tt>push</tt> and <tt>pop</tt>
+      performance; it is the "best-in-kind" for non-primitive
+      types, <i>e.g.</i>, <tt>std:string</tt>s. It also has very
+      good worst-case <tt>push</tt> and <tt>join</tt> performance
+      (<i>O(1)</i>), but has high worst-case <tt>pop</tt>
+      complexity.</li>
+
+      <li>Instantiating <tt>Tag = <a href=
+      "binomial_heap_tag.html">binomial_heap_tag</a></tt>
+      creates a binomial heap of the form in Figure <a href=
+      "#pq_different_underlying_dss">Underlying Priority-Queue
+      Data-Structures</a> B. This implementations is more
+      structured than a pairing heap, and so has worse
+      <tt>push</tt> and <tt>pop</tt> performance. Conversely, it
+      has sub-linear worst-case bounds for <tt>pop</tt>,
+      <i>e.g.</i>, and so it might be preferred in cases where
+      responsiveness is important.</li>
+
+      <li>Instantiating <tt>Tag = <a href=
+      "rc_binomial_heap_tag.html">rc_binomial_heap_tag</a></tt>
+      creates a binomial heap of the form in Figure <a href=
+      "#pq_different_underlying_dss">Underlying Priority-Queue
+      Data-Structures</a> B, accompanied by a redundant counter
+      which governs the trees. This implementations is therefore
+      more structured than a binomial heap, and so has worse
+      <tt>push</tt> and <tt>pop</tt> performance. Conversely, it
+      guarantees <i>O(1)</i> <tt>push</tt> complexity, and so it
+      might be preferred in cases where the responsiveness of a
+      binomial heap is insufficient.</li>
+
+      <li>Instantiating <tt>Tag = <a href=
+      "thin_heap_tag.html">thin_heap_tag</a></tt> creates a
+      thin heap of the form in Figure <a href=
+      "#pq_different_underlying_dss">Underlying Priority-Queue
+      Data-Structures</a> B. This implementations too is more
+      structured than a pairing heap, and so has worse
+      <tt>push</tt> and <tt>pop</tt> performance. Conversely, it
+      has better worst-case and identical amortized complexities
+      than a Fibonacci heap, and so might be more appropriate for
+      some graph algorithms.</li>
+    </ol>
+
+    <p><a href="pq_performance_tests.html">Priority-Queue
+    Performance Tests</a> shows some results for the above, and
+    discusses these points further.</p>
+
+    <p>Of course, one can use any order-preserving associative
+    container as a priority queue, as in Figure <a href=
+    "#pq_different_underlying_dss">Underlying Priority-Queue
+    Data-Structures</a> C, possibly by creating an adapter class
+    over the associative container (much as 
+    <tt>std::priority_queue</tt> can adapt <tt>std::vector</tt>).
+    This has the advantage that no cross-referencing is necessary
+    at all; the priority queue itself is an associative container.
+    Most associative containers are too structured to compete with
+    priority queues in terms of <tt>push</tt> and <tt>pop</tt>
+    performance.</p>
+
+    <h2><a name="pq_traits" id="pq_traits">Traits</a></h2>
+
+    <p>It would be nice if all priority queues could
+    share exactly the same behavior regardless of implementation. Sadly, this is not possible. Just one for instance is in join operations: joining
+    two binary heaps might throw an exception (not corrupt
+    any of the heaps on which it operates), but joining two pairing
+    heaps is exception free.</p>
+
+    <p>Tags and traits are very useful for manipulating generic
+    types. <a href=
+    "priority_queue.html"><tt>pb_ds::priority_queue</tt></a>
+    publicly defines <tt>container_category</tt> as one of the tags
+    discussed in <a href="#pq_imp">Implementations</a>. Given any
+    container <tt>Cntnr</tt>, the tag of the underlying
+    data structure can be found via <tt><b>typename</b>
+    Cntnr::container_category</tt>; this is one of the types shown in
+    Figure <a href="#pq_tag_cd">Data-structure tag class
+    hierarchy</a>.</p>
+
+    <h6 class="c1"><a name="pq_tag_cd" id=
+    "pq_tag_cd"><img src="priority_queue_tag_cd.png" alt=
+    "no image" /></a></h6>
+
+    <h6 class="c1">Data-structure tag class hierarchy.</h6>
+
+    <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=
+    "assoc_container_traits.html">pb_ds::container_traits</a>&lt;Cntnr&gt;</tt>
+    is a traits class identifying the properties of the
+    container.</p>
+
+    <p>To find if a container might throw if two of its objects are
+    joined, one can use <a href=
+    "assoc_container_traits.html"><tt>container_traits</tt></a><tt>&lt;Cntnr&gt;::split_join_can_throw</tt>,
+    for example.</p>
+
+    <p>Different priority-queue implementations have different invalidation guarantees. This is
+    especially important, since as explained in <a href=
+    "#pq_it">Iterators</a>, there is no way to access an arbitrary
+    value of priority queues except for iterators. Similarly to
+    associative containers, one can use
+    <a href=
+    "assoc_container_traits.html"><tt>container_traits</tt></a><tt>&lt;Cntnr&gt;::invalidation_guarantee</tt>
+    to get the invalidation guarantee type of a priority queue.</p>
+
+    <p>It is easy to understand from Figure <a href=
+    "#pq_different_underlying_dss">Underlying Priority-Queue
+    Data-Structures</a>, what <a href=
+    "assoc_container_traits.html"><tt>container_traits</tt></a><tt>&lt;Cntnr&gt;::invalidation_guarantee</tt>
+    will be for different implementations. All implementations of
+    type <a href="#pq_different_underlying_dss">Underlying
+    Priority-Queue Data-Structures</a> B have <a href=
+    "point_invalidation_guarantee.html"><tt>point_invalidation_guarantee</tt></a>:
+    the container can freely internally reorganize the nodes -
+    range-type iterators are invalidated, but point-type iterators
+    are always valid. Implementations of type <a href=
+    "#pq_different_underlying_dss">Underlying Priority-Queue
+    Data-Structures</a> A1 and A2 have <a href=
+    "basic_invalidation_guarantee.html"><tt>basic_invalidation_guarantee</tt></a>:
+    the container can freely internally reallocate the array - both
+    point-type and range-type iterators might be invalidated.</p>
+
+    <p>This has major implications, and constitutes a good reason to avoid
+    using binary heaps. A binary heap can perform <tt>modify</tt>
+    or <tt>erase</tt> efficiently <u>given a valid point-type
+    iterator</u>. However, inn order to supply it with a valid point-type
+    iterator, one needs to iterate (linearly) over all
+    values, then supply the relevant iterator (recall that a
+    range-type iterator can always be converted to a point-type
+    iterator). This means that if the number of <tt>modify</tt> or
+    <tt>erase</tt> operations is non-negligible (say
+    super-logarithmic in the total sequence of operations) - binary
+    heaps will perform badly.</p>
+    <pre>
+
+</pre>
+  </div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/pq_different_underlying_dss.png b/libstdc++-v3/docs/html/ext/pb_ds/pq_different_underlying_dss.png
new file mode 100644
index 00000000000..9d84791fc0d
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/pq_different_underlying_dss.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/pq_examples.html b/libstdc++-v3/docs/html/ext/pb_ds/pq_examples.html
new file mode 100644
index 00000000000..ee8e9305486
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/pq_examples.html
@@ -0,0 +1,60 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+  <meta name="generator" content=
+  "HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+
+  <title>Examples</title>
+  <meta http-equiv="Content-Type" content=
+  "text/html; charset=us-ascii" />
+  </head>
+
+<body>
+  <div id="page">
+    <h1>Priority-Queue Examples</h1>
+
+     <h2><a name="basic_usage" id="basic_usage">Basic Use</a></h2>
+
+    <ol>
+      <li><a href=
+      "../../../../testsuite/ext/pb_ds/example/basic_priority_queue.cc"><tt>basic_priority_queue.cc</tt></a>
+      Basic use of priority queues.</li>
+
+      <li><a href=
+      "../../../../testsuite/ext/pb_ds/example/priority_queue_split_join.cc"><tt>priority_queue_split_join.cc</tt></a>
+      Splitting and joining priority queues.</li>
+
+      <li><a href=
+      "../../../../testsuite/ext/pb_ds/example/priority_queue_erase_if.cc"><tt>priority_queue_erase_if.cc</tt></a>
+      Conditionally erasing values from a container object.</li>
+    </ol>
+
+    <h2><a name="generics" id="generics">Generics</a></h2>
+
+    <ol>
+      <li><a href=
+      "../../../../testsuite/ext/pb_ds/example/priority_queue_container_traits.cc"><tt>priority_queue_container_traits.cc</tt></a>
+      Using <a href="pq_container_traits.html"><tt>container_traits</tt></a>
+      to query about underlying data structure behavior.</li>
+    </ol>
+
+    <h2><a name="xref" id="xref">Cross Referencing</a></h2>
+
+
+    <ol>
+      <li><a href=
+      "../../../../testsuite/ext/pb_ds/example/priority_queue_xref.cc"><tt>priority_queue_xref.cc</tt></a>
+      Cross referencing an associative container and a priority
+      queue.</li>
+
+      <li><a href=
+      "../../../../testsuite/ext/pb_ds/example/priority_queue_dijkstra.cc"><tt>priority_queue_dijkstra.cc</tt></a>
+      Cross referencing a vector and a priority queue using a
+      <u>very</u> simple version of Dijkstra's shortest path
+      algorithm.</li>
+    </ol>
+  </div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/pq_performance_tests.html b/libstdc++-v3/docs/html/ext/pb_ds/pq_performance_tests.html
new file mode 100644
index 00000000000..3a6b2691208
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/pq_performance_tests.html
@@ -0,0 +1,332 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+<meta name="generator" content="HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+<title>Priority-Queue Performance Tests</title>
+<meta http-equiv="Content-Type" content="text/html; charset=us-ascii" />
+</head>
+<body>
+<div id="page">
+<h1>Priority-Queue Performance Tests</h1>
+<h2><a name="settings" id="settings">Settings</a></h2>
+<p>This section describes performance tests and their results.
+    In the following, <a href="#gcc"><u>g++</u></a>, <a href="#msvc"><u>msvc++</u></a>, and <a href="#local"><u>local</u></a> (the build used for generating this
+    documentation) stand for three different builds:</p>
+<div id="gcc_settings_div">
+<div class="c1">
+<h3><a name="gcc" id="gcc"><u>g++</u></a></h3>
+<ul>
+<li>CPU speed - cpu MHz : 2660.644</li>
+<li>Memory - MemTotal: 484412 kB</li>
+<li>Platform -
+          Linux-2.6.12-9-386-i686-with-debian-testing-unstable</li>
+<li>Compiler - g++ (GCC) 4.0.2 20050808 (prerelease)
+          (Ubuntu 4.0.1-4ubuntu9) Copyright (C) 2005 Free Software
+          Foundation, Inc. This is free software; see the source
+          for copying conditions. There is NO warranty; not even
+          for MERCHANTABILITY or FITNESS FOR A PARTICULAR
+          PURPOSE.</li>
+</ul>
+</div>
+<div class="c2"></div>
+</div>
+<div id="msvc_settings_div">
+<div class="c1">
+<h3><a name="msvc" id="msvc"><u>msvc++</u></a></h3>
+<ul>
+<li>CPU speed - cpu MHz : 2660.554</li>
+<li>Memory - MemTotal: 484412 kB</li>
+<li>Platform - Windows XP Pro</li>
+<li>Compiler - Microsoft (R) 32-bit C/C++ Optimizing
+          Compiler Version 13.10.3077 for 80x86 Copyright (C)
+          Microsoft Corporation 1984-2002. All rights
+          reserved.</li>
+</ul>
+</div>
+<div class="c2"></div>
+</div>
+<div id="local_settings_div"><div style = "border-style: dotted; border-width: 1px; border-color: lightgray"><h3><a name = "local"><u>local</u></a></h3><ul>
+<li>CPU speed - cpu MHz		: 2250.000</li>
+<li>Memory - MemTotal:      2076248 kB</li>
+<li>Platform - Linux-2.6.16-1.2133_FC5-i686-with-redhat-5-Bordeaux</li>
+<li>Compiler - g++ (GCC) 4.1.1 20060525 (Red Hat 4.1.1-1)
+Copyright (C) 2006 Free Software Foundation, Inc.
+This is free software; see the source for copying conditions.  There is NO
+warranty; not even for MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
+</li>
+</ul>
+</div><div style = "width: 100%; height: 20px"></div></div>
+<h2><a name="pq_tests" id="pq_tests">Tests</a></h2>
+<ol>
+<li><a href="priority_queue_text_push_timing_test.html">Priority Queue
+      Text <tt>push</tt> Timing Test</a></li>
+<li><a href="priority_queue_text_push_pop_timing_test.html">Priority
+      Queue Text <tt>push</tt> and <tt>pop</tt> Timing
+      Test</a></li>
+<li><a href="priority_queue_random_int_push_timing_test.html">Priority
+      Queue Random Integer <tt>push</tt> Timing Test</a></li>
+<li><a href="priority_queue_random_int_push_pop_timing_test.html">Priority
+      Queue Random Integer <tt>push</tt> and <tt>pop</tt> Timing
+      Test</a></li>
+<li><a href="priority_queue_text_pop_mem_usage_test.html">Priority Queue
+      Text <tt>pop</tt> Memory Use Test</a></li>
+<li><a href="priority_queue_text_join_timing_test.html">Priority Queue
+      Text <tt>join</tt> Timing Test</a></li>
+<li><a href="priority_queue_text_modify_up_timing_test.html">Priority
+      Queue Text <tt>modify</tt> Timing Test - I</a></li>
+<li><a href="priority_queue_text_modify_down_timing_test.html">Priority
+      Queue Text <tt>modify</tt> Timing Test - II</a></li>
+</ol>
+<h2><a name="pq_observations" id="pq_observations">Observations</a></h2>
+<h3><a name="pq_observations_cplx" id="pq_observations_cplx">Underlying Data Structures
+    Complexity</a></h3>
+<p>The following table shows the complexities of the different
+    underlying data structures in terms of orders of growth. It is
+    interesting to note that this table implies something about the
+    constants of the operations as well (see <a href="#pq_observations_amortized_push_pop">Amortized <tt>push</tt>
+    and <tt>pop</tt> operations</a>).</p>
+<table class="c1" width="100%" border="1" summary="pq complexities">
+<tr>
+<td align="left"></td>
+<td align="left"><tt>push</tt></td>
+<td align="left"><tt>pop</tt></td>
+<td align="left"><tt>modify</tt></td>
+<td align="left"><tt>erase</tt></td>
+<td align="left"><tt>join</tt></td>
+</tr>
+<tr>
+<td align="left">
+<p><tt>std::priority_queue</tt></p>
+</td>
+<td align="left">
+<p><i>&Theta;(n)</i> worst</p>
+<p><i>&Theta;(log(n))</i> amortized</p>
+</td>
+<td align="left">
+<p class="c1">&Theta;(log(n)) Worst</p>
+</td>
+<td align="left">
+<p><i>Theta;(n log(n))</i> Worst</p>
+<p><sub><a href="#std_mod1">[std note 1]</a></sub></p>
+</td>
+<td align="left">
+<p class="c3">&Theta;(n log(n))</p>
+<p><sub><a href="#std_mod2">[std note 2]</a></sub></p>
+</td>
+<td align="left">
+<p class="c3">&Theta;(n log(n))</p>
+<p><sub><a href="#std_mod1">[std note 1]</a></sub></p>
+</td>
+</tr>
+<tr>
+<td align="left">
+<p><a href="priority_queue.html"><tt>priority_queue</tt></a></p>
+<p>with <tt>Tag</tt> =</p>
+<p><a href="pairing_heap_tag.html"><tt>pairing_heap_tag</tt></a></p>
+</td>
+<td align="left">
+<p class="c1">O(1)</p>
+</td>
+<td align="left">
+<p><i>&Theta;(n)</i> worst</p>
+<p><i>&Theta;(log(n))</i> amortized</p>
+</td>
+<td align="left">
+<p><i>&Theta;(n)</i> worst</p>
+<p><i>&Theta;(log(n))</i> amortized</p>
+</td>
+<td align="left">
+<p><i>&Theta;(n)</i> worst</p>
+<p><i>&Theta;(log(n))</i> amortized</p>
+</td>
+<td align="left">
+<p class="c1">O(1)</p>
+</td>
+</tr>
+<tr>
+<td align="left">
+<p><a href="priority_queue.html"><tt>priority_queue</tt></a></p>
+<p>with <tt>Tag</tt> =</p>
+<p><a href="binary_heap_tag.html"><tt>binary_heap_tag</tt></a></p>
+</td>
+<td align="left">
+<p><i>&Theta;(n)</i> worst</p>
+<p><i>&Theta;(log(n))</i> amortized</p>
+</td>
+<td align="left">
+<p><i>&Theta;(n)</i> worst</p>
+<p><i>&Theta;(log(n))</i> amortized</p>
+</td>
+<td align="left">
+<p class="c1">&Theta;(n)</p>
+</td>
+<td align="left">
+<p class="c1">&Theta;(n)</p>
+</td>
+<td align="left">
+<p class="c1">&Theta;(n)</p>
+</td>
+</tr>
+<tr>
+<td align="left">
+<p><a href="priority_queue.html"><tt>priority_queue</tt></a></p>
+<p>with <tt>Tag</tt> =</p>
+<p><a href="binomial_heap_tag.html"><tt>binomial_heap_tag</tt></a></p>
+</td>
+<td align="left">
+<p><i>&Theta;(log(n))</i> worst</p>
+<p><i>O(1)</i> amortized</p>
+</td>
+<td align="left">
+<p class="c1">&Theta;(log(n))</p>
+</td>
+<td align="left">
+<p class="c1">&Theta;(log(n))</p>
+</td>
+<td align="left">
+<p class="c1">&Theta;(log(n))</p>
+</td>
+<td align="left">
+<p class="c1">&Theta;(log(n))</p>
+</td>
+</tr>
+<tr>
+<td align="left">
+<p><a href="priority_queue.html"><tt>priority_queue</tt></a></p>
+<p>with <tt>Tag</tt> =</p>
+<p><a href="rc_binomial_heap_tag.html"><tt>rc_binomial_heap_tag</tt></a></p>
+</td>
+<td align="left">
+<p class="c1">O(1)</p>
+</td>
+<td align="left">
+<p class="c1">&Theta;(log(n))</p>
+</td>
+<td align="left">
+<p class="c1">&Theta;(log(n))</p>
+</td>
+<td align="left">
+<p class="c1">&Theta;(log(n))</p>
+</td>
+<td align="left">
+<p class="c1">&Theta;(log(n))</p>
+</td>
+</tr>
+<tr>
+<td align="left">
+<p><a href="priority_queue.html"><tt>priority_queue</tt></a></p>
+<p>with <tt>Tag</tt> =</p>
+<p><a href="thin_heap_tag.html"><tt>thin_heap_tag</tt></a></p>
+</td>
+<td align="left">
+<p class="c1">O(1)</p>
+</td>
+<td align="left">
+<p><i>&Theta;(n)</i> worst</p>
+<p><i>&Theta;(log(n))</i> amortized</p>
+</td>
+<td align="left">
+<p><i>&Theta;(log(n))</i> worst</p>
+<p><i>O(1)</i> amortized,</p>or
+
+          <p><i>&Theta;(log(n))</i> amortized</p>
+<p><sub><a href="#thin_heap_note">[thin_heap_note]</a></sub></p>
+</td>
+<td align="left">
+<p><i>&Theta;(n)</i> worst</p>
+<p><i>&Theta;(log(n))</i> amortized</p>
+</td>
+<td align="left">
+<p class="c1">&Theta;(n)</p>
+</td>
+</tr>
+</table>
+<p><sub><a name="std_mod1" id="std_mod1">[std note 1]</a> This
+    is not a property of the algorithm, but rather due to the fact
+    that the STL's priority queue implementation does not support
+    iterators (and consequently the ability to access a specific
+    value inside it). If the priority queue is adapting an
+    <tt>std::vector</tt>, then it is still possible to reduce this
+    to <i>&Theta;(n)</i> by adapting over the STL's adapter and
+    using the fact that <tt>top</tt> returns a reference to the
+    first value; if, however, it is adapting an
+    <tt>std::deque</tt>, then this is impossible.</sub></p>
+<p><sub><a name="std_mod2" id="std_mod2">[std note 2]</a> As
+    with <a href="#std_mod1">[std note 1]</a>, this is not a
+    property of the algorithm, but rather the STL's implementation.
+    Again, if the priority queue is adapting an
+    <tt>std::vector</tt> then it is possible to reduce this to
+    <i>&Theta;(n)</i>, but with a very high constant (one must call
+    <tt>std::make_heap</tt> which is an expensive linear
+    operation); if the priority queue is adapting an
+    <tt>std::dequeu</tt>, then this is impossible.</sub></p>
+<p><sub><a name="thin_heap_note" id="thin_heap_note">[thin_heap_note]</a> A thin heap has
+    <i>&amp;Theta(log(n))</i> worst case <tt>modify</tt> time
+    always, but the amortized time depends on the nature of the
+    operation: I) if the operation increases the key (in the sense
+    of the priority queue's comparison functor), then the amortized
+    time is <i>O(1)</i>, but if II) it decreases it, then the
+    amortized time is the same as the worst case time. Note that
+    for most algorithms, I) is important and II) is not.</sub></p>
+<h3><a name="pq_observations_amortized_push_pop" id="pq_observations_amortized_push_pop">Amortized <tt>push</tt>
+    and <tt>pop</tt> operations</a></h3>
+<p>In many cases, a priority queue is needed primarily for
+    sequences of <tt>push</tt> and <tt>pop</tt> operations. All of
+    the underlying data structures have the same amortized
+    logarithmic complexity, but they differ in terms of
+    constants.</p>
+<p>The table above shows that the different data structures are
+    "constrained" in some respects. In general, if a data structure
+    has lower worst-case complexity than another, then it will
+    perform slower in the amortized sense. Thus, for example a
+    redundant-counter binomial heap (<a href="priority_queue.html"><tt>priority_queue</tt></a> with
+    <tt>Tag</tt> = <a href="rc_binomial_heap_tag.html"><tt>rc_binomial_heap_tag</tt></a>)
+    has lower worst-case <tt>push</tt> performance than a binomial
+    heap (<a href="priority_queue.html"><tt>priority_queue</tt></a>
+    with <tt>Tag</tt> = <a href="binomial_heap_tag.html"><tt>binomial_heap_tag</tt></a>),
+    and so its amortized <tt>push</tt> performance is slower in
+    terms of constants.</p>
+<p>As the table shows, the "least constrained" underlying
+    data structures are binary heaps and pairing heaps.
+    Consequently, it is not surprising that they perform best in
+    terms of amortized constants.</p>
+<ol>
+<li>Pairing heaps seem to perform best for non-primitive
+      types (<i>e.g.</i>, <tt>std::string</tt>s), as shown by
+      <a href="priority_queue_text_push_timing_test.html">Priority
+      Queue Text <tt>push</tt> Timing Test</a> and <a href="priority_queue_text_push_pop_timing_test.html">Priority
+      Queue Text <tt>push</tt> and <tt>pop</tt> Timing
+      Test</a></li>
+<li>binary heaps seem to perform best for primitive types
+      (<i>e.g.</i>, <tt><b>int</b></tt>s), as shown by <a href="priority_queue_random_int_push_timing_test.html">Priority
+      Queue Random Integer <tt>push</tt> Timing Test</a> and
+      <a href="priority_queue_random_int_push_pop_timing_test.html">Priority
+      Queue Random Integer <tt>push</tt> and <tt>pop</tt> Timing
+      Test</a>.</li>
+</ol>
+<h3><a name="pq_observations_graph" id="pq_observations_graph">Graph Algorithms</a></h3>
+<p>In some graph algorithms, a decrease-key operation is
+    required [<a href="references.html#clrs2001">clrs2001</a>];
+    this operation is identical to <tt>modify</tt> if a value is
+    increased (in the sense of the priority queue's comparison
+    functor). The table above and <a href="priority_queue_text_modify_up_timing_test.html">Priority Queue
+    Text <tt>modify</tt> Timing Test - I</a> show that a thin heap
+    (<a href="priority_queue.html"><tt>priority_queue</tt></a> with
+    <tt>Tag</tt> = <a href="thin_heap_tag.html"><tt>thin_heap_tag</tt></a>)
+    outperforms a pairing heap (<a href="priority_queue.html"><tt>priority_queue</tt></a> with
+    <tt>Tag</tt> =<tt>Tag</tt> = <a href="pairing_heap_tag.html"><tt>pairing_heap_tag</tt></a>),
+    but the rest of the tests show otherwise.</p>
+<p>This makes it difficult to decide which implementation to
+    use in this case. Dijkstra's shortest-path algorithm, for
+    example, requires <i>&Theta;(n)</i> <tt>push</tt> and
+    <tt>pop</tt> operations (in the number of vertices), but
+    <i>O(n<sup>2</sup>)</i> <tt>modify</tt> operations, which can
+    be in practice <i>&Theta;(n)</i> as well. It is difficult to
+    find an <i>a-priori</i> characterization of graphs in which the
+    <u>actual</u> number of <tt>modify</tt> operations will dwarf
+    the number of <tt>push</tt> and <tt>pop</tt> operations.</p>
+</div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/pq_regression_tests.html b/libstdc++-v3/docs/html/ext/pb_ds/pq_regression_tests.html
new file mode 100644
index 00000000000..1e894ca6edb
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/pq_regression_tests.html
@@ -0,0 +1,52 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+  <meta name="generator" content=
+  "HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+
+  <title>Priority-Queue Regression Tests</title>
+  <meta http-equiv="Content-Type" content=
+  "text/html; charset=us-ascii" />
+  </head>
+
+<body>
+  <div id="page">
+    <h1>Priority-Queue Regression Tests</h1>
+
+    <h2><a name="assoc_desc" id="assoc_desc">Description</a></h2>
+
+    <p>The library contains a single comprehensive regression test.
+    For a given container type in <tt>pb_ds</tt>, the test creates
+    an object of the container type and an object of the
+    corresponding STL type (<i>i.e.</i>,
+    <tt>std::priority_queue</tt>). It then performs a random
+    sequence of methods with random arguments (<i>e.g.</i>, pushes,
+    pops, and so forth) on both objects. At each operation, the
+    test checks the return value of the method, and optionally both
+    compares <tt>pb_ds</tt>'s object with the STL's object as well
+    as performing other consistency checks on <tt>pb_ds</tt>'s
+    object (<i>e.g.</i>, that the size returned by the
+    <tt>size</tt> method corresponds to the distance between its
+    <tt>begin</tt> and end iterators).</p>
+
+    <p>Additionally, the test integrally checks exception safety
+    and resource leaks. This is done as follows. A special
+    allocator type, written for the purpose of the test, both
+    randomly throws an exceptions when allocations are performed,
+    and tracks allocations and de-allocations. The exceptions thrown
+    at allocations simulate memory-allocation failures; the
+    tracking mechanism checks for memory-related bugs (<i>e.g.</i>,
+    resource leaks and multiple de-allocations). Both
+    <tt>pb_ds</tt>'s containers and the containers' value-types are
+    configured to use this allocator.</p>
+
+    <h2><a name="pq_tests" id="pq_tests">Tests</a></h2>
+
+    <p><a href=
+    "../../../../testsuite/ext/pb_ds/regression/priority_queue_rand.cc"><tt>priority_queue_rand.cc</tt></a>
+    checks all priority queue types.</p>
+  </div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/pq_tests.html b/libstdc++-v3/docs/html/ext/pb_ds/pq_tests.html
new file mode 100644
index 00000000000..de8cb447c71
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/pq_tests.html
@@ -0,0 +1,24 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+  <meta name="generator" content=
+  "HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+
+  <title>Priority-Queue Tests</title>
+  <meta http-equiv="Content-Type" content=
+  "text/html; charset=us-ascii" />
+  </head>
+
+<body>
+  <div id="page">
+    <h1>Priority-Queue Tests</h1>
+
+    <p><a href="pq_regression_tests.html">Priority-Queue Regression
+    Tests</a> describes the regression tests; <a href=
+    "pq_performance_tests.html">Priority-Queue Performance
+    Tests</a> describes the performance tests.</p>
+  </div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/prerequisites.html b/libstdc++-v3/docs/html/ext/pb_ds/prerequisites.html
new file mode 100644
index 00000000000..7c888849918
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/prerequisites.html
@@ -0,0 +1,46 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+  <meta name="generator" content=
+  "HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+
+  <title>Prerequisites</title>
+  <meta http-equiv="Content-Type" content=
+  "text/html; charset=us-ascii" />
+  </head>
+
+<body>
+  <div id="page">
+    <h1>Usage Prerequisites</h1>
+
+    <p><tt>pb_ds</tt> has been successfully tested with the
+    following compilers:</p>
+
+    <ol>
+      <li>g++ 3.3.1, 3.4.4, 4.0, 4.1, and what will be 4.2</li>
+
+      <li>Intel icpc 8.1 and 9</li>
+
+      <li>Visual C++ .Net 2005</li>
+    </ol>
+
+    <p>The library contains only header files, and does not require
+    any other libraries except the STL. All classes are defined in
+    <tt><b>namespace</b> pb_ds</tt>. The library internally uses
+    macros beginning with <tt>PB_DS</tt> (<i>e.g.</i>, for header
+    guards), but <tt>#<b>undef</b></tt>s anything it
+    <tt>#<b>define</b></tt>s (except for header guards). Compiling
+    the library in an environment where macros beginning in
+    <tt>PB_DS</tt> are defined, may yield unpredictable results in
+    compilation, execution, or both.</p>
+
+    <p> Further dependencies are necessary to create the visual output
+    for the performance tests. To create these graphs, two additional
+    packages will be needed: <b>pychart</b> and <b>Beautiful
+    Soup</b>. Both are freely available.
+    </p>
+  </div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/priority_queue.html b/libstdc++-v3/docs/html/ext/pb_ds/priority_queue.html
new file mode 100644
index 00000000000..169953f6d59
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/priority_queue.html
@@ -0,0 +1,995 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+  <meta name="generator" content=
+  "HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+
+  <title>priority_queue Interface</title>
+  <meta http-equiv="Content-Type" content=
+  "text/html; charset=us-ascii" />
+  </head>
+
+<body>
+  <div id="page">
+    <h1><tt>priority_queue</tt> Interface</h1>
+
+    <p>Basic priority queue.</p>
+
+    <p>Defined in: <a href=
+    "../../../../include/ext/pb_ds/priority_queue.hpp"><tt>priority_queue.hpp</tt></a></p>
+
+    <h2><a name="link1" id="link1">Template Parameters</a></h2>
+
+    <table class="c1" width="100%" border="1" summary=
+    "Template Parameters">
+      <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="Value_Type216514186" id=
+"Value_Type216514186"><b>typename</b> Value_Type</a>
+</pre>
+        </td>
+
+        <td>
+          <p>Value type.</p>
+        </td>
+
+        <td>-</td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="Cmp_Fn294335" id="Cmp_Fn294335"><b>class</b> Cmp_Fn </a>
+</pre>
+        </td>
+
+        <td>
+          <p>Comparison functor.</p>
+        </td>
+
+        <td>
+          <pre>
+std::less&lt;<a href=
+"#Value_Type216514186"><tt>Value_Type</tt></a>&gt;
+</pre>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="Tag278938" id="Tag278938"><b>class</b> Tag </a>
+</pre>
+        </td>
+
+        <td>
+          <p>Data-structure tag.</p>
+        </td>
+
+        <td><a href="pairing_heap_tag.html"><span class=
+        "c2"><tt>pairing_heap_tag</tt></span></a></td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="Allocator35940069" id=
+"Allocator35940069"><b>class</b> 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" id="link2">Public Types and
+    Constants</a></h2>
+
+    <h3><a name="link3" id="link3">General Container
+    Definitions</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Types">
+      <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_type55424436" id="size_type55424436">size_type</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<b>typename</b> <a href=
+"#Allocator35940069"><tt>Allocator</tt></a>::size_type
+</pre>
+        </td>
+
+        <td>
+          <p>Size type.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="difference_type868028452" id=
+"difference_type868028452">difference_type</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<b>typename</b> <a href=
+"#Allocator35940069"><tt>Allocator</tt></a>::difference_type
+</pre>
+        </td>
+
+        <td>
+          <p>Difference type.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h3><a name="link4" id="link4">Categories</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Types">
+      <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="container_category1247973216" id=
+"container_category1247973216">container_category</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<a href="#Tag278938"><tt>Tag</tt></a>
+</pre>
+        </td>
+
+        <td>
+          <p>The underlying mapped-structure tag of the
+          container.</p>
+
+          <p>This is one of:</p>
+
+          <ol>
+            <li><a href="binary_heap_tag.html"><span class=
+            "c2"><tt>binary_heap_tag</tt></span></a></li>
+
+            <li><a href="binomial_heap_tag.html"><span class=
+            "c2"><tt>binomial_heap_tag</tt></span></a></li>
+
+            <li><a href="rc_binomial_heap_tag.html"><span class=
+            "c2"><tt>rc_binomial_heap_tag</tt></span></a></li>
+
+            <li><a href="pairing_heap_tag.html"><span class=
+            "c2"><tt>pairing_heap_tag</tt></span></a></li>
+
+            <li><a href="thin_heap_tag.html"><span class=
+            "c2"><tt>thin_heap_tag</tt></span></a></li>
+          </ol>
+        </td>
+      </tr>
+    </table>
+
+    <h3><a name="link5" id="link5">Policy Definitions</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Types">
+      <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_fn394495" id="cmp_fn394495">cmp_fn</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<a href="#Cmp_Fn294335"><tt>Cmp_Fn</tt></a>
+</pre>
+        </td>
+
+        <td>
+          <p>Comparison functor type.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="allocator48440069" id="allocator48440069">allocator</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<a href="#Allocator35940069"><tt>Allocator</tt></a>
+</pre>
+        </td>
+
+        <td>
+          <p><a href="#Allocator35940069"><tt>Allocator</tt></a>
+          type.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h3><a name="link6" id="link6">Value-Type Definitions</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Types">
+      <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_type279018186" id=
+"value_type279018186">value_type</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<a href="#Value_Type216514186"><tt>Value_Type</tt></a>
+</pre>
+        </td>
+
+        <td>
+          <p>Value type.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="reference54418471" id="reference54418471">reference</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<b>typename</b> <a href=
+"#allocator48440069"><tt>allocator</tt></a>::<b>template</b> rebind&lt;
+    <a href=
+"#value_type279018186"><tt>value_type</tt></a>&gt;::other::reference
+</pre>
+        </td>
+
+        <td>
+          <p>Value reference type.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="const_reference495461441" id=
+"const_reference495461441">const_reference</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<b>typename</b> <a href=
+"#allocator48440069"><tt>allocator</tt></a>::<b>template</b> rebind&lt;
+    <a href=
+"#value_type279018186"><tt>value_type</tt></a>&gt;::other::const_reference
+</pre>
+        </td>
+
+        <td>
+          <p>Const value <a href=
+          "#reference54418471"><tt>reference</tt></a> type.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="pointer2179769" id="pointer2179769">pointer</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<b>typename</b> <a href=
+"#allocator48440069"><tt>allocator</tt></a>::<b>template</b> rebind&lt;
+    <a href=
+"#value_type279018186"><tt>value_type</tt></a>&gt;::other::pointer
+</pre>
+        </td>
+
+        <td>
+          <p>Value pointer type.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="const_pointer878814947" id=
+"const_pointer878814947">const_pointer</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<b>typename</b> <a href=
+"#allocator48440069"><tt>allocator</tt></a>::<b>template</b> rebind&lt;
+    <a href=
+"#value_type279018186"><tt>value_type</tt></a>&gt;::other::const_pointer
+</pre>
+        </td>
+
+        <td>
+          <p>Const Value <a href=
+          "#pointer2179769"><tt>pointer</tt></a> type.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h3><a name="link7" id="link7">Iterator Definitions</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Types">
+      <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_point_iterator2364676009" id=
+"const_point_iterator2364676009">const_point_iterator</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+Const point-type iterator.
+</pre>
+        </td>
+
+        <td>
+          <p>Const point-type iterator.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="point_iterator2789896775" id=
+"point_iterator2789896775">point_iterator</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+Point-type iterator.
+</pre>
+        </td>
+
+        <td>
+          <p>Point-type iterator.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="const_iterator98626788" id=
+"const_iterator98626788">const_iterator</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+Const range-type iterator.
+</pre>
+        </td>
+
+        <td>
+          <p>Const range-type iterator.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="iterator10418194" id="iterator10418194">iterator</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+Range-type iterator.
+</pre>
+        </td>
+
+        <td>
+          <p>Range-type iterator.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h2><a name="link8" id="link8">Public Methods</a></h2>
+
+    <h3><a name="link9" id="link9">Constructors, Destructor, and
+    Related</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <tr>
+        <td width="45%" align="left"><b>Method</b></td>
+
+        <td width="55%" align="left"><b>Description</b></td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+  priority_queue
+  ()
+</pre>
+        </td>
+
+        <td>
+          <p>Default constructor.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+  priority_queue
+  (<b>const</b> <a href=
+"#cmp_fn394495"><tt>cmp_fn</tt></a> &amp;r_cmp_fn)
+</pre>
+        </td>
+
+        <td>
+          <p>Constructor taking some policy objects. <span class=
+          "c1"><tt>r_cmp_fn</tt></span> will be copied by the
+          <a href="#Cmp_Fn294335"><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;
+  priority_queue
+  (It first_it, 
+    It last_it)
+</pre>
+        </td>
+
+        <td>
+          <p>Constructor taking iterators to a range of <a href=
+          "#value_type279018186"><tt>value_type</tt></a>s. The
+          <a href="#value_type279018186"><tt>value_type</tt></a>s
+          between <span class="c1"><tt>first_it</tt></span> and
+          <span class="c1"><tt>last_it</tt></span> will be inserted
+          into the container object.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<b>template</b>&lt;
+    <b>class</b> It&gt;
+  priority_queue
+  (It first_it, 
+    It last_it,
+    <b>const</b> <a href=
+"#cmp_fn394495"><tt>cmp_fn</tt></a> &amp;r_cmp_fn)
+</pre>
+        </td>
+
+        <td>
+          <p>Constructor taking iterators to a range of <a href=
+          "#value_type279018186"><tt>value_type</tt></a>s and some
+          policy objects The <a href=
+          "#value_type279018186"><tt>value_type</tt></a>s between
+          <span class="c1"><tt>first_it</tt></span> and
+          <span class="c1"><tt>last_it</tt></span> will be inserted
+          into the container object. <span class=
+          "c1"><tt>r_cmp_fn</tt></span> will be copied by the
+          <a href="#cmp_fn394495"><tt>cmp_fn</tt></a> object of the
+          container object.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+  priority_queue
+  (<b>const</b> <span class=
+"c2"><tt>priority_queue</tt></span> &amp;other)
+</pre>
+        </td>
+
+        <td>
+          <p>Copy constructor.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<b>virtual</b> 
+  ~priority_queue
+  ()
+</pre>
+        </td>
+
+        <td>
+          <p>Destructor.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<span class="c2"><tt>priority_queue</tt></span> &amp;
+  <b>operator</b>=
+  (<b>const</b> <span class=
+"c2"><tt>priority_queue</tt></span> &amp;other)
+</pre>
+        </td>
+
+        <td>
+          <p>Assignment operator.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<b>void</b>
+  swap
+  (<span class="c2"><tt>priority_queue</tt></span> &amp;other)
+</pre>
+        </td>
+
+        <td>
+          <p>Swaps content.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h3><a name="link10" id="link10">Information Methods</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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_type55424436"><tt>size_type</tt></a>
+  size
+  () <b>const</b>
+</pre>
+        </td>
+
+        <td>
+          <p>Returns the number of distinct <a href=
+          "#value_type279018186"><tt>value_type</tt></a> objects
+          the container object is storing.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<b>inline</b> <a href="#size_type55424436"><tt>size_type</tt></a>
+  max_size
+  () <b>const</b>
+</pre>
+        </td>
+
+        <td>
+          <p>Returns an upper bound on the number of distinct
+          <a href="#value_type279018186"><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_type279018186"><tt>value_type</tt></a>
+          objects.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h3><a name="link11" id="link11">Insert Methods</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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=
+"#point_iterator2789896775"><tt>point_iterator</tt></a>
+  push
+  (<a href=
+"#const_reference495461441"><tt>const_reference</tt></a> r_val)
+</pre>
+        </td>
+
+        <td>
+          <p>Inserts a <a href=
+          "#value_type279018186"><tt>value_type</tt></a> object.
+          returns a <a href=
+          "#point_iterator2789896775"><tt>point_iterator</tt></a>
+          object associated with the new pushed <span class=
+          "c1"><tt>r_val</tt></span>.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h3><a name="link12" id="link12">Find Methods</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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=
+"#const_reference495461441"><tt>const_reference</tt></a> 
+  top
+  () <b>const</b>
+</pre>
+        </td>
+
+        <td>
+          <p>Returns the <a href=
+          "#const_reference495461441"><tt>const_reference</tt></a>
+          of the largest <a href=
+          "#value_type279018186"><tt>value_type</tt></a> in the
+          container object, i.e., a <a href=
+          "#value_type279018186"><tt>value_type</tt></a> v_max for
+          which any other <a href=
+          "#value_type279018186"><tt>value_type</tt></a> v in the
+          container object will satisfy !<a href=
+          "#cmp_fn394495"><tt>cmp_fn</tt></a>()(v_max, v).</p>
+        </td>
+      </tr>
+    </table>
+
+    <h3><a name="link13" id="link13">Modify Methods</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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>
+  modify
+  (<a href=
+"#point_iterator2789896775"><tt>point_iterator</tt></a> it,
+    <a href=
+"#const_reference495461441"><tt>const_reference</tt></a> r_new_val)
+</pre>
+        </td>
+
+        <td>
+          <p>Modifies the <a href=
+          "#value_type279018186"><tt>value_type</tt></a> associated
+          with the <a href=
+          "#point_iterator2789896775"><tt>point_iterator</tt></a>
+          <span class="c1"><tt>it</tt></span> into <span class=
+          "c1"><tt>r_new_val</tt></span>.</p>
+
+          <p>To use this method, <a href=
+          "#value_type279018186"><tt>value_type</tt></a> must be
+          assignable.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h3><a name="link14" id="link14">Erase Methods</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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>
+  pop
+  ()
+</pre>
+        </td>
+
+        <td>
+          <p>Pops the largest <a href=
+          "#value_type279018186"><tt>value_type</tt></a>.</p>
+
+          <p>If the container object is empty, results are
+          undefined.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<b>inline</b> <b>void</b>
+  erase
+  (<a href=
+"#point_iterator2789896775"><tt>point_iterator</tt></a> it)
+</pre>
+        </td>
+
+        <td>
+          <p>Erases the <a href=
+          "#value_type279018186"><tt>value_type</tt></a> associated
+          with the <a href=
+          "#point_iterator2789896775"><tt>point_iterator</tt></a>
+          <span class="c1"><tt>it</tt></span>.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<b>template</b>&lt;
+  <b>class</b> Pred&gt;
+<b>inline</b> <a href="#size_type55424436"><tt>size_type</tt></a> 
+  erase_if
+  (Pred prd)
+</pre>
+        </td>
+
+        <td>
+          <p>Erases any <a href=
+          "#value_type279018186"><tt>value_type</tt></a> satisfying
+          the predicate <span class="c1"><tt>prd</tt></span>;
+          returns the number of <a href=
+          "#value_type279018186"><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>
+
+    <h3><a name="link15" id="link15">Split and join
+    Methods</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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
+  (<span class="c2"><tt>priority_queue</tt></span> &amp;other)
+</pre>
+        </td>
+
+        <td>
+          <p>Joins two container objects. When this function
+          returns, <span class="c1"><tt>other</tt></span> will be
+          empty.</p>
+
+          <p>When calling this method, <span class=
+          "c1"><tt>other</tt></span>'s policies must be
+          equivalent to this object's policies.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<b>template</b>&lt;
+  <b>class</b> Pred&gt;
+<b>inline</b> <b>void</b>
+  split
+  (Pred prd,
+    <span class="c2"><tt>priority_queue</tt></span> &amp;other)
+</pre>
+        </td>
+
+        <td>
+          <p>Splits into two container objects. When this function
+          returns, <span class="c1"><tt>other</tt></span> will be
+          contain only values v for which <span class=
+          "c1"><tt>prd</tt></span>(v) is <tt><b>true</b></tt>.</p>
+
+          <p>When calling this method, <span class=
+          "c1"><tt>other</tt></span>'s policies must be
+          equivalent to this object's policies.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h3><a name="link16" id="link16">Iteration Methods</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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="#iterator10418194"><tt>iterator</tt></a>
+  begin
+  ()
+</pre>
+        </td>
+
+        <td>
+          <p>Returns an <a href=
+          "#iterator10418194"><tt>iterator</tt></a> corresponding
+          to the first <a href=
+          "#value_type279018186"><tt>value_type</tt></a> in the
+          container.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<b>inline</b> <a href=
+"#const_iterator98626788"><tt>const_iterator</tt></a>
+  begin
+  () <b>const</b>
+</pre>
+        </td>
+
+        <td>
+          <p>Returns a <a href=
+          "#const_iterator98626788"><tt>const_iterator</tt></a>
+          corresponding to the first <a href=
+          "#value_type279018186"><tt>value_type</tt></a> in the
+          container.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<b>inline</b> <a href="#iterator10418194"><tt>iterator</tt></a>
+  end
+  ()
+</pre>
+        </td>
+
+        <td>
+          <p>Returns an <a href=
+          "#iterator10418194"><tt>iterator</tt></a> corresponding
+          to the just-after-last <a href=
+          "#value_type279018186"><tt>value_type</tt></a> in the
+          container.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<b>inline</b> <a href=
+"#const_iterator98626788"><tt>const_iterator</tt></a>
+  end
+  () <b>const</b>
+</pre>
+        </td>
+
+        <td>
+          <p>Returns a <a href=
+          "#const_iterator98626788"><tt>const_iterator</tt></a>
+          corresponding to the just-after-last <a href=
+          "#value_type279018186"><tt>value_type</tt></a> in the
+          container.</p>
+        </td>
+      </tr>
+    </table>
+  </div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_random_int_push_pop_timing_test.html b/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_random_int_push_pop_timing_test.html
new file mode 100644
index 00000000000..e9aec9ceb04
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_random_int_push_pop_timing_test.html
@@ -0,0 +1,161 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+<meta name="generator" content="HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+<title>Priority Queue Random Int Push Pop Timing Test</title>
+<meta http-equiv="Content-Type" content="text/html; charset=us-ascii" />
+</head>
+<body>
+<div id="page">
+<h1>Priority Queue Random Integer <tt>push</tt> and
+    <tt>pop</tt> Timing Test</h1>
+<h2><a name="description" id="description">Description</a></h2>
+<p>This test inserts a number of values with i.i.d. integer
+    keys into a container using <tt>push</tt> , then removes them
+    using <tt>pop</tt> . It measures the average time for
+    <tt>push</tt> and <tt>pop</tt> as a function of the number of
+    values.</p>
+<p>(The test was executed with <a href="../../../../testsuite/performance/ext/pb_ds/priority_queue_random_int_push_pop_timing.cc">
+<tt>priority_queue_random_int_push_pop_timing_test</tt></a>
+    thirty_years_among_the_dead_preproc.txt 200 200 2100)</p>
+<h2><a name="purpose" id="purpose">Purpose</a></h2>
+<p>The test checks the effect of different underlying
+    data structures (see <a href="pq_design.html#pq_imp">Design::Priority
+    Queues::Implementations</a>).</p>
+<h2><a name="results" id="results">Results</a></h2>
+<p>Figures <a href="#NPG">NPG</a>, <a href="#NPM">NPM</a>, and
+    <a href="#NPL">NPL</a> shows the results for the native
+    priority queues and <tt>pb_ds</tt> 's priority queues in
+    <a href="pq_performance_tests.html#gcc"><u>g++</u></a>,
+    <a href="pq_performance_tests.html#msvc"><u>msvc++</u></a>, and
+    <a href="pq_performance_tests.html#local"><u>local</u></a>,
+    respectively.</p>
+<div id="NPG_res_div">
+<div id="NPG_gcc">
+<div id="NPG_priority_queue_random_int_push_pop_timing_test">
+<div id="NPG_pq">
+<div id="NPG_Native_and__tt_pb_ds_455tt__priority_queue__tt_push_455tt___tt_pop_455tt__timing_test"><div style="border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NPG" id="NPG"><img src="priority_queue_random_int_push_pop_timing_test_gcc.png" alt="no image" /></a></h6>NPG: Native and <tt>pb ds</tt> priority queue <tt>push</tt> <tt>pop</tt> timing test - <a href="pq_performance_tests.html#gcc">g++</a><p>In the above figure, the names in the legends have the following meaning:</p>
+<ol>
+<li>
+thin_heap-
+<a href="priority_queue.html"><tt>priority_queue</tt></a>
+ with <tt>Tag</tt> = <a href="thin_heap_tag.html"><tt>thin_heap_tag</tt></a>
+</li>
+<li>
+rc_binomial_heap-
+<a href="priority_queue.html"><tt>priority_queue</tt></a>
+ with <tt>Tag</tt> = <a href="rc_binomial_heap_tag.html"><tt>rc_binomial_heap_tag</tt></a>
+</li>
+<li>
+binomial_heap-
+<a href="priority_queue.html"><tt>priority_queue</tt></a>
+ with <tt>Tag</tt> = <a href="binomial_heap_tag.html"><tt>binomial_heap_tag</tt></a>
+</li>
+<li>
+pairing_heap-
+<a href="priority_queue.html"><tt>priority_queue</tt></a>
+ with <tt>Tag</tt> = <a href="pairing_heap_tag.html"><tt>pairing_heap_tag</tt></a>
+</li>
+<li>
+n_pq_deque-
+<tt>std::priority_queue</tt> adapting <tt>std::deque</tt></li>
+<li>
+n_pq_vector-
+<tt>std::priority_queue</tt> adapting <tt>std::vector</tt></li>
+<li>
+binary_heap-
+<a href="priority_queue.html"><tt>priority_queue</tt></a>
+ with <tt>Tag</tt> = <a href="binary_heap_tag.html"><tt>binary_heap_tag</tt></a>
+</li>
+</ol>
+</div><div style="width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<div id="NPM_res_div">
+<div id="NPM_msvc">
+<div id="NPM_priority_queue_random_int_push_pop_timing_test">
+<div id="NPM_pq">
+<div id="NPM_Native_and__tt_pb_ds_455tt__priority_queue__tt_push_455tt___tt_pop_455tt__timing_test"><div style="border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NPM" id="NPM"><img src="priority_queue_random_int_push_pop_timing_test_msvc.png" alt="no image" /></a></h6>NPM: Native and <tt>pb ds</tt> priority queue <tt>push</tt> <tt>pop</tt> timing test - <a href="pq_performance_tests.html#msvc">msvc++</a><p>In the above figure, the names in the legends have the following meaning:</p>
+<ol>
+<li>
+thin_heap-
+<a href="priority_queue.html"><tt>priority_queue</tt></a>
+ with <tt>Tag</tt> = <a href="thin_heap_tag.html"><tt>thin_heap_tag</tt></a>
+</li>
+<li>
+rc_binomial_heap-
+<a href="priority_queue.html"><tt>priority_queue</tt></a>
+ with <tt>Tag</tt> = <a href="rc_binomial_heap_tag.html"><tt>rc_binomial_heap_tag</tt></a>
+</li>
+<li>
+binomial_heap-
+<a href="priority_queue.html"><tt>priority_queue</tt></a>
+ with <tt>Tag</tt> = <a href="binomial_heap_tag.html"><tt>binomial_heap_tag</tt></a>
+</li>
+<li>
+pairing_heap-
+<a href="priority_queue.html"><tt>priority_queue</tt></a>
+ with <tt>Tag</tt> = <a href="pairing_heap_tag.html"><tt>pairing_heap_tag</tt></a>
+</li>
+<li>
+n_pq_deque-
+<tt>std::priority_queue</tt> adapting <tt>std::deque</tt></li>
+<li>
+n_pq_vector-
+<tt>std::priority_queue</tt> adapting <tt>std::vector</tt></li>
+<li>
+binary_heap-
+<a href="priority_queue.html"><tt>priority_queue</tt></a>
+ with <tt>Tag</tt> = <a href="binary_heap_tag.html"><tt>binary_heap_tag</tt></a>
+</li>
+</ol>
+</div><div style="width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<div id="NPL_res_div">
+<div id="NPL_local">
+<div id="NPL_priority_queue_random_int_push_pop_timing_test">
+<div id="NPL_pq">
+<div id="NPL_Native_and__tt_pb_ds_455tt__priority_queue__tt_push_455tt___tt_pop_455tt__timing_test"><div style = "border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NPL" id= "NPL"><img src="priority_queue_random_int_push_pop_timing_test_local.png" alt="no image" /></a></h6>NPL: Native and <tt>pb ds</tt> priority queue <tt>push</tt> <tt>pop</tt> timing test - <a href = "pq_performance_tests.html#local">local</a></div><div style = "width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<h2><a name="observations" id="observations">Observations</a></h2>
+<p>Binary heaps are the most suited for sequences of
+    <tt>push</tt> and <tt>pop</tt> operations of primitive types
+    (<i>e.g.</i> <tt><b>int</b></tt>s). This is explained in
+    <a href="priority_queue_random_int_push_timing_test.html">Priority
+    Queue Random Int <tt>push</tt> Timing Test</a> . (See <a href="priority_queue_text_push_pop_timing_test.html">Priority Queue
+    Text <tt>push</tt> Timing Test</a> for the case of primitive
+    types.)</p>
+<p>At first glance it seems that the STL's vector-based
+    priority queue is approximately on par with <tt>pb_ds</tt>'s
+    corresponding priority queue. There are two differences
+    however:</p>
+<ol>
+<li>The STL's priority queue does not downsize the underlying
+      vector (or deque) as the priority queue becomes smaller
+      (see <a href="priority_queue_text_pop_mem_usage_test.html">Priority Queue
+      Text <tt>pop</tt> Memory Use Test</a>). It is therefore
+      gaining some speed at the expense of space.</li>
+<li>From <a href="priority_queue_random_int_push_pop_timing_test.html">Priority
+      Queue Random Integer <tt>push</tt> and <tt>pop</tt> Timing
+      Test</a>, it seems that the STL's priority queue is slower in
+      terms of <tt>pus</tt> operations. Since the number of
+      <tt>pop</tt> operations is at most that of <tt>push</tt>
+      operations, the test here is the "best" for the STL's
+      priority queue.</li>
+</ol>
+<p><a href="pq_performance_tests.html#pq_observations">Priority-Queue
+    Performance Tests::Observations</a> discusses this further and
+    summarizes.</p>
+</div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_random_int_push_pop_timing_test_gcc.png b/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_random_int_push_pop_timing_test_gcc.png
new file mode 100644
index 00000000000..68f5e2b6bdb
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_random_int_push_pop_timing_test_gcc.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_random_int_push_pop_timing_test_local.png b/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_random_int_push_pop_timing_test_local.png
new file mode 100644
index 00000000000..51f8211f1d4
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_random_int_push_pop_timing_test_local.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_random_int_push_pop_timing_test_msvc.png b/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_random_int_push_pop_timing_test_msvc.png
new file mode 100644
index 00000000000..4fc191c8b1c
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_random_int_push_pop_timing_test_msvc.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_random_int_push_timing_test.html b/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_random_int_push_timing_test.html
new file mode 100644
index 00000000000..65323029bac
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_random_int_push_timing_test.html
@@ -0,0 +1,200 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+<meta name="generator" content="HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+<title>Priority Queue Random Int Push Timing Test</title>
+<meta http-equiv="Content-Type" content="text/html; charset=us-ascii" />
+</head>
+<body>
+<div id="page">
+<h1>Priority Queue Random Integer <tt>push</tt> Timing
+    Test</h1>
+<h2><a name="description" id="description">Description</a></h2>
+<p>This test inserts a number of values with i.i.d integer keys
+    into a container using <tt>push</tt> . It measures the average
+    time for <tt>push</tt> as a function of the number of
+    values.</p>
+<p>(The test was executed with <a href="../../../../testsuite/performance/ext/pb_ds/priority_queue_random_int_push_timing.cc"><tt>
+    priority_queue_random_intpush_timing_test</tt></a>
+    thirty_years_among_the_dead_preproc.txt 200 200 2100)</p>
+<h2><a name="purpose" id="purpose">Purpose</a></h2>
+<p>The test checks the effect of different underlying
+    data structures (see <a href="pq_design.html#pq_imp">Design::Priority
+    Queues::Implementations</a>).</p>
+<h2><a name="results" id="results">Results</a></h2>
+<p>Figures <a href="#NPG">NPG</a>, <a href="#NPM">NPM</a>, and
+    <a href="#NPL">NPL</a> show the results for the native priority
+    queues and <tt>pb_ds</tt> 's priority queues in <a href="assoc_performance_tests.html#gcc"><u>g++</u></a>, <a href="assoc_performance_tests.html#msvc"><u>msvc++</u></a>, and
+    <a href="assoc_performance_tests.html#local"><u>local</u></a>,
+    respectively; Figures <a href="#NBPG">NBPG</a>, <a href="#NBPM">NBPM</a>, and <a href="#NBPL">NBPL</a> shows the
+    results for the binary-heap based native priority queues and
+    <tt>pb_ds</tt> 's priority queues in <a href="assoc_performance_tests.html#gcc"><u>g++</u></a>, <a href="assoc_performance_tests.html#msvc"><u>msvc++</u></a>, and
+    <a href="assoc_performance_tests.html#local"><u>local</u></a>,
+    respectively</p>
+<div id="NPG_res_div">
+<div id="NPG_gcc">
+<div id="NPG_priority_queue_random_int_push_timing_test">
+<div id="NPG_pq">
+<div id="NPG_Native_and__tt_pb_ds_455tt__priority_queue__tt_push_455tt__timing_test"><div style="border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NPG" id="NPG"><img src="priority_queue_random_int_push_timing_test_gcc.png" alt="no image" /></a></h6>NPG: Native and <tt>pb ds</tt> priority queue <tt>push</tt> timing test - <a href="pq_performance_tests.html#gcc">g++</a><p>In the above figure, the names in the legends have the following meaning:</p>
+<ol>
+<li>
+rc_binomial_heap-
+<a href="priority_queue.html"><tt>priority_queue</tt></a>
+ with <tt>Tag</tt> = <a href="rc_binomial_heap_tag.html"><tt>rc_binomial_heap_tag</tt></a>
+</li>
+<li>
+binomial_heap-
+<a href="priority_queue.html"><tt>priority_queue</tt></a>
+ with <tt>Tag</tt> = <a href="binomial_heap_tag.html"><tt>binomial_heap_tag</tt></a>
+</li>
+<li>
+n_pq_deque-
+<tt>std::priority_queue</tt> adapting <tt>std::deque</tt></li>
+<li>
+pairing_heap-
+<a href="priority_queue.html"><tt>priority_queue</tt></a>
+ with <tt>Tag</tt> = <a href="pairing_heap_tag.html"><tt>pairing_heap_tag</tt></a>
+</li>
+<li>
+thin_heap-
+<a href="priority_queue.html"><tt>priority_queue</tt></a>
+ with <tt>Tag</tt> = <a href="thin_heap_tag.html"><tt>thin_heap_tag</tt></a>
+</li>
+<li>
+n_pq_vector-
+<tt>std::priority_queue</tt> adapting <tt>std::vector</tt></li>
+<li>
+binary_heap-
+<a href="priority_queue.html"><tt>priority_queue</tt></a>
+ with <tt>Tag</tt> = <a href="binary_heap_tag.html"><tt>binary_heap_tag</tt></a>
+</li>
+</ol>
+</div><div style="width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<div id="NPM_res_div">
+<div id="NPM_msvc">
+<div id="NPM_priority_queue_random_int_push_timing_test">
+<div id="NPM_pq">
+<div id="NPM_Native_and__tt_pb_ds_455tt__priority_queue__tt_push_455tt__timing_test"><div style="border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NPM" id="NPM"><img src="priority_queue_random_int_push_timing_test_msvc.png" alt="no image" /></a></h6>NPM: Native and <tt>pb ds</tt> priority queue <tt>push</tt> timing test - <a href="pq_performance_tests.html#msvc">msvc++</a><p>In the above figure, the names in the legends have the following meaning:</p>
+<ol>
+<li>
+rc_binomial_heap-
+<a href="priority_queue.html"><tt>priority_queue</tt></a>
+ with <tt>Tag</tt> = <a href="rc_binomial_heap_tag.html"><tt>rc_binomial_heap_tag</tt></a>
+</li>
+<li>
+binomial_heap-
+<a href="priority_queue.html"><tt>priority_queue</tt></a>
+ with <tt>Tag</tt> = <a href="binomial_heap_tag.html"><tt>binomial_heap_tag</tt></a>
+</li>
+<li>
+pairing_heap-
+<a href="priority_queue.html"><tt>priority_queue</tt></a>
+ with <tt>Tag</tt> = <a href="pairing_heap_tag.html"><tt>pairing_heap_tag</tt></a>
+</li>
+<li>
+thin_heap-
+<a href="priority_queue.html"><tt>priority_queue</tt></a>
+ with <tt>Tag</tt> = <a href="thin_heap_tag.html"><tt>thin_heap_tag</tt></a>
+</li>
+<li>
+n_pq_deque-
+<tt>std::priority_queue</tt> adapting <tt>std::deque</tt></li>
+<li>
+n_pq_vector-
+<tt>std::priority_queue</tt> adapting <tt>std::vector</tt></li>
+<li>
+binary_heap-
+<a href="priority_queue.html"><tt>priority_queue</tt></a>
+ with <tt>Tag</tt> = <a href="binary_heap_tag.html"><tt>binary_heap_tag</tt></a>
+</li>
+</ol>
+</div><div style="width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<div id="NPL_res_div">
+<div id="NPL_local">
+<div id="NPL_priority_queue_random_int_push_timing_test">
+<div id="NPL_pq">
+<div id="NPL_Native_and__tt_pb_ds_455tt__priority_queue__tt_push_455tt__timing_test"><div style = "border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NPL" id= "NPL"><img src="priority_queue_random_int_push_timing_test_local.png" alt="no image" /></a></h6>NPL: Native and <tt>pb ds</tt> priority queue <tt>push</tt> timing test - <a href = "pq_performance_tests.html#local">local</a></div><div style = "width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<div id="NBPG_res_div">
+<div id="NBPG_gcc">
+<div id="NBPG_binary_priority_queue_random_int_push_timing_test">
+<div id="NBPG_pq">
+<div id="NBPG_Native_and__tt_pb_ds_455tt__binary_priority_queue__tt_push_455tt__timing_test"><div style="border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NBPG" id="NBPG"><img src="binary_priority_queue_random_int_push_timing_test_gcc.png" alt="no image" /></a></h6>NBPG: Native and <tt>pb ds</tt> binary priority queue <tt>push</tt> timing test - <a href="pq_performance_tests.html#gcc">g++</a><p>In the above figure, the names in the legends have the following meaning:</p>
+<ol>
+<li>
+n_pq_deque-
+<tt>std::priority_queue</tt> adapting <tt>std::deque</tt></li>
+<li>
+n_pq_vector-
+<tt>std::priority_queue</tt> adapting <tt>std::vector</tt></li>
+<li>
+binary_heap-
+<a href="priority_queue.html"><tt>priority_queue</tt></a>
+ with <tt>Tag</tt> = <a href="binary_heap_tag.html"><tt>binary_heap_tag</tt></a>
+</li>
+</ol>
+</div><div style="width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<div id="NBPM_res_div">
+<div id="NBPM_msvc">
+<div id="NBPM_binary_priority_queue_random_int_push_timing_test">
+<div id="NBPM_pq">
+<div id="NBPM_Native_and__tt_pb_ds_455tt__binary_priority_queue__tt_push_455tt__timing_test"><div style="border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NBPM" id="NBPM"><img src="binary_priority_queue_random_int_push_timing_test_msvc.png" alt="no image" /></a></h6>NBPM: Native and <tt>pb ds</tt> binary priority queue <tt>push</tt> timing test - <a href="pq_performance_tests.html#msvc">msvc++</a><p>In the above figure, the names in the legends have the following meaning:</p>
+<ol>
+<li>
+n_pq_deque-
+<tt>std::priority_queue</tt> adapting <tt>std::deque</tt></li>
+<li>
+n_pq_vector-
+<tt>std::priority_queue</tt> adapting <tt>std::vector</tt></li>
+<li>
+binary_heap-
+<a href="priority_queue.html"><tt>priority_queue</tt></a>
+ with <tt>Tag</tt> = <a href="binary_heap_tag.html"><tt>binary_heap_tag</tt></a>
+</li>
+</ol>
+</div><div style="width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<div id="NBPL_res_div">
+<div id="NBPL_local">
+<div id="NBPL_binary_priority_queue_random_int_push_timing_test">
+<div id="NBPL_pq">
+<div id="NBPL_Native_and__tt_pb_ds_455tt__binary_priority_queue__tt_push_455tt__timing_test"><div style = "border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NBPL" id= "NBPL"><img src="binary_priority_queue_random_int_push_timing_test_local.png" alt="no image" /></a></h6>NBPL: Native and <tt>pb ds</tt> binary priority queue <tt>push</tt> timing test - <a href = "pq_performance_tests.html#local">local</a></div><div style = "width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<h2><a name="observations" id="observations">Observations</a></h2>
+<p>Binary heaps are the most suited for sequences of
+    <tt>push</tt> and <tt>pop</tt> operations of primitive types
+    (<i>e.g.</i> <tt><b>int</b></tt>s). They are less constrained
+    than any other type, and since it is very efficient to store
+    such types in arrays, they outperform even pairing heaps. (See
+    <a href="priority_queue_text_push_timing_test.html">Priority
+    Queue Text <tt>push</tt> Timing Test</a> for the case of
+    non-primitive types.)</p>
+<p><a href="pq_performance_tests.html#pq_observations">Priority-Queue
+    Performance Tests::Observations</a> discusses this further and
+    summarizes.</p>
+</div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_random_int_push_timing_test_gcc.png b/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_random_int_push_timing_test_gcc.png
new file mode 100644
index 00000000000..ee8c9b7d9a9
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_random_int_push_timing_test_gcc.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_random_int_push_timing_test_local.png b/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_random_int_push_timing_test_local.png
new file mode 100644
index 00000000000..dead185fa4f
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_random_int_push_timing_test_local.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_random_int_push_timing_test_msvc.png b/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_random_int_push_timing_test_msvc.png
new file mode 100644
index 00000000000..0a1a8eaefbc
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_random_int_push_timing_test_msvc.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_tag.html b/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_tag.html
new file mode 100644
index 00000000000..4bad6ee6e82
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_tag.html
@@ -0,0 +1,47 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+  <meta name="generator" content=
+  "HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+
+  <title>priority_queue_tag Interface</title>
+  <meta http-equiv="Content-Type" content=
+  "text/html; charset=us-ascii" />
+  </head>
+
+<body>
+  <div id="page">
+    <h1><tt>priority_queue_tag</tt> Interface</h1>
+
+    <p>Basic priority-queue data structure tag.</p>
+
+    <p>Defined in: <a href=
+    "../../../../include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
+
+    <h2><a name="link1" id="link1">Base Classes</a></h2>
+
+    <table class="c1" width="100%" border="1" summary="Bases">
+      <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="container_tag.html"><span class=
+"c2"><tt>container_tag</tt></span></a>
+</pre>
+        </td>
+
+        <td>
+          <p>public</p>
+        </td>
+      </tr>
+    </table>
+  </div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_tag_cd.png b/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_tag_cd.png
new file mode 100644
index 00000000000..ed8d875f0f8
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_tag_cd.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_tag_cd.svg b/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_tag_cd.svg
new file mode 100644
index 00000000000..be007aecb8d
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_tag_cd.svg
@@ -0,0 +1,368 @@
+<?xml version="1.0" encoding="UTF-8" standalone="no"?>
+<!-- Created with Inkscape (http://www.inkscape.org/) -->
+<svg
+   xmlns:dc="http://purl.org/dc/elements/1.1/"
+   xmlns:cc="http://web.resource.org/cc/"
+   xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
+   xmlns:svg="http://www.w3.org/2000/svg"
+   xmlns="http://www.w3.org/2000/svg"
+   xmlns:xlink="http://www.w3.org/1999/xlink"
+   xmlns:sodipodi="http://inkscape.sourceforge.net/DTD/sodipodi-0.dtd"
+   xmlns:inkscape="http://www.inkscape.org/namespaces/inkscape"
+   width="11in"
+   height="8.5in"
+   id="svg2"
+   sodipodi:version="0.32"
+   inkscape:version="0.43"
+   version="1.0"
+   sodipodi:docbase="/mnt/share/src/policy_based_data_structures/pb_ds_images"
+   sodipodi:docname="pq_tag_diagram_2.svg"
+   inkscape:export-filename="/mnt/share/src/policy_based_data_structures/pb_ds_images/pq_tag_diagram_2.png"
+   inkscape:export-xdpi="90"
+   inkscape:export-ydpi="90">
+  <defs
+     id="defs4">
+    <marker
+       inkscape:stockid="Arrow1Mstart"
+       orient="auto"
+       refY="0.0"
+       refX="0.0"
+       id="Arrow1Mstart"
+       style="overflow:visible">
+      <path
+         id="path3311"
+         d="M 0.0,0.0 L 5.0,-5.0 L -12.5,0.0 L 5.0,5.0 L 0.0,0.0 z "
+         style="fill-rule:evenodd;stroke:#000000;stroke-width:1.0pt;marker-start:none"
+         transform="scale(0.4)" />
+    </marker>
+    <marker
+       inkscape:stockid="Arrow2Sstart"
+       orient="auto"
+       refY="0"
+       refX="0"
+       id="Arrow2Sstart"
+       style="overflow:visible">
+      <path
+         id="path3319"
+         style="font-size:12px;fill-rule:evenodd;stroke-width:0.625;stroke-linejoin:round"
+         d="M 8.7185878,4.0337352 L -2.2072895,0.016013256 L 8.7185884,-4.0017078 C 6.97309,-1.6296469 6.9831476,1.6157441 8.7185878,4.0337352 z "
+         transform="matrix(0.3,0,0,0.3,-1.5,0)" />
+    </marker>
+    <marker
+       inkscape:stockid="Arrow1Sstart"
+       orient="auto"
+       refY="0"
+       refX="0"
+       id="Arrow1Sstart"
+       style="overflow:visible">
+      <path
+         id="path3337"
+         d="M 0,0 L 5,-5 L -12.5,0 L 5,5 L 0,0 z "
+         style="fill-rule:evenodd;stroke:#000000;stroke-width:1pt;marker-start:none"
+         transform="scale(0.2,0.2)" />
+    </marker>
+    <marker
+       inkscape:stockid="Arrow2Send"
+       orient="auto"
+       refY="0"
+       refX="0"
+       id="Arrow2Send"
+       style="overflow:visible">
+      <path
+         id="path3316"
+         style="font-size:12px;fill-rule:evenodd;stroke-width:0.625;stroke-linejoin:round"
+         d="M 8.7185878,4.0337352 L -2.2072895,0.016013256 L 8.7185884,-4.0017078 C 6.97309,-1.6296469 6.9831476,1.6157441 8.7185878,4.0337352 z "
+         transform="matrix(-0.3,0,0,-0.3,1.5,0)" />
+    </marker>
+    <marker
+       inkscape:stockid="Arrow2Mend"
+       orient="auto"
+       refY="0"
+       refX="0"
+       id="Arrow2Mend"
+       style="overflow:visible">
+      <path
+         id="path3322"
+         style="font-size:12px;fill-rule:evenodd;stroke-width:0.625;stroke-linejoin:round"
+         d="M 8.7185878,4.0337352 L -2.2072895,0.016013256 L 8.7185884,-4.0017078 C 6.97309,-1.6296469 6.9831476,1.6157441 8.7185878,4.0337352 z "
+         transform="matrix(-0.6,0,0,-0.6,3,0)" />
+    </marker>
+    <marker
+       inkscape:stockid="Arrow1Lend"
+       orient="auto"
+       refY="0"
+       refX="0"
+       id="Arrow1Lend"
+       style="overflow:visible">
+      <path
+         id="path3346"
+         d="M 0,0 L 5,-5 L -12.5,0 L 5,5 L 0,0 z "
+         style="fill-rule:evenodd;stroke:#000000;stroke-width:1pt;marker-start:none"
+         transform="scale(-0.8,-0.8)" />
+    </marker>
+    <marker
+       inkscape:stockid="Arrow2Lstart"
+       orient="auto"
+       refY="0"
+       refX="0"
+       id="Arrow2Lstart"
+       style="overflow:visible">
+      <path
+         id="path3331"
+         style="font-size:12px;fill-rule:evenodd;stroke-width:0.625;stroke-linejoin:round"
+         d="M 8.7185878,4.0337352 L -2.2072895,0.016013256 L 8.7185884,-4.0017078 C 6.97309,-1.6296469 6.9831476,1.6157441 8.7185878,4.0337352 z "
+         transform="matrix(1.1,0,0,1.1,-5.5,0)" />
+    </marker>
+    <marker
+       inkscape:stockid="Arrow2Lend"
+       orient="auto"
+       refY="0"
+       refX="0"
+       id="Arrow2Lend"
+       style="overflow:visible">
+      <path
+         id="path3328"
+         style="font-size:12px;fill-rule:evenodd;stroke-width:0.625;stroke-linejoin:round"
+         d="M 8.7185878,4.0337352 L -2.2072895,0.016013256 L 8.7185884,-4.0017078 C 6.97309,-1.6296469 6.9831476,1.6157441 8.7185878,4.0337352 z "
+         transform="matrix(-1.1,0,0,-1.1,5.5,0)" />
+    </marker>
+  </defs>
+  <sodipodi:namedview
+     id="base"
+     pagecolor="#ffffff"
+     bordercolor="#666666"
+     borderopacity="1.0"
+     inkscape:pageopacity="0.0"
+     inkscape:pageshadow="2"
+     inkscape:zoom="2"
+     inkscape:cx="608.69002"
+     inkscape:cy="490.05621"
+     inkscape:document-units="in"
+     inkscape:current-layer="layer1"
+     showguides="true"
+     inkscape:guide-bbox="true"
+     inkscape:window-width="1278"
+     inkscape:window-height="973"
+     inkscape:window-x="0"
+     inkscape:window-y="0"
+     gridtolerance="0.125in"
+     guidetolerance="0.125in">
+    <sodipodi:guide
+       orientation="horizontal"
+       position="629"
+       id="guide1307" />
+    <sodipodi:guide
+       orientation="horizontal"
+       position="449"
+       id="guide1309" />
+    <sodipodi:guide
+       orientation="horizontal"
+       position="269"
+       id="guide1311" />
+    <sodipodi:guide
+       orientation="vertical"
+       position="496"
+       id="guide1313" />
+    <sodipodi:guide
+       orientation="vertical"
+       position="383"
+       id="guide1315" />
+    <sodipodi:guide
+       orientation="vertical"
+       position="241"
+       id="guide1317" />
+    <sodipodi:guide
+       orientation="vertical"
+       position="680"
+       id="guide1319" />
+    <sodipodi:guide
+       orientation="vertical"
+       position="749"
+       id="guide1321" />
+    <sodipodi:guide
+       orientation="vertical"
+       position="124"
+       id="guide1345" />
+    <sodipodi:guide
+       orientation="vertical"
+       position="901"
+       id="guide1347" />
+    <sodipodi:guide
+       orientation="horizontal"
+       position="539"
+       id="guide3390" />
+    <sodipodi:guide
+       orientation="horizontal"
+       position="359"
+       id="guide3392" />
+    <sodipodi:guide
+       orientation="vertical"
+       position="280.5"
+       id="guide3324" />
+    <sodipodi:guide
+       orientation="vertical"
+       position="195"
+       id="guide3326" />
+    <sodipodi:guide
+       orientation="vertical"
+       position="427"
+       id="guide3328" />
+    <sodipodi:guide
+       orientation="vertical"
+       position="795"
+       id="guide3340" />
+    <sodipodi:guide
+       orientation="horizontal"
+       position="179"
+       id="guide1395" />
+  </sodipodi:namedview>
+  <metadata
+     id="metadata7">
+    <rdf:RDF>
+      <cc:Work
+         rdf:about="">
+        <dc:format>image/svg+xml</dc:format>
+        <dc:type
+           rdf:resource="http://purl.org/dc/dcmitype/StillImage" />
+        <dc:creator>
+          <cc:Agent>
+            <dc:title>Benjamin Kosnik</dc:title>
+          </cc:Agent>
+        </dc:creator>
+      </cc:Work>
+    </rdf:RDF>
+  </metadata>
+  <g
+     inkscape:label="Layer 1"
+     inkscape:groupmode="layer"
+     id="layer1">
+    <rect
+       y="382.17499"
+       x="241.73018"
+       height="23.200001"
+       width="141.64481"
+       id="rect3420"
+       style="fill:#ffffff;fill-opacity:1;stroke:#000000;stroke-width:1.25;stroke-miterlimit:4;stroke-dasharray:none;stroke-opacity:1" />
+    <rect
+       style="fill:#ffffff;fill-opacity:1;stroke:#000000;stroke-width:1.25;stroke-miterlimit:4;stroke-dasharray:none;stroke-opacity:1"
+       id="rect3418"
+       width="141.64481"
+       height="23.200001"
+       x="52.730194"
+       y="382.17499" />
+    <text
+       xml:space="preserve"
+       style="font-size:9.60000038;font-style:normal;font-variant:normal;font-weight:normal;font-stretch:normal;text-align:center;line-height:100%;writing-mode:lr;text-anchor:middle;fill:#000000;fill-opacity:1;stroke:none;stroke-width:1px;stroke-linecap:butt;stroke-linejoin:miter;stroke-opacity:1;font-family:Bitstream Vera Sans"
+       x="122.35258"
+       y="395.91092"
+       id="text3394"
+       sodipodi:linespacing="100%"><tspan
+         sodipodi:role="line"
+         id="tspan1383"
+         x="122.35258"
+         y="395.91092">pairing_heap_tag</tspan></text>
+    <text
+       sodipodi:linespacing="100%"
+       id="text3400"
+       y="395.91092"
+       x="310.55255"
+       style="font-size:9.60000038;font-style:normal;font-variant:normal;font-weight:normal;font-stretch:normal;text-align:center;line-height:100%;writing-mode:lr;text-anchor:middle;fill:#000000;fill-opacity:1;stroke:none;stroke-width:1px;stroke-linecap:butt;stroke-linejoin:miter;stroke-opacity:1;font-family:Bitstream Vera Sans"
+       xml:space="preserve"><tspan
+         sodipodi:role="line"
+         id="tspan1381"
+         x="310.55255"
+         y="395.91092">bionomial_heap_tag</tspan></text>
+    <rect
+       style="fill:#ffffff;fill-opacity:1;stroke:#000000;stroke-width:1.25;stroke-miterlimit:4;stroke-dasharray:none;stroke-opacity:1"
+       id="rect3380"
+       width="141.64481"
+       height="23.200001"
+       x="425.57764"
+       y="292.56177" />
+    <text
+       xml:space="preserve"
+       style="font-size:9.60000038;font-style:normal;font-variant:normal;font-weight:normal;font-stretch:normal;text-align:center;line-height:100%;writing-mode:lr;text-anchor:middle;fill:#000000;fill-opacity:1;stroke:none;stroke-width:1.5625;stroke-linecap:butt;stroke-linejoin:miter;stroke-miterlimit:4;stroke-dasharray:none;stroke-opacity:1;font-family:Bitstream Vera Sans"
+       x="495.20001"
+       y="307.09772"
+       id="text1323"
+       sodipodi:linespacing="100%"><tspan
+         sodipodi:role="line"
+         id="tspan1363"
+         x="495.20001"
+         y="307.09772">priority_queue_tag</tspan></text>
+    <path
+       style="fill:none;fill-opacity:0.75;fill-rule:evenodd;stroke:#000000;stroke-width:1.16226137;stroke-linecap:butt;stroke-linejoin:miter;stroke-miterlimit:4;stroke-dasharray:none;stroke-opacity:1"
+       d="M 124.54034,382.1132 L 124.54034,360.6132 L 311.75594,359.6132 L 311.75594,382.1132"
+       id="path2244" />
+    <rect
+       style="fill:#ffffff;fill-opacity:1;stroke:#000000;stroke-width:1.25;stroke-miterlimit:4;stroke-dasharray:none;stroke-opacity:1"
+       id="rect3422"
+       width="141.64481"
+       height="23.200001"
+       x="425.73022"
+       y="382.17499" />
+    <text
+       sodipodi:linespacing="100%"
+       id="text3406"
+       y="395.91092"
+       x="495.3526"
+       style="font-size:9.60000038;font-style:normal;font-variant:normal;font-weight:normal;font-stretch:normal;text-align:center;line-height:100%;writing-mode:lr;text-anchor:middle;fill:#000000;fill-opacity:1;stroke:none;stroke-width:1.25;stroke-linecap:butt;stroke-linejoin:miter;stroke-miterlimit:4;stroke-dasharray:none;stroke-opacity:1;font-family:Bitstream Vera Sans"
+       xml:space="preserve"><tspan
+         sodipodi:role="line"
+         id="tspan1377"
+         x="495.3526"
+         y="395.91092">rc_binomial_heap_tag</tspan></text>
+    <rect
+       y="382.17499"
+       x="607.93024"
+       height="23.200001"
+       width="141.64481"
+       id="rect3424"
+       style="fill:#ffffff;fill-opacity:1;stroke:#000000;stroke-width:1.25;stroke-miterlimit:4;stroke-dasharray:none;stroke-opacity:1" />
+    <text
+       xml:space="preserve"
+       style="font-size:9.60000038;font-style:normal;font-variant:normal;font-weight:normal;font-stretch:normal;text-align:center;line-height:100%;writing-mode:lr;text-anchor:middle;fill:#000000;fill-opacity:1;stroke:none;stroke-width:1.25;stroke-linecap:butt;stroke-linejoin:miter;stroke-miterlimit:4;stroke-dasharray:none;stroke-opacity:1;font-family:Bitstream Vera Sans"
+       x="679.15259"
+       y="395.91092"
+       id="text3412"
+       sodipodi:linespacing="100%"><tspan
+         sodipodi:role="line"
+         id="tspan1379"
+         x="679.15259"
+         y="395.91092">binary_heap_tag</tspan></text>
+    <path
+       id="path3347"
+       d="M 495.79886,382.13056 L 495.79886,321.40547"
+       style="fill:none;fill-opacity:0.75;fill-rule:evenodd;stroke:#000000;stroke-width:1.25;stroke-linecap:butt;stroke-linejoin:miter;marker-end:url(#Arrow2Mend);stroke-miterlimit:4;stroke-dasharray:none;stroke-opacity:1" />
+    <rect
+       style="fill:#ffffff;fill-opacity:1;stroke:#000000;stroke-width:1.25;stroke-miterlimit:4;stroke-dasharray:none;stroke-opacity:1"
+       id="rect2281"
+       width="141.64481"
+       height="23.200001"
+       x="795.625"
+       y="382.17499" />
+    <text
+       sodipodi:linespacing="100%"
+       id="text2283"
+       y="395.91092"
+       x="866.84735"
+       style="font-size:9.60000038;font-style:normal;font-variant:normal;font-weight:normal;font-stretch:normal;text-align:center;line-height:100%;writing-mode:lr;text-anchor:middle;fill:#000000;fill-opacity:1;stroke:none;stroke-width:1.25;stroke-linecap:butt;stroke-linejoin:miter;stroke-miterlimit:4;stroke-dasharray:none;stroke-opacity:1;font-family:Bitstream Vera Sans"
+       xml:space="preserve"><tspan
+         sodipodi:role="line"
+         id="tspan1359"
+         x="866.84735"
+         y="395.91092">thin_heap_tag</tspan></text>
+    <path
+       style="fill:none;fill-opacity:0.75;fill-rule:evenodd;stroke:#000000;stroke-width:1.25;stroke-linecap:butt;stroke-linejoin:miter;stroke-miterlimit:4;stroke-dasharray:none;stroke-opacity:1"
+       d="M 311.5,360 L 680,360"
+       id="path2309" />
+    <use
+       x="0"
+       y="0"
+       xlink:href="#path2244"
+       id="use2311"
+       transform="matrix(-1,0,0,1,992.3371,0)"
+       width="990"
+       height="765" />
+  </g>
+</svg>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_text_join_timing_test.html b/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_text_join_timing_test.html
new file mode 100644
index 00000000000..4710ea96bcf
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_text_join_timing_test.html
@@ -0,0 +1,141 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+<meta name="generator" content="HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+<title>Priority Queue Text Join Timing Test</title>
+<meta http-equiv="Content-Type" content="text/html; charset=us-ascii" />
+</head>
+<body>
+<div id="page">
+<h1>Priority Queue Text <tt>join</tt> Timing Test</h1>
+<h2><a name="description" id="description">Description</a></h2>
+<p>This test inserts a number of values with keys from an
+    arbitrary text ([ <a href="references.html#wickland96thirty">wickland96thirty</a> ]) into
+    two containers, then merges the containers. It uses
+    <tt>join</tt> for <tt>pb_ds</tt>'s priority queues; for the
+    STL's priority queues, it successively pops values from one
+    container and pushes them into the other. The test measures the
+    average time as a function of the number of values.</p>
+<p>(The test was executed with <a href="../../../../testsuite/performance/ext/pb_ds/priority_queue_text_join_timing.cc"><tt>priority_queue_text_join_timing_test</tt></a>
+    thirty_years_among_the_dead_preproc.txt 200 200 2100)</p>
+<h2><a name="purpose" id="purpose">Purpose</a></h2>
+<p>The test checks the effect of different underlying
+    data structures (see <a href="pq_design.html#pq_imp">Design::Priority
+    Queues::Implementations</a>).</p>
+<h2><a name="results" id="results">Results</a></h2>
+<p>Figures <a href="#NPG">NPG</a>, <a href="#NPM">NPM</a>, and
+    <a href="#NPL">NPL</a> show the results for the native priority
+    queues and <tt>pb_ds</tt> 's priority queues in <a href="pq_performance_tests.html#gcc"><u>g++</u></a>, <a href="pq_performance_tests.html#msvc"><u>msvc</u></a>, and <a href="pq_performance_tests.html#local"><u>local</u></a>,
+    respectively.</p>
+<div id="NPG_res_div">
+<div id="NPG_gcc">
+<div id="NPG_priority_queue_text_join_timing_test">
+<div id="NPG_pq">
+<div id="NPG_Native_tree_and__tt_pb_ds_455tt__priority_queue__tt_push_455tt__timing_test"><div style="border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NPG" id="NPG"><img src="priority_queue_text_join_timing_test_gcc.png" alt="no image" /></a></h6>NPG: Native tree and <tt>pb ds</tt> priority queue <tt>push</tt> timing test - <a href="pq_performance_tests.html#gcc">g++</a><p>In the above figure, the names in the legends have the following meaning:</p>
+<ol>
+<li>
+n_pq_deque-
+<tt>std::priority_queue</tt> adapting <tt>std::deque</tt></li>
+<li>
+n_pq_vector-
+<tt>std::priority_queue</tt> adapting <tt>std::vector</tt></li>
+<li>
+binary_heap-
+<a href="priority_queue.html"><tt>priority_queue</tt></a>
+ with <tt>Tag</tt> = <a href="binary_heap_tag.html"><tt>binary_heap_tag</tt></a>
+</li>
+<li>
+thin_heap-
+<a href="priority_queue.html"><tt>priority_queue</tt></a>
+ with <tt>Tag</tt> = <a href="thin_heap_tag.html"><tt>thin_heap_tag</tt></a>
+</li>
+<li>
+rc_binomial_heap-
+<a href="priority_queue.html"><tt>priority_queue</tt></a>
+ with <tt>Tag</tt> = <a href="rc_binomial_heap_tag.html"><tt>rc_binomial_heap_tag</tt></a>
+</li>
+<li>
+pairing_heap-
+<a href="priority_queue.html"><tt>priority_queue</tt></a>
+ with <tt>Tag</tt> = <a href="pairing_heap_tag.html"><tt>pairing_heap_tag</tt></a>
+</li>
+<li>
+binomial_heap-
+<a href="priority_queue.html"><tt>priority_queue</tt></a>
+ with <tt>Tag</tt> = <a href="binomial_heap_tag.html"><tt>binomial_heap_tag</tt></a>
+</li>
+</ol>
+</div><div style="width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<div id="NPM_res_div">
+<div id="NPM_msvc">
+<div id="NPM_priority_queue_text_join_timing_test">
+<div id="NPM_pq">
+<div id="NPM_Native_tree_and__tt_pb_ds_455tt__priority_queue__tt_push_455tt__timing_test"><div style="border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NPM" id="NPM"><img src="priority_queue_text_join_timing_test_msvc.png" alt="no image" /></a></h6>NPM: Native tree and <tt>pb ds</tt> priority queue <tt>push</tt> timing test - <a href="pq_performance_tests.html#msvc">msvc++</a><p>In the above figure, the names in the legends have the following meaning:</p>
+<ol>
+<li>
+n_pq_deque-
+<tt>std::priority_queue</tt> adapting <tt>std::deque</tt></li>
+<li>
+n_pq_vector-
+<tt>std::priority_queue</tt> adapting <tt>std::vector</tt></li>
+<li>
+binary_heap-
+<a href="priority_queue.html"><tt>priority_queue</tt></a>
+ with <tt>Tag</tt> = <a href="binary_heap_tag.html"><tt>binary_heap_tag</tt></a>
+</li>
+<li>
+thin_heap-
+<a href="priority_queue.html"><tt>priority_queue</tt></a>
+ with <tt>Tag</tt> = <a href="thin_heap_tag.html"><tt>thin_heap_tag</tt></a>
+</li>
+<li>
+rc_binomial_heap-
+<a href="priority_queue.html"><tt>priority_queue</tt></a>
+ with <tt>Tag</tt> = <a href="rc_binomial_heap_tag.html"><tt>rc_binomial_heap_tag</tt></a>
+</li>
+<li>
+pairing_heap-
+<a href="priority_queue.html"><tt>priority_queue</tt></a>
+ with <tt>Tag</tt> = <a href="pairing_heap_tag.html"><tt>pairing_heap_tag</tt></a>
+</li>
+<li>
+binomial_heap-
+<a href="priority_queue.html"><tt>priority_queue</tt></a>
+ with <tt>Tag</tt> = <a href="binomial_heap_tag.html"><tt>binomial_heap_tag</tt></a>
+</li>
+</ol>
+</div><div style="width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<div id="NPL_res_div">
+<div id="NPL_local">
+<div id="NPL_priority_queue_text_join_timing_test">
+<div id="NPL_pq">
+<div id="NPL_Native_tree_and__tt_pb_ds_455tt__priority_queue__tt_push_455tt__timing_test"><div style = "border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NPL" id= "NPL"><img src="priority_queue_text_join_timing_test_local.png" alt="no image" /></a></h6>NPL: Native tree and <tt>pb ds</tt> priority queue <tt>push</tt> timing test - <a href = "pq_performance_tests.html#local">local</a></div><div style = "width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<h2><a name="observations" id="observations">Observations</a></h2>
+<p>In this test the node-based heaps perform <tt>join</tt> in
+    either logarithmic or constant time. The binary heap requires
+    linear time, since the well-known heapify algorithm [<a href="references.html#clrs2001">clrs2001</a>] is linear.</p>
+<p>It would be possible to apply the heapify algorithm to the
+    STL containers, if they would support iteration (which they
+    don't). Barring iterators, it is still somehow possible to
+    perform linear-time merge on a <tt>std::vector</tt>-based STL
+    priority queue, using <tt>top()</tt> and <tt>size()</tt> (since
+    they are enough to expose the underlying array), but this is
+    impossible for a <tt>std::deque</tt>-based STL priority queue.
+    Without heapify, the cost is super-linear.</p>
+</div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_text_join_timing_test_gcc.png b/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_text_join_timing_test_gcc.png
new file mode 100644
index 00000000000..a48bb358605
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_text_join_timing_test_gcc.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_text_join_timing_test_local.png b/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_text_join_timing_test_local.png
new file mode 100644
index 00000000000..1701b4d8a61
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_text_join_timing_test_local.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_text_join_timing_test_msvc.png b/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_text_join_timing_test_msvc.png
new file mode 100644
index 00000000000..0575b99c0c3
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_text_join_timing_test_msvc.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_text_modify_down_timing_test.html b/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_text_modify_down_timing_test.html
new file mode 100644
index 00000000000..6935957207c
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_text_modify_down_timing_test.html
@@ -0,0 +1,204 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+<meta name="generator" content="HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+<title>Priority Queue Text Modify (Down) Timing Test</title>
+<meta http-equiv="Content-Type" content="text/html; charset=us-ascii" />
+</head>
+<body>
+<div id="page">
+<h1>Priority Queue Text <tt>modify</tt> Timing Test - II</h1>
+<h2><a name="description" id="description">Description</a></h2>
+<p>This test inserts a number of values with keys from an
+    arbitrary text ([ <a href="references.html#wickland96thirty">wickland96thirty</a> ]) into
+    into a container then modifies each one "down" (<i>i.e.,</i> it
+    makes it smaller). It uses <tt>modify</tt> for <tt>pb_ds</tt>'s
+    priority queues; for the STL's priority queues, it pops values
+    from a container until it reaches the value that should be
+    modified, then pushes values back in. It measures the average
+    time for <tt>modify</tt> as a function of the number of
+    values.</p>
+<p>(The test was executed with <a href="../../../../testsuite/performance/ext/pb_ds/priority_queue_text_modify_timing.cc"><tt>priority_queue_text_modify_down_timing_test</tt></a>
+    thirty_years_among_the_dead_preproc.txt 200 200 2100 f)</p>
+<h2><a name="purpose" id="purpose">Purpose</a></h2>
+<p>The main purpose of this test is to contrast <a href="priority_queue_text_modify_up_timing_test.html">Priority Queue
+    Text <tt>modify</tt> Timing Test - I</a>.</p>
+<h2><a name="results" id="results">Results</a></h2>
+<p>Figures <a href="#NPG">NPG</a>, <a href="#NPM">NPM</a>, and
+    <a href="#NPL">NPL</a> show the results for the native priority
+    queues and <tt>pb_ds</tt> 's priority queues in <a href="pq_performance_tests.html#gcc"><u>g++</u></a>, <a href="pq_performance_tests.html#msvc"><u>msvc++</u></a>, and
+    <a href="pq_performance_tests.html#local"><u>local</u></a>,
+    respectively; Figures <a href="#NRTG">NRTG</a>, <a href="#NRTM">NRTM</a>, and <a href="#NRTL">NRTL</a> show the results
+    for the pairing heap and thin heaps in <a href="pq_performance_tests.html#gcc"><u>g++</u></a>, <a href="pq_performance_tests.html#msvc"><u>msvc++</u></a>, and
+    <a href="pq_performance_tests.html#local"><u>local</u></a>,
+    respectively,</p>
+<div id="NPG_res_div">
+<div id="NPG_gcc">
+<div id="NPG_priority_queue_text_modify_down_timing_test">
+<div id="NPG_pq">
+<div id="NPG_Native_and__tt_pb_ds_455tt__priority_queue__tt_modify_455tt__timing_test"><div style="border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NPG" id="NPG"><img src="priority_queue_text_modify_down_timing_test_gcc.png" alt="no image" /></a></h6>NPG: Native and <tt>pb ds</tt> priority queue <tt>modify</tt> timing test - <a href="pq_performance_tests.html#gcc">g++</a><p>In the above figure, the names in the legends have the following meaning:</p>
+<ol>
+<li>
+n_pq_deque-
+<tt>std::priority_queue</tt> adapting <tt>std::deque</tt></li>
+<li>
+n_pq_vector-
+<tt>std::priority_queue</tt> adapting <tt>std::vector</tt></li>
+<li>
+binary_heap-
+<a href="priority_queue.html"><tt>priority_queue</tt></a>
+ with <tt>Tag</tt> = <a href="binary_heap_tag.html"><tt>binary_heap_tag</tt></a>
+</li>
+<li>
+thin_heap-
+<a href="priority_queue.html"><tt>priority_queue</tt></a>
+ with <tt>Tag</tt> = <a href="thin_heap_tag.html"><tt>thin_heap_tag</tt></a>
+</li>
+<li>
+rc_binomial_heap-
+<a href="priority_queue.html"><tt>priority_queue</tt></a>
+ with <tt>Tag</tt> = <a href="rc_binomial_heap_tag.html"><tt>rc_binomial_heap_tag</tt></a>
+</li>
+<li>
+binomial_heap-
+<a href="priority_queue.html"><tt>priority_queue</tt></a>
+ with <tt>Tag</tt> = <a href="binomial_heap_tag.html"><tt>binomial_heap_tag</tt></a>
+</li>
+<li>
+pairing_heap-
+<a href="priority_queue.html"><tt>priority_queue</tt></a>
+ with <tt>Tag</tt> = <a href="pairing_heap_tag.html"><tt>pairing_heap_tag</tt></a>
+</li>
+</ol>
+</div><div style="width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<div id="NPM_res_div">
+<div id="NPM_msvc">
+<div id="NPM_priority_queue_text_modify_down_timing_test">
+<div id="NPM_pq">
+<div id="NPM_Native_and__tt_pb_ds_455tt__priority_queue__tt_modify_455tt__timing_test"><div style="border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NPM" id="NPM"><img src="priority_queue_text_modify_down_timing_test_msvc.png" alt="no image" /></a></h6>NPM: Native and <tt>pb ds</tt> priority queue <tt>modify</tt> timing test - <a href="pq_performance_tests.html#msvc">msvc++</a><p>In the above figure, the names in the legends have the following meaning:</p>
+<ol>
+<li>
+n_pq_deque-
+<tt>std::priority_queue</tt> adapting <tt>std::deque</tt></li>
+<li>
+n_pq_vector-
+<tt>std::priority_queue</tt> adapting <tt>std::vector</tt></li>
+<li>
+binary_heap-
+<a href="priority_queue.html"><tt>priority_queue</tt></a>
+ with <tt>Tag</tt> = <a href="binary_heap_tag.html"><tt>binary_heap_tag</tt></a>
+</li>
+<li>
+thin_heap-
+<a href="priority_queue.html"><tt>priority_queue</tt></a>
+ with <tt>Tag</tt> = <a href="thin_heap_tag.html"><tt>thin_heap_tag</tt></a>
+</li>
+<li>
+rc_binomial_heap-
+<a href="priority_queue.html"><tt>priority_queue</tt></a>
+ with <tt>Tag</tt> = <a href="rc_binomial_heap_tag.html"><tt>rc_binomial_heap_tag</tt></a>
+</li>
+<li>
+binomial_heap-
+<a href="priority_queue.html"><tt>priority_queue</tt></a>
+ with <tt>Tag</tt> = <a href="binomial_heap_tag.html"><tt>binomial_heap_tag</tt></a>
+</li>
+<li>
+pairing_heap-
+<a href="priority_queue.html"><tt>priority_queue</tt></a>
+ with <tt>Tag</tt> = <a href="pairing_heap_tag.html"><tt>pairing_heap_tag</tt></a>
+</li>
+</ol>
+</div><div style="width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<div id="NPL_res_div">
+<div id="NPL_local">
+<div id="NPL_priority_queue_text_modify_down_timing_test">
+<div id="NPL_pq">
+<div id="NPL_Native_and__tt_pb_ds_455tt__priority_queue__tt_modify_455tt__timing_test"><div style = "border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NPL" id= "NPL"><img src="priority_queue_text_modify_down_timing_test_local.png" alt="no image" /></a></h6>NPL: Native and <tt>pb ds</tt> priority queue <tt>modify</tt> timing test - <a href = "pq_performance_tests.html#local">local</a></div><div style = "width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<div id="NRTG_res_div">
+<div id="NRTG_gcc">
+<div id="NRTG_priority_queue_text_modify_down_timing_test_pairing_thin">
+<div id="NRTG_pq">
+<div id="NRTG_Pairing_and_thin__priority_queue__tt_modify_455tt__timing_test"><div style="border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NRTG" id="NRTG"><img src="priority_queue_text_modify_down_timing_test_pairing_thin_gcc.png" alt="no image" /></a></h6>NRTG: Pairing and thin  priority queue <tt>modify</tt> timing test - <a href="pq_performance_tests.html#gcc">g++</a><p>In the above figure, the names in the legends have the following meaning:</p>
+<ol>
+<li>
+thin_heap-
+<a href="priority_queue.html"><tt>priority_queue</tt></a>
+ with <tt>Tag</tt> = <a href="thin_heap_tag.html"><tt>thin_heap_tag</tt></a>
+</li>
+<li>
+pairing_heap-
+<a href="priority_queue.html"><tt>priority_queue</tt></a>
+ with <tt>Tag</tt> = <a href="pairing_heap_tag.html"><tt>pairing_heap_tag</tt></a>
+</li>
+</ol>
+</div><div style="width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<div id="NRTM_res_div">
+<div id="NRTM_msvc">
+<div id="NRTM_priority_queue_text_modify_down_timing_test_pairing_thin">
+<div id="NRTM_pq">
+<div id="NRTM_Pairing_and_thin__priority_queue__tt_modify_455tt__timing_test"><div style="border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NRTM" id="NRTM"><img src="priority_queue_text_modify_down_timing_test_pairing_thin_msvc.png" alt="no image" /></a></h6>NRTM: Pairing and thin  priority queue <tt>modify</tt> timing test - <a href="pq_performance_tests.html#msvc">msvc++</a><p>In the above figure, the names in the legends have the following meaning:</p>
+<ol>
+<li>
+thin_heap-
+<a href="priority_queue.html"><tt>priority_queue</tt></a>
+ with <tt>Tag</tt> = <a href="thin_heap_tag.html"><tt>thin_heap_tag</tt></a>
+</li>
+<li>
+pairing_heap-
+<a href="priority_queue.html"><tt>priority_queue</tt></a>
+ with <tt>Tag</tt> = <a href="pairing_heap_tag.html"><tt>pairing_heap_tag</tt></a>
+</li>
+</ol>
+</div><div style="width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<div id="NRTL_res_div">
+<div id="NRTL_local">
+<div id="NRTL_priority_queue_text_modify_down_timing_test_pairing_thin">
+<div id="NRTL_pq">
+<div id="NRTL_Pairing_and_thin__priority_queue__tt_modify_455tt__timing_test"><div style = "border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NRTL" id= "NRTL"><img src="priority_queue_text_modify_down_timing_test_pairing_thin_local.png" alt="no image" /></a></h6>NRTL: Pairing and thin  priority queue <tt>modify</tt> timing test - <a href = "pq_performance_tests.html#local">local</a></div><div style = "width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<h2><a name="observations" id="observations">Observations</a></h2>
+<p>Most points in these results are similar to <a href="priority_queue_text_modify_up_timing_test.html">Priority Queue
+    Text <tt>modify</tt> Timing Test - I</a>.</p>
+<p>It is interesting to note, however, that as opposed to that
+    test, a thin heap (<a href="priority_queue.html"><tt>priority_queue</tt></a> with
+    <tt>Tag</tt> = <a href="thin_heap_tag.html"><tt>thin_heap_tag</tt></a>) is
+    outperformed by a pairing heap (<a href="priority_queue.html"><tt>priority_queue</tt></a> with
+    <tt>Tag</tt> = <a href="pairing_heap_tag.html"><tt>pairing_heap_tag</tt></a>).
+    In this case, both heaps essentially perform an <tt>erase</tt>
+    operation followed by a <tt>push</tt> operation. As the other
+    tests show, a pairing heap is usually far more efficient than a
+    thin heap, so this is not surprising.</p>
+<p>Most algorithms that involve priority queues increase values
+    (in the sense of the priority queue's comparison functor), and
+    so <a href="priority_queue_text_modify_up_timing_test.html">Priority Queue
+    Text <tt>modify</tt> Timing Test - I</a> is more interesting
+    than this test.</p>
+</div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_text_modify_down_timing_test_gcc.png b/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_text_modify_down_timing_test_gcc.png
new file mode 100644
index 00000000000..74cbc652369
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_text_modify_down_timing_test_gcc.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_text_modify_down_timing_test_local.png b/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_text_modify_down_timing_test_local.png
new file mode 100644
index 00000000000..2fa9c798804
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_text_modify_down_timing_test_local.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_text_modify_down_timing_test_msvc.png b/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_text_modify_down_timing_test_msvc.png
new file mode 100644
index 00000000000..20b66373667
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_text_modify_down_timing_test_msvc.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_text_modify_down_timing_test_pairing_thin_gcc.png b/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_text_modify_down_timing_test_pairing_thin_gcc.png
new file mode 100644
index 00000000000..ca901831eff
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_text_modify_down_timing_test_pairing_thin_gcc.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_text_modify_down_timing_test_pairing_thin_local.png b/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_text_modify_down_timing_test_pairing_thin_local.png
new file mode 100644
index 00000000000..977d167186c
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_text_modify_down_timing_test_pairing_thin_local.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_text_modify_down_timing_test_pairing_thin_msvc.png b/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_text_modify_down_timing_test_pairing_thin_msvc.png
new file mode 100644
index 00000000000..bf68bf99292
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_text_modify_down_timing_test_pairing_thin_msvc.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_text_modify_up_timing_test.html b/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_text_modify_up_timing_test.html
new file mode 100644
index 00000000000..3db4639baa6
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_text_modify_up_timing_test.html
@@ -0,0 +1,222 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+<meta name="generator" content="HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+<title>Priority Queue Text Modify (Up) Timing Test</title>
+<meta http-equiv="Content-Type" content="text/html; charset=us-ascii" />
+</head>
+<body>
+<div id="page">
+<h1>Priority Queue Text <tt>modify</tt> Timing Test - I</h1>
+<h2><a name="description" id="description">Description</a></h2>
+<p>This test inserts a number of values with keys from an
+    arbitrary text ([ <a href="references.html#wickland96thirty">wickland96thirty</a> ]) into
+    into a container then modifies each one "up" (<i>i.e.,</i> it
+    makes it larger). It uses <tt>modify</tt> for <tt>pb_ds</tt>'s
+    priority queues; for the STL's priority queues, it pops values
+    from a container until it reaches the value that should be
+    modified, then pushes values back in. It measures the average
+    time for <tt>modify</tt> as a function of the number of
+    values.</p>
+<p>(The test was executed with <a href="../../../../testsuite/performance/ext/pb_ds/priority_queue_text_modify_timing.cc"><tt>priority_queue_text_modify_up_timing_test</tt></a>
+    thirty_years_among_the_dead_preproc.txt 200 200 2100 t)</p>
+<h2><a name="purpose" id="purpose">Purpose</a></h2>
+<p>The test checks the effect of different underlying
+    data structures (see <a href="pq_design.html#pq_imp">Design::Priority
+    Queues::Implementations</a>) for graph algorithms settings.
+    Note that making an arbitrary value larger (in the sense of the
+    priority queue's comparison functor) corresponds to
+    decrease-key in standard graph algorithms [<a href="references.html#clrs2001">clrs2001</a>].</p>
+<h2><a name="results" id="results">Results</a></h2>
+<p>Figures <a href="#NPG">NPG</a>, <a href="#NPM">NPM</a>, and
+    <a href="#NPL">NPL</a> show the results for the native priority
+    queues and <tt>pb_ds</tt> 's priority queues in <a href="pq_performance_tests.html#gcc"><u>g++</u></a>, <a href="pq_performance_tests.html#msvc"><u>msvc++</u></a>, and
+    <a href="pq_performance_tests.html#local"><u>local</u></a>,
+    respectively; Figures <a href="#NRTG">NRTG</a>, <a href="#NRTM">NRTM</a>, and <a href="#NRTL">NRTL</a> show the results
+    for the pairing heap and thin heaps in <a href="pq_performance_tests.html#gcc"><u>g++</u></a>, <a href="pq_performance_tests.html#msvc"><u>msvc++</u></a>, and
+    <a href="pq_performance_tests.html#local"><u>local</u></a>,
+    respectively,</p>
+<div id="NPG_res_div">
+<div id="NPG_gcc">
+<div id="NPG_priority_queue_text_modify_up_timing_test">
+<div id="NPG_pq">
+<div id="NPG_Native_and__tt_pb_ds_455tt__priority_queue__tt_modify_455tt__timing_test"><div style="border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NPG" id="NPG"><img src="priority_queue_text_modify_up_timing_test_gcc.png" alt="no image" /></a></h6>NPG: Native and <tt>pb ds</tt> priority queue <tt>modify</tt> timing test - <a href="pq_performance_tests.html#gcc">g++</a><p>In the above figure, the names in the legends have the following meaning:</p>
+<ol>
+<li>
+n_pq_deque-
+<tt>std::priority_queue</tt> adapting <tt>std::deque</tt></li>
+<li>
+n_pq_vector-
+<tt>std::priority_queue</tt> adapting <tt>std::vector</tt></li>
+<li>
+binary_heap-
+<a href="priority_queue.html"><tt>priority_queue</tt></a>
+ with <tt>Tag</tt> = <a href="binary_heap_tag.html"><tt>binary_heap_tag</tt></a>
+</li>
+<li>
+rc_binomial_heap-
+<a href="priority_queue.html"><tt>priority_queue</tt></a>
+ with <tt>Tag</tt> = <a href="rc_binomial_heap_tag.html"><tt>rc_binomial_heap_tag</tt></a>
+</li>
+<li>
+pairing_heap-
+<a href="priority_queue.html"><tt>priority_queue</tt></a>
+ with <tt>Tag</tt> = <a href="pairing_heap_tag.html"><tt>pairing_heap_tag</tt></a>
+</li>
+<li>
+binomial_heap-
+<a href="priority_queue.html"><tt>priority_queue</tt></a>
+ with <tt>Tag</tt> = <a href="binomial_heap_tag.html"><tt>binomial_heap_tag</tt></a>
+</li>
+<li>
+thin_heap-
+<a href="priority_queue.html"><tt>priority_queue</tt></a>
+ with <tt>Tag</tt> = <a href="thin_heap_tag.html"><tt>thin_heap_tag</tt></a>
+</li>
+</ol>
+</div><div style="width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<div id="NPM_res_div">
+<div id="NPM_msvc">
+<div id="NPM_priority_queue_text_modify_up_timing_test">
+<div id="NPM_pq">
+<div id="NPM_Native_and__tt_pb_ds_455tt__priority_queue__tt_modify_455tt__timing_test"><div style="border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NPM" id="NPM"><img src="priority_queue_text_modify_up_timing_test_msvc.png" alt="no image" /></a></h6>NPM: Native and <tt>pb ds</tt> priority queue <tt>modify</tt> timing test - <a href="pq_performance_tests.html#msvc">msvc++</a><p>In the above figure, the names in the legends have the following meaning:</p>
+<ol>
+<li>
+n_pq_deque-
+<tt>std::priority_queue</tt> adapting <tt>std::deque</tt></li>
+<li>
+n_pq_vector-
+<tt>std::priority_queue</tt> adapting <tt>std::vector</tt></li>
+<li>
+binary_heap-
+<a href="priority_queue.html"><tt>priority_queue</tt></a>
+ with <tt>Tag</tt> = <a href="binary_heap_tag.html"><tt>binary_heap_tag</tt></a>
+</li>
+<li>
+rc_binomial_heap-
+<a href="priority_queue.html"><tt>priority_queue</tt></a>
+ with <tt>Tag</tt> = <a href="rc_binomial_heap_tag.html"><tt>rc_binomial_heap_tag</tt></a>
+</li>
+<li>
+pairing_heap-
+<a href="priority_queue.html"><tt>priority_queue</tt></a>
+ with <tt>Tag</tt> = <a href="pairing_heap_tag.html"><tt>pairing_heap_tag</tt></a>
+</li>
+<li>
+binomial_heap-
+<a href="priority_queue.html"><tt>priority_queue</tt></a>
+ with <tt>Tag</tt> = <a href="binomial_heap_tag.html"><tt>binomial_heap_tag</tt></a>
+</li>
+<li>
+thin_heap-
+<a href="priority_queue.html"><tt>priority_queue</tt></a>
+ with <tt>Tag</tt> = <a href="thin_heap_tag.html"><tt>thin_heap_tag</tt></a>
+</li>
+</ol>
+</div><div style="width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<div id="NPL_res_div">
+<div id="NPL_local">
+<div id="NPL_priority_queue_text_modify_up_timing_test">
+<div id="NPL_pq">
+<div id="NPL_Native_and__tt_pb_ds_455tt__priority_queue__tt_modify_455tt__timing_test"><div style = "border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NPL" id= "NPL"><img src="priority_queue_text_modify_up_timing_test_local.png" alt="no image" /></a></h6>NPL: Native and <tt>pb ds</tt> priority queue <tt>modify</tt> timing test - <a href = "pq_performance_tests.html#local">local</a></div><div style = "width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<div id="NRTG_res_div">
+<div id="NRTG_gcc">
+<div id="NRTG_priority_queue_text_modify_up_timing_test_pairing_thin">
+<div id="NRTG_pq">
+<div id="NRTG_Pairing_and_thin__priority_queue__tt_modify_455tt__timing_test"><div style="border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NRTG" id="NRTG"><img src="priority_queue_text_modify_up_timing_test_pairing_thin_gcc.png" alt="no image" /></a></h6>NRTG: Pairing and thin  priority queue <tt>modify</tt> timing test - <a href="pq_performance_tests.html#gcc">g++</a><p>In the above figure, the names in the legends have the following meaning:</p>
+<ol>
+<li>
+pairing_heap-
+<a href="priority_queue.html"><tt>priority_queue</tt></a>
+ with <tt>Tag</tt> = <a href="pairing_heap_tag.html"><tt>pairing_heap_tag</tt></a>
+</li>
+<li>
+thin_heap-
+<a href="priority_queue.html"><tt>priority_queue</tt></a>
+ with <tt>Tag</tt> = <a href="thin_heap_tag.html"><tt>thin_heap_tag</tt></a>
+</li>
+</ol>
+</div><div style="width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<div id="NRTM_res_div">
+<div id="NRTM_msvc">
+<div id="NRTM_priority_queue_text_modify_up_timing_test_pairing_thin">
+<div id="NRTM_pq">
+<div id="NRTM_Pairing_and_thin__priority_queue__tt_modify_455tt__timing_test"><div style="border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NRTM" id="NRTM"><img src="priority_queue_text_modify_up_timing_test_pairing_thin_msvc.png" alt="no image" /></a></h6>NRTM: Pairing and thin  priority queue <tt>modify</tt> timing test - <a href="pq_performance_tests.html#msvc">msvc++</a><p>In the above figure, the names in the legends have the following meaning:</p>
+<ol>
+<li>
+pairing_heap-
+<a href="priority_queue.html"><tt>priority_queue</tt></a>
+ with <tt>Tag</tt> = <a href="pairing_heap_tag.html"><tt>pairing_heap_tag</tt></a>
+</li>
+<li>
+thin_heap-
+<a href="priority_queue.html"><tt>priority_queue</tt></a>
+ with <tt>Tag</tt> = <a href="thin_heap_tag.html"><tt>thin_heap_tag</tt></a>
+</li>
+</ol>
+</div><div style="width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<div id="NRTL_res_div">
+<div id="NRTL_local">
+<div id="NRTL_priority_queue_text_modify_up_timing_test_pairing_thin">
+<div id="NRTL_pq">
+<div id="NRTL_Pairing_and_thin__priority_queue__tt_modify_455tt__timing_test"><div style = "border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NRTL" id= "NRTL"><img src="priority_queue_text_modify_up_timing_test_pairing_thin_local.png" alt="no image" /></a></h6>NRTL: Pairing and thin  priority queue <tt>modify</tt> timing test - <a href = "pq_performance_tests.html#local">local</a></div><div style = "width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<h2><a name="observations" id="observations">Observations</a></h2>
+<p>As noted above, increasing an arbitrary value (in the sense
+    of the priority queue's comparison functor) is very common in
+    graph-related algorithms. In this case, a thin heap (<a href="priority_queue.html"><tt>priority_queue</tt></a> with
+    <tt>Tag</tt> = <a href="thin_heap_tag.html"><tt>thin_heap_tag</tt></a>)
+    outperforms a pairing heap (<a href="priority_queue.html"><tt>priority_queue</tt></a> with
+    <tt>Tag</tt> = <a href="pairing_heap_tag.html"><tt>pairing_heap_tag</tt></a>).
+    Conversely, <a href="priority_queue_text_push_timing_test.html">Priority Queue Text
+    <tt>push</tt> Timing Test</a>, <a href="priority_queue_text_push_pop_timing_test.html">Priority Queue
+    Text <tt>push</tt> and <tt>pop</tt> Timing Test</a>, <a href="priority_queue_random_int_push_timing_test.html">Priority
+    Queue Random Integer <tt>push</tt> Timing Test</a>, and
+    <a href="priority_queue_random_int_push_pop_timing_test.html">Priority
+    Queue Random Integer <tt>push</tt> and <tt>pop</tt> Timing
+    Test</a> show that the situation is reversed for other
+    operations. It is not clear when to prefer one of these two
+    different types.</p>
+<p>In this test <tt>pb_ds</tt>'s binary heaps effectively
+    perform modify in linear time. As explained in <a href="pq_design.html#pq_traits">Priority Queue Design::Traits</a>,
+    given a valid point-type iterator, a binary heap can perform
+    <tt>modify</tt> logarithmically. The problem is that binary
+    heaps invalidate their find iterators with each modifying
+    operation, and so the only way to obtain a valid point-type
+    iterator is to iterate using a range-type iterator until
+    finding the appropriate value, then use the range-type iterator
+    for the <tt>modify</tt> operation.</p>
+<p>The explanation for the STL's priority queues' performance
+    is similar to that in <a href="priority_queue_text_join_timing_test.html">Priority Queue Text
+    <tt>join</tt> Timing Test</a>.</p>
+<p><a href="pq_performance_tests.html#pq_observations">Priority-Queue
+    Performance Tests::Observations</a> discusses this further and
+    summarizes.</p>
+</div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_text_modify_up_timing_test_gcc.png b/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_text_modify_up_timing_test_gcc.png
new file mode 100644
index 00000000000..d9dedc20cf4
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_text_modify_up_timing_test_gcc.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_text_modify_up_timing_test_local.png b/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_text_modify_up_timing_test_local.png
new file mode 100644
index 00000000000..31575b452d3
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_text_modify_up_timing_test_local.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_text_modify_up_timing_test_msvc.png b/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_text_modify_up_timing_test_msvc.png
new file mode 100644
index 00000000000..4005547c812
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_text_modify_up_timing_test_msvc.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_text_modify_up_timing_test_pairing_thin_gcc.png b/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_text_modify_up_timing_test_pairing_thin_gcc.png
new file mode 100644
index 00000000000..1aa5aba94bf
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_text_modify_up_timing_test_pairing_thin_gcc.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_text_modify_up_timing_test_pairing_thin_local.png b/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_text_modify_up_timing_test_pairing_thin_local.png
new file mode 100644
index 00000000000..b878dde665c
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_text_modify_up_timing_test_pairing_thin_local.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_text_modify_up_timing_test_pairing_thin_msvc.png b/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_text_modify_up_timing_test_pairing_thin_msvc.png
new file mode 100644
index 00000000000..740594384cb
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_text_modify_up_timing_test_pairing_thin_msvc.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_text_pop_mem_usage_test.html b/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_text_pop_mem_usage_test.html
new file mode 100644
index 00000000000..8b5388e1770
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_text_pop_mem_usage_test.html
@@ -0,0 +1,143 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+<meta name="generator" content="HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+<title>Priority Queue Text Pop Memory Use Test</title>
+<meta http-equiv="Content-Type" content="text/html; charset=us-ascii" />
+</head>
+<body>
+<div id="page">
+<h1>Priority Queue Text <tt>pop</tt> Memory Use Test</h1>
+<h2><a name="description" id="description">Description</a></h2>
+<p>This test inserts a number of values with keys from an
+    arbitrary text ([ <a href="references.html#wickland96thirty">wickland96thirty</a> ]) into
+    a container, then pops them until only one is left in the
+    container. It measures the memory use as a function of the
+    number of values pushed to the container.</p>
+<p>(The test was executed with <a href="../../../../testsuite/performance/ext/pb_ds/priority_queue_text_pop_mem_usage.cc"><tt>priority_queue_text_pop_mem_usage_test</tt></a>
+    thirty_years_among_the_dead_preproc.txt 200 200 2100)</p>
+<h2><a name="purpose" id="purpose">Purpose</a></h2>
+<p>The test checks the effect of different underlying
+    data structures (see <a href="pq_design.html#pq_imp">Design::Priority
+    Queues::Implementations</a>).</p>
+<h2><a name="results" id="results">Results</a></h2>
+<p>Figures <a href="#NPG">NPG</a>, <a href="#NPM">NPM</a>, and
+    <a href="#NPL">NPL</a> show the results for the native priority
+    queues and <tt>pb_ds</tt> 's priority queues in <a href="pq_performance_tests.html#gcc"><u>g++</u></a>, <a href="pq_performance_tests.html#msvc"><u>msvc++</u></a>, and
+    <a href="pq_performance_tests.html#local"><u>local</u></a>,
+    respectively.</p>
+<div id="NPG_res_div">
+<div id="NPG_gcc">
+<div id="NPG_priority_queue_text_pop_mem_usage_test">
+<div id="NPG_pq">
+<div id="NPG_Native_and__tt_pb_ds_455tt__priority_queue__tt_pop_455tt__memory-use_test"><div style="border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NPG" id="NPG"><img src="priority_queue_text_pop_mem_usage_test_gcc.png" alt="no image" /></a></h6>NPG: Native and <tt>pb ds</tt> priority queue <tt>pop</tt> memory-use test - <a href="pq_performance_tests.html#gcc">g++</a><p>In the above figure, the names in the legends have the following meaning:</p>
+<ol>
+<li>
+n_pq_vector-
+<tt>std::priority_queue</tt> adapting <tt>std::vector</tt></li>
+<li>
+n_pq_deque-
+<tt>std::priority_queue</tt> adapting <tt>std::deque</tt></li>
+<li>
+binary_heap-
+<a href="priority_queue.html"><tt>priority_queue</tt></a>
+ with <tt>Tag</tt> = <a href="binary_heap_tag.html"><tt>binary_heap_tag</tt></a>
+</li>
+<li>
+thin_heap-
+<a href="priority_queue.html"><tt>priority_queue</tt></a>
+ with <tt>Tag</tt> = <a href="thin_heap_tag.html"><tt>thin_heap_tag</tt></a>
+</li>
+<li>
+binomial_heap-
+<a href="priority_queue.html"><tt>priority_queue</tt></a>
+ with <tt>Tag</tt> = <a href="binomial_heap_tag.html"><tt>binomial_heap_tag</tt></a>
+</li>
+<li>
+rc_binomial_heap-
+<a href="priority_queue.html"><tt>priority_queue</tt></a>
+ with <tt>Tag</tt> = <a href="rc_binomial_heap_tag.html"><tt>rc_binomial_heap_tag</tt></a>
+</li>
+<li>
+pairing_heap-
+<a href="priority_queue.html"><tt>priority_queue</tt></a>
+ with <tt>Tag</tt> = <a href="pairing_heap_tag.html"><tt>pairing_heap_tag</tt></a>
+</li>
+</ol>
+</div><div style="width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<div id="NPM_res_div">
+<div id="NPM_msvc">
+<div id="NPM_priority_queue_text_pop_mem_usage_test">
+<div id="NPM_pq">
+<div id="NPM_Native_and__tt_pb_ds_455tt__priority_queue__tt_pop_455tt__memory-use_test"><div style="border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NPM" id="NPM"><img src="priority_queue_text_pop_mem_usage_test_msvc.png" alt="no image" /></a></h6>NPM: Native and <tt>pb ds</tt> priority queue <tt>pop</tt> memory-use test - <a href="pq_performance_tests.html#msvc">msvc++</a><p>In the above figure, the names in the legends have the following meaning:</p>
+<ol>
+<li>
+n_pq_vector-
+<tt>std::priority_queue</tt> adapting <tt>std::vector</tt></li>
+<li>
+n_pq_deque-
+<tt>std::priority_queue</tt> adapting <tt>std::deque</tt></li>
+<li>
+binary_heap-
+<a href="priority_queue.html"><tt>priority_queue</tt></a>
+ with <tt>Tag</tt> = <a href="binary_heap_tag.html"><tt>binary_heap_tag</tt></a>
+</li>
+<li>
+thin_heap-
+<a href="priority_queue.html"><tt>priority_queue</tt></a>
+ with <tt>Tag</tt> = <a href="thin_heap_tag.html"><tt>thin_heap_tag</tt></a>
+</li>
+<li>
+binomial_heap-
+<a href="priority_queue.html"><tt>priority_queue</tt></a>
+ with <tt>Tag</tt> = <a href="binomial_heap_tag.html"><tt>binomial_heap_tag</tt></a>
+</li>
+<li>
+rc_binomial_heap-
+<a href="priority_queue.html"><tt>priority_queue</tt></a>
+ with <tt>Tag</tt> = <a href="rc_binomial_heap_tag.html"><tt>rc_binomial_heap_tag</tt></a>
+</li>
+<li>
+pairing_heap-
+<a href="priority_queue.html"><tt>priority_queue</tt></a>
+ with <tt>Tag</tt> = <a href="pairing_heap_tag.html"><tt>pairing_heap_tag</tt></a>
+</li>
+</ol>
+</div><div style="width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<div id="NPL_res_div">
+<div id="NPL_local">
+<div id="NPL_priority_queue_text_pop_mem_usage_test">
+<div id="NPL_pq">
+<div id="NPL_Native_and__tt_pb_ds_455tt__priority_queue__tt_pop_455tt__memory-use_test"><div style = "border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NPL" id= "NPL"><img src="priority_queue_text_pop_mem_usage_test_local.png" alt="no image" /></a></h6>NPL: Native and <tt>pb ds</tt> priority queue <tt>pop</tt> memory-use test - <a href = "pq_performance_tests.html#local">local</a></div><div style = "width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<h2><a name="observations" id="observations">Observations</a></h2>
+<p>The priority queue implementations (excluding the STL's) use
+    memory proportionally to the number of values they hold:
+    node-based implementations (<i>e.g.</i>, a pairing heap) do so
+    naturally; <tt>pb_ds</tt>'s binary heap de-allocates memory when
+    a certain lower threshold is exceeded.</p>
+<p>Note from <a href="priority_queue_text_push_pop_timing_test.html">Priority Queue
+    Text <tt>push</tt> and <tt>pop</tt> Timing Test</a> and
+    <a href="priority_queue_random_int_push_pop_timing_test.html">Priority
+    Queue Random Integer <tt>push</tt> and <tt>pop</tt> Timing
+    Test</a> that this does not impede performance compared to the
+    STL's priority queues.</p>
+<p>(See <a href="hash_random_int_erase_mem_usage_test.html">Hash-Based Erase
+    Memory Use Test</a> for a similar phenomenon regarding priority
+    queues.)</p>
+</div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_text_pop_mem_usage_test_gcc.png b/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_text_pop_mem_usage_test_gcc.png
new file mode 100644
index 00000000000..2c1918d0623
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_text_pop_mem_usage_test_gcc.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_text_pop_mem_usage_test_local.png b/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_text_pop_mem_usage_test_local.png
new file mode 100644
index 00000000000..c1413fc93d6
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_text_pop_mem_usage_test_local.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_text_pop_mem_usage_test_msvc.png b/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_text_pop_mem_usage_test_msvc.png
new file mode 100644
index 00000000000..9717f498b7a
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_text_pop_mem_usage_test_msvc.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_text_push_pop_timing_test.html b/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_text_push_pop_timing_test.html
new file mode 100644
index 00000000000..02fe32183a4
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_text_push_pop_timing_test.html
@@ -0,0 +1,209 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+<meta name="generator" content="HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+<title>Priority Queue Text Push Pop Timing Test</title>
+<meta http-equiv="Content-Type" content="text/html; charset=us-ascii" />
+</head>
+<body>
+<div id="page">
+<h1>Priority Queue Text <tt>push</tt> and <tt>pop</tt> Timing
+    Test</h1>
+<h2><a name="description" id="description">Description</a></h2>
+<p>This test inserts a number of values with keys from an
+    arbitrary text ([ <a href="references.html#wickland96thirty">wickland96thirty</a> ]) into
+    a container using <tt>push</tt> , then removes them using
+    <tt>pop</tt> . It measures the average time for <tt>push</tt>
+    as a function of the number of values.</p>
+<p>(The test was executed with <a href="../../../../testsuite/performance/ext/pb_ds/priority_queue_text_push_pop_timing.cc"><tt>
+    priority_queue_text_push_pop_timing_test</tt></a>
+    thirty_years_among_the_dead_preproc.txt 200 200 2100)</p>
+<h2><a name="purpose" id="purpose">Purpose</a></h2>
+<p>The test checks the effect of different underlying
+    data structures (see <a href="pq_design.html#pq_imp">Design::Priority
+    Queues::Implementations</a>).</p>
+<h2><a name="results" id="results">Results</a></h2>
+<p>Figures <a href="#NPG">NPG</a>, <a href="#NPM">NPM</a>, and
+    <a href="#NPL">NPL</a> show the results for the native priority
+    queues and <tt>pb_ds</tt> 's priority queues in <a href="pq_performance_tests.html#gcc"><u>g++</u></a>, <a href="pq_performance_tests.html#msvc"><u>msvc++</u></a>, and
+    <a href="pq_performance_tests.html#local"><u>local</u></a>,
+    respectively; Figures <a href="#NBRG">NBRG</a>, <a href="#NBRM">NBRM</a>, and <a href="#NBRL">NBRL</a> show the results
+    for the native priority queues and <tt>pb_ds</tt>'s pairing
+    queues in <a href="pq_performance_tests.html#gcc"><u>g++</u></a>, <a href="pq_performance_tests.html#msvc"><u>msvc++</u></a>, and
+    <a href="pq_performance_tests.html#local"><u>local</u></a>,
+    respectively.</p>
+<div id="NPG_res_div">
+<div id="NPG_gcc">
+<div id="NPG_priority_queue_text_push_pop_timing_test">
+<div id="NPG_pq">
+<div id="NPG_Native_tree_and__tt_pb_ds_455tt__priority_queue__tt_push_455tt__and__tt_pop_455tt__timing_test"><div style="border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NPG" id="NPG"><img src="priority_queue_text_push_pop_timing_test_gcc.png" alt="no image" /></a></h6>NPG: Native tree and <tt>pb ds</tt> priority queue <tt>push</tt> and <tt>pop</tt> timing test - <a href="pq_performance_tests.html#gcc">g++</a><p>In the above figure, the names in the legends have the following meaning:</p>
+<ol>
+<li>
+n_pq_vector-
+<tt>std::priority_queue</tt> adapting <tt>std::vector</tt></li>
+<li>
+n_pq_deque-
+<tt>std::priority_queue</tt> adapting <tt>std::deque</tt></li>
+<li>
+thin_heap-
+<a href="priority_queue.html"><tt>priority_queue</tt></a>
+ with <tt>Tag</tt> = <a href="thin_heap_tag.html"><tt>thin_heap_tag</tt></a>
+</li>
+<li>
+rc_binomial_heap-
+<a href="priority_queue.html"><tt>priority_queue</tt></a>
+ with <tt>Tag</tt> = <a href="rc_binomial_heap_tag.html"><tt>rc_binomial_heap_tag</tt></a>
+</li>
+<li>
+binomial_heap-
+<a href="priority_queue.html"><tt>priority_queue</tt></a>
+ with <tt>Tag</tt> = <a href="binomial_heap_tag.html"><tt>binomial_heap_tag</tt></a>
+</li>
+<li>
+binary_heap-
+<a href="priority_queue.html"><tt>priority_queue</tt></a>
+ with <tt>Tag</tt> = <a href="binary_heap_tag.html"><tt>binary_heap_tag</tt></a>
+</li>
+<li>
+pairing_heap-
+<a href="priority_queue.html"><tt>priority_queue</tt></a>
+ with <tt>Tag</tt> = <a href="pairing_heap_tag.html"><tt>pairing_heap_tag</tt></a>
+</li>
+</ol>
+</div><div style="width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<div id="NPM_res_div">
+<div id="NPM_msvc">
+<div id="NPM_priority_queue_text_push_pop_timing_test">
+<div id="NPM_pq">
+<div id="NPM_Native_tree_and__tt_pb_ds_455tt__priority_queue__tt_push_455tt__and__tt_pop_455tt__timing_test"><div style="border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NPM" id="NPM"><img src="priority_queue_text_push_pop_timing_test_msvc.png" alt="no image" /></a></h6>NPM: Native tree and <tt>pb ds</tt> priority queue <tt>push</tt> and <tt>pop</tt> timing test - <a href="pq_performance_tests.html#msvc">msvc++</a><p>In the above figure, the names in the legends have the following meaning:</p>
+<ol>
+<li>
+n_pq_deque-
+<tt>std::priority_queue</tt> adapting <tt>std::deque</tt></li>
+<li>
+n_pq_vector-
+<tt>std::priority_queue</tt> adapting <tt>std::vector</tt></li>
+<li>
+thin_heap-
+<a href="priority_queue.html"><tt>priority_queue</tt></a>
+ with <tt>Tag</tt> = <a href="thin_heap_tag.html"><tt>thin_heap_tag</tt></a>
+</li>
+<li>
+rc_binomial_heap-
+<a href="priority_queue.html"><tt>priority_queue</tt></a>
+ with <tt>Tag</tt> = <a href="rc_binomial_heap_tag.html"><tt>rc_binomial_heap_tag</tt></a>
+</li>
+<li>
+binomial_heap-
+<a href="priority_queue.html"><tt>priority_queue</tt></a>
+ with <tt>Tag</tt> = <a href="binomial_heap_tag.html"><tt>binomial_heap_tag</tt></a>
+</li>
+<li>
+pairing_heap-
+<a href="priority_queue.html"><tt>priority_queue</tt></a>
+ with <tt>Tag</tt> = <a href="pairing_heap_tag.html"><tt>pairing_heap_tag</tt></a>
+</li>
+<li>
+binary_heap-
+<a href="priority_queue.html"><tt>priority_queue</tt></a>
+ with <tt>Tag</tt> = <a href="binary_heap_tag.html"><tt>binary_heap_tag</tt></a>
+</li>
+</ol>
+</div><div style="width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<div id="NPL_res_div">
+<div id="NPL_local">
+<div id="NPL_priority_queue_text_push_pop_timing_test">
+<div id="NPL_pq">
+<div id="NPL_Native_tree_and__tt_pb_ds_455tt__priority_queue__tt_push_455tt__and__tt_pop_455tt__timing_test"><div style = "border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NPL" id= "NPL"><img src="priority_queue_text_push_pop_timing_test_local.png" alt="no image" /></a></h6>NPL: Native tree and <tt>pb ds</tt> priority queue <tt>push</tt> and <tt>pop</tt> timing test - <a href = "pq_performance_tests.html#local">local</a></div><div style = "width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<div id="NBRG_res_div">
+<div id="NBRG_gcc">
+<div id="NBRG_pairing_priority_queue_text_push_pop_timing_test">
+<div id="NBRG_pq">
+<div id="NBRG_Native_tree_and__tt_pb_ds_455tt__pairing_priority_queue__tt_push_455tt__and__tt_pop_455tt__timing_test"><div style="border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NBRG" id="NBRG"><img src="pairing_priority_queue_text_push_pop_timing_test_gcc.png" alt="no image" /></a></h6>NBRG: Native tree and <tt>pb ds</tt> pairing priority queue <tt>push</tt> and <tt>pop</tt> timing test - <a href="pq_performance_tests.html#gcc">g++</a><p>In the above figure, the names in the legends have the following meaning:</p>
+<ol>
+<li>
+n_pq_vector-
+<tt>std::priority_queue</tt> adapting <tt>std::vector</tt></li>
+<li>
+n_pq_deque-
+<tt>std::priority_queue</tt> adapting <tt>std::deque</tt></li>
+<li>
+pairing_heap-
+<a href="priority_queue.html"><tt>priority_queue</tt></a>
+ with <tt>Tag</tt> = <a href="pairing_heap_tag.html"><tt>pairing_heap_tag</tt></a>
+</li>
+</ol>
+</div><div style="width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<div id="NBRM_res_div">
+<div id="NBRM_msvc">
+<div id="NBRM_pairing_priority_queue_text_push_pop_timing_test">
+<div id="NBRM_pq">
+<div id="NBRM_Native_tree_and__tt_pb_ds_455tt__pairing_priority_queue__tt_push_455tt__and__tt_pop_455tt__timing_test"><div style="border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NBRM" id="NBRM"><img src="pairing_priority_queue_text_push_pop_timing_test_msvc.png" alt="no image" /></a></h6>NBRM: Native tree and <tt>pb ds</tt> pairing priority queue <tt>push</tt> and <tt>pop</tt> timing test - <a href="pq_performance_tests.html#msvc">msvc++</a><p>In the above figure, the names in the legends have the following meaning:</p>
+<ol>
+<li>
+n_pq_deque-
+<tt>std::priority_queue</tt> adapting <tt>std::deque</tt></li>
+<li>
+n_pq_vector-
+<tt>std::priority_queue</tt> adapting <tt>std::vector</tt></li>
+<li>
+pairing_heap-
+<a href="priority_queue.html"><tt>priority_queue</tt></a>
+ with <tt>Tag</tt> = <a href="pairing_heap_tag.html"><tt>pairing_heap_tag</tt></a>
+</li>
+</ol>
+</div><div style="width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<div id="NBRL_res_div">
+<div id="NBRL_local">
+<div id="NBRL_pairing_priority_queue_text_push_pop_timing_test">
+<div id="NBRL_pq">
+<div id="NBRL_Native_tree_and__tt_pb_ds_455tt__pairing_priority_queue__tt_push_455tt__and__tt_pop_455tt__timing_test"><div style = "border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NBRL" id= "NBRL"><img src="pairing_priority_queue_text_push_pop_timing_test_local.png" alt="no image" /></a></h6>NBRL: Native tree and <tt>pb ds</tt> pairing priority queue <tt>push</tt> and <tt>pop</tt> timing test - <a href = "pq_performance_tests.html#local">local</a></div><div style = "width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<h2><a name="observations" id="observations">Observations</a></h2>
+<p>These results are very similar to <a href="priority_queue_text_push_timing_test.html">Priority Queue Text
+    <tt>push</tt> Timing Test</a>. As stated there, pairing heaps
+    (<a href="priority_queue.html"><tt>priority_queue</tt></a> with
+    <tt>Tag</tt> = <a href="pairing_heap_tag.html"><tt>pairing_heap_tag</tt></a>)
+    are most suited for <tt>push</tt> and <tt>pop</tt> sequences of
+    non-primitive types such as strings. Observing these two tests,
+    one can note that a pairing heap outperforms the others in
+    terms of <tt>push</tt> operations, but equals binary heaps
+    (<a href="priority_queue.html"><tt>priority_queue</tt></a> with
+    <tt>Tag</tt> = <a href="binary_heap_tag.html"><tt>binary_heap_tag</tt></a>) if
+    the number of <tt>push</tt> and <tt>pop</tt> operations is
+    equal. As the number of <tt>pop</tt> operations is at most
+    equal to the number of <tt>push</tt> operations, pairing heaps
+    are better in this case. See <a href="priority_queue_random_int_push_pop_timing_test.html">Priority
+    Queue Random Integer <tt>push</tt> and <tt>pop</tt> Timing
+    Test</a> for a case which is different.</p>
+<p><a href="pq_performance_tests.html#pq_observations">Priority-Queue
+    Performance Tests::Observations</a> discusses this further and
+    summarizes.</p>
+</div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_text_push_pop_timing_test_gcc.png b/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_text_push_pop_timing_test_gcc.png
new file mode 100644
index 00000000000..d4886ae5967
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_text_push_pop_timing_test_gcc.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_text_push_pop_timing_test_local.png b/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_text_push_pop_timing_test_local.png
new file mode 100644
index 00000000000..a7c5f8987ae
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_text_push_pop_timing_test_local.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_text_push_pop_timing_test_msvc.png b/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_text_push_pop_timing_test_msvc.png
new file mode 100644
index 00000000000..a5720402b3b
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_text_push_pop_timing_test_msvc.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_text_push_timing_test.html b/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_text_push_timing_test.html
new file mode 100644
index 00000000000..67ae4b9d510
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_text_push_timing_test.html
@@ -0,0 +1,219 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+<meta name="generator" content="HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+<title>Priority Queue Text Push Timing Test</title>
+<meta http-equiv="Content-Type" content="text/html; charset=us-ascii" />
+</head>
+<body>
+<div id="page">
+<h1>Priority Queue Text <tt>push</tt> Timing Test</h1>
+<h2><a name="description" id="description">Description</a></h2>
+<p>This test inserts a number of values with keys from an
+    arbitrary text ([ <a href="references.html#wickland96thirty">wickland96thirty</a> ]) into
+    a container using <tt>push</tt> . It measures the average time
+    for <tt>push</tt> as a function of the number of values
+    pushed.</p>
+<p>(The test was executed with <a href="../../../../testsuite/performance/ext/pb_ds/priority_queue_text_push_timing.cc"><tt>priority_queue_text_push_timing_test</tt></a>
+    thirty_years_among_the_dead_preproc.txt 200 200 2100)</p>
+<h2><a name="purpose" id="purpose">Purpose</a></h2>
+<p>The test checks the effect of different underlying
+    data structures (see <a href="pq_design.html#pq_imp">Design::Priority
+    Queues::Implementations</a>).</p>
+<h2><a name="results" id="results">Results</a></h2>
+<p>Figures <a href="#NPG">NPG</a>, <a href="#NPM">NPM</a>, and
+    <a href="#NPL">NPL</a> show the results for the native priority
+    queues and <tt>pb_ds</tt> 's priority queues in <a href="pq_performance_tests.html#gcc"><u>g++</u></a>, <a href="pq_performance_tests.html#msvc"><u>msvc++</u></a>, and
+    <a href="pq_performance_tests.html#local"><u>local</u></a>,
+    respectively; Figures <a href="#NBRG">NBRG</a>, <a href="#NBRM">NBRM</a>, and <a href="#NBRL">NBRL</a> shows the
+    results for the binary-heap based native priority queues and
+    <tt>pb_ds</tt>'s pairing-heap priority queues in <a href="pq_performance_tests.html#gcc"><u>g++</u></a>, <a href="pq_performance_tests.html#msvc"><u>msvc++</u></a>, and
+    <a href="pq_performance_tests.html#local"><u>local</u></a>,
+    respectively</p>
+<div id="NPG_res_div">
+<div id="NPG_gcc">
+<div id="NPG_priority_queue_text_push_timing_test">
+<div id="NPG_pq">
+<div id="NPG_Native_and__tt_pb_ds_455tt__priority_queue__tt_push_455tt__timing_test"><div style="border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NPG" id="NPG"><img src="priority_queue_text_push_timing_test_gcc.png" alt="no image" /></a></h6>NPG: Native and <tt>pb ds</tt> priority queue <tt>push</tt> timing test - <a href="pq_performance_tests.html#gcc">g++</a><p>In the above figure, the names in the legends have the following meaning:</p>
+<ol>
+<li>
+n_pq_vector-
+<tt>std::priority_queue</tt> adapting <tt>std::vector</tt></li>
+<li>
+n_pq_deque-
+<tt>std::priority_queue</tt> adapting <tt>std::deque</tt></li>
+<li>
+binary_heap-
+<a href="priority_queue.html"><tt>priority_queue</tt></a>
+ with <tt>Tag</tt> = <a href="binary_heap_tag.html"><tt>binary_heap_tag</tt></a>
+</li>
+<li>
+rc_binomial_heap-
+<a href="priority_queue.html"><tt>priority_queue</tt></a>
+ with <tt>Tag</tt> = <a href="rc_binomial_heap_tag.html"><tt>rc_binomial_heap_tag</tt></a>
+</li>
+<li>
+thin_heap-
+<a href="priority_queue.html"><tt>priority_queue</tt></a>
+ with <tt>Tag</tt> = <a href="thin_heap_tag.html"><tt>thin_heap_tag</tt></a>
+</li>
+<li>
+binomial_heap-
+<a href="priority_queue.html"><tt>priority_queue</tt></a>
+ with <tt>Tag</tt> = <a href="binomial_heap_tag.html"><tt>binomial_heap_tag</tt></a>
+</li>
+<li>
+pairing_heap-
+<a href="priority_queue.html"><tt>priority_queue</tt></a>
+ with <tt>Tag</tt> = <a href="pairing_heap_tag.html"><tt>pairing_heap_tag</tt></a>
+</li>
+</ol>
+</div><div style="width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<div id="NPM_res_div">
+<div id="NPM_msvc">
+<div id="NPM_priority_queue_text_push_timing_test">
+<div id="NPM_pq">
+<div id="NPM_Native_and__tt_pb_ds_455tt__priority_queue__tt_push_455tt__timing_test"><div style="border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NPM" id="NPM"><img src="priority_queue_text_push_timing_test_msvc.png" alt="no image" /></a></h6>NPM: Native and <tt>pb ds</tt> priority queue <tt>push</tt> timing test - <a href="pq_performance_tests.html#msvc">msvc++</a><p>In the above figure, the names in the legends have the following meaning:</p>
+<ol>
+<li>
+n_pq_deque-
+<tt>std::priority_queue</tt> adapting <tt>std::deque</tt></li>
+<li>
+rc_binomial_heap-
+<a href="priority_queue.html"><tt>priority_queue</tt></a>
+ with <tt>Tag</tt> = <a href="rc_binomial_heap_tag.html"><tt>rc_binomial_heap_tag</tt></a>
+</li>
+<li>
+binary_heap-
+<a href="priority_queue.html"><tt>priority_queue</tt></a>
+ with <tt>Tag</tt> = <a href="binary_heap_tag.html"><tt>binary_heap_tag</tt></a>
+</li>
+<li>
+binomial_heap-
+<a href="priority_queue.html"><tt>priority_queue</tt></a>
+ with <tt>Tag</tt> = <a href="binomial_heap_tag.html"><tt>binomial_heap_tag</tt></a>
+</li>
+<li>
+n_pq_vector-
+<tt>std::priority_queue</tt> adapting <tt>std::vector</tt></li>
+<li>
+pairing_heap-
+<a href="priority_queue.html"><tt>priority_queue</tt></a>
+ with <tt>Tag</tt> = <a href="pairing_heap_tag.html"><tt>pairing_heap_tag</tt></a>
+</li>
+<li>
+thin_heap-
+<a href="priority_queue.html"><tt>priority_queue</tt></a>
+ with <tt>Tag</tt> = <a href="thin_heap_tag.html"><tt>thin_heap_tag</tt></a>
+</li>
+</ol>
+</div><div style="width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<div id="NPL_res_div">
+<div id="NPL_local">
+<div id="NPL_priority_queue_text_push_timing_test">
+<div id="NPL_pq">
+<div id="NPL_Native_and__tt_pb_ds_455tt__priority_queue__tt_push_455tt__timing_test"><div style = "border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NPL" id= "NPL"><img src="priority_queue_text_push_timing_test_local.png" alt="no image" /></a></h6>NPL: Native and <tt>pb ds</tt> priority queue <tt>push</tt> timing test - <a href = "pq_performance_tests.html#local">local</a></div><div style = "width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<div id="NBRG_res_div">
+<div id="NBRG_gcc">
+<div id="NBRG_pairing_priority_queue_text_push_timing_test">
+<div id="NBRG_pq">
+<div id="NBRG_Native_and__tt_pb_ds_455tt__pairing_priority_queue__tt_push_455tt__timing_test"><div style="border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NBRG" id="NBRG"><img src="pairing_priority_queue_text_push_timing_test_gcc.png" alt="no image" /></a></h6>NBRG: Native and <tt>pb ds</tt> pairing priority queue <tt>push</tt> timing test - <a href="pq_performance_tests.html#gcc">g++</a><p>In the above figure, the names in the legends have the following meaning:</p>
+<ol>
+<li>
+n_pq_vector-
+<tt>std::priority_queue</tt> adapting <tt>std::vector</tt></li>
+<li>
+n_pq_deque-
+<tt>std::priority_queue</tt> adapting <tt>std::deque</tt></li>
+<li>
+thin_heap-
+<a href="priority_queue.html"><tt>priority_queue</tt></a>
+ with <tt>Tag</tt> = <a href="thin_heap_tag.html"><tt>thin_heap_tag</tt></a>
+</li>
+<li>
+pairing_heap-
+<a href="priority_queue.html"><tt>priority_queue</tt></a>
+ with <tt>Tag</tt> = <a href="pairing_heap_tag.html"><tt>pairing_heap_tag</tt></a>
+</li>
+</ol>
+</div><div style="width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<div id="NBRM_res_div">
+<div id="NBRM_msvc">
+<div id="NBRM_pairing_priority_queue_text_push_timing_test">
+<div id="NBRM_pq">
+<div id="NBRM_Native_and__tt_pb_ds_455tt__pairing_priority_queue__tt_push_455tt__timing_test"><div style="border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NBRM" id="NBRM"><img src="pairing_priority_queue_text_push_timing_test_msvc.png" alt="no image" /></a></h6>NBRM: Native and <tt>pb ds</tt> pairing priority queue <tt>push</tt> timing test - <a href="pq_performance_tests.html#msvc">msvc++</a><p>In the above figure, the names in the legends have the following meaning:</p>
+<ol>
+<li>
+n_pq_deque-
+<tt>std::priority_queue</tt> adapting <tt>std::deque</tt></li>
+<li>
+n_pq_vector-
+<tt>std::priority_queue</tt> adapting <tt>std::vector</tt></li>
+<li>
+pairing_heap-
+<a href="priority_queue.html"><tt>priority_queue</tt></a>
+ with <tt>Tag</tt> = <a href="pairing_heap_tag.html"><tt>pairing_heap_tag</tt></a>
+</li>
+<li>
+thin_heap-
+<a href="priority_queue.html"><tt>priority_queue</tt></a>
+ with <tt>Tag</tt> = <a href="thin_heap_tag.html"><tt>thin_heap_tag</tt></a>
+</li>
+</ol>
+</div><div style="width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<div id="NBRL_res_div">
+<div id="NBRL_local">
+<div id="NBRL_pairing_priority_queue_text_push_timing_test">
+<div id="NBRL_pq">
+<div id="NBRL_Native_and__tt_pb_ds_455tt__pairing_priority_queue__tt_push_455tt__timing_test"><div style = "border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NBRL" id= "NBRL"><img src="pairing_priority_queue_text_push_timing_test_local.png" alt="no image" /></a></h6>NBRL: Native and <tt>pb ds</tt> pairing priority queue <tt>push</tt> timing test - <a href = "pq_performance_tests.html#local">local</a></div><div style = "width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<h2><a name="observations" id="observations">Observations</a></h2>
+<p>Pairing heaps (<a href="priority_queue.html"><tt>priority_queue</tt></a> with
+    <tt>Tag</tt> = <a href="pairing_heap_tag.html"><tt>pairing_heap_tag</tt></a>)
+    are the most suited for sequences of <tt>push</tt> and
+    <tt>pop</tt> operations of non-primitive types (<i>e.g.</i>
+<tt>std::string</tt>s). (see also <a href="priority_queue_text_push_pop_timing_test.html">Priority Queue
+    Text <tt>push</tt> and <tt>pop</tt> Timing Test</a>.) They are
+    less constrained than binomial heaps, <i>e.g.</i>, and since
+    they are node-based, they outperform binary heaps. (See
+    <a href="priority_queue_random_int_push_timing_test.html">Priority
+    Queue Random Integer <tt>push</tt> Timing Test</a> for the case
+    of primitive types.)</p>
+<p>The STL's priority queues do not seem to perform well in
+    this case: the <tt>std::vector</tt> implementation needs to
+    perform a logarithmic sequence of string operations for each
+    operation, and the deque implementation is possibly hampered by
+    its need to manipulate a relatively-complex type (deques
+    support a <i>O(1)</i> <tt>push_front</tt>, even though it is
+    not used by <tt>std::priority_queue</tt>.)</p>
+<p><a href="pq_performance_tests.html#pq_observations">Priority-Queue
+    Performance Tests::Observations</a> discusses this further and
+    summarizes.</p>
+</div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_text_push_timing_test_gcc.png b/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_text_push_timing_test_gcc.png
new file mode 100644
index 00000000000..8895f507cfc
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_text_push_timing_test_gcc.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_text_push_timing_test_local.png b/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_text_push_timing_test_local.png
new file mode 100644
index 00000000000..da7297bffa9
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_text_push_timing_test_local.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_text_push_timing_test_msvc.png b/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_text_push_timing_test_msvc.png
new file mode 100644
index 00000000000..ff39ca37dd9
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/priority_queue_text_push_timing_test_msvc.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/quadratic_probe_fn.html b/libstdc++-v3/docs/html/ext/pb_ds/quadratic_probe_fn.html
new file mode 100644
index 00000000000..f3209d33881
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/quadratic_probe_fn.html
@@ -0,0 +1,141 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+  <meta name="generator" content=
+  "HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+
+  <title>quadratic_probe_fn Interface</title>
+  <meta http-equiv="Content-Type" content=
+  "text/html; charset=us-ascii" />
+  </head>
+
+<body>
+  <div id="page">
+    <h1><tt>quadratic_probe_fn</tt> Interface</h1>
+
+    <p>A probe sequence policy using square increments.</p>
+
+    <p>Defined in: <a href=
+    "../../../../include/ext/pb_ds/hash_policy.hpp"><tt>hash_policy.hpp</tt></a></p>
+
+    <h2><a name="link1" id="link1">Template Parameters</a></h2>
+
+    <table class="c1" width="100%" border="1" summary=
+    "Template Parameters">
+      <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_Type42920436" id=
+"Size_Type42920436"><b>typename</b> Size_Type </a>
+</pre>
+        </td>
+
+        <td>
+          <p>Size type.</p>
+        </td>
+
+        <td>size_t</td>
+      </tr>
+    </table>
+
+    <h2><a name="link2" id="link2">Public Types and
+    Constants</a></h2>
+
+    <h3><a name="link3" id="link3">General Definitions</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Types">
+      <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_type55424436" id="size_type55424436">size_type</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<a href="#Size_Type42920436"><tt>Size_Type</tt></a>
+</pre>
+        </td>
+
+        <td>
+          <p>Size type.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h2><a name="link4" id="link4">Public Methods</a></h2>
+
+    <h3><a name="link5" id="link5">Constructors, Destructor, and
+    Related</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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
+  (<span class=
+"c2"><tt>quadratic_probe_fn</tt></span> &amp;other)
+</pre>
+        </td>
+
+        <td>
+          <p>Swaps content.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h2><a name="link6" id="link6">Protected Methods</a></h2>
+
+    <h3><a name="link7" id="link7">Offset Methods</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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_type55424436"><tt>size_type</tt></a>
+  <b>operator</b>()
+  (<a href=
+"#size_type55424436"><tt>size_type</tt></a> i) <b>const</b>
+</pre>
+        </td>
+
+        <td>
+          <p>Returns the <span class="c1"><tt>i</tt></span>-th
+          offset from the hash value.</p>
+        </td>
+      </tr>
+    </table>
+  </div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/random_int_find_find_timing_test_tree_gcc.png b/libstdc++-v3/docs/html/ext/pb_ds/random_int_find_find_timing_test_tree_gcc.png
new file mode 100644
index 00000000000..61962704f71
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/random_int_find_find_timing_test_tree_gcc.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/random_int_find_find_timing_test_tree_local.png b/libstdc++-v3/docs/html/ext/pb_ds/random_int_find_find_timing_test_tree_local.png
new file mode 100644
index 00000000000..83105202a48
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/random_int_find_find_timing_test_tree_local.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/random_int_find_find_timing_test_tree_msvc.png b/libstdc++-v3/docs/html/ext/pb_ds/random_int_find_find_timing_test_tree_msvc.png
new file mode 100644
index 00000000000..2206cef5a90
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/random_int_find_find_timing_test_tree_msvc.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/range_invalidation_guarantee.html b/libstdc++-v3/docs/html/ext/pb_ds/range_invalidation_guarantee.html
new file mode 100644
index 00000000000..e59a257a540
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/range_invalidation_guarantee.html
@@ -0,0 +1,52 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+  <meta name="generator" content=
+  "HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+
+  <title>range_invalidation_guarantee Interface</title>
+  <meta http-equiv="Content-Type" content=
+  "text/html; charset=us-ascii" />
+  </head>
+
+<body>
+  <div id="page">
+    <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>
+
+    <p>Defined in: <a href=
+    "../../../../include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
+
+    <h2><a name="link1" id="link1">Base Classes</a></h2>
+
+    <table class="c1" width="100%" border="1" summary="Bases">
+      <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="point_invalidation_guarantee.html"><span class=
+"c2"><tt>point_invalidation_guarantee</tt></span></a>
+</pre>
+        </td>
+
+        <td>
+          <p>public</p>
+        </td>
+      </tr>
+    </table>
+  </div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/rationale_null_node_updator.png b/libstdc++-v3/docs/html/ext/pb_ds/rationale_null_node_updator.png
new file mode 100644
index 00000000000..43874891517
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/rationale_null_node_updator.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/rb_tree_tag.html b/libstdc++-v3/docs/html/ext/pb_ds/rb_tree_tag.html
new file mode 100644
index 00000000000..600235d5e8d
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/rb_tree_tag.html
@@ -0,0 +1,47 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+  <meta name="generator" content=
+  "HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+
+  <title>rb_tree_tag Interface</title>
+  <meta http-equiv="Content-Type" content=
+  "text/html; charset=us-ascii" />
+  </head>
+
+<body>
+  <div id="page">
+    <h1><tt>rb_tree_tag</tt> Interface</h1>
+
+    <p>Red-black tree data structure tag.</p>
+
+    <p>Defined in: <a href=
+    "../../../../include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
+
+    <h2><a name="link1" id="link1">Base Classes</a></h2>
+
+    <table class="c1" width="100%" border="1" summary="Bases">
+      <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="tree_tag.html"><span class=
+"c2"><tt>tree_tag</tt></span></a>
+</pre>
+        </td>
+
+        <td>
+          <p>public</p>
+        </td>
+      </tr>
+    </table>
+  </div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/rc_binomial_heap_tag.html b/libstdc++-v3/docs/html/ext/pb_ds/rc_binomial_heap_tag.html
new file mode 100644
index 00000000000..46106f4c585
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/rc_binomial_heap_tag.html
@@ -0,0 +1,47 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+  <meta name="generator" content=
+  "HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+
+  <title>rc_binomial_heap_tag Interface</title>
+  <meta http-equiv="Content-Type" content=
+  "text/html; charset=us-ascii" />
+  </head>
+
+<body>
+  <div id="page">
+    <h1><tt>rc_binomial_heap_tag</tt> Interface</h1>
+
+    <p>Redundant-counter binomial-heap data structure tag.</p>
+
+    <p>Defined in: <a href=
+    "../../../../include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
+
+    <h2><a name="link1" id="link1">Base Classes</a></h2>
+
+    <table class="c1" width="100%" border="1" summary="Bases">
+      <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="priority_queue_tag.html"><span class=
+"c2"><tt>priority_queue_tag</tt></span></a>
+</pre>
+        </td>
+
+        <td>
+          <p>public</p>
+        </td>
+      </tr>
+    </table>
+  </div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/references.html b/libstdc++-v3/docs/html/ext/pb_ds/references.html
new file mode 100644
index 00000000000..b96827bd37a
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/references.html
@@ -0,0 +1,258 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+  <meta name="generator" content=
+  "HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+
+  <title>References</title>
+  <meta http-equiv="Content-Type" content=
+  "text/html; charset=us-ascii" />
+  </head>
+
+<body>
+  <div id="page">
+    <h1>References</h1>
+
+    <ol>
+      <li>[<a name="abrahams97exception" id=
+      "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>
+
+      <li>[<a name="alexandrescu01modern" id=
+      "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" id="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" id=
+      "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" id=
+      "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" id=
+      "austern98segmented">austern98segmented</a>] Matthew Austern,
+      "Segmented iterators and hierarchical algorithms", Generic
+      Programming, April 1998, pp. 80-90</li>
+
+      <li>[<a name="boost_timer" id="boost_timer">boost_timer</a>],
+      "Boost timer library", <a href=
+      "http://www.boost.org/">http://www.boost.org</a> by Beman
+      Dawes</li>
+
+      <li>[<a name="boost_pool" id="boost_pool">boost_pool</a>],
+      "Boost pool library", <a href=
+      "http://www.boost.org/">http://www.boost.org</a> by Stephen
+      Cleary</li>
+
+      <li>[<a name="boost_type_traits" id=
+      "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="brodal96priority" id=
+      "brodal96priority">brodal96priority</a>] Gerth Stolting
+      Brodal, <a href=
+      "http://portal.acm.org/citation.cfm?id=313883">Worst-case
+      efficient priority queues</a></li>
+
+      <li>[<a name="bulka99efficient" id=
+      "bulka99efficient">bulka99efficient</a>] D. Bulka, and D.
+      Mayhew, "Efficient C++ Programming Techniques.",
+      Addison-Wesley Publishing Company, Addison-Wesley, 1997</li>
+
+      <li>[<a name="clrs2001" id="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" id=
+      "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" id=
+      "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" id=
+      "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="filliatre2000ptset" id=
+      "filliatre2000ptset">filliatre2000ptset</a>], J. C.
+      Filliatre, "Ptset: Sets of integers implemented as Patricia
+      trees", <a href=
+      "http://www.lri.fr/~filliatr/ftp/ocaml/misc/ptset.ml">http://www.lri.fr/~filliatr/ftp/ocaml/misc/ptset.ml</a></li>
+
+      <li>[<a name="fredman86pairing" id=
+      "fredman86pairing">fredman86pairing</a>], M. L. Fredman, R
+      Sedgewick, D. D. Sleator, R. E. Tarjan, <a href=
+      "http://www.cs.cmu.edu/~sleator/papers/pairing-heaps.pdf">The
+      pairing heap: a new form of self-adjusting heap</a></li>
+
+      <li>[<a name="gamma95designpatterns" id=
+      "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" id="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="hyslop02making" id=
+      "hyslop02making">hyslop02making</a>] J. Hyslop, and H.
+      Sutter, "Making a real hash of things", C++ Report, May
+      2002</li>
+
+      <li>[<a name="jossutis01stl" id=
+      "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="kt99fat_heaps" id=
+      "kt99fat_heaps">kt99fat_heas</a>] Haim Kaplan and Robert E.
+      Tarjan, <a href=
+      "http://www.cs.princeton.edu/research/techreps/TR-597-99">New
+      Heap Data Structures</a></li>
+
+      <li>[<a name="kleft00sets" id="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" id=
+      "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" id=
+      "liskov98data">liskov98data</a>] B. Liskov, "Data abstraction
+      and hierarchy", SIGPLAN Notices 23, 5 (May 1998)</li>
+
+      <li>[<a name="litwin80lh" id="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="maverik_lowerbounds" id=
+      "maverik_lowerbounds">maverik_lowerbounds</a>] Maverik Woo,
+      <a href=
+      "http://magic.aladdin.cs.cmu.edu/2005/08/01/deamortization-part-2-binomial-heaps/">
+      Deamortization - Part 2: Binomial Heaps</a></li>
+
+      <li>[<a name="metrowerks_stl" id=
+      "metrowerks_stl">metrowerks_stl</a>], "Metrowerks CodeWarrior
+      Pro 7 MSL C++ Reference Manual",</li>
+
+      <li>[<a name="meyers96more" id=
+      "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" id=
+      "meyers00nonmember">meyers00nonmember</a>] S. Meyers, "How
+      Non-Member Functions Improve Encapsulation", C/C++ Users
+      Journal, 2000</li>
+
+      <li>[<a name="meyers01stl" id="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" id=
+      "meyers02both">meyers02both</a>] S. Meyers, "Class Template,
+      Member Template - or Both?", C/C++ Users Journal, 2003</li>
+
+      <li>[<a name="motwani95random" id=
+      "motwani95random">motwani95random</a>] R. Motwani, and P.
+      Raghavan, "Randomized Algorithms", Cambridge University
+      Press</li>
+
+      <li>[<a name="mscom" id="mscom">mscom</a>] <a href=
+      "http://www.microsoft.com/com">COM: Component Model Object
+      Technologies</a></li>
+
+      <li>[<a name="musser95rationale" id=
+      "musser95rationale">musser95rationale</a>], David R. Musser,
+      "Rationale for Adding Hash Tables to the C++ Standard
+      Template Library"</li>
+
+      <li>[<a name="musser96stltutorial" id=
+      "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="nelson96stlpq" id=
+      "nelson96stlpq">nelson96stlpql</a>] Mark Nelson, <a href=
+      "http://www.dogma.net/markn/articles/pq_stl/priority.htm">Priority
+      Queues and the STL</a>, Dr. Dobbs Journal, January, 1996</li>
+
+      <li>[<a name="okasaki98mereable" id=
+      "okasaki98mereable">okasaki98mereable</a>] C. Okasaki and A.
+      Gill, "Fast mergeable integer maps", In Workshop on ML, pages
+      77--86, September 1998. 95</li>
+
+      <li>[<a name="sgi_stl" id="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="select_man" id="select_man">select_man</a>]
+      <a href=
+      "http://www.scit.wlv.ac.uk/cgi-bin/mansec?3C+select"><tt>select</tt>
+      man page.</a></li>
+
+      <li>[<a name="sleator84amortized" id=
+      "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" id=
+      "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" id=
+      "stepanov94standard">stepanov94standard</a>] A. A. Stepanov
+      and M. Lee", "The Standard Template Library"</li>
+
+      <li>[<a name="stroustrup97cpp" id=
+      "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" id=
+      "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" id=
+      "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 />
+  </div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/resize_error.html b/libstdc++-v3/docs/html/ext/pb_ds/resize_error.html
new file mode 100644
index 00000000000..cb05b504fb9
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/resize_error.html
@@ -0,0 +1,50 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
+ "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+<meta name="generator" content=
+ "HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+
+<title>resize_error Interface</title>
+<meta http-equiv="Content-Type" content=
+ "text/html; charset=us-ascii" />
+</head>
+
+<body>
+<div id="page">
+<h1><tt>resize_error</tt> Interface</h1>
+
+<p>A container cannot be resized.</p>
+
+<p>Exception thrown when a size policy cannot supply an
+   adequate size for an external resize.</p>
+
+   <p>Defined in: <a href=
+		   "../../../../include/ext/pb_ds/exception.hpp"><tt>exception.hpp</tt></a></p>
+
+   <h2><a name="link1" id="link1">Base Classes</a></h2>
+
+   <table class="c1" width="100%" border="1" summary="Bases">
+   <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="exceptions.html"><span class=
+			    "c2"><tt>resize_error</tt></span></a>
+   </pre>
+   </td>
+
+   <td>
+   <p>public</p>
+   </td>
+   </tr>
+   </table>
+   </div>
+   </body>
+   </html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/resize_policy_cd.png b/libstdc++-v3/docs/html/ext/pb_ds/resize_policy_cd.png
new file mode 100644
index 00000000000..338e33c15cc
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/resize_policy_cd.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/restoring_node_invariants.png b/libstdc++-v3/docs/html/ext/pb_ds/restoring_node_invariants.png
new file mode 100644
index 00000000000..33ba84bfe33
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/restoring_node_invariants.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/sample_probe_fn.html b/libstdc++-v3/docs/html/ext/pb_ds/sample_probe_fn.html
new file mode 100644
index 00000000000..3d18650c3b3
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/sample_probe_fn.html
@@ -0,0 +1,152 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+  <meta name="generator" content=
+  "HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+
+  <title>sample_probe_fn Interface</title>
+  <meta http-equiv="Content-Type" content=
+  "text/html; charset=us-ascii" />
+  </head>
+
+<body>
+  <div id="page">
+    <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>
+
+    <p>Defined in: <a href=
+    "../../../../include/ext/pb_ds/detail/hash_fn/sample_probe_fn.hpp"><tt>sample_probe_fn.hpp</tt></a></p>
+
+    <h2><a name="link1" id="link1">Public Types and
+    Constants</a></h2>
+
+    <h3><a name="link2" id="link2">General definitions.</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Types">
+      <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_type55424436" id="size_type55424436">size_type</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+size_t, e.g.
+</pre>
+        </td>
+
+        <td>
+          <p>Size type.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h2><a name="link3" id="link3">Public Methods</a></h2>
+
+    <h3><a name="link4" id="link4">Constructors, destructor, and
+    related.</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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 constructable.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+  sample_probe_fn
+  (<b>const</b> sample_probe_fn &amp;other)
+</pre>
+        </td>
+
+        <td>
+          <p>Copy constructor.</p>
+
+          <p>Must be copy constructable.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<b>inline</b> <b>void</b>
+  swap
+  (sample_probe_fn &amp;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="link5" id="link5">Protected Methods</a></h2>
+
+    <h3><a name="link6" id="link6">Offset methods.</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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_type55424436"><tt>size_type</tt></a>
+  <b>operator</b>()
+  (const_key_reference r_key,
+    <a href=
+"#size_type55424436"><tt>size_type</tt></a> i) <b>const</b>
+</pre>
+        </td>
+
+        <td>
+          <p>Returns the <span class="c1"><tt>i</tt></span>-th
+          offset from the hash value of some key <span class=
+          "c1"><tt>r_key</tt></span>.</p>
+
+          <p><tt>size_type</tt> is the size type on which the
+          functor operates.</p>
+        </td>
+      </tr>
+    </table>
+  </div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/sample_range_hashing.html b/libstdc++-v3/docs/html/ext/pb_ds/sample_range_hashing.html
new file mode 100644
index 00000000000..5b1a90023a2
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/sample_range_hashing.html
@@ -0,0 +1,172 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+  <meta name="generator" content=
+  "HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+
+  <title>sample_range_hashing Interface</title>
+  <meta http-equiv="Content-Type" content=
+  "text/html; charset=us-ascii" />
+  </head>
+
+<body>
+  <div id="page">
+    <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>
+
+    <p>Defined in: <a href=
+    "../../../../include/ext/pb_ds/detail/hash_fn/sample_range_hashing.hpp"><tt>sample_range_hashing.hpp</tt></a></p>
+
+    <h2><a name="link1" id="link1">Public Types and
+    Constants</a></h2>
+
+    <h3><a name="link2" id="link2">General definitions.</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Types">
+      <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_type55424436" id="size_type55424436">size_type</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+size_t, e.g.
+</pre>
+        </td>
+
+        <td>
+          <p>Size type.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h2><a name="link3" id="link3">Public Methods</a></h2>
+
+    <h3><a name="link4" id="link4">Constructors, destructor, and
+    related.</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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 constructable.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+  sample_range_hashing
+  (<b>const</b> sample_range_hashing &amp;other)
+</pre>
+        </td>
+
+        <td>
+          <p>Copy constructor.</p>
+
+          <p>Must be copy constructable.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<b>inline</b> <b>void</b>
+  swap
+  (sample_range_hashing &amp;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="link5" id="link5">Protected Methods</a></h2>
+
+    <h3><a name="link6" id="link6">Notification methods.</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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_type55424436"><tt>size_type</tt></a> size)
+</pre>
+        </td>
+
+        <td>
+          <p>Notifies the policy object that the container's size
+          has changed to <span class="c1"><tt>size</tt></span>.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h3><a name="link7" id="link7">Operators.</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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_type55424436"><tt>size_type</tt></a>
+  <b>operator</b>()
+  (<a href=
+"#size_type55424436"><tt>size_type</tt></a> hash) <b>const</b>
+</pre>
+        </td>
+
+        <td>
+          <p>Transforms the hash value <span class=
+          "c1"><tt>hash</tt></span> into a ranged-hash value.</p>
+        </td>
+      </tr>
+    </table>
+  </div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/sample_ranged_hash_fn.html b/libstdc++-v3/docs/html/ext/pb_ds/sample_ranged_hash_fn.html
new file mode 100644
index 00000000000..f8e47ab64c2
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/sample_ranged_hash_fn.html
@@ -0,0 +1,171 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+  <meta name="generator" content=
+  "HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+
+  <title>sample_ranged_hash_fn Interface</title>
+  <meta http-equiv="Content-Type" content=
+  "text/html; charset=us-ascii" />
+  </head>
+
+<body>
+  <div id="page">
+    <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>
+
+    <p>Defined in: <a href=
+    "../../../../include/ext/pb_ds/detail/hash_fn/sample_ranged_hash_fn.hpp"><tt>sample_ranged_hash_fn.hpp</tt></a></p>
+
+    <h2><a name="link1" id="link1">Public Types and
+    Constants</a></h2>
+
+    <h3><a name="link2" id="link2">General definitions.</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Types">
+      <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_type55424436" id="size_type55424436">size_type</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+size_t, e.g.
+</pre>
+        </td>
+
+        <td>
+          <p>Size type.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h2><a name="link3" id="link3">Public Methods</a></h2>
+
+    <h3><a name="link4" id="link4">Constructors, destructor, and
+    related.</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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 constructable.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+  sample_ranged_hash_fn
+  (<b>const</b> sample_ranged_hash_fn &amp;other)
+</pre>
+        </td>
+
+        <td>
+          <p>Copy constructor.</p>
+
+          <p>Must be copy constructable.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<b>inline</b> <b>void</b>
+  swap
+  (sample_ranged_hash_fn &amp;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="link5" id="link5">Protected Methods</a></h2>
+
+    <h3><a name="link6" id="link6">Notification methods.</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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_type55424436"><tt>size_type</tt></a> size)
+</pre>
+        </td>
+
+        <td>
+          <p>Notifies the policy object that the container's size
+          has changed to <span class="c1"><tt>size</tt></span>.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h3><a name="link7" id="link7">Operators.</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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_type55424436"><tt>size_type</tt></a> 
+  <b>operator</b>()
+  (const_key_reference r_key) <b>const</b>
+</pre>
+        </td>
+
+        <td>
+          <p>Transforms <span class="c1"><tt>r_key</tt></span> into
+          a position within the table.</p>
+        </td>
+      </tr>
+    </table>
+  </div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/sample_ranged_probe_fn.html b/libstdc++-v3/docs/html/ext/pb_ds/sample_ranged_probe_fn.html
new file mode 100644
index 00000000000..b0e744cd331
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/sample_ranged_probe_fn.html
@@ -0,0 +1,178 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+  <meta name="generator" content=
+  "HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+
+  <title>sample_ranged_probe_fn Interface</title>
+  <meta http-equiv="Content-Type" content=
+  "text/html; charset=us-ascii" />
+  </head>
+
+<body>
+  <div id="page">
+    <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>
+
+    <p>Defined in: <a href=
+    "../../../../include/ext/pb_ds/detail/hash_fn/sample_ranged_probe_fn.hpp"><tt>sample_ranged_probe_fn.hpp</tt></a></p>
+
+    <h2><a name="link1" id="link1">Public Types and
+    Constants</a></h2>
+
+    <h3><a name="link2" id="link2">General definitions.</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Types">
+      <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_type55424436" id="size_type55424436">size_type</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+size_t, e.g.
+</pre>
+        </td>
+
+        <td>
+          <p>Size type.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h2><a name="link3" id="link3">Public Methods</a></h2>
+
+    <h3><a name="link4" id="link4">Constructors, destructor, and
+    related.</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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 constructable.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+  sample_ranged_probe_fn
+  (<b>const</b> sample_ranged_probe_fn &amp;other)
+</pre>
+        </td>
+
+        <td>
+          <p>Copy constructor.</p>
+
+          <p>Must be copy constructable.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<b>inline</b> <b>void</b>
+  swap
+  (sample_ranged_probe_fn &amp;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="link5" id="link5">Protected Methods</a></h2>
+
+    <h3><a name="link6" id="link6">Notification methods.</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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_type55424436"><tt>size_type</tt></a> size)
+</pre>
+        </td>
+
+        <td>
+          <p>Notifies the policy object that the container's size
+          has changed to <span class="c1"><tt>size</tt></span>.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h3><a name="link7" id="link7">Operators.</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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_type55424436"><tt>size_type</tt></a> 
+  <b>operator</b>()
+  (const_key_reference r_key,
+    size_t hash,
+    <a href=
+"#size_type55424436"><tt>size_type</tt></a> i) <b>const</b>
+</pre>
+        </td>
+
+        <td>
+          <p>Transforms the <tt><b>const</b></tt> key reference
+          <span class="c1"><tt>r_key</tt></span> <span class=
+          "c1"><tt>into the </tt></span><span class=
+          "c1"><tt>i-th </tt></span>position within the table. This
+          method <span class="c1"><tt>i</tt></span>s called for
+          each collision within the probe sequence.</p>
+        </td>
+      </tr>
+    </table>
+  </div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/sample_resize_policy.html b/libstdc++-v3/docs/html/ext/pb_ds/sample_resize_policy.html
new file mode 100644
index 00000000000..7807ace1daa
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/sample_resize_policy.html
@@ -0,0 +1,413 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+  <meta name="generator" content=
+  "HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+
+  <title>sample_resize_policy Interface</title>
+  <meta http-equiv="Content-Type" content=
+  "text/html; charset=us-ascii" />
+  </head>
+
+<body>
+  <div id="page">
+    <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>
+
+    <p>Defined in: <a href=
+    "../../../../include/ext/pb_ds/detail/resize_policy/sample_resize_policy.hpp"><tt>sample_resize_policy.hpp</tt></a></p>
+
+    <h2><a name="link1" id="link1">Public Types and
+    Constants</a></h2>
+
+    <h3><a name="link2" id="link2">General definitions.</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Types">
+      <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_type55424436" id="size_type55424436">size_type</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+size_t, e.g.
+</pre>
+        </td>
+
+        <td>
+          <p>Size type.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h2><a name="link3" id="link3">Public Methods</a></h2>
+
+    <h3><a name="link4" id="link4">Constructors, destructor, and
+    related.</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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 constructable.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+  sample_range_hashing
+  (<b>const</b> sample_resize_policy &amp;other)
+</pre>
+        </td>
+
+        <td>
+          <p>Copy constructor.</p>
+
+          <p>Must be copy constructable.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<b>inline</b> <b>void</b>
+  swap
+  (sample_resize_policy &amp;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="link5" id="link5">Protected Methods</a></h2>
+
+    <h3><a name="link6" id="link6">Insert search
+    notifications.</a></h3>
+
+    <p>Notifications called during an insert operation.</p>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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>
+
+    <h3><a name="link7" id="link7">Find search
+    notifications.</a></h3>
+
+    <p>Notifications called during a find operation.</p>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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>
+
+    <h3><a name="link8" id="link8">Erase search
+    notifications.</a></h3>
+
+    <p>Notifications called during an insert operation.</p>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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>
+
+    <h3><a name="link9" id="link9">Content change
+    notifications.</a></h3>
+
+    <p>Notifications called when the content of the table changes
+    in a way that can affect the resize policy.</p>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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_type55424436"><tt>size_type</tt></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_type55424436"><tt>size_type</tt></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>
+
+    <h3><a name="link10" id="link10">Size change
+    notifications.</a></h3>
+
+    <p>Notifications called when the table changes size.</p>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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_type55424436"><tt>size_type</tt></a> new_size)
+</pre>
+        </td>
+
+        <td>
+          <p>Notifies the table was resized to <span class=
+          "c1"><tt>new_size</tt></span>.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h3><a name="link11" id="link11">Queries.</a></h3>
+
+    <p>Called to query whether/how to resize.</p>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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>
+<a href="#size_type55424436"><tt>size_type</tt></a>
+  get_new_size
+  (<a href="#size_type55424436"><tt>size_type</tt></a> size, 
+    <a href=
+"#size_type55424436"><tt>size_type</tt></a> num_used_e) <b>const</b>
+</pre>
+        </td>
+
+        <td>
+          <p>Queries what the new <span class=
+          "c1"><tt>size</tt></span> should be.</p>
+        </td>
+      </tr>
+    </table>
+  </div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/sample_resize_trigger.html b/libstdc++-v3/docs/html/ext/pb_ds/sample_resize_trigger.html
new file mode 100644
index 00000000000..d7042bc2c23
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/sample_resize_trigger.html
@@ -0,0 +1,462 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+  <meta name="generator" content=
+  "HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+
+  <title>sample_resize_trigger Interface</title>
+  <meta http-equiv="Content-Type" content=
+  "text/html; charset=us-ascii" />
+  </head>
+
+<body>
+  <div id="page">
+    <h1><tt>sample_resize_trigger</tt> Interface</h1>
+
+    <p>A sample resize trigger policy.</p>
+
+    <p>This class serves to show the interface a trigger policy
+    needs to support.</p>
+
+    <p>Defined in: <a href=
+    "../../../../include/ext/pb_ds/detail/resize_policy/sample_resize_trigger.hpp"><tt>
+    sample_resize_trigger.hpp</tt></a></p>
+
+    <h2><a name="link1" id="link1">Public Types and
+    Constants</a></h2>
+
+    <h3><a name="link2" id="link2">General definitions.</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Types">
+      <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_type55424436" id="size_type55424436">size_type</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+size_t, e.g.
+</pre>
+        </td>
+
+        <td>
+          <p>Size type.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h2><a name="link3" id="link3">Public Methods</a></h2>
+
+    <h3><a name="link4" id="link4">Constructors, destructor, and
+    related.</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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_trigger
+  ()
+</pre>
+        </td>
+
+        <td>
+          <p>Default constructor.</p>
+
+          <p>Must be default constructable.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+  sample_range_hashing
+  (<b>const</b> sample_resize_trigger &amp;other)
+</pre>
+        </td>
+
+        <td>
+          <p>Copy constructor.</p>
+
+          <p>Must be copy constructable.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<b>inline</b> <b>void</b>
+  swap
+  (sample_resize_trigger &amp;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="link5" id="link5">Protected Methods</a></h2>
+
+    <h3><a name="link6" id="link6">Insert search
+    notifications.</a></h3>
+
+    <p>Notifications called during an insert operation.</p>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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>
+
+    <h3><a name="link7" id="link7">Find search
+    notifications.</a></h3>
+
+    <p>Notifications called during a find operation.</p>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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>
+
+    <h3><a name="link8" id="link8">Erase search
+    notifications.</a></h3>
+
+    <p>Notifications called during an insert operation.</p>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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>
+
+    <h3><a name="link9" id="link9">Content change
+    notifications.</a></h3>
+
+    <p>Notifications called when the content of the table changes
+    in a way that can affect the resize policy.</p>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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_type55424436"><tt>size_type</tt></a> num_entries)
+</pre>
+        </td>
+
+        <td>
+          <p>Notifies an element was inserted. the total number of
+          entries in the table is <span class=
+          "c1"><tt>num_entries</tt></span>.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<b>inline</b> <b>void</b>
+  notify_erased
+  (<a href="#size_type55424436"><tt>size_type</tt></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>
+
+    <h3><a name="link10" id="link10">Size change
+    notifications.</a></h3>
+
+    <p>Notifications called when the table changes size.</p>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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_type55424436"><tt>size_type</tt></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_type55424436"><tt>size_type</tt></a> new_size)
+</pre>
+        </td>
+
+        <td>
+          <p>Notifies the table was resized externally.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h3><a name="link11" id="link11">Queries.</a></h3>
+
+    <p>Called to query whether/how to resize.</p>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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_type55424436"><tt>size_type</tt></a> size, 
+    <a href=
+"#size_type55424436"><tt>size_type</tt></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 <span class=
+          "c1"><tt>size</tt></span> of the table is <span class=
+          "c1"><tt>size</tt></span>, and the number of entries in
+          it is <span class="c1"><tt>num_entries</tt></span>.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h2><a name="link12" id="link12">Private Methods</a></h2>
+
+    <h3><a name="link13" id="link13">Overrides.</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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
+  (<a href="#size_type55424436"><tt>size_type</tt></a> new_size)
+</pre>
+        </td>
+
+        <td>
+          <p>Resizes to <span class=
+          "c1"><tt>new_size</tt></span>.</p>
+        </td>
+      </tr>
+    </table>
+  </div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/sample_size_policy.html b/libstdc++-v3/docs/html/ext/pb_ds/sample_size_policy.html
new file mode 100644
index 00000000000..e7f58e7e4c4
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/sample_size_policy.html
@@ -0,0 +1,163 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+  <meta name="generator" content=
+  "HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+
+  <title>sample_size_policy Interface</title>
+  <meta http-equiv="Content-Type" content=
+  "text/html; charset=us-ascii" />
+  </head>
+
+<body>
+  <div id="page">
+    <h1><tt>sample_size_policy</tt> Interface</h1>
+
+    <p>A sample size policy.</p>
+
+    <p>This class serves to show the interface a size policy needs
+    to support.</p>
+
+    <p>Defined in: <a href=
+    "../../../../include/ext/pb_ds/detail/resize_policy/sample_size_policy.hpp"><tt>sample_size_policy.hpp</tt></a></p>
+
+    <h2><a name="link1" id="link1">Public Types and
+    Constants</a></h2>
+
+    <h3><a name="link2" id="link2">General definitions.</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Types">
+      <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_type55424436" id="size_type55424436">size_type</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+size_t, e.g.
+</pre>
+        </td>
+
+        <td>
+          <p>Size type.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h2><a name="link3" id="link3">Public Methods</a></h2>
+
+    <h3><a name="link4" id="link4">Constructors, destructor, and
+    related.</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <tr>
+        <td width="45%" align="left"><b>Method</b></td>
+
+        <td width="55%" align="left"><b>Description</b></td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+  sample_size_policy
+  ()
+</pre>
+        </td>
+
+        <td>
+          <p>Default constructor.</p>
+
+          <p>Must be default constructable.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+  sample_range_hashing
+  (<b>const</b> sample_size_policy &amp;other)
+</pre>
+        </td>
+
+        <td>
+          <p>Copy constructor.</p>
+
+          <p>Must be copy constructable.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<b>inline</b> <b>void</b>
+  swap
+  (sample_size_policy &amp;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="link5" id="link5">Protected Methods</a></h2>
+
+    <h3><a name="link6" id="link6">Size methods</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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_type55424436"><tt>size_type</tt></a>
+  get_nearest_larger_size
+  (<a href=
+"#size_type55424436"><tt>size_type</tt></a> size) <b>const</b>
+</pre>
+        </td>
+
+        <td>
+          <p>Given a size <span class="c1"><tt>size</tt></span>,
+          returns a size that is larger.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<b>inline</b> <a href="#size_type55424436"><tt>size_type</tt></a>
+  get_nearest_smaller_size
+  (<a href=
+"#size_type55424436"><tt>size_type</tt></a> size) <b>const</b>
+</pre>
+        </td>
+
+        <td>
+          <p>Given a size <span class="c1"><tt>size</tt></span>,
+          returns a size that is smaller.</p>
+        </td>
+      </tr>
+    </table>
+  </div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/sample_tree_node_update.html b/libstdc++-v3/docs/html/ext/pb_ds/sample_tree_node_update.html
new file mode 100644
index 00000000000..2cfab0a24f3
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/sample_tree_node_update.html
@@ -0,0 +1,193 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+  <meta name="generator" content=
+  "HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+
+  <title>sample_tree_node_update Interface</title>
+  <meta http-equiv="Content-Type" content=
+  "text/html; charset=us-ascii" />
+  </head>
+
+<body>
+  <div id="page">
+    <h1><tt>sample_tree_node_update</tt> Interface</h1>
+
+    <p>A sample node updater.</p>
+
+    <p>This class serves to show the interface a node update
+    functor needs to support.</p>
+
+    <p>Defined in: <a href=
+    "../../../../include/ext/pb_ds/detail/tree_policy/sample_tree_node_update.hpp"><tt>
+    sample_tree_node_update.hpp</tt></a></p>
+
+    <h2><a name="link1" id="link1">Template Parameters</a></h2>
+
+    <table class="c1" width="100%" border="1" summary=
+    "Template Parameters">
+      <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_Node_Iterator1933878761" id=
+"Const_Node_Iterator1933878761"><b>class</b> Const_Node_Iterator</a>
+</pre>
+        </td>
+
+        <td>
+          <p>Const node iterator type.</p>
+        </td>
+
+        <td>-</td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="Node_Iterator4206909839" id=
+"Node_Iterator4206909839"><b>class</b> Node_Iterator</a>
+</pre>
+        </td>
+
+        <td>
+          <p>Node iterator type.</p>
+        </td>
+
+        <td>-</td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="Cmp_Fn294335" id="Cmp_Fn294335"><b>class</b> Cmp_Fn</a>
+</pre>
+        </td>
+
+        <td>
+          <p>Comparison functor.</p>
+        </td>
+
+        <td>-</td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="Allocator35940069" id=
+"Allocator35940069"><b>class</b> Allocator</a>
+</pre>
+        </td>
+
+        <td>
+          <p>Allocator type.</p>
+        </td>
+
+        <td>-</td>
+      </tr>
+    </table>
+
+    <h2><a name="link2" id="link2">Public Types and
+    Constants</a></h2>
+
+    <h3><a name="link3" id="link3">Metadata definitions.</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Types">
+      <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_type2849297114" id=
+"metadata_type2849297114">metadata_type</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+size_t
+</pre>
+        </td>
+
+        <td>
+          <p>Metadata type.</p>
+
+          <p>This can be any type; size_t is merely an example.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h2><a name="link4" id="link4">Protected Methods</a></h2>
+
+    <h3><a name="link5" id="link5">Conclassors, declassor, and
+    related.</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <tr>
+        <td width="45%" align="left"><b>Method</b></td>
+
+        <td width="55%" align="left"><b>Description</b></td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+  sample_tree_node_update
+  ()
+</pre>
+        </td>
+
+        <td>
+          <p>Default constructor.</p>
+
+          <p>Must be default constructable.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h3><a name="link6" id="link6">Operators.</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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>
+  <b>operator</b>()
+  (node_iterator node_it,
+    const_node_iterator end_nd_it) <b>const</b>
+</pre>
+        </td>
+
+        <td>
+          <p>Updates the rank of a node through a <span class=
+          "c1"><tt>node_iterator</tt></span> <span class=
+          "c1"><tt>node_it</tt></span>; <span class=
+          "c1"><tt>end_nd_it</tt></span> is the end node
+          iterator.</p>
+        </td>
+      </tr>
+    </table>
+  </div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/sample_trie_e_access_traits.html b/libstdc++-v3/docs/html/ext/pb_ds/sample_trie_e_access_traits.html
new file mode 100644
index 00000000000..b663e508758
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/sample_trie_e_access_traits.html
@@ -0,0 +1,231 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+  <meta name="generator" content=
+  "HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+
+  <title>sample_trie_e_access_traits Interface</title>
+  <meta http-equiv="Content-Type" content=
+  "text/html; charset=us-ascii" />
+  </head>
+
+<body>
+  <div id="page">
+    <h1><tt>sample_trie_e_access_traits</tt> Interface</h1>
+
+    <p>A sample trie element-access traits.</p>
+
+    <p>This class serves to show the interface an element- access
+    traits class needs to support.</p>
+
+    <p>Defined in: <a href=
+    "../../../../include/ext/pb_ds/detail/trie_policy/sample_trie_e_access_traits.hpp">
+    <tt>sample_trie_e_access_traits.hpp</tt></a></p>
+
+    <h2><a name="link1" id="link1">Public Types and
+    Constants</a></h2>
+
+    <h3><a name="link2" id="link2">General definitions.</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Types">
+      <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_type55424436" id="size_type55424436">size_type</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+size_t, e.g.
+</pre>
+        </td>
+
+        <td>
+          <p>Size type.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="key_type10393186" id="key_type10393186">key_type</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+std::string, e.g.
+</pre>
+        </td>
+
+        <td>
+          <p>Key type.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="const_key_reference3185471705" id=
+"const_key_reference3185471705">const_key_reference</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+const string &amp;, e.g.
+</pre>
+        </td>
+
+        <td>
+          <p>Const key reference type.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h3><a name="link3" id="link3">Element definitions.</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Types">
+      <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_iterator98626788" id=
+"const_iterator98626788">const_iterator</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+string::const_iterator, e.g.
+</pre>
+        </td>
+
+        <td>
+          <p>Element <tt><b>const</b></tt> iterator type.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="e_type393186" id="e_type393186">e_type</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+char, e.g.
+</pre>
+        </td>
+
+        <td>
+          <p>Element type.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="max_size10483336" id="max_size10483336">max_size</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+4, e.g.
+</pre>
+        </td>
+
+        <td>
+          <p>Number of distinct elements.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h2><a name="link4" id="link4">Public Methods</a></h2>
+
+    <h3><a name="link5" id="link5">Access methods.</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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>static</b> <a href=
+"#const_iterator98626788"><tt>const_iterator</tt></a>
+  begin
+  (<a href=
+"#const_key_reference3185471705"><tt>const_key_reference</tt></a> r_key)
+</pre>
+        </td>
+
+        <td>
+          <p>Returns a <a href=
+          "#const_iterator98626788"><tt>const_iterator</tt></a> to
+          the first element of <span class=
+          "c1"><tt>r_key</tt></span>.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<b>inline</b> <b>static</b> <a href=
+"#const_iterator98626788"><tt>const_iterator</tt></a>
+  end
+  (<a href=
+"#const_key_reference3185471705"><tt>const_key_reference</tt></a> r_key)
+</pre>
+        </td>
+
+        <td>
+          <p>Returns a <a href=
+          "#const_iterator98626788"><tt>const_iterator</tt></a> to
+          the after-last element of <span class=
+          "c1"><tt>r_key</tt></span>.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<b>inline</b> <b>static</b> <a href=
+"#size_type55424436"><tt>size_type</tt></a>
+  e_pos
+  (<a href="#e_type393186"><tt>e_type</tt></a> e)
+</pre>
+        </td>
+
+        <td>
+          <p>Maps an <span class="c1"><tt>element</tt></span> to a
+          position.</p>
+        </td>
+      </tr>
+    </table>
+  </div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/sample_trie_node_update.html b/libstdc++-v3/docs/html/ext/pb_ds/sample_trie_node_update.html
new file mode 100644
index 00000000000..beab37cd9cd
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/sample_trie_node_update.html
@@ -0,0 +1,194 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+  <meta name="generator" content=
+  "HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+
+  <title>sample_trie_node_update Interface</title>
+  <meta http-equiv="Content-Type" content=
+  "text/html; charset=us-ascii" />
+  </head>
+
+<body>
+  <div id="page">
+    <h1><tt>sample_trie_node_update</tt> Interface</h1>
+
+    <p>A sample node updater.</p>
+
+    <p>This class serves to show the interface a node update
+    functor needs to support.</p>
+
+    <p>Defined in: <a href=
+    "../../../../include/ext/pb_ds/detail/trie_policy/sample_trie_node_update.hpp"><tt>
+    sample_trie_node_update.hpp</tt></a></p>
+
+    <h2><a name="link1" id="link1">Template Parameters</a></h2>
+
+    <table class="c1" width="100%" border="1" summary=
+    "Template Parameters">
+      <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_Node_Iterator1933878761" id=
+"Const_Node_Iterator1933878761"><b>class</b> Const_Node_Iterator</a>
+</pre>
+        </td>
+
+        <td>
+          <p>Const node iterator type.</p>
+        </td>
+
+        <td>-</td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="Node_Iterator4206909839" id=
+"Node_Iterator4206909839"><b>class</b> Node_Iterator</a>
+</pre>
+        </td>
+
+        <td>
+          <p>Node iterator type.</p>
+        </td>
+
+        <td>-</td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="E_Access_Traits686553840" id=
+"E_Access_Traits686553840"><b>class</b> E_Access_Traits</a>
+</pre>
+        </td>
+
+        <td>
+          <p>Comparison functor.</p>
+        </td>
+
+        <td>-</td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="Allocator35940069" id=
+"Allocator35940069"><b>class</b> Allocator</a>
+</pre>
+        </td>
+
+        <td>
+          <p>Allocator type.</p>
+        </td>
+
+        <td>-</td>
+      </tr>
+    </table>
+
+    <h2><a name="link2" id="link2">Public Types and
+    Constants</a></h2>
+
+    <h3><a name="link3" id="link3">Metadata definitions.</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Types">
+      <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_type2849297114" id=
+"metadata_type2849297114">metadata_type</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+size_t
+</pre>
+        </td>
+
+        <td>
+          <p>Metadata type.</p>
+
+          <p>This can be any type; size_t is merely an example.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h2><a name="link4" id="link4">Protected Methods</a></h2>
+
+    <h3><a name="link5" id="link5">Conclassors, declassor, and
+    related.</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <tr>
+        <td width="45%" align="left"><b>Method</b></td>
+
+        <td width="55%" align="left"><b>Description</b></td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+  sample_trie_node_update
+  ()
+</pre>
+        </td>
+
+        <td>
+          <p>Default constructor.</p>
+
+          <p>Must be default constructable.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h3><a name="link6" id="link6">Operators.</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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>
+  <b>operator</b>()
+  (node_iterator node_it,
+    const_node_iterator end_nd_it) <b>const</b>
+</pre>
+        </td>
+
+        <td>
+          <p>Updates the rank of a node through a <span class=
+          "c1"><tt>node_iterator</tt></span> <span class=
+          "c1"><tt>node_it</tt></span>; <span class=
+          "c1"><tt>end_nd_it</tt></span> is the end node
+          iterator.</p>
+        </td>
+      </tr>
+    </table>
+  </div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/sample_update_policy.html b/libstdc++-v3/docs/html/ext/pb_ds/sample_update_policy.html
new file mode 100644
index 00000000000..f671bcdc25a
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/sample_update_policy.html
@@ -0,0 +1,178 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+  <meta name="generator" content=
+  "HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+
+  <title>sample_update_policy Interface</title>
+  <meta http-equiv="Content-Type" content=
+  "text/html; charset=us-ascii" />
+  </head>
+
+<body>
+  <div id="page">
+    <h1><tt>sample_update_policy</tt> Interface</h1>
+
+    <p>A sample list-update policy.</p>
+
+    <p>This class serves to show the interface a list update
+    functor needs to support.</p>
+
+    <p>Defined in: <a href=
+    "../../../../include/ext/pb_ds/detail/list_update_policy/sample_update_policy.hpp"><tt>sample_update_policy.hpp</tt></a></p>
+
+    <h2><a name="link1" id="link1">Public Methods</a></h2>
+
+    <h3><a name="link2" id="link2">Constructors, destructor, and
+    related.</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <tr>
+        <td width="45%" align="left"><b>Method</b></td>
+
+        <td width="55%" align="left"><b>Description</b></td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+  sample_update_policy
+  ()
+</pre>
+        </td>
+
+        <td>
+          <p>Default constructor.</p>
+
+          <p>Must be default constructable.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+  sample_update_policy
+  (<b>const</b> sample_update_policy &amp;other)
+</pre>
+        </td>
+
+        <td>
+          <p>Copy constructor.</p>
+
+          <p>Must be copy constructable.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<b>inline</b> <b>void</b>
+  swap
+  (sample_update_policy &amp;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="link3" id="link3">Protected Types and
+    Constants</a></h2>
+
+    <h3><a name="link4" id="link4">Metadata definitions.</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Types">
+      <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_type2849297114" id=
+"metadata_type2849297114">metadata_type</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+Some metadata type.
+</pre>
+        </td>
+
+        <td>
+          <p>Metadata on which this functor operates.</p>
+
+          <p>The <tt><b>class</b></tt> must declare the metadata
+          type on which it operates; the list-update based
+          containers will append to each node an object of this
+          type.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h2><a name="link5" id="link5">Protected Methods</a></h2>
+
+    <h3><a name="link6" id="link6">Metadata operations.</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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_type2849297114"><tt>metadata_type</tt></a>
+  <b>operator</b>()
+  () <b>const</b>
+</pre>
+        </td>
+
+        <td>
+          <p>Creates a metadata object.</p>
+
+          <p>A list-update based container object will call this
+          method to create a metadata type when a node is
+          created.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<b>bool</b> 
+  <b>operator</b>()
+  (metadata_reference r_data) <b>const</b>
+</pre>
+        </td>
+
+        <td>
+          <p>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 should return
+          <tt><b>true</b></tt> if the node should be moved to the
+          front of the list.</p>
+
+          <p><tt>metadata_reference</tt> is a reference to a
+          <a href=
+          "#metadata_type2849297114"><tt>metadata_type</tt></a>.</p>
+        </td>
+      </tr>
+    </table>
+  </div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/simple_list.png b/libstdc++-v3/docs/html/ext/pb_ds/simple_list.png
new file mode 100644
index 00000000000..9a05d3f5e4f
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/simple_list.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/splay_tree_tag.html b/libstdc++-v3/docs/html/ext/pb_ds/splay_tree_tag.html
new file mode 100644
index 00000000000..98c56ce695f
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/splay_tree_tag.html
@@ -0,0 +1,47 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+  <meta name="generator" content=
+  "HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+
+  <title>splay_tree_tag Interface</title>
+  <meta http-equiv="Content-Type" content=
+  "text/html; charset=us-ascii" />
+  </head>
+
+<body>
+  <div id="page">
+    <h1><tt>splay_tree_tag</tt> Interface</h1>
+
+    <p>Splay tree data structure tag.</p>
+
+    <p>Defined in: <a href=
+    "../../../../include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
+
+    <h2><a name="link1" id="link1">Base Classes</a></h2>
+
+    <table class="c1" width="100%" border="1" summary="Bases">
+      <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="tree_tag.html"><span class=
+"c2"><tt>tree_tag</tt></span></a>
+</pre>
+        </td>
+
+        <td>
+          <p>public</p>
+        </td>
+      </tr>
+    </table>
+  </div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/string_trie_e_access_traits.html b/libstdc++-v3/docs/html/ext/pb_ds/string_trie_e_access_traits.html
new file mode 100644
index 00000000000..19dbedb588d
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/string_trie_e_access_traits.html
@@ -0,0 +1,400 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+  <meta name="generator" content=
+  "HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+
+  <title>string_trie_e_access_traits Interface</title>
+  <meta http-equiv="Content-Type" content=
+  "text/html; charset=us-ascii" />
+  </head>
+
+<body>
+  <div id="page">
+    <h1><tt>string_trie_e_access_traits</tt> Interface</h1>
+
+    <p>Element access traits for string types.</p>
+
+    <p>Defined in: <a href=
+    "../../../../include/ext/pb_ds/trie_policy.hpp"><tt>trie_policy.hpp</tt></a></p>
+
+    <h2><a name="link1" id="link1">Template Parameters</a></h2>
+
+    <table class="c1" width="100%" border="1" summary=
+    "Template Parameters">
+      <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="String349403" id="String349403"><b>class</b> String </a>
+</pre>
+        </td>
+
+        <td>
+          <p>String type.</p>
+        </td>
+
+        <td><tt>std::string</tt></td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="Min_E_Val40354618" id=
+"Min_E_Val40354618"><b>typename</b> </a><a href=
+"#String349403"><tt>String</tt></a>::value_type Min_E_Val 
+</pre>
+        </td>
+
+        <td>
+          <p>Minimal element.</p>
+        </td>
+
+        <td><tt>SCHAR_MIN</tt></td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="Max_E_Val39885868" id=
+"Max_E_Val39885868"><b>typename</b> </a><a href=
+"#String349403"><tt>String</tt></a>::value_type Max_E_Val 
+</pre>
+        </td>
+
+        <td>
+          <p>Maximal element.</p>
+        </td>
+
+        <td><tt>SCHAR_MAX</tt></td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="Reverse1686776" id=
+"Reverse1686776"><b>bool</b> Reverse </a>
+</pre>
+        </td>
+
+        <td>
+          <p>Indicates whether reverse iteration should be
+          used.</p>
+        </td>
+
+        <td><tt><b>false</b></tt></td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="Allocator35940069" id=
+"Allocator35940069"><b>class</b> 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" id="link2">Public Types and
+    Constants</a></h2>
+
+    <h3><a name="link3" id="link3">General Definitions</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Types">
+      <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_type55424436" id="size_type55424436">size_type</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<b>typename</b> <a href=
+"#Allocator35940069"><tt>Allocator</tt></a>::size_type
+</pre>
+        </td>
+
+        <td>
+          <p>Size type.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h3><a name="link4" id="link4">Key-Type Definitions</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Types">
+      <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_type10393186" id="key_type10393186">key_type</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<a href="#String349403"><tt>String</tt></a>
+</pre>
+        </td>
+
+        <td>
+          <p>Key type.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="const_key_reference3185471705" id=
+"const_key_reference3185471705">const_key_reference</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<b>typename</b> <a href=
+"#Allocator35940069"><tt>Allocator</tt></a>::<b>template</b> rebind&lt;
+    <a href=
+"#key_type10393186"><tt>key_type</tt></a>&gt;::other::const_reference
+</pre>
+        </td>
+
+        <td>
+          <p>Const key reference type.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h3><a name="link5" id="link5">Element-Type
+    Definitions</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Types">
+      <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="reverse2186776" id="reverse2186776">reverse</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<a href="#Reverse1686776"><tt>Reverse</tt></a>
+</pre>
+        </td>
+
+        <td>
+          <p><a href="#Reverse1686776"><tt>Reverse</tt></a>
+          iteration indicator.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="const_iterator98626788" id=
+"const_iterator98626788">const_iterator</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<b>typename</b> pb_ds::detail::conditional_type&lt;
+    <a href="#Reverse1686776"><tt>Reverse</tt></a>,
+    <b>typename</b> <a href=
+"#String349403"><tt>String</tt></a>::const_reverse_iterator,
+    <b>typename</b> <a href=
+"#String349403"><tt>String</tt></a>::const_iterator&gt;::type
+</pre>
+        </td>
+
+        <td>
+          <p>Element <tt><b>const</b></tt> iterator type.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="e_type393186" id="e_type393186">e_type</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<b>typename</b> std::iterator_traits&lt;<a href=
+"#const_iterator98626788"><tt>const_iterator</tt></a>&gt;::value_type
+</pre>
+        </td>
+
+        <td>
+          <p>Element type.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="min_e_val52875418" id="min_e_val52875418">min_e_val</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<a href="#Min_E_Val40354618"><tt>Min_E_Val</tt></a>
+</pre>
+        </td>
+
+        <td>
+          <p>Minimal element.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="max_e_val52406668" id="max_e_val52406668">max_e_val</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<a href="#Max_E_Val39885868"><tt>Max_E_Val</tt></a>
+</pre>
+        </td>
+
+        <td>
+          <p>Maximal element.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="max_size10483336" id="max_size10483336">max_size</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<a href="#max_e_val52406668"><tt>max_e_val</tt></a> - <a href=
+"#min_e_val52875418"><tt>min_e_val</tt></a> + 1
+</pre>
+        </td>
+
+        <td>
+          <p>Number of distinct elements.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h2><a name="link6" id="link6">Public Methods</a></h2>
+
+    <h3><a name="link7" id="link7">Access Methods</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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>static</b> <a href=
+"#const_iterator98626788"><tt>const_iterator</tt></a>
+  begin
+  (<a href=
+"#const_key_reference3185471705"><tt>const_key_reference</tt></a> r_key)
+</pre>
+        </td>
+
+        <td>
+          <p>Returns a <a href=
+          "#const_iterator98626788"><tt>const_iterator</tt></a> to
+          the first element of <span class=
+          "c1"><tt>r_key</tt></span>.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<b>inline</b> <b>static</b> <a href=
+"#const_iterator98626788"><tt>const_iterator</tt></a>
+  end
+  (<a href=
+"#const_key_reference3185471705"><tt>const_key_reference</tt></a> r_key)
+</pre>
+        </td>
+
+        <td>
+          <p>Returns a <a href=
+          "#const_iterator98626788"><tt>const_iterator</tt></a> to
+          the after-last element of <span class=
+          "c1"><tt>r_key</tt></span>.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<b>inline</b> <b>static</b> <a href=
+"#size_type55424436"><tt>size_type</tt></a>
+  e_pos
+  (<a href="#e_type393186"><tt>e_type</tt></a> e)
+</pre>
+        </td>
+
+        <td>
+          <p>Maps an <span class="c1"><tt>e</tt></span>element to a
+          position.</p>
+        </td>
+      </tr>
+    </table>
+  </div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/tests.html b/libstdc++-v3/docs/html/ext/pb_ds/tests.html
new file mode 100644
index 00000000000..ab5d54bb4ff
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/tests.html
@@ -0,0 +1,24 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+  <meta name="generator" content=
+  "HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+
+  <title>Tests</title>
+  <meta http-equiv="Content-Type" content=
+  "text/html; charset=us-ascii" />
+  </head>
+
+<body>
+  <div id="page">
+    <h1>Tests</h1>
+
+    <p><a href="assoc_tests.html">Associative-Container Tests</a>
+    describes tests for associative containers; <a href=
+    "pq_tests.html">Priority-Queue Tests</a> describes tests for
+    priority queues.</p>
+  </div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/text_find_timing_test_hash_gcc.png b/libstdc++-v3/docs/html/ext/pb_ds/text_find_timing_test_hash_gcc.png
new file mode 100644
index 00000000000..59247ec6ad9
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/text_find_timing_test_hash_gcc.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/text_find_timing_test_hash_local.png b/libstdc++-v3/docs/html/ext/pb_ds/text_find_timing_test_hash_local.png
new file mode 100644
index 00000000000..d85980f30fb
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/text_find_timing_test_hash_local.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/text_find_timing_test_hash_msvc.png b/libstdc++-v3/docs/html/ext/pb_ds/text_find_timing_test_hash_msvc.png
new file mode 100644
index 00000000000..227164568f5
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/text_find_timing_test_hash_msvc.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/text_find_timing_test_tree_like_gcc.png b/libstdc++-v3/docs/html/ext/pb_ds/text_find_timing_test_tree_like_gcc.png
new file mode 100644
index 00000000000..8b6c4f0f058
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/text_find_timing_test_tree_like_gcc.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/text_find_timing_test_tree_like_local.png b/libstdc++-v3/docs/html/ext/pb_ds/text_find_timing_test_tree_like_local.png
new file mode 100644
index 00000000000..b7fdc474644
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/text_find_timing_test_tree_like_local.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/text_find_timing_test_tree_like_msvc.png b/libstdc++-v3/docs/html/ext/pb_ds/text_find_timing_test_tree_like_msvc.png
new file mode 100644
index 00000000000..dc82a4e7e82
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/text_find_timing_test_tree_like_msvc.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/thin_heap_tag.html b/libstdc++-v3/docs/html/ext/pb_ds/thin_heap_tag.html
new file mode 100644
index 00000000000..a8e9d4d721c
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/thin_heap_tag.html
@@ -0,0 +1,47 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+  <meta name="generator" content=
+  "HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+
+  <title>thin_heap_tag Interface</title>
+  <meta http-equiv="Content-Type" content=
+  "text/html; charset=us-ascii" />
+  </head>
+
+<body>
+  <div id="page">
+    <h1><tt>thin_heap_tag</tt> Interface</h1>
+
+    <p>Thin heap data structure tag.</p>
+
+    <p>Defined in: <a href=
+    "../../../../include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
+
+    <h2><a name="link1" id="link1">Base Classes</a></h2>
+
+    <table class="c1" width="100%" border="1" summary="Bases">
+      <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="priority_queue_tag.html"><span class=
+"c2"><tt>priority_queue_tag</tt></span></a>
+</pre>
+        </td>
+
+        <td>
+          <p>public</p>
+        </td>
+      </tr>
+    </table>
+  </div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/tree.html b/libstdc++-v3/docs/html/ext/pb_ds/tree.html
new file mode 100644
index 00000000000..d836bda123b
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/tree.html
@@ -0,0 +1,516 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+  <meta name="generator" content=
+  "HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+
+  <title>tree Interface</title>
+  <meta http-equiv="Content-Type" content=
+  "text/html; charset=us-ascii" />
+  </head>
+
+<body>
+  <div id="page">
+    <h1><tt>tree</tt> Interface</h1>
+
+    <p>A concrete basic tree-based associative container.</p>
+
+    <p>Defined in: <a href=
+    "../../../../include/ext/pb_ds/assoc_container.hpp"><tt>assoc_container.hpp</tt></a></p>
+
+    <h2><a name="link1" id="link1">Template Parameters</a></h2>
+
+    <table class="c1" width="100%" border="1" summary=
+    "Template Parameters">
+      <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="Key2501" id="Key2501"><b>typename</b> Key</a>
+</pre>
+        </td>
+
+        <td>
+          <p>Key type.</p>
+        </td>
+
+        <td>-</td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="Mapped318655" id="Mapped318655"><b>typename</b> Mapped</a>
+</pre>
+        </td>
+
+        <td>
+          <p>Mapped type.</p>
+        </td>
+
+        <td>-</td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="Cmp_Fn294335" id="Cmp_Fn294335"><b>class</b> Cmp_Fn </a>
+</pre>
+        </td>
+
+        <td>
+          <p>Comparison functor.</p>
+        </td>
+
+        <td>
+          <pre>
+std::less&lt;<a href="#Key2501"><tt>Key</tt></a>&gt;
+</pre>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="Tag278938" id="Tag278938"><b>class</b> Tag </a>
+</pre>
+        </td>
+
+        <td>
+          <p>Mapped-structure tag.</p>
+        </td>
+
+        <td><a href="rb_tree_tag.html"><span class=
+        "c2"><tt>rb_tree_tag</tt></span></a></td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="Node_Update841554648" id=
+"Node_Update841554648"><b>template</b>&lt; 
+  <b>typename</b> Const_Node_Iterator, 
+  <b>typename</b> Node_Iterator, 
+  <b>class</b> Cmp_Fn_, 
+  <b>typename</b> Allocator_&gt;
+<b>class</b> Node_Update </a>
+</pre>
+        </td>
+
+        <td>
+          <p>Node updater type.</p>
+
+          <p><a href=
+          "tree_based_containers.html#invariants">Design::Tree-Based
+          Containers::Node Invariants</a> explains this
+          concept.</p>
+        </td>
+
+        <td><a href="null_tree_node_update.html"><span class=
+        "c2"><tt>null_tree_node_update</tt></span></a></td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="Allocator35940069" id=
+"Allocator35940069"><b>class</b> 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" id="link2">Base Classes</a></h2>
+
+    <table class="c1" width="100%" border="1" summary="Bases">
+      <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.html"><span class=
+"c2"><tt>basic_tree</tt></span></a>
+</pre>
+        </td>
+
+        <td>
+          <p>public</p>
+        </td>
+      </tr>
+    </table>
+
+    <h2><a name="link3" id="link3">Public Types and
+    Constants</a></h2>
+
+    <h3><a name="link4" id="link4">Policy Definitions</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Types">
+      <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_fn394495" id="cmp_fn394495">cmp_fn</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<a href="#Cmp_Fn294335"><tt>Cmp_Fn</tt></a>
+</pre>
+        </td>
+
+        <td>
+          <p>Comparison functor type.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h3><a name="link5" id="link5">Iterator Definitions</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Types">
+      <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_node_iterator4205924553" id=
+"const_node_iterator4205924553">const_node_iterator</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<a href=
+"tree_const_node_iterator.html"><span class=
+"c2"><tt>const_node_iterator</tt></span></a>
+</pre>
+        </td>
+
+        <td>
+          <p>Const node iterator.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="node_iterator3431975247" id=
+"node_iterator3431975247">node_iterator</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<a href="tree_node_iterator.html"><span class=
+"c2"><tt>node_iterator</tt></span></a>
+</pre>
+        </td>
+
+        <td>
+          <p>Node iterator.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h2><a name="link6" id="link6">Public Methods</a></h2>
+
+    <h3><a name="link7" id="link7">Constructors, Destructor, and
+    Related</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <tr>
+        <td width="45%" align="left"><b>Method</b></td>
+
+        <td width="55%" align="left"><b>Description</b></td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+  tree
+  ()
+</pre>
+        </td>
+
+        <td>
+          <p>Default constructor.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+  tree
+  (<b>const</b> <a href=
+"#cmp_fn394495"><tt>cmp_fn</tt></a> &amp;r_cmp_fn)
+</pre>
+        </td>
+
+        <td>
+          <p>Constructor taking some policy objects. <span class=
+          "c1"><tt>r_cmp_fn</tt></span> will be copied by the
+          <a href="#Cmp_Fn294335"><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
+  (It first_it, 
+    It last_it)
+</pre>
+        </td>
+
+        <td>
+          <p>Constructor taking iterators to a range of
+          value_types. The value_types between <span class=
+          "c1"><tt>first_it</tt></span> and <span class=
+          "c1"><tt>last_it</tt></span> will be inserted into the
+          container object.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<b>template</b>&lt;
+    <b>class</b> It&gt;
+  tree
+  (It first_it, 
+    It last_it,
+    <b>const</b> <a href=
+"#cmp_fn394495"><tt>cmp_fn</tt></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
+          <span class="c1"><tt>first_it</tt></span> and
+          <span class="c1"><tt>last_it</tt></span> will be inserted
+          into the container object. <span class=
+          "c1"><tt>r_cmp_fn</tt></span> will be copied by the
+          <a href="#cmp_fn394495"><tt>cmp_fn</tt></a> object of the
+          container object.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+  tree
+  (<b>const</b> <span class=
+"c2"><tt>tree</tt></span> &amp;other)
+</pre>
+        </td>
+
+        <td>
+          <p>Copy constructor.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<b>virtual</b> 
+  ~tree
+  ()
+</pre>
+        </td>
+
+        <td>
+          <p>Destructor.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<span class="c2"><tt>tree</tt></span> &amp;
+  <b>operator</b>=
+  (<b>const</b> <span class=
+"c2"><tt>tree</tt></span> &amp;other)
+</pre>
+        </td>
+
+        <td>
+          <p>Assignment operator.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<b>void</b>
+  swap
+  (<span class=
+"c2"><tt>tree</tt></span> &amp;other)
+</pre>
+        </td>
+
+        <td>
+          <p>Swaps content.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h3><a name="link8" id="link8">Policy Access Methods</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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_fn394495"><tt>cmp_fn</tt></a> &amp;
+  get_cmp_fn
+  ()
+</pre>
+        </td>
+
+        <td>
+          <p>Access to the <a href=
+          "#cmp_fn394495"><tt>cmp_fn</tt></a> object.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<b>const</b> <a href="#cmp_fn394495"><tt>cmp_fn</tt></a> &amp;
+  get_cmp_fn
+  () <b>const</b>
+</pre>
+        </td>
+
+        <td>
+          <p>Const access to the <a href=
+          "#cmp_fn394495"><tt>cmp_fn</tt></a> object.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h3><a name="link9" id="link9">Node-Iteration Methods</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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="#node_iterator3431975247"><tt>node_iterator</tt></a>
+  node_begin
+  ()
+</pre>
+        </td>
+
+        <td>
+          <p>Returns a <a href=
+          "#node_iterator3431975247"><tt>node_iterator</tt></a>
+          corresponding to the node at the root of the tree.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a href=
+"#const_node_iterator4205924553"><tt>const_node_iterator</tt></a>
+  node_begin
+  () <b>const</b>
+</pre>
+        </td>
+
+        <td>
+          <p>Returns a <a href=
+          "#const_node_iterator4205924553"><tt>const_node_iterator</tt></a>
+          corresponding to the node at the root of the tree.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a href="#node_iterator3431975247"><tt>node_iterator</tt></a>
+  node_end
+  ()
+</pre>
+        </td>
+
+        <td>
+          <p>Returns a <a href=
+          "#node_iterator3431975247"><tt>node_iterator</tt></a>
+          corresponding to a node just after a leaf of the
+          tree.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a href=
+"#const_node_iterator4205924553"><tt>const_node_iterator</tt></a>
+  node_end
+  () <b>const</b>
+</pre>
+        </td>
+
+        <td>
+          <p>Returns a <a href=
+          "#const_node_iterator4205924553"><tt>const_node_iterator</tt></a>
+          corresponding to a node just after a leaf of the
+          tree.</p>
+        </td>
+      </tr>
+    </table>
+  </div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/tree_based_containers.html b/libstdc++-v3/docs/html/ext/pb_ds/tree_based_containers.html
new file mode 100644
index 00000000000..7a1b554b26b
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/tree_based_containers.html
@@ -0,0 +1,358 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+  <meta name="generator" content=
+  "HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+
+  <title>Tree-Based Containers</title>
+  <meta http-equiv="Content-Type" content=
+  "text/html; charset=us-ascii" />
+  </head>
+
+<body>
+  <div id="page">
+    <h1>Tree Design</h1>
+
+    <h2><a name="overview" id="overview">Overview</a></h2>
+
+    <p>The tree-based container has the following declaration:</p>
+    <pre>
+<b>template</b>&lt;
+    <b>typename</b> Key,
+    <b>typename</b> Mapped,
+    <b>typename</b> Cmp_Fn = std::less&lt;Key&gt;,
+    <b>typename</b> Tag = <a href="rb_tree_tag.html">rb_tree_tag</a>,
+    <b>template</b>&lt;
+        <b>typename</b> Const_Node_Iterator,
+        <b>typename</b> Node_Iterator,
+        <b>typename</b> Cmp_Fn_,
+        <b>typename</b> Allocator_&gt;
+    <b>class</b> Node_Update = <a href=
+"null_tree_node_update.html">null_tree_node_update</a>,
+    <b>typename</b> Allocator = std::allocator&lt;<b>char</b>&gt; &gt;
+<b>class</b> <a href=
+"tree.html">tree</a>;
+</pre>
+
+    <p>The parameters have the following meaning:</p>
+
+    <ol>
+      <li><tt>Key</tt> is the key type.</li>
+
+      <li><tt>Mapped</tt> is the mapped-policy.</li>
+
+      <li><tt>Cmp_Fn</tt> is a key comparison functor</li>
+
+      <li><tt>Tag</tt> specifies which underlying data structure
+      to use.</li>
+
+      <li><tt>Node_Update</tt> is a policy for updating node
+      invariants. This is described in <a href="#invariants">Node
+      Invariants</a>.</li>
+
+      <li><tt>Allocator</tt> is an allocator
+      type.</li>
+    </ol>
+
+    <p>The <tt>Tag</tt> parameter specifies which underlying
+    data structure to use. Instantiating it by <a href=
+    "rb_tree_tag.html"><tt>rb_tree_tag</tt></a>, <a href=
+    "splay_tree_tag.html"><tt>splay_tree_tag</tt></a>, or
+    <a href="ov_tree_tag.html"><tt>ov_tree_tag</tt></a>,
+    specifies an underlying red-black tree, splay tree, or
+    ordered-vector tree, respectively; 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" id="invariants">Node
+    Invariants</a></h2>
+
+    <p>Consider the two trees in Figures <a href=
+    "#node_invariants">Some node invariants</a> A and B. The first
+    is a tree of floats; the second is a tree of pairs, each
+    signifying a geometric line interval. Each element in a tree is refered to as a node of the tree. Of course, each of
+    these trees can support the usual queries: the first can easily
+    search for <tt>0.4</tt>; the second can easily search for
+    <tt>std::make_pair(10, 41)</tt>.</p>
+
+    <p>Each of these trees can efficiently support other queries.
+    The first can efficiently determine that the 2rd key in the
+    tree is <tt>0.3</tt>; the second can efficiently determine
+    whether any of its intervals overlaps
+    <tt>std::make_pair(29,42)</tt> (useful in geometric
+    applications or distributed file systems with leases, for
+    example). (See <a href=
+    "../../../../testsuite/ext/pb_ds/example/tree_order_statistics.cc"><tt>tree_order_statistics.cc</tt></a>
+    and <a href=
+    "../../../../testsuite/ext/pb_ds/example/tree_intervals.cc"><tt>tree_intervals.cc</tt></a>
+    for examples.) It should be noted that an <tt>std::set</tt> can
+    only solve these types of problems with linear complexity.</p>
+
+    <p>In order to do so, each tree stores some <i>metadata</i> in
+    each node, and maintains node invariants <a href=
+    "references.html#clrs2001">clrs2001</a>]. The first stores in
+    each node the size of the sub-tree rooted at the node; the
+    second stores at each node the maximal endpoint of the
+    intervals at the sub-tree rooted at the node.</p>
+
+    <h6 class="c1"><a name="node_invariants" id=
+    "node_invariants"><img src="node_invariants.png" alt=
+    "no image" /></a></h6>
+
+    <h6 class="c1">Some node invariants.</h6>
+
+    <p>Supporting such trees is difficult for a number of
+    reasons:</p>
+
+    <ol>
+      <li>There must be a way to specify what a node's metadata
+      should be (if any).</li>
+
+      <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 grayed 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 grayed 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>The search paths of standard associative containers are
+      defined by comparisons between keys, and not through
+      metadata.</li>
+
+      <li>It is not feasible to know in advance which methods trees
+      can support. Besides the usual <tt>find</tt> method, the
+      first tree can support a <tt>find_by_order</tt> method, while
+      the second can support an <tt>overlaps</tt> method.</li>
+    </ol>
+
+    <h6 class="c1"><a name="node_invariant_invalidations" id=
+    "node_invariant_invalidations"><img src=
+    "node_invariant_invalidations.png" alt="no image" /></a></h6>
+
+    <h6 class="c1">Invalidation of node invariants.</h6>
+
+    <p>These problems are solved by a combination of two means:
+    node iterators, and template-template node updater
+    parameters.</p>
+
+    <h3><a name="node_it" id="node_it">Node Iterators</a></h3>
+
+    <p>Each tree-based container defines two additional iterator
+    types, <a href=
+    "tree_const_node_iterator.html"><tt>const_node_iterator</tt></a>
+    and <a href=
+    "tree_node_iterator.html"><tt>node_iterator</tt></a>.
+    These iterators allow descending from a node to one of its
+    children. Node iterator allow search paths different than those
+    determined by the comparison functor. <a href=
+    "tree.html">tree</a>
+    supports the methods:</p>
+    <pre>
+    <a href="tree_const_node_iterator.html"><tt>const_node_iterator</tt></a>
+    node_begin() <b>const</b>;
+
+    <a href="tree_node_iterator.html"><tt>node_iterator</tt></a>
+    node_begin();
+
+    <a href="tree_const_node_iterator.html"><tt>const_node_iterator</tt></a>
+    node_end() <b>const</b>;
+
+    <a href="tree_node_iterator.html"><tt>node_iterator</tt></a>
+    node_end(); 
+</pre>
+
+    <p>The first pairs return node iterators corresponding to the
+    root node of the tree; the latter pair returns node iterators
+    corresponding to a just-after-leaf node.</p>
+
+    <h3><a name="node_up" id="node_up">Node Updater
+    (Template-Template) Parameters</a></h3>
+
+    <p>The tree-based containers are parametrized by a
+    <tt>Node_Update</tt> template-template parameter. A tree-based
+    container instantiates <tt>Node_Update</tt> to some
+    <tt>node_update</tt> class, and publicly
+    subclasses <tt>node_update</tt>. Figure
+    <a href="#tree_node_update_cd">A tree and its update
+    policy</a> shows this scheme, as well as some predefined
+    policies (which are explained below).</p>
+
+    <h6 class="c1"><a name="tree_node_update_cd" id=
+    "tree_node_update_cd"><img src=
+    "tree_node_update_policy_cd.png" alt="no image" /></a></h6>
+
+    <h6 class="c1">A tree and its update policy.</h6>
+
+    <p><tt>node_update</tt> (an instantiation of
+    <tt>Node_Update</tt>) must define <tt>metadata_type</tt> as
+    the type of metadata it requires. For order statistics,
+    <i>e.g.</i>, <tt>metadata_type</tt> might be <tt>size_t</tt>.
+    The tree defines within each node a <tt>metadata_type</tt>
+    object.</p>
+
+    <p><tt>node_update</tt> must also define the following method
+    for restoring node invariants:</p>
+    <pre>
+    void 
+    operator()(<a href=
+"tree_node_iterator.html"><tt>node_iterator</tt></a> nd_it, <a href=
+"tree_const_node_iterator.html"><tt>const_node_iterator</tt></a> end_nd_it)
+</pre>
+
+    <p>In this method, <tt>nd_it</tt> is a <a href=
+    "tree_node_iterator.html"><tt>node_iterator</tt></a>
+    corresponding to a node whose A) all descendants have valid
+    invariants, and B) its own invariants might be violated;
+    <tt>end_nd_it</tt> is a <a href=
+    "tree_const_node_iterator.html"><tt>const_node_iterator</tt></a>
+    corresponding to a just-after-leaf node. This method should
+    correct the node invariants of the node pointed to by
+    <tt>nd_it</tt>. For example, say node <i>x</i> in Figure
+    <a href="#restoring_node_invariants">Restoring node
+    invariants</a>-A has an invalid invariant, but its' children,
+    <i>y</i> and <i>z</i> have valid invariants. After the
+    invocation, all three nodes should have valid invariants, as in
+    Figure <a href="#restoring_node_invariants">Restoring node
+    invariants</a>-B.</p>
+
+    <h6 class="c1"><a name="restoring_node_invariants" id=
+    "restoring_node_invariants"><img src=
+    "restoring_node_invariants.png" alt="no image" /></a></h6>
+
+    <h6 class="c1">Invalidation of node invariants.</h6>
+
+    <p>When a tree operation might invalidate some node invariant,
+    it invokes this method in its <tt>node_update</tt> base to
+    restore the invariant. 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). (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>].)</p>
+
+    <h6 class="c1"><a name="update_seq_diagram" id=
+    "update_seq_diagram"><img src="update_seq_diagram.png" alt=
+    "no image" /></a></h6>
+
+    <h6 class="c1">Insert update sequence diagram.</h6>
+
+    <p>To complete the description of the scheme, three questions
+    need to be answered:</p>
+
+    <ol>
+      <li>How can a tree which supports order statistics define a
+      method such as <tt>find_by_order</tt>?</li>
+
+      <li>How can the node updater base access methods of the
+      tree?</li>
+
+      <li>How can the following cyclic dependency be resolved?
+      <tt>node_update</tt> is a base class of the tree, yet it
+      uses node iterators defined in the tree (its child).</li>
+    </ol>
+
+    <p>The first two questions are answered by the fact that
+    <tt>node_update</tt> (an instantiation of
+    <tt>Node_Update</tt>) is a <tt><b>public</b></tt> base class
+    of the tree. Consequently:</p>
+
+    <ol>
+      <li>Any public methods of <tt>node_update</tt> are
+      automatically methods of the tree [<a href=
+      "references.html#alexandrescu01modern">alexandrescu01modern</a>].
+      Thus an order-statistics node updater, <a href=
+      "tree_order_statistics_node_update.html"><tt>tree_order_statistics_node_update</tt></a>
+      defines the <tt>find_by_order</tt> method; any tree
+      instantiated by this policy consequently supports this method
+      as well.</li>
+
+      <li>In C++, if a base class declares a method as
+      <tt><b>virtual</b></tt>, it is <tt><b>virtual</b></tt> in its
+      subclasses. If <tt>node_update</tt> needs to access one of
+      the tree's methods, say the member function <tt>end</tt>, it simply
+      declares that method as <tt><b>virtual</b></tt>
+      abstract.</li>
+    </ol>
+
+    <p>The cyclic dependency is solved through template-template
+    parameters. <tt>Node_Update</tt> is parametrized by the tree's node iterators, its comparison
+    functor, and its allocator type. Thus, 
+    instantiations of <tt>Node_Update</tt> have all information required.</p>
+
+    <p class="c1"><tt>pb_ds</tt> assumes that constructing a metadata object and modifying it
+    are exception free. Suppose that during some method, say
+    <tt>insert</tt>, a metadata-related operation
+    (<i>e.g.</i>, changing the value of a metadata) throws an
+    exception. Ack! Rolling back the method is unusually complex.</p>
+
+    <p>In <a href=
+    "concepts.html#concepts_null_policies">Interface::Concepts::Null
+    Policy Classes</a> a distinction was made between <i>redundant
+    policies</i> and <i>null policies</i>. Node invariants show a
+    case where null policies are required.</p>
+
+    <p>Assume a regular tree is required, one which need not
+    support order statistics or interval overlap queries.
+    Seemingly, in this case a redundant policy - a policy which
+    doesn't affect nodes' contents would suffice. This, would lead
+    to the following drawbacks:</p>
+
+    <ol>
+      <li>Each node would carry a useless metadata object, wasting
+      space.</li>
+
+      <li>The tree cannot know if its <tt>Node_Update</tt> policy
+      actually modifies a node's metadata (this is halting
+      reducible). In Figure <a href=
+      "#rationale_null_node_update">Useless update path</a> ,
+      assume the shaded node is inserted. The tree would have to
+      traverse the useless path shown to the root, applying
+      redundant updates all the way.</li>
+    </ol>
+
+    <h6 class="c1"><a name="rationale_null_node_update" id=
+    "rationale_null_node_update"><img src=
+    "rationale_null_node_update.png" alt="no image" /></a></h6>
+
+    <h6 class="c1">Useless update path.</h6>
+
+    <p>A null policy class, <a href=
+    "null_tree_node_update.html"><tt>null_tree_node_update</tt></a>
+    solves both these problems. The tree detects that node
+    invariants are irrelevant, and defines all accordingly.</p>
+
+    <h2><a name="add_methods" id="add_methods">Additional
+    Methods</a></h2>
+
+    <p>Tree-based containers support split and join methods.
+    It is possible to split a tree so that it passes
+    all nodes with keys larger than a given key to a different
+    tree. These methods have the following advantages over the
+    alternative of externally inserting to the destination
+    tree and erasing from the source tree:</p>
+
+    <ol>
+      <li>These methods are efficient - red-black trees are split
+      and joined in poly-logarithmic complexity; ordered-vector
+      trees are split and joined at linear complexity. The
+      alternatives have super-linear complexity.</li>
+
+      <li>Aside from orders of growth, these operations perform
+      few allocations and de-allocations. For red-black trees, allocations are not performed,
+      and the methods are exception-free. </li>
+    </ol>
+  </div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/tree_node_iterator.html b/libstdc++-v3/docs/html/ext/pb_ds/tree_node_iterator.html
new file mode 100644
index 00000000000..ba09b5b4db2
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/tree_node_iterator.html
@@ -0,0 +1,143 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+  <meta name="generator" content=
+  "HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+
+  <title>tree::node_iterator Interface</title>
+  <meta http-equiv="Content-Type" content=
+  "text/html; charset=us-ascii" />
+  </head>
+
+<body>
+  <div id="page">
+    <h1><tt><span class=
+    "c2"><tt>tree</tt></span>::node_iterator</tt>
+    Interface</h1>
+
+    <p>Node iterator.</p>
+
+    <p>This is an <quote>iterator to an iterator </quote> - it
+    iterates over nodes, and de-referencing it returns one of the
+    tree's iterators</p>
+
+    <h2><a name="link1" id="link1">Base Classes</a></h2>
+
+    <table class="c1" width="100%" border="1" summary="Bases">
+      <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=
+"tree.html#const_node_iterator4205924553"><span class="c2"><tt>tree</tt></span>::const_node_iterator</a>
+</pre>
+        </td>
+
+        <td>
+          <p>public</p>
+        </td>
+      </tr>
+    </table>
+
+    <h2><a name="link2" id="link2">Public Methods</a></h2>
+
+    <h3><a name="link3" id="link3">Constructors, Destructor, and
+    Related</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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> 
+  node_iterator
+  ()
+</pre>
+        </td>
+
+        <td>
+          <p>Default constructor.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h3><a name="link4" id="link4">Access Methods</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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=
+"container_base.html#iterator10418194"><span class=
+"c2"><tt>container_base</tt></span>::iterator</a>
+  <b>operator</b>*
+  () <b>const</b>
+</pre>
+        </td>
+
+        <td>
+          <p>Access.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h3><a name="link5" id="link5">Movement Methods</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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> <span class="c2"><tt>node_iterator</tt></span>
+  get_l_child
+  () <b>const</b>
+</pre>
+        </td>
+
+        <td>
+          <p>Returns the node iterator associated with the left
+          node.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<b>inline</b> <span class="c2"><tt>node_iterator</tt></span>
+  get_r_child
+  () <b>const</b>
+</pre>
+        </td>
+
+        <td>
+          <p>Returns the node iterator associated with the right
+          node.</p>
+        </td>
+      </tr>
+    </table>
+  </div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/tree_node_updator_policy_cd.png b/libstdc++-v3/docs/html/ext/pb_ds/tree_node_updator_policy_cd.png
new file mode 100644
index 00000000000..5cae5781a18
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/tree_node_updator_policy_cd.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/tree_order_statistics_node_update.html b/libstdc++-v3/docs/html/ext/pb_ds/tree_order_statistics_node_update.html
new file mode 100644
index 00000000000..449966b0e4f
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/tree_order_statistics_node_update.html
@@ -0,0 +1,678 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+  <meta name="generator" content=
+  "HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+
+  <title>tree_order_statistics_node_update Interface</title>
+  <meta http-equiv="Content-Type" content=
+  "text/html; charset=us-ascii" />
+  </head>
+
+<body>
+  <div id="page">
+    <h1><tt>tree_order_statistics_node_update</tt> Interface</h1>
+
+    <p>Functor updating ranks of entrees.</p>
+
+    <p>Defined in: <a href=
+    "../../../../include/ext/pb_ds/tree_policy.hpp"><tt>tree_policy.hpp</tt></a></p>
+
+    <h2><a name="link1" id="link1">Template Parameters</a></h2>
+
+    <table class="c1" width="100%" border="1" summary=
+    "Template Parameters">
+      <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_Node_Iterator1933878761" id=
+"Const_Node_Iterator1933878761"><b>class</b> Const_Node_Iterator</a>
+</pre>
+        </td>
+
+        <td>
+          <p>Const node iterator type.</p>
+        </td>
+
+        <td>-</td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="Node_Iterator4206909839" id=
+"Node_Iterator4206909839"><b>class</b> Node_Iterator</a>
+</pre>
+        </td>
+
+        <td>
+          <p>Node iterator type.</p>
+        </td>
+
+        <td>-</td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="Cmp_Fn294335" id="Cmp_Fn294335"><b>class</b> Cmp_Fn</a>
+</pre>
+        </td>
+
+        <td>
+          <p>Comparison functor.</p>
+        </td>
+
+        <td>-</td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="Allocator35940069" id=
+"Allocator35940069"><b>class</b> Allocator</a>
+</pre>
+        </td>
+
+        <td>
+          <p>Allocator type.</p>
+        </td>
+
+        <td>-</td>
+      </tr>
+    </table>
+
+    <h2><a name="link2" id="link2">Public Types and
+    Constants</a></h2>
+
+    <h3><a name="link3" id="link3">Policy Definitions</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Types">
+      <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_fn394495" id="cmp_fn394495">cmp_fn</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<a href="#Cmp_Fn294335"><tt>Cmp_Fn</tt></a>
+</pre>
+        </td>
+
+        <td>
+          <p><a href="#Allocator35940069"><tt>Allocator</tt></a>
+          type.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="allocator48440069" id="allocator48440069">allocator</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<a href="#Allocator35940069"><tt>Allocator</tt></a>
+</pre>
+        </td>
+
+        <td>
+          <p><a href="#Allocator35940069"><tt>Allocator</tt></a>
+          type.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h3><a name="link4" id="link4">General Definitions</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Types">
+      <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_type55424436" id="size_type55424436">size_type</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<b>typename</b> <a href=
+"#allocator48440069"><tt>allocator</tt></a>::size_type
+</pre>
+        </td>
+
+        <td>
+          <p>Size type.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h3><a name="link5" id="link5">Key-type Definitions</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Types">
+      <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_type10393186" id="key_type10393186">key_type</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+The instantiating container's key type.
+</pre>
+        </td>
+
+        <td>
+          <p>Key type.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="const_key_reference3185471705" id=
+"const_key_reference3185471705">const_key_reference</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+The instantiating container's const key reference type.
+</pre>
+        </td>
+
+        <td>
+          <p>Const key reference.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h3><a name="link6" id="link6">Metadata-Type
+    Definitions</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Types">
+      <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_type2849297114" id=
+"metadata_type2849297114">metadata_type</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<a href="#size_type55424436"><tt>size_type</tt></a>
+</pre>
+        </td>
+
+        <td>
+          <p>Metadata type.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h3><a name="link7" id="link7">Iterator Definitions</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Types">
+      <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_node_iterator4205924553" id=
+"const_node_iterator4205924553">const_node_iterator</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<a href=
+"#Const_Node_Iterator1933878761"><tt>Const_Node_Iterator</tt></a>
+</pre>
+        </td>
+
+        <td>
+          <p>Const node iterator type.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="node_iterator3431975247" id=
+"node_iterator3431975247">node_iterator</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<a href="#Node_Iterator4206909839"><tt>Node_Iterator</tt></a>
+</pre>
+        </td>
+
+        <td>
+          <p>Node iterator type.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="const_iterator98626788" id=
+"const_iterator98626788">const_iterator</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<b>typename</b> <a href=
+"#const_node_iterator4205924553"><tt>const_node_iterator</tt></a>::value_type
+</pre>
+        </td>
+
+        <td>
+          <p>Const iterator type.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="iterator10418194" id="iterator10418194">iterator</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<b>typename</b> <a href=
+"#node_iterator3431975247"><tt>node_iterator</tt></a>::value_type
+</pre>
+        </td>
+
+        <td>
+          <p>Iterator type.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h2><a name="link8" id="link8">Public Methods</a></h2>
+
+    <h3><a name="link9" id="link9">Find-Type Methods</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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=
+"#const_iterator98626788"><tt>const_iterator</tt></a>
+  find_by_order
+  (<a href=
+"#size_type55424436"><tt>size_type</tt></a> order) <b>const</b>
+</pre>
+        </td>
+
+        <td>
+          <p>Finds an entry by order. Returns a <a href=
+          "#const_iterator98626788"><tt>const_iterator</tt></a> to
+          the entry with the order <span class=
+          "c1"><tt>order</tt></span>, or a <a href=
+          "#const_iterator98626788"><tt>const_iterator</tt></a> to
+          the container object's end if <span class=
+          "c1"><tt>order</tt></span> is at least the size of the
+          container object.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<b>inline</b> <a href="#iterator10418194"><tt>iterator</tt></a>
+  find_by_order
+  (<a href="#size_type55424436"><tt>size_type</tt></a> order)
+</pre>
+        </td>
+
+        <td>
+          <p>Finds an entry by order. Returns an <a href=
+          "#iterator10418194"><tt>iterator</tt></a> to the entry
+          with the order <span class="c1"><tt>order</tt></span>, or
+          an <a href="#iterator10418194"><tt>iterator</tt></a> to
+          the container object's end if <span class=
+          "c1"><tt>order</tt></span> is at least the size of the
+          container object.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<b>inline</b> <a href="#size_type55424436"><tt>size_type</tt></a>
+  order_of_key
+  (<a href=
+"#const_key_reference3185471705"><tt>const_key_reference</tt></a> r_key) <b>const</b>
+</pre>
+        </td>
+
+        <td>
+          <p>Returns the order of a key within a sequence. For
+          example, if <span class="c1"><tt>r_key</tt></span> is the
+          smallest key, this method will return 0; if <span class=
+          "c1"><tt>r_key</tt></span> is a key between the smallest
+          and next key, this method will return 1; if <span class=
+          "c1"><tt>r_key</tt></span> is a key larger than the
+          largest key, this method will return the size of r_c.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h2><a name="link10" id="link10">Protected Types and
+    Constants</a></h2>
+
+    <h3><a name="link11" id="link11">Value-type
+    Definitions</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Types">
+      <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_reference495461441" id=
+"const_reference495461441">const_reference</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+The instantiating container's const reference  type.
+</pre>
+        </td>
+
+        <td>
+          <p>Const reference to the container's value-type.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="const_pointer878814947" id=
+"const_pointer878814947">const_pointer</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+The instantiating container's const pointer  type.
+</pre>
+        </td>
+
+        <td>
+          <p>Const pointer to the container's value-type.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="const_metadata_reference1108857465" id=
+"const_metadata_reference1108857465">const_metadata_reference</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<b>typename</b> <a href=
+"#Allocator35940069"><tt>Allocator</tt></a>::<b>template</b> rebind&lt;
+    <a href=
+"#metadata_type2849297114"><tt>metadata_type</tt></a>&gt;::other::<a href="#const_reference495461441"><tt>const_reference</tt></a>
+</pre>
+        </td>
+
+        <td>
+          <p>Const metadata reference.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="metadata_reference583863863" id=
+"metadata_reference583863863">metadata_reference</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<b>typename</b> <a href=
+"#Allocator35940069"><tt>Allocator</tt></a>::<b>template</b> rebind&lt;
+    <a href=
+"#metadata_type2849297114"><tt>metadata_type</tt></a>&gt;::other::reference
+</pre>
+        </td>
+
+        <td>
+          <p>Metadata reference.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h2><a name="link12" id="link12">Protected Methods</a></h2>
+
+    <h3><a name="link13" id="link13">Operators</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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>
+  <b>operator</b>()
+  (<a href=
+"#node_iterator3431975247"><tt>node_iterator</tt></a> node_it,
+    <a href=
+"#const_node_iterator4205924553"><tt>const_node_iterator</tt></a> end_nd_it) <b>const</b>
+</pre>
+        </td>
+
+        <td>
+          <p>Updates the rank of a node through a <a href=
+          "#node_iterator3431975247"><tt>node_iterator</tt></a>
+          <span class="c1"><tt>node_it</tt></span>; <span class=
+          "c1"><tt>end_nd_it</tt></span> is the end node <a href=
+          "#iterator10418194"><tt>iterator</tt></a>.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h3><a name="link14" id="link14">Constructors, destructor, and
+    related</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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> 
+  ~tree_order_statistics_node_update
+  ()
+</pre>
+        </td>
+
+        <td>
+          <p>Destructor.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h2><a name="link15" id="link15">Private Methods</a></h2>
+
+    <h3><a name="link16" id="link16">Overrides</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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> <a href=
+"#const_node_iterator4205924553"><tt>const_node_iterator</tt></a>
+  node_begin
+  () <b>const</b> = 0
+</pre>
+        </td>
+
+        <td>
+          <p>Returns the <a href=
+          "#const_node_iterator4205924553"><tt>const_node_iterator</tt></a>
+          associated with the tree's root node.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<b>virtual</b> <a href=
+"#node_iterator3431975247"><tt>node_iterator</tt></a>
+  node_begin
+  () = 0
+</pre>
+        </td>
+
+        <td>
+          <p>Returns the <a href=
+          "#node_iterator3431975247"><tt>node_iterator</tt></a>
+          associated with the tree's root node.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<b>virtual</b> <a href=
+"#const_node_iterator4205924553"><tt>const_node_iterator</tt></a>
+  node_end
+  () <b>const</b> = 0
+</pre>
+        </td>
+
+        <td>
+          <p>Returns the <a href=
+          "#const_node_iterator4205924553"><tt>const_node_iterator</tt></a>
+          associated with a just-after leaf node.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<b>virtual</b> <a href=
+"#node_iterator3431975247"><tt>node_iterator</tt></a>
+  node_end
+  () = 0
+</pre>
+        </td>
+
+        <td>
+          <p>Returns the <a href=
+          "#node_iterator3431975247"><tt>node_iterator</tt></a>
+          associated with a just-after leaf node.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<b>virtual</b> <a href="#cmp_fn394495"><tt>cmp_fn</tt></a> &amp;
+  get_cmp_fn
+  () = 0
+</pre>
+        </td>
+
+        <td>
+          <p>Access to the <a href=
+          "#cmp_fn394495"><tt>cmp_fn</tt></a> object.</p>
+        </td>
+      </tr>
+    </table>
+  </div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/tree_order_statistics_timing_test.html b/libstdc++-v3/docs/html/ext/pb_ds/tree_order_statistics_timing_test.html
new file mode 100644
index 00000000000..0d7579027a3
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/tree_order_statistics_timing_test.html
@@ -0,0 +1,118 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+<meta name="generator" content="HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+<title>Tree Order Statistics Timing Test</title>
+<meta http-equiv="Content-Type" content="text/html; charset=us-ascii" />
+</head>
+<body>
+<div id="page">
+<h1>Tree Order-Statistics Timing Test</h1>
+<h2><a name="description" id="description">Description</a></h2>
+<p>This test creates a container, inserts random integers into
+    the the container, and then checks the order-statistics of the
+    container's values. (If the container is one of <tt>pb_ds</tt>
+    's trees, it does this with the <tt>order_of_key</tt> method of
+    <a href="tree_order_statistics_node_update.html"><tt>tree_order_statistics_node_update</tt></a>
+    ; otherwise, it uses the <tt>find</tt> method and
+    <tt>std::distance</tt> .) It measures the average time for such
+    queries as a function of the number of values inserted.</p>
+<p>(The test was executed with <a href="../../../../testsuite/performance/ext/pb_ds/tree_order_statistics_timing.cc"><tt>tree_order_statistics_timing_test</tt></a>
+    200 200 2100)</p>
+<h2><a name="purpose" id="purpose">Purpose</a></h2>
+<p>The test checks the performance difference of policies based
+    on node-invariant as opposed to a external functions. (see
+    <a href="tree_based_containers.html#invariants">Design::Associative
+    Containers::Tree-Based Containers::Node Invariants</a> .)</p>
+<h2><a name="results" id="results">Results</a></h2>
+<p>Figures <a href="#NTG">NTG</a>, <a href="#NTM">NTM</a>, and
+    <a href="#NTL">NTL</a> show the results for the native and
+    tree-based containers in <a href="assoc_performance_tests.html#gcc"><u>g++</u></a>, <a href="assoc_performance_tests.html#msvc"><u>msvc++</u></a>, and
+    <a href="assoc_performance_tests.html#local"><u>local</u></a>,
+    respectively.</p>
+<div id="NTG_res_div">
+<div id="NTG_gcc">
+<div id="NTG_tree_order_statistics_timing_test">
+<div id="NTG_assoc">
+<div id="NTG_Native_and_tree-based_container_order-statistics_queries"><div style="border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NTG" id="NTG"><img src="tree_order_statistics_timing_test_gcc.png" alt="no image" /></a></h6>NTG: Native and tree-based container order-statistics queries - <a href="assoc_performance_tests.html#gcc">g++</a><p>In the above figure, the names in the legends have the following meaning:</p>
+<ol>
+<li>
+n_set-
+<tt>std::set</tt></li>
+<li>
+splay_tree_ost_set-
+<a href="tree.html"><tt>tree</tt></a>
+ with <tt>Tag</tt> = <a href="splay_tree_tag.html"><tt>splay_tree_tag</tt></a>
+, and <tt>Node_Update</tt> = <a href="tree_order_statistics_node_update.html"><tt>tree_order_statistics_node_update</tt></a>
+</li>
+<li>
+rb_tree_ost_set-
+<a href="tree.html"><tt>tree</tt></a>
+ with <tt>Tag</tt> = <a href="rb_tree_tag.html"><tt>rb_tree_tag</tt></a>
+, and <tt>Node_Update</tt> = <a href="tree_order_statistics_node_update.html"><tt>tree_order_statistics_node_update</tt></a>
+</li>
+</ol>
+</div><div style="width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<div id="NTM_res_div">
+<div id="NTM_msvc">
+<div id="NTM_tree_order_statistics_timing_test">
+<div id="NTM_assoc">
+<div id="NTM_Native_and_tree-based_container_order-statistics_queries"><div style="border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NTM" id="NTM"><img src="tree_order_statistics_timing_test_msvc.png" alt="no image" /></a></h6>NTM: Native and tree-based container order-statistics queries - <a href="assoc_performance_tests.html#msvc">msvc++</a><p>In the above figure, the names in the legends have the following meaning:</p>
+<ol>
+<li>
+n_set-
+<tt>std::set</tt></li>
+<li>
+splay_tree_ost_set-
+<a href="tree.html"><tt>tree</tt></a>
+ with <tt>Tag</tt> = <a href="splay_tree_tag.html"><tt>splay_tree_tag</tt></a>
+, and <tt>Node_Update</tt> = <a href="tree_order_statistics_node_update.html"><tt>tree_order_statistics_node_update</tt></a>
+</li>
+<li>
+rb_tree_ost_set-
+<a href="tree.html"><tt>tree</tt></a>
+ with <tt>Tag</tt> = <a href="rb_tree_tag.html"><tt>rb_tree_tag</tt></a>
+, and <tt>Node_Update</tt> = <a href="tree_order_statistics_node_update.html"><tt>tree_order_statistics_node_update</tt></a>
+</li>
+</ol>
+</div><div style="width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<div id="NTL_res_div">
+<div id="NTL_local">
+<div id="NTL_tree_order_statistics_timing_test">
+<div id="NTL_assoc">
+<div id="NTL_Native_and_tree-based_container_order-statistics_queries"><div style = "border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NTL" id= "NTL"><img src="tree_order_statistics_timing_test_local.png" alt="no image" /></a></h6>NTL: Native and tree-based container order-statistics queries - <a href = "assoc_performance_tests.html#local">local</a></div><div style = "width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<h2><a name="observations" id="observations">Observations</a></h2>
+<p>In this test, the native red-black tree can support
+    order-statistics queries only externally, by performing a
+    <tt>find</tt> (alternatively, <tt>lower_bound</tt> or
+    <tt>upper_bound</tt> ) and then using <tt>std::distance</tt> .
+    This is clearly linear, and it is not that surprising that the
+    cost is high.</p>
+<p><tt>pb_ds</tt> 's tree-based containers use in this test the
+    <tt>order_of_key</tt> method of <a href="tree_order_statistics_node_update.html"><tt>tree_order_statistics_node_update</tt></a>.
+    This method has only linear complexity in the length of the
+    root-node path. Unfortunately, the average path of a splay tree
+    (<a href="tree.html"><tt>tree</tt></a>
+    with <tt>Tag =</tt> <a href="splay_tree_tag.html"><tt>splay_tree_tag</tt></a> ) can
+    be higher than logarithmic; the longest path of a red-black
+    tree (<a href="tree.html"><tt>tree</tt></a>
+    with <tt>Tag =</tt> <a href="rb_tree_tag.html"><tt>rb_tree_tag</tt></a> ) is
+    logarithmic in the number of elements. Consequently, the splay
+    tree has worse performance than the red-black tree.</p>
+</div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/tree_order_statistics_timing_test_gcc.png b/libstdc++-v3/docs/html/ext/pb_ds/tree_order_statistics_timing_test_gcc.png
new file mode 100644
index 00000000000..bdb00d07a7f
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/tree_order_statistics_timing_test_gcc.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/tree_order_statistics_timing_test_local.png b/libstdc++-v3/docs/html/ext/pb_ds/tree_order_statistics_timing_test_local.png
new file mode 100644
index 00000000000..2b921743f7c
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/tree_order_statistics_timing_test_local.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/tree_order_statistics_timing_test_msvc.png b/libstdc++-v3/docs/html/ext/pb_ds/tree_order_statistics_timing_test_msvc.png
new file mode 100644
index 00000000000..76dcbee44fd
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/tree_order_statistics_timing_test_msvc.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/tree_random_int_find_find_timing_test.html b/libstdc++-v3/docs/html/ext/pb_ds/tree_random_int_find_find_timing_test.html
new file mode 100644
index 00000000000..9317cfc948d
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/tree_random_int_find_find_timing_test.html
@@ -0,0 +1,160 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+<meta name="generator" content="HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+<title>Tree Text Find Timing Test</title>
+<meta http-equiv="Content-Type" content="text/html; charset=us-ascii" />
+</head>
+<body>
+<div id="page">
+<h1>Tree-Based and Trie-Based Text <tt>find</tt> Find Timing
+    Test</h1>
+<h2><a name="description" id="description">Description</a></h2>
+<p>This test inserts a number of values with keys from an
+    arbitrary text ([<a href="references.html#wickland96thirty">wickland96thirty</a>]) into
+    a container, then performs a series of finds using
+    <tt>find</tt>. It measures the average time for <tt>find</tt>
+    as a function of the number of values inserted.</p>
+<p>(The test was executed with <a href="../../../../testsuite/performance/ext/pb_ds/text_find_timing.cc"><tt>text_find_timing_test</tt></a>
+    thirty_years_among_the_dead_preproc.txt 200 200 2100)</p>
+<h2><a name="purpose" id="purpose">Purpose</a></h2>
+<p>The test checks the effect of different underlying
+    data structures.</p>
+<h2><a name="results" id="results">Results</a></h2>
+<p>Figures <a href="#NTTG">NTTG</a>, <a href="#NTTM">NTTM</a>,
+    and <a href="#NTTG">NTTL</a> show the results for the native,
+    tree-based, and trie-based types in <a href="assoc_performance_tests.html#gcc"><u>g++</u></a>, <a href="assoc_performance_tests.html#local"><u>local</u></a>, and
+    <a href="assoc_performance_tests.html#local"><u>local</u></a>,
+    respectively.</p>
+<div id="NTTG_res_div">
+<div id="NTTG_gcc">
+<div id="NTTG_random_int_find_find_timing_test_tree">
+<div id="NTTG_assoc">
+<div id="NTTG_Native_456_tree-based_456_random_int_find_timing_test_using__tt_find_455tt_"><div style="border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NTTG" id="NTTG"><img src="random_int_find_find_timing_test_tree_gcc.png" alt="no image" /></a></h6>NTTG: Native, tree-based, random int find timing test using <tt>find</tt> - <a href="assoc_performance_tests.html#gcc">g++</a><p>In the above figure, the names in the legends have the following meaning:</p>
+<ol>
+<li>
+splay_tree_map-
+<a href="tree.html"><tt>tree</tt></a>
+ with <tt>Tag</tt> = <a href="splay_tree_tag.html"><tt>splay_tree_tag</tt></a>
+, and <tt>Node_Update</tt> = <a href="null_tree_node_update.html"><tt>null_tree_node_update</tt></a>
+</li>
+<li>
+ov_tree_map-
+<a href="tree.html"><tt>tree</tt></a>
+ with <tt>Tag</tt> = <a href="ov_tree_tag.html"><tt>ov_tree_tag</tt></a>
+, and <tt>Node_Update</tt> = <a href="null_tree_node_update.html"><tt>null_tree_node_update</tt></a>
+</li>
+<li>
+n_map-
+<tt>std::map</tt></li>
+<li>
+rb_tree_map-
+<a href="tree.html"><tt>tree</tt></a>
+ with <tt>Tag</tt> = <a href="rb_tree_tag.html"><tt>rb_tree_tag</tt></a>
+, and <tt>Node_Update</tt> = <a href="null_tree_node_update.html"><tt>null_tree_node_update</tt></a>
+</li>
+</ol>
+</div><div style="width: 100%; height: 20px"></div></div>
+</div>
+</div>
+<div id="NTTM_res_div">
+<div id="NTTM_msvc">
+<div id="NTTM_random_int_find_find_timing_test_tree">
+<div id="NTTM_assoc">
+<div id="NTTM_Native_456_tree-based_456_random_int_find_timing_test_using__tt_find_455tt_"><div style="border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NTTM" id="NTTM"><img src="random_int_find_find_timing_test_tree_msvc.png" alt="no image" /></a></h6>NTTM: Native, tree-based, random int find timing test using <tt>find</tt> - <a href="assoc_performance_tests.html#msvc">msvc++</a><p>In the above figure, the names in the legends have the following meaning:</p>
+<ol>
+<li>
+splay_tree_map-
+<a href="tree.html"><tt>tree</tt></a>
+ with <tt>Tag</tt> = <a href="splay_tree_tag.html"><tt>splay_tree_tag</tt></a>
+, and <tt>Node_Update</tt> = <a href="null_tree_node_update.html"><tt>null_tree_node_update</tt></a>
+</li>
+<li>
+ov_tree_map-
+<a href="tree.html"><tt>tree</tt></a>
+ with <tt>Tag</tt> = <a href="ov_tree_tag.html"><tt>ov_tree_tag</tt></a>
+, and <tt>Node_Update</tt> = <a href="null_tree_node_update.html"><tt>null_tree_node_update</tt></a>
+</li>
+<li>
+n_map-
+<tt>std::map</tt></li>
+<li>
+rb_tree_map-
+<a href="tree.html"><tt>tree</tt></a>
+ with <tt>Tag</tt> = <a href="rb_tree_tag.html"><tt>rb_tree_tag</tt></a>
+, and <tt>Node_Update</tt> = <a href="null_tree_node_update.html"><tt>null_tree_node_update</tt></a>
+</li>
+</ol>
+</div><div style="width: 100%; height: 20px"></div></div>
+</div>
+</div>
+<div id="NTTL_res_div">
+<div id="NTTL_local">
+<div id="NTTL_random_int_find_find_timing_test_tree">
+<div id="NTTL_assoc">
+<div id="NTTL_Native_456_tree-based_456_random_int_find_timing_test_using__tt_find_455tt_"><div style = "border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NTTL" id= "NTTL"><img src="random_int_find_find_timing_test_tree_local.png" alt="no image" /></a></h6>NTTL: Native, tree-based, random int find timing test using <tt>find</tt> - <a href = "assoc_performance_tests.html#local">local</a></div><div style = "width: 100%; height: 20px"></div></div>
+</div>
+</div>
+<h2><a name="observations" id="observations">Observations</a></h2>
+<p>For this setting, a splay tree (<a href="tree.html"><tt>tree</tt></a>
+                with <tt>Tag =</tt> <a href="splay_tree_tag.html"><tt>splay_tree_tag</tt></a>)
+                does not do well. This is possibly due to two
+                reasons:</p>
+<ol>
+<li>A splay tree is not guaranteed to be balanced
+                  [<a href="references.html#motwani95random">motwani95random</a>].
+                  If a splay tree contains <i>n</i> nodes, its
+                  average root-leaf path can be <i>m &gt;&gt;
+                  log(n)</i>.</li>
+<li>Assume a specific root-leaf search path has
+                  length <i>m</i>, and the search-target node has
+                  distance <i>m'</i> from the root. A red-black
+                  tree will require <i>m + 1</i> comparisons to
+                  find the required node; a splay tree will require
+                  <i>2 m'</i> comparisons. A splay tree,
+                  consequently, can perform many more comparisons
+                  than a red-black tree.</li>
+</ol>
+<p>An ordered-vector tree (<a href="tree.html"><tt>tree</tt></a>
+                with <tt>Tag =</tt> <a href="ov_tree_tag.html"><tt>ov_tree_tag</tt></a>),
+                a red-black tree (<a href="tree.html"><tt>tree</tt></a>
+                with <tt>Tag =</tt> <a href="splay_tree_tag.html"><tt>rb_tree_tag</tt></a>),
+                and the native red-black tree all share
+                approximately the same performance.</p>
+<p>An ordered-vector tree is slightly slower than
+                red-black trees, since it requires, in order to
+                find a key, more math operations than they do.
+                Conversely, an ordered-vector tree requires far
+                lower space than the others. ([<a href="references.html#austern00noset">austern00noset</a>],
+                however, seems to have an implementation that is
+                also faster than a red-black tree).</p>
+<p>A PATRICIA trie (<a href="trie.html"><tt>trie</tt></a>
+                with <tt>Tag =</tt> <a href="pat_trie_tag.html"><tt>pat_trie_tag</tt></a>)
+                has good look-up performance, due to its large
+                fan-out in this case. In this setting, a PATRICIA
+                trie has lookup performance comparable to a hash
+                table (see <a href="hash_text_find_find_timing_test.html">Hash-Based
+                Text <tt>find</tt> Find Timing Test</a>), but it is
+                order preserving. This is not that surprising,
+                since a large fan-out PATRICIA trie works like a
+                hash table with collisions resolved by a sub-trie.
+                A large fan-out PATRICIA trie does not do well on
+                modifications (see <a href="tree_text_insert_timing_test.html">Tree-Based and
+                Trie-Based Text Insert Timing Test</a>). It is
+                possibly beneficial to semi-static settings,
+                therefore.</p>
+<p><a href="assoc_performance_tests.html#tree_like_based_types">
+                Observations::Tree-Like-Based Container Types</a>
+                summarizes some observations on tree-based and
+                trie-based containers.</p>
+</div>
+</div>
+</div>
+</div>
+</div>
+</div>
+</div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/tree_split_join_timing_test.html b/libstdc++-v3/docs/html/ext/pb_ds/tree_split_join_timing_test.html
new file mode 100644
index 00000000000..11db03d3ca0
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/tree_split_join_timing_test.html
@@ -0,0 +1,143 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+<meta name="generator" content="HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+<title>Tree Split Join Timing Test</title>
+<meta http-equiv="Content-Type" content="text/html; charset=us-ascii" />
+</head>
+<body>
+<div id="page">
+<h1>Tree Split-Join Timing Test</h1>
+<h2><a name="description" id="description">Description</a></h2>
+<p>This test a container, inserts into a number of values,
+    splits the container at the median, and joins the two
+    containers. (If the containers are one of <tt>pb_ds</tt> 's
+    trees, it splits and joins with the <tt>split</tt> and
+    <tt>join</tt> method; otherwise, it uses the <tt>erase</tt> and
+    <tt>insert</tt> methods.) It measures the time for splitting
+    and joining the containers as a function of the number of
+    values inserted.</p>
+<p>(The test was executed with <a href="../../../../testsuite/performance/ext/pb_ds/tree_split_join_timing.cc"><tt>tree_split_join_timing_test</tt></a>
+    200 200 2100)</p>
+<h2><a name="purpose" id="purpose">Purpose</a></h2>
+<p>The test checks the performance difference of <tt>join</tt>
+    as opposed to a sequence of <tt>insert</tt> operations; by
+    implication, this test checks the most efficient way to erase a
+    sub-sequence from a tree-like-based container, since this can
+    always be performed by a small sequence of splits and joins
+    (see <a href="motivation.html#assoc_split_join_methods">Motivation::Associative
+    Containers::Slightly Different Methods::Methods Related to
+    Split and Join</a> and <a href="tree_based_containers.html#add_methods">Design::Associative
+    Containers::Tree-Based Containers::Additional Methods</a>
+    .)</p>
+<h2><a name="results" id="results">Results</a></h2>
+<p>Figures <a href="#NTG">NTG</a>, <a href="#NTM">NTM</a>, and
+    <a href="#NTL">NTL</a> show the results for the native and
+    tree-based containers in <a href="assoc_performance_tests.html#gcc"><u>g++</u></a>, <a href="assoc_performance_tests.html#msvc"><u>msvc++</u></a>, and
+    <a href="assoc_performance_tests.html#local"><u>local</u></a>,
+    respectively.</p>
+<div id="NTG_res_div">
+<div id="NTG_gcc">
+<div id="NTG_tree_split_join_timing_test">
+<div id="NTG_assoc">
+<div id="NTG_Native_and_tree-based_container_splits_and_joins"><div style="border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NTG" id="NTG"><img src="tree_split_join_timing_test_gcc.png" alt="no image" /></a></h6>NTG: Native and tree-based container splits and joins - <a href="assoc_performance_tests.html#gcc">g++</a><p>In the above figure, the names in the legends have the following meaning:</p>
+<ol>
+<li>
+n_set-
+<tt>std::set</tt></li>
+<li>
+splay_tree_set-
+<a href="tree.html"><tt>tree</tt></a>
+ with <tt>Tag</tt> = <a href="splay_tree_tag.html"><tt>splay_tree_tag</tt></a>
+, and <tt>Node_Update</tt> = <a href="null_tree_node_update.html"><tt>null_tree_node_update</tt></a>
+</li>
+<li>
+rb_tree_set-
+<a href="tree.html"><tt>tree</tt></a>
+ with <tt>Tag</tt> = <a href="rb_tree_tag.html"><tt>rb_tree_tag</tt></a>
+, and <tt>Node_Update</tt> = <a href="null_tree_node_update.html"><tt>null_tree_node_update</tt></a>
+</li>
+<li>
+ov_tree_set-
+<a href="tree.html"><tt>tree</tt></a>
+ with <tt>Tag</tt> = <a href="ov_tree_tag.html"><tt>ov_tree_tag</tt></a>
+, and <tt>Node_Update</tt> = <a href="null_tree_node_update.html"><tt>null_tree_node_update</tt></a>
+</li>
+</ol>
+</div><div style="width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<div id="NTM_res_div">
+<div id="NTM_msvc">
+<div id="NTM_tree_split_join_timing_test">
+<div id="NTM_assoc">
+<div id="NTM_Native_and_tree-based_container_splits_and_joins"><div style="border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NTM" id="NTM"><img src="tree_split_join_timing_test_msvc.png" alt="no image" /></a></h6>NTM: Native and tree-based container splits and joins - <a href="assoc_performance_tests.html#msvc">msvc++</a><p>In the above figure, the names in the legends have the following meaning:</p>
+<ol>
+<li>
+n_set-
+<tt>std::set</tt></li>
+<li>
+splay_tree_set-
+<a href="tree.html"><tt>tree</tt></a>
+ with <tt>Tag</tt> = <a href="splay_tree_tag.html"><tt>splay_tree_tag</tt></a>
+, and <tt>Node_Update</tt> = <a href="null_tree_node_update.html"><tt>null_tree_node_update</tt></a>
+</li>
+<li>
+rb_tree_set-
+<a href="tree.html"><tt>tree</tt></a>
+ with <tt>Tag</tt> = <a href="rb_tree_tag.html"><tt>rb_tree_tag</tt></a>
+, and <tt>Node_Update</tt> = <a href="null_tree_node_update.html"><tt>null_tree_node_update</tt></a>
+</li>
+<li>
+ov_tree_set-
+<a href="tree.html"><tt>tree</tt></a>
+ with <tt>Tag</tt> = <a href="ov_tree_tag.html"><tt>ov_tree_tag</tt></a>
+, and <tt>Node_Update</tt> = <a href="null_tree_node_update.html"><tt>null_tree_node_update</tt></a>
+</li>
+</ol>
+</div><div style="width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<div id="NTL_res_div">
+<div id="NTL_local">
+<div id="NTL_tree_split_join_timing_test">
+<div id="NTL_assoc">
+<div id="NTL_Native_and_tree-based_container_splits_and_joins"><div style = "border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NTL" id= "NTL"><img src="tree_split_join_timing_test_local.png" alt="no image" /></a></h6>NTL: Native and tree-based container splits and joins - <a href = "assoc_performance_tests.html#local">local</a></div><div style = "width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<h2><a name="observations" id="observations">Observations</a></h2>
+<p>In this test, the native red-black trees must be split and
+    joined externally, through a sequence of <tt>erase</tt> and
+    <tt>insert</tt> operations. This is clearly super-linear, and
+    it is not that surprising that the cost is high.</p>
+<p><tt>pb_ds</tt> 's tree-based containers use in this test the
+    <tt>split</tt> and <tt>join</tt> methods, which have lower
+    complexity: the <tt>join</tt> method of a splay tree ( <a href="tree.html"><tt>tree</tt></a>
+    with <tt>Tag =</tt> <a href="splay_tree_tag.html"><tt>splay_tree_tag</tt></a> ) is
+    quadratic in the length of the longest root-leaf path, and
+    linear in the total number of elements; the <tt>join</tt>
+    method of a red-black tree ( <a href="tree.html"><tt>tree</tt></a>
+    with <tt>Tag =</tt> <a href="rb_tree_tag.html"><tt>rb_tree_tag</tt></a> ) or an
+    ordered-vector tree ( <a href="tree.html"><tt>tree</tt></a>
+    with <tt>Tag =</tt> <a href="ov_tree_tag.html"><tt>ov_tree_tag</tt></a> ) is linear
+    in the number of elements.</p>
+<p>Asides from orders of growth, <tt>pb_ds</tt> 's trees access
+    their allocator very little in these operations, and some of
+    them do not access it at all. This leads to lower constants in
+    their complexity, and, for some containers, to exception-free
+    splits and joins (which can be determined via <a href="assoc_container_traits.html"><tt>container_traits</tt></a>).</p>
+<p>It is important to note that <tt>split</tt> and
+    <tt>join</tt> are not esoteric methods - they are the most
+    efficient means of erasing a contiguous range of values from a
+    tree based container.</p>
+</div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/tree_split_join_timing_test_gcc.png b/libstdc++-v3/docs/html/ext/pb_ds/tree_split_join_timing_test_gcc.png
new file mode 100644
index 00000000000..88867eca6bd
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/tree_split_join_timing_test_gcc.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/tree_split_join_timing_test_local.png b/libstdc++-v3/docs/html/ext/pb_ds/tree_split_join_timing_test_local.png
new file mode 100644
index 00000000000..131d24a1a12
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/tree_split_join_timing_test_local.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/tree_split_join_timing_test_msvc.png b/libstdc++-v3/docs/html/ext/pb_ds/tree_split_join_timing_test_msvc.png
new file mode 100644
index 00000000000..37ed1b2e7c0
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/tree_split_join_timing_test_msvc.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/tree_tag.html b/libstdc++-v3/docs/html/ext/pb_ds/tree_tag.html
new file mode 100644
index 00000000000..e4b20607805
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/tree_tag.html
@@ -0,0 +1,47 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+  <meta name="generator" content=
+  "HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+
+  <title>tree_tag Interface</title>
+  <meta http-equiv="Content-Type" content=
+  "text/html; charset=us-ascii" />
+  </head>
+
+<body>
+  <div id="page">
+    <h1><tt>tree_tag</tt> Interface</h1>
+
+    <p>Basic tree data structure tag.</p>
+
+    <p>Defined in: <a href=
+    "../../../../include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
+
+    <h2><a name="link1" id="link1">Base Classes</a></h2>
+
+    <table class="c1" width="100%" border="1" summary="Bases">
+      <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_tag.html"><span class=
+"c2"><tt>basic_tree_tag</tt></span></a>
+</pre>
+        </td>
+
+        <td>
+          <p>public</p>
+        </td>
+      </tr>
+    </table>
+  </div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/tree_text_find_find_timing_test.html b/libstdc++-v3/docs/html/ext/pb_ds/tree_text_find_find_timing_test.html
new file mode 100644
index 00000000000..283bdf098cd
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/tree_text_find_find_timing_test.html
@@ -0,0 +1,162 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+<meta name="generator" content="HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+<title>Tree Text Find Timing Test</title>
+<meta http-equiv="Content-Type" content="text/html; charset=us-ascii" />
+</head>
+<body>
+<div id="page">
+<h1>Tree-Based and Trie-Based Text <tt>find</tt> Find Timing
+    Test</h1>
+<h2><a name="description" id="description">Description</a></h2>
+<p>This test inserts a number of values with keys from an
+    arbitrary text ([<a href="references.html#wickland96thirty">wickland96thirty</a>]) into
+    a container, then performs a series of finds using
+    <tt>find</tt>. It measures the average time for <tt>find</tt>
+    as a function of the number of values inserted.</p>
+<p>(The test was executed with <a href="../../../../testsuite/performance/ext/pb_ds/text_find_timing.cc"><tt>text_find_timing_test</tt></a>
+    thirty_years_among_the_dead_preproc.txt 200 200 2100)</p>
+<h2><a name="purpose" id="purpose">Purpose</a></h2>
+<p>The test checks the effect of different underlying
+    data structures.</p>
+<h2><a name="results" id="results">Results</a></h2>
+<p>Figures <a href="#NTTG">NTTG</a>, <a href="#NTTM">NTTM</a>,
+    and <a href="#NTTG">NTTL</a> show the results for the native,
+    tree-based, and trie-based types in <a href="assoc_performance_tests.html#gcc"><u>g++</u></a>, <a href="assoc_performance_tests.html#local"><u>local</u></a>, and
+    <a href="assoc_performance_tests.html#local"><u>local</u></a>,
+    respectively.</p>
+<div id="NTTG_res_div">
+<div id="NTTG_gcc">
+<div id="NTTG_text_find_timing_test_tree_like">
+<div id="NTTG_assoc">
+<div id="NTTG_Native_456_tree-based_456_and_trie-based_456_text_find_timing_test_using__tt_find_455tt_"><div style="border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NTTG" id="NTTG"><img src="text_find_timing_test_tree_like_gcc.png" alt="no image" /></a></h6>NTTG: Native, tree-based, and trie-based, text find timing test using <tt>find</tt> - <a href="assoc_performance_tests.html#gcc">g++</a><p>In the above figure, the names in the legends have the following meaning:</p>
+<ol>
+<li>
+splay_tree_map-
+<a href="tree.html"><tt>tree</tt></a>
+ with <tt>Tag</tt> = <a href="splay_tree_tag.html"><tt>splay_tree_tag</tt></a>
+, and <tt>Node_Update</tt> = <a href="null_tree_node_update.html"><tt>null_tree_node_update</tt></a>
+</li>
+<li>
+ov_tree_map-
+<a href="tree.html"><tt>tree</tt></a>
+ with <tt>Tag</tt> = <a href="ov_tree_tag.html"><tt>ov_tree_tag</tt></a>
+, and <tt>Node_Update</tt> = <a href="null_tree_node_update.html"><tt>null_tree_node_update</tt></a>
+</li>
+<li>
+rb_tree_map-
+<a href="tree.html"><tt>tree</tt></a>
+ with <tt>Tag</tt> = <a href="rb_tree_tag.html"><tt>rb_tree_tag</tt></a>
+, and <tt>Node_Update</tt> = <a href="null_tree_node_update.html"><tt>null_tree_node_update</tt></a>
+</li>
+<li>
+n_map-
+<tt>std::map</tt></li>
+<li>
+pat_trie_map-
+<a href="trie.html"><tt>trie</tt></a>
+ with <tt>Tag</tt> = <a href="pat_trie_tag.html"><tt>pat_trie_tag</tt></a>
+, and <tt>Node_Update</tt> = <a href="null_trie_node_update.html"><tt>null_trie_node_update</tt></a>
+</li>
+</ol>
+</div><div style="width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<div id="NTTM_res_div">
+<div id="NTTM_msvc">
+<div id="NTTM_text_find_timing_test_tree_like">
+<div id="NTTM_assoc">
+<div id="NTTM_Native_456_tree-based_456_and_trie-based_456_text_find_timing_test_using__tt_find_455tt_"><div style="border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NTTM" id="NTTM"><img src="text_find_timing_test_tree_like_msvc.png" alt="no image" /></a></h6>NTTM: Native, tree-based, and trie-based, text find timing test using <tt>find</tt> - <a href="assoc_performance_tests.html#msvc">msvc++</a><p>In the above figure, the names in the legends have the following meaning:</p>
+<ol>
+<li>
+splay_tree_map-
+<a href="tree.html"><tt>tree</tt></a>
+ with <tt>Tag</tt> = <a href="splay_tree_tag.html"><tt>splay_tree_tag</tt></a>
+, and <tt>Node_Update</tt> = <a href="null_tree_node_update.html"><tt>null_tree_node_update</tt></a>
+</li>
+<li>
+ov_tree_map-
+<a href="tree.html"><tt>tree</tt></a>
+ with <tt>Tag</tt> = <a href="ov_tree_tag.html"><tt>ov_tree_tag</tt></a>
+, and <tt>Node_Update</tt> = <a href="null_tree_node_update.html"><tt>null_tree_node_update</tt></a>
+</li>
+<li>
+rb_tree_map-
+<a href="tree.html"><tt>tree</tt></a>
+ with <tt>Tag</tt> = <a href="rb_tree_tag.html"><tt>rb_tree_tag</tt></a>
+, and <tt>Node_Update</tt> = <a href="null_tree_node_update.html"><tt>null_tree_node_update</tt></a>
+</li>
+<li>
+n_map-
+<tt>std::map</tt></li>
+<li>
+pat_trie_map-
+<a href="trie.html"><tt>trie</tt></a>
+ with <tt>Tag</tt> = <a href="pat_trie_tag.html"><tt>pat_trie_tag</tt></a>
+, and <tt>Node_Update</tt> = <a href="null_trie_node_update.html"><tt>null_trie_node_update</tt></a>
+</li>
+</ol>
+</div><div style="width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<div id="NTTL_res_div">
+<div id="NTTL_local">
+<div id="NTTL_text_find_timing_test_tree_like">
+<div id="NTTL_assoc">
+<div id="NTTL_Native_456_tree-based_456_and_trie-based_456_text_find_timing_test_using__tt_find_455tt_"><div style = "border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NTTL" id= "NTTL"><img src="text_find_timing_test_tree_like_local.png" alt="no image" /></a></h6>NTTL: Native, tree-based, and trie-based, text find timing test using <tt>find</tt> - <a href = "assoc_performance_tests.html#local">local</a></div><div style = "width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<h2><a name="observations" id="observations">Observations</a></h2>
+<p>For this setting, a splay tree (<a href="tree.html"><tt>tree</tt></a>
+    with <tt>Tag =</tt> <a href="splay_tree_tag.html"><tt>splay_tree_tag</tt></a>) does
+    not do well. This is possibly due to two reasons:</p>
+<ol>
+<li>A splay tree is not guaranteed to be balanced [<a href="references.html#motwani95random">motwani95random</a>]. If a
+      splay tree contains <i>n</i> nodes, its average root-leaf
+      path can be <i>m &gt;&gt; log(n)</i>.</li>
+<li>Assume a specific root-leaf search path has length
+      <i>m</i>, and the search-target node has distance <i>m'</i>
+      from the root. A red-black tree will require <i>m + 1</i>
+      comparisons to find the required node; a splay tree will
+      require <i>2 m'</i> comparisons. A splay tree, consequently,
+      can perform many more comparisons than a red-black tree.</li>
+</ol>
+<p>An ordered-vector tree (<a href="tree.html"><tt>tree</tt></a>
+    with <tt>Tag =</tt> <a href="ov_tree_tag.html"><tt>ov_tree_tag</tt></a>), a red-black
+    tree (<a href="tree.html"><tt>tree</tt></a>
+    with <tt>Tag =</tt> <a href="splay_tree_tag.html"><tt>rb_tree_tag</tt></a>), and the
+    native red-black tree all share approximately the same
+    performance.</p>
+<p>An ordered-vector tree is slightly slower than red-black
+    trees, since it requires, in order to find a key, more math
+    operations than they do. Conversely, an ordered-vector tree
+    requires far lower space than the others. ([<a href="references.html#austern00noset">austern00noset</a>], however,
+    seems to have an implementation that is also faster than a
+    red-black tree).</p>
+<p>A PATRICIA trie (<a href="trie.html"><tt>trie</tt></a>
+    with <tt>Tag =</tt> <a href="pat_trie_tag.html"><tt>pat_trie_tag</tt></a>) has good
+    look-up performance, due to its large fan-out in this case. In
+    this setting, a PATRICIA trie has look-up performance comparable
+    to a hash table (see <a href="hash_text_find_find_timing_test.html">Hash-Based Text
+    <tt>find</tt> Find Timing Test</a>), but it is order
+    preserving. This is not that surprising, since a large-fan-out
+    PATRICIA trie works like a hash table with collisions resolved
+    by a sub-trie. A large-fan-out PATRICIA trie does not do well on
+    modifications (see <a href="tree_text_insert_timing_test.html">Tree-Based and Trie-Based
+    Text Insert Timing Test</a>). It is possibly beneficial to
+    semi-static settings, therefore.</p>
+<p><a href="assoc_performance_tests.html#tree_like_based_types">Observations::Tree-Like-Based
+    Container Types</a> summarizes some observations on tree-based
+    and trie-based containers.</p>
+</div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/tree_text_insert_timing_test.html b/libstdc++-v3/docs/html/ext/pb_ds/tree_text_insert_timing_test.html
new file mode 100644
index 00000000000..6f0e26c00d6
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/tree_text_insert_timing_test.html
@@ -0,0 +1,226 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+<meta name="generator" content="HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+<title>Tree Text Insert Timing Test</title>
+<meta http-equiv="Content-Type" content="text/html; charset=us-ascii" />
+</head>
+<body>
+<div id="page">
+<h1>Tree-Based and Trie-Based Text Insert Timing Test</h1>
+<h2><a name="description" id="description">Description</a></h2>
+<p>This test inserts a number of values with keys from an
+    arbitrary text ([ <a href="references.html#wickland96thirty">wickland96thirty</a> ]) into
+    a container using <tt>insert</tt> . It measures the average
+    time for <tt>insert</tt> as a function of the number of values
+    inserted.</p>
+<p>(The test was executed with <a href="../../../../testsuite/performance/ext/pb_ds/tree_text_insert_timing.cc"><tt>tree_text_insert_timing_test</tt></a>
+    thirty_years_among_the_dead_preproc.txt 200 200 2100)</p>
+<h2><a name="purpose" id="purpose">Purpose</a></h2>
+<p>The test checks the effect of different underlying
+    data structures.</p>
+<h2><a name="results" id="results">Results</a></h2>
+<p>Figures <a href="#NNTG">NNTG</a>, <a href="#NVTG">NVTG</a>,
+    and <a href="#NPTG">NPTG</a> show the results for the native
+    tree and <tt>pb_ds</tt>'s node-based trees, the native tree and
+    <tt>pb_ds</tt>'s vector-based trees, and the native tree
+    and<tt>pb_ds</tt>'s PATRICIA-trie, respectively, in <a href="assoc_performance_tests.html#gcc"><u>g++</u></a>; Figures
+    <a href="#NNTM">NNTM</a>, <a href="#NVTM">NVTM</a>, and
+    <a href="#NPTM">NPTM</a> show the same in <a href="assoc_performance_tests.html#msvc"><u>msvc++</u></a>; Figures
+    <a href="#NNTL">NNTL</a>, <a href="#NVTL">NVTL</a>, and
+    <a href="#NPTL">NPTL</a> show the same in <a href="assoc_performance_tests.html#local"><u>local</u></a>.</p>
+<div id="NNTG_res_div">
+<div id="NNTG_gcc">
+<div id="NNTG_tree_text_insert_timing_test_node_tree">
+<div id="NNTG_assoc">
+<div id="NNTG_Native_tree_and_node-based_trees_text_insert_timing_test_using__tt_insert_455tt_"><div style="border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NNTG" id="NNTG"><img src="tree_text_insert_timing_test_node_tree_gcc.png" alt="no image" /></a></h6>NNTG: Native tree and node-based trees text insert timing test using <tt>insert</tt> - <a href="assoc_performance_tests.html#gcc">g++</a><p>In the above figure, the names in the legends have the following meaning:</p>
+<ol>
+<li>
+splay_tree_map-
+<a href="tree.html"><tt>tree</tt></a>
+ with <tt>Tag</tt> = <a href="splay_tree_tag.html"><tt>splay_tree_tag</tt></a>
+, and <tt>Node_Update</tt> = <a href="null_tree_node_update.html"><tt>null_tree_node_update</tt></a>
+</li>
+<li>
+n_map-
+<tt>std::map</tt></li>
+<li>
+rb_tree_map-
+<a href="tree.html"><tt>tree</tt></a>
+ with <tt>Tag</tt> = <a href="rb_tree_tag.html"><tt>rb_tree_tag</tt></a>
+, and <tt>Node_Update</tt> = <a href="null_tree_node_update.html"><tt>null_tree_node_update</tt></a>
+</li>
+</ol>
+</div><div style="width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<div id="NVTG_res_div">
+<div id="NVTG_gcc">
+<div id="NVTG_tree_text_insert_timing_test_vector_tree">
+<div id="NVTG_assoc">
+<div id="NVTG_Native_tree_and_vector-based_tree_text_insert_timing_test_using__tt_insert_455tt_"><div style="border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NVTG" id="NVTG"><img src="tree_text_insert_timing_test_vector_tree_gcc.png" alt="no image" /></a></h6>NVTG: Native tree and vector-based tree text insert timing test using <tt>insert</tt> - <a href="assoc_performance_tests.html#gcc">g++</a><p>In the above figure, the names in the legends have the following meaning:</p>
+<ol>
+<li>
+ov_tree_map-
+<a href="tree.html"><tt>tree</tt></a>
+ with <tt>Tag</tt> = <a href="ov_tree_tag.html"><tt>ov_tree_tag</tt></a>
+, and <tt>Node_Update</tt> = <a href="null_tree_node_update.html"><tt>null_tree_node_update</tt></a>
+</li>
+<li>
+n_map-
+<tt>std::map</tt></li>
+</ol>
+</div><div style="width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<div id="NPTG_res_div">
+<div id="NPTG_gcc">
+<div id="NPTG_tree_text_insert_timing_test_pat_trie">
+<div id="NPTG_assoc">
+<div id="NPTG_Native_tree_and_PATRICIA_trie_text_insert_timing_test_using__tt_insert_455tt_"><div style="border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NPTG" id="NPTG"><img src="tree_text_insert_timing_test_pat_trie_gcc.png" alt="no image" /></a></h6>NPTG: Native tree and PATRICIA trie text insert timing test using <tt>insert</tt> - <a href="assoc_performance_tests.html#gcc">g++</a><p>In the above figure, the names in the legends have the following meaning:</p>
+<ol>
+<li>
+n_map-
+<tt>std::map</tt></li>
+<li>
+pat_trie_map-
+<a href="trie.html"><tt>trie</tt></a>
+ with <tt>Tag</tt> = <a href="pat_trie_tag.html"><tt>pat_trie_tag</tt></a>
+, and <tt>Node_Update</tt> = <a href="null_trie_node_update.html"><tt>null_trie_node_update</tt></a>
+</li>
+</ol>
+</div><div style="width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<div id="NNTM_res_div">
+<div id="NNTM_msvc">
+<div id="NNTM_tree_text_insert_timing_test_node_tree">
+<div id="NNTM_assoc">
+<div id="NNTM_Native_tree_and_node-based_trees_text_insert_timing_test_using__tt_insert_455tt_"><div style="border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NNTM" id="NNTM"><img src="tree_text_insert_timing_test_node_tree_msvc.png" alt="no image" /></a></h6>NNTM: Native tree and node-based trees text insert timing test using <tt>insert</tt> - <a href="assoc_performance_tests.html#msvc">msvc++</a><p>In the above figure, the names in the legends have the following meaning:</p>
+<ol>
+<li>
+splay_tree_map-
+<a href="tree.html"><tt>tree</tt></a>
+ with <tt>Tag</tt> = <a href="splay_tree_tag.html"><tt>splay_tree_tag</tt></a>
+, and <tt>Node_Update</tt> = <a href="null_tree_node_update.html"><tt>null_tree_node_update</tt></a>
+</li>
+<li>
+n_map-
+<tt>std::map</tt></li>
+<li>
+rb_tree_map-
+<a href="tree.html"><tt>tree</tt></a>
+ with <tt>Tag</tt> = <a href="rb_tree_tag.html"><tt>rb_tree_tag</tt></a>
+, and <tt>Node_Update</tt> = <a href="null_tree_node_update.html"><tt>null_tree_node_update</tt></a>
+</li>
+</ol>
+</div><div style="width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<div id="NVTM_res_div">
+<div id="NVTM_msvc">
+<div id="NVTM_tree_text_insert_timing_test_vector_tree">
+<div id="NVTM_assoc">
+<div id="NVTM_Native_tree_and_vector-based_tree_text_insert_timing_test_using__tt_insert_455tt_"><div style="border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NVTM" id="NVTM"><img src="tree_text_insert_timing_test_vector_tree_msvc.png" alt="no image" /></a></h6>NVTM: Native tree and vector-based tree text insert timing test using <tt>insert</tt> - <a href="assoc_performance_tests.html#msvc">msvc++</a><p>In the above figure, the names in the legends have the following meaning:</p>
+<ol>
+<li>
+ov_tree_map-
+<a href="tree.html"><tt>tree</tt></a>
+ with <tt>Tag</tt> = <a href="ov_tree_tag.html"><tt>ov_tree_tag</tt></a>
+, and <tt>Node_Update</tt> = <a href="null_tree_node_update.html"><tt>null_tree_node_update</tt></a>
+</li>
+<li>
+n_map-
+<tt>std::map</tt></li>
+</ol>
+</div><div style="width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<div id="NPTM_res_div">
+<div id="NPTM_msvc">
+<div id="NPTM_tree_text_insert_timing_test_pat_trie">
+<div id="NPTM_assoc">
+<div id="NPTM_Native_tree_and_PATRICIA_trie_text_insert_timing_test_using__tt_insert_455tt_"><div style="border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NPTM" id="NPTM"><img src="tree_text_insert_timing_test_pat_trie_msvc.png" alt="no image" /></a></h6>NPTM: Native tree and PATRICIA trie text insert timing test using <tt>insert</tt> - <a href="assoc_performance_tests.html#msvc">msvc++</a><p>In the above figure, the names in the legends have the following meaning:</p>
+<ol>
+<li>
+pat_trie_map-
+<a href="trie.html"><tt>trie</tt></a>
+ with <tt>Tag</tt> = <a href="pat_trie_tag.html"><tt>pat_trie_tag</tt></a>
+, and <tt>Node_Update</tt> = <a href="null_trie_node_update.html"><tt>null_trie_node_update</tt></a>
+</li>
+<li>
+n_map-
+<tt>std::map</tt></li>
+</ol>
+</div><div style="width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<div id="NNTL_res_div">
+<div id="NNTL_local">
+<div id="NNTL_tree_text_insert_timing_test_node_tree">
+<div id="NNTL_assoc">
+<div id="NNTL_Native_tree_and_node-based_trees_text_insert_timing_test_using__tt_insert_455tt_"><div style = "border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NNTL" id= "NNTL"><img src="tree_text_insert_timing_test_node_tree_local.png" alt="no image" /></a></h6>NNTL: Native tree and node-based trees text insert timing test using <tt>insert</tt> - <a href = "assoc_performance_tests.html#local">local</a></div><div style = "width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<div id="NVTL_res_div">
+<div id="NVTL_local">
+<div id="NVTL_tree_text_insert_timing_test_vector_tree">
+<div id="NVTL_assoc">
+<div id="NVTL_Native_tree_and_vector-based_tree_text_insert_timing_test_using__tt_insert_455tt_"><div style = "border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NVTL" id= "NVTL"><img src="tree_text_insert_timing_test_vector_tree_local.png" alt="no image" /></a></h6>NVTL: Native tree and vector-based tree text insert timing test using <tt>insert</tt> - <a href = "assoc_performance_tests.html#local">local</a></div><div style = "width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<div id="NPTL_res_div">
+<div id="NPTL_local">
+<div id="NPTL_tree_text_insert_timing_test_pat_trie">
+<div id="NPTL_assoc">
+<div id="NPTL_Native_tree_and_PATRICIA_trie_text_insert_timing_test_using__tt_insert_455tt_"><div style = "border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NPTL" id= "NPTL"><img src="tree_text_insert_timing_test_pat_trie_local.png" alt="no image" /></a></h6>NPTL: Native tree and PATRICIA trie text insert timing test using <tt>insert</tt> - <a href = "assoc_performance_tests.html#local">local</a></div><div style = "width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<h2><a name="observations" id="observations">Observations</a></h2>
+<p>Observing Figure <a href="#NNTG">NNTG</a> , for this
+    setting, a splay tree, ( <a href="tree.html"><tt>tree</tt></a>
+    with <tt>Tag =</tt> <a href="splay_tree_tag.html"><tt>splay_tree_tag</tt></a> ) does
+    not do well. This was covered in <a href="tree_text_find_find_timing_test.html">Tree-Based and
+    Trie-Based Text <tt>find</tt> Find Timing Test</a> . The two
+    red-black trees perform better.</p>
+<p>Observing Figure <a href="#NVTG">NVTG</a>, an ordered-vector
+    tree ( <a href="tree.html"><tt>tree</tt></a>
+    with <tt>Tag =</tt> <a href="ov_tree_tag.html"><tt>ov_tree_tag</tt></a>) performs
+    abysmally. Inserting into this type of tree has linear
+    complexity [ <a href="references.html#austern00noset">austern00noset</a>].</p>
+<p>Observing Figure <a href="#NPTG">NPTG</a> , A PATRICIA trie
+    ( <a href="trie.html"><tt>trie</tt></a>
+    with <tt>Tag =</tt> <a href="pat_trie_tag.html"><tt>pat_trie_tag</tt></a> ) has
+    abysmal performance, as well. This is not that surprising,
+    since a large-fan-out PATRICIA trie works like a hash table with
+    collisions resolved by a sub-trie. Each time a collision is
+    encountered, a new "hash-table" is built A large fan-out
+    PATRICIA trie, however, doe does well in look-ups (see <a href="tree_text_find_find_timing_test.html">Tree-Based and
+    Trie-Based Text <tt>find</tt> Find Timing Test</a> ). It is
+    possibly beneficial to semi-static settings, therefore.</p>
+<p><a href="assoc_performance_tests.html#tree_like_based_types">Observations::Tree-Like-Based
+    Container Types</a> summarizes some observations on tree-based
+    and trie-based containers.</p>
+</div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/tree_text_insert_timing_test_node_tree_gcc.png b/libstdc++-v3/docs/html/ext/pb_ds/tree_text_insert_timing_test_node_tree_gcc.png
new file mode 100644
index 00000000000..22d8f6fc213
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/tree_text_insert_timing_test_node_tree_gcc.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/tree_text_insert_timing_test_node_tree_local.png b/libstdc++-v3/docs/html/ext/pb_ds/tree_text_insert_timing_test_node_tree_local.png
new file mode 100644
index 00000000000..bb100084b3f
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/tree_text_insert_timing_test_node_tree_local.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/tree_text_insert_timing_test_node_tree_msvc.png b/libstdc++-v3/docs/html/ext/pb_ds/tree_text_insert_timing_test_node_tree_msvc.png
new file mode 100644
index 00000000000..18b219851c2
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/tree_text_insert_timing_test_node_tree_msvc.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/tree_text_insert_timing_test_pat_trie_gcc.png b/libstdc++-v3/docs/html/ext/pb_ds/tree_text_insert_timing_test_pat_trie_gcc.png
new file mode 100644
index 00000000000..5fe063e63c2
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/tree_text_insert_timing_test_pat_trie_gcc.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/tree_text_insert_timing_test_pat_trie_local.png b/libstdc++-v3/docs/html/ext/pb_ds/tree_text_insert_timing_test_pat_trie_local.png
new file mode 100644
index 00000000000..228de144222
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/tree_text_insert_timing_test_pat_trie_local.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/tree_text_insert_timing_test_pat_trie_msvc.png b/libstdc++-v3/docs/html/ext/pb_ds/tree_text_insert_timing_test_pat_trie_msvc.png
new file mode 100644
index 00000000000..9f13db0c093
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/tree_text_insert_timing_test_pat_trie_msvc.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/tree_text_insert_timing_test_vector_tree_gcc.png b/libstdc++-v3/docs/html/ext/pb_ds/tree_text_insert_timing_test_vector_tree_gcc.png
new file mode 100644
index 00000000000..dd85dcd7ca2
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/tree_text_insert_timing_test_vector_tree_gcc.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/tree_text_insert_timing_test_vector_tree_local.png b/libstdc++-v3/docs/html/ext/pb_ds/tree_text_insert_timing_test_vector_tree_local.png
new file mode 100644
index 00000000000..cecb8a10750
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/tree_text_insert_timing_test_vector_tree_local.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/tree_text_insert_timing_test_vector_tree_msvc.png b/libstdc++-v3/docs/html/ext/pb_ds/tree_text_insert_timing_test_vector_tree_msvc.png
new file mode 100644
index 00000000000..8c07313910f
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/tree_text_insert_timing_test_vector_tree_msvc.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/tree_text_lor_find_find_timing_test.html b/libstdc++-v3/docs/html/ext/pb_ds/tree_text_lor_find_find_timing_test.html
new file mode 100644
index 00000000000..48d0112c6ea
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/tree_text_lor_find_find_timing_test.html
@@ -0,0 +1,126 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+<meta name="generator" content="HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+<title>Tree Text Locality of Reference Find Timing Test</title>
+<meta http-equiv="Content-Type" content="text/html; charset=us-ascii" />
+</head>
+<body>
+<div id="page">
+<h1>Tree-Based Locality-of-Reference Text <tt>find</tt> Find
+    Timing Test</h1>
+<h2><a name="description" id="description">Description</a></h2>
+<p>This test inserts a number of values with keys from an
+    arbitrary text ([ <a href="references.html#wickland96thirty">wickland96thirty</a> ]) into
+    a container, then performs a series of finds using
+    <tt>find</tt> . It is different than <a href="tree_text_find_find_timing_test.html">Tree-Based and
+    Trie-Based Text <tt>find</tt> Find Timing Test</a> in the
+    sequence of finds it performs: this test performs multiple
+    <tt>find</tt> s on the same key before moving on to the next
+    key. It measures the average time for <tt>find</tt> as a
+    function of the number of values inserted.</p>
+<p>(The test was executed with <a href="../../../../testsuite/performance/ext/pb_ds/tree_text_lor_find_timing.cc"><tt>tree_text_lor_find_timing_test</tt></a>
+    thirty_years_among_the_dead_preproc.txt 200 200 2100)</p>
+<h2><a name="purpose" id="purpose">Purpose</a></h2>
+<p>The test checks the effect of different underlying
+    data structures in a locality-of-reference setting.</p>
+<h2><a name="results" id="results">Results</a></h2>
+<p>Figures <a href="#NTG">NTG</a>, <a href="#NTM">NTM</a>, and
+    <a href="#NTL">NTL</a> show the results for the native and
+    <tt>pb_ds</tt> tree-based types in <a href="assoc_performance_tests.html#gcc"><u>g++</u></a>, <a href="assoc_performance_tests.html#msvc"><u>msvc++</u></a> and
+    <a href="assoc_performance_tests.html#local"><u>local</u></a>,
+    respectively.</p>
+<div id="NTG_res_div">
+<div id="NTG_gcc">
+<div id="NTG_tree_text_lor_find_timing_test">
+<div id="NTG_assoc">
+<div id="NTG_Native_and_tree-based_locality-of-reference_text_find_timing_test_using__tt_find_455tt_"><div style="border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NTG" id="NTG"><img src="tree_text_lor_find_timing_test_gcc.png" alt="no image" /></a></h6>NTG: Native and tree-based locality-of-reference text find timing test using <tt>find</tt> - <a href="assoc_performance_tests.html#gcc">g++</a><p>In the above figure, the names in the legends have the following meaning:</p>
+<ol>
+<li>
+ov_tree_map-
+<a href="tree.html"><tt>tree</tt></a>
+ with <tt>Tag</tt> = <a href="ov_tree_tag.html"><tt>ov_tree_tag</tt></a>
+, and <tt>Node_Update</tt> = <a href="null_tree_node_update.html"><tt>null_tree_node_update</tt></a>
+</li>
+<li>
+rb_tree_map-
+<a href="tree.html"><tt>tree</tt></a>
+ with <tt>Tag</tt> = <a href="rb_tree_tag.html"><tt>rb_tree_tag</tt></a>
+, and <tt>Node_Update</tt> = <a href="null_tree_node_update.html"><tt>null_tree_node_update</tt></a>
+</li>
+<li>
+n_map-
+<tt>std::map</tt></li>
+<li>
+splay_tree_map-
+<a href="tree.html"><tt>tree</tt></a>
+ with <tt>Tag</tt> = <a href="splay_tree_tag.html"><tt>splay_tree_tag</tt></a>
+, and <tt>Node_Update</tt> = <a href="null_tree_node_update.html"><tt>null_tree_node_update</tt></a>
+</li>
+</ol>
+</div><div style="width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<div id="NTM_res_div">
+<div id="NTM_msvc">
+<div id="NTM_tree_text_lor_find_timing_test">
+<div id="NTM_assoc">
+<div id="NTM_Native_and_tree-based_locality-of-reference_text_find_timing_test_using__tt_find_455tt_"><div style="border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NTM" id="NTM"><img src="tree_text_lor_find_timing_test_msvc.png" alt="no image" /></a></h6>NTM: Native and tree-based locality-of-reference text find timing test using <tt>find</tt> - <a href="assoc_performance_tests.html#msvc">msvc++</a><p>In the above figure, the names in the legends have the following meaning:</p>
+<ol>
+<li>
+ov_tree_map-
+<a href="tree.html"><tt>tree</tt></a>
+ with <tt>Tag</tt> = <a href="ov_tree_tag.html"><tt>ov_tree_tag</tt></a>
+, and <tt>Node_Update</tt> = <a href="null_tree_node_update.html"><tt>null_tree_node_update</tt></a>
+</li>
+<li>
+rb_tree_map-
+<a href="tree.html"><tt>tree</tt></a>
+ with <tt>Tag</tt> = <a href="rb_tree_tag.html"><tt>rb_tree_tag</tt></a>
+, and <tt>Node_Update</tt> = <a href="null_tree_node_update.html"><tt>null_tree_node_update</tt></a>
+</li>
+<li>
+n_map-
+<tt>std::map</tt></li>
+<li>
+splay_tree_map-
+<a href="tree.html"><tt>tree</tt></a>
+ with <tt>Tag</tt> = <a href="splay_tree_tag.html"><tt>splay_tree_tag</tt></a>
+, and <tt>Node_Update</tt> = <a href="null_tree_node_update.html"><tt>null_tree_node_update</tt></a>
+</li>
+</ol>
+</div><div style="width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<div id="NTL_res_div">
+<div id="NTL_local">
+<div id="NTL_tree_text_lor_find_timing_test">
+<div id="NTL_assoc">
+<div id="NTL_Native_and_tree-based_locality-of-reference_text_find_timing_test_using__tt_find_455tt_"><div style = "border-style: dotted; border-width: 1px; border-color: lightgray"><h6 class="c1"><a name="NTL" id= "NTL"><img src="tree_text_lor_find_timing_test_local.png" alt="no image" /></a></h6>NTL: Native and tree-based locality-of-reference text find timing test using <tt>find</tt> - <a href = "assoc_performance_tests.html#local">local</a></div><div style = "width: 100%; height: 20px"></div></div>
+</div>
+</div>
+</div>
+</div>
+<h2><a name="observations" id="observations">Observations</a></h2>
+<p>For this setting, an ordered-vector tree ( <a href="tree.html"><tt>tree</tt></a>
+    with <tt>Tag =</tt> <a href="ov_tree_tag.html"><tt>ov_tree_tag</tt></a> ), a
+    red-black tree ( <a href="tree.html"><tt>tree</tt></a>
+    with <tt>Tag =</tt> <a href="splay_tree_tag.html"><tt>rb_tree_tag</tt></a> ), and the
+    native red-black tree all share approximately the same
+    performance.</p>
+<p>A splay tree ( <a href="tree.html"><tt>tree</tt></a>
+    with <tt>Tag =</tt> <a href="splay_tree_tag.html"><tt>splay_tree_tag</tt></a> ) does
+    much better, since each (successful) find "bubbles" the
+    corresponding node to the root of the tree.</p>
+<p><a href="assoc_performance_tests.html#tree_like_based_types">Observations::Tree-Like-Based
+    Container Types</a> summarizes some observations on tree-based
+    and trie-based containers.</p>
+</div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/tree_text_lor_find_timing_test_gcc.png b/libstdc++-v3/docs/html/ext/pb_ds/tree_text_lor_find_timing_test_gcc.png
new file mode 100644
index 00000000000..cf5174d99c1
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/tree_text_lor_find_timing_test_gcc.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/tree_text_lor_find_timing_test_local.png b/libstdc++-v3/docs/html/ext/pb_ds/tree_text_lor_find_timing_test_local.png
new file mode 100644
index 00000000000..26f71510ff0
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/tree_text_lor_find_timing_test_local.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/tree_text_lor_find_timing_test_msvc.png b/libstdc++-v3/docs/html/ext/pb_ds/tree_text_lor_find_timing_test_msvc.png
new file mode 100644
index 00000000000..583a027f3dc
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/tree_text_lor_find_timing_test_msvc.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/trie.html b/libstdc++-v3/docs/html/ext/pb_ds/trie.html
new file mode 100644
index 00000000000..71a86883386
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/trie.html
@@ -0,0 +1,489 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+  <meta name="generator" content=
+  "HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+
+  <title>trie Interface</title>
+  <meta http-equiv="Content-Type" content=
+  "text/html; charset=us-ascii" />
+  </head>
+
+<body>
+  <div id="page">
+    <h1><tt>trie</tt> Interface</h1>
+
+    <p>A concrete basic trie-based associative container.</p>
+
+    <p>Defined in: <a href=
+    "../../../../include/ext/pb_ds/assoc_container.hpp"><tt>assoc_container.hpp</tt></a></p>
+
+    <h2><a name="link1" id="link1">Template Parameters</a></h2>
+
+    <table class="c1" width="100%" border="1" summary=
+    "Template Parameters">
+      <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="Key2501" id="Key2501"><b>typename</b> Key</a>
+</pre>
+        </td>
+
+        <td>
+          <p>Key type.</p>
+        </td>
+
+        <td>-</td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="Mapped318655" id="Mapped318655"><b>typename</b> Mapped</a>
+</pre>
+        </td>
+
+        <td>
+          <p>Mapped type.</p>
+        </td>
+
+        <td>-</td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="E_Access_Traits686553840" id=
+"E_Access_Traits686553840"><b>class</b> E_Access_Traits </a>
+</pre>
+        </td>
+
+        <td>
+          <p>Element-access traits.</p>
+        </td>
+
+        <td>-</td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="Tag278938" id="Tag278938"><b>class</b> Tag </a>
+</pre>
+        </td>
+
+        <td>
+          <p>Data-structure tag.</p>
+        </td>
+
+        <td><a href="pat_trie_tag.html"><span class=
+        "c2"><tt>pat_trie_tag</tt></span></a></td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="Node_Update841554648" id=
+"Node_Update841554648"><b>template</b>&lt; 
+  <b>typename</b> Const_Node_Iterator, 
+  <b>typename</b> Node_Iterator, 
+  <b>class</b> E_Access_Traits_, 
+  <b>typename</b> Allocator_&gt;
+<b>class</b> Node_Update </a>
+</pre>
+        </td>
+
+        <td>
+          <p>Node updater type.</p>
+
+          <p><a href=
+          "tree_based_containers.html#invariants">Design::Tree-Based
+          Containers::Node Invariants</a> explains this
+          concept.</p>
+        </td>
+
+        <td><a href="null_trie_node_update.html"><span class=
+        "c2"><tt>null_trie_node_update</tt></span></a></td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="Allocator35940069" id=
+"Allocator35940069"><b>class</b> 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" id="link2">Public Types and
+    Constants</a></h2>
+
+    <h3><a name="link3" id="link3">Policy Definitions</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Types">
+      <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="e_access_traits1948190928" id=
+"e_access_traits1948190928">e_access_traits</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<a href="#E_Access_Traits686553840"><tt>E_Access_Traits</tt></a>
+</pre>
+        </td>
+
+        <td>
+          <p>Element access traits type.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h3><a name="link4" id="link4">Iterator Definitions</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Types">
+      <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_node_iterator4205924553" id=
+"const_node_iterator4205924553">const_node_iterator</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<a href=
+"trie_const_node_iterator.html"><span class=
+"c2"><tt>const_node_iterator</tt></span></a>
+</pre>
+        </td>
+
+        <td>
+          <p>Const node iterator.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="node_iterator3431975247" id=
+"node_iterator3431975247">node_iterator</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<a href="trie_node_iterator.html"><span class=
+"c2"><tt>node_iterator</tt></span></a>
+</pre>
+        </td>
+
+        <td>
+          <p>Node iterator.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h2><a name="link5" id="link5">Public Methods</a></h2>
+
+    <h3><a name="link6" id="link6">Constructors, Destructor, and
+    Related</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <tr>
+        <td width="45%" align="left"><b>Method</b></td>
+
+        <td width="55%" align="left"><b>Description</b></td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+  trie
+  ()
+</pre>
+        </td>
+
+        <td>
+          <p>Default constructor.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+  trie
+  (<b>const</b> <a href=
+"#E_Access_Traits686553840"><tt>E_Access_Traits</tt></a> &amp;r_e_access_traits)
+</pre>
+        </td>
+
+        <td>
+          <p>Constructor taking some policy objects. <span class=
+          "c1"><tt>r_e_access_traits</tt></span> will be copied by
+          the <a href=
+          "#E_Access_Traits686553840"><tt>E_Access_Traits</tt></a>
+          object of the container object.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<b>template</b>&lt;
+    <b>class</b> It&gt;
+  trie
+  (It first_it, 
+    It last_it)
+</pre>
+        </td>
+
+        <td>
+          <p>Constructor taking iterators to a range of
+          value_types. The value_types between <span class=
+          "c1"><tt>first_it</tt></span> and <span class=
+          "c1"><tt>last_it</tt></span> will be inserted into the
+          container object.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<b>template</b>&lt;
+    <b>class</b> It&gt;
+  trie
+  (It first_it, 
+    It last_it,
+    <b>const</b> <a href=
+"#E_Access_Traits686553840"><tt>E_Access_Traits</tt></a> &amp;r_e_access_traits)
+</pre>
+        </td>
+
+        <td>
+          <p>Constructor taking iterators to a range of value_types
+          and some policy objects. The value_types between
+          <span class="c1"><tt>first_it</tt></span> and
+          <span class="c1"><tt>last_it</tt></span> will be inserted
+          into the container object.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+  trie
+  (<b>const</b> <span class=
+"c2"><tt>trie</tt></span> &amp;other)
+</pre>
+        </td>
+
+        <td>
+          <p>Copy constructor.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<b>virtual</b> 
+  ~trie
+  ()
+</pre>
+        </td>
+
+        <td>
+          <p>Destructor.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<span class="c2"><tt>trie</tt></span> &amp;
+  <b>operator</b>=
+  (<b>const</b> <span class=
+"c2"><tt>trie</tt></span> &amp;other)
+</pre>
+        </td>
+
+        <td>
+          <p>Assignment operator.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<b>void</b>
+  swap
+  (<span class=
+"c2"><tt>trie</tt></span> &amp;other)
+</pre>
+        </td>
+
+        <td>
+          <p>Swaps content.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h3><a name="link7" id="link7">Policy Access Methods</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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=
+"#e_access_traits1948190928"><tt>e_access_traits</tt></a> &amp;
+  get_e_access_traits
+  ()
+</pre>
+        </td>
+
+        <td>
+          <p>Access to the comb_hash_fn object.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a href=
+"#e_access_traits1948190928"><tt>e_access_traits</tt></a> &amp;
+  get_e_access_traits
+  () <b>const</b>
+</pre>
+        </td>
+
+        <td>
+          <p>Const access to the comb_hash_fn object.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h3><a name="link8" id="link8">Node-Iteration Methods</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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="#node_iterator3431975247"><tt>node_iterator</tt></a>
+  node_begin
+  ()
+</pre>
+        </td>
+
+        <td>
+          <p>Returns a <a href=
+          "#node_iterator3431975247"><tt>node_iterator</tt></a>
+          corresponding to the node at the root of the trie.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a href=
+"#const_node_iterator4205924553"><tt>const_node_iterator</tt></a>
+  node_begin
+  () <b>const</b>
+</pre>
+        </td>
+
+        <td>
+          <p>Returns a <a href=
+          "#const_node_iterator4205924553"><tt>const_node_iterator</tt></a>
+          corresponding to the node at the root of the trie.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a href="#node_iterator3431975247"><tt>node_iterator</tt></a>
+  node_end
+  ()
+</pre>
+        </td>
+
+        <td>
+          <p>Returns a <a href=
+          "#node_iterator3431975247"><tt>node_iterator</tt></a>
+          corresponding to a node just after a leaf of the
+          trie.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a href=
+"#const_node_iterator4205924553"><tt>const_node_iterator</tt></a>
+  node_end
+  () <b>const</b>
+</pre>
+        </td>
+
+        <td>
+          <p>Returns a <a href=
+          "#const_node_iterator4205924553"><tt>const_node_iterator</tt></a>
+          corresponding to a node just after a leaf of the
+          trie.</p>
+        </td>
+      </tr>
+    </table>
+  </div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/trie_based_containers.html b/libstdc++-v3/docs/html/ext/pb_ds/trie_based_containers.html
new file mode 100644
index 00000000000..8b670bc11dc
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/trie_based_containers.html
@@ -0,0 +1,241 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+  <meta name="generator" content=
+  "HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+
+  <title>Trie-Based Containers</title>
+  <meta http-equiv="Content-Type" content=
+  "text/html; charset=us-ascii" />
+  </head>
+
+<body>
+  <div id="page">
+    <h1>Trie Design</h1>
+
+    <h2><a name="overview" id="overview">Overview</a></h2>
+
+    <p>The trie-based container has the following declaration:</p>
+    <pre>
+<b>template</b>&lt;
+    <b>typename</b> Key,
+    <b>typename</b> Mapped,
+    <b>typename</b> Cmp_Fn = std::less&lt;Key&gt;,
+    <b>typename</b> Tag =  <a href="pat_trie_tag.html">pat_trie_tag</a>,
+    <b>template</b>&lt;
+        <b>typename</b> Const_Node_Iterator,
+        <b>typename</b> Node_Iterator,
+        <b>typename</b> E_Access_Traits_,
+        <b>typename</b> Allocator_&gt;
+    <b>class</b> Node_Update = <a href=
+"null_trie_node_update.html">null_trie_node_update</a>,
+    <b>typename</b> Allocator = std::allocator&lt;<b>char</b>&gt; &gt;
+<b>class</b> <a href=
+"trie.html">trie</a>;
+</pre>
+
+    <p>The parameters have the following meaning:</p>
+
+    <ol>
+      <li><tt>Key</tt> is the key type.</li>
+
+      <li><tt>Mapped</tt> is the mapped-policy, and is explained in
+      <a href="tutorial.html#assoc_ms">Tutorial::Associative
+      Containers::Associative Containers Others than Maps</a>.</li>
+
+      <li><tt>E_Access_Traits</tt> is described in <a href=
+      "#e_access_traits">Element-Access Traits</a>.</li>
+
+      <li><tt>Tag</tt> specifies which underlying data structure
+      to use, and is described shortly.</li>
+
+      <li><tt>Node_Update</tt> is a policy for updating node
+      invariants. This is described in <a href="#invariants">Node
+      Invariants</a>.</li>
+
+      <li><tt>Allocator</tt> is an allocator
+      type.</li>
+    </ol>
+
+    <p>The <tt>Tag</tt> parameter specifies which underlying
+    data structure to use. Instantiating it by <a href=
+    "pat_trie_tag.html">pat_trie_tag</a>, specifies an
+    underlying PATRICIA trie (explained shortly); any other tag is
+    currently illegal.</p>
+    <hr />
+
+    <p>Following is a description of a (PATRICIA) trie
+    (<tt>pb_ds</tt> follows specifically [<a href=
+    "references.html#okasaki98mereable">okasaki98mereable</a>] and
+    [<a href=
+    "references.html#filliatre2000ptset">filliatre2000ptset</a>]).</p>
+
+    <p>A (PATRICIA) trie is similar to a tree, but with the
+    following differences:</p>
+
+    <ol>
+      <li>It explicitly views keys as a sequence of elements.
+      <i>E.g.</i>, a trie can view a string as a sequence of
+      characters; a trie can view a number as a sequence of
+      bits.</li>
+
+      <li>It is not (necessarily) binary. Each node has fan-out <i>n
+      + 1</i>, where <i>n</i> is the number of distinct
+      elements.</li>
+
+      <li>It stores values only at leaf nodes.</li>
+
+      <li>Internal nodes have the properties that A) each has at
+      least two children, and B) each shares the same prefix with
+      any of its descendant.</li>
+    </ol>
+
+    <p><a href="#e_access_traits">Element-Access Traits</a> shows
+    an example of such a trie.</p>
+
+    <p>A (PATRICIA) trie has some useful properties:</p>
+
+    <ol>
+      <li>It can be configured to use large node fan-out, giving it
+      very efficient find performance (albeit at insertion
+      complexity and size).</li>
+
+      <li>It works well for common-prefix keys.</li>
+
+      <li>It can support efficiently queries such as which keys
+      match a certain prefix. This is sometimes useful in
+      file systems and routers.</li>
+    </ol>
+
+    <p>(We would like to thank Matt Austern for the suggestion to
+    include tries.)</p>
+
+    <h2><a name="e_access_traits" id=
+    "e_access_traits">Element-Access Traits</a></h2>
+
+    <p>A trie inherently views its keys as sequences of elements.
+    For example, a trie can view a string as a sequence of
+    characters. A trie needs to map each of <i>n</i> elements to a
+    number in <i>{0, n - 1}</i>. For example, a trie can map a
+    character <tt>c</tt> to
+    <tt>static_cast&lt;size_t&gt;(c)</tt>.</p>
+
+    <p>Seemingly, then, a trie can assume that its keys support
+    (const) iterators, and that the <tt>value_type</tt> of this
+    iterator can be cast to a <tt>size_t</tt>. There are several
+    reasons, though, to decouple the mechanism by which the trie
+    accesses its keys' elements from the trie:</p>
+
+    <ol>
+      <li>In some cases, the numerical value of an element is
+      inappropriate. Consider a trie storing DNA strings. It is
+      logical to use a trie with a fan-out of <i>5 = 1 + |{'A', 'C',
+      'G', 'T'}|</i>. This requires mapping 'T' to 3, though.</li>
+
+      <li>In some cases the keys' iterators are different than what
+      is needed. For example, a trie can be used to search for
+      common <u>suffixes</u>, by using strings'
+      <tt>reverse_iterator</tt>. As another example, a trie mapping
+      UNICODE strings would have a huge fan-out if each node would
+      branch on a UNICODE character; instead, one can define an
+      iterator iterating over 8-bit (or less) groups.</li>
+    </ol>
+
+    <p><a href=
+    "trie.html">trie</a> is,
+    consequently, parametrized by <tt>E_Access_Traits</tt> -
+    traits which instruct how to access sequences' elements.
+    <a href=
+    "string_trie_e_access_traits.html"><tt>string_trie_e_access_traits</tt></a>
+    is a traits class for strings. Each such traits define some
+    types, <i>e.g.</i>,</p>
+    <pre>
+<b>typename</b> E_Access_Traits::const_iterator
+</pre>
+
+    <p>is a const iterator iterating over a key's elements. The
+    traits class must also define methods for obtaining an iterator
+    to the first and last element of a key.</p>
+
+    <p>Figure <a href="#pat_trie">A PATRICIA trie</a> shows a
+    (PATRICIA) trie resulting from inserting the words: "I wish
+    that I could ever see a poem lovely as a trie" (which,
+    unfortunately, does not rhyme).</p>
+
+    <p>The leaf nodes contain values; each internal node contains
+    two <tt><b>typename</b> E_Access_Traits::const_iterator</tt>
+    objects, indicating the maximal common prefix of all keys in
+    the sub-tree. For example, the shaded internal node roots a
+    sub-tree with leafs "a" and "as". The maximal common prefix is
+    "a". The internal node contains, consequently, to const
+    iterators, one pointing to <tt>'a'</tt>, and the other to
+    <tt>'s'</tt>.</p>
+
+    <h6 class="c1"><a name="pat_trie" id="pat_trie"><img src=
+    "pat_trie.png" alt="no image" /></a></h6>
+
+    <h6 class="c1">A PATRICIA trie.</h6>
+
+    <h2><a name="invariants" id="invariants">Node
+    Invariants</a></h2>
+
+    <p>Trie-based containers support node invariants, as do
+    tree-based containers (see <a href=
+    "tree_based_containers.html#invariants">Tree-Based
+    Containers::Node Invariants</a>). There are two minor
+    differences, though, which, unfortunately, thwart sharing them
+    sharing the same node-updating policies:</p>
+
+    <ol>
+      <li>A trie's <tt>Node_Update</tt> template-template
+      parameter is parametrized by <tt>E_Access_Traits</tt>, while
+      a tree's <tt>Node_Update</tt> template-template parameter is
+      parametrized by <tt>Cmp_Fn</tt>.</li>
+
+      <li>Tree-based containers store values in all nodes, while
+      trie-based containers (at least in this implementation) store
+      values in leafs.</li>
+    </ol>
+
+    <p>Figure <a href="#trie_node_update_cd">A trie and its update
+    policy</a> shows the scheme, as well as some predefined
+    policies (which are explained below).</p>
+
+    <h6 class="c1"><a name="trie_node_update_cd" id=
+    "trie_node_update_cd"><img src=
+    "trie_node_update_policy_cd.png" alt="no image" /></a></h6>
+
+    <h6 class="c1">A trie and its update policy.</h6>
+
+    <p><tt>pb_ds</tt> offers the following pre-defined trie node
+    updating policies:</p>
+
+    <ol>
+      <li><a href=
+      "trie_order_statistics_node_update.html"><tt>trie_order_statistics_node_update</tt></a>
+      supports order statistics.</li>
+
+      <li><a href=
+      "trie_prefix_search_node_update.html"><tt>trie_prefix_search_node_update</tt></a>
+      supports searching for ranges that match a given prefix. See
+      <a href=
+      "../../../../testsuite/ext/pb_ds/example/trie_prefix_search.cc"><tt>trie_prefix_search.cc</tt></a>.</li>
+
+      <li><a href=
+      "null_trie_node_update.html"><tt>null_trie_node_update</tt></a>
+      is the null node updater.</li>
+    </ol>
+
+    <h2><a name="add_methods" id="add_methods">Additional
+    Methods</a></h2>
+
+    <p>Trie-based containers support split and join methods; the
+    rationale is equal to that of tree-based containers supporting
+    these methods (see <a href=
+    "tree_based_containers.html#add_methods">Tree-Based
+    Containers::Additional Methods</a>).</p>
+  </div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/trie_const_node_iterator.html b/libstdc++-v3/docs/html/ext/pb_ds/trie_const_node_iterator.html
new file mode 100644
index 00000000000..0869a7c2f5b
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/trie_const_node_iterator.html
@@ -0,0 +1,478 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+  <meta name="generator" content=
+  "HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+
+  <title>trie::const_node_iterator
+  Interface</title>
+  <meta http-equiv="Content-Type" content=
+  "text/html; charset=us-ascii" />
+  </head>
+
+<body>
+  <div id="page">
+    <h1><tt><span class=
+    "c2"><tt>trie</tt></span>::const_node_iterator</tt>
+    Interface</h1>
+
+    <p>Const node iterator.</p>
+
+    <p>This is an "iterator to an iterator" - it iterates over
+    nodes, and de-referencing it returns one of the tree's const
+    iterators</p>
+
+    <h2><a name="link1" id="link1">Public Types and
+    Constants</a></h2>
+
+    <h3><a name="link2" id="link2">General Container
+    Definitions</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Types">
+      <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_type55424436" id="size_type55424436">size_type</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<a href="container_base.html#size_type55424436"><span class=
+"c2"><tt>container_base</tt></span>::size_type</a>
+</pre>
+        </td>
+
+        <td>
+          <p>Size type.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h3><a name="link3" id="link3">Iterator Definitions</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Types">
+      <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_category2821876439" id=
+"iterator_category2821876439">iterator_category</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+trivial_iterator_tag
+</pre>
+        </td>
+
+        <td>
+          <p>Category.</p>
+
+          <p>This tag identifies that the iterator has none of the
+          STL's iterators' movement abilities.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="difference_type868028452" id=
+"difference_type868028452">difference_type</a>
+</pre>
+        </td>
+
+        <td>
+          <pre class="c2">
+void
+</pre>
+        </td>
+
+        <td>
+          <p>Difference type.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h3><a name="link4" id="link4">Value-Type Definitions</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Types">
+      <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_type279018186" id=
+"value_type279018186">value_type</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<a href=
+"container_base.html#const_iterator98626788"><span class="c2"><tt>container_base</tt></span>::const_iterator</a>
+</pre>
+        </td>
+
+        <td>
+          <p>Iterator's value type.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="reference54418471" id="reference54418471">reference</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<a href="#value_type279018186"><tt>value_type</tt></a>
+</pre>
+        </td>
+
+        <td>
+          <p>Iterator's reference type.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="const_reference495461441" id=
+"const_reference495461441">const_reference</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<a href="#value_type279018186"><tt>value_type</tt></a>
+</pre>
+        </td>
+
+        <td>
+          <p>Iterator's const <a href=
+          "#reference54418471"><tt>reference</tt></a> type.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="e_access_traits1948190928" id=
+"e_access_traits1948190928">e_access_traits</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<a href=
+"trie.html#e_access_traits1948190928"><span class="c2"><tt>trie</tt></span>::e_access_traits</a>
+</pre>
+        </td>
+
+        <td>
+          <p>Element access traits.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="const_e_iterator2450008044" id=
+"const_e_iterator2450008044">const_e_iterator</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<b>typename</b> <a href=
+"#e_access_traits1948190928"><tt>e_access_traits</tt></a>::const_iterator
+</pre>
+        </td>
+
+        <td>
+          <p>A key's element const iterator.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h3><a name="link5" id="link5">Metadata Definitions</a></h3>
+
+    <p>These are only defined if <a href=
+    "basic_tree.html#Node_Update841554648"><span class="c2">
+    <tt>basic_tree</tt></span>::Node_Update</a>
+    is not <a href="null_trie_node_update.html"><span class=
+    "c2"><tt>null_trie_node_update</tt></span></a></p>
+
+    <table class="c1" width="100%" border="1" summary="Types">
+      <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_type2849297114" id=
+"metadata_type2849297114">metadata_type</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<tt><b>typename</b></tt> <a href=
+"basic_tree.html#Node_Update841554648"><span class="c2"><tt>basic_tree</tt></span>::Node_Update</a><tt>::metadata_type</tt>
+</pre>
+        </td>
+
+        <td>
+          <p>Metadata type.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="const_metadata_reference1108857465" id=
+"const_metadata_reference1108857465">const_metadata_reference</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<b>typename</b> Allocator::<b>template</b> rebind&lt;
+    <a href=
+"#metadata_type2849297114"><tt>metadata_type</tt></a>&gt;::other::<a href="#const_reference495461441"><tt>const_reference</tt></a>
+</pre>
+        </td>
+
+        <td>
+          <p>Const metadata <a href=
+          "#reference54418471"><tt>reference</tt></a> type.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h2><a name="link6" id="link6">Public Methods</a></h2>
+
+    <h3><a name="link7" id="link7">Constructors, Destructor, and
+    Related</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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> 
+  const_node_iterator
+  ()
+</pre>
+        </td>
+
+        <td>
+          <p>Default constructor.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h3><a name="link8" id="link8">Access Methods</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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=
+"#const_e_iterator2450008044"><tt>const_e_iterator</tt></a>,
+    <a href=
+"#const_e_iterator2450008044"><tt>const_e_iterator</tt></a>&gt;
+  valid_prefix
+  () <b>const</b>
+</pre>
+        </td>
+
+        <td>
+          <p>Subtree valid prefix.</p>
+
+          <p>Returns the common prefix range of all nodes in this
+          node's subtree.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<b>inline</b> <a href=
+"#const_reference495461441"><tt>const_reference</tt></a>
+  <b>operator</b>*
+  () <b>const</b>
+</pre>
+        </td>
+
+        <td>
+          <p>Const access; returns the const iterator associated
+          with the current leaf.</p>
+
+          <p>Should be called only for leaf nodes.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h3><a name="link9" id="link9">Metadata Access Methods</a></h3>
+
+    <p>These are only defined if <a href=
+    "basic_tree.html#Node_Update841554648"><span class="c2">
+    <tt>basic_tree</tt></span>::Node_Update</a>
+    is not <a href="null_trie_node_update.html"><span class=
+    "c2"><tt>null_trie_node_update</tt></span></a></p>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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=
+"#const_metadata_reference1108857465"><tt>const_metadata_reference</tt></a>
+  get_metadata
+  () <b>const</b>
+</pre>
+        </td>
+
+        <td>
+          <p>Metadata access.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h3><a name="link10" id="link10">Movement Methods</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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_type55424436"><tt>size_type</tt></a>
+  num_children
+  () <b>const</b>
+</pre>
+        </td>
+
+        <td>
+          <p>Returns the number of children in the corresponding
+          node.</p>
+
+          <p>If the number of children is 0, then the corresponding
+          node is a leaf; otherwise, it is not a leaf.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<span class="c2"><tt>const_node_iterator</tt></span>
+  get_child
+  (<a href=
+"#size_type55424436"><tt>size_type</tt></a> i) <b>const</b>
+</pre>
+        </td>
+
+        <td>
+          <p>Returns a const node iterator to the corresponding
+          node's <span class="c1"><tt>i</tt></span>-th child.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h3><a name="link11" id="link11">Comparison Methods</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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>==
+  (<b>const</b> <span class=
+"c2"><tt>const_node_iterator</tt></span> &amp;other) <b>const</b>
+</pre>
+        </td>
+
+        <td>
+          <p>Compares content to a different iterator object.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<b>inline</b> <b>bool</b>
+  <b>operator</b>!=
+  (<b>const</b> <span class=
+"c2"><tt>const_node_iterator</tt></span> &amp;other) <b>const</b>
+</pre>
+        </td>
+
+        <td>
+          <p>Compares content (negatively) to a different iterator
+          object.</p>
+        </td>
+      </tr>
+    </table>
+  </div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/trie_node_iterator.html b/libstdc++-v3/docs/html/ext/pb_ds/trie_node_iterator.html
new file mode 100644
index 00000000000..55029c4cb91
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/trie_node_iterator.html
@@ -0,0 +1,235 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+  <meta name="generator" content=
+  "HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+
+  <title>trie::node_iterator Interface</title>
+  <meta http-equiv="Content-Type" content=
+  "text/html; charset=us-ascii" />
+  </head>
+
+<body>
+  <div id="page">
+    <h1><tt><span class=
+    "c2"><tt>trie</tt></span>::node_iterator</tt>
+    Interface</h1>
+
+    <p>Node iterator.</p>
+
+    <p>This is an "iterator to an iterator" - it iterates over
+    nodes, and de-referencing it returns one of the tree's
+    iterators</p>
+
+    <h2><a name="link1" id="link1">Base Classes</a></h2>
+
+    <table class="c1" width="100%" border="1" summary="Bases">
+      <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=
+"trie.html#const_node_iterator4205924553"><span class="c2"><tt>trie</tt></span>::const_node_iterator</a>
+</pre>
+        </td>
+
+        <td>
+          <p>public</p>
+        </td>
+      </tr>
+    </table>
+
+    <h2><a name="link2" id="link2">Public Types and
+    Constants</a></h2>
+
+    <h3><a name="link3" id="link3">General Container
+    Definitions</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Types">
+      <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_type55424436" id="size_type55424436">size_type</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<b>typename</b> <a href=
+"trie.html#const_node_iterator4205924553"><span class="c2"><tt>trie</tt></span>::const_node_iterator</a>::size_type
+</pre>
+        </td>
+
+        <td>
+          <p>Size type.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h3><a name="link4" id="link4">Value-Type Definitions</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Types">
+      <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_type279018186" id=
+"value_type279018186">value_type</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<a href="container_base.html#iterator10418194"><span class=
+"c2"><tt>container_base</tt></span>::iterator</a>
+</pre>
+        </td>
+
+        <td>
+          <p>Iterator's value type.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="reference54418471" id="reference54418471">reference</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<a href="#value_type279018186"><tt>value_type</tt></a>
+</pre>
+        </td>
+
+        <td>
+          <p>Iterator's reference type.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="const_reference495461441" id=
+"const_reference495461441">const_reference</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<a href="#value_type279018186"><tt>value_type</tt></a>
+</pre>
+        </td>
+
+        <td>
+          <p>Iterator's const <a href=
+          "#reference54418471"><tt>reference</tt></a> type.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h2><a name="link5" id="link5">Public Methods</a></h2>
+
+    <h3><a name="link6" id="link6">Constructors, Destructor, and
+    Related</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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> 
+  pat_trie_node_it_
+  () 
+</pre>
+        </td>
+
+        <td>
+          <p>Default constructor.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h3><a name="link7" id="link7">Access Methods</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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="#reference54418471"><tt>reference</tt></a>
+  <b>operator</b>*
+  () <b>const</b>
+</pre>
+        </td>
+
+        <td>
+          <p>Access; returns the iterator associated with the
+          current leaf.</p>
+
+          <p>Should be called only for leaf nodes.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h3><a name="link8" id="link8">Movement Methods</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <tr>
+        <td width="45%" align="left"><b>Method</b></td>
+
+        <td width="55%" align="left"><b>Description</b></td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<span class="c2"><tt>node_iterator</tt></span>
+  get_child
+  (<a href=
+"#size_type55424436"><tt>size_type</tt></a> i) <b>const</b>
+</pre>
+        </td>
+
+        <td>
+          <p>Returns a node iterator to the corresponding node's
+          <span class="c1"><tt>i</tt></span>-th child.</p>
+        </td>
+      </tr>
+    </table>
+  </div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/trie_node_updator_policy_cd.png b/libstdc++-v3/docs/html/ext/pb_ds/trie_node_updator_policy_cd.png
new file mode 100644
index 00000000000..4376929ec28
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/trie_node_updator_policy_cd.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/trie_order_statistics_node_update.html b/libstdc++-v3/docs/html/ext/pb_ds/trie_order_statistics_node_update.html
new file mode 100644
index 00000000000..dcc236ff520
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/trie_order_statistics_node_update.html
@@ -0,0 +1,770 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+  <meta name="generator" content=
+  "HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+
+  <title>trie_order_statistics_node_update Interface</title>
+  <meta http-equiv="Content-Type" content=
+  "text/html; charset=us-ascii" />
+  </head>
+
+<body>
+  <div id="page">
+    <h1><tt>trie_order_statistics_node_update</tt> Interface</h1>
+
+    <p>Functor updating ranks of entrees.</p>
+
+    <p>Defined in: <a href=
+    "../../../../include/ext/pb_ds/trie_policy.hpp"><tt>trie_policy.hpp</tt></a></p>
+
+    <h2><a name="link1" id="link1">Template Parameters</a></h2>
+
+    <table class="c1" width="100%" border="1" summary=
+    "Template Parameters">
+      <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_Node_Iterator1933878761" id=
+"Const_Node_Iterator1933878761"><b>class</b> Const_Node_Iterator</a>
+</pre>
+        </td>
+
+        <td>
+          <p>Const node iterator type.</p>
+        </td>
+
+        <td>-</td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="Node_Iterator4206909839" id=
+"Node_Iterator4206909839"><b>class</b> Node_Iterator</a>
+</pre>
+        </td>
+
+        <td>
+          <p>Node iterator type.</p>
+        </td>
+
+        <td>-</td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="E_Access_Traits686553840" id=
+"E_Access_Traits686553840"><b>class</b> E_Access_Traits</a>
+</pre>
+        </td>
+
+        <td>
+          <p>Comparison functor.</p>
+        </td>
+
+        <td>-</td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="Allocator35940069" id=
+"Allocator35940069"><b>class</b> Allocator</a>
+</pre>
+        </td>
+
+        <td>
+          <p>Allocator type.</p>
+        </td>
+
+        <td>-</td>
+      </tr>
+    </table>
+
+    <h2><a name="link2" id="link2">Public Types and
+    Constants</a></h2>
+
+    <h3><a name="link3" id="link3">Policy Definitions</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Types">
+      <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="e_access_traits1948190928" id=
+"e_access_traits1948190928">e_access_traits</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<a href="#E_Access_Traits686553840"><tt>E_Access_Traits</tt></a>
+</pre>
+        </td>
+
+        <td>
+          <p>Element access traits.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="const_e_iterator2450008044" id=
+"const_e_iterator2450008044">const_e_iterator</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<b>typename</b> <a href=
+"#e_access_traits1948190928"><tt>e_access_traits</tt></a>::const_iterator
+</pre>
+        </td>
+
+        <td>
+          <p>Const element iterator.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="allocator48440069" id="allocator48440069">allocator</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<a href="#Allocator35940069"><tt>Allocator</tt></a>
+</pre>
+        </td>
+
+        <td>
+          <p><a href="#Allocator35940069"><tt>Allocator</tt></a>
+          type.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h3><a name="link4" id="link4">General Definitions</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Types">
+      <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_type55424436" id="size_type55424436">size_type</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<b>typename</b> <a href=
+"#allocator48440069"><tt>allocator</tt></a>::size_type
+</pre>
+        </td>
+
+        <td>
+          <p>Size type.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h3><a name="link5" id="link5">Key-Type Definitions</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Types">
+      <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_type10393186" id="key_type10393186">key_type</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+The instantiating container's key type.
+</pre>
+        </td>
+
+        <td>
+          <p>Key type.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="const_key_reference3185471705" id=
+"const_key_reference3185471705">const_key_reference</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+The instantiating container's const key reference type.
+</pre>
+        </td>
+
+        <td>
+          <p>Const key reference.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h3><a name="link6" id="link6">Metadata-Type
+    Definitions</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Types">
+      <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_type2849297114" id=
+"metadata_type2849297114">metadata_type</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<a href="#size_type55424436"><tt>size_type</tt></a>
+</pre>
+        </td>
+
+        <td>
+          <p>Metadata type.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h3><a name="link7" id="link7">Iterator Definitions</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Types">
+      <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_node_iterator4205924553" id=
+"const_node_iterator4205924553">const_node_iterator</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<a href=
+"#Const_Node_Iterator1933878761"><tt>Const_Node_Iterator</tt></a>
+</pre>
+        </td>
+
+        <td>
+          <p>Const node iterator type.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="node_iterator3431975247" id=
+"node_iterator3431975247">node_iterator</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<a href="#Node_Iterator4206909839"><tt>Node_Iterator</tt></a>
+</pre>
+        </td>
+
+        <td>
+          <p>Node iterator type.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="const_iterator98626788" id=
+"const_iterator98626788">const_iterator</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<b>typename</b> <a href=
+"#const_node_iterator4205924553"><tt>const_node_iterator</tt></a>::value_type
+</pre>
+        </td>
+
+        <td>
+          <p>Const iterator type.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="iterator10418194" id="iterator10418194">iterator</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<b>typename</b> <a href=
+"#node_iterator3431975247"><tt>node_iterator</tt></a>::value_type
+</pre>
+        </td>
+
+        <td>
+          <p>Iterator type.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h2><a name="link8" id="link8">Public Methods</a></h2>
+
+    <h3><a name="link9" id="link9">Find-Type Methods</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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=
+"#const_iterator98626788"><tt>const_iterator</tt></a>
+  find_by_order
+  (<a href=
+"#size_type55424436"><tt>size_type</tt></a> order) <b>const</b>
+</pre>
+        </td>
+
+        <td>
+          <p>Finds an entry by order. Returns a <a href=
+          "#const_iterator98626788"><tt>const_iterator</tt></a> to
+          the entry with the order <span class=
+          "c1"><tt>order</tt></span>, or a <a href=
+          "#const_iterator98626788"><tt>const_iterator</tt></a> to
+          the container object's end if <span class=
+          "c1"><tt>order</tt></span> is at least the size of the
+          container object.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<b>inline</b> <a href="#iterator10418194"><tt>iterator</tt></a>
+  find_by_order
+  (<a href="#size_type55424436"><tt>size_type</tt></a> order)
+</pre>
+        </td>
+
+        <td>
+          <p>Finds an entry by order. Returns an <a href=
+          "#iterator10418194"><tt>iterator</tt></a> to the entry
+          with the order <span class="c1"><tt>order</tt></span>, or
+          an <a href="#iterator10418194"><tt>iterator</tt></a> to
+          the container object's end if <span class=
+          "c1"><tt>order</tt></span> is at least the size of the
+          container object.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<b>inline</b> <a href="#size_type55424436"><tt>size_type</tt></a>
+  order_of_key
+  (<a href=
+"#const_key_reference3185471705"><tt>const_key_reference</tt></a> r_key) <b>const</b>
+</pre>
+        </td>
+
+        <td>
+          <p>Returns the order of a key within a sequence. For
+          example, if <span class="c1"><tt>r_key</tt></span> is the
+          smallest key, this method will return 0; if <span class=
+          "c1"><tt>r_key</tt></span> is a key between the smallest
+          and next key, this method will return 1; if <span class=
+          "c1"><tt>r_key</tt></span> is a key larger than the
+          largest key, this method will return the size of r_c.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<b>inline</b> <a href="#size_type55424436"><tt>size_type</tt></a>
+  order_of_prefix
+  (<a href=
+"#const_e_iterator2450008044"><tt>const_e_iterator</tt></a> b,
+    <a href=
+"#const_e_iterator2450008044"><tt>const_e_iterator</tt></a> e) <b>const</b>
+</pre>
+        </td>
+
+        <td>
+          <p>Returns the order of a prefix within a sequence. For
+          <span class="c1"><tt>e</tt></span>example, if [b,
+          <span class="c1"><tt>e</tt></span>] is the smallest
+          prefix, this method will return 0; if r_key is a key
+          <span class="c1"><tt>b</tt></span>between the smallest and
+          next key, this method will return 1; if r_key is a key
+          larger than the largest key, this method will return the
+          size of r_c.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h2><a name="link10" id="link10">Protected Types and
+    Constants</a></h2>
+
+    <h3><a name="link11" id="link11">Value-Type
+    Definitions</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Types">
+      <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_reference495461441" id=
+"const_reference495461441">const_reference</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+The instantiating container's const reference  type.
+</pre>
+        </td>
+
+        <td>
+          <p>Const reference to the container's value-type.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="const_pointer878814947" id=
+"const_pointer878814947">const_pointer</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+The instantiating container's const pointer  type.
+</pre>
+        </td>
+
+        <td>
+          <p>Const pointer to the container's value-type.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="const_metadata_reference1108857465" id=
+"const_metadata_reference1108857465">const_metadata_reference</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<b>typename</b> <a href=
+"#Allocator35940069"><tt>Allocator</tt></a>::<b>template</b> rebind&lt;
+    <a href=
+"#metadata_type2849297114"><tt>metadata_type</tt></a>&gt;::other::<a href="#const_reference495461441"><tt>const_reference</tt></a>
+</pre>
+        </td>
+
+        <td>
+          <p>Const metadata reference.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="metadata_reference583863863" id=
+"metadata_reference583863863">metadata_reference</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<b>typename</b> <a href=
+"#Allocator35940069"><tt>Allocator</tt></a>::<b>template</b> rebind&lt;
+    <a href=
+"#metadata_type2849297114"><tt>metadata_type</tt></a>&gt;::other::reference
+</pre>
+        </td>
+
+        <td>
+          <p>Metadata reference.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h2><a name="link12" id="link12">Protected Methods</a></h2>
+
+    <h3><a name="link13" id="link13">Operators</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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>
+  <b>operator</b>()
+  (<a href=
+"#node_iterator3431975247"><tt>node_iterator</tt></a> node_it,
+    <a href=
+"#const_node_iterator4205924553"><tt>const_node_iterator</tt></a> end_nd_it) <b>const</b>
+</pre>
+        </td>
+
+        <td>
+          <p>Updates the rank of a node through a <a href=
+          "#node_iterator3431975247"><tt>node_iterator</tt></a>
+          <span class="c1"><tt>node_it</tt></span>; <span class=
+          "c1"><tt>end_nd_it</tt></span> is the end node <a href=
+          "#iterator10418194"><tt>iterator</tt></a>.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h3><a name="link14" id="link14">Constructors, destructor, and
+    related</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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> 
+  ~trie_order_statistics_node_update
+  ()
+</pre>
+        </td>
+
+        <td>
+          <p>Destructor.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h2><a name="link15" id="link15">Private Methods</a></h2>
+
+    <h3><a name="link16" id="link16">Overrides</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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>bool</b>
+  empty
+  () <b>const</b> = 0
+</pre>
+        </td>
+
+        <td>
+          <p>Returns <tt><b>true</b></tt> if the container is
+          empty.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<b>virtual</b> <a href="#iterator10418194"><tt>iterator</tt></a>
+  begin
+  () = 0
+</pre>
+        </td>
+
+        <td>
+          <p>Returns the <a href=
+          "#iterator10418194"><tt>iterator</tt></a> associated with
+          the trie's first element.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<b>virtual</b> <a href="#iterator10418194"><tt>iterator</tt></a>
+  end
+  () = 0
+</pre>
+        </td>
+
+        <td>
+          <p>Returns the <a href=
+          "#iterator10418194"><tt>iterator</tt></a> associated with
+          the trie's just-after-last element.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<b>virtual</b> <a href=
+"#const_node_iterator4205924553"><tt>const_node_iterator</tt></a>
+  node_begin
+  () <b>const</b> = 0
+</pre>
+        </td>
+
+        <td>
+          <p>Returns the <a href=
+          "#const_node_iterator4205924553"><tt>const_node_iterator</tt></a>
+          associated with the trie's root node.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<b>virtual</b> <a href=
+"#node_iterator3431975247"><tt>node_iterator</tt></a>
+  node_begin
+  () = 0
+</pre>
+        </td>
+
+        <td>
+          <p>Returns the <a href=
+          "#node_iterator3431975247"><tt>node_iterator</tt></a>
+          associated with the trie's root node.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<b>virtual</b> <a href=
+"#const_node_iterator4205924553"><tt>const_node_iterator</tt></a>
+  node_end
+  () <b>const</b> = 0
+</pre>
+        </td>
+
+        <td>
+          <p>Returns the <a href=
+          "#const_node_iterator4205924553"><tt>const_node_iterator</tt></a>
+          associated with a just-after leaf node.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<b>virtual</b> <a href=
+"#node_iterator3431975247"><tt>node_iterator</tt></a>
+  node_end
+  () = 0
+</pre>
+        </td>
+
+        <td>
+          <p>Returns the <a href=
+          "#node_iterator3431975247"><tt>node_iterator</tt></a>
+          associated with a just-after leaf node.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<b>virtual</b> <a href=
+"#e_access_traits1948190928"><tt>e_access_traits</tt></a> &amp;
+  get_e_access_traits
+  () = 0
+</pre>
+        </td>
+
+        <td>
+          <p>Access to the cmp_fn object.</p>
+        </td>
+      </tr>
+    </table>
+  </div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/trie_prefix_search_node_update.html b/libstdc++-v3/docs/html/ext/pb_ds/trie_prefix_search_node_update.html
new file mode 100644
index 00000000000..e3d5e273042
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/trie_prefix_search_node_update.html
@@ -0,0 +1,628 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+  <meta name="generator" content=
+  "HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+
+  <title>trie_prefix_search_node_update Interface</title>
+  <meta http-equiv="Content-Type" content=
+  "text/html; charset=us-ascii" />
+  </head>
+
+<body>
+  <div id="page">
+    <h1><tt>trie_prefix_search_node_update</tt> Interface</h1>
+
+    <p>A node updater that allows tries to be searched for the
+    range of values that match a certain prefix.</p>
+
+    <p>Defined in: <a href=
+    "../../../../include/ext/pb_ds/trie_policy.hpp"><tt>trie_policy.hpp</tt></a></p>
+
+    <h2><a name="link1" id="link1">Template Parameters</a></h2>
+
+    <table class="c1" width="100%" border="1" summary=
+    "Template Parameters">
+      <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_Node_Iterator1933878761" id=
+"Const_Node_Iterator1933878761"><b>class</b> Const_Node_Iterator</a>
+</pre>
+        </td>
+
+        <td>
+          <p>Const node iterator type.</p>
+        </td>
+
+        <td>-</td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="Node_Iterator4206909839" id=
+"Node_Iterator4206909839"><b>class</b> Node_Iterator</a>
+</pre>
+        </td>
+
+        <td>
+          <p>Node iterator type.</p>
+        </td>
+
+        <td>-</td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="E_Access_Traits686553840" id=
+"E_Access_Traits686553840"><b>class</b> E_Access_Traits</a>
+</pre>
+        </td>
+
+        <td>
+          <p>Comparison functor.</p>
+        </td>
+
+        <td>-</td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="Allocator35940069" id=
+"Allocator35940069"><b>class</b> Allocator</a>
+</pre>
+        </td>
+
+        <td>
+          <p>Allocator type.</p>
+        </td>
+
+        <td>-</td>
+      </tr>
+    </table>
+
+    <h2><a name="link2" id="link2">Public Types and
+    Constants</a></h2>
+
+    <h3><a name="link3" id="link3">Key-Type Definitions</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Types">
+      <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_type10393186" id="key_type10393186">key_type</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+The instantiating container's key type.
+</pre>
+        </td>
+
+        <td>
+          <p>Key type.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="const_key_reference3185471705" id=
+"const_key_reference3185471705">const_key_reference</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+The instantiating container's const key reference type.
+</pre>
+        </td>
+
+        <td>
+          <p>Const key reference.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h3><a name="link4" id="link4">Policy Definitions</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Types">
+      <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="e_access_traits1948190928" id=
+"e_access_traits1948190928">e_access_traits</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<a href="#E_Access_Traits686553840"><tt>E_Access_Traits</tt></a>
+</pre>
+        </td>
+
+        <td>
+          <p>Element access traits.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="const_e_iterator2450008044" id=
+"const_e_iterator2450008044">const_e_iterator</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<b>typename</b> <a href=
+"#e_access_traits1948190928"><tt>e_access_traits</tt></a>::const_iterator
+</pre>
+        </td>
+
+        <td>
+          <p>Const element iterator.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="allocator48440069" id="allocator48440069">allocator</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<a href="#Allocator35940069"><tt>Allocator</tt></a>
+</pre>
+        </td>
+
+        <td>
+          <p><a href="#Allocator35940069"><tt>Allocator</tt></a>
+          type.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h3><a name="link5" id="link5">General Definitions</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Types">
+      <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_type55424436" id="size_type55424436">size_type</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<b>typename</b> <a href=
+"#allocator48440069"><tt>allocator</tt></a>::size_type
+</pre>
+        </td>
+
+        <td>
+          <p>Size type.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h3><a name="link6" id="link6">Metadata-Type
+    Definitions</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Types">
+      <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_type2849297114" id=
+"metadata_type2849297114">metadata_type</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+pb_ds::detail::null_node_metadata
+</pre>
+        </td>
+
+        <td>
+          <p>Metadata type.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h3><a name="link7" id="link7">Iterator Definitions</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Types">
+      <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_node_iterator4205924553" id=
+"const_node_iterator4205924553">const_node_iterator</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<a href=
+"#Const_Node_Iterator1933878761"><tt>Const_Node_Iterator</tt></a>
+</pre>
+        </td>
+
+        <td>
+          <p>Const node iterator type.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="node_iterator3431975247" id=
+"node_iterator3431975247">node_iterator</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<a href="#Node_Iterator4206909839"><tt>Node_Iterator</tt></a>
+</pre>
+        </td>
+
+        <td>
+          <p>Node iterator type.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="const_iterator98626788" id=
+"const_iterator98626788">const_iterator</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<b>typename</b> <a href=
+"#const_node_iterator4205924553"><tt>const_node_iterator</tt></a>::value_type
+</pre>
+        </td>
+
+        <td>
+          <p>Const iterator type.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<a name="iterator10418194" id="iterator10418194">iterator</a>
+</pre>
+        </td>
+
+        <td>
+          <pre>
+<b>typename</b> <a href=
+"#node_iterator3431975247"><tt>node_iterator</tt></a>::value_type
+</pre>
+        </td>
+
+        <td>
+          <p>Iterator type.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h2><a name="link8" id="link8">Public Methods</a></h2>
+
+    <h3><a name="link9" id="link9">Find Methods</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <tr>
+        <td width="45%" align="left"><b>Method</b></td>
+
+        <td width="55%" align="left"><b>Description</b></td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+std::pair&lt;
+    <a href="#const_iterator98626788"><tt>const_iterator</tt></a>,
+    <a href=
+"#const_iterator98626788"><tt>const_iterator</tt></a>&gt;
+  prefix_range
+  (<a href=
+"#const_key_reference3185471705"><tt>const_key_reference</tt></a> r_key) <b>const</b>
+</pre>
+        </td>
+
+        <td>
+          <p>Finds the <tt><b>const</b></tt> <a href=
+          "#iterator10418194"><tt>iterator</tt></a> range
+          corresponding to all values whose prefixes match
+          <span class="c1"><tt>r_key</tt></span>.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+std::pair&lt;
+    <a href="#iterator10418194"><tt>iterator</tt></a>,
+    <a href="#iterator10418194"><tt>iterator</tt></a>&gt;
+  prefix_range
+  (<a href=
+"#const_key_reference3185471705"><tt>const_key_reference</tt></a> r_key)
+</pre>
+        </td>
+
+        <td>
+          <p>Finds the <a href=
+          "#iterator10418194"><tt>iterator</tt></a> range
+          corresponding to all values whose prefixes match
+          <span class="c1"><tt>r_key</tt></span>.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+std::pair&lt;
+    <a href="#const_iterator98626788"><tt>const_iterator</tt></a>,
+    <a href=
+"#const_iterator98626788"><tt>const_iterator</tt></a>&gt;
+  prefix_range
+  (<a href=
+"#const_e_iterator2450008044"><tt>const_e_iterator</tt></a> b,
+    <a href=
+"#const_e_iterator2450008044"><tt>const_e_iterator</tt></a> e) <b>const</b>
+</pre>
+        </td>
+
+        <td>
+          <p>Finds the <tt><b>const</b></tt> <a href=
+          "#iterator10418194"><tt>iterator</tt></a> range
+          corresponding to all values whose prefixes match [b,
+          <span class="c1"><tt>e</tt></span>).</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+std::pair&lt;
+    <a href="#iterator10418194"><tt>iterator</tt></a>,
+    <a href="#iterator10418194"><tt>iterator</tt></a>&gt;
+  prefix_range
+  (<a href=
+"#const_e_iterator2450008044"><tt>const_e_iterator</tt></a> b,
+    <a href=
+"#const_e_iterator2450008044"><tt>const_e_iterator</tt></a> e)
+</pre>
+        </td>
+
+        <td>
+          <p>Finds the <a href=
+          "#iterator10418194"><tt>iterator</tt></a> range
+          corresponding to all values whose prefixes match [b,
+          <span class="c1"><tt>e</tt></span>).</p>
+        </td>
+      </tr>
+    </table>
+
+    <h2><a name="link10" id="link10">Protected Methods</a></h2>
+
+    <h3><a name="link11" id="link11">Operators</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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>
+  <b>operator</b>()
+  (<a href=
+"#node_iterator3431975247"><tt>node_iterator</tt></a> node_it,
+    <a href=
+"#const_node_iterator4205924553"><tt>const_node_iterator</tt></a> end_nd_it) <b>const</b>
+</pre>
+        </td>
+
+        <td>
+          <p>Called to update a node's metadata.</p>
+        </td>
+      </tr>
+    </table>
+
+    <h2><a name="link12" id="link12">Private Methods</a></h2>
+
+    <h3><a name="link13" id="link13">Overrides</a></h3>
+
+    <table class="c1" width="100%" border="1" summary="Methods">
+      <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> <a href=
+"#const_iterator98626788"><tt>const_iterator</tt></a>
+  end
+  () <b>const</b> = 0
+</pre>
+        </td>
+
+        <td>
+          <p>Returns the <tt><b>const</b></tt> <a href=
+          "#iterator10418194"><tt>iterator</tt></a> associated with
+          the just-after last element.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<b>virtual</b> <a href="#iterator10418194"><tt>iterator</tt></a>
+  end
+  () = 0
+</pre>
+        </td>
+
+        <td>
+          <p>Returns the <a href=
+          "#iterator10418194"><tt>iterator</tt></a> associated with
+          the just-after last element.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<b>virtual</b> <a href=
+"#const_node_iterator4205924553"><tt>const_node_iterator</tt></a>
+  node_begin
+  () <b>const</b> = 0
+</pre>
+        </td>
+
+        <td>
+          <p>Returns the <a href=
+          "#const_node_iterator4205924553"><tt>const_node_iterator</tt></a>
+          associated with the trie's root node.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<b>virtual</b> <a href=
+"#node_iterator3431975247"><tt>node_iterator</tt></a>
+  node_begin
+  () = 0
+</pre>
+        </td>
+
+        <td>
+          <p>Returns the <a href=
+          "#node_iterator3431975247"><tt>node_iterator</tt></a>
+          associated with the trie's root node.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<b>virtual</b> <a href=
+"#const_node_iterator4205924553"><tt>const_node_iterator</tt></a>
+  node_end
+  () <b>const</b> = 0
+</pre>
+        </td>
+
+        <td>
+          <p>Returns the <a href=
+          "#const_node_iterator4205924553"><tt>const_node_iterator</tt></a>
+          associated with a just-after leaf node.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<b>virtual</b> <a href=
+"#node_iterator3431975247"><tt>node_iterator</tt></a>
+  node_end
+  () = 0
+</pre>
+        </td>
+
+        <td>
+          <p>Returns the <a href=
+          "#node_iterator3431975247"><tt>node_iterator</tt></a>
+          associated with a just-after leaf node.</p>
+        </td>
+      </tr>
+
+      <tr>
+        <td>
+          <pre>
+<b>virtual</b> <b>const</b> <a href=
+"#e_access_traits1948190928"><tt>e_access_traits</tt></a> &amp;
+  get_e_access_traits
+  () <b>const</b> = 0
+</pre>
+        </td>
+
+        <td>
+          <p>Access to the cmp_fn object.</p>
+        </td>
+      </tr>
+    </table>
+  </div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/trie_tag.html b/libstdc++-v3/docs/html/ext/pb_ds/trie_tag.html
new file mode 100644
index 00000000000..6d2def4e77f
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/trie_tag.html
@@ -0,0 +1,47 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+  <meta name="generator" content=
+  "HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+
+  <title>trie_tag Interface</title>
+  <meta http-equiv="Content-Type" content=
+  "text/html; charset=us-ascii" />
+  </head>
+
+<body>
+  <div id="page">
+    <h1><tt>trie_tag</tt> Interface</h1>
+
+    <p>Basic trie data structure tag.</p>
+
+    <p>Defined in: <a href=
+    "../../../../include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
+
+    <h2><a name="link1" id="link1">Base Classes</a></h2>
+
+    <table class="c1" width="100%" border="1" summary="Bases">
+      <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_tag.html"><span class=
+"c2"><tt>basic_tree_tag</tt></span></a>
+</pre>
+        </td>
+
+        <td>
+          <p>public</p>
+        </td>
+      </tr>
+    </table>
+  </div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/trivial_iterator_tag.html b/libstdc++-v3/docs/html/ext/pb_ds/trivial_iterator_tag.html
new file mode 100644
index 00000000000..be9813be3cb
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/trivial_iterator_tag.html
@@ -0,0 +1,25 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
+<head>
+  <meta name="generator" content=
+  "HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+
+  <title>trivial_iterator_tag Interface</title>
+  <meta http-equiv="Content-Type" content=
+  "text/html; charset=us-ascii" />
+  </head>
+
+<body>
+  <div id="page">
+    <h1><tt>trivial_iterator_tag</tt> Interface</h1>
+
+    <p>A \quot;trivial\quot; iterator tag. Signifies that the
+    iterators has none of the STL's movement abilities.</p>
+
+    <p>Defined in: <a href=
+    "../../../../include/ext/pb_ds/tag_and_trait.hpp"><tt>tag_and_trait.hpp</tt></a></p>
+  </div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/tutorial.html b/libstdc++-v3/docs/html/ext/pb_ds/tutorial.html
new file mode 100644
index 00000000000..029204b3b20
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/tutorial.html
@@ -0,0 +1,670 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN"
+    "http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd">
+
+<html xmlns="http://www.w3.org/1999/xhtml">
+<head>
+  <meta name="generator" content=
+  "HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" />
+
+  <title>Tutorial</title>
+  <meta http-equiv="Content-Type" content=
+  "text/html; charset=us-ascii" />
+  </head>
+
+<body>
+  <div id="page">
+    <h1>Short Tutorial</h1>
+
+    <p>Following is a short tutorial illustrating the main points
+    of <tt>pb_ds</tt>. <a href="concepts.html">Concepts</a>
+    describes and summarizes some concepts.</p>
+
+    <h2><a name="assoc_main" id="assoc_main">Associative
+    Containers</a></h2>
+
+    <h3><a name="assoc_basic" id="assoc_basic">Basic Use</a></h3>
+
+    <p>For the most part, <tt>pb_ds</tt>'s containers have the same
+    interface as the STL's, except for the names used for the
+    container classes themselves. For example, this shows basic
+    operations on a collision-chaining hash-based container:</p>
+
+    <pre>
+<a href=
+"cc_hash_table.html">cc_hash_table</a>&lt;<b>int</b>, <b>char</b>&gt; c;
+
+c[2] = 'b';
+
+assert(c.find(1) == c.end());
+</pre>
+
+    <p>The container is called <a href=
+    "cc_hash_table.html"><tt>cc_hash_table</tt></a> as
+    opposed to <tt>unordered_map</tt>, since "unordered map" does
+    not necessarily mean a hash-based map (as the STL implicitly
+    implies). For example, list-based associative containers, which
+    are very useful for the construction of "multimaps" (see
+    <a href=
+    "assoc_performance_tests.html#msc">Associative-Container
+    Performance Tests::Observations::Mapping-Semantics
+    Considerations</a>), are also unordered. It is also not called
+    <tt>hash_map</tt> since there are more ways than one to
+    implement hash tables.</p>
+
+    <p>This snippet shows a red-black tree based container:</p>
+    <pre>
+<a href=
+"tree.html">tree</a>&lt;<b>int</b>, <b>char</b>&gt; c;
+
+c[2] = 'b';
+
+assert(c.find(2) != c.end());
+</pre>
+
+    <p>The container is called <a href=
+    "tree.html"><tt>tree</tt></a>
+    as opposed to <tt>map</tt>, since "map" doesn't say that
+    much.</p>
+
+    <p>Most of the STL's familiar methods are unchanged.
+    <i>E.g.</i>, <tt>being</tt>, <tt>end</tt>, <tt>size</tt>,
+    <tt>empty</tt>, and <tt>clear</tt>, do just the same as is
+    customary. <a href=
+    "assoc_examples.html#basic_usage">Associative-Container
+    Examples::Basic use</a>, and especially <a href=
+    "../../../../testsuite/ext/pb_ds/example/basic_map.cc"><tt>basic_map.cc</tt></a>,
+    show examples of this.</p>
+
+<p>This isn't to say that things are exactly as one would expect,
+given the container requirments and interfaces in the C++
+standard.</p>
+
+
+    <p>The names of containers' policies and policy accessors are
+    different than those of the STL. For example, if <tt>C</tt> is
+    some type of hash-based container, then</p>
+    <pre>
+C::hash_fn
+</pre>gives the type of its hash functor, and if <tt>c</tt> is some
+hash-based container object, then
+    <pre>
+c.get_hash_fn()
+</pre>
+
+    <p>will return a reference to its hash-functor object.</p>
+
+    <p>Similarly, if <tt>C</tt> is some type of tree-based
+    container, then</p>
+    <pre>
+C::cmp_fn
+</pre>gives the type of its comparison functor, and if <tt>c</tt>
+is some tree-based container object, then
+    <pre>
+c.get_cmp_fn()
+</pre>
+
+    <p>will return a reference to its comparison-functor
+    object.</p>
+
+    <p>It would be nice to give names consistent with those in the
+    existing C++ standard (inclusive of TR1). Unfortunately, these
+    standard containers don't consistently name types and
+    methods. For example, <tt>std::tr1::unordered_map</tt> uses
+    <tt>hasher</tt> for the hash functor, but <tt>std::map</tt> uses
+    <tt>key_compare</tt> for the comparison functor. Also, we could
+    not find an accessor for <tt>std::tr1::unordered_map</tt>'s hash
+    functor, but <tt>std::map</tt> uses <tt>compare</tt> for accessing
+    the comparison functor.</p> 
+
+<p>Instead, <tt>pb_ds</tt> attempts to be internally consistent, and
+uses standard-derived terminology if possible.
+</p>
+
+    <p>Another source of difference is in scope: <tt>pb_ds</tt>
+    contains more types of associative containers than the STL, and
+    more opportunities to configure these new containers, since
+    different types of associative containers are useful in different
+    settings (see <a href=
+    "assoc_performance_tests.html#dss_family_choice">Associative-Container
+    Performance Tests::Observations::Underlying Data-Structure
+    Families</a>).</p>
+
+    <p><tt>pb_ds</tt> contains different classes for hash-based containers,
+    tree-based containers, trie-based containers, and list-based
+    containers. <a href=
+    "interface.html#containers_assoc">Inteface::Containers::Associative
+    Containers</a> lists the containers. <a href=
+    "hash_based_containers.html">Design::Associative
+    Containers::Hash-Based Containers</a>, <a href=
+    "tree_based_containers.html">Design::Associative
+    Containers::Tree-Based Containers</a>, <a href=
+    "trie_based_containers.html">Design::Associative
+    Containers::Trie-Based Containers</a>, and <a href=
+    "lu_based_containers.html">Design::Associative
+    Containers::List-Based Containers</a>, explain some more about
+    these types of containers, respectively.</p>
+
+    <p>Since associative containers share parts of their interface,
+    they are organized as a class hierarchy; it is shown in Figure
+    <a href="#cd">Class hierarchy</a>.</p>
+
+    <h6 class="c1"><a name="cd" id="cd"><img src="container_cd.png" alt=
+    "no image" /></a></h6>
+
+    <h6 class="c1">Class hierarchy.</h6>
+
+    <p>Each type or method is defined in the most-common ancestor
+    in which it makes sense:
+  <a href=
+    "../../../../testsuite/ext/pb_ds/example/basic_map.cc"><tt>basic_map.cc</tt></a>
+    shows an example of most of the associative-container
+    types.</p>
+
+ 
+    <p>For example, all associative containers support iteration.
+    Consequently, <a href=
+    "container_base.html"><tt>container_base</tt></a> has the
+    interface:</p>
+    <pre>
+<b>template</b>&lt;...&gt;
+<b>class</b> <a href="container_base.html">container_base</a>
+{
+    ...
+    
+<b>public</b>:
+    ...
+    
+    const_iterator
+    begin() <b>const</b>;
+    
+    iterator
+    begin();
+
+    const_iterator
+    end() <b>const</b>;
+    
+    iterator
+    end();
+        
+    ...
+};
+</pre>
+
+    <p>and so all associative containers inherent this method.
+    Conversely, both collision-chaining and (general) probing
+    hash-based associative containers have a hash functor, so
+    <a href=
+    "basic_hash_table.html"><tt>basic_hash_table</tt></a>
+    has the interface:</p>
+    <pre>
+<b>template</b>&lt;...&gt;
+<b>class</b> <a href="basic_hash_table.html">basic_hash_table</a> : <b>public</b> <a href="container_base.html">container_base</a>
+{
+    ...
+    
+<b>public</b>:
+    ...
+    
+    const hash_fn&amp;
+    get_hash_fn() const;
+        
+    hash_fn&amp;
+    get_hash_fn();
+    ...
+};
+</pre>
+
+    <p>and so all hash-based associative containers inherit the
+    same hash-functor accessor methods.</p>
+
+    <p>This is discussed further in <a href=
+    "ds_gen.html">Design::Associative Containers::Data-Structure
+    Genericity</a>.</p>
+
+    <h3><a name="assoc_policies" id="assoc_policies">Configuring
+    Associative Containers</a></h3>
+
+    <p>In general, each of <tt>pb_ds</tt>'s containers is
+    parametrized by more policies than those of the STL's. For
+    example, the STL's hash-based container is parametrized as
+    follows:</p>
+    <pre>
+<b>template</b>&lt;
+    <b>typename</b> Key,
+    <b>typename</b> Mapped,
+    <b>typename</b> Hash,
+    <b>typename</b> Pred,
+    <b>typename</b> Allocator,
+    <b>bool</b> Cache_Hashe_Code&gt;
+<b>class</b> unordered_map;
+</pre>
+
+    <p>and so can be configured by key type, mapped type, a functor
+    that translates keys to unsigned integral types, an equivalence
+    predicate, an allocator, and an indicator whether to store hash
+    values with each entry. <tt>pb_ds</tt>'s collision-chaining
+    hash-based container is parametrized as</p>
+    <pre>
+<b>template</b>&lt;
+    <b>typename</b> Key,
+    <b>typename</b> Mapped,
+    <b>typename</b> Hash_Fn,
+    <b>typename</b> Eq_Fn,
+    <b>typename</b> Comb_Hash_Fn,
+    <b>typename</b> Resize_Policy
+    <b>bool</b> Store_Hash
+    <b>typename</b> Allocator&gt;
+<b>class</b> <a href=
+"cc_hash_table.html">cc_hash_table</a>;
+</pre>
+
+    <p>and so can be configured by the first four types of
+    <tt>std::tr1::unordered_map</tt>, then a policy for translating
+    the key-hash result into a position within the table, then a
+    policy by which the table resizes, an indicator whether to
+    store hash values with each entry, and an allocator (which is
+    typically the last template parameter in STL containers).</p>
+
+    <p>Nearly all policy parameters have default values, so this
+    need not be considered for casual use. It is important to note,
+    however, that hash-based containers' policies can dramatically
+    alter their performance in different settings, and that
+    tree-based containers' policies can make them useful for other
+    purposes than just look-up.</p>
+
+    <p><a href="hash_based_containers.html">Design::Associative
+    Containers::Hash-Based Containers</a>, <a href=
+    "tree_based_containers.html">Design::Associative
+    Containers::Tree-Based Containers</a>, <a href=
+    "trie_based_containers.html">Design::Associative
+    Containers::Trie-Based Containers</a>, and <a href=
+    "lu_based_containers.html">Design::Associative
+    Containers::List-Based Containers</a>, explain some more about
+    configuring hash based, tree based, trie based, and list base
+    containers, respectively. <a href=
+    "interface.html#ds_policy_classes">Interface::Container Policy
+    Classes</a> shows the different policy classes for configuring
+    associative containers. <a href=
+    "assoc_examples.html#hash_based">Examples::Hash-Based
+    Containers</a>, <a href=
+    "assoc_examples.html#tree_like_based">Examples::Tree-Like-Based
+    Containers</a>, and <a href=
+    "assoc_examples.html#trie_based">Examples::Trie-Based
+    Containers</a> show examples for this.</p>
+
+    <h3><a name="assoc_ds_gen" id="assoc_ds_gen">Determining
+    Containers' Attributes</a></h3>
+
+    <p>Associative-containers' underlying data structures obviously
+    affect their performance; Unfortunately, they can also affect
+    their interface. When manipulating generically associative
+    containers, it is often useful to be able to statically
+    determine what they can support and what the cannot. (This was
+    discussed in <a href=
+    "motivation.html#assoc_ds_genericity">Motivation::Associative
+    Containers::Data-Structure Genericity</a>.)</p>
+
+    <p>Happily, the STL provides a good solution to a similar
+    problem - that of the different behavior of iterators. If
+    <tt>It</tt> is an iterator, then</p>
+    <pre>
+<b>typename</b> std::iterator_traits&lt;It&gt;::iterator_category
+</pre>
+
+    <p>is one of a small number of pre-defined
+    <tt><b>struct</b></tt>s, and,</p>
+    <pre>
+<b>typename</b> std::iterator_traits&lt;It&gt;::value_type
+</pre>
+
+    <p>is the value type to which the iterator "points".</p>
+
+    <p>Similarly, in <tt>pb_ds</tt>, if <tt>C</tt> is an
+    associative container, then</p>
+    <pre>
+<b>typename</b> <a href=
+"assoc_container_traits.html"><tt>container_traits</tt></a>&lt;C&gt;::container_category
+</pre>is one of a small number of pre-defined
+<tt><b>struct</b></tt>s, each one corresponding to a class in
+Figure <a href="#cd">Class hierarchy</a>. These tags are listed in
+<a href="interface.html#ds_ts_assoc">Interface::Associative
+Containers::Data-Structure Tags and Traits::Data-Structure
+Tags::Associative-Containers</a>; <a href="ds_gen.html#container_traits">
+    Design::Associative Containers::Data-Structure Tags and
+    Traits</a> explains this further; <a href=
+    "ds_gen.html#tag_cd">Design::Associative
+    Containers::Data-Structure Tags and Traits::Data-structure tag
+    class hierarchy</a> shows a class diagram.
+
+    <p>In most cases, however, the exact underlying data structure
+    is not really important, but only one of its attributes:
+    whether it guarantees storing elements by key order, for
+    example. For this one can use</p>
+    <pre>
+<b>typename</b> <a href=
+"assoc_container_traits.html"><tt>container_traits</tt></a>&lt;C&gt;::order_preserving
+</pre>
+
+    <p>This is described further in <a href=
+    "ds_gen.html">Design::Data-Structure Genericity</a>; <a href=
+    "../../../../testsuite/ext/pb_ds/example/assoc_container_traits.cc"><tt>assoc_container_traits.cc</tt></a>
+    shows an example of querying containers' attributes.</p>
+
+    <h3><a name="assoc_find_range" id="assoc_find_range">Point-Type
+    and Range-Type Methods and Iterators</a></h3>(This subsection
+    addresses points from <a href=
+    "motivation.html#assoc_diff_it">Motivation::Associative
+    Containers::Differentiating between Iterator Types</a>.)
+
+    <p><tt>pb_ds</tt> differentiates between two types of methods
+    and iterators: point-type, and range-type. For example,
+    <tt>find</tt> and <tt>insert</tt> are point-type methods, since
+    they each deal with a specific element; their returned
+    iterators are point-type iterators. <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; their returned iterators are range-type
+    iterators.</p>
+
+    <p>Most containers store elements in an order that is
+    determined by their interface. Correspondingly, it is fine that
+    their point-type iterators are synonymous with their range-type
+    iterators. For example, in the following snippet</p>
+    <pre>
+std::for_each(c.find(1), c.find(5), foo);
+</pre>two point-type iterators (returned by <tt>find</tt>) are used
+for a range-type purpose - going over all elements whose key is
+between 1 and 5.
+
+    <p>Conversely, the above snippet makes no sense for
+    self-organizing containers - ones that order (and reorder)
+    their elements by implementation. It would be nice to have a
+    uniform iterator system that would allow the above snippet to
+    compile only if it made sense.</p>
+
+    <p>This could trivially be done by specializing
+    <tt>std::for_each</tt> for the case of iterators returned by
+    <tt>std::tr1::unordered_map</tt>, but this would only solve the
+    problem for one algorithm and one container. Fundamentally, the
+    problem is that one can loop using a self-organizing
+    container's point-type iterators.</p>
+
+    <p><tt>pb_ds</tt>'s containers define two families of
+    iterators: <tt>const_point_iterator</tt> and
+    <tt>point_iterator</tt> are the iterator types returned by
+    point-type methods; <tt>const_iterator</tt> and
+    <tt>iterator</tt> are the iterator types returned by range-type
+    methods.</p>
+    <pre>
+<b>class</b> <i>&lt;- some container -&gt;</i>
+{
+<b>public</b>:
+    ...
+
+    <b>typedef</b> <i>&lt;- something -&gt;</i> const_iterator;
+
+    <b>typedef</b> <i>&lt;- something -&gt;</i> iterator;
+
+    <b>typedef</b> <i>&lt;- something -&gt;</i> const_point_iterator;
+
+    <b>typedef</b> <i>&lt;- something -&gt;</i> point_iterator;
+ 
+    ...
+
+<b>public</b>:
+    ...
+
+    const_iterator begin () <b>const</b>;
+
+    iterator begin();
+
+    const_point_iterator find(...) <b>const</b>;
+
+    point_iterator find(...);
+};
+</pre>
+
+    <p><a href="ds_gen.html#find_range">Design::Associative
+    Containers::Data-Structure Genericity::Point-Type and
+    Range-Type Methods and Iterators</a> discusses the relationship
+    between point-type and range-type iterators in general; for
+    containers whose interface defines sequence order, however, it
+    is very simple: point-type and range-type iterators are exactly
+    the same, which means that the above snippet will compile if it
+    is used for an order-preserving associative container.</p>
+
+    <p>For self-organizing containers, however, (hash-based
+    containers as a special example), the preceding snippet will
+    not compile, because their point-type iterators do not support
+    <tt><b>operator</b>++</tt>.</p>
+
+    <p>In any case, both for order-preserving and self-organizing
+    containers, the following snippet will compile:</p>
+    <pre>
+<b>typename</b> Cntnr::point_iterator it = c.find(2);
+</pre>
+
+    <p>because a range-type iterator can always be converted to a
+    point-type iterator.</p>
+
+    <p><a href="ds_gen.html#find_range">Design::Associative
+    Containers::Data-Structure Genericity::Point-Type and
+    Range-Type Methods and Iterators</a> discusses this
+    further.</p>
+
+    <p><a href=
+    "motivation.html#assoc_diff_it">Motivation::Associative
+    Containers::Differentiating between Iterator Types</a> also
+    raised the point that a container's iterators might have
+    different invalidation rules concerning their de-referencing
+    abilities and movement abilities. This now corresponds exactly
+    to the question of whether point-type and range-type iterators
+    are valid. As explained in <a href="#assoc_ds_gen">Determining
+    Containers' Attributes</a>, <a href=
+    "assoc_container_traits.html"><tt>container_traits</tt></a> allows
+    querying a container for its data structure attributes. The
+    iterator-invalidation guarantees are certainly a property of
+    the underlying data structure, and so</p>
+    <pre>
+<a href=
+"assoc_container_traits.html">container_traits</a>&lt;C&gt;::invalidation_guarantee
+</pre>
+
+    <p>gives one of three pre-determined types that answer this
+    query. This is explained further in <a href=
+    "ds_gen.html#find_range">Design::Associative
+    Containers::Data-Structure Genericity::Point-Type and
+    Range-Type Methods and Iterators</a>.</p>
+
+    <h3><a name="assoc_ms" id="assoc_ms">Distinguishing between Maps and Sets</a></h3>
+
+    <p>Anyone familiar with the STL knows that there are four kinds
+    of associative containers: maps, sets, multimaps, and
+    multisets. <a href="#assoc_basic">Basic Use</a> discussed how
+    to use maps, <i>i.e.</i> containers that associate each key to
+    some data.</p>
+
+    <p>Sets are associative containers that simply store keys -
+    they do not map them to anything. In the STL, each map class
+    has a corresponding set class. <i>E.g.</i>,
+    <tt>std::map&lt;<b>int</b>, <b>char</b>&gt;</tt> maps each
+    <tt><b>int</b></tt> to a <tt><b>char</b></tt>, but
+    <tt>std::set&lt;<b>int</b>, <b>char</b>&gt;</tt> simply stores
+    <tt><b>int</b></tt>s. In <tt>pb_ds</tt>, however, there are no
+    distinct classes for maps and sets. Instead, an associative
+    container's <tt>Mapped</tt> template parameter is a policy: if
+    it is instantiated by <a href=
+    "null_mapped_type.html"><tt>null_mapped_type</tt></a>, then it
+    is a "set"; otherwise, it is a "map". <i>E.g.</i>,</p>
+    <pre>
+<a href="cc_hash_table.html">cc_hash_table</a>&lt;<b>int</b>, <b>char</b>&gt;
+</pre>is a "map" mapping each <tt><b>int</b></tt> value to a <tt>
+    <b>char</b></tt>, but
+    <pre>
+<a href="cc_hash_table.html">cc_hash_table</a>&lt;<b>int</b>, <a href="null_mapped_type.html">null_mapped_type</a>&gt;
+</pre>is a type that uniquely stores <tt><b>int</b></tt> values.
+
+    <p>Once the <tt>Mapped</tt> template parameter is instantiated
+    by <a href="null_mapped_type.html">null_mapped_type</a>, then
+    the "set" acts very similarly to the STL's sets - it does not
+    map each key to a distinct <a href=
+    "null_mapped_type.html">null_mapped_type</a> object. Also,
+   , the container's <tt>value_type</tt> is essentially
+    its <tt>key_type</tt> - just as with the STL's sets. For a simple example, see <a href=
+    "../../../../testsuite/ext/pb_ds/example/basic_set.cc"><tt>basic_set.cc</tt></a>
+   .</p>
+
+    <p>The STL's multimaps and multisets allow, respectively,
+    non-uniquely mapping keys and non-uniquely storing keys. As
+    discussed in <a href=
+    "motivation.html#assoc_mapping_semantics">Motivation::Associative
+    Containers::Alternative to Multiple Equivalent Keys</a>, the
+    reasons why this might be necessary are 1) that a key might be
+    decomposed into a primary key and a secondary key, 2) that a
+    key might appear more than once, or 3) any arbitrary
+    combination of 1)s and 2)s. Correspondingly,
+    one should use 1) "maps" mapping primary keys to secondary
+    keys, 2) "maps" mapping keys to size types, or 3) any arbitrary
+    combination of 1)s and 2)s. Thus, for example, an
+    <tt>std::multiset&lt;<b>int</b>&gt;</tt> might be used to store
+    multiple instances of integers, but using <tt>pb_ds</tt>'s
+    containers, one might use</p>
+    <pre>
+<a href=
+"tree.html">tree</a>&lt;<b>int</b>, size_t&gt;
+</pre><i>i.e.</i>, a "map" of <tt><b>int</b></tt>s to
+<tt>size_t</tt>s.
+
+    <p><a href="assoc_examples.html#mmaps">Associative-Container
+    Examples::"Multimaps" and "Multisets"</a> shows some simple
+    examples.</p>
+
+    <p>These "multimaps" and "multisets" might be confusing to
+    anyone familiar with the STL's <tt>std::multimap</tt> and
+    <tt>std::multiset</tt>, because there is no clear
+    correspondence between the two. For example, in some cases
+    where one uses <tt>std::multiset</tt> in the STL, one might use
+    in <tt>pb_ds</tt> a "multimap" of "multisets" - <i>i.e.</i>, a
+    container that maps primary keys each to an associative
+    container that maps each secondary key to the number of times
+    it occurs.</p>
+
+    <p>When one uses a "multimap," one should choose with care the
+    type of container used for secondary keys. This is further
+    explained in <a href=
+    "assoc_performance_tests.html#msc">Associative-Container
+    Performance Tests::Observations::Mapping-Semantics
+    Considerations</a>.</p>
+
+<hr>
+    <h2><a name="pq" id="pq">Priority Queues</a></h2>
+
+    <h3><a name="pq_basic" id="pq_basic">Basic Use</a></h3>
+
+    <p><tt>pb_ds</tt>'s priority_queue container is
+    similar to the STL's in interface. For example:</p>
+    <pre>
+<a href=
+"priority_queue.html">priority_queue</a>&lt;<b>int</b>&gt; p;
+
+p.push(2);
+p.push(4);
+p.push(1);
+
+assert(p.top() == 4);
+
+p.pop();
+
+assert(p.top() == 2);
+
+assert(p.size() == 2);
+assert(!p.empty());
+</pre>
+
+    <h3><a name="pq_policies" id="pq_policies">Configuring Priority
+    Queues</a></h3>
+
+    <p>As opposed to associative containers, priority queues have
+    relatively few configuration options. The priority queue is
+    parametrized as follows:</p>
+    <pre>
+<b>template</b>&lt;
+    <b>typename</b> Value_Type,
+    <b>typename</b> Cmp_Fn,
+    <b>typename</b> Tag,
+    <b>typename</b> Allocator&gt;
+<b>class</b> <a href="priority_queue.html">priority_queue</a>;
+</pre>
+
+    <p>The <tt>Value_Type</tt>, <tt>Cmp_Fn</tt>, and
+    <tt>Allocator</tt> parameters are the container's value type,
+    comparison-functor type, and allocator type, respectively;
+    these are very similar to the STL's priority queue. The
+    <tt>Tag</tt> parameter is different: there are a number of
+    pre-defined tag types corresponding to binary heaps, binomial
+    heaps, <i>etc.</i>, and <tt>Tag</tt> should be instantiated
+    by one of them. <a href=
+    "interface.html#ds_ts_pq">Interface::Data-Structure Tags and
+    Traits::Data Structure Tags::Priority-Queues</a> lists the
+    possible types, <a href="pq_design.html">Priority-Queue
+    Design</a> explains this further, and <a href=
+    "../../../../testsuite/ext/pb_ds/example/basic_priority_queue.cc"><tt>basic_priority_queue.cc</tt></a>
+    shows an example.</p>
+
+    <p>Note that as opposed to the STL's priority queue, <a href=
+    "priority_queue.html"><tt>priority_queue</tt></a> is not a
+    sequence-adapter; it is a regular container.</p>
+
+    <h3><a name="pq_ds_more_ops" id="pq_ds_more_ops">Supporting
+    More Operations</a></h3>
+
+    <p><a href="priority_queue.html"><tt>priority_queue</tt></a>'s
+    <tt>push</tt> method returns a point-type iterator, which can
+    be used for modifying or erasing arbitrary values. For
+    example:</p>
+    <pre>
+<a href=
+"priority_queue.html">priority_queue</a>&lt;<b>int</b>&gt; p;
+
+<a href=
+"priority_queue.html">priority_queue</a>&lt;<b>int</b>&gt;::point_iterator it = p.push(3);
+
+p.modify(it, 4);
+</pre>
+
+    <p>These types of operations are necessary for making priority
+    queues useful for different applications, especially graph
+    applications. <a href="pq_examples.html#xref">Priority-Queue
+    Examples::Cross-Referencing</a> gives some examples.</p>
+
+    <h3><a name="pq_ds_gen" id="pq_ds_gen">Determining Container
+    Attributes</a></h3>
+
+    <p>Similarly to <a href=
+    "assoc_container_traits.html"><tt>container_traits</tt></a> (described
+    in <a href="#assoc_ds_gen">Associative Containers::Determining
+    Containers' Attributes</a>), <a href=
+    "pq_container_traits.html"><tt>container_traits</tt></a> can be used to
+    statically determine priority-queues' attributes:</p>
+    <pre>
+<a href=
+"pq_container_traits.html">container_traits</a>&lt;C&gt;::container_category
+</pre>is one of a small number of predefined tag structures that
+identifies the underlying data structure, and
+    <pre>
+<a href=
+"pq_container_traits.html">container_traits</a>&lt;C&gt;::invalidation_guarantee
+</pre>
+
+    <p>is its invalidation guarantee. Invalidation guarantees are
+    especially important regarding priority queues, since in
+    <tt>pb_ds</tt>'s design, iterators are practically the only way
+    to manipulate them.</p>
+
+    <p><a href="pq_design.html#pq_traits">Design::Priority
+    Queues::Traits</a> discusses this further. <a href=
+    "pq_examples.html#generics">Priority-Queue
+    Examples::Generics</a> shows an example.</p>
+  </div>
+</body>
+</html>
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/update_policy_cd.png b/libstdc++-v3/docs/html/ext/pb_ds/update_policy_cd.png
new file mode 100644
index 00000000000..115a751c350
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/update_policy_cd.png
diff --git a/libstdc++-v3/docs/html/ext/pb_ds/update_seq_diagram.png b/libstdc++-v3/docs/html/ext/pb_ds/update_seq_diagram.png
new file mode 100644
index 00000000000..880a50edf8e
--- /dev/null
+++ b/libstdc++-v3/docs/html/ext/pb_ds/update_seq_diagram.png
diff --git a/libstdc++-v3/include/Makefile.am b/libstdc++-v3/include/Makefile.am
index 9d9e34b2faa..23a4120fda5 100644
--- a/libstdc++-v3/include/Makefile.am
+++ b/libstdc++-v3/include/Makefile.am
@@ -198,247 +198,331 @@ backward_headers = \
 	${backward_srcdir}/backward_warning.h
 
 
-assoc_srcdir = ${glibcxx_srcdir}/include/ext/pb_assoc
-assoc_builddir = ./ext/pb_assoc
+pb_srcdir = ${glibcxx_srcdir}/include/ext/pb_ds
+pb_builddir = ./ext/pb_ds
 
-assoc_subdirs = \
-	${assoc_builddir}/detail \
-	${assoc_builddir}/detail/tree_assoc_cntnr \
-	${assoc_builddir}/detail/basic_assoc_cntnr \
-	${assoc_builddir}/detail/splay_tree_ \
-	${assoc_builddir}/detail/typelist \
-	${assoc_builddir}/detail/basic_hash_assoc_cntnr \
-	${assoc_builddir}/detail/cc_ht_map_ \
-	${assoc_builddir}/detail/gp_ht_map_ \
-	${assoc_builddir}/detail/tree_policy \
-	${assoc_builddir}/detail/resize_policy \
-	${assoc_builddir}/detail/bin_search_tree_ \
-	${assoc_builddir}/detail/basic_tree_assoc_cntnr \
-	${assoc_builddir}/detail/cc_hash_assoc_cntnr \
-	${assoc_builddir}/detail/value_type_adapter \
-	${assoc_builddir}/detail/lu_policy \
-	${assoc_builddir}/detail/gp_hash_assoc_cntnr \
-	${assoc_builddir}/detail/unordered_iterator \
-	${assoc_builddir}/detail/ov_tree_map_ \
-	${assoc_builddir}/detail/lu_assoc_cntnr \
-	${assoc_builddir}/detail/hash_fn \
-	${assoc_builddir}/detail/eq_fn \
-	${assoc_builddir}/detail/rb_tree_map_ \
-	${assoc_builddir}/detail/lu_map_
+pb_subdirs = \
+	${pb_builddir}/detail \
+	${pb_builddir}/detail/pairing_heap_ \
+	${pb_builddir}/detail/splay_tree_ \
+	${pb_builddir}/detail/list_update_map_ \
+	${pb_builddir}/detail/typelist \
+	${pb_builddir}/detail/basic_tree_policy \
+	${pb_builddir}/detail/trie_policy \
+	${pb_builddir}/detail/gp_hash_table_map_ \
+	${pb_builddir}/detail/tree_policy \
+	${pb_builddir}/detail/binomial_heap_base_ \
+	${pb_builddir}/detail/resize_policy \
+	${pb_builddir}/detail/bin_search_tree_ \
+	${pb_builddir}/detail/binomial_heap_ \
+	${pb_builddir}/detail/thin_heap_ \
+	${pb_builddir}/detail/pat_trie_ \
+	${pb_builddir}/detail/cc_hash_table_map_ \
+	${pb_builddir}/detail/rc_binomial_heap_ \
+	${pb_builddir}/detail/left_child_next_sibling_heap_ \
+	${pb_builddir}/detail/unordered_iterator \
+	${pb_builddir}/detail/binary_heap_ \
+	${pb_builddir}/detail/ov_tree_map_ \
+	${pb_builddir}/detail/hash_fn \
+	${pb_builddir}/detail/eq_fn \
+	${pb_builddir}/detail/rb_tree_map_ \
+	${pb_builddir}/detail/list_update_policy
 
 # The ability for make and the underlying host to deal with this
 # unweildy list as one entire entity is not a sure thing, and may
-# cause build errors. Thus, split one list into five smaller ones.
-assoc_headers1 = \
-	${assoc_srcdir}/detail/tree_assoc_cntnr/constructor_destructor_fn_imps.hpp \
-	${assoc_srcdir}/detail/type_utils.hpp \
-	${assoc_srcdir}/detail/order_statistics_imp.hpp \
-	${assoc_srcdir}/detail/basic_assoc_cntnr/d_find_fn_imps.hpp \
-	${assoc_srcdir}/detail/basic_assoc_cntnr/d_insert_fn_imps.hpp \
-	${assoc_srcdir}/detail/basic_assoc_cntnr/extract_key.hpp \
-	${assoc_srcdir}/detail/basic_assoc_cntnr/erase_fn_imps.hpp \
-	${assoc_srcdir}/detail/basic_assoc_cntnr/insert_fn_imps.hpp \
-	${assoc_srcdir}/detail/basic_assoc_cntnr/constructor_destructor_fn_imps.hpp \
-	${assoc_srcdir}/detail/basic_assoc_cntnr/info_fn_imps.hpp \
-	${assoc_srcdir}/detail/basic_assoc_cntnr/iterators_fn_imps.hpp \
-	${assoc_srcdir}/detail/basic_assoc_cntnr/d_extract_key.hpp \
-	${assoc_srcdir}/detail/basic_assoc_cntnr/constructors_destructor_fn_imps.hpp \
-	${assoc_srcdir}/detail/splay_tree_/erase_fn_imps.hpp \
-	${assoc_srcdir}/detail/splay_tree_/splay_tree_.hpp \
-	${assoc_srcdir}/detail/splay_tree_/node.hpp \
-	${assoc_srcdir}/detail/splay_tree_/insert_fn_imps.hpp \
-	${assoc_srcdir}/detail/splay_tree_/find_fn_imps.hpp \
-	${assoc_srcdir}/detail/splay_tree_/splay_fn_imps.hpp \
-	${assoc_srcdir}/detail/splay_tree_/split_join_fn_imps.hpp \
-	${assoc_srcdir}/detail/splay_tree_/info_fn_imps.hpp \
-	${assoc_srcdir}/detail/splay_tree_/debug_fn_imps.hpp \
-	${assoc_srcdir}/detail/splay_tree_/constructors_destructor_fn_imps.hpp \
-	${assoc_srcdir}/detail/typelist/typelist_transform.hpp \
-	${assoc_srcdir}/detail/typelist/typelist_apply.hpp \
-	${assoc_srcdir}/detail/typelist/typelist_filter.hpp \
-	${assoc_srcdir}/detail/typelist/typelist_at_index.hpp \
-	${assoc_srcdir}/detail/typelist/typelist_contains.hpp \
-	${assoc_srcdir}/detail/typelist/typelist_append.hpp \
-	${assoc_srcdir}/detail/typelist/typelist_typelist_append.hpp \
-	${assoc_srcdir}/detail/ds_trait_imp.hpp \
-	${assoc_srcdir}/detail/basic_hash_assoc_cntnr/resize_fn_imps.hpp \
-	${assoc_srcdir}/detail/basic_hash_assoc_cntnr/constructor_destructor_fn_imps.hpp \
-	${assoc_srcdir}/detail/basic_hash_assoc_cntnr/constructors_destructor_fn_imps.hpp 
+# cause build errors. Thus, split one list into many smaller
+# mini-lists, with the maximum size per mini-list of no more than 42.
 
-assoc_headers2 = \
-	${assoc_srcdir}/detail/cc_ht_map_/resize_store_hash_fn_imps.hpp \
-	${assoc_srcdir}/detail/cc_ht_map_/find_store_hash_fn_imps.hpp \
-	${assoc_srcdir}/detail/cc_ht_map_/erase_no_store_hash_fn_imps.hpp \
-	${assoc_srcdir}/detail/cc_ht_map_/resize_fn_imps.hpp \
-	${assoc_srcdir}/detail/cc_ht_map_/debug_store_hash_fn_imps.hpp \
-	${assoc_srcdir}/detail/cc_ht_map_/erase_fn_imps.hpp \
-	${assoc_srcdir}/detail/cc_ht_map_/policy_access_fn_imps.hpp \
-	${assoc_srcdir}/detail/cc_ht_map_/cmp_fn_imps.hpp \
-	${assoc_srcdir}/detail/cc_ht_map_/insert_no_store_hash_fn_imps.hpp \
-	${assoc_srcdir}/detail/cc_ht_map_/insert_fn_imps.hpp \
-	${assoc_srcdir}/detail/cc_ht_map_/find_fn_imps.hpp \
-	${assoc_srcdir}/detail/cc_ht_map_/find_no_store_hash_fn_imps.hpp \
-	${assoc_srcdir}/detail/cc_ht_map_/cond_key_dtor_entry_dealtor.hpp \
-	${assoc_srcdir}/detail/cc_ht_map_/constructor_destructor_fn_imps.hpp \
-	${assoc_srcdir}/detail/cc_ht_map_/entry_list_fn_imps.hpp \
-	${assoc_srcdir}/detail/cc_ht_map_/constructor_destructor_store_hash_fn_imps.hpp \
-	${assoc_srcdir}/detail/cc_ht_map_/erase_store_hash_fn_imps.hpp \
-	${assoc_srcdir}/detail/cc_ht_map_/cc_ht_map_.hpp \
-	${assoc_srcdir}/detail/cc_ht_map_/constructor_destructor_no_store_hash_fn_imps.hpp \
-	${assoc_srcdir}/detail/cc_ht_map_/standard_policies.hpp \
-	${assoc_srcdir}/detail/cc_ht_map_/info_fn_imps.hpp \
-	${assoc_srcdir}/detail/cc_ht_map_/iterators_fn_imps.hpp \
-	${assoc_srcdir}/detail/cc_ht_map_/insert_store_hash_fn_imps.hpp \
-	${assoc_srcdir}/detail/cc_ht_map_/debug_fn_imps.hpp \
-	${assoc_srcdir}/detail/cc_ht_map_/size_fn_imps.hpp \
-	${assoc_srcdir}/detail/cc_ht_map_/debug_no_store_hash_fn_imps.hpp \
-	${assoc_srcdir}/detail/cc_ht_map_/resize_no_store_hash_fn_imps.hpp \
-	${assoc_srcdir}/detail/gp_ht_map_/resize_store_hash_fn_imps.hpp \
-	${assoc_srcdir}/detail/gp_ht_map_/find_store_hash_fn_imps.hpp \
-	${assoc_srcdir}/detail/gp_ht_map_/erase_no_store_hash_fn_imps.hpp \
-	${assoc_srcdir}/detail/gp_ht_map_/resize_fn_imps.hpp \
-	${assoc_srcdir}/detail/gp_ht_map_/debug_store_hash_fn_imps.hpp \
-	${assoc_srcdir}/detail/gp_ht_map_/erase_fn_imps.hpp \
-	${assoc_srcdir}/detail/gp_ht_map_/policy_access_fn_imps.hpp \
-	${assoc_srcdir}/detail/gp_ht_map_/insert_no_store_hash_fn_imps.hpp \
-	${assoc_srcdir}/detail/gp_ht_map_/insert_fn_imps.hpp \
-	${assoc_srcdir}/detail/gp_ht_map_/find_fn_imps.hpp \
-	${assoc_srcdir}/detail/gp_ht_map_/find_no_store_hash_fn_imps.hpp \
-	${assoc_srcdir}/detail/gp_ht_map_/constructor_destructor_fn_imps.hpp \
-	${assoc_srcdir}/detail/gp_ht_map_/constructor_destructor_store_hash_fn_imps.hpp \
-	${assoc_srcdir}/detail/gp_ht_map_/erase_store_hash_fn_imps.hpp \
-	${assoc_srcdir}/detail/gp_ht_map_/constructor_destructor_no_store_hash_fn_imps.hpp \
-	${assoc_srcdir}/detail/gp_ht_map_/info_fn_imps.hpp \
-	${assoc_srcdir}/detail/gp_ht_map_/insert_store_hash_fn_imps.hpp \
-	${assoc_srcdir}/detail/gp_ht_map_/debug_fn_imps.hpp \
-	${assoc_srcdir}/detail/gp_ht_map_/gp_ht_map_.hpp \
-	${assoc_srcdir}/detail/gp_ht_map_/iterator_fn_imps.hpp \
-	${assoc_srcdir}/detail/gp_ht_map_/debug_no_store_hash_fn_imps.hpp \
-	${assoc_srcdir}/detail/gp_ht_map_/resize_no_store_hash_fn_imps.hpp 
+pb_headers1 = \
+	${pb_srcdir}/assoc_container.hpp \
+	${pb_srcdir}/exception.hpp \
+	${pb_srcdir}/hash_policy.hpp \
+	${pb_srcdir}/list_update_policy.hpp \
+	${pb_srcdir}/priority_queue.hpp \
+	${pb_srcdir}/tag_and_trait.hpp \
+	${pb_srcdir}/tree_policy.hpp \
+	${pb_srcdir}/trie_policy.hpp \
+	${pb_srcdir}/detail/basic_tree_policy/basic_tree_policy_base.hpp \
+	${pb_srcdir}/detail/basic_tree_policy/null_node_metadata.hpp \
+	${pb_srcdir}/detail/basic_tree_policy/traits.hpp \
+	${pb_srcdir}/detail/basic_types.hpp \
+	${pb_srcdir}/detail/binary_heap_/binary_heap_.hpp \
+	${pb_srcdir}/detail/binary_heap_/const_iterator.hpp \
+	${pb_srcdir}/detail/binary_heap_/const_point_iterator.hpp \
+	${pb_srcdir}/detail/binary_heap_/constructors_destructor_fn_imps.hpp \
+	${pb_srcdir}/detail/binary_heap_/debug_fn_imps.hpp \
+	${pb_srcdir}/detail/binary_heap_/entry_cmp.hpp \
+	${pb_srcdir}/detail/binary_heap_/entry_pred.hpp \
+	${pb_srcdir}/detail/binary_heap_/erase_fn_imps.hpp \
+	${pb_srcdir}/detail/binary_heap_/find_fn_imps.hpp \
+	${pb_srcdir}/detail/binary_heap_/info_fn_imps.hpp \
+	${pb_srcdir}/detail/binary_heap_/insert_fn_imps.hpp \
+	${pb_srcdir}/detail/binary_heap_/iterators_fn_imps.hpp \
+	${pb_srcdir}/detail/binary_heap_/policy_access_fn_imps.hpp \
+	${pb_srcdir}/detail/binary_heap_/resize_policy.hpp \
+	${pb_srcdir}/detail/binary_heap_/split_join_fn_imps.hpp \
+	${pb_srcdir}/detail/binary_heap_/trace_fn_imps.hpp \
+	${pb_srcdir}/detail/binomial_heap_base_/binomial_heap_base_.hpp \
+	${pb_srcdir}/detail/binomial_heap_base_/constructors_destructor_fn_imps.hpp \
+	${pb_srcdir}/detail/binomial_heap_base_/debug_fn_imps.hpp \
+	${pb_srcdir}/detail/binomial_heap_base_/erase_fn_imps.hpp \
+	${pb_srcdir}/detail/binomial_heap_base_/find_fn_imps.hpp \
+	${pb_srcdir}/detail/binomial_heap_base_/insert_fn_imps.hpp \
+	${pb_srcdir}/detail/binomial_heap_base_/split_join_fn_imps.hpp \
+	${pb_srcdir}/detail/binomial_heap_/binomial_heap_.hpp \
+	${pb_srcdir}/detail/binomial_heap_/constructors_destructor_fn_imps.hpp \
+	${pb_srcdir}/detail/binomial_heap_/debug_fn_imps.hpp \
+	${pb_srcdir}/detail/bin_search_tree_/bin_search_tree_.hpp \
+	${pb_srcdir}/detail/bin_search_tree_/cond_dtor_entry_dealtor.hpp \
+	${pb_srcdir}/detail/bin_search_tree_/cond_key_dtor_entry_dealtor.hpp 
 
-assoc_headers3 = \
-	${assoc_srcdir}/detail/tree_policy/order_statistics_imp.hpp \
-	${assoc_srcdir}/detail/tree_policy/null_node_updator_imp.hpp \
-	${assoc_srcdir}/detail/types_traits.hpp \
-	${assoc_srcdir}/detail/mapping_level_imp.hpp \
-	${assoc_srcdir}/detail/map_debug_base.hpp \
-	${assoc_srcdir}/detail/resize_policy/ht_prime_size_policy_imp.hpp \
-	${assoc_srcdir}/detail/resize_policy/hash_load_check_resize_trigger_imp.hpp \
-	${assoc_srcdir}/detail/resize_policy/hash_prime_size_policy_imp.hpp \
-	${assoc_srcdir}/detail/resize_policy/size_base.hpp \
-	${assoc_srcdir}/detail/resize_policy/cc_hash_max_collision_resize_trigger_imp.hpp \
-	${assoc_srcdir}/detail/resize_policy/hash_exponential_size_policy_imp.hpp \
-	${assoc_srcdir}/detail/resize_policy/hash_standard_resize_policy_imp.hpp \
-	${assoc_srcdir}/detail/bin_search_tree_/cond_dtor_entry_dealtor.hpp \
-	${assoc_srcdir}/detail/bin_search_tree_/find_iterators.hpp \
-	${assoc_srcdir}/detail/bin_search_tree_/erase_fn_imps.hpp \
-	${assoc_srcdir}/detail/bin_search_tree_/insert_fn_imps.hpp \
-	${assoc_srcdir}/detail/bin_search_tree_/find_fn_imps.hpp \
-	${assoc_srcdir}/detail/bin_search_tree_/cond_key_dtor_entry_dealtor.hpp \
-	${assoc_srcdir}/detail/bin_search_tree_/node_iterators.hpp \
-	${assoc_srcdir}/detail/bin_search_tree_/bin_search_tree_.hpp \
-	${assoc_srcdir}/detail/bin_search_tree_/split_join_fn_imps.hpp \
-	${assoc_srcdir}/detail/bin_search_tree_/rotate_fn_imps.hpp \
-	${assoc_srcdir}/detail/bin_search_tree_/info_fn_imps.hpp \
-	${assoc_srcdir}/detail/bin_search_tree_/iterators_fn_imps.hpp \
-	${assoc_srcdir}/detail/bin_search_tree_/r_erase_fn_imps.hpp \
-	${assoc_srcdir}/detail/bin_search_tree_/debug_fn_imps.hpp \
-	${assoc_srcdir}/detail/bin_search_tree_/constructors_destructor_fn_imps.hpp \
-	${assoc_srcdir}/detail/basic_tree_assoc_cntnr/r_range_iteration_fn_imps.hpp \
-	${assoc_srcdir}/detail/basic_tree_assoc_cntnr/erase_fn_imps.hpp \
-	${assoc_srcdir}/detail/basic_tree_assoc_cntnr/policy_access_fn_imps.hpp \
-	${assoc_srcdir}/detail/basic_tree_assoc_cntnr/constructor_destructor_fn_imps.hpp \
-	${assoc_srcdir}/detail/basic_tree_assoc_cntnr/split_join_fn_imps.hpp \
-	${assoc_srcdir}/detail/basic_tree_assoc_cntnr/r_erase_fn_imps.hpp \
-	${assoc_srcdir}/detail/basic_tree_assoc_cntnr/range_iteration_fn_imps.hpp \
-	${assoc_srcdir}/detail/basic_tree_assoc_cntnr/constructors_destructor_fn_imps.hpp \
-	${assoc_srcdir}/detail/basic_tree_assoc_cntnr/node_iteration_fn_imps.hpp \
-	${assoc_srcdir}/detail/cc_hash_assoc_cntnr/constructor_destructor_fn_imps.hpp 
+pb_headers2 = \
+	${pb_srcdir}/detail/bin_search_tree_/constructors_destructor_fn_imps.hpp \
+	${pb_srcdir}/detail/bin_search_tree_/debug_fn_imps.hpp \
+	${pb_srcdir}/detail/bin_search_tree_/erase_fn_imps.hpp \
+	${pb_srcdir}/detail/bin_search_tree_/find_fn_imps.hpp \
+	${pb_srcdir}/detail/bin_search_tree_/info_fn_imps.hpp \
+	${pb_srcdir}/detail/bin_search_tree_/insert_fn_imps.hpp \
+	${pb_srcdir}/detail/bin_search_tree_/iterators_fn_imps.hpp \
+	${pb_srcdir}/detail/bin_search_tree_/node_iterators.hpp \
+	${pb_srcdir}/detail/bin_search_tree_/point_iterators.hpp \
+	${pb_srcdir}/detail/bin_search_tree_/policy_access_fn_imps.hpp \
+	${pb_srcdir}/detail/bin_search_tree_/r_erase_fn_imps.hpp \
+	${pb_srcdir}/detail/bin_search_tree_/rotate_fn_imps.hpp \
+	${pb_srcdir}/detail/bin_search_tree_/split_join_fn_imps.hpp \
+	${pb_srcdir}/detail/bin_search_tree_/traits.hpp \
+	${pb_srcdir}/detail/cc_hash_table_map_/cc_ht_map_.hpp \
+	${pb_srcdir}/detail/cc_hash_table_map_/cmp_fn_imps.hpp \
+	${pb_srcdir}/detail/cc_hash_table_map_/cond_key_dtor_entry_dealtor.hpp \
+	${pb_srcdir}/detail/cc_hash_table_map_/constructor_destructor_fn_imps.hpp \
+	${pb_srcdir}/detail/cc_hash_table_map_/constructor_destructor_no_store_hash_fn_imps.hpp \
+	${pb_srcdir}/detail/cc_hash_table_map_/constructor_destructor_store_hash_fn_imps.hpp \
+	${pb_srcdir}/detail/cc_hash_table_map_/debug_fn_imps.hpp \
+	${pb_srcdir}/detail/cc_hash_table_map_/debug_no_store_hash_fn_imps.hpp \
+	${pb_srcdir}/detail/cc_hash_table_map_/debug_store_hash_fn_imps.hpp \
+	${pb_srcdir}/detail/cc_hash_table_map_/entry_list_fn_imps.hpp \
+	${pb_srcdir}/detail/cc_hash_table_map_/erase_fn_imps.hpp \
+	${pb_srcdir}/detail/cc_hash_table_map_/erase_no_store_hash_fn_imps.hpp \
+	${pb_srcdir}/detail/cc_hash_table_map_/erase_store_hash_fn_imps.hpp \
+	${pb_srcdir}/detail/cc_hash_table_map_/find_fn_imps.hpp \
+	${pb_srcdir}/detail/cc_hash_table_map_/find_store_hash_fn_imps.hpp \
+	${pb_srcdir}/detail/cc_hash_table_map_/info_fn_imps.hpp \
+	${pb_srcdir}/detail/cc_hash_table_map_/insert_fn_imps.hpp \
+	${pb_srcdir}/detail/cc_hash_table_map_/insert_no_store_hash_fn_imps.hpp \
+	${pb_srcdir}/detail/cc_hash_table_map_/insert_store_hash_fn_imps.hpp \
+	${pb_srcdir}/detail/cc_hash_table_map_/iterators_fn_imps.hpp \
+	${pb_srcdir}/detail/cc_hash_table_map_/policy_access_fn_imps.hpp \
+	${pb_srcdir}/detail/cc_hash_table_map_/resize_fn_imps.hpp \
+	${pb_srcdir}/detail/cc_hash_table_map_/resize_no_store_hash_fn_imps.hpp \
+	${pb_srcdir}/detail/cc_hash_table_map_/resize_store_hash_fn_imps.hpp \
+	${pb_srcdir}/detail/cc_hash_table_map_/size_fn_imps.hpp \
+	${pb_srcdir}/detail/cc_hash_table_map_/standard_policies.hpp 
 
-assoc_headers4 = \
-	${assoc_srcdir}/detail/assoc_cntnr_base.hpp \
-	${assoc_srcdir}/detail/ms_category_imp.hpp \
-	${assoc_srcdir}/detail/hash_types_traits.hpp \
-	${assoc_srcdir}/detail/typelist.hpp \
-	${assoc_srcdir}/detail/value_type_adapter/invalidation_guarantee_selector.hpp \
-	${assoc_srcdir}/detail/value_type_adapter/erase_fn_imps.hpp \
-	${assoc_srcdir}/detail/value_type_adapter/iterator.hpp \
-	${assoc_srcdir}/detail/value_type_adapter/constructor_destructor_and_related.hpp \
-	${assoc_srcdir}/detail/value_type_adapter/value_type_traits.hpp \
-	${assoc_srcdir}/detail/value_type_adapter/insert_fn_imps.hpp \
-	${assoc_srcdir}/detail/value_type_adapter/find_fn_imps.hpp \
-	${assoc_srcdir}/detail/value_type_adapter/ref_pair.hpp \
-	${assoc_srcdir}/detail/value_type_adapter/it_value_type_traits.hpp \
-	${assoc_srcdir}/detail/value_type_adapter/info_fn_imps.hpp \
-	${assoc_srcdir}/detail/value_type_adapter/erase_if_pred.hpp \
-	${assoc_srcdir}/detail/value_type_adapter/value_type_adapter.hpp \
-	${assoc_srcdir}/detail/value_type_adapter/iterator_fn_imps.hpp \
-	${assoc_srcdir}/detail/lu_policy/mtf_lu_policy_imp.hpp \
-	${assoc_srcdir}/detail/lu_policy/counter_lu_policy_imp.hpp \
-	${assoc_srcdir}/detail/lu_policy/counter_lu_metadata_imp.hpp \
-	${assoc_srcdir}/detail/gp_hash_assoc_cntnr/constructor_destructor_fn_imps.hpp \
-	${assoc_srcdir}/detail/unordered_iterator/find_iterator.hpp \
-	${assoc_srcdir}/detail/unordered_iterator/iterator.hpp \
-	${assoc_srcdir}/detail/unordered_iterator/const_iterator.hpp \
-	${assoc_srcdir}/detail/unordered_iterator/const_find_iterator.hpp \
-	${assoc_srcdir}/detail/standard_policies.hpp \
-	${assoc_srcdir}/detail/standard_sizes.hpp \
-	${assoc_srcdir}/detail/ov_tree_map_/erase_fn_imps.hpp \
-	${assoc_srcdir}/detail/ov_tree_map_/insert_fn_imps.hpp \
-	${assoc_srcdir}/detail/ov_tree_map_/find_fn_imps.hpp \
-	${assoc_srcdir}/detail/ov_tree_map_/ov_tree_map_.hpp \
-	${assoc_srcdir}/detail/ov_tree_map_/node_iterators.hpp \
-	${assoc_srcdir}/detail/ov_tree_map_/split_join_fn_imps.hpp \
-	${assoc_srcdir}/detail/ov_tree_map_/cond_dtor.hpp \
-	${assoc_srcdir}/detail/ov_tree_map_/info_fn_imps.hpp \
-	${assoc_srcdir}/detail/ov_tree_map_/iterators_fn_imps.hpp \
-	${assoc_srcdir}/detail/ov_tree_map_/debug_fn_imps.hpp \
-	${assoc_srcdir}/detail/ov_tree_map_/constructors_destructor_fn_imps.hpp
+pb_headers3 = \
+	${pb_srcdir}/detail/cc_hash_table_map_/trace_fn_imps.hpp \
+	${pb_srcdir}/detail/cond_dealtor.hpp \
+	${pb_srcdir}/detail/constructors_destructor_fn_imps.hpp \
+	${pb_srcdir}/detail/container_base_dispatch.hpp \
+	${pb_srcdir}/detail/eq_fn/eq_by_less.hpp \
+	${pb_srcdir}/detail/eq_fn/hash_eq_fn.hpp \
+	${pb_srcdir}/detail/gp_hash_table_map_/constructor_destructor_fn_imps.hpp \
+	${pb_srcdir}/detail/gp_hash_table_map_/constructor_destructor_no_store_hash_fn_imps.hpp \
+	${pb_srcdir}/detail/gp_hash_table_map_/constructor_destructor_store_hash_fn_imps.hpp \
+	${pb_srcdir}/detail/gp_hash_table_map_/debug_fn_imps.hpp \
+	${pb_srcdir}/detail/gp_hash_table_map_/debug_no_store_hash_fn_imps.hpp \
+	${pb_srcdir}/detail/gp_hash_table_map_/debug_store_hash_fn_imps.hpp \
+	${pb_srcdir}/detail/gp_hash_table_map_/erase_fn_imps.hpp \
+	${pb_srcdir}/detail/gp_hash_table_map_/erase_no_store_hash_fn_imps.hpp \
+	${pb_srcdir}/detail/gp_hash_table_map_/erase_store_hash_fn_imps.hpp \
+	${pb_srcdir}/detail/gp_hash_table_map_/find_fn_imps.hpp \
+	${pb_srcdir}/detail/gp_hash_table_map_/find_no_store_hash_fn_imps.hpp \
+	${pb_srcdir}/detail/gp_hash_table_map_/find_store_hash_fn_imps.hpp \
+	${pb_srcdir}/detail/gp_hash_table_map_/gp_ht_map_.hpp \
+	${pb_srcdir}/detail/gp_hash_table_map_/info_fn_imps.hpp \
+	${pb_srcdir}/detail/gp_hash_table_map_/insert_fn_imps.hpp \
+	${pb_srcdir}/detail/gp_hash_table_map_/insert_no_store_hash_fn_imps.hpp \
+	${pb_srcdir}/detail/gp_hash_table_map_/insert_store_hash_fn_imps.hpp \
+	${pb_srcdir}/detail/gp_hash_table_map_/iterator_fn_imps.hpp \
+	${pb_srcdir}/detail/gp_hash_table_map_/policy_access_fn_imps.hpp \
+	${pb_srcdir}/detail/gp_hash_table_map_/resize_fn_imps.hpp \
+	${pb_srcdir}/detail/gp_hash_table_map_/resize_no_store_hash_fn_imps.hpp \
+	${pb_srcdir}/detail/gp_hash_table_map_/resize_store_hash_fn_imps.hpp \
+	${pb_srcdir}/detail/gp_hash_table_map_/standard_policies.hpp \
+	${pb_srcdir}/detail/gp_hash_table_map_/trace_fn_imps.hpp \
+	${pb_srcdir}/detail/hash_fn/direct_mask_range_hashing_imp.hpp \
+	${pb_srcdir}/detail/hash_fn/direct_mod_range_hashing_imp.hpp \
+	${pb_srcdir}/detail/hash_fn/linear_probe_fn_imp.hpp \
+	${pb_srcdir}/detail/hash_fn/mask_based_range_hashing.hpp \
+	${pb_srcdir}/detail/hash_fn/mod_based_range_hashing.hpp \
+	${pb_srcdir}/detail/hash_fn/probe_fn_base.hpp \
+	${pb_srcdir}/detail/hash_fn/quadratic_probe_fn_imp.hpp \
+	${pb_srcdir}/detail/hash_fn/ranged_hash_fn.hpp \
+	${pb_srcdir}/detail/hash_fn/ranged_probe_fn.hpp 
+
+pb_headers4 = \
+	${pb_srcdir}/detail/hash_fn/sample_probe_fn.hpp \
+	${pb_srcdir}/detail/hash_fn/sample_ranged_hash_fn.hpp \
+	${pb_srcdir}/detail/hash_fn/sample_ranged_probe_fn.hpp \
+	${pb_srcdir}/detail/hash_fn/sample_range_hashing.hpp \
+	${pb_srcdir}/detail/left_child_next_sibling_heap_/const_iterator.hpp \
+	${pb_srcdir}/detail/left_child_next_sibling_heap_/const_point_iterator.hpp \
+	${pb_srcdir}/detail/left_child_next_sibling_heap_/constructors_destructor_fn_imps.hpp \
+	${pb_srcdir}/detail/left_child_next_sibling_heap_/debug_fn_imps.hpp \
+	${pb_srcdir}/detail/left_child_next_sibling_heap_/erase_fn_imps.hpp \
+	${pb_srcdir}/detail/left_child_next_sibling_heap_/info_fn_imps.hpp \
+	${pb_srcdir}/detail/left_child_next_sibling_heap_/insert_fn_imps.hpp \
+	${pb_srcdir}/detail/left_child_next_sibling_heap_/iterators_fn_imps.hpp \
+	${pb_srcdir}/detail/left_child_next_sibling_heap_/left_child_next_sibling_heap_.hpp \
+	${pb_srcdir}/detail/left_child_next_sibling_heap_/node.hpp \
+	${pb_srcdir}/detail/left_child_next_sibling_heap_/null_metadata.hpp \
+	${pb_srcdir}/detail/left_child_next_sibling_heap_/policy_access_fn_imps.hpp \
+	${pb_srcdir}/detail/left_child_next_sibling_heap_/trace_fn_imps.hpp \
+	${pb_srcdir}/detail/list_update_map_/constructor_destructor_fn_imps.hpp \
+	${pb_srcdir}/detail/list_update_map_/debug_fn_imps.hpp \
+	${pb_srcdir}/detail/list_update_map_/entry_metadata_base.hpp \
+	${pb_srcdir}/detail/list_update_map_/erase_fn_imps.hpp \
+	${pb_srcdir}/detail/list_update_map_/find_fn_imps.hpp \
+	${pb_srcdir}/detail/list_update_map_/info_fn_imps.hpp \
+	${pb_srcdir}/detail/list_update_map_/insert_fn_imps.hpp \
+	${pb_srcdir}/detail/list_update_map_/iterators_fn_imps.hpp \
+	${pb_srcdir}/detail/list_update_map_/lu_map_.hpp \
+	${pb_srcdir}/detail/list_update_map_/trace_fn_imps.hpp \
+	${pb_srcdir}/detail/list_update_policy/counter_lu_metadata.hpp \
+	${pb_srcdir}/detail/list_update_policy/counter_lu_policy_imp.hpp \
+	${pb_srcdir}/detail/list_update_policy/mtf_lu_policy_imp.hpp \
+	${pb_srcdir}/detail/list_update_policy/sample_update_policy.hpp \
+	${pb_srcdir}/detail/map_debug_base.hpp \
+	${pb_srcdir}/detail/ov_tree_map_/cond_dtor.hpp \
+	${pb_srcdir}/detail/ov_tree_map_/constructors_destructor_fn_imps.hpp \
+	${pb_srcdir}/detail/ov_tree_map_/debug_fn_imps.hpp \
+	${pb_srcdir}/detail/ov_tree_map_/erase_fn_imps.hpp \
+	${pb_srcdir}/detail/ov_tree_map_/info_fn_imps.hpp \
+	${pb_srcdir}/detail/ov_tree_map_/insert_fn_imps.hpp \
+	${pb_srcdir}/detail/ov_tree_map_/iterators_fn_imps.hpp \
+	${pb_srcdir}/detail/ov_tree_map_/node_iterators.hpp \
+	${pb_srcdir}/detail/ov_tree_map_/ov_tree_map_.hpp 
+
+pb_headers5 = \
+	${pb_srcdir}/detail/ov_tree_map_/policy_access_fn_imps.hpp \
+	${pb_srcdir}/detail/ov_tree_map_/split_join_fn_imps.hpp \
+	${pb_srcdir}/detail/ov_tree_map_/traits.hpp \
+	${pb_srcdir}/detail/pairing_heap_/constructors_destructor_fn_imps.hpp \
+	${pb_srcdir}/detail/pairing_heap_/debug_fn_imps.hpp \
+	${pb_srcdir}/detail/pairing_heap_/erase_fn_imps.hpp \
+	${pb_srcdir}/detail/pairing_heap_/find_fn_imps.hpp \
+	${pb_srcdir}/detail/pairing_heap_/insert_fn_imps.hpp \
+	${pb_srcdir}/detail/pairing_heap_/pairing_heap_.hpp \
+	${pb_srcdir}/detail/pairing_heap_/split_join_fn_imps.hpp \
+	${pb_srcdir}/detail/pat_trie_/child_iterator.hpp \
+	${pb_srcdir}/detail/pat_trie_/cond_dtor_entry_dealtor.hpp \
+	${pb_srcdir}/detail/pat_trie_/const_child_iterator.hpp \
+	${pb_srcdir}/detail/pat_trie_/constructors_destructor_fn_imps.hpp \
+	${pb_srcdir}/detail/pat_trie_/debug_fn_imps.hpp \
+	${pb_srcdir}/detail/pat_trie_/erase_fn_imps.hpp \
+	${pb_srcdir}/detail/pat_trie_/find_fn_imps.hpp \
+	${pb_srcdir}/detail/pat_trie_/head.hpp \
+	${pb_srcdir}/detail/pat_trie_/info_fn_imps.hpp \
+	${pb_srcdir}/detail/pat_trie_/insert_join_fn_imps.hpp \
+	${pb_srcdir}/detail/pat_trie_/internal_node.hpp \
+	${pb_srcdir}/detail/pat_trie_/iterators_fn_imps.hpp \
+	${pb_srcdir}/detail/pat_trie_/leaf.hpp \
+	${pb_srcdir}/detail/pat_trie_/node_base.hpp \
+	${pb_srcdir}/detail/pat_trie_/node_iterators.hpp \
+	${pb_srcdir}/detail/pat_trie_/node_metadata_base.hpp \
+	${pb_srcdir}/detail/pat_trie_/pat_trie_.hpp \
+	${pb_srcdir}/detail/pat_trie_/point_iterators.hpp \
+	${pb_srcdir}/detail/pat_trie_/policy_access_fn_imps.hpp \
+	${pb_srcdir}/detail/pat_trie_/r_erase_fn_imps.hpp \
+	${pb_srcdir}/detail/pat_trie_/rotate_fn_imps.hpp \
+	${pb_srcdir}/detail/pat_trie_/split_fn_imps.hpp \
+	${pb_srcdir}/detail/pat_trie_/split_join_branch_bag.hpp \
+	${pb_srcdir}/detail/pat_trie_/synth_e_access_traits.hpp \
+	${pb_srcdir}/detail/pat_trie_/trace_fn_imps.hpp \
+	${pb_srcdir}/detail/pat_trie_/traits.hpp \
+	${pb_srcdir}/detail/pat_trie_/update_fn_imps.hpp \
+	${pb_srcdir}/detail/priority_queue_base_dispatch.hpp \
+	${pb_srcdir}/detail/rb_tree_map_/constructors_destructor_fn_imps.hpp \
+	${pb_srcdir}/detail/rb_tree_map_/debug_fn_imps.hpp 
+
+pb_headers6 = \
+	${pb_srcdir}/detail/rb_tree_map_/erase_fn_imps.hpp \
+	${pb_srcdir}/detail/rb_tree_map_/find_fn_imps.hpp \
+	${pb_srcdir}/detail/rb_tree_map_/info_fn_imps.hpp \
+	${pb_srcdir}/detail/rb_tree_map_/insert_fn_imps.hpp \
+	${pb_srcdir}/detail/rb_tree_map_/node.hpp \
+	${pb_srcdir}/detail/rb_tree_map_/rb_tree_.hpp \
+	${pb_srcdir}/detail/rb_tree_map_/split_join_fn_imps.hpp \
+	${pb_srcdir}/detail/rb_tree_map_/traits.hpp \
+	${pb_srcdir}/detail/rc_binomial_heap_/constructors_destructor_fn_imps.hpp \
+	${pb_srcdir}/detail/rc_binomial_heap_/debug_fn_imps.hpp \
+	${pb_srcdir}/detail/rc_binomial_heap_/erase_fn_imps.hpp \
+	${pb_srcdir}/detail/rc_binomial_heap_/insert_fn_imps.hpp \
+	${pb_srcdir}/detail/rc_binomial_heap_/rc_binomial_heap_.hpp \
+	${pb_srcdir}/detail/rc_binomial_heap_/rc.hpp \
+	${pb_srcdir}/detail/rc_binomial_heap_/split_join_fn_imps.hpp \
+	${pb_srcdir}/detail/rc_binomial_heap_/trace_fn_imps.hpp \
+	${pb_srcdir}/detail/resize_policy/cc_hash_max_collision_check_resize_trigger_imp.hpp \
+	${pb_srcdir}/detail/resize_policy/hash_exponential_size_policy_imp.hpp \
+	${pb_srcdir}/detail/resize_policy/hash_load_check_resize_trigger_imp.hpp \
+	${pb_srcdir}/detail/resize_policy/hash_load_check_resize_trigger_size_base.hpp \
+	${pb_srcdir}/detail/resize_policy/hash_prime_size_policy_imp.hpp \
+	${pb_srcdir}/detail/resize_policy/hash_standard_resize_policy_imp.hpp \
+	${pb_srcdir}/detail/resize_policy/sample_resize_policy.hpp \
+	${pb_srcdir}/detail/resize_policy/sample_resize_trigger.hpp \
+	${pb_srcdir}/detail/resize_policy/sample_size_policy.hpp \
+	${pb_srcdir}/detail/splay_tree_/constructors_destructor_fn_imps.hpp \
+	${pb_srcdir}/detail/splay_tree_/debug_fn_imps.hpp \
+	${pb_srcdir}/detail/splay_tree_/erase_fn_imps.hpp \
+	${pb_srcdir}/detail/splay_tree_/find_fn_imps.hpp \
+	${pb_srcdir}/detail/splay_tree_/info_fn_imps.hpp \
+	${pb_srcdir}/detail/splay_tree_/insert_fn_imps.hpp \
+	${pb_srcdir}/detail/splay_tree_/node.hpp \
+	${pb_srcdir}/detail/splay_tree_/splay_fn_imps.hpp \
+	${pb_srcdir}/detail/splay_tree_/splay_tree_.hpp \
+	${pb_srcdir}/detail/splay_tree_/split_join_fn_imps.hpp \
+	${pb_srcdir}/detail/splay_tree_/traits.hpp \
+	${pb_srcdir}/detail/standard_policies.hpp \
+	${pb_srcdir}/detail/thin_heap_/constructors_destructor_fn_imps.hpp \
+	${pb_srcdir}/detail/thin_heap_/debug_fn_imps.hpp \
+	${pb_srcdir}/detail/thin_heap_/erase_fn_imps.hpp 
+
+pb_headers7 = \
+	${pb_srcdir}/detail/thin_heap_/find_fn_imps.hpp \
+	${pb_srcdir}/detail/thin_heap_/insert_fn_imps.hpp \
+	${pb_srcdir}/detail/thin_heap_/split_join_fn_imps.hpp \
+	${pb_srcdir}/detail/thin_heap_/thin_heap_.hpp \
+	${pb_srcdir}/detail/thin_heap_/trace_fn_imps.hpp \
+	${pb_srcdir}/detail/tree_policy/node_metadata_selector.hpp \
+	${pb_srcdir}/detail/tree_policy/null_node_update_imp.hpp \
+	${pb_srcdir}/detail/tree_policy/order_statistics_imp.hpp \
+	${pb_srcdir}/detail/tree_policy/sample_tree_node_update.hpp \
+	${pb_srcdir}/detail/tree_trace_base.hpp \
+	${pb_srcdir}/detail/trie_policy/node_metadata_selector.hpp \
+	${pb_srcdir}/detail/trie_policy/null_node_update_imp.hpp \
+	${pb_srcdir}/detail/trie_policy/order_statistics_imp.hpp \
+	${pb_srcdir}/detail/trie_policy/prefix_search_node_update_imp.hpp \
+	${pb_srcdir}/detail/trie_policy/sample_trie_e_access_traits.hpp \
+	${pb_srcdir}/detail/trie_policy/sample_trie_node_update.hpp \
+	${pb_srcdir}/detail/trie_policy/string_trie_e_access_traits_imp.hpp \
+	${pb_srcdir}/detail/trie_policy/trie_policy_base.hpp \
+	${pb_srcdir}/detail/typelist_assoc_container.hpp \
+	${pb_srcdir}/detail/typelist.hpp \
+	${pb_srcdir}/detail/typelist/typelist_append.hpp \
+	${pb_srcdir}/detail/typelist/typelist_apply.hpp \
+	${pb_srcdir}/detail/typelist/typelist_assoc_container_find.hpp \
+	${pb_srcdir}/detail/typelist/typelist_at_index.hpp \
+	${pb_srcdir}/detail/typelist/typelist_contains.hpp \
+	${pb_srcdir}/detail/typelist/typelist_filter.hpp \
+	${pb_srcdir}/detail/typelist/typelist_flatten.hpp \
+	${pb_srcdir}/detail/typelist/typelist_transform.hpp \
+	${pb_srcdir}/detail/typelist/typelist_typelist_append.hpp \
+	${pb_srcdir}/detail/types_traits.hpp \
+	${pb_srcdir}/detail/type_utils.hpp \
+	${pb_srcdir}/detail/unordered_iterator/const_iterator.hpp \
+	${pb_srcdir}/detail/unordered_iterator/const_point_iterator.hpp \
+	${pb_srcdir}/detail/unordered_iterator/iterator.hpp \
+	${pb_srcdir}/detail/unordered_iterator/point_iterator.hpp 
 
-assoc_headers5 = \
-	${assoc_srcdir}/detail/lu_assoc_cntnr/policy_access_fn_imps.hpp \
-	${assoc_srcdir}/detail/lu_assoc_cntnr/constructor_destructor_fn_imps.hpp \
-	${assoc_srcdir}/detail/hash_fn/linear_probe_fn_imp.hpp \
-	${assoc_srcdir}/detail/hash_fn/mod_based_range_hashing.hpp \
-	${assoc_srcdir}/detail/hash_fn/direct_mod_range_hashing_imp.hpp \
-	${assoc_srcdir}/detail/hash_fn/probe_fn_base.hpp \
-	${assoc_srcdir}/detail/hash_fn/ranged_probe_fn.hpp \
-	${assoc_srcdir}/detail/hash_fn/quadratic_probe_fn_imp.hpp \
-	${assoc_srcdir}/detail/hash_fn/direct_mask_range_hashing_imp.hpp \
-	${assoc_srcdir}/detail/hash_fn/ranged_hash_fn.hpp \
-	${assoc_srcdir}/detail/hash_fn/mask_based_range_hashing.hpp \
-	${assoc_srcdir}/detail/eq_fn/eq_by_less.hpp \
-	${assoc_srcdir}/detail/eq_fn/hash_eq_fn.hpp \
-	${assoc_srcdir}/detail/rb_tree_map_/erase_fn_imps.hpp \
-	${assoc_srcdir}/detail/rb_tree_map_/node.hpp \
-	${assoc_srcdir}/detail/rb_tree_map_/insert_fn_imps.hpp \
-	${assoc_srcdir}/detail/rb_tree_map_/find_fn_imps.hpp \
-	${assoc_srcdir}/detail/rb_tree_map_/split_join_fn_imps.hpp \
-	${assoc_srcdir}/detail/rb_tree_map_/rb_tree_.hpp \
-	${assoc_srcdir}/detail/rb_tree_map_/info_fn_imps.hpp \
-	${assoc_srcdir}/detail/rb_tree_map_/debug_fn_imps.hpp \
-	${assoc_srcdir}/detail/rb_tree_map_/constructors_destructor_fn_imps.hpp \
-	${assoc_srcdir}/detail/lu_map_/lu_map_.hpp \
-	${assoc_srcdir}/detail/lu_map_/erase_fn_imps.hpp \
-	${assoc_srcdir}/detail/lu_map_/policy_access_fn_imps.hpp \
-	${assoc_srcdir}/detail/lu_map_/insert_fn_imps.hpp \
-	${assoc_srcdir}/detail/lu_map_/find_fn_imps.hpp \
-	${assoc_srcdir}/detail/lu_map_/constructor_destructor_fn_imps.hpp \
-	${assoc_srcdir}/detail/lu_map_/info_fn_imps.hpp \
-	${assoc_srcdir}/detail/lu_map_/iterators_fn_imps.hpp \
-	${assoc_srcdir}/detail/lu_map_/debug_fn_imps.hpp \
-	${assoc_srcdir}/detail/constructors_destructor_fn_imps.hpp \
-	${assoc_srcdir}/detail/ms_trait_imp.hpp \
-	${assoc_srcdir}/detail/cond_dealtor.hpp \
-	${assoc_srcdir}/hash_policy.hpp \
-	${assoc_srcdir}/trivial_iterator_def.hpp \
-	${assoc_srcdir}/ds_trait.hpp \
-	${assoc_srcdir}/exception.hpp \
-	${assoc_srcdir}/tree_policy.hpp \
-	${assoc_srcdir}/lu_policy.hpp \
-	${assoc_srcdir}/ms_trait.hpp \
-	${assoc_srcdir}/assoc_cntnr.hpp \
-	${assoc_srcdir}/data_type.hpp 
 
 
 ext_srcdir = ${glibcxx_srcdir}/include/ext
@@ -696,7 +780,7 @@ endif
 # CLEANFILES and all-local are kept up-to-date.
 allstamped = \
 	stamp-std stamp-bits stamp-c_base stamp-c_compatibility \
-	stamp-backward stamp-ext stamp-assoc stamp-tr1 stamp-debug stamp-host
+	stamp-backward stamp-ext stamp-pb stamp-tr1 stamp-debug stamp-host
 
 # List of all files that are created by explicit building, editing, or
 # catenation.
@@ -777,42 +861,54 @@ stamp-ext: ${ext_headers}
 
 # Have to deal with nested include directories, gah! Strip off source
 # directory before making the link.
-# XXX check  ${assoc_headers}
-stamp-assoc:
-	@if [ ! -d "${assoc_builddir}" ]; then \
-	    mkdir -p ${assoc_subdirs} ;\
+# XXX check  ${pb_headers}
+stamp-pb:
+	@if [ ! -d "${pb_builddir}" ]; then \
+	    mkdir -p ${pb_subdirs} ;\
 	fi 
-	@if [ ! -f stamp-assoc ]; then \
-	    cd ${assoc_builddir} && for h in ${assoc_headers1}; do \
-		build_name=`echo $$h | sed -e "s|${assoc_srcdir}|.|g"` ;\
+	@if [ ! -f stamp-pb ]; then \
+	    cd ${pb_builddir} && for h in ${pb_headers1}; do \
+		build_name=`echo $$h | sed -e "s|${pb_srcdir}|.|g"` ;\
+		$(LN_S) $$h $${build_name} || true ;\
+	      done ;\
+	fi
+	@if [ ! -f stamp-pb ]; then \
+	    cd ${pb_builddir} && for h in ${pb_headers2}; do \
+		build_name=`echo $$h | sed -e "s|${pb_srcdir}|.|g"` ;\
+		$(LN_S) $$h $${build_name} || true ;\
+	      done ;\
+	fi
+	@if [ ! -f stamp-pb ]; then \
+	    cd ${pb_builddir} && for h in ${pb_headers3}; do \
+		build_name=`echo $$h | sed -e "s|${pb_srcdir}|.|g"` ;\
 		$(LN_S) $$h $${build_name} || true ;\
 	      done ;\
 	fi
-	@if [ ! -f stamp-assoc ]; then \
-	    cd ${assoc_builddir} && for h in ${assoc_headers2}; do \
-		build_name=`echo $$h | sed -e "s|${assoc_srcdir}|.|g"` ;\
+	@if [ ! -f stamp-pb ]; then \
+	    cd ${pb_builddir} && for h in ${pb_headers4}; do \
+		build_name=`echo $$h | sed -e "s|${pb_srcdir}|.|g"` ;\
 		$(LN_S) $$h $${build_name} || true ;\
 	      done ;\
 	fi
-	@if [ ! -f stamp-assoc ]; then \
-	    cd ${assoc_builddir} && for h in ${assoc_headers3}; do \
-		build_name=`echo $$h | sed -e "s|${assoc_srcdir}|.|g"` ;\
+	@if [ ! -f stamp-pb ]; then \
+	    cd ${pb_builddir} && for h in ${pb_headers5}; do \
+		build_name=`echo $$h | sed -e "s|${pb_srcdir}|.|g"` ;\
 		$(LN_S) $$h $${build_name} || true ;\
 	      done ;\
 	fi
-	@if [ ! -f stamp-assoc ]; then \
-	    cd ${assoc_builddir} && for h in ${assoc_headers4}; do \
-		build_name=`echo $$h | sed -e "s|${assoc_srcdir}|.|g"` ;\
+	@if [ ! -f stamp-pb ]; then \
+	    cd ${pb_builddir} && for h in ${pb_headers6}; do \
+		build_name=`echo $$h | sed -e "s|${pb_srcdir}|.|g"` ;\
 		$(LN_S) $$h $${build_name} || true ;\
 	      done ;\
 	fi
-	@if [ ! -f stamp-assoc ]; then \
-	    cd ${assoc_builddir} && for h in ${assoc_headers5}; do \
-		build_name=`echo $$h | sed -e "s|${assoc_srcdir}|.|g"` ;\
+	@if [ ! -f stamp-pb ]; then \
+	    cd ${pb_builddir} && for h in ${pb_headers7}; do \
+		build_name=`echo $$h | sed -e "s|${pb_srcdir}|.|g"` ;\
 		$(LN_S) $$h $${build_name} || true ;\
 	      done ;\
 	fi
-	$(STAMP) stamp-assoc
+	$(STAMP) stamp-pb
 
 stamp-tr1: ${tr1_headers}
 	@if [ ! -d "${tr1_builddir}" ]; then \
@@ -981,28 +1077,36 @@ install-headers:
 	$(mkinstalldirs) $(DESTDIR)${gxx_include_dir}/${ext_builddir}
 	for file in ${ext_headers}; do \
 	  $(INSTALL_DATA) $${file} $(DESTDIR)${gxx_include_dir}/${ext_builddir}; done
-	$(mkinstalldirs) $(DESTDIR)${gxx_include_dir}/${assoc_builddir}
-	for dir in ${assoc_subdirs}; do \
+	$(mkinstalldirs) $(DESTDIR)${gxx_include_dir}/${pb_builddir}
+	for dir in ${pb_subdirs}; do \
 	  $(mkinstalldirs) $(DESTDIR)${gxx_include_dir}/$${dir} ; done
-	for file in ${assoc_headers1}; do \
-	  install_base=$(DESTDIR)${gxx_include_dir}/${assoc_builddir} ; \
-	  relative_name=`echo $$file | sed -e "s|${assoc_srcdir}|.|g"` ;\
+	for file in ${pb_headers1}; do \
+	  install_base=$(DESTDIR)${gxx_include_dir}/${pb_builddir} ; \
+	  relative_name=`echo $$file | sed -e "s|${pb_srcdir}|.|g"` ;\
+	  $(INSTALL_DATA) $${file} $${install_base}/$${relative_name} ; done
+	for file in ${pb_headers2}; do \
+	  install_base=$(DESTDIR)${gxx_include_dir}/${pb_builddir} ; \
+	  relative_name=`echo $$file | sed -e "s|${pb_srcdir}|.|g"` ;\
+	  $(INSTALL_DATA) $${file} $${install_base}/$${relative_name} ; done
+	for file in ${pb_headers3}; do \
+	  install_base=$(DESTDIR)${gxx_include_dir}/${pb_builddir} ; \
+	  relative_name=`echo $$file | sed -e "s|${pb_srcdir}|.|g"` ;\
 	  $(INSTALL_DATA) $${file} $${install_base}/$${relative_name} ; done
-	for file in ${assoc_headers2}; do \
-	  install_base=$(DESTDIR)${gxx_include_dir}/${assoc_builddir} ; \
-	  relative_name=`echo $$file | sed -e "s|${assoc_srcdir}|.|g"` ;\
+	for file in ${pb_headers4}; do \
+	  install_base=$(DESTDIR)${gxx_include_dir}/${pb_builddir} ; \
+	  relative_name=`echo $$file | sed -e "s|${pb_srcdir}|.|g"` ;\
 	  $(INSTALL_DATA) $${file} $${install_base}/$${relative_name} ; done
-	for file in ${assoc_headers3}; do \
-	  install_base=$(DESTDIR)${gxx_include_dir}/${assoc_builddir} ; \
-	  relative_name=`echo $$file | sed -e "s|${assoc_srcdir}|.|g"` ;\
+	for file in ${pb_headers5}; do \
+	  install_base=$(DESTDIR)${gxx_include_dir}/${pb_builddir} ; \
+	  relative_name=`echo $$file | sed -e "s|${pb_srcdir}|.|g"` ;\
 	  $(INSTALL_DATA) $${file} $${install_base}/$${relative_name} ; done
-	for file in ${assoc_headers4}; do \
-	  install_base=$(DESTDIR)${gxx_include_dir}/${assoc_builddir} ; \
-	  relative_name=`echo $$file | sed -e "s|${assoc_srcdir}|.|g"` ;\
+	for file in ${pb_headers6}; do \
+	  install_base=$(DESTDIR)${gxx_include_dir}/${pb_builddir} ; \
+	  relative_name=`echo $$file | sed -e "s|${pb_srcdir}|.|g"` ;\
 	  $(INSTALL_DATA) $${file} $${install_base}/$${relative_name} ; done
-	for file in ${assoc_headers5}; do \
-	  install_base=$(DESTDIR)${gxx_include_dir}/${assoc_builddir} ; \
-	  relative_name=`echo $$file | sed -e "s|${assoc_srcdir}|.|g"` ;\
+	for file in ${pb_headers7}; do \
+	  install_base=$(DESTDIR)${gxx_include_dir}/${pb_builddir} ; \
+	  relative_name=`echo $$file | sed -e "s|${pb_srcdir}|.|g"` ;\
 	  $(INSTALL_DATA) $${file} $${install_base}/$${relative_name} ; done
 	$(mkinstalldirs) $(DESTDIR)${gxx_include_dir}/${tr1_builddir}
 	for file in ${tr1_headers}; do \
diff --git a/libstdc++-v3/include/Makefile.in b/libstdc++-v3/include/Makefile.in
index b1305309637..d389b1d1700 100644
--- a/libstdc++-v3/include/Makefile.in
+++ b/libstdc++-v3/include/Makefile.in
@@ -419,247 +419,329 @@ backward_headers = \
 	${backward_srcdir}/strstream \
 	${backward_srcdir}/backward_warning.h
 
-assoc_srcdir = ${glibcxx_srcdir}/include/ext/pb_assoc
-assoc_builddir = ./ext/pb_assoc
-assoc_subdirs = \
-	${assoc_builddir}/detail \
-	${assoc_builddir}/detail/tree_assoc_cntnr \
-	${assoc_builddir}/detail/basic_assoc_cntnr \
-	${assoc_builddir}/detail/splay_tree_ \
-	${assoc_builddir}/detail/typelist \
-	${assoc_builddir}/detail/basic_hash_assoc_cntnr \
-	${assoc_builddir}/detail/cc_ht_map_ \
-	${assoc_builddir}/detail/gp_ht_map_ \
-	${assoc_builddir}/detail/tree_policy \
-	${assoc_builddir}/detail/resize_policy \
-	${assoc_builddir}/detail/bin_search_tree_ \
-	${assoc_builddir}/detail/basic_tree_assoc_cntnr \
-	${assoc_builddir}/detail/cc_hash_assoc_cntnr \
-	${assoc_builddir}/detail/value_type_adapter \
-	${assoc_builddir}/detail/lu_policy \
-	${assoc_builddir}/detail/gp_hash_assoc_cntnr \
-	${assoc_builddir}/detail/unordered_iterator \
-	${assoc_builddir}/detail/ov_tree_map_ \
-	${assoc_builddir}/detail/lu_assoc_cntnr \
-	${assoc_builddir}/detail/hash_fn \
-	${assoc_builddir}/detail/eq_fn \
-	${assoc_builddir}/detail/rb_tree_map_ \
-	${assoc_builddir}/detail/lu_map_
+pb_srcdir = ${glibcxx_srcdir}/include/ext/pb_ds
+pb_builddir = ./ext/pb_ds
+pb_subdirs = \
+	${pb_builddir}/detail \
+	${pb_builddir}/detail/pairing_heap_ \
+	${pb_builddir}/detail/splay_tree_ \
+	${pb_builddir}/detail/list_update_map_ \
+	${pb_builddir}/detail/typelist \
+	${pb_builddir}/detail/basic_tree_policy \
+	${pb_builddir}/detail/trie_policy \
+	${pb_builddir}/detail/gp_hash_table_map_ \
+	${pb_builddir}/detail/tree_policy \
+	${pb_builddir}/detail/binomial_heap_base_ \
+	${pb_builddir}/detail/resize_policy \
+	${pb_builddir}/detail/bin_search_tree_ \
+	${pb_builddir}/detail/binomial_heap_ \
+	${pb_builddir}/detail/thin_heap_ \
+	${pb_builddir}/detail/pat_trie_ \
+	${pb_builddir}/detail/cc_hash_table_map_ \
+	${pb_builddir}/detail/rc_binomial_heap_ \
+	${pb_builddir}/detail/left_child_next_sibling_heap_ \
+	${pb_builddir}/detail/unordered_iterator \
+	${pb_builddir}/detail/binary_heap_ \
+	${pb_builddir}/detail/ov_tree_map_ \
+	${pb_builddir}/detail/hash_fn \
+	${pb_builddir}/detail/eq_fn \
+	${pb_builddir}/detail/rb_tree_map_ \
+	${pb_builddir}/detail/list_update_policy
 
 
 # The ability for make and the underlying host to deal with this
 # unweildy list as one entire entity is not a sure thing, and may
-# cause build errors. Thus, split one list into five smaller ones.
-assoc_headers1 = \
-	${assoc_srcdir}/detail/tree_assoc_cntnr/constructor_destructor_fn_imps.hpp \
-	${assoc_srcdir}/detail/type_utils.hpp \
-	${assoc_srcdir}/detail/order_statistics_imp.hpp \
-	${assoc_srcdir}/detail/basic_assoc_cntnr/d_find_fn_imps.hpp \
-	${assoc_srcdir}/detail/basic_assoc_cntnr/d_insert_fn_imps.hpp \
-	${assoc_srcdir}/detail/basic_assoc_cntnr/extract_key.hpp \
-	${assoc_srcdir}/detail/basic_assoc_cntnr/erase_fn_imps.hpp \
-	${assoc_srcdir}/detail/basic_assoc_cntnr/insert_fn_imps.hpp \
-	${assoc_srcdir}/detail/basic_assoc_cntnr/constructor_destructor_fn_imps.hpp \
-	${assoc_srcdir}/detail/basic_assoc_cntnr/info_fn_imps.hpp \
-	${assoc_srcdir}/detail/basic_assoc_cntnr/iterators_fn_imps.hpp \
-	${assoc_srcdir}/detail/basic_assoc_cntnr/d_extract_key.hpp \
-	${assoc_srcdir}/detail/basic_assoc_cntnr/constructors_destructor_fn_imps.hpp \
-	${assoc_srcdir}/detail/splay_tree_/erase_fn_imps.hpp \
-	${assoc_srcdir}/detail/splay_tree_/splay_tree_.hpp \
-	${assoc_srcdir}/detail/splay_tree_/node.hpp \
-	${assoc_srcdir}/detail/splay_tree_/insert_fn_imps.hpp \
-	${assoc_srcdir}/detail/splay_tree_/find_fn_imps.hpp \
-	${assoc_srcdir}/detail/splay_tree_/splay_fn_imps.hpp \
-	${assoc_srcdir}/detail/splay_tree_/split_join_fn_imps.hpp \
-	${assoc_srcdir}/detail/splay_tree_/info_fn_imps.hpp \
-	${assoc_srcdir}/detail/splay_tree_/debug_fn_imps.hpp \
-	${assoc_srcdir}/detail/splay_tree_/constructors_destructor_fn_imps.hpp \
-	${assoc_srcdir}/detail/typelist/typelist_transform.hpp \
-	${assoc_srcdir}/detail/typelist/typelist_apply.hpp \
-	${assoc_srcdir}/detail/typelist/typelist_filter.hpp \
-	${assoc_srcdir}/detail/typelist/typelist_at_index.hpp \
-	${assoc_srcdir}/detail/typelist/typelist_contains.hpp \
-	${assoc_srcdir}/detail/typelist/typelist_append.hpp \
-	${assoc_srcdir}/detail/typelist/typelist_typelist_append.hpp \
-	${assoc_srcdir}/detail/ds_trait_imp.hpp \
-	${assoc_srcdir}/detail/basic_hash_assoc_cntnr/resize_fn_imps.hpp \
-	${assoc_srcdir}/detail/basic_hash_assoc_cntnr/constructor_destructor_fn_imps.hpp \
-	${assoc_srcdir}/detail/basic_hash_assoc_cntnr/constructors_destructor_fn_imps.hpp 
-
-assoc_headers2 = \
-	${assoc_srcdir}/detail/cc_ht_map_/resize_store_hash_fn_imps.hpp \
-	${assoc_srcdir}/detail/cc_ht_map_/find_store_hash_fn_imps.hpp \
-	${assoc_srcdir}/detail/cc_ht_map_/erase_no_store_hash_fn_imps.hpp \
-	${assoc_srcdir}/detail/cc_ht_map_/resize_fn_imps.hpp \
-	${assoc_srcdir}/detail/cc_ht_map_/debug_store_hash_fn_imps.hpp \
-	${assoc_srcdir}/detail/cc_ht_map_/erase_fn_imps.hpp \
-	${assoc_srcdir}/detail/cc_ht_map_/policy_access_fn_imps.hpp \
-	${assoc_srcdir}/detail/cc_ht_map_/cmp_fn_imps.hpp \
-	${assoc_srcdir}/detail/cc_ht_map_/insert_no_store_hash_fn_imps.hpp \
-	${assoc_srcdir}/detail/cc_ht_map_/insert_fn_imps.hpp \
-	${assoc_srcdir}/detail/cc_ht_map_/find_fn_imps.hpp \
-	${assoc_srcdir}/detail/cc_ht_map_/find_no_store_hash_fn_imps.hpp \
-	${assoc_srcdir}/detail/cc_ht_map_/cond_key_dtor_entry_dealtor.hpp \
-	${assoc_srcdir}/detail/cc_ht_map_/constructor_destructor_fn_imps.hpp \
-	${assoc_srcdir}/detail/cc_ht_map_/entry_list_fn_imps.hpp \
-	${assoc_srcdir}/detail/cc_ht_map_/constructor_destructor_store_hash_fn_imps.hpp \
-	${assoc_srcdir}/detail/cc_ht_map_/erase_store_hash_fn_imps.hpp \
-	${assoc_srcdir}/detail/cc_ht_map_/cc_ht_map_.hpp \
-	${assoc_srcdir}/detail/cc_ht_map_/constructor_destructor_no_store_hash_fn_imps.hpp \
-	${assoc_srcdir}/detail/cc_ht_map_/standard_policies.hpp \
-	${assoc_srcdir}/detail/cc_ht_map_/info_fn_imps.hpp \
-	${assoc_srcdir}/detail/cc_ht_map_/iterators_fn_imps.hpp \
-	${assoc_srcdir}/detail/cc_ht_map_/insert_store_hash_fn_imps.hpp \
-	${assoc_srcdir}/detail/cc_ht_map_/debug_fn_imps.hpp \
-	${assoc_srcdir}/detail/cc_ht_map_/size_fn_imps.hpp \
-	${assoc_srcdir}/detail/cc_ht_map_/debug_no_store_hash_fn_imps.hpp \
-	${assoc_srcdir}/detail/cc_ht_map_/resize_no_store_hash_fn_imps.hpp \
-	${assoc_srcdir}/detail/gp_ht_map_/resize_store_hash_fn_imps.hpp \
-	${assoc_srcdir}/detail/gp_ht_map_/find_store_hash_fn_imps.hpp \
-	${assoc_srcdir}/detail/gp_ht_map_/erase_no_store_hash_fn_imps.hpp \
-	${assoc_srcdir}/detail/gp_ht_map_/resize_fn_imps.hpp \
-	${assoc_srcdir}/detail/gp_ht_map_/debug_store_hash_fn_imps.hpp \
-	${assoc_srcdir}/detail/gp_ht_map_/erase_fn_imps.hpp \
-	${assoc_srcdir}/detail/gp_ht_map_/policy_access_fn_imps.hpp \
-	${assoc_srcdir}/detail/gp_ht_map_/insert_no_store_hash_fn_imps.hpp \
-	${assoc_srcdir}/detail/gp_ht_map_/insert_fn_imps.hpp \
-	${assoc_srcdir}/detail/gp_ht_map_/find_fn_imps.hpp \
-	${assoc_srcdir}/detail/gp_ht_map_/find_no_store_hash_fn_imps.hpp \
-	${assoc_srcdir}/detail/gp_ht_map_/constructor_destructor_fn_imps.hpp \
-	${assoc_srcdir}/detail/gp_ht_map_/constructor_destructor_store_hash_fn_imps.hpp \
-	${assoc_srcdir}/detail/gp_ht_map_/erase_store_hash_fn_imps.hpp \
-	${assoc_srcdir}/detail/gp_ht_map_/constructor_destructor_no_store_hash_fn_imps.hpp \
-	${assoc_srcdir}/detail/gp_ht_map_/info_fn_imps.hpp \
-	${assoc_srcdir}/detail/gp_ht_map_/insert_store_hash_fn_imps.hpp \
-	${assoc_srcdir}/detail/gp_ht_map_/debug_fn_imps.hpp \
-	${assoc_srcdir}/detail/gp_ht_map_/gp_ht_map_.hpp \
-	${assoc_srcdir}/detail/gp_ht_map_/iterator_fn_imps.hpp \
-	${assoc_srcdir}/detail/gp_ht_map_/debug_no_store_hash_fn_imps.hpp \
-	${assoc_srcdir}/detail/gp_ht_map_/resize_no_store_hash_fn_imps.hpp 
-
-assoc_headers3 = \
-	${assoc_srcdir}/detail/tree_policy/order_statistics_imp.hpp \
-	${assoc_srcdir}/detail/tree_policy/null_node_updator_imp.hpp \
-	${assoc_srcdir}/detail/types_traits.hpp \
-	${assoc_srcdir}/detail/mapping_level_imp.hpp \
-	${assoc_srcdir}/detail/map_debug_base.hpp \
-	${assoc_srcdir}/detail/resize_policy/ht_prime_size_policy_imp.hpp \
-	${assoc_srcdir}/detail/resize_policy/hash_load_check_resize_trigger_imp.hpp \
-	${assoc_srcdir}/detail/resize_policy/hash_prime_size_policy_imp.hpp \
-	${assoc_srcdir}/detail/resize_policy/size_base.hpp \
-	${assoc_srcdir}/detail/resize_policy/cc_hash_max_collision_resize_trigger_imp.hpp \
-	${assoc_srcdir}/detail/resize_policy/hash_exponential_size_policy_imp.hpp \
-	${assoc_srcdir}/detail/resize_policy/hash_standard_resize_policy_imp.hpp \
-	${assoc_srcdir}/detail/bin_search_tree_/cond_dtor_entry_dealtor.hpp \
-	${assoc_srcdir}/detail/bin_search_tree_/find_iterators.hpp \
-	${assoc_srcdir}/detail/bin_search_tree_/erase_fn_imps.hpp \
-	${assoc_srcdir}/detail/bin_search_tree_/insert_fn_imps.hpp \
-	${assoc_srcdir}/detail/bin_search_tree_/find_fn_imps.hpp \
-	${assoc_srcdir}/detail/bin_search_tree_/cond_key_dtor_entry_dealtor.hpp \
-	${assoc_srcdir}/detail/bin_search_tree_/node_iterators.hpp \
-	${assoc_srcdir}/detail/bin_search_tree_/bin_search_tree_.hpp \
-	${assoc_srcdir}/detail/bin_search_tree_/split_join_fn_imps.hpp \
-	${assoc_srcdir}/detail/bin_search_tree_/rotate_fn_imps.hpp \
-	${assoc_srcdir}/detail/bin_search_tree_/info_fn_imps.hpp \
-	${assoc_srcdir}/detail/bin_search_tree_/iterators_fn_imps.hpp \
-	${assoc_srcdir}/detail/bin_search_tree_/r_erase_fn_imps.hpp \
-	${assoc_srcdir}/detail/bin_search_tree_/debug_fn_imps.hpp \
-	${assoc_srcdir}/detail/bin_search_tree_/constructors_destructor_fn_imps.hpp \
-	${assoc_srcdir}/detail/basic_tree_assoc_cntnr/r_range_iteration_fn_imps.hpp \
-	${assoc_srcdir}/detail/basic_tree_assoc_cntnr/erase_fn_imps.hpp \
-	${assoc_srcdir}/detail/basic_tree_assoc_cntnr/policy_access_fn_imps.hpp \
-	${assoc_srcdir}/detail/basic_tree_assoc_cntnr/constructor_destructor_fn_imps.hpp \
-	${assoc_srcdir}/detail/basic_tree_assoc_cntnr/split_join_fn_imps.hpp \
-	${assoc_srcdir}/detail/basic_tree_assoc_cntnr/r_erase_fn_imps.hpp \
-	${assoc_srcdir}/detail/basic_tree_assoc_cntnr/range_iteration_fn_imps.hpp \
-	${assoc_srcdir}/detail/basic_tree_assoc_cntnr/constructors_destructor_fn_imps.hpp \
-	${assoc_srcdir}/detail/basic_tree_assoc_cntnr/node_iteration_fn_imps.hpp \
-	${assoc_srcdir}/detail/cc_hash_assoc_cntnr/constructor_destructor_fn_imps.hpp 
-
-assoc_headers4 = \
-	${assoc_srcdir}/detail/assoc_cntnr_base.hpp \
-	${assoc_srcdir}/detail/ms_category_imp.hpp \
-	${assoc_srcdir}/detail/hash_types_traits.hpp \
-	${assoc_srcdir}/detail/typelist.hpp \
-	${assoc_srcdir}/detail/value_type_adapter/invalidation_guarantee_selector.hpp \
-	${assoc_srcdir}/detail/value_type_adapter/erase_fn_imps.hpp \
-	${assoc_srcdir}/detail/value_type_adapter/iterator.hpp \
-	${assoc_srcdir}/detail/value_type_adapter/constructor_destructor_and_related.hpp \
-	${assoc_srcdir}/detail/value_type_adapter/value_type_traits.hpp \
-	${assoc_srcdir}/detail/value_type_adapter/insert_fn_imps.hpp \
-	${assoc_srcdir}/detail/value_type_adapter/find_fn_imps.hpp \
-	${assoc_srcdir}/detail/value_type_adapter/ref_pair.hpp \
-	${assoc_srcdir}/detail/value_type_adapter/it_value_type_traits.hpp \
-	${assoc_srcdir}/detail/value_type_adapter/info_fn_imps.hpp \
-	${assoc_srcdir}/detail/value_type_adapter/erase_if_pred.hpp \
-	${assoc_srcdir}/detail/value_type_adapter/value_type_adapter.hpp \
-	${assoc_srcdir}/detail/value_type_adapter/iterator_fn_imps.hpp \
-	${assoc_srcdir}/detail/lu_policy/mtf_lu_policy_imp.hpp \
-	${assoc_srcdir}/detail/lu_policy/counter_lu_policy_imp.hpp \
-	${assoc_srcdir}/detail/lu_policy/counter_lu_metadata_imp.hpp \
-	${assoc_srcdir}/detail/gp_hash_assoc_cntnr/constructor_destructor_fn_imps.hpp \
-	${assoc_srcdir}/detail/unordered_iterator/find_iterator.hpp \
-	${assoc_srcdir}/detail/unordered_iterator/iterator.hpp \
-	${assoc_srcdir}/detail/unordered_iterator/const_iterator.hpp \
-	${assoc_srcdir}/detail/unordered_iterator/const_find_iterator.hpp \
-	${assoc_srcdir}/detail/standard_policies.hpp \
-	${assoc_srcdir}/detail/standard_sizes.hpp \
-	${assoc_srcdir}/detail/ov_tree_map_/erase_fn_imps.hpp \
-	${assoc_srcdir}/detail/ov_tree_map_/insert_fn_imps.hpp \
-	${assoc_srcdir}/detail/ov_tree_map_/find_fn_imps.hpp \
-	${assoc_srcdir}/detail/ov_tree_map_/ov_tree_map_.hpp \
-	${assoc_srcdir}/detail/ov_tree_map_/node_iterators.hpp \
-	${assoc_srcdir}/detail/ov_tree_map_/split_join_fn_imps.hpp \
-	${assoc_srcdir}/detail/ov_tree_map_/cond_dtor.hpp \
-	${assoc_srcdir}/detail/ov_tree_map_/info_fn_imps.hpp \
-	${assoc_srcdir}/detail/ov_tree_map_/iterators_fn_imps.hpp \
-	${assoc_srcdir}/detail/ov_tree_map_/debug_fn_imps.hpp \
-	${assoc_srcdir}/detail/ov_tree_map_/constructors_destructor_fn_imps.hpp
-
-assoc_headers5 = \
-	${assoc_srcdir}/detail/lu_assoc_cntnr/policy_access_fn_imps.hpp \
-	${assoc_srcdir}/detail/lu_assoc_cntnr/constructor_destructor_fn_imps.hpp \
-	${assoc_srcdir}/detail/hash_fn/linear_probe_fn_imp.hpp \
-	${assoc_srcdir}/detail/hash_fn/mod_based_range_hashing.hpp \
-	${assoc_srcdir}/detail/hash_fn/direct_mod_range_hashing_imp.hpp \
-	${assoc_srcdir}/detail/hash_fn/probe_fn_base.hpp \
-	${assoc_srcdir}/detail/hash_fn/ranged_probe_fn.hpp \
-	${assoc_srcdir}/detail/hash_fn/quadratic_probe_fn_imp.hpp \
-	${assoc_srcdir}/detail/hash_fn/direct_mask_range_hashing_imp.hpp \
-	${assoc_srcdir}/detail/hash_fn/ranged_hash_fn.hpp \
-	${assoc_srcdir}/detail/hash_fn/mask_based_range_hashing.hpp \
-	${assoc_srcdir}/detail/eq_fn/eq_by_less.hpp \
-	${assoc_srcdir}/detail/eq_fn/hash_eq_fn.hpp \
-	${assoc_srcdir}/detail/rb_tree_map_/erase_fn_imps.hpp \
-	${assoc_srcdir}/detail/rb_tree_map_/node.hpp \
-	${assoc_srcdir}/detail/rb_tree_map_/insert_fn_imps.hpp \
-	${assoc_srcdir}/detail/rb_tree_map_/find_fn_imps.hpp \
-	${assoc_srcdir}/detail/rb_tree_map_/split_join_fn_imps.hpp \
-	${assoc_srcdir}/detail/rb_tree_map_/rb_tree_.hpp \
-	${assoc_srcdir}/detail/rb_tree_map_/info_fn_imps.hpp \
-	${assoc_srcdir}/detail/rb_tree_map_/debug_fn_imps.hpp \
-	${assoc_srcdir}/detail/rb_tree_map_/constructors_destructor_fn_imps.hpp \
-	${assoc_srcdir}/detail/lu_map_/lu_map_.hpp \
-	${assoc_srcdir}/detail/lu_map_/erase_fn_imps.hpp \
-	${assoc_srcdir}/detail/lu_map_/policy_access_fn_imps.hpp \
-	${assoc_srcdir}/detail/lu_map_/insert_fn_imps.hpp \
-	${assoc_srcdir}/detail/lu_map_/find_fn_imps.hpp \
-	${assoc_srcdir}/detail/lu_map_/constructor_destructor_fn_imps.hpp \
-	${assoc_srcdir}/detail/lu_map_/info_fn_imps.hpp \
-	${assoc_srcdir}/detail/lu_map_/iterators_fn_imps.hpp \
-	${assoc_srcdir}/detail/lu_map_/debug_fn_imps.hpp \
-	${assoc_srcdir}/detail/constructors_destructor_fn_imps.hpp \
-	${assoc_srcdir}/detail/ms_trait_imp.hpp \
-	${assoc_srcdir}/detail/cond_dealtor.hpp \
-	${assoc_srcdir}/hash_policy.hpp \
-	${assoc_srcdir}/trivial_iterator_def.hpp \
-	${assoc_srcdir}/ds_trait.hpp \
-	${assoc_srcdir}/exception.hpp \
-	${assoc_srcdir}/tree_policy.hpp \
-	${assoc_srcdir}/lu_policy.hpp \
-	${assoc_srcdir}/ms_trait.hpp \
-	${assoc_srcdir}/assoc_cntnr.hpp \
-	${assoc_srcdir}/data_type.hpp 
+# cause build errors. Thus, split one list into many smaller
+# mini-lists, with the maximum size per mini-list of no more than 42.
+pb_headers1 = \
+	${pb_srcdir}/assoc_container.hpp \
+	${pb_srcdir}/exception.hpp \
+	${pb_srcdir}/hash_policy.hpp \
+	${pb_srcdir}/list_update_policy.hpp \
+	${pb_srcdir}/priority_queue.hpp \
+	${pb_srcdir}/tag_and_trait.hpp \
+	${pb_srcdir}/tree_policy.hpp \
+	${pb_srcdir}/trie_policy.hpp \
+	${pb_srcdir}/detail/basic_tree_policy/basic_tree_policy_base.hpp \
+	${pb_srcdir}/detail/basic_tree_policy/null_node_metadata.hpp \
+	${pb_srcdir}/detail/basic_tree_policy/traits.hpp \
+	${pb_srcdir}/detail/basic_types.hpp \
+	${pb_srcdir}/detail/binary_heap_/binary_heap_.hpp \
+	${pb_srcdir}/detail/binary_heap_/const_iterator.hpp \
+	${pb_srcdir}/detail/binary_heap_/const_point_iterator.hpp \
+	${pb_srcdir}/detail/binary_heap_/constructors_destructor_fn_imps.hpp \
+	${pb_srcdir}/detail/binary_heap_/debug_fn_imps.hpp \
+	${pb_srcdir}/detail/binary_heap_/entry_cmp.hpp \
+	${pb_srcdir}/detail/binary_heap_/entry_pred.hpp \
+	${pb_srcdir}/detail/binary_heap_/erase_fn_imps.hpp \
+	${pb_srcdir}/detail/binary_heap_/find_fn_imps.hpp \
+	${pb_srcdir}/detail/binary_heap_/info_fn_imps.hpp \
+	${pb_srcdir}/detail/binary_heap_/insert_fn_imps.hpp \
+	${pb_srcdir}/detail/binary_heap_/iterators_fn_imps.hpp \
+	${pb_srcdir}/detail/binary_heap_/policy_access_fn_imps.hpp \
+	${pb_srcdir}/detail/binary_heap_/resize_policy.hpp \
+	${pb_srcdir}/detail/binary_heap_/split_join_fn_imps.hpp \
+	${pb_srcdir}/detail/binary_heap_/trace_fn_imps.hpp \
+	${pb_srcdir}/detail/binomial_heap_base_/binomial_heap_base_.hpp \
+	${pb_srcdir}/detail/binomial_heap_base_/constructors_destructor_fn_imps.hpp \
+	${pb_srcdir}/detail/binomial_heap_base_/debug_fn_imps.hpp \
+	${pb_srcdir}/detail/binomial_heap_base_/erase_fn_imps.hpp \
+	${pb_srcdir}/detail/binomial_heap_base_/find_fn_imps.hpp \
+	${pb_srcdir}/detail/binomial_heap_base_/insert_fn_imps.hpp \
+	${pb_srcdir}/detail/binomial_heap_base_/split_join_fn_imps.hpp \
+	${pb_srcdir}/detail/binomial_heap_/binomial_heap_.hpp \
+	${pb_srcdir}/detail/binomial_heap_/constructors_destructor_fn_imps.hpp \
+	${pb_srcdir}/detail/binomial_heap_/debug_fn_imps.hpp \
+	${pb_srcdir}/detail/bin_search_tree_/bin_search_tree_.hpp \
+	${pb_srcdir}/detail/bin_search_tree_/cond_dtor_entry_dealtor.hpp \
+	${pb_srcdir}/detail/bin_search_tree_/cond_key_dtor_entry_dealtor.hpp 
+
+pb_headers2 = \
+	${pb_srcdir}/detail/bin_search_tree_/constructors_destructor_fn_imps.hpp \
+	${pb_srcdir}/detail/bin_search_tree_/debug_fn_imps.hpp \
+	${pb_srcdir}/detail/bin_search_tree_/erase_fn_imps.hpp \
+	${pb_srcdir}/detail/bin_search_tree_/find_fn_imps.hpp \
+	${pb_srcdir}/detail/bin_search_tree_/info_fn_imps.hpp \
+	${pb_srcdir}/detail/bin_search_tree_/insert_fn_imps.hpp \
+	${pb_srcdir}/detail/bin_search_tree_/iterators_fn_imps.hpp \
+	${pb_srcdir}/detail/bin_search_tree_/node_iterators.hpp \
+	${pb_srcdir}/detail/bin_search_tree_/point_iterators.hpp \
+	${pb_srcdir}/detail/bin_search_tree_/policy_access_fn_imps.hpp \
+	${pb_srcdir}/detail/bin_search_tree_/r_erase_fn_imps.hpp \
+	${pb_srcdir}/detail/bin_search_tree_/rotate_fn_imps.hpp \
+	${pb_srcdir}/detail/bin_search_tree_/split_join_fn_imps.hpp \
+	${pb_srcdir}/detail/bin_search_tree_/traits.hpp \
+	${pb_srcdir}/detail/cc_hash_table_map_/cc_ht_map_.hpp \
+	${pb_srcdir}/detail/cc_hash_table_map_/cmp_fn_imps.hpp \
+	${pb_srcdir}/detail/cc_hash_table_map_/cond_key_dtor_entry_dealtor.hpp \
+	${pb_srcdir}/detail/cc_hash_table_map_/constructor_destructor_fn_imps.hpp \
+	${pb_srcdir}/detail/cc_hash_table_map_/constructor_destructor_no_store_hash_fn_imps.hpp \
+	${pb_srcdir}/detail/cc_hash_table_map_/constructor_destructor_store_hash_fn_imps.hpp \
+	${pb_srcdir}/detail/cc_hash_table_map_/debug_fn_imps.hpp \
+	${pb_srcdir}/detail/cc_hash_table_map_/debug_no_store_hash_fn_imps.hpp \
+	${pb_srcdir}/detail/cc_hash_table_map_/debug_store_hash_fn_imps.hpp \
+	${pb_srcdir}/detail/cc_hash_table_map_/entry_list_fn_imps.hpp \
+	${pb_srcdir}/detail/cc_hash_table_map_/erase_fn_imps.hpp \
+	${pb_srcdir}/detail/cc_hash_table_map_/erase_no_store_hash_fn_imps.hpp \
+	${pb_srcdir}/detail/cc_hash_table_map_/erase_store_hash_fn_imps.hpp \
+	${pb_srcdir}/detail/cc_hash_table_map_/find_fn_imps.hpp \
+	${pb_srcdir}/detail/cc_hash_table_map_/find_store_hash_fn_imps.hpp \
+	${pb_srcdir}/detail/cc_hash_table_map_/info_fn_imps.hpp \
+	${pb_srcdir}/detail/cc_hash_table_map_/insert_fn_imps.hpp \
+	${pb_srcdir}/detail/cc_hash_table_map_/insert_no_store_hash_fn_imps.hpp \
+	${pb_srcdir}/detail/cc_hash_table_map_/insert_store_hash_fn_imps.hpp \
+	${pb_srcdir}/detail/cc_hash_table_map_/iterators_fn_imps.hpp \
+	${pb_srcdir}/detail/cc_hash_table_map_/policy_access_fn_imps.hpp \
+	${pb_srcdir}/detail/cc_hash_table_map_/resize_fn_imps.hpp \
+	${pb_srcdir}/detail/cc_hash_table_map_/resize_no_store_hash_fn_imps.hpp \
+	${pb_srcdir}/detail/cc_hash_table_map_/resize_store_hash_fn_imps.hpp \
+	${pb_srcdir}/detail/cc_hash_table_map_/size_fn_imps.hpp \
+	${pb_srcdir}/detail/cc_hash_table_map_/standard_policies.hpp 
+
+pb_headers3 = \
+	${pb_srcdir}/detail/cc_hash_table_map_/trace_fn_imps.hpp \
+	${pb_srcdir}/detail/cond_dealtor.hpp \
+	${pb_srcdir}/detail/constructors_destructor_fn_imps.hpp \
+	${pb_srcdir}/detail/container_base_dispatch.hpp \
+	${pb_srcdir}/detail/eq_fn/eq_by_less.hpp \
+	${pb_srcdir}/detail/eq_fn/hash_eq_fn.hpp \
+	${pb_srcdir}/detail/gp_hash_table_map_/constructor_destructor_fn_imps.hpp \
+	${pb_srcdir}/detail/gp_hash_table_map_/constructor_destructor_no_store_hash_fn_imps.hpp \
+	${pb_srcdir}/detail/gp_hash_table_map_/constructor_destructor_store_hash_fn_imps.hpp \
+	${pb_srcdir}/detail/gp_hash_table_map_/debug_fn_imps.hpp \
+	${pb_srcdir}/detail/gp_hash_table_map_/debug_no_store_hash_fn_imps.hpp \
+	${pb_srcdir}/detail/gp_hash_table_map_/debug_store_hash_fn_imps.hpp \
+	${pb_srcdir}/detail/gp_hash_table_map_/erase_fn_imps.hpp \
+	${pb_srcdir}/detail/gp_hash_table_map_/erase_no_store_hash_fn_imps.hpp \
+	${pb_srcdir}/detail/gp_hash_table_map_/erase_store_hash_fn_imps.hpp \
+	${pb_srcdir}/detail/gp_hash_table_map_/find_fn_imps.hpp \
+	${pb_srcdir}/detail/gp_hash_table_map_/find_no_store_hash_fn_imps.hpp \
+	${pb_srcdir}/detail/gp_hash_table_map_/find_store_hash_fn_imps.hpp \
+	${pb_srcdir}/detail/gp_hash_table_map_/gp_ht_map_.hpp \
+	${pb_srcdir}/detail/gp_hash_table_map_/info_fn_imps.hpp \
+	${pb_srcdir}/detail/gp_hash_table_map_/insert_fn_imps.hpp \
+	${pb_srcdir}/detail/gp_hash_table_map_/insert_no_store_hash_fn_imps.hpp \
+	${pb_srcdir}/detail/gp_hash_table_map_/insert_store_hash_fn_imps.hpp \
+	${pb_srcdir}/detail/gp_hash_table_map_/iterator_fn_imps.hpp \
+	${pb_srcdir}/detail/gp_hash_table_map_/policy_access_fn_imps.hpp \
+	${pb_srcdir}/detail/gp_hash_table_map_/resize_fn_imps.hpp \
+	${pb_srcdir}/detail/gp_hash_table_map_/resize_no_store_hash_fn_imps.hpp \
+	${pb_srcdir}/detail/gp_hash_table_map_/resize_store_hash_fn_imps.hpp \
+	${pb_srcdir}/detail/gp_hash_table_map_/standard_policies.hpp \
+	${pb_srcdir}/detail/gp_hash_table_map_/trace_fn_imps.hpp \
+	${pb_srcdir}/detail/hash_fn/direct_mask_range_hashing_imp.hpp \
+	${pb_srcdir}/detail/hash_fn/direct_mod_range_hashing_imp.hpp \
+	${pb_srcdir}/detail/hash_fn/linear_probe_fn_imp.hpp \
+	${pb_srcdir}/detail/hash_fn/mask_based_range_hashing.hpp \
+	${pb_srcdir}/detail/hash_fn/mod_based_range_hashing.hpp \
+	${pb_srcdir}/detail/hash_fn/probe_fn_base.hpp \
+	${pb_srcdir}/detail/hash_fn/quadratic_probe_fn_imp.hpp \
+	${pb_srcdir}/detail/hash_fn/ranged_hash_fn.hpp \
+	${pb_srcdir}/detail/hash_fn/ranged_probe_fn.hpp 
+
+pb_headers4 = \
+	${pb_srcdir}/detail/hash_fn/sample_probe_fn.hpp \
+	${pb_srcdir}/detail/hash_fn/sample_ranged_hash_fn.hpp \
+	${pb_srcdir}/detail/hash_fn/sample_ranged_probe_fn.hpp \
+	${pb_srcdir}/detail/hash_fn/sample_range_hashing.hpp \
+	${pb_srcdir}/detail/left_child_next_sibling_heap_/const_iterator.hpp \
+	${pb_srcdir}/detail/left_child_next_sibling_heap_/const_point_iterator.hpp \
+	${pb_srcdir}/detail/left_child_next_sibling_heap_/constructors_destructor_fn_imps.hpp \
+	${pb_srcdir}/detail/left_child_next_sibling_heap_/debug_fn_imps.hpp \
+	${pb_srcdir}/detail/left_child_next_sibling_heap_/erase_fn_imps.hpp \
+	${pb_srcdir}/detail/left_child_next_sibling_heap_/info_fn_imps.hpp \
+	${pb_srcdir}/detail/left_child_next_sibling_heap_/insert_fn_imps.hpp \
+	${pb_srcdir}/detail/left_child_next_sibling_heap_/iterators_fn_imps.hpp \
+	${pb_srcdir}/detail/left_child_next_sibling_heap_/left_child_next_sibling_heap_.hpp \
+	${pb_srcdir}/detail/left_child_next_sibling_heap_/node.hpp \
+	${pb_srcdir}/detail/left_child_next_sibling_heap_/null_metadata.hpp \
+	${pb_srcdir}/detail/left_child_next_sibling_heap_/policy_access_fn_imps.hpp \
+	${pb_srcdir}/detail/left_child_next_sibling_heap_/trace_fn_imps.hpp \
+	${pb_srcdir}/detail/list_update_map_/constructor_destructor_fn_imps.hpp \
+	${pb_srcdir}/detail/list_update_map_/debug_fn_imps.hpp \
+	${pb_srcdir}/detail/list_update_map_/entry_metadata_base.hpp \
+	${pb_srcdir}/detail/list_update_map_/erase_fn_imps.hpp \
+	${pb_srcdir}/detail/list_update_map_/find_fn_imps.hpp \
+	${pb_srcdir}/detail/list_update_map_/info_fn_imps.hpp \
+	${pb_srcdir}/detail/list_update_map_/insert_fn_imps.hpp \
+	${pb_srcdir}/detail/list_update_map_/iterators_fn_imps.hpp \
+	${pb_srcdir}/detail/list_update_map_/lu_map_.hpp \
+	${pb_srcdir}/detail/list_update_map_/trace_fn_imps.hpp \
+	${pb_srcdir}/detail/list_update_policy/counter_lu_metadata.hpp \
+	${pb_srcdir}/detail/list_update_policy/counter_lu_policy_imp.hpp \
+	${pb_srcdir}/detail/list_update_policy/mtf_lu_policy_imp.hpp \
+	${pb_srcdir}/detail/list_update_policy/sample_update_policy.hpp \
+	${pb_srcdir}/detail/map_debug_base.hpp \
+	${pb_srcdir}/detail/ov_tree_map_/cond_dtor.hpp \
+	${pb_srcdir}/detail/ov_tree_map_/constructors_destructor_fn_imps.hpp \
+	${pb_srcdir}/detail/ov_tree_map_/debug_fn_imps.hpp \
+	${pb_srcdir}/detail/ov_tree_map_/erase_fn_imps.hpp \
+	${pb_srcdir}/detail/ov_tree_map_/info_fn_imps.hpp \
+	${pb_srcdir}/detail/ov_tree_map_/insert_fn_imps.hpp \
+	${pb_srcdir}/detail/ov_tree_map_/iterators_fn_imps.hpp \
+	${pb_srcdir}/detail/ov_tree_map_/node_iterators.hpp \
+	${pb_srcdir}/detail/ov_tree_map_/ov_tree_map_.hpp 
+
+pb_headers5 = \
+	${pb_srcdir}/detail/ov_tree_map_/policy_access_fn_imps.hpp \
+	${pb_srcdir}/detail/ov_tree_map_/split_join_fn_imps.hpp \
+	${pb_srcdir}/detail/ov_tree_map_/traits.hpp \
+	${pb_srcdir}/detail/pairing_heap_/constructors_destructor_fn_imps.hpp \
+	${pb_srcdir}/detail/pairing_heap_/debug_fn_imps.hpp \
+	${pb_srcdir}/detail/pairing_heap_/erase_fn_imps.hpp \
+	${pb_srcdir}/detail/pairing_heap_/find_fn_imps.hpp \
+	${pb_srcdir}/detail/pairing_heap_/insert_fn_imps.hpp \
+	${pb_srcdir}/detail/pairing_heap_/pairing_heap_.hpp \
+	${pb_srcdir}/detail/pairing_heap_/split_join_fn_imps.hpp \
+	${pb_srcdir}/detail/pat_trie_/child_iterator.hpp \
+	${pb_srcdir}/detail/pat_trie_/cond_dtor_entry_dealtor.hpp \
+	${pb_srcdir}/detail/pat_trie_/const_child_iterator.hpp \
+	${pb_srcdir}/detail/pat_trie_/constructors_destructor_fn_imps.hpp \
+	${pb_srcdir}/detail/pat_trie_/debug_fn_imps.hpp \
+	${pb_srcdir}/detail/pat_trie_/erase_fn_imps.hpp \
+	${pb_srcdir}/detail/pat_trie_/find_fn_imps.hpp \
+	${pb_srcdir}/detail/pat_trie_/head.hpp \
+	${pb_srcdir}/detail/pat_trie_/info_fn_imps.hpp \
+	${pb_srcdir}/detail/pat_trie_/insert_join_fn_imps.hpp \
+	${pb_srcdir}/detail/pat_trie_/internal_node.hpp \
+	${pb_srcdir}/detail/pat_trie_/iterators_fn_imps.hpp \
+	${pb_srcdir}/detail/pat_trie_/leaf.hpp \
+	${pb_srcdir}/detail/pat_trie_/node_base.hpp \
+	${pb_srcdir}/detail/pat_trie_/node_iterators.hpp \
+	${pb_srcdir}/detail/pat_trie_/node_metadata_base.hpp \
+	${pb_srcdir}/detail/pat_trie_/pat_trie_.hpp \
+	${pb_srcdir}/detail/pat_trie_/point_iterators.hpp \
+	${pb_srcdir}/detail/pat_trie_/policy_access_fn_imps.hpp \
+	${pb_srcdir}/detail/pat_trie_/r_erase_fn_imps.hpp \
+	${pb_srcdir}/detail/pat_trie_/rotate_fn_imps.hpp \
+	${pb_srcdir}/detail/pat_trie_/split_fn_imps.hpp \
+	${pb_srcdir}/detail/pat_trie_/split_join_branch_bag.hpp \
+	${pb_srcdir}/detail/pat_trie_/synth_e_access_traits.hpp \
+	${pb_srcdir}/detail/pat_trie_/trace_fn_imps.hpp \
+	${pb_srcdir}/detail/pat_trie_/traits.hpp \
+	${pb_srcdir}/detail/pat_trie_/update_fn_imps.hpp \
+	${pb_srcdir}/detail/priority_queue_base_dispatch.hpp \
+	${pb_srcdir}/detail/rb_tree_map_/constructors_destructor_fn_imps.hpp \
+	${pb_srcdir}/detail/rb_tree_map_/debug_fn_imps.hpp 
+
+pb_headers6 = \
+	${pb_srcdir}/detail/rb_tree_map_/erase_fn_imps.hpp \
+	${pb_srcdir}/detail/rb_tree_map_/find_fn_imps.hpp \
+	${pb_srcdir}/detail/rb_tree_map_/info_fn_imps.hpp \
+	${pb_srcdir}/detail/rb_tree_map_/insert_fn_imps.hpp \
+	${pb_srcdir}/detail/rb_tree_map_/node.hpp \
+	${pb_srcdir}/detail/rb_tree_map_/rb_tree_.hpp \
+	${pb_srcdir}/detail/rb_tree_map_/split_join_fn_imps.hpp \
+	${pb_srcdir}/detail/rb_tree_map_/traits.hpp \
+	${pb_srcdir}/detail/rc_binomial_heap_/constructors_destructor_fn_imps.hpp \
+	${pb_srcdir}/detail/rc_binomial_heap_/debug_fn_imps.hpp \
+	${pb_srcdir}/detail/rc_binomial_heap_/erase_fn_imps.hpp \
+	${pb_srcdir}/detail/rc_binomial_heap_/insert_fn_imps.hpp \
+	${pb_srcdir}/detail/rc_binomial_heap_/rc_binomial_heap_.hpp \
+	${pb_srcdir}/detail/rc_binomial_heap_/rc.hpp \
+	${pb_srcdir}/detail/rc_binomial_heap_/split_join_fn_imps.hpp \
+	${pb_srcdir}/detail/rc_binomial_heap_/trace_fn_imps.hpp \
+	${pb_srcdir}/detail/resize_policy/cc_hash_max_collision_check_resize_trigger_imp.hpp \
+	${pb_srcdir}/detail/resize_policy/hash_exponential_size_policy_imp.hpp \
+	${pb_srcdir}/detail/resize_policy/hash_load_check_resize_trigger_imp.hpp \
+	${pb_srcdir}/detail/resize_policy/hash_load_check_resize_trigger_size_base.hpp \
+	${pb_srcdir}/detail/resize_policy/hash_prime_size_policy_imp.hpp \
+	${pb_srcdir}/detail/resize_policy/hash_standard_resize_policy_imp.hpp \
+	${pb_srcdir}/detail/resize_policy/sample_resize_policy.hpp \
+	${pb_srcdir}/detail/resize_policy/sample_resize_trigger.hpp \
+	${pb_srcdir}/detail/resize_policy/sample_size_policy.hpp \
+	${pb_srcdir}/detail/splay_tree_/constructors_destructor_fn_imps.hpp \
+	${pb_srcdir}/detail/splay_tree_/debug_fn_imps.hpp \
+	${pb_srcdir}/detail/splay_tree_/erase_fn_imps.hpp \
+	${pb_srcdir}/detail/splay_tree_/find_fn_imps.hpp \
+	${pb_srcdir}/detail/splay_tree_/info_fn_imps.hpp \
+	${pb_srcdir}/detail/splay_tree_/insert_fn_imps.hpp \
+	${pb_srcdir}/detail/splay_tree_/node.hpp \
+	${pb_srcdir}/detail/splay_tree_/splay_fn_imps.hpp \
+	${pb_srcdir}/detail/splay_tree_/splay_tree_.hpp \
+	${pb_srcdir}/detail/splay_tree_/split_join_fn_imps.hpp \
+	${pb_srcdir}/detail/splay_tree_/traits.hpp \
+	${pb_srcdir}/detail/standard_policies.hpp \
+	${pb_srcdir}/detail/thin_heap_/constructors_destructor_fn_imps.hpp \
+	${pb_srcdir}/detail/thin_heap_/debug_fn_imps.hpp \
+	${pb_srcdir}/detail/thin_heap_/erase_fn_imps.hpp 
+
+pb_headers7 = \
+	${pb_srcdir}/detail/thin_heap_/find_fn_imps.hpp \
+	${pb_srcdir}/detail/thin_heap_/insert_fn_imps.hpp \
+	${pb_srcdir}/detail/thin_heap_/split_join_fn_imps.hpp \
+	${pb_srcdir}/detail/thin_heap_/thin_heap_.hpp \
+	${pb_srcdir}/detail/thin_heap_/trace_fn_imps.hpp \
+	${pb_srcdir}/detail/tree_policy/node_metadata_selector.hpp \
+	${pb_srcdir}/detail/tree_policy/null_node_update_imp.hpp \
+	${pb_srcdir}/detail/tree_policy/order_statistics_imp.hpp \
+	${pb_srcdir}/detail/tree_policy/sample_tree_node_update.hpp \
+	${pb_srcdir}/detail/tree_trace_base.hpp \
+	${pb_srcdir}/detail/trie_policy/node_metadata_selector.hpp \
+	${pb_srcdir}/detail/trie_policy/null_node_update_imp.hpp \
+	${pb_srcdir}/detail/trie_policy/order_statistics_imp.hpp \
+	${pb_srcdir}/detail/trie_policy/prefix_search_node_update_imp.hpp \
+	${pb_srcdir}/detail/trie_policy/sample_trie_e_access_traits.hpp \
+	${pb_srcdir}/detail/trie_policy/sample_trie_node_update.hpp \
+	${pb_srcdir}/detail/trie_policy/string_trie_e_access_traits_imp.hpp \
+	${pb_srcdir}/detail/trie_policy/trie_policy_base.hpp \
+	${pb_srcdir}/detail/typelist_assoc_container.hpp \
+	${pb_srcdir}/detail/typelist.hpp \
+	${pb_srcdir}/detail/typelist/typelist_append.hpp \
+	${pb_srcdir}/detail/typelist/typelist_apply.hpp \
+	${pb_srcdir}/detail/typelist/typelist_assoc_container_find.hpp \
+	${pb_srcdir}/detail/typelist/typelist_at_index.hpp \
+	${pb_srcdir}/detail/typelist/typelist_contains.hpp \
+	${pb_srcdir}/detail/typelist/typelist_filter.hpp \
+	${pb_srcdir}/detail/typelist/typelist_flatten.hpp \
+	${pb_srcdir}/detail/typelist/typelist_transform.hpp \
+	${pb_srcdir}/detail/typelist/typelist_typelist_append.hpp \
+	${pb_srcdir}/detail/types_traits.hpp \
+	${pb_srcdir}/detail/type_utils.hpp \
+	${pb_srcdir}/detail/unordered_iterator/const_iterator.hpp \
+	${pb_srcdir}/detail/unordered_iterator/const_point_iterator.hpp \
+	${pb_srcdir}/detail/unordered_iterator/iterator.hpp \
+	${pb_srcdir}/detail/unordered_iterator/point_iterator.hpp 
 
 ext_srcdir = ${glibcxx_srcdir}/include/ext
 ext_builddir = ./ext 
@@ -910,7 +992,7 @@ PCHFLAGS = -Winvalid-pch -Wno-deprecated -x c++-header $(CXXFLAGS)
 # CLEANFILES and all-local are kept up-to-date.
 allstamped = \
 	stamp-std stamp-bits stamp-c_base stamp-c_compatibility \
-	stamp-backward stamp-ext stamp-assoc stamp-tr1 stamp-debug stamp-host
+	stamp-backward stamp-ext stamp-pb stamp-tr1 stamp-debug stamp-host
 
 
 # List of all files that are created by explicit building, editing, or
@@ -1160,42 +1242,54 @@ stamp-ext: ${ext_headers}
 
 # Have to deal with nested include directories, gah! Strip off source
 # directory before making the link.
-# XXX check  ${assoc_headers}
-stamp-assoc:
-	@if [ ! -d "${assoc_builddir}" ]; then \
-	    mkdir -p ${assoc_subdirs} ;\
+# XXX check  ${pb_headers}
+stamp-pb:
+	@if [ ! -d "${pb_builddir}" ]; then \
+	    mkdir -p ${pb_subdirs} ;\
 	fi 
-	@if [ ! -f stamp-assoc ]; then \
-	    cd ${assoc_builddir} && for h in ${assoc_headers1}; do \
-		build_name=`echo $$h | sed -e "s|${assoc_srcdir}|.|g"` ;\
+	@if [ ! -f stamp-pb ]; then \
+	    cd ${pb_builddir} && for h in ${pb_headers1}; do \
+		build_name=`echo $$h | sed -e "s|${pb_srcdir}|.|g"` ;\
 		$(LN_S) $$h $${build_name} || true ;\
 	      done ;\
 	fi
-	@if [ ! -f stamp-assoc ]; then \
-	    cd ${assoc_builddir} && for h in ${assoc_headers2}; do \
-		build_name=`echo $$h | sed -e "s|${assoc_srcdir}|.|g"` ;\
+	@if [ ! -f stamp-pb ]; then \
+	    cd ${pb_builddir} && for h in ${pb_headers2}; do \
+		build_name=`echo $$h | sed -e "s|${pb_srcdir}|.|g"` ;\
 		$(LN_S) $$h $${build_name} || true ;\
 	      done ;\
 	fi
-	@if [ ! -f stamp-assoc ]; then \
-	    cd ${assoc_builddir} && for h in ${assoc_headers3}; do \
-		build_name=`echo $$h | sed -e "s|${assoc_srcdir}|.|g"` ;\
+	@if [ ! -f stamp-pb ]; then \
+	    cd ${pb_builddir} && for h in ${pb_headers3}; do \
+		build_name=`echo $$h | sed -e "s|${pb_srcdir}|.|g"` ;\
 		$(LN_S) $$h $${build_name} || true ;\
 	      done ;\
 	fi
-	@if [ ! -f stamp-assoc ]; then \
-	    cd ${assoc_builddir} && for h in ${assoc_headers4}; do \
-		build_name=`echo $$h | sed -e "s|${assoc_srcdir}|.|g"` ;\
+	@if [ ! -f stamp-pb ]; then \
+	    cd ${pb_builddir} && for h in ${pb_headers4}; do \
+		build_name=`echo $$h | sed -e "s|${pb_srcdir}|.|g"` ;\
 		$(LN_S) $$h $${build_name} || true ;\
 	      done ;\
 	fi
-	@if [ ! -f stamp-assoc ]; then \
-	    cd ${assoc_builddir} && for h in ${assoc_headers5}; do \
-		build_name=`echo $$h | sed -e "s|${assoc_srcdir}|.|g"` ;\
+	@if [ ! -f stamp-pb ]; then \
+	    cd ${pb_builddir} && for h in ${pb_headers5}; do \
+		build_name=`echo $$h | sed -e "s|${pb_srcdir}|.|g"` ;\
 		$(LN_S) $$h $${build_name} || true ;\
 	      done ;\
 	fi
-	$(STAMP) stamp-assoc
+	@if [ ! -f stamp-pb ]; then \
+	    cd ${pb_builddir} && for h in ${pb_headers6}; do \
+		build_name=`echo $$h | sed -e "s|${pb_srcdir}|.|g"` ;\
+		$(LN_S) $$h $${build_name} || true ;\
+	      done ;\
+	fi
+	@if [ ! -f stamp-pb ]; then \
+	    cd ${pb_builddir} && for h in ${pb_headers7}; do \
+		build_name=`echo $$h | sed -e "s|${pb_srcdir}|.|g"` ;\
+		$(LN_S) $$h $${build_name} || true ;\
+	      done ;\
+	fi
+	$(STAMP) stamp-pb
 
 stamp-tr1: ${tr1_headers}
 	@if [ ! -d "${tr1_builddir}" ]; then \
@@ -1355,28 +1449,36 @@ install-headers:
 	$(mkinstalldirs) $(DESTDIR)${gxx_include_dir}/${ext_builddir}
 	for file in ${ext_headers}; do \
 	  $(INSTALL_DATA) $${file} $(DESTDIR)${gxx_include_dir}/${ext_builddir}; done
-	$(mkinstalldirs) $(DESTDIR)${gxx_include_dir}/${assoc_builddir}
-	for dir in ${assoc_subdirs}; do \
+	$(mkinstalldirs) $(DESTDIR)${gxx_include_dir}/${pb_builddir}
+	for dir in ${pb_subdirs}; do \
 	  $(mkinstalldirs) $(DESTDIR)${gxx_include_dir}/$${dir} ; done
-	for file in ${assoc_headers1}; do \
-	  install_base=$(DESTDIR)${gxx_include_dir}/${assoc_builddir} ; \
-	  relative_name=`echo $$file | sed -e "s|${assoc_srcdir}|.|g"` ;\
+	for file in ${pb_headers1}; do \
+	  install_base=$(DESTDIR)${gxx_include_dir}/${pb_builddir} ; \
+	  relative_name=`echo $$file | sed -e "s|${pb_srcdir}|.|g"` ;\
+	  $(INSTALL_DATA) $${file} $${install_base}/$${relative_name} ; done
+	for file in ${pb_headers2}; do \
+	  install_base=$(DESTDIR)${gxx_include_dir}/${pb_builddir} ; \
+	  relative_name=`echo $$file | sed -e "s|${pb_srcdir}|.|g"` ;\
+	  $(INSTALL_DATA) $${file} $${install_base}/$${relative_name} ; done
+	for file in ${pb_headers3}; do \
+	  install_base=$(DESTDIR)${gxx_include_dir}/${pb_builddir} ; \
+	  relative_name=`echo $$file | sed -e "s|${pb_srcdir}|.|g"` ;\
 	  $(INSTALL_DATA) $${file} $${install_base}/$${relative_name} ; done
-	for file in ${assoc_headers2}; do \
-	  install_base=$(DESTDIR)${gxx_include_dir}/${assoc_builddir} ; \
-	  relative_name=`echo $$file | sed -e "s|${assoc_srcdir}|.|g"` ;\
+	for file in ${pb_headers4}; do \
+	  install_base=$(DESTDIR)${gxx_include_dir}/${pb_builddir} ; \
+	  relative_name=`echo $$file | sed -e "s|${pb_srcdir}|.|g"` ;\
 	  $(INSTALL_DATA) $${file} $${install_base}/$${relative_name} ; done
-	for file in ${assoc_headers3}; do \
-	  install_base=$(DESTDIR)${gxx_include_dir}/${assoc_builddir} ; \
-	  relative_name=`echo $$file | sed -e "s|${assoc_srcdir}|.|g"` ;\
+	for file in ${pb_headers5}; do \
+	  install_base=$(DESTDIR)${gxx_include_dir}/${pb_builddir} ; \
+	  relative_name=`echo $$file | sed -e "s|${pb_srcdir}|.|g"` ;\
 	  $(INSTALL_DATA) $${file} $${install_base}/$${relative_name} ; done
-	for file in ${assoc_headers4}; do \
-	  install_base=$(DESTDIR)${gxx_include_dir}/${assoc_builddir} ; \
-	  relative_name=`echo $$file | sed -e "s|${assoc_srcdir}|.|g"` ;\
+	for file in ${pb_headers6}; do \
+	  install_base=$(DESTDIR)${gxx_include_dir}/${pb_builddir} ; \
+	  relative_name=`echo $$file | sed -e "s|${pb_srcdir}|.|g"` ;\
 	  $(INSTALL_DATA) $${file} $${install_base}/$${relative_name} ; done
-	for file in ${assoc_headers5}; do \
-	  install_base=$(DESTDIR)${gxx_include_dir}/${assoc_builddir} ; \
-	  relative_name=`echo $$file | sed -e "s|${assoc_srcdir}|.|g"` ;\
+	for file in ${pb_headers7}; do \
+	  install_base=$(DESTDIR)${gxx_include_dir}/${pb_builddir} ; \
+	  relative_name=`echo $$file | sed -e "s|${pb_srcdir}|.|g"` ;\
 	  $(INSTALL_DATA) $${file} $${install_base}/$${relative_name} ; done
 	$(mkinstalldirs) $(DESTDIR)${gxx_include_dir}/${tr1_builddir}
 	for file in ${tr1_headers}; do \
diff --git a/libstdc++-v3/include/ext/pb_assoc/assoc_cntnr.hpp b/libstdc++-v3/include/ext/pb_assoc/assoc_cntnr.hpp
deleted file mode 100644
index 741b93814b5..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/assoc_cntnr.hpp
+++ /dev/null
@@ -1,1590 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file assoc_cntnr.hpp
- * Contains associative containers.
- */
-
-#ifndef ASSOC_CNTNR_HPP
-#define ASSOC_CNTNR_HPP
-
-#include <ext/pb_assoc/ms_trait.hpp>
-#include <ext/pb_assoc/ds_trait.hpp>
-#include <ext/pb_assoc/detail/type_utils.hpp>
-#include <ext/pb_assoc/detail/typelist.hpp>
-#include <ext/pb_assoc/detail/standard_policies.hpp>
-#include <ext/pb_assoc/detail/mapping_level_imp.hpp>
-#include <ext/pb_assoc/detail/assoc_cntnr_base.hpp>
-#include <ext/pb_assoc/detail/value_type_adapter/value_type_adapter.hpp>
-
-namespace pb_assoc
-{
-
-#define PB_ASSOC_CLASS_T_DEC \
-	template< \
-		typename Key, \
-		typename Data, \
-		class DS_Tag, \
-		class Policy_Tl, \
-		class Allocator>
-
-#define PB_ASSOC_CLASS_C_DEC \
-	basic_assoc_cntnr< \
-		Key, \
-		Data, \
-		DS_Tag, \
-		Policy_Tl, \
-		Allocator>
-
-#define PB_ASSOC_BASE_C_DEC \
-	detail::assoc_cntnr_base< \
-		Key, \
-		Data, \
-		DS_Tag, \
-		Policy_Tl, \
-		Allocator>::type
-
-#define PB_ASSOC_DIRECT_BASE_C_DEC \
-	detail::assoc_cntnr_base< \
-		Key, \
-		Data, \
-		DS_Tag, \
-		Policy_Tl, \
-		Allocator>::type
-
-  template<typename Key,
-	   typename Data,
-	   class DS_Tag,
-	   class Policy_Tl,
-	   class Allocator>
-  class basic_assoc_cntnr 
-  : public detail::assoc_cntnr_base<Key, Data, DS_Tag, Policy_Tl, Allocator>::type
-  {
-  public:
-    typedef typename Allocator::size_type size_type;
-    typedef typename Allocator::difference_type difference_type;
-    typedef DS_Tag ds_category;
-    typedef data_enabled_ms_tag ms_category;
-    typedef Allocator allocator;
-
-    typedef
-    typename allocator::template rebind<
-      Key>::other::value_type
-    key_type;
-
-    typedef
-    typename allocator::template rebind<
-      Key>::other::reference
-    key_reference;
-
-    typedef
-    typename allocator::template rebind<
-      Key>::other::const_reference
-    const_key_reference;
-
-    typedef
-    typename allocator::template rebind<
-      Key>::other::pointer
-    key_pointer;
-
-    typedef
-    typename allocator::template rebind<
-      Key>::other::const_pointer
-    const_key_pointer;
-
-    typedef
-    typename allocator::template rebind<
-      Data>::other::value_type
-    data_type;
-
-    typedef
-    typename allocator::template rebind<
-      Data>::other::reference
-    data_reference;
-
-    typedef
-    typename allocator::template rebind<
-      Data>::other::const_reference
-    const_data_reference;
-
-    typedef
-    typename allocator::template rebind<
-      Data>::other::pointer
-    data_pointer;
-
-    typedef
-    typename allocator::template rebind<
-      Data>::other::const_pointer
-    const_data_pointer;
-
-    typedef
-    typename allocator::template rebind<
-      std::pair<const key_type, data_type> >::other::value_type
-    value_type;
-
-    typedef
-    typename allocator::template rebind<
-      std::pair<const key_type, data_type> >::other::reference
-    reference;
-
-    typedef
-    typename allocator::template rebind<
-      std::pair<const key_type, data_type> >::other::const_reference
-    const_reference;
-
-    typedef
-    typename allocator::template rebind<
-      std::pair<const key_type, data_type> >::other::pointer
-    pointer;
-
-    typedef
-    typename allocator::template rebind<
-      std::pair<const key_type, data_type> >::other::const_pointer
-    const_pointer;
-
-    typedef
-    typename PB_ASSOC_BASE_C_DEC::const_find_iterator
-    const_find_iterator;
-
-    typedef typename PB_ASSOC_BASE_C_DEC::find_iterator find_iterator;
-
-    typedef typename PB_ASSOC_BASE_C_DEC::const_iterator const_iterator;
-
-    typedef typename PB_ASSOC_BASE_C_DEC::iterator iterator;
-
-  public:
-
-    virtual
-    ~basic_assoc_cntnr();
-
-    inline size_type
-    size() const;
-
-    inline size_type
-    max_size() const;
-
-    inline bool
-    empty() const;
-
-    inline static const_key_reference
-    extract_key(const_reference r_val);
-
-    inline std::pair<find_iterator, bool>
-    insert(const_reference r_val);
-
-    inline data_reference
-    operator[](const_key_reference r_key);
-
-    inline find_iterator
-    find(const_key_reference r_key)
-    {
-      return (my_base::find(r_key));
-    }
-
-    inline const_find_iterator
-    find(const_key_reference r_key) const
-    {
-      return (my_base::find(r_key));
-    }
-
-    inline const_data_reference
-    operator[](const_key_reference r_key) const;
-
-    inline size_type
-    erase(const_key_reference r_key);
-
-    template<class Pred>
-    inline size_type
-    erase_if(Pred prd);
-
-    void
-    clear();
-
-    inline iterator
-    begin();
-
-    inline const_iterator
-    begin() const;
-
-    inline iterator
-    end();
-
-    inline const_iterator
-    end() const;
-
-  protected:
-
-#define PB_ASSOC_CLASS_NAME basic_assoc_cntnr
-
-#define PB_ASSOC_DIRECT_BASE_CAST_C_DEC \
-	typename PB_ASSOC_DIRECT_BASE_C_DEC
-
-#include <ext/pb_assoc/detail/constructors_destructor_fn_imps.hpp>
-
-#undef PB_ASSOC_DIRECT_BASE_CAST_C_DEC
-
-#undef PB_ASSOC_CLASS_NAME
-
-  private:
-    typedef typename PB_ASSOC_BASE_C_DEC my_base;
-
-  private:
-    basic_assoc_cntnr& 
-    operator=(const PB_ASSOC_CLASS_C_DEC& r_other);
-  };
-
-#include <ext/pb_assoc/detail/basic_assoc_cntnr/constructors_destructor_fn_imps.hpp>
-#include <ext/pb_assoc/detail/basic_assoc_cntnr/iterators_fn_imps.hpp>
-#include <ext/pb_assoc/detail/basic_assoc_cntnr/info_fn_imps.hpp>
-#include <ext/pb_assoc/detail/basic_assoc_cntnr/erase_fn_imps.hpp>
-#include <ext/pb_assoc/detail/basic_assoc_cntnr/insert_fn_imps.hpp>
-#include <ext/pb_assoc/detail/basic_assoc_cntnr/d_insert_fn_imps.hpp>
-#include <ext/pb_assoc/detail/basic_assoc_cntnr/d_find_fn_imps.hpp>
-#include <ext/pb_assoc/detail/basic_assoc_cntnr/d_extract_key.hpp>
-
-#undef PB_ASSOC_CLASS_T_DEC
-
-#undef PB_ASSOC_CLASS_C_DEC
-
-#undef PB_ASSOC_BASE_C_DEC
-
-#undef PB_ASSOC_DIRECT_BASE_C_DEC
-
-#define PB_ASSOC_CLASS_T_DEC \
-	template< \
-		typename Key, \
-		class Cntnr, \
-		class DS_Tag, \
-		class Policy_Tl, \
-		class Allocator>
-
-#define PB_ASSOC_CLASS_C_DEC \
-	basic_assoc_cntnr< \
-		Key, \
-		compound_data_type< \
-			Cntnr>, \
-		DS_Tag, \
-		Policy_Tl, \
-		Allocator>
-
-#define PB_ASSOC_DIRECT_BASE_C_DEC \
-	detail::value_type_adapter< \
-		Key, \
-		compound_data_type< \
-			Cntnr>, \
-		DS_Tag, \
-		Policy_Tl, \
-		Allocator, \
-		detail::mapping_level_imp< \
-			compound_data_type< \
-				Cntnr> >::value - 1>
-
-#define PB_ASSOC_BASE_C_DEC \
-	detail::assoc_cntnr_base< \
-		Key, \
-		compound_data_type< \
-			Cntnr>, \
-		DS_Tag, \
-		Policy_Tl, \
-		Allocator>::type
-
-  template<typename Key,
-	   class Cntnr,
-	   class DS_Tag,
-	   class Policy_Tl,
-	   class Allocator>
-  class basic_assoc_cntnr<Key, compound_data_type< Cntnr>, DS_Tag, Policy_Tl, Allocator> : public PB_ASSOC_DIRECT_BASE_C_DEC
-  {
-  public:
-    typedef typename Allocator::size_type size_type;
-    typedef typename Allocator::difference_type difference_type;
-    typedef DS_Tag ds_category;
-    typedef compound_data_enabled_ms_tag ms_category;
-    typedef Allocator allocator;
-
-    typedef
-    typename allocator::template rebind<
-      Key>::other::value_type
-    key_type;
-
-    typedef
-    typename allocator::template rebind<
-      Key>::other::reference
-    key_reference;
-
-    typedef
-    typename allocator::template rebind<
-      Key>::other::const_reference
-    const_key_reference;
-
-    typedef
-    typename allocator::template rebind<
-      Key>::other::pointer
-    key_pointer;
-
-    typedef
-    typename allocator::template rebind<
-      Key>::other::const_pointer
-    const_key_pointer;
-
-    typedef
-    typename allocator::template rebind<
-      Cntnr>::other::value_type
-    data_type;
-
-    typedef
-    typename allocator::template rebind<
-      Cntnr>::other::reference
-    data_reference;
-
-    typedef
-    typename allocator::template rebind<
-      Cntnr>::other::const_reference
-    const_data_reference;
-
-    typedef
-    typename allocator::template rebind<
-      Cntnr>::other::pointer
-    data_pointer;
-
-    typedef
-    typename allocator::template rebind<
-      Cntnr>::other::const_pointer
-    const_data_pointer;
-
-    typedef
-    typename allocator::template rebind<
-      std::pair<const key_type, Cntnr> >::other::value_type
-    value_type;
-
-    typedef
-    typename allocator::template rebind<
-      std::pair<const key_type, Cntnr> >::other::reference
-    reference;
-
-    typedef
-    typename allocator::template rebind<
-      std::pair<const key_type, Cntnr> >::other::const_reference
-    const_reference;
-
-    typedef
-    typename allocator::template rebind<
-      std::pair<const key_type, Cntnr> >::other::pointer
-    pointer;
-
-    typedef
-    typename allocator::template rebind<
-      std::pair<const key_type, Cntnr> >::other::const_pointer
-    const_pointer;
-
-    typedef
-    typename PB_ASSOC_BASE_C_DEC::const_find_iterator
-    const_find_iterator;
-
-    typedef typename PB_ASSOC_BASE_C_DEC::find_iterator find_iterator;
-
-    typedef typename PB_ASSOC_BASE_C_DEC::const_iterator const_iterator;
-
-    typedef typename PB_ASSOC_BASE_C_DEC::iterator iterator;
-
-    template<int Mapping_Level>
-    struct rebind
-    {
-    private:
-      enum
-	{
-	  mapping_level =
-	  detail::mapping_level_imp<compound_data_type<Cntnr> >::value
-	};
-
-    public:
-      typedef
-      detail::value_type_adapter<
-	Key,
-	compound_data_type<
-	Cntnr>,
-	DS_Tag,
-	Policy_Tl,
-	Allocator,
-	mapping_level - Mapping_Level>
-      other;
-    };
-
-  public:
-
-    virtual
-    ~basic_assoc_cntnr();
-
-    inline size_type
-    size() const;
-
-    inline size_type
-    max_size() const;
-
-    inline bool
-    empty() const;
-
-    inline static const_key_reference
-    extract_key(const_reference r_val);
-
-    inline std::pair<find_iterator, bool>
-    insert(const_reference r_val);
-
-    inline data_reference
-    operator[](const_key_reference r_key);
-
-    inline find_iterator
-    find(const_key_reference r_key)
-    {
-      return (my_base::find(r_key));
-    }
-
-    inline const_find_iterator
-    find(const_key_reference r_key) const
-    {
-      return (my_base::find(r_key));
-    }
-
-    inline const_data_reference
-    operator[](const_key_reference r_key) const;
-
-    inline size_type
-    erase(const_key_reference r_key);
-
-    template<class Pred>
-    inline size_type
-    erase_if(Pred prd);
-
-    void
-    clear();
-
-    inline iterator
-    begin();
-
-    inline const_iterator
-    begin() const;
-
-    inline iterator
-    end();
-
-    inline const_iterator
-    end() const;
-
-  protected:
-
-#define PB_ASSOC_CLASS_NAME basic_assoc_cntnr
-
-#define PB_ASSOC_DIRECT_BASE_CAST_C_DEC \
-	typename PB_ASSOC_DIRECT_BASE_C_DEC
-
-#include <ext/pb_assoc/detail/constructors_destructor_fn_imps.hpp>
-
-#undef PB_ASSOC_DIRECT_BASE_CAST_C_DEC
-
-#undef PB_ASSOC_CLASS_NAME
-
-  private:
-    typedef typename PB_ASSOC_BASE_C_DEC my_base;
-
-  private:
-    basic_assoc_cntnr& 
-    operator=(const PB_ASSOC_CLASS_C_DEC& r_other);
-  };
-
-#include <ext/pb_assoc/detail/basic_assoc_cntnr/constructors_destructor_fn_imps.hpp>
-#include <ext/pb_assoc/detail/basic_assoc_cntnr/iterators_fn_imps.hpp>
-#include <ext/pb_assoc/detail/basic_assoc_cntnr/info_fn_imps.hpp>
-#include <ext/pb_assoc/detail/basic_assoc_cntnr/erase_fn_imps.hpp>
-#include <ext/pb_assoc/detail/basic_assoc_cntnr/insert_fn_imps.hpp>
-#include <ext/pb_assoc/detail/basic_assoc_cntnr/d_insert_fn_imps.hpp>
-#include <ext/pb_assoc/detail/basic_assoc_cntnr/d_find_fn_imps.hpp>
-#include <ext/pb_assoc/detail/basic_assoc_cntnr/d_extract_key.hpp>
-
-#undef PB_ASSOC_CLASS_T_DEC
-
-#undef PB_ASSOC_CLASS_C_DEC
-
-#undef PB_ASSOC_BASE_C_DEC
-
-#undef PB_ASSOC_DIRECT_BASE_C_DEC
-
-#define PB_ASSOC_CLASS_T_DEC \
-	template<typename Key, class DS_Tag, class Policy_Tl, class Allocator>
-
-#define PB_ASSOC_CLASS_C_DEC \
-	basic_assoc_cntnr< \
-		Key, \
-		null_data_type, \
-		DS_Tag, \
-		Policy_Tl, \
-		Allocator>
-
-#define PB_ASSOC_BASE_C_DEC \
-	detail::assoc_cntnr_base< \
-		Key, \
-		null_data_type, \
-		DS_Tag, \
-		Policy_Tl, \
-		Allocator>::type
-
-  template<typename Key, class DS_Tag, class Policy_Tl, class Allocator>
-  class basic_assoc_cntnr<Key, null_data_type, DS_Tag, Policy_Tl, Allocator> : public PB_ASSOC_BASE_C_DEC
-  {
-  public:
-    typedef typename Allocator::size_type size_type;
-    typedef typename Allocator::difference_type difference_type;
-    typedef DS_Tag ds_category;
-    typedef basic_ms_tag ms_category;
-    typedef Allocator allocator;
-
-    typedef
-    typename allocator::template rebind<
-      Key>::other::value_type
-    key_type;
-
-    typedef
-    typename allocator::template rebind<
-      Key>::other::reference
-    key_reference;
-
-    typedef
-    typename allocator::template rebind<
-      Key>::other::const_reference
-    const_key_reference;
-
-    typedef
-    typename allocator::template rebind<
-      Key>::other::pointer
-    key_pointer;
-
-    typedef
-    typename allocator::template rebind<
-      Key>::other::const_pointer
-    const_key_pointer;
-
-    typedef
-    typename allocator::template rebind<
-      key_type>::other::value_type
-    value_type;
-
-    typedef
-    typename allocator::template rebind<
-      key_type>::other::const_reference
-    reference;
-
-    typedef
-    typename allocator::template rebind<
-      key_type>::other::const_reference
-    const_reference;
-
-    typedef
-    typename allocator::template rebind<
-      key_type>::other::const_pointer
-    pointer;
-
-    typedef
-    typename allocator::template rebind<key_type>::other::const_pointer
-    const_pointer;
-
-    typedef
-    typename PB_ASSOC_BASE_C_DEC::const_find_iterator
-    const_find_iterator;
-
-    typedef typename PB_ASSOC_BASE_C_DEC::find_iterator find_iterator;
-
-    typedef typename PB_ASSOC_BASE_C_DEC::const_iterator const_iterator;
-
-    typedef typename PB_ASSOC_BASE_C_DEC::iterator iterator;
-
-  public:
-
-    virtual
-    ~basic_assoc_cntnr();
-
-    inline size_type
-    size() const;
-
-    inline size_type
-    max_size() const;
-
-    inline bool
-    empty() const;
-
-    inline static const_key_reference
-    extract_key(const_reference r_val);
-
-    inline std::pair<find_iterator, bool>
-    insert(const_reference r_val);
-
-    inline find_iterator
-    find(const_key_reference r_key)
-    { return (my_base::find(r_key)); }
-
-    inline const_find_iterator
-    find(const_key_reference r_key) const
-    { return (my_base::find(r_key)); }
-
-    inline size_type
-    erase(const_key_reference r_key);
-
-    template<class Pred>
-    inline size_type
-    erase_if(Pred prd);
-
-    void
-    clear();
-
-    inline iterator
-    begin();
-
-    inline const_iterator
-    begin() const;
-
-    inline iterator
-    end();
-
-    inline const_iterator
-    end() const;
-
-  protected:
-
-#define PB_ASSOC_CLASS_NAME basic_assoc_cntnr
-
-#define PB_ASSOC_DIRECT_BASE_C_DEC PB_ASSOC_BASE_C_DEC
-
-#define PB_ASSOC_DIRECT_BASE_CAST_C_DEC \
-	typename PB_ASSOC_DIRECT_BASE_C_DEC
-
-#include <ext/pb_assoc/detail/constructors_destructor_fn_imps.hpp>
-
-#undef PB_ASSOC_DIRECT_BASE_CAST_C_DEC
-
-#undef PB_ASSOC_DIRECT_BASE_C_DEC
-
-#undef PB_ASSOC_CLASS_NAME
-
-  private:
-    typedef typename PB_ASSOC_BASE_C_DEC my_base;
-
-  private:
-    basic_assoc_cntnr& 
-    operator=(const PB_ASSOC_CLASS_C_DEC& r_other);
-  };
-
-#include <ext/pb_assoc/detail/basic_assoc_cntnr/constructors_destructor_fn_imps.hpp>
-#include <ext/pb_assoc/detail/basic_assoc_cntnr/iterators_fn_imps.hpp>
-#include <ext/pb_assoc/detail/basic_assoc_cntnr/info_fn_imps.hpp>
-#include <ext/pb_assoc/detail/basic_assoc_cntnr/erase_fn_imps.hpp>
-#include <ext/pb_assoc/detail/basic_assoc_cntnr/insert_fn_imps.hpp>
-#include <ext/pb_assoc/detail/basic_assoc_cntnr/extract_key.hpp>
-
-#undef PB_ASSOC_CLASS_T_DEC
-
-#undef PB_ASSOC_CLASS_C_DEC
-
-#undef PB_ASSOC_BASE_C_DEC
-
-#define PB_ASSOC_TYPELIST_CHAIN1(X0) pb_assoc::detail::typelist_chain<X0, pb_assoc::detail::null_type>
-#define PB_ASSOC_TYPELIST_CHAIN2(X0, X1) pb_assoc::detail::typelist_chain<X0, PB_ASSOC_TYPELIST_CHAIN1(X1) >
-#define PB_ASSOC_TYPELIST_CHAIN3(X0, X1, X2) pb_assoc::detail::typelist_chain<X0, PB_ASSOC_TYPELIST_CHAIN2(X1, X2) >
-#define PB_ASSOC_TYPELIST_CHAIN4(X0, X1, X2, X3) pb_assoc::detail::typelist_chain<X0,  PB_ASSOC_TYPELIST_CHAIN3(X1, X2, X3) >
-#define PB_ASSOC_TYPELIST_CHAIN5(X0, X1, X2, X3, X4) pb_assoc::detail::typelist_chain<X0,  PB_ASSOC_TYPELIST_CHAIN4(X1, X2, X3, X4) >
-#define PB_ASSOC_TYPELIST_CHAIN6(X0, X1, X2, X3, X4, X5) pb_assoc::detail::typelist_chain<X0, PB_ASSOC_TYPELIST_CHAIN5(X1, X2, X3, X4, X5) >
-#define PB_ASSOC_TYPELIST_CHAIN7(X0, X1, X2, X3, X4, X5, X6) pb_assoc::detail::typelist_chain<X0, PB_ASSOC_TYPELIST_CHAIN6(X1, X2, X3, X4, X5, X6) >
-#define PB_ASSOC_TYPELIST_CHAIN8(X0, X1, X2, X3, X4, X5, X6, X7) pb_assoc::detail::typelist_chain<X0, PB_ASSOC_TYPELIST_CHAIN7(X1, X2, X3, X4, X5, X6, X7) >
-#define PB_ASSOC_TYPELIST_CHAIN9(X0, X1, X2, X3, X4, X5, X6, X7, X8) pb_assoc::detail::typelist_chain<X0, PB_ASSOC_TYPELIST_CHAIN8(X1, X2, X3, X4, X5, X6, X7, X8) >
-#define PB_ASSOC_TYPELIST_CHAIN10(X0, X1, X2, X3, X4, X5, X6, X7, X8, X9) pb_assoc::detail::typelist_chain<X0, PB_ASSOC_TYPELIST_CHAIN9(X1, X2, X3, X4, X5, X6, X7, X8, X9) >
-#define PB_ASSOC_TYPELIST_CHAIN11(X0, X1, X2, X3, X4, X5, X6, X7, X8, X9, X10) pb_assoc::detail::typelist_chain<X0, PB_ASSOC_TYPELIST_CHAIN10(X1, X2, X3, X4, X5, X6, X7, X8, X9, X10) >
-#define PB_ASSOC_TYPELIST_CHAIN12(X0, X1, X2, X3, X4, X5, X6, X7, X8, X9, X10, X11) pb_assoc::detail::typelist_chain<X0, PB_ASSOC_TYPELIST_CHAIN11(X1, X2, X3, X4, X5, X6, X7, X8, X9, X10, X11) >
-#define PB_ASSOC_TYPELIST_CHAIN13(X0, X1, X2, X3, X4, X5, X6, X7, X8, X9, X10, X11, X12) pb_assoc::detail::typelist_chain<X0, PB_ASSOC_TYPELIST_CHAIN12(X1, X2, X3, X4, X5, X6, X7, X8, X9, X10, X11, X12) >
-#define PB_ASSOC_TYPELIST_CHAIN14(X0, X1, X2, X3, X4, X5, X6, X7, X8, X9, X10, X11, X12, X13) pb_assoc::detail::typelist_chain<X0, PB_ASSOC_TYPELIST_CHAIN13(X1, X2, X3, X4, X5, X6, X7, X8, X9, X10, X11, X12, X13) >
-#define PB_ASSOC_TYPELIST_CHAIN15(X0, X1, X2, X3, X4, X5, X6, X7, X8, X9, X10, X11, X12, X13, X14) pb_assoc::detail::typelist_chain<X0, PB_ASSOC_TYPELIST_CHAIN14(X1, X2, X3, X4, X5, X6, X7, X8, X9, X10, X11, X12, X13, X14) >
-
-#define PB_ASSOC_CLASS_T_DEC \
-	template< \
-		typename Key, \
-		typename Data, \
-		class Hash_Fn, \
-		class Eq_Fn, \
-		class Resize_Policy, \
-		bool Store_Hash, \
-		class DS_Tag, \
-		class Policy_TL, \
-		class Allocator>
-
-#define PB_ASSOC_CLASS_C_DEC \
-	basic_hash_assoc_cntnr< \
-		Key, \
-		Data, \
-		Hash_Fn, \
-		Eq_Fn, \
-		Resize_Policy, \
-		Store_Hash, \
-		DS_Tag, \
-		Policy_TL, \
-		Allocator>
-
-#define PB_ASSOC_BASE_C_DEC \
-	basic_assoc_cntnr< \
-		Key, \
-		Data, \
-		DS_Tag, \
-		typename pb_assoc::detail::typelist_append< \
-			pb_assoc::detail::typelist< \
-				PB_ASSOC_TYPELIST_CHAIN4( Hash_Fn, Eq_Fn, Resize_Policy, pb_assoc::detail::int_to_type<Store_Hash>) >, \
-				Policy_TL>::type, \
-		Allocator>
-
-  template<typename Key,
-	   typename Data,
-	   class Hash_Fn,
-	   class Eq_Fn,
-	   class Resize_Policy,
-	   bool Store_Hash,
-	   class DS_Tag,
-	   class Policy_TL,
-	   class Allocator>
-  class basic_hash_assoc_cntnr : public PB_ASSOC_BASE_C_DEC
-  {
-  public:
-    typedef Hash_Fn hash_fn;
-
-    typedef Eq_Fn eq_fn;
-
-    typedef Resize_Policy resize_policy;
-
-    enum
-      {
-	store_hash = Store_Hash
-      };
-
-    virtual
-    ~basic_hash_assoc_cntnr();
-
-    hash_fn& 
-    get_hash_fn();
-
-    const hash_fn& 
-    get_hash_fn() const;
-
-    eq_fn& 
-    get_eq_fn();
-
-    const eq_fn& 
-    get_eq_fn() const;
-
-    Resize_Policy& 
-    get_resize_policy();
-
-    const resize_policy& 
-    get_resize_policy() const;
-
-  protected:
-
-    typedef typename Allocator::size_type size_type;
-
-    virtual void
-    do_resize(size_type new_size);
-
-#define PB_ASSOC_CLASS_NAME basic_hash_assoc_cntnr
-
-#define PB_ASSOC_DIRECT_BASE_C_DEC PB_ASSOC_BASE_C_DEC
-
-#define PB_ASSOC_DIRECT_BASE_CAST_C_DEC \
-	PB_ASSOC_DIRECT_BASE_C_DEC
-
-#include <ext/pb_assoc/detail/constructors_destructor_fn_imps.hpp>
-
-#undef PB_ASSOC_DIRECT_BASE_C_DEC
-
-#undef PB_ASSOC_CLASS_NAME
-
-#undef PB_ASSOC_DIRECT_BASE_C_DEC
-
-  private:
-    typedef PB_ASSOC_BASE_C_DEC my_base;
-
-    basic_hash_assoc_cntnr& 
-    operator=(const PB_ASSOC_CLASS_C_DEC& r_other);
-  };
-
-#include <ext/pb_assoc/detail/basic_hash_assoc_cntnr/constructors_destructor_fn_imps.hpp>
-#include <ext/pb_assoc/detail/basic_hash_assoc_cntnr/resize_fn_imps.hpp>
-
-#undef PB_ASSOC_CLASS_T_DEC
-
-#undef PB_ASSOC_CLASS_C_DEC
-
-#undef PB_ASSOC_BASE_C_DEC
-
-#define PB_ASSOC_CLASS_T_DEC \
-	template< \
-		typename Key, \
-		typename Data, \
-		class Hash_Fn, \
-		class Eq_Fn, \
-		class Comb_Hash_Fn, \
-		class Resize_Policy, \
-		bool Store_Hash, \
-		class Allocator>
-
-#define PB_ASSOC_CLASS_C_DEC \
-	cc_hash_assoc_cntnr< \
-		Key, \
-		Data, \
-		Hash_Fn, \
-		Eq_Fn, \
-		Comb_Hash_Fn, \
-		Resize_Policy, \
-		Store_Hash, \
-		Allocator>
-
-#define PB_ASSOC_BASE_C_DEC \
-	basic_hash_assoc_cntnr< \
-		Key, \
-		Data, \
-		Hash_Fn, \
-		Eq_Fn, \
-		Resize_Policy, \
-		Store_Hash, \
-		cc_hash_ds_tag, \
-		pb_assoc::detail::typelist< \
-			PB_ASSOC_TYPELIST_CHAIN1( \
-				Comb_Hash_Fn) >, \
-		Allocator>
-
-  template<typename Key,
-	   typename Data,
-	   class Hash_Fn = typename pb_assoc::detail::def_hash_fn<Key>::type,
-	   class Eq_Fn = typename pb_assoc::detail::def_eq_fn<Key>::type,
-	   class Comb_Hash_Fn = pb_assoc::detail::def_comb_hash_fn::type,
-	   class Resize_Policy =
-	   typename pb_assoc::detail::def_resize_policy<Comb_Hash_Fn>::type,
-	   bool Store_Hash = pb_assoc::detail::def_store_hash,
-	   class Allocator = std::allocator<char> >
-  class cc_hash_assoc_cntnr : public PB_ASSOC_BASE_C_DEC
-  {
-  public:
-    typedef Comb_Hash_Fn comb_hash_fn;
-
-    cc_hash_assoc_cntnr();
-
-    cc_hash_assoc_cntnr(const Hash_Fn& r_hash_fn);
-
-    cc_hash_assoc_cntnr(const Hash_Fn& r_hash_fn, const Eq_Fn& r_eq_fn);
-
-    cc_hash_assoc_cntnr(const Hash_Fn& r_hash_fn, const Eq_Fn& r_eq_fn, 
-			const Comb_Hash_Fn& r_comb_hash_fn);
-
-    cc_hash_assoc_cntnr(const Hash_Fn& r_hash_fn, const Eq_Fn& r_eq_fn, 
-			const Comb_Hash_Fn& r_comb_hash_fn, 
-			const Resize_Policy& r_resize_policy);
-
-    template<class It>
-    cc_hash_assoc_cntnr(It first_it, It last_it);
-
-    template<class It>
-    cc_hash_assoc_cntnr(It first_it, It last_it, const Hash_Fn& r_hash_fn);
-
-    template<class It>
-    cc_hash_assoc_cntnr(It first_it, It last_it, const Hash_Fn& r_hash_fn, 
-			const Eq_Fn& r_eq_fn);
-
-    template<class It>
-    cc_hash_assoc_cntnr(It first_it, It last_it, const Hash_Fn& r_hash_fn, const Eq_Fn& r_eq_fn, const Comb_Hash_Fn& r_comb_hash_fn);
-
-    template<class It>
-    cc_hash_assoc_cntnr(It first_it, It last_it, const Hash_Fn& r_hash_fn, const Eq_Fn& r_eq_fn, const Comb_Hash_Fn& r_comb_hash_fn, const Resize_Policy& r_resize_policy);
-
-    cc_hash_assoc_cntnr(const PB_ASSOC_CLASS_C_DEC& r_other);
-
-    virtual
-    ~cc_hash_assoc_cntnr();
-
-    PB_ASSOC_CLASS_C_DEC& 
-    operator=(const PB_ASSOC_CLASS_C_DEC& r_other);
-
-    void
-    swap(PB_ASSOC_CLASS_C_DEC& r_other);
-
-    comb_hash_fn& 
-    get_comb_hash_fn();
-
-    const comb_hash_fn& 
-    get_comb_hash_fn() const;
-
-  private:
-    typedef PB_ASSOC_BASE_C_DEC my_base;
-  };
-
-#include <ext/pb_assoc/detail/cc_hash_assoc_cntnr/constructor_destructor_fn_imps.hpp>
-
-#undef PB_ASSOC_CLASS_T_DEC
-
-#undef PB_ASSOC_CLASS_C_DEC
-
-#undef PB_ASSOC_BASE_C_DEC
-
-#define PB_ASSOC_CLASS_T_DEC \
-	template< \
-		typename Key, \
-		typename Data, \
-		class Hash_Fn, \
-		class Eq_Fn, \
-		class Comb_Probe_Fn, \
-		class Probe_Fn, \
-		class Resize_Policy, \
-		bool Store_Hash, \
-		class Allocator>
-
-#define PB_ASSOC_CLASS_C_DEC \
-	gp_hash_assoc_cntnr< \
-		Key, \
-		Data, \
-		Hash_Fn, \
-		Eq_Fn, \
-		Comb_Probe_Fn, \
-		Probe_Fn, \
-		Resize_Policy, \
-		Store_Hash, \
-		Allocator>
-
-#define PB_ASSOC_BASE_C_DEC \
-	basic_hash_assoc_cntnr< \
-		Key, \
-		Data, \
-		Hash_Fn, \
-		Eq_Fn, \
-		Resize_Policy, \
-		Store_Hash, \
-		gp_hash_ds_tag, \
-		pb_assoc::detail::typelist< \
-			PB_ASSOC_TYPELIST_CHAIN2( Comb_Probe_Fn, Probe_Fn) >, \
-		Allocator>
-
-  template<typename Key,
-	   typename Data,
-	   class Hash_Fn = typename pb_assoc::detail::def_hash_fn<Key>::type,
-	   class Eq_Fn = typename pb_assoc::detail::def_eq_fn<Key>::type,
-	   class Comb_Probe_Fn = pb_assoc::detail::def_comb_hash_fn::type,
-	   class Probe_Fn = typename detail::def_probe_fn<Comb_Probe_Fn>::type,
-	   class Resize_Policy =
-	   typename pb_assoc::detail::def_resize_policy<Comb_Probe_Fn>::type,
-
-	   bool Store_Hash = pb_assoc::detail::def_store_hash,
-	   class Allocator = std::allocator<char> >
-  class gp_hash_assoc_cntnr : public PB_ASSOC_BASE_C_DEC
-  {
-  public:
-    typedef Comb_Probe_Fn comb_probe_fn;
-    typedef Probe_Fn probe_fn;
-
-    gp_hash_assoc_cntnr();
-
-    gp_hash_assoc_cntnr(const Hash_Fn& r_hash_fn);
-
-    gp_hash_assoc_cntnr(const Hash_Fn& r_hash_fn, const Eq_Fn& r_eq_fn);
-
-    gp_hash_assoc_cntnr(const Hash_Fn& r_hash_fn, const Eq_Fn& r_eq_fn, 
-			const Comb_Probe_Fn& r_comb_probe_fn);
-
-    gp_hash_assoc_cntnr(const Hash_Fn& r_hash_fn, const Eq_Fn& r_eq_fn, 
-			const Comb_Probe_Fn& r_comb_probe_fn, 
-			const Probe_Fn& r_probe_fn);
-
-    gp_hash_assoc_cntnr(const Hash_Fn& r_hash_fn, const Eq_Fn& r_eq_fn, 
-			const Comb_Probe_Fn& r_comb_probe_fn, 
-			const Probe_Fn& r_probe_fn, 
-			const Resize_Policy& r_resize_policy);
-
-    template<class It>
-    gp_hash_assoc_cntnr(It first_it, It last_it);
-
-    template<class It>
-    gp_hash_assoc_cntnr(It first_it, It last_it, const Hash_Fn& r_hash_fn);
-
-    template<class It>
-    gp_hash_assoc_cntnr(It first_it, It last_it, const Hash_Fn& r_hash_fn, const Eq_Fn& r_eq_fn);
-
-    template<class It>
-    gp_hash_assoc_cntnr(It first_it, It last_it, const Hash_Fn& r_hash_fn, const Eq_Fn& r_eq_fn, const Comb_Probe_Fn& r_comb_probe_fn);
-
-    template<class It>
-    gp_hash_assoc_cntnr(It first_it, It last_it, const Hash_Fn& r_hash_fn, const Eq_Fn& r_eq_fn, const Comb_Probe_Fn& r_comb_probe_fn, const Probe_Fn& r_probe_fn);
-
-    template<class It>
-    gp_hash_assoc_cntnr(It first_it, It last_it, const Hash_Fn& r_hash_fn, const Eq_Fn& r_eq_fn, const Comb_Probe_Fn& r_comb_probe_fn, const Probe_Fn& r_probe_fn, const Resize_Policy& r_resize_policy);
-
-    gp_hash_assoc_cntnr(const PB_ASSOC_CLASS_C_DEC& r_other);
-
-    virtual
-    ~gp_hash_assoc_cntnr();
-
-    PB_ASSOC_CLASS_C_DEC& 
-    operator=(const PB_ASSOC_CLASS_C_DEC& r_other);
-
-    void
-    swap(PB_ASSOC_CLASS_C_DEC& r_other);
-
-    comb_probe_fn& 
-    get_comb_probe_fn();
-
-    const comb_probe_fn& 
-    get_comb_probe_fn() const;
-
-    probe_fn& 
-    get_probe_fn();
-
-    const probe_fn& 
-    get_probe_fn() const;
-
-  private:
-    typedef PB_ASSOC_BASE_C_DEC my_base;
-  };
-
-#include <ext/pb_assoc/detail/gp_hash_assoc_cntnr/constructor_destructor_fn_imps.hpp>
-
-#undef PB_ASSOC_CLASS_T_DEC
-
-#undef  PB_ASSOC_CLASS_C_DEC
-
-#undef  PB_ASSOC_BASE_C_DEC
-
-#define PB_ASSOC_CLASS_T_DEC \
-	template< \
-		typename Key, \
-		typename Data, \
-		class Cmp_Fn, \
-		class DS_Tag, \
-		class Node_Updator, \
-		class Allocator>
-
-#define PB_ASSOC_CLASS_C_DEC \
-	basic_tree_assoc_cntnr< \
-		Key, \
-		Data, \
-		Cmp_Fn, \
-		DS_Tag, \
-		Node_Updator, \
-		Allocator>
-
-#define PB_ASSOC_BASE_C_DEC \
-	basic_assoc_cntnr< \
-		Key, \
-		Data, \
-		DS_Tag, \
-		pb_assoc::detail::typelist< \
-			PB_ASSOC_TYPELIST_CHAIN2( Cmp_Fn, Node_Updator) >, \
-		Allocator>
-
-  template<typename Key,
-	   typename Data,
-	   class Cmp_Fn,
-	   class DS_Tag,
-	   class Node_Updator,
-	   class Allocator>
-  class basic_tree_assoc_cntnr : public PB_ASSOC_BASE_C_DEC
-  {
-  public:
-    typedef typename Allocator::size_type size_type;
-
-    typedef
-    typename Allocator::template rebind<
-      Key>::other::const_reference
-    const_key_reference;
-
-    typedef Cmp_Fn cmp_fn;
-
-    typedef Node_Updator node_updator;
-
-    typedef typename PB_ASSOC_BASE_C_DEC::const_iterator const_iterator;
-
-    typedef typename PB_ASSOC_BASE_C_DEC::iterator iterator;
-
-    typedef
-    typename PB_ASSOC_BASE_C_DEC::const_reverse_iterator
-    const_reverse_iterator;
-
-    typedef
-    typename PB_ASSOC_BASE_C_DEC::reverse_iterator
-    reverse_iterator;
-
-    typedef
-    typename PB_ASSOC_BASE_C_DEC::const_node_iterator
-    const_node_iterator;
-
-    typedef typename PB_ASSOC_BASE_C_DEC::node_iterator node_iterator;
-
-    virtual
-    ~basic_tree_assoc_cntnr();
-
-    cmp_fn& 
-    get_cmp_fn();
-
-    const cmp_fn& 
-    get_cmp_fn() const;
-
-    node_updator& 
-    get_node_updator();
-
-    const node_updator& 
-    get_node_updator() const;
-
-    inline size_type
-    erase(const_key_reference r_key);
-
-    inline iterator
-    erase(iterator it);
-
-    inline reverse_iterator
-    erase(reverse_iterator it)
-    {
-      return (my_base::erase(it));
-    }
-
-    inline reverse_iterator
-    rbegin()
-    {
-      return (my_base::rbegin());
-    }
-
-    inline const_reverse_iterator
-    rbegin() const
-    {
-      return (my_base::rbegin());
-    }
-
-    inline reverse_iterator
-    rend()
-    {
-      return (my_base::rend());
-    }
-
-    inline const_reverse_iterator
-    rend() const
-    {
-      return (my_base::rend());
-    }
-
-    inline node_iterator
-    node_begin()
-    {
-      return (my_base::node_begin());
-    }
-
-    inline const_node_iterator
-    node_begin() const
-    {
-      return (my_base::node_begin());
-    }
-
-    inline node_iterator
-    node_end()
-    {
-      return (my_base::node_end());
-    }
-
-    inline const_node_iterator
-    node_end() const
-    {
-      return (my_base::node_end());
-    }
-
-    void
-    join(PB_ASSOC_CLASS_C_DEC& r_other);
-
-    inline void
-    split(const_key_reference r_key, PB_ASSOC_CLASS_C_DEC& r_other);
-
-  protected:
-
-#define PB_ASSOC_CLASS_NAME basic_tree_assoc_cntnr
-
-#define PB_ASSOC_DIRECT_BASE_C_DEC PB_ASSOC_BASE_C_DEC
-
-#define PB_ASSOC_DIRECT_BASE_CAST_C_DEC \
-	PB_ASSOC_DIRECT_BASE_C_DEC
-
-#include <ext/pb_assoc/detail/constructors_destructor_fn_imps.hpp>
-
-#undef PB_ASSOC_DIRECT_BASE_CAST_C_DEC
-
-#undef PB_ASSOC_CLASS_NAME
-
-#undef PB_ASSOC_DIRECT_BASE_C_DEC
-
-  private:
-    typedef PB_ASSOC_BASE_C_DEC my_base;
-  };
-
-#include <ext/pb_assoc/detail/basic_tree_assoc_cntnr/constructors_destructor_fn_imps.hpp>
-#include <ext/pb_assoc/detail/basic_tree_assoc_cntnr/policy_access_fn_imps.hpp>
-#include <ext/pb_assoc/detail/basic_tree_assoc_cntnr/range_iteration_fn_imps.hpp>
-#include <ext/pb_assoc/detail/basic_tree_assoc_cntnr/r_range_iteration_fn_imps.hpp>
-#include <ext/pb_assoc/detail/basic_tree_assoc_cntnr/node_iteration_fn_imps.hpp>
-#include <ext/pb_assoc/detail/basic_tree_assoc_cntnr/split_join_fn_imps.hpp>
-#include <ext/pb_assoc/detail/basic_tree_assoc_cntnr/erase_fn_imps.hpp>
-#include <ext/pb_assoc/detail/basic_tree_assoc_cntnr/r_erase_fn_imps.hpp>
-
-#undef PB_ASSOC_CLASS_T_DEC
-
-#undef PB_ASSOC_CLASS_C_DEC
-
-#undef PB_ASSOC_BASE_C_DEC
-
-#define PB_ASSOC_CLASS_T_DEC \
-	template< \
-		typename Key, \
-		typename Data, \
-		class Cmp_Fn, \
-		class Node_Updator, \
-		class Allocator>
-
-#define PB_ASSOC_CLASS_C_DEC \
-	basic_tree_assoc_cntnr< \
-		Key, \
-		Data, \
-		Cmp_Fn, \
-		ov_tree_ds_tag, \
-		Node_Updator, \
-		Allocator>
-
-#define PB_ASSOC_BASE_C_DEC \
-	basic_assoc_cntnr< \
-		Key, \
-		Data, \
-		ov_tree_ds_tag, \
-		pb_assoc::detail::typelist< \
-			PB_ASSOC_TYPELIST_CHAIN2( Cmp_Fn, Node_Updator) >, \
-		Allocator>
-
-  template<typename Key,
-	   typename Data,
-	   typename Cmp_Fn,
-	   typename Node_Updator,
-	   typename Allocator>
-  class basic_tree_assoc_cntnr<Key, Data, Cmp_Fn, ov_tree_ds_tag, Node_Updator, Allocator> 
-  : public PB_ASSOC_BASE_C_DEC
-  {
-  public:
-    typedef typename Allocator::size_type size_type;
-
-    typedef
-    typename Allocator::template rebind<
-      Key>::other::const_reference
-    const_key_reference;
-
-    typedef Cmp_Fn cmp_fn;
-
-    typedef Node_Updator node_updator;
-
-    typedef typename PB_ASSOC_BASE_C_DEC::const_iterator const_iterator;
-
-    typedef typename PB_ASSOC_BASE_C_DEC::iterator iterator;
-
-    typedef
-    typename PB_ASSOC_BASE_C_DEC::const_node_iterator
-    const_node_iterator;
-
-    typedef typename PB_ASSOC_BASE_C_DEC::node_iterator node_iterator;
-
-    virtual
-    ~basic_tree_assoc_cntnr();
-
-    cmp_fn& 
-    get_cmp_fn();
-
-    const cmp_fn& 
-    get_cmp_fn() const;
-
-    node_updator& 
-    get_node_updator();
-
-    const node_updator& 
-    get_node_updator() const;
-
-    inline size_type
-    erase(const_key_reference r_key);
-
-    inline iterator
-    erase(iterator it);
-
-    inline node_iterator
-    node_begin()
-    {
-      return (my_base::node_begin());
-    }
-
-    inline const_node_iterator
-    node_begin() const
-    {
-      return (my_base::node_begin());
-    }
-
-    inline node_iterator
-    node_end()
-    {
-      return (my_base::node_end());
-    }
-
-    inline const_node_iterator
-    node_end() const
-    {
-      return (my_base::node_end());
-    }
-
-    void
-    join(PB_ASSOC_CLASS_C_DEC& r_other);
-
-    inline void
-    split(const_key_reference r_key, PB_ASSOC_CLASS_C_DEC& r_other);
-
-  protected:
-
-#define PB_ASSOC_CLASS_NAME basic_tree_assoc_cntnr
-
-#define PB_ASSOC_DIRECT_BASE_C_DEC PB_ASSOC_BASE_C_DEC
-
-#define PB_ASSOC_DIRECT_BASE_CAST_C_DEC \
-	PB_ASSOC_DIRECT_BASE_C_DEC
-
-#include <ext/pb_assoc/detail/constructors_destructor_fn_imps.hpp>
-
-#undef PB_ASSOC_DIRECT_BASE_CAST_C_DEC
-
-#undef PB_ASSOC_CLASS_NAME
-
-#undef PB_ASSOC_DIRECT_BASE_C_DEC
-
-  private:
-    typedef PB_ASSOC_BASE_C_DEC my_base;
-  };
-
-#include <ext/pb_assoc/detail/basic_tree_assoc_cntnr/constructors_destructor_fn_imps.hpp>
-#include <ext/pb_assoc/detail/basic_tree_assoc_cntnr/policy_access_fn_imps.hpp>
-#include <ext/pb_assoc/detail/basic_tree_assoc_cntnr/range_iteration_fn_imps.hpp>
-#include <ext/pb_assoc/detail/basic_tree_assoc_cntnr/node_iteration_fn_imps.hpp>
-#include <ext/pb_assoc/detail/basic_tree_assoc_cntnr/split_join_fn_imps.hpp>
-#include <ext/pb_assoc/detail/basic_tree_assoc_cntnr/erase_fn_imps.hpp>
-
-#undef PB_ASSOC_CLASS_T_DEC
-
-#undef PB_ASSOC_CLASS_C_DEC
-
-#undef PB_ASSOC_BASE_C_DEC
-
-#define PB_ASSOC_CLASS_T_DEC \
-	template< \
-		typename Key, \
-		typename Data, \
-		class Cmp_Fn, \
-		class DS_Tag, \
-		class Node_Updator, \
-		class Allocator>
-
-#define PB_ASSOC_CLASS_C_DEC \
-	tree_assoc_cntnr< \
-		Key, \
-		Data, \
-		Cmp_Fn, \
-		DS_Tag, \
-		Node_Updator, \
-		Allocator>
-
-#define PB_ASSOC_BASE_C_DEC \
-	basic_tree_assoc_cntnr< \
-		Key, \
-		Data, \
-		Cmp_Fn, \
-		DS_Tag, \
-		Node_Updator, \
-		Allocator>
-
-  template<typename Key, typename Data, class Cmp_Fn =	std::less<Key>,
-	   typename DS_Tag = rb_tree_ds_tag,
-	   typename Node_Updator = pb_assoc::detail::def_node_updator,
-	   typename Allocator = std::allocator<char> >
-  class tree_assoc_cntnr : public PB_ASSOC_BASE_C_DEC
-  {
-    typedef Cmp_Fn cmp_fn;
-    typedef Node_Updator node_updator;
-
-  public:
-    tree_assoc_cntnr();
-    tree_assoc_cntnr(const cmp_fn& r_cmp_fn);
-    tree_assoc_cntnr(const cmp_fn& r_cmp_fn, const Node_Updator&r);
- 
-    template<typename It>
-      tree_assoc_cntnr(It first_it, It last_it);
-
-    template<typename It>
-      tree_assoc_cntnr(It first_it, It last_it, const cmp_fn& r_cmp_fn);
-
-    template<typename It>
-      tree_assoc_cntnr(It, It, const cmp_fn&, const Node_Updator&);
-
-    tree_assoc_cntnr(const PB_ASSOC_CLASS_C_DEC& r_other);
-
-    virtual
-    ~tree_assoc_cntnr();
-
-    PB_ASSOC_CLASS_C_DEC& 
-    operator=(const PB_ASSOC_CLASS_C_DEC& r_other);
-
-    void
-    swap(PB_ASSOC_CLASS_C_DEC& r_other);
-
-  private:
-    typedef PB_ASSOC_BASE_C_DEC my_base;
-  };
-
-#include <ext/pb_assoc/detail/tree_assoc_cntnr/constructor_destructor_fn_imps.hpp>
-
-#undef PB_ASSOC_CLASS_T_DEC
-
-#undef PB_ASSOC_CLASS_C_DEC
-
-#undef PB_ASSOC_BASE_C_DEC
-
-#define PB_ASSOC_CLASS_T_DEC \
-	template< \
-		typename Key, \
-		typename Data, \
-		class Eq_Fn, \
-		class Update_Policy, \
-		class Allocator>
-
-#define PB_ASSOC_CLASS_C_DEC \
-	lu_assoc_cntnr< \
-		Key, \
-		Data, \
-		Eq_Fn, \
-		Update_Policy, \
-		Allocator>
-
-#define PB_ASSOC_BASE_C_DEC \
-	basic_assoc_cntnr< \
-		Key, \
-		Data, \
-		lu_ds_tag, \
-		pb_assoc::detail::typelist< \
-			PB_ASSOC_TYPELIST_CHAIN2( Eq_Fn, Update_Policy) >, \
-		Allocator>
-
-  template<typename Key,
-	   typename Data,
-	   typename Eq_Fn = typename pb_assoc::detail::def_eq_fn<Key>::type,
-	   typename Update_Policy = pb_assoc::detail::def_update_policy::type,
-	   typename Allocator = std::allocator<char> >
-  class lu_assoc_cntnr : public PB_ASSOC_BASE_C_DEC
-  {
-  public:
-    typedef Eq_Fn eq_fn;
-    typedef Allocator allocator;
-    typedef Update_Policy update_policy;
-    
-    lu_assoc_cntnr();    
-    lu_assoc_cntnr(const Eq_Fn& r_eq_fn);    
-    lu_assoc_cntnr(const Eq_Fn& r_eq_fn, const Update_Policy& r_update_policy);
-    
-    template<typename It>
-      lu_assoc_cntnr(It first_it, It last_it);
-
-    template<typename It>
-      lu_assoc_cntnr(It first_it, It last_it, const Eq_Fn& r_eq_fn);
-
-    template<typename It>
-      lu_assoc_cntnr(It, It, const Eq_Fn&, const Update_Policy&);
-
-    lu_assoc_cntnr(const PB_ASSOC_CLASS_C_DEC& r_other);
-
-    virtual
-    ~lu_assoc_cntnr();
-
-    PB_ASSOC_CLASS_C_DEC& 
-    operator=(const PB_ASSOC_CLASS_C_DEC& r_other);
-
-    void
-    swap(PB_ASSOC_CLASS_C_DEC& r_other);
-
-    eq_fn& 
-    get_eq_fn();
-
-    const eq_fn& 
-    get_eq_fn() const;
-
-    update_policy& 
-    get_update_policy();
-
-    const update_policy& 
-    get_update_policy() const;
-
-  private:
-    typedef PB_ASSOC_BASE_C_DEC my_base;
-  };
-
-#include <ext/pb_assoc/detail/lu_assoc_cntnr/constructor_destructor_fn_imps.hpp>
-#include <ext/pb_assoc/detail/lu_assoc_cntnr/policy_access_fn_imps.hpp>
-
-#undef PB_ASSOC_CLASS_T_DEC
-
-#undef PB_ASSOC_CLASS_C_DEC
-
-#undef PB_ASSOC_BASE_C_DEC
-
-#undef PB_ASSOC_TYPELIST_CHAIN1
-#undef PB_ASSOC_TYPELIST_CHAIN2
-#undef PB_ASSOC_TYPELIST_CHAIN3
-#undef PB_ASSOC_TYPELIST_CHAIN4
-#undef PB_ASSOC_TYPELIST_CHAIN5
-#undef PB_ASSOC_TYPELIST_CHAIN6
-#undef PB_ASSOC_TYPELIST_CHAIN7
-#undef PB_ASSOC_TYPELIST_CHAIN8
-#undef PB_ASSOC_TYPELIST_CHAIN9
-#undef PB_ASSOC_TYPELIST_CHAIN10
-#undef PB_ASSOC_TYPELIST_CHAIN11
-#undef PB_ASSOC_TYPELIST_CHAIN12
-#undef PB_ASSOC_TYPELIST_CHAIN13
-#undef PB_ASSOC_TYPELIST_CHAIN14
-#undef PB_ASSOC_TYPELIST_CHAIN15
-
-} // namespace pb_assoc
-
-#endif // #ifndef ASSOC_CNTNR_HPP
diff --git a/libstdc++-v3/include/ext/pb_assoc/data_type.hpp b/libstdc++-v3/include/ext/pb_assoc/data_type.hpp
deleted file mode 100644
index b670a0088a3..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/data_type.hpp
+++ /dev/null
@@ -1,60 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file data_tye.hpp
- * Contains a traits class of types used by containers.
- */
-
-#ifndef DATA_TYPE_HPP
-#define DATA_TYPE_HPP
-
-namespace pb_assoc
-{
-  struct null_data_type
-  { };
-
-  template<typename Cntnr>
-    struct compound_data_type
-    {
-      typedef Cntnr cntnr;
-    };
-} // namespace pb_assoc
-
-#endif // #ifndef DATA_TYPE_HPP
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/assoc_cntnr_base.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/assoc_cntnr_base.hpp
deleted file mode 100644
index 4e441b81a99..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/assoc_cntnr_base.hpp
+++ /dev/null
@@ -1,346 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file assoc_cntnr_base.hpp
- * Contains an associative container dispatching base.
- */
-
-#ifndef ASSOC_CNTNR_BASE_HPP
-#define ASSOC_CNTNR_BASE_HPP
-
-#include <ext/pb_assoc/detail/typelist.hpp>
-
-#define PB_ASSOC_DATA_TRUE_INDICATOR
-#include <ext/pb_assoc/detail/lu_map_/lu_map_.hpp>
-#undef PB_ASSOC_DATA_TRUE_INDICATOR
-
-#define PB_ASSOC_DATA_FALSE_INDICATOR
-#include <ext/pb_assoc/detail/lu_map_/lu_map_.hpp>
-#undef PB_ASSOC_DATA_FALSE_INDICATOR
-
-#define PB_ASSOC_DATA_TRUE_INDICATOR
-#include <ext/pb_assoc/detail/rb_tree_map_/rb_tree_.hpp>
-#undef PB_ASSOC_DATA_TRUE_INDICATOR
-
-#define PB_ASSOC_DATA_FALSE_INDICATOR
-#include <ext/pb_assoc/detail/rb_tree_map_/rb_tree_.hpp>
-#undef PB_ASSOC_DATA_FALSE_INDICATOR
-
-#define PB_ASSOC_DATA_TRUE_INDICATOR
-#include <ext/pb_assoc/detail/splay_tree_/splay_tree_.hpp>
-#undef PB_ASSOC_DATA_TRUE_INDICATOR
-
-#define PB_ASSOC_DATA_FALSE_INDICATOR
-#include <ext/pb_assoc/detail/splay_tree_/splay_tree_.hpp>
-#undef PB_ASSOC_DATA_FALSE_INDICATOR
-
-#define PB_ASSOC_DATA_TRUE_INDICATOR
-#include <ext/pb_assoc/detail/ov_tree_map_/ov_tree_map_.hpp>
-#undef PB_ASSOC_DATA_TRUE_INDICATOR
-
-#define PB_ASSOC_DATA_FALSE_INDICATOR
-#include <ext/pb_assoc/detail/ov_tree_map_/ov_tree_map_.hpp>
-#undef PB_ASSOC_DATA_FALSE_INDICATOR
-
-#define PB_ASSOC_DATA_TRUE_INDICATOR
-#include <ext/pb_assoc/detail/cc_ht_map_/cc_ht_map_.hpp>
-#undef PB_ASSOC_DATA_TRUE_INDICATOR
-
-#define PB_ASSOC_DATA_FALSE_INDICATOR
-#include <ext/pb_assoc/detail/cc_ht_map_/cc_ht_map_.hpp>
-#undef PB_ASSOC_DATA_FALSE_INDICATOR
-
-#define PB_ASSOC_DATA_TRUE_INDICATOR
-#include <ext/pb_assoc/detail/gp_ht_map_/gp_ht_map_.hpp>
-#undef PB_ASSOC_DATA_TRUE_INDICATOR
-
-#define PB_ASSOC_DATA_FALSE_INDICATOR
-#include <ext/pb_assoc/detail/gp_ht_map_/gp_ht_map_.hpp>
-#undef PB_ASSOC_DATA_FALSE_INDICATOR
-
-namespace pb_assoc
-{
-
-  namespace detail
-  {
-
-    template<typename Key,
-	     typename Data,
-	     class Data_Structure_Taq,
-	     class Policy_Tl,
-	     class Allocator>
-    struct assoc_cntnr_base;
-
-    template<typename Key, typename Data, class Policy_Tl, class Allocator>
-    struct assoc_cntnr_base<
-      Key,
-      Data,
-      lu_ds_tag,
-      Policy_Tl,
-      Allocator>
-    {
-      typedef
-      lu_map_data_<
-	Key,
-	Data,
-	typename typelist_at_index<Policy_Tl, 0>::type,
-	Allocator,
-	typename typelist_at_index<Policy_Tl, 1>::type>
-      type;
-    };
-
-    template<typename Key, class Policy_Tl, class Allocator>
-    struct assoc_cntnr_base<
-      Key,
-      null_data_type,
-      lu_ds_tag,
-      Policy_Tl,
-      Allocator>
-    {
-      typedef
-      lu_map_no_data_<
-	Key,
-	null_data_type,
-	typename typelist_at_index<Policy_Tl, 0>::type,
-	Allocator,
-	typename typelist_at_index<Policy_Tl, 1>::type>
-      type;
-    };
-
-    template<typename Key, typename Data, class Policy_Tl, class Allocator>
-    struct assoc_cntnr_base<
-      Key,
-      Data,
-      rb_tree_ds_tag,
-      Policy_Tl,
-      Allocator>
-    {
-      typedef
-      rb_tree_data_<
-	Key,
-	Data,
-	typename typelist_at_index<Policy_Tl, 0>::type,
-	Allocator,
-	typename typelist_at_index<Policy_Tl, 1>::type>
-      type;
-    };
-
-    template<typename Key, class Policy_Tl, class Allocator>
-    struct assoc_cntnr_base<
-      Key,
-      null_data_type,
-      rb_tree_ds_tag,
-      Policy_Tl,
-      Allocator>
-    {
-      typedef
-      rb_tree_no_data_<
-	Key,
-	null_data_type,
-	typename typelist_at_index<Policy_Tl, 0>::type,
-	Allocator,
-	typename typelist_at_index<Policy_Tl, 1>::type>
-      type;
-    };
-
-    template<typename Key, typename Data, class Policy_Tl, class Allocator>
-    struct assoc_cntnr_base<
-      Key,
-      Data,
-      splay_tree_ds_tag,
-      Policy_Tl,
-      Allocator>
-
-    {
-      typedef
-      splay_tree_data_<
-	Key,
-	Data,
-	typename typelist_at_index<Policy_Tl, 0>::type,
-	Allocator,
-	typename typelist_at_index<Policy_Tl, 1>::type>
-      type;
-    };
-
-    template<typename Key, class Policy_Tl, class Allocator>
-    struct assoc_cntnr_base<
-      Key,
-      null_data_type,
-      splay_tree_ds_tag,
-      Policy_Tl,
-      Allocator>
-    {
-      typedef
-      splay_tree_no_data_<
-	Key,
-	null_data_type,
-	typename typelist_at_index<Policy_Tl, 0>::type,
-	Allocator,
-	typename typelist_at_index<Policy_Tl, 1>::type>
-      type;
-    };
-
-    template<typename Key, typename Data, class Policy_Tl, class Allocator>
-    struct assoc_cntnr_base<
-      Key,
-      Data,
-      ov_tree_ds_tag,
-      Policy_Tl,
-      Allocator>
-    {
-      typedef
-      ov_tree_data_<
-	Key,
-	Data,
-	typename typelist_at_index<Policy_Tl, 0>::type,
-	Allocator,
-	typename typelist_at_index<Policy_Tl, 1>::type>
-      type;
-    };
-
-    template<typename Key, class Policy_Tl, class Allocator>
-    struct assoc_cntnr_base<
-      Key,
-      null_data_type,
-      ov_tree_ds_tag,
-      Policy_Tl,
-      Allocator>
-    {
-      typedef
-      ov_tree_no_data_<
-	Key,
-	null_data_type,
-	typename typelist_at_index<Policy_Tl, 0>::type,
-	Allocator,
-	typename typelist_at_index<Policy_Tl, 1>::type>
-      type;
-    };
-
-    template<typename Key, typename Data, class Policy_Tl, class Allocator>
-    struct assoc_cntnr_base<
-      Key,
-      Data,
-      cc_hash_ds_tag,
-      Policy_Tl,
-      Allocator>
-    {
-      typedef
-      cc_ht_map_data_<
-	Key,
-	Data,
-	typename typelist_at_index<Policy_Tl, 0>::type,
-	typename typelist_at_index<Policy_Tl, 1>::type,
-	Allocator,
-	typelist_at_index<Policy_Tl, 3>::type::value,
-	typename typelist_at_index<Policy_Tl, 4>::type,
-	typename typelist_at_index<Policy_Tl, 2>::type>
-      type;
-    };
-
-    template<typename Key, class Policy_Tl, class Allocator>
-    struct assoc_cntnr_base<
-      Key,
-      null_data_type,
-      cc_hash_ds_tag,
-      Policy_Tl,
-      Allocator>
-    {
-      typedef
-      cc_ht_map_no_data_<
-	Key,
-	null_data_type,
-	typename typelist_at_index<Policy_Tl, 0>::type,
-	typename typelist_at_index<Policy_Tl, 1>::type,
-	Allocator,
-	typelist_at_index<Policy_Tl, 3>::type::value,
-	typename typelist_at_index<Policy_Tl, 4>::type,
-	typename typelist_at_index<Policy_Tl, 2>::type>
-      type;
-    };
-
-    template<typename Key, typename Data, class Policy_Tl, class Allocator>
-    struct assoc_cntnr_base<
-      Key,
-      Data,
-      gp_hash_ds_tag,
-      Policy_Tl,
-      Allocator>
-    {
-      typedef
-      gp_ht_map_data_<
-	Key,
-	Data,
-	typename typelist_at_index<Policy_Tl, 0>::type,
-	typename typelist_at_index<Policy_Tl, 1>::type,
-	Allocator,
-	typelist_at_index<Policy_Tl, 3>::type::value,
-	typename typelist_at_index<Policy_Tl, 4>::type,
-	typename typelist_at_index<Policy_Tl, 5>::type,
-	typename typelist_at_index<Policy_Tl, 2>::type>
-      type;
-    };
-
-    template<typename Key, class Policy_Tl, class Allocator>
-    struct assoc_cntnr_base<
-      Key,
-      null_data_type,
-      gp_hash_ds_tag,
-      Policy_Tl,
-      Allocator>
-    {
-      typedef
-      gp_ht_map_no_data_<
-	Key,
-	null_data_type,
-	typename typelist_at_index<Policy_Tl, 0>::type,
-	typename typelist_at_index<Policy_Tl, 1>::type,
-	Allocator,
-	typelist_at_index<Policy_Tl, 3>::type::value,
-	typename typelist_at_index<Policy_Tl, 4>::type,
-	typename typelist_at_index<Policy_Tl, 5>::type,
-	typename typelist_at_index<Policy_Tl, 2>::type>
-      type;
-    };
-
-  } // namespace detail
-
-} // namespace pb_assoc
-
-#endif // #ifndef ASSOC_CNTNR_BASE_HPP
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/basic_assoc_cntnr/constructor_destructor_fn_imps.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/basic_assoc_cntnr/constructor_destructor_fn_imps.hpp
deleted file mode 100644
index a0dd0898bfb..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/basic_assoc_cntnr/constructor_destructor_fn_imps.hpp
+++ /dev/null
@@ -1,164 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file constructor_destructor_fn_imps.hpp
- * Contains implementations of constructors, destructors,
- *	and related functions.
- */
-
-PB_ASSOC_CLASS_T_DEC
-inline
-PB_ASSOC_CLASS_C_DEC::
-basic_assoc_cntnr()
-{ }
-
-PB_ASSOC_CLASS_T_DEC
-template<typename T0>
-inline
-PB_ASSOC_CLASS_C_DEC::
-basic_assoc_cntnr(T0 t0) :
-  PB_ASSOC_DIRECT_BASE_C_DEC(t0)
-{ }
-
-PB_ASSOC_CLASS_T_DEC
-template<typename T0, typename T1>
-inline
-PB_ASSOC_CLASS_C_DEC::
-basic_assoc_cntnr(T0 t0, T1 t1) :
-  PB_ASSOC_DIRECT_BASE_C_DEC(t0, t1)
-{ }
-
-PB_ASSOC_CLASS_T_DEC
-template<typename T0, typename T1, typename T2>
-inline
-PB_ASSOC_CLASS_C_DEC::
-basic_assoc_cntnr(T0 t0, T1 t1, T2 t2) :
-  PB_ASSOC_DIRECT_BASE_C_DEC(t0, t1, t2)
-{ }
-
-PB_ASSOC_CLASS_T_DEC
-template<typename T0, typename T1, typename T2, typename T3>
-inline
-PB_ASSOC_CLASS_C_DEC::
-basic_assoc_cntnr(T0 t0, T1 t1, T2 t2, T3 t3) :
-  PB_ASSOC_DIRECT_BASE_C_DEC(t0, t1, t2, t3)
-{ }
-
-PB_ASSOC_CLASS_T_DEC
-template<typename T0,
-	 typename T1,
-	 typename T2,
-	 typename T3,
-	 typename T4>
-inline
-PB_ASSOC_CLASS_C_DEC::
-basic_assoc_cntnr(T0 t0, T1 t1, T2 t2, T3 t3, T4 t4) :
-  PB_ASSOC_DIRECT_BASE_C_DEC(t0, t1, t2, t3, t4)
-{ }
-
-PB_ASSOC_CLASS_T_DEC
-template<typename T0,
-	 typename T1,
-	 typename T2,
-	 typename T3,
-	 typename T4,
-	 typename T5>
-inline
-PB_ASSOC_CLASS_C_DEC::
-basic_assoc_cntnr(T0 t0, T1 t1, T2 t2, T3 t3, T4 t4, T5 t5) :
-  PB_ASSOC_DIRECT_BASE_C_DEC(t0, t1, t2, t3, t4, t5)
-{ }
-
-PB_ASSOC_CLASS_T_DEC
-template<typename T0,
-	 typename T1,
-	 typename T2,
-	 typename T3,
-	 typename T4,
-	 typename T5,
-	 typename T6>
-inline
-PB_ASSOC_CLASS_C_DEC::
-basic_assoc_cntnr(T0 t0, T1 t1, T2 t2, T3 t3, T4 t4, T5 t5, T6 t6) :
-  PB_ASSOC_DIRECT_BASE_C_DEC(t0, t1, t2, t3, t4, t5, t6)
-{ }
-
-PB_ASSOC_CLASS_T_DEC
-template<typename T0,
-	 typename T1,
-	 typename T2,
-	 typename T3,
-	 typename T4,
-	 typename T5,
-	 typename T6,
-	 typename T7>
-inline
-PB_ASSOC_CLASS_C_DEC::
-basic_assoc_cntnr(T0 t0, T1 t1, T2 t2, T3 t3, T4 t4, T5 t5, T6 t6, T7 t7) :
-  PB_ASSOC_DIRECT_BASE_C_DEC(t0, t1, t2, t3, t4, t5, t6, t7)
-{ }
-
-PB_ASSOC_CLASS_T_DEC
-template<typename T0,
-	 typename T1,
-	 typename T2,
-	 typename T3,
-	 typename T4,
-	 typename T5,
-	 typename T6,
-	 typename T7,
-	 typename T8>
-inline
-PB_ASSOC_CLASS_C_DEC::
-basic_assoc_cntnr(T0 t0, T1 t1, T2 t2, T3 t3, T4 t4, T5 t5, T6 t6, T7 t7, T8 t8) :
-  PB_ASSOC_DIRECT_BASE_C_DEC(t0, t1, t2, t3, t4, t5, t6, t7, t8)
-{ }
-
-PB_ASSOC_CLASS_T_DEC
-inline
-PB_ASSOC_CLASS_C_DEC::
-basic_assoc_cntnr(const PB_ASSOC_CLASS_C_DEC& r_other) :
-  PB_ASSOC_DIRECT_BASE_C_DEC((const PB_ASSOC_DIRECT_BASE_C_DEC& )r_other)
-{ }
-
-PB_ASSOC_CLASS_T_DEC
-PB_ASSOC_CLASS_C_DEC::
-~basic_assoc_cntnr()
-{ }
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/basic_assoc_cntnr/constructors_destructor_fn_imps.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/basic_assoc_cntnr/constructors_destructor_fn_imps.hpp
deleted file mode 100644
index 5cd12513c2b..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/basic_assoc_cntnr/constructors_destructor_fn_imps.hpp
+++ /dev/null
@@ -1,48 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file constructors_destructor_fn_imps.hpp
- * Contains constructors and destructor implementation.
- */
-
-PB_ASSOC_CLASS_T_DEC
-PB_ASSOC_CLASS_C_DEC::
-~basic_assoc_cntnr()
-{ }
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/basic_assoc_cntnr/d_extract_key.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/basic_assoc_cntnr/d_extract_key.hpp
deleted file mode 100644
index 1c7747edaa4..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/basic_assoc_cntnr/d_extract_key.hpp
+++ /dev/null
@@ -1,51 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file d_extract_key.hpp
- * Contains implementations of info related functions.
- */
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::const_key_reference
-PB_ASSOC_CLASS_C_DEC::
-extract_key(const_reference r_val)
-{
-  return (r_val.first);
-}
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/basic_assoc_cntnr/d_find_fn_imps.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/basic_assoc_cntnr/d_find_fn_imps.hpp
deleted file mode 100644
index 30b03281d19..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/basic_assoc_cntnr/d_find_fn_imps.hpp
+++ /dev/null
@@ -1,51 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file d_find_fn_imps.hpp
- * Contains implementations of gp_ht_maps's find related functions.
- */
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::const_data_reference
-PB_ASSOC_CLASS_C_DEC::
-operator[](const_key_reference r_key) const
-{
-  return (my_base::const_subscript_imp(r_key));
-}
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/basic_assoc_cntnr/d_insert_fn_imps.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/basic_assoc_cntnr/d_insert_fn_imps.hpp
deleted file mode 100644
index 4193589d3eb..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/basic_assoc_cntnr/d_insert_fn_imps.hpp
+++ /dev/null
@@ -1,51 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file d_insert_fn_imps.hpp
- * Contains implementations of gp_ht_maps's erase related functions.
- */
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::data_reference
-PB_ASSOC_CLASS_C_DEC::
-operator[](const_key_reference r_key)
-{
-  return (my_base::subscript_imp(r_key));
-}
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/basic_assoc_cntnr/erase_fn_imps.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/basic_assoc_cntnr/erase_fn_imps.hpp
deleted file mode 100644
index e22bc264559..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/basic_assoc_cntnr/erase_fn_imps.hpp
+++ /dev/null
@@ -1,68 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file erase_fn_imps.hpp
- * Contains implementations of gp_ht_maps's erase related functions.
- */
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::size_type
-PB_ASSOC_CLASS_C_DEC::
-erase(const_key_reference r_key)
-{
-  return (my_base::erase(r_key));
-}
-
-PB_ASSOC_CLASS_T_DEC
-void
-PB_ASSOC_CLASS_C_DEC::
-clear()
-{
-  return (my_base::clear());
-}
-
-PB_ASSOC_CLASS_T_DEC
-template<class Pred>
-inline typename PB_ASSOC_CLASS_C_DEC::size_type
-PB_ASSOC_CLASS_C_DEC::
-erase_if(Pred pred)
-{
-  return (my_base::erase_if(pred));
-}
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/basic_assoc_cntnr/extract_key.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/basic_assoc_cntnr/extract_key.hpp
deleted file mode 100644
index 6806d0b89e7..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/basic_assoc_cntnr/extract_key.hpp
+++ /dev/null
@@ -1,51 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file extract_key.hpp
- * Contains implementations of info related functions.
- */
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::const_key_reference
-PB_ASSOC_CLASS_C_DEC::
-extract_key(const_reference r_val)
-{
-  return (r_val);
-}
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/basic_assoc_cntnr/info_fn_imps.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/basic_assoc_cntnr/info_fn_imps.hpp
deleted file mode 100644
index 7467b05fb26..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/basic_assoc_cntnr/info_fn_imps.hpp
+++ /dev/null
@@ -1,67 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file info_fn_imps.hpp
- * Contains implementations of info related functions.
- */
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::size_type
-PB_ASSOC_CLASS_C_DEC::
-size() const
-{
-  return (my_base::size());
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::size_type
-PB_ASSOC_CLASS_C_DEC::
-max_size() const
-{
-  return (my_base::max_size());
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline bool
-PB_ASSOC_CLASS_C_DEC::
-empty() const
-{
-  return (my_base::empty());
-}
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/basic_assoc_cntnr/insert_fn_imps.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/basic_assoc_cntnr/insert_fn_imps.hpp
deleted file mode 100644
index c8edc7eb95c..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/basic_assoc_cntnr/insert_fn_imps.hpp
+++ /dev/null
@@ -1,51 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file insert_fn_imps.hpp
- * Contains implementations of gp_ht_maps's erase related functions.
- */
-
-PB_ASSOC_CLASS_T_DEC
-inline std::pair<typename PB_ASSOC_CLASS_C_DEC::find_iterator, bool>
-PB_ASSOC_CLASS_C_DEC::
-insert(const_reference r_value)
-{
-  return (my_base::insert(r_value));
-}
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/basic_assoc_cntnr/iterators_fn_imps.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/basic_assoc_cntnr/iterators_fn_imps.hpp
deleted file mode 100644
index 3bd1642c190..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/basic_assoc_cntnr/iterators_fn_imps.hpp
+++ /dev/null
@@ -1,76 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file iterators_fn_imps.hpp
- * Contains implementations of gp_ht_map_'s iterators related functions, e.g.,
- *	begin().
- */
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::iterator
-PB_ASSOC_CLASS_C_DEC::
-begin()
-{
-  return (my_base::begin());
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::iterator
-PB_ASSOC_CLASS_C_DEC::
-end()
-{
-  return (my_base::end());
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::const_iterator
-PB_ASSOC_CLASS_C_DEC::
-begin() const
-{
-  return (my_base::begin());
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::const_iterator
-PB_ASSOC_CLASS_C_DEC::
-end() const
-{
-  return (my_base::end());
-}
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/basic_hash_assoc_cntnr/constructor_destructor_fn_imps.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/basic_hash_assoc_cntnr/constructor_destructor_fn_imps.hpp
deleted file mode 100644
index da0be878a84..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/basic_hash_assoc_cntnr/constructor_destructor_fn_imps.hpp
+++ /dev/null
@@ -1,50 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file constructor_destructor_fn_imps.hpp
- * Contains implementations of cc_ht's constructors, destructor,
- *	and related functions.
- */
-
-PB_ASSOC_CLASS_T_DEC
-PB_ASSOC_CLASS_C_DEC::
-~PB_ASSOC_CLASS_NAME()
-{ }
-
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/basic_hash_assoc_cntnr/constructors_destructor_fn_imps.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/basic_hash_assoc_cntnr/constructors_destructor_fn_imps.hpp
deleted file mode 100644
index 48180a1744b..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/basic_hash_assoc_cntnr/constructors_destructor_fn_imps.hpp
+++ /dev/null
@@ -1,50 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file constructor_destructor_fn_imps.hpp
- * Contains implementations of cc_ht's constructors, destructor,
- *	and related functions.
- */
-
-PB_ASSOC_CLASS_T_DEC
-PB_ASSOC_CLASS_C_DEC::
-~basic_hash_assoc_cntnr()
-{ }
-
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/basic_hash_assoc_cntnr/resize_fn_imps.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/basic_hash_assoc_cntnr/resize_fn_imps.hpp
deleted file mode 100644
index c5dd7143860..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/basic_hash_assoc_cntnr/resize_fn_imps.hpp
+++ /dev/null
@@ -1,51 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file resize_fn_imps.hpp
- * Contains implementations of resize functions
- */
-
-PB_ASSOC_CLASS_T_DEC
-void
-PB_ASSOC_CLASS_C_DEC::
-do_resize(size_type new_size)
-{
-  return (my_base::do_resize(new_size));
-}
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/basic_tree_assoc_cntnr/constructor_destructor_fn_imps.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/basic_tree_assoc_cntnr/constructor_destructor_fn_imps.hpp
deleted file mode 100644
index c5d2d01626e..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/basic_tree_assoc_cntnr/constructor_destructor_fn_imps.hpp
+++ /dev/null
@@ -1,50 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file constructor_destructor_fn_imps.hpp
- * Contains implementations of cc_ht's constructors, destructor,
- *	and related functions.
- */
-
-PB_ASSOC_CLASS_T_DEC
-PB_ASSOC_CLASS_C_DEC::
-~basic_tree_assoc_cntnr()
-{ }
-
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/basic_tree_assoc_cntnr/constructors_destructor_fn_imps.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/basic_tree_assoc_cntnr/constructors_destructor_fn_imps.hpp
deleted file mode 100644
index c5d2d01626e..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/basic_tree_assoc_cntnr/constructors_destructor_fn_imps.hpp
+++ /dev/null
@@ -1,50 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file constructor_destructor_fn_imps.hpp
- * Contains implementations of cc_ht's constructors, destructor,
- *	and related functions.
- */
-
-PB_ASSOC_CLASS_T_DEC
-PB_ASSOC_CLASS_C_DEC::
-~basic_tree_assoc_cntnr()
-{ }
-
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/basic_tree_assoc_cntnr/erase_fn_imps.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/basic_tree_assoc_cntnr/erase_fn_imps.hpp
deleted file mode 100644
index b91511ce8d2..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/basic_tree_assoc_cntnr/erase_fn_imps.hpp
+++ /dev/null
@@ -1,60 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file erase_fn_imps.hpp
- * Contains implementations of rb_tree's find related functions,
- *	common to all tree container types.
- */
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::size_type
-PB_ASSOC_CLASS_C_DEC::
-erase(const_key_reference r_key)
-{
-  return (my_base::erase(r_key));
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::iterator
-PB_ASSOC_CLASS_C_DEC::
-erase(iterator it)
-{
-  return (my_base::erase(it));
-}
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/basic_tree_assoc_cntnr/node_iteration_fn_imps.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/basic_tree_assoc_cntnr/node_iteration_fn_imps.hpp
deleted file mode 100644
index d872d3df8a6..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/basic_tree_assoc_cntnr/node_iteration_fn_imps.hpp
+++ /dev/null
@@ -1,44 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file node_iteration_fn_imps.hpp
- * Contains a rb_tree set implementation.
- */
-
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/basic_tree_assoc_cntnr/policy_access_fn_imps.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/basic_tree_assoc_cntnr/policy_access_fn_imps.hpp
deleted file mode 100644
index 7c71b6e0e13..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/basic_tree_assoc_cntnr/policy_access_fn_imps.hpp
+++ /dev/null
@@ -1,76 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file policy_access_fn_imps.hpp
- * Contains implementation of rb trees
- */
-
-PB_ASSOC_CLASS_T_DEC
-Cmp_Fn& 
-PB_ASSOC_CLASS_C_DEC::
-get_cmp_fn()
-{
-  return (*this);
-}
-
-PB_ASSOC_CLASS_T_DEC
-const Cmp_Fn& 
-PB_ASSOC_CLASS_C_DEC::
-get_cmp_fn() const
-{
-  return (*this);
-}
-
-PB_ASSOC_CLASS_T_DEC
-Node_Updator& 
-PB_ASSOC_CLASS_C_DEC::
-get_node_updator()
-{
-  return (*this);
-}
-
-PB_ASSOC_CLASS_T_DEC
-const Node_Updator& 
-PB_ASSOC_CLASS_C_DEC::
-get_node_updator() const
-{
-  return (*this);
-}
-
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/basic_tree_assoc_cntnr/r_erase_fn_imps.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/basic_tree_assoc_cntnr/r_erase_fn_imps.hpp
deleted file mode 100644
index f6f13e1dbbe..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/basic_tree_assoc_cntnr/r_erase_fn_imps.hpp
+++ /dev/null
@@ -1,44 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file erase_fn_imps.hpp
- * Contains implementations of rb_tree's find related functions,
- *	common to all tree container types.
- */
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/basic_tree_assoc_cntnr/r_range_iteration_fn_imps.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/basic_tree_assoc_cntnr/r_range_iteration_fn_imps.hpp
deleted file mode 100644
index bdeb1d352bb..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/basic_tree_assoc_cntnr/r_range_iteration_fn_imps.hpp
+++ /dev/null
@@ -1,43 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file range_iteration_fn_imps.hpp
- * Contains a rb_tree set implementation.
- */
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/basic_tree_assoc_cntnr/range_iteration_fn_imps.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/basic_tree_assoc_cntnr/range_iteration_fn_imps.hpp
deleted file mode 100644
index bdeb1d352bb..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/basic_tree_assoc_cntnr/range_iteration_fn_imps.hpp
+++ /dev/null
@@ -1,43 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file range_iteration_fn_imps.hpp
- * Contains a rb_tree set implementation.
- */
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/basic_tree_assoc_cntnr/split_join_fn_imps.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/basic_tree_assoc_cntnr/split_join_fn_imps.hpp
deleted file mode 100644
index b8c46562a9b..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/basic_tree_assoc_cntnr/split_join_fn_imps.hpp
+++ /dev/null
@@ -1,60 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file split_join_fn_imps.hpp
- * Contains implementation of rb trees
- */
-
-PB_ASSOC_CLASS_T_DEC
-inline void
-PB_ASSOC_CLASS_C_DEC::
-join(PB_ASSOC_CLASS_C_DEC& r_other)
-{
-  return (my_base::join(r_other));
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline void
-PB_ASSOC_CLASS_C_DEC::
-split(const_key_reference r_key, PB_ASSOC_CLASS_C_DEC& r_other)
-{
-  my_base::split(r_key, r_other);
-}
-
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/bin_search_tree_/bin_search_tree_.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/bin_search_tree_/bin_search_tree_.hpp
deleted file mode 100644
index b450f539807..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/bin_search_tree_/bin_search_tree_.hpp
+++ /dev/null
@@ -1,525 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/*
- * @file bin_search_tree_.hpp
- * Contains an implementation class for bin_search_tree_.
- */
-/*
- * This implementation uses an idea from the SGI STL (using a "header" node
- *	which is needed for efficient iteration).
- */
-
-#include <ext/pb_assoc/exception.hpp>
-#include <ext/pb_assoc/detail/eq_fn/eq_by_less.hpp>
-#include <ext/pb_assoc/detail/types_traits.hpp>
-#include <ext/pb_assoc/detail/map_debug_base.hpp>
-#include <ext/pb_assoc/tree_policy.hpp>
-#include <ext/pb_assoc/detail/cond_dealtor.hpp>
-#include <ext/pb_assoc/detail/type_utils.hpp>
-#include <utility>
-#include <functional>
-#include <assert.h>
-
-namespace pb_assoc
-{
-
-  namespace detail
-  {
-
-#ifdef PB_ASSOC_BIN_SEARCH_TREE_DEBUG_
-#define PB_ASSOC_DBG_ASSERT(X) assert(X)
-#define PB_ASSOC_DBG_VERIFY(X) assert(X)
-#define PB_ASSOC_DBG_ONLY(X) X
-#else // #ifdef PB_ASSOC_BIN_SEARCH_TREE_DEBUG_
-#define PB_ASSOC_DBG_ASSERT(X)
-#define PB_ASSOC_DBG_VERIFY(X) {if((X)==0);}
-#define PB_ASSOC_DBG_ONLY(X) ;
-#endif // #ifdef PB_ASSOC_BIN_SEARCH_TREE_DEBUG_
-
-#define PB_ASSOC_CLASS_T_DEC \
-	template< \
-		typename Key, \
-		typename Data, \
-		class Node, \
-		class Cmp_Fn, \
-		class Allocator, \
-		class Node_Updator>
-
-#ifdef PB_ASSOC_DATA_TRUE_INDICATOR
-#define PB_ASSOC_CLASS_NAME \
-	bin_search_tree_data_
-#endif // #ifdef PB_ASSOC_DATA_TRUE_INDICATOR
-
-#ifdef PB_ASSOC_DATA_FALSE_INDICATOR
-#define PB_ASSOC_CLASS_NAME \
-	bin_search_tree_no_data_
-#endif // #ifdef PB_ASSOC_DATA_FALSE_INDICATOR
-
-#define PB_ASSOC_CLASS_C_DEC \
-	PB_ASSOC_CLASS_NAME< \
-		Key, \
-		Data, \
-		Node, \
-		Cmp_Fn, \
-		Allocator, \
-		Node_Updator>
-
-#define PB_ASSOC_TYPES_TRAITS_C_DEC \
-	pb_assoc::detail::types_traits< \
-		Key, \
-		Data, \
-		Allocator>
-
-#ifdef PB_ASSOC_USE_MAP_DEBUG_BASE
-#define PB_ASSOC_MAP_DEBUG_BASE_C_DEC \
-	pb_assoc::detail::map_debug_base< \
-		Key, \
-		eq_by_less<Key, Cmp_Fn> >
-#endif // #ifdef PB_ASSOC_USE_MAP_DEBUG_BASE
-
-#ifdef PB_ASSOC_DATA_TRUE_INDICATOR
-#define PB_ASSOC_V2F(X) (X).first
-#define PB_ASSOC_V2S(X) (X).second
-#define PB_ASSOC_EP2VP(X)& ((X)->m_value)
-#endif // #ifdef PB_ASSOC_DATA_TRUE_INDICATOR
-
-#ifdef PB_ASSOC_DATA_FALSE_INDICATOR
-#define PB_ASSOC_V2F(X) (X)
-#define PB_ASSOC_V2S(X) Mapped_Data()
-#define PB_ASSOC_EP2VP(X)& ((X)->m_value.first)
-#endif // #ifdef PB_ASSOC_DATA_FALSE_INDICATOR
-
-    template<typename Key,
-	     typename Data,
-	     class Node,
-	     class Cmp_Fn,
-	     class Allocator,
-	     class Node_Updator>
-    class PB_ASSOC_CLASS_NAME :
-#ifdef PB_ASSOC_BIN_SEARCH_TREE_DEBUG_
-      protected PB_ASSOC_MAP_DEBUG_BASE_C_DEC,
-#endif // #ifdef PB_ASSOC_BIN_SEARCH_TREE_DEBUG_
-      protected Cmp_Fn,
-      public PB_ASSOC_TYPES_TRAITS_C_DEC,
-      public Node_Updator
-    {
-
-    protected:
-
-      typedef typename Allocator::size_type size_type;
-
-      typedef
-      typename PB_ASSOC_TYPES_TRAITS_C_DEC::const_key_reference
-      const_key_reference;
-
-      typedef typename PB_ASSOC_TYPES_TRAITS_C_DEC::data_type data_type;
-
-      typedef
-      typename PB_ASSOC_TYPES_TRAITS_C_DEC::data_reference
-      data_reference;
-
-      typedef
-      typename PB_ASSOC_TYPES_TRAITS_C_DEC::const_data_reference
-      const_data_reference;
-
-      typedef typename PB_ASSOC_TYPES_TRAITS_C_DEC::value_type value_type;
-
-      typedef typename PB_ASSOC_TYPES_TRAITS_C_DEC::pointer pointer;
-
-      typedef
-      typename PB_ASSOC_TYPES_TRAITS_C_DEC::const_pointer
-      const_pointer;
-
-      typedef typename PB_ASSOC_TYPES_TRAITS_C_DEC::reference reference;
-
-      typedef
-      typename PB_ASSOC_TYPES_TRAITS_C_DEC::const_reference
-      const_reference;
-
-      typedef PB_ASSOC_TYPES_TRAITS_C_DEC my_traits_base;
-
-      typedef Node node;
-
-      typedef
-      pb_assoc::detail::cond_dealtor<
-	node,
-	Allocator>
-      cond_dealtor_t;
-
-      typedef
-      typename Allocator::template rebind<node>::other
-      node_allocator;
-
-      typedef typename node_allocator::value_type node_type;
-
-      typedef typename node_allocator::pointer node_pointer;
-
-      typedef value_type mapped_value_type;
-
-      typedef reference mapped_reference;
-
-      typedef const_reference const_mapped_reference;
-
-      typedef pointer mapped_pointer;
-
-      typedef const_pointer const_mapped_pointer;
-
-#include <ext/pb_assoc/detail/bin_search_tree_/find_iterators.hpp>
-
-      typedef const_it_<true> const_find_iterator;
-
-      typedef it_<true> find_iterator;
-
-      typedef const_find_iterator const_iterator;
-
-      typedef find_iterator iterator;
-
-      typedef const_it_<false> const_reverse_iterator;
-
-      typedef it_<false> reverse_iterator;
-
-#include <ext/pb_assoc/detail/bin_search_tree_/node_iterators.hpp>
-
-      typedef const_node_it_ const_node_iterator;
-
-      typedef node_it_ node_iterator;
-
-      typedef Cmp_Fn cmp_fn;
-
-      typedef Allocator allocator;
-
-    private:
-
-#ifdef PB_ASSOC_BIN_SEARCH_TREE_DEBUG_
-      typedef PB_ASSOC_MAP_DEBUG_BASE_C_DEC my_map_debug_base;
-#endif // #ifdef PB_ASSOC_BIN_SEARCH_TREE_DEBUG_
-
-    protected:
-
-      PB_ASSOC_CLASS_NAME();
-
-      PB_ASSOC_CLASS_NAME(const Cmp_Fn& r_cmp_fn);
-
-      PB_ASSOC_CLASS_NAME(const Cmp_Fn& r_cmp_fn, const Node_Updator& r_updator);
-
-      PB_ASSOC_CLASS_NAME(const PB_ASSOC_CLASS_C_DEC& r_other);
-
-      void
-      swap(PB_ASSOC_CLASS_C_DEC& r_other);
-
-      ~PB_ASSOC_CLASS_NAME();
-
-      void
-      initialize_min_max();
-
-      template<class Other_Map_Type>
-      bool
-      cmp_with_other(const Other_Map_Type& r_other) const;
-
-      inline bool
-      empty() const;
-
-      inline size_type
-      size() const;
-
-      inline size_type
-      max_size() const;
-
-      Cmp_Fn& 
-      get_cmp_fn();
-
-      const Cmp_Fn& 
-      get_cmp_fn() const;
-
-      inline std::pair<find_iterator, bool>
-      insert_leaf(const_reference r_value);
-
-      inline find_iterator
-      lower_bound(const_key_reference r_key);
-
-      inline const_find_iterator
-      lower_bound(const_key_reference r_key) const;
-
-      inline find_iterator
-      upper_bound(const_key_reference r_key);
-
-      inline const_find_iterator
-      upper_bound(const_key_reference r_key) const;
-
-      inline find_iterator
-      find(const_key_reference r_key);
-
-      inline const_find_iterator
-      find(const_key_reference r_key) const;
-
-      inline void
-      update_min_max_for_erased_node(node_pointer p_nd);
-
-      inline void
-      actual_erase_node(node_pointer p_nd);
-
-      void
-      clear();
-
-      inline void
-      rotate_left(node_pointer p_x);
-
-      inline void
-      rotate_right(node_pointer p_y);
-
-      inline void
-      rotate_parent(node_pointer p_nd);
-
-      inline void
-      apply_update(node_pointer p_nd, pb_assoc::null_node_updator* );
-
-      template<class Node_Updator_>
-      inline void
-      apply_update(node_pointer p_nd, Node_Updator_* p_updator);
-
-      template<class Node_Updator_>
-      inline void
-      update_to_top(node_pointer p_nd, Node_Updator_* p_updator);
-
-      inline void
-      update_to_top(node_pointer p_nd, pb_assoc::null_node_updator* );
-
-      inline iterator
-      begin();
-
-      inline const_iterator
-      begin() const;
-
-      inline iterator
-      find_end();
-
-      inline const_iterator
-      find_end() const;
-
-      inline iterator
-      end();
-
-      inline const_iterator
-      end() const;
-
-      inline reverse_iterator
-      rbegin()
-      {
-	return (reverse_iterator(m_p_head->m_p_right));
-      }
-
-      inline const_reverse_iterator
-      rbegin() const;
-
-      inline reverse_iterator
-      find_rend();
-
-      inline const_reverse_iterator
-      find_rend() const;
-
-      inline reverse_iterator
-      rend();
-
-      inline const_reverse_iterator
-      rend() const;
-
-      bool
-      join_prep(PB_ASSOC_CLASS_C_DEC& r_other);
-
-      void
-      join_finish(PB_ASSOC_CLASS_C_DEC& r_other);
-
-      bool
-      split_prep(const_key_reference r_key, PB_ASSOC_CLASS_C_DEC& r_other);
-
-      void
-      split_finish(PB_ASSOC_CLASS_C_DEC& r_other);
-
-      size_type
-      recursive_count(node_pointer p_nd) const;
-
-      inline const_node_iterator
-      node_begin() const;
-
-      inline node_iterator
-      node_begin();
-
-      inline const_node_iterator
-      node_end() const;
-
-      inline node_iterator
-      node_end();
-
-    private:
-
-      inline std::pair<node_pointer, bool>
-      erase(node_pointer p_nd);
-
-#ifdef PB_ASSOC_BIN_SEARCH_TREE_DEBUG_
-
-      void
-      assert_valid(bool check_iterators, bool check_metadata) const;
-
-      std::pair<const_pointer, const_pointer>
-      assert_node_consistent(const node_pointer p_nd) const
-      {
-	if (p_nd == NULL)
-	  return (std::make_pair((const_pointer)NULL,(const_pointer)NULL));
-
-	assert_node_consistent_with_left(p_nd);
-	assert_node_consistent_with_right(p_nd);
-
-	const std::pair<const_pointer, const_pointer>
-	  l_range =
-	  assert_node_consistent(p_nd->m_p_left);
-
-	if (l_range.second != NULL)
-	  PB_ASSOC_DBG_ASSERT(Cmp_Fn::operator()(
-						 PB_ASSOC_V2F(*l_range.second),
-						 PB_ASSOC_V2F(p_nd->m_value)));
-
-	const std::pair<const_pointer, const_pointer>
-	  r_range =
-	  assert_node_consistent(p_nd->m_p_right);
-
-	if (r_range.first != NULL)
-	  PB_ASSOC_DBG_ASSERT(Cmp_Fn::operator()(
-						 PB_ASSOC_V2F(p_nd->m_value),
-						 PB_ASSOC_V2F(*r_range.first)));
-
-	return (std::make_pair((l_range.first != NULL)? l_range.first :& p_nd->m_value,(r_range.second != NULL)? r_range.second :& p_nd->m_value));
-      }
-
-      void
-      assert_consistent_with_debug_base() const;
-
-      void
-      assert_node_consistent_with_left(const node_pointer p_nd) const;
-
-      void
-      assert_node_consistent_with_right(const node_pointer p_nd) const;
-
-      void
-      assert_consistent_with_debug_base(const node_pointer p_nd) const;
-
-      void
-      assert_min() const;
-
-      void
-      assert_min_imp(const node_pointer p_nd) const;
-
-      void
-      assert_max() const;
-
-      void
-      assert_max_imp(const node_pointer p_nd) const;
-
-      void
-      assert_iterators() const;
-
-      void
-      assert_size() const;
-
-#endif // #ifdef PB_ASSOC_BIN_SEARCH_TREE_DEBUG_
-
-      void
-      initialize();
-
-      node_pointer
-      recursive_copy_node(const node_pointer p_nd);
-
-      inline node_pointer
-      get_new_node_for_leaf_insert(const_reference r_val, pb_assoc::detail::int_to_type<false>);
-
-      inline node_pointer
-      get_new_node_for_leaf_insert(const_reference r_val, pb_assoc::detail::int_to_type<true>);
-
-      inline iterator
-      insert_imp_empty(const_reference r_value);
-
-      inline iterator
-      insert_leaf_new(const_reference r_value, node_pointer p_nd, bool left_nd);
-
-      static void
-      clear_imp(node_pointer p_nd);
-
-    protected:
-      node_pointer m_p_head;
-
-      iterator m_end_it;
-
-      reverse_iterator m_rend_it;
-
-      size_type m_size;
-
-      static node_allocator s_node_allocator;
-    };
-
-#include <ext/pb_assoc/detail/bin_search_tree_/constructors_destructor_fn_imps.hpp>
-#include <ext/pb_assoc/detail/bin_search_tree_/iterators_fn_imps.hpp>
-#include <ext/pb_assoc/detail/bin_search_tree_/debug_fn_imps.hpp>
-#include <ext/pb_assoc/detail/bin_search_tree_/insert_fn_imps.hpp>
-#include <ext/pb_assoc/detail/bin_search_tree_/erase_fn_imps.hpp>
-#include <ext/pb_assoc/detail/bin_search_tree_/find_fn_imps.hpp>
-#include <ext/pb_assoc/detail/bin_search_tree_/info_fn_imps.hpp>
-#include <ext/pb_assoc/detail/bin_search_tree_/split_join_fn_imps.hpp>
-#include <ext/pb_assoc/detail/bin_search_tree_/rotate_fn_imps.hpp>
-
-#undef PB_ASSOC_CLASS_C_DEC
-
-#undef PB_ASSOC_CLASS_T_DEC
-
-#undef PB_ASSOC_CLASS_NAME
-
-#undef PB_ASSOC_TYPES_TRAITS_C_DEC
-
-#undef PB_ASSOC_MAP_DEBUG_BASE_C_DEC
-
-#undef PB_ASSOC_V2F
-#undef PB_ASSOC_EP2VP
-#undef PB_ASSOC_V2S
-
-#undef PB_ASSOC_DBG_ASSERT
-#undef PB_ASSOC_DBG_VERIFY
-#undef PB_ASSOC_DBG_ONLY
-
-  } // namespace detail
-
-} // namespace pb_assoc
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/bin_search_tree_/cond_dtor_entry_dealtor.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/bin_search_tree_/cond_dtor_entry_dealtor.hpp
deleted file mode 100644
index 37048874f5a..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/bin_search_tree_/cond_dtor_entry_dealtor.hpp
+++ /dev/null
@@ -1,74 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file cond_dtor_entry_dealtor.hpp
- * Contains a binary tree container conditional deallocator
- */
-
-class bin_search_tree_cond_dtor_entry_dealtor_
-{
-public:
-  inline
-  bin_search_tree_cond_dtor_entry_dealtor_(node_pointer p_nd) : m_p_nd(p_nd),
-								m_no_action_dtor(false)
-  { }
-
-  inline void
-  set_no_action_dtor()
-  {
-    m_no_action_dtor = true;
-  }
-
-  inline
-  ~bin_search_tree_cond_dtor_entry_dealtor_()
-  {
-    if (m_no_action_dtor)
-      return;
-
-    typename Allocator::template rebind<Node>::other().
-      deallocate(m_p_nd, 1);
-  }
-
-protected:
-  node_pointer m_p_nd;
-
-  bool m_no_action_dtor;
-};
-
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/bin_search_tree_/cond_key_dtor_entry_dealtor.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/bin_search_tree_/cond_key_dtor_entry_dealtor.hpp
deleted file mode 100644
index 022404fb66d..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/bin_search_tree_/cond_key_dtor_entry_dealtor.hpp
+++ /dev/null
@@ -1,85 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file cond_key_dtor_entry_dealtor.hpp
- * Contains a binary tree container conditional deallocator
- */
-
-class bin_seach_tree_cond_key_dtor_entry_dealtor_
-{
-public:
-  inline
-  bin_seach_tree_cond_key_dtor_entry_dealtor_(node_pointer p_nd) : m_p_nd(p_nd),
-								   m_no_action_dtor(false),
-								   m_key_destruct(false)
-  { }
-
-  inline void
-  set_no_action_dtor()
-  {
-    m_no_action_dtor = true;
-  }
-
-  inline void
-  set_key_destruct()
-  {
-    m_key_destruct = true;
-  }
-
-  inline
-  ~bin_seach_tree_cond_key_dtor_entry_dealtor_()
-  {
-    if (m_no_action_dtor)
-      return;
-
-    if (m_key_destruct)
-      m_p_nd->m_value.first.~Key();
-
-    my_bin_tree_base::s_alloc.deallocate(m_p_nd, 1);
-  }
-
-protected:
-  node_pointer m_p_nd;
-
-  bool m_no_action_dtor;
-
-  bool m_key_destruct;
-};
-
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/bin_search_tree_/constructors_destructor_fn_imps.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/bin_search_tree_/constructors_destructor_fn_imps.hpp
deleted file mode 100644
index 4020e62f4f7..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/bin_search_tree_/constructors_destructor_fn_imps.hpp
+++ /dev/null
@@ -1,258 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file constructors_destructor_fn_imps.hpp
- * Contains an implementation class for bin_search_tree_.
- */
-
-PB_ASSOC_CLASS_T_DEC
-typename PB_ASSOC_CLASS_C_DEC::node_allocator
-PB_ASSOC_CLASS_C_DEC::s_node_allocator;
-
-PB_ASSOC_CLASS_T_DEC
-PB_ASSOC_CLASS_C_DEC::
-PB_ASSOC_CLASS_NAME() :
-  m_p_head(s_node_allocator.allocate(1)),
-  m_end_it(m_p_head),
-  m_rend_it(m_p_head),
-  m_size(0)
-{
-  initialize();
-
-  PB_ASSOC_DBG_ONLY(assert_valid(true, true);)
-    }
-
-PB_ASSOC_CLASS_T_DEC
-PB_ASSOC_CLASS_C_DEC::
-PB_ASSOC_CLASS_NAME(const Cmp_Fn& r_cmp_fn) :
-  Cmp_Fn(r_cmp_fn),
-  m_p_head(s_node_allocator.allocate(1)),
-  m_end_it(m_p_head),
-  m_rend_it(m_p_head),
-  m_size(0)
-{
-  initialize();
-
-  PB_ASSOC_DBG_ONLY(assert_valid(true, true);)
-    }
-
-PB_ASSOC_CLASS_T_DEC
-PB_ASSOC_CLASS_C_DEC::
-PB_ASSOC_CLASS_NAME(const Cmp_Fn& r_cmp_fn, const Node_Updator& r_node_updator) :
-  Cmp_Fn(r_cmp_fn),
-  Node_Updator(r_node_updator),
-  m_p_head(s_node_allocator.allocate(1)),
-  m_end_it(m_p_head),
-  m_rend_it(m_p_head),
-  m_size(0)
-{
-  initialize();
-
-  PB_ASSOC_DBG_ONLY(assert_valid(true, true);)
-    }
-
-PB_ASSOC_CLASS_T_DEC
-PB_ASSOC_CLASS_C_DEC::
-PB_ASSOC_CLASS_NAME(const PB_ASSOC_CLASS_C_DEC& r_other) :
-#ifdef PB_ASSOC_BIN_SEARCH_TREE_DEBUG_
-  my_map_debug_base(r_other),
-#endif // #ifdef PB_ASSOC_BIN_SEARCH_TREE_DEBUG_
-  Cmp_Fn(r_other),
-  Node_Updator(r_other),
-  m_p_head(s_node_allocator.allocate(1)),
-  m_end_it(m_p_head),
-  m_rend_it(m_p_head),
-  m_size(0)
-{
-  initialize();
-
-  m_size = r_other.m_size;
-
-  PB_ASSOC_DBG_ONLY(r_other.assert_valid(true, true);)
-
-    try
-      {
-	m_p_head->m_p_parent =
-	  recursive_copy_node(r_other.m_p_head->m_p_parent);
-
-	if (m_p_head->m_p_parent != NULL)
-	  m_p_head->m_p_parent->m_p_parent = m_p_head;
-
-	m_size = r_other.m_size;
-
-	initialize_min_max();
-      }
-    catch(...)
-      {
-	PB_ASSOC_DBG_ONLY(my_map_debug_base::clear();)
-
-	  s_node_allocator.deallocate(m_p_head, 1);
-
-	throw;
-      }
-
-  PB_ASSOC_DBG_ONLY(assert_valid(true, true);)
-    }
-
-PB_ASSOC_CLASS_T_DEC
-void
-PB_ASSOC_CLASS_C_DEC::
-swap(PB_ASSOC_CLASS_C_DEC& r_other)
-{
-  PB_ASSOC_DBG_ONLY(assert_valid(true, true);)
-    PB_ASSOC_DBG_ONLY(r_other.assert_valid(true, true);)
-
-    PB_ASSOC_DBG_ONLY(my_map_debug_base::swap(r_other);)
-
-    std::swap(m_p_head, r_other.m_p_head);
-
-  std::swap(m_size, r_other.m_size);
-
-  std::swap(m_end_it, r_other.m_end_it);
-
-  std::swap(m_rend_it, r_other.m_rend_it);
-
-  std::swap((Cmp_Fn& )(*this), (Cmp_Fn& )r_other);
-
-  Node_Updator::swap(r_other);
-
-  PB_ASSOC_DBG_ONLY(assert_valid(true, true);)
-    PB_ASSOC_DBG_ONLY(r_other.assert_valid(true, true);)
-    }
-
-PB_ASSOC_CLASS_T_DEC
-PB_ASSOC_CLASS_C_DEC::
-~PB_ASSOC_CLASS_NAME()
-{
-  clear();
-
-  s_node_allocator.deallocate(m_p_head, 1);
-}
-
-PB_ASSOC_CLASS_T_DEC
-void
-PB_ASSOC_CLASS_C_DEC::
-initialize()
-{
-  m_p_head->m_p_parent = NULL;
-  m_p_head->m_p_left = m_p_head;
-  m_p_head->m_p_right = m_p_head;
-
-  m_size = 0;
-}
-
-PB_ASSOC_CLASS_T_DEC
-typename PB_ASSOC_CLASS_C_DEC::node_pointer
-PB_ASSOC_CLASS_C_DEC::
-recursive_copy_node(const node_pointer p_nd)
-{
-  if (p_nd == NULL)
-    return (NULL);
-
-  node_pointer p_ret = s_node_allocator.allocate(1);
-
-  try
-    {
-      new (p_ret) node(*p_nd);
-    }
-  catch(...)
-    {
-      s_node_allocator.deallocate(p_ret, 1);
-
-      throw;
-    }
-
-  p_ret->m_p_left = p_ret->m_p_right = NULL;
-
-  try
-    {
-      p_ret->m_p_left = recursive_copy_node(p_nd->m_p_left);
-
-      p_ret->m_p_right = recursive_copy_node(p_nd->m_p_right);
-    }
-  catch(...)
-    {
-      clear_imp(p_ret);
-
-      throw;
-    }
-
-  if (p_ret->m_p_left != NULL)
-    p_ret->m_p_left->m_p_parent = p_ret;
-
-  if (p_ret->m_p_right != NULL)
-    p_ret->m_p_right->m_p_parent = p_ret;
-
-  PB_ASSOC_DBG_ONLY(assert_node_consistent(p_ret);)
-
-    return (p_ret);
-}
-
-PB_ASSOC_CLASS_T_DEC
-void
-PB_ASSOC_CLASS_C_DEC::
-initialize_min_max()
-{
-  if (m_p_head->m_p_parent == NULL)
-    {
-      m_p_head->m_p_left = m_p_head->m_p_right = m_p_head;
-
-      return;
-    }
-
-  {
-    node_pointer p_min = m_p_head->m_p_parent;
-
-    while (p_min->m_p_left != NULL)
-      p_min = p_min->m_p_left;
-
-    m_p_head->m_p_left = p_min;
-  }
-
-  {
-    node_pointer p_max = m_p_head->m_p_parent;
-
-    while (p_max->m_p_right != NULL)
-      p_max = p_max->m_p_right;
-
-    m_p_head->m_p_right = p_max;
-  }
-}
-
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/bin_search_tree_/debug_fn_imps.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/bin_search_tree_/debug_fn_imps.hpp
deleted file mode 100644
index f3b12d06d6f..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/bin_search_tree_/debug_fn_imps.hpp
+++ /dev/null
@@ -1,278 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file debug_fn_imps.hpp
- * Contains an implementation class for bin_search_tree_.
- */
-
-#ifdef PB_ASSOC_BIN_SEARCH_TREE_DEBUG_
-
-PB_ASSOC_CLASS_T_DEC
-void
-PB_ASSOC_CLASS_C_DEC::
-assert_valid(bool check_iterators, bool check_metadata) const
-{
-  PB_ASSOC_DBG_ASSERT(m_p_head != NULL);
-
-  if (m_p_head->m_p_parent == NULL)
-    {
-      PB_ASSOC_DBG_ASSERT(m_p_head->m_p_left == m_p_head);
-      PB_ASSOC_DBG_ASSERT(m_p_head->m_p_right == m_p_head);
-
-      if (check_metadata)
-	PB_ASSOC_DBG_ASSERT(m_size == 0);
-    }
-  else
-    {
-      PB_ASSOC_DBG_ASSERT(m_p_head->m_p_parent->m_p_parent == m_p_head);
-
-      PB_ASSOC_DBG_ASSERT(m_p_head->m_p_left != m_p_head);
-      PB_ASSOC_DBG_ASSERT(m_p_head->m_p_right != m_p_head);
-
-      if (check_metadata)
-	PB_ASSOC_DBG_ASSERT(m_size > 0);
-    }
-
-  if (check_metadata)
-    assert_size();
-
-  if (m_p_head->m_p_parent != NULL)
-    assert_node_consistent(m_p_head->m_p_parent);
-
-  assert_min();
-  assert_max();
-
-  if (check_metadata)
-    assert_consistent_with_debug_base();
-
-  if (check_iterators&&  check_metadata)
-    assert_iterators();
-}
-
-PB_ASSOC_CLASS_T_DEC
-void
-PB_ASSOC_CLASS_C_DEC::
-assert_node_consistent_with_left(const node_pointer p_nd) const
-{
-  if (p_nd->m_p_left == NULL)
-    return;
-
-  PB_ASSOC_DBG_ASSERT(p_nd->m_p_left->m_p_parent == p_nd);
-
-  PB_ASSOC_DBG_ASSERT(!Cmp_Fn::operator()(
-					  PB_ASSOC_V2F(p_nd->m_value),
-					  PB_ASSOC_V2F(p_nd->m_p_left->m_value)));
-}
-
-PB_ASSOC_CLASS_T_DEC
-void
-PB_ASSOC_CLASS_C_DEC::
-assert_node_consistent_with_right(const node_pointer p_nd) const
-{
-  if (p_nd->m_p_right == NULL)
-    return;
-
-  PB_ASSOC_DBG_ASSERT(p_nd->m_p_right->m_p_parent == p_nd);
-
-  PB_ASSOC_DBG_ASSERT(!Cmp_Fn::operator()(
-					  PB_ASSOC_V2F(p_nd->m_p_right->m_value),
-					  PB_ASSOC_V2F(p_nd->m_value)));
-}
-
-PB_ASSOC_CLASS_T_DEC
-void
-PB_ASSOC_CLASS_C_DEC::
-assert_min() const
-{
-  assert_min_imp(m_p_head->m_p_parent);
-}
-
-PB_ASSOC_CLASS_T_DEC
-void
-PB_ASSOC_CLASS_C_DEC::
-assert_min_imp(const node_pointer p_nd) const
-{
-  if (p_nd == NULL)
-    {
-      PB_ASSOC_DBG_ASSERT(m_p_head->m_p_left == m_p_head);
-
-      return;
-    }
-
-  if (p_nd->m_p_left == NULL)
-    {
-      PB_ASSOC_DBG_ASSERT(p_nd == m_p_head->m_p_left);
-
-      return;
-    }
-
-  assert_min_imp(p_nd->m_p_left);
-}
-
-PB_ASSOC_CLASS_T_DEC
-void
-PB_ASSOC_CLASS_C_DEC::
-assert_max() const
-{
-  assert_max_imp(m_p_head->m_p_parent);
-}
-
-PB_ASSOC_CLASS_T_DEC
-void
-PB_ASSOC_CLASS_C_DEC::
-assert_max_imp(const node_pointer p_nd) const
-{
-  if (p_nd == NULL)
-    {
-      PB_ASSOC_DBG_ASSERT(m_p_head->m_p_right == m_p_head);
-
-      return;
-    }
-
-  if (p_nd->m_p_right == NULL)
-    {
-      PB_ASSOC_DBG_ASSERT(p_nd == m_p_head->m_p_right);
-
-      return;
-    }
-
-  assert_max_imp(p_nd->m_p_right);
-}
-
-PB_ASSOC_CLASS_T_DEC
-void
-PB_ASSOC_CLASS_C_DEC::
-assert_iterators() const
-{
-  PB_ASSOC_DBG_ASSERT(m_end_it.m_p_nd == m_p_head);
-  PB_ASSOC_DBG_ASSERT(m_rend_it.m_p_nd == m_p_head);
-
-  size_type iterated_num = 0;
-
-  const_iterator prev_it = end();
-
-  for (const_iterator it = begin(); it != end(); ++it)
-    {
-      ++iterated_num;
-
-      PB_ASSOC_DBG_ASSERT(lower_bound(
-				      PB_ASSOC_V2F(*it)).m_p_nd == it.m_p_nd);
-
-      const_iterator upper_bound_it = upper_bound(
-						  PB_ASSOC_V2F(*it));
-
-      --upper_bound_it;
-
-      PB_ASSOC_DBG_ASSERT(upper_bound_it.m_p_nd == it.m_p_nd);
-
-      if (prev_it != end())
-	PB_ASSOC_DBG_ASSERT(Cmp_Fn::operator()(
-					       PB_ASSOC_V2F(*prev_it),
-					       PB_ASSOC_V2F(*it)));
-
-      prev_it = it;
-    }
-
-  PB_ASSOC_DBG_ASSERT(iterated_num == m_size);
-
-  size_type reverse_iterated_num = 0;
-
-  const_reverse_iterator reverse_prev_it = rend();
-
-  for (const_reverse_iterator reverse_it = rbegin(); reverse_it != rend();
-       ++reverse_it)
-    {
-      ++reverse_iterated_num;
-
-      PB_ASSOC_DBG_ASSERT(lower_bound(
-				      PB_ASSOC_V2F(*reverse_it)).m_p_nd == reverse_it.m_p_nd);
-
-      const_iterator upper_bound_it = upper_bound(
-						  PB_ASSOC_V2F(*reverse_it));
-
-      --upper_bound_it;
-
-      PB_ASSOC_DBG_ASSERT(upper_bound_it.m_p_nd == reverse_it.m_p_nd);
-
-      if (reverse_prev_it != rend())
-	PB_ASSOC_DBG_ASSERT(!Cmp_Fn::operator()(
-						PB_ASSOC_V2F(*reverse_prev_it),
-						PB_ASSOC_V2F(*reverse_it)));
-
-      reverse_prev_it = reverse_it;
-    }
-
-  PB_ASSOC_DBG_ASSERT(reverse_iterated_num == m_size);
-}
-
-PB_ASSOC_CLASS_T_DEC
-void
-PB_ASSOC_CLASS_C_DEC::
-assert_consistent_with_debug_base() const
-{
-  my_map_debug_base::check_size(m_size);
-
-  assert_consistent_with_debug_base(m_p_head->m_p_parent);
-}
-
-PB_ASSOC_CLASS_T_DEC
-void
-PB_ASSOC_CLASS_C_DEC::
-assert_consistent_with_debug_base(const node_pointer p_nd) const
-{
-  if (p_nd == NULL)
-    return;
-
-  my_map_debug_base::check_key_exists(
-				      PB_ASSOC_V2F(p_nd->m_value));
-
-  assert_consistent_with_debug_base(p_nd->m_p_left);
-  assert_consistent_with_debug_base(p_nd->m_p_right);
-}
-
-PB_ASSOC_CLASS_T_DEC
-void
-PB_ASSOC_CLASS_C_DEC::
-assert_size() const
-{
-  PB_ASSOC_DBG_ASSERT(recursive_count(m_p_head->m_p_parent) == m_size);
-}
-
-#endif // #ifdef PB_ASSOC_BIN_SEARCH_TREE_DEBUG_
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/bin_search_tree_/erase_fn_imps.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/bin_search_tree_/erase_fn_imps.hpp
deleted file mode 100644
index cceea5134ee..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/bin_search_tree_/erase_fn_imps.hpp
+++ /dev/null
@@ -1,124 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file erase_fn_imps.hpp
- * Contains an implementation class for bin_search_tree_.
- */
-
-PB_ASSOC_CLASS_T_DEC
-inline void
-PB_ASSOC_CLASS_C_DEC::
-actual_erase_node(node_pointer p_z)
-{
-  PB_ASSOC_DBG_ASSERT(m_size > 0);
-  --m_size;
-
-  PB_ASSOC_DBG_ONLY(erase_existing(PB_ASSOC_V2F(p_z->m_value)));
-
-  p_z->~node();
-
-  s_node_allocator.deallocate(p_z, 1);
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline void
-PB_ASSOC_CLASS_C_DEC::
-update_min_max_for_erased_node(node_pointer p_z)
-{
-  if (m_size == 1)
-    {
-      m_p_head->m_p_left = m_p_head->m_p_right = m_p_head;
-
-      return;
-    }
-
-  if (m_p_head->m_p_left == p_z)
-    {
-      iterator it(p_z);
-
-      ++it;
-
-      m_p_head->m_p_left = it.m_p_nd;
-    }
-  else if (m_p_head->m_p_right == p_z)
-    {
-      iterator it(p_z);
-
-      --it;
-
-      m_p_head->m_p_right = it.m_p_nd;
-    }
-}
-
-PB_ASSOC_CLASS_T_DEC
-void
-PB_ASSOC_CLASS_C_DEC::
-clear()
-{
-  PB_ASSOC_DBG_ONLY(assert_valid(true, true);)
-
-    clear_imp(m_p_head->m_p_parent);
-
-  m_size = 0;
-
-  initialize();
-
-  PB_ASSOC_DBG_ONLY(my_map_debug_base::clear();)
-
-    PB_ASSOC_DBG_ONLY(assert_valid(true, true);)
-    }
-
-PB_ASSOC_CLASS_T_DEC
-void
-PB_ASSOC_CLASS_C_DEC::
-clear_imp(node_pointer p_nd)
-{
-  if (p_nd == NULL)
-    return;
-
-  clear_imp(p_nd->m_p_left);
-
-  clear_imp(p_nd->m_p_right);
-
-  p_nd->~Node();
-
-  s_node_allocator.deallocate(p_nd, 1);
-}
-
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/bin_search_tree_/find_fn_imps.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/bin_search_tree_/find_fn_imps.hpp
deleted file mode 100644
index 436cd25f861..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/bin_search_tree_/find_fn_imps.hpp
+++ /dev/null
@@ -1,184 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file find_fn_imps.hpp
- * Contains an implementation class for bin_search_tree_.
- */
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::const_find_iterator
-PB_ASSOC_CLASS_C_DEC::
-lower_bound(const_key_reference r_key) const
-{
-  node_pointer p_pot = m_p_head;
-  node_pointer p_nd = m_p_head->m_p_parent;
-
-  while (p_nd != NULL)
-    if (!Cmp_Fn::operator()(PB_ASSOC_V2F(p_nd->m_value), r_key))
-      {
-	p_pot = p_nd;
-
-	p_nd = p_nd->m_p_left;
-      }
-    else
-      p_nd = p_nd->m_p_right;
-
-  return (iterator(p_pot));
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::find_iterator
-PB_ASSOC_CLASS_C_DEC::
-lower_bound(const_key_reference r_key)
-{
-  node_pointer p_pot = m_p_head;
-  node_pointer p_nd = m_p_head->m_p_parent;
-
-  while (p_nd != NULL)
-    if (!Cmp_Fn::operator()(
-			    PB_ASSOC_V2F(p_nd->m_value),
-			    r_key))
-      {
-	p_pot = p_nd;
-
-	p_nd = p_nd->m_p_left;
-      }
-    else
-      p_nd = p_nd->m_p_right;
-
-  return (iterator(p_pot));
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::const_find_iterator
-PB_ASSOC_CLASS_C_DEC::
-upper_bound(const_key_reference r_key) const
-{
-  node_pointer p_pot = m_p_head;
-  node_pointer p_nd = m_p_head->m_p_parent;
-
-  while (p_nd != NULL)
-    if (Cmp_Fn::operator()(r_key,
-			   PB_ASSOC_V2F(p_nd->m_value)))
-      {
-	p_pot = p_nd,
-
-	  p_nd = p_nd->m_p_left;
-      }
-    else
-      p_nd = p_nd->m_p_right;
-
-  return (const_iterator(p_pot));
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::find_iterator
-PB_ASSOC_CLASS_C_DEC::
-upper_bound(const_key_reference r_key)
-{
-  node_pointer p_pot = m_p_head;
-  node_pointer p_nd = m_p_head->m_p_parent;
-
-  while (p_nd != NULL)
-    if (Cmp_Fn::operator()(r_key,
-			   PB_ASSOC_V2F(p_nd->m_value)))
-      {
-	p_pot = p_nd,
-
-	  p_nd = p_nd->m_p_left;
-      }
-    else
-      p_nd = p_nd->m_p_right;
-
-  return (find_iterator(p_pot));
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::find_iterator
-PB_ASSOC_CLASS_C_DEC::
-find(const_key_reference r_key)
-{
-  PB_ASSOC_DBG_ONLY(assert_valid(true, false);)
-
-    node_pointer p_pot = m_p_head;
-  node_pointer p_nd = m_p_head->m_p_parent;
-
-  while (p_nd != NULL)
-    if (!Cmp_Fn::operator()(PB_ASSOC_V2F(p_nd->m_value), r_key))
-      {
-	p_pot = p_nd;
-
-	p_nd = p_nd->m_p_left;
-      }
-    else
-      p_nd = p_nd->m_p_right;
-
-  return find_iterator((p_pot != m_p_head&&  Cmp_Fn::operator()(
-								r_key,
-								PB_ASSOC_V2F(p_pot->m_value)))?
-		       m_p_head : p_pot);
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::const_find_iterator
-PB_ASSOC_CLASS_C_DEC::
-find(const_key_reference r_key) const
-{
-  PB_ASSOC_DBG_ONLY(assert_valid(true, true);)
-
-    node_pointer p_pot = m_p_head;
-  node_pointer p_nd = m_p_head->m_p_parent;
-
-  while (p_nd != NULL)
-    if (!Cmp_Fn::operator()(PB_ASSOC_V2F(p_nd->m_value), r_key))
-      {
-	p_pot = p_nd;
-
-	p_nd = p_nd->m_p_left;
-      }
-    else
-      p_nd = p_nd->m_p_right;
-
-  return const_find_iterator((p_pot != m_p_head&&  Cmp_Fn::operator()(
-								      r_key,
-								      PB_ASSOC_V2F(p_pot->m_value)))?
-			     m_p_head : p_pot);
-}
-
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/bin_search_tree_/find_iterators.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/bin_search_tree_/find_iterators.hpp
deleted file mode 100644
index d6ddadc7a55..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/bin_search_tree_/find_iterators.hpp
+++ /dev/null
@@ -1,391 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file find_iterators.hpp
- * Contains an implementation class for bin_search_tree_.
- */
-
-#define PB_ASSOC_CONST_IT_C_DEC \
-	const_it_< \
-		Is_Forward_Iterator>
-
-#define PB_ASSOC_CONST_ODIR_IT_C_DEC \
-	const_it_< \
-		!Is_Forward_Iterator>
-
-#define PB_ASSOC_IT_C_DEC \
-	it_< \
-		Is_Forward_Iterator>
-
-#define PB_ASSOC_ODIR_IT_C_DEC \
-	it_< \
-		!Is_Forward_Iterator>
-
-template<bool Is_Forward_Iterator>
-class const_it_
-{
-
-public:
-
-  typedef std::bidirectional_iterator_tag iterator_category;
-
-  typedef typename Allocator::difference_type difference_type;
-
-  typedef mapped_value_type value_type;
-
-  typedef mapped_pointer pointer;
-
-  typedef const_mapped_pointer const_pointer;
-
-  typedef mapped_reference reference;
-
-  typedef const_mapped_reference const_reference;
-
-public:
-
-  inline
-  const_it_(const node_pointer p_nd = NULL) : m_p_nd(const_cast<node_pointer>(p_nd))
-  { }
-
-  inline
-  const_it_(const PB_ASSOC_CONST_ODIR_IT_C_DEC& 
-	    r_other)
-
-    : m_p_nd(r_other.m_p_nd)
-  { }
-
-  inline
-  PB_ASSOC_CONST_IT_C_DEC& 
-  operator=(const PB_ASSOC_CONST_IT_C_DEC& 
-	    r_other)
-  {
-    m_p_nd = r_other.m_p_nd;
-
-    return (*this);
-  }
-
-  inline
-  PB_ASSOC_CONST_IT_C_DEC& 
-  operator=(const PB_ASSOC_CONST_ODIR_IT_C_DEC& 
-	    r_other)
-  {
-    m_p_nd = r_other.m_p_nd;
-
-    return (*this);
-  }
-
-  inline const_pointer
-  operator->() const
-  {
-    PB_ASSOC_DBG_ASSERT(m_p_nd != NULL);
-
-    return (&m_p_nd->m_value);
-  }
-
-  inline const_reference
-  operator*() const
-  {
-    PB_ASSOC_DBG_ASSERT(m_p_nd != NULL);
-
-    return (m_p_nd->m_value);
-  }
-
-  inline bool
-  operator==(const PB_ASSOC_CONST_IT_C_DEC
-	     &r_other) const
-  {
-    return (m_p_nd == r_other.m_p_nd);
-  }
-
-  inline bool
-  operator==(const PB_ASSOC_CONST_ODIR_IT_C_DEC
-	     &r_other) const
-  {
-    return (m_p_nd == r_other.m_p_nd);
-  }
-
-  inline bool
-  operator!=(const PB_ASSOC_CONST_IT_C_DEC& 
-	     r_other) const
-  {
-    return (m_p_nd != r_other.m_p_nd);
-  }
-
-  inline bool
-  operator!=(const PB_ASSOC_CONST_ODIR_IT_C_DEC& 
-	     r_other) const
-  {
-    return (m_p_nd != r_other.m_p_nd);
-  }
-
-  inline PB_ASSOC_CONST_IT_C_DEC& 
-  operator++()
-  {
-    PB_ASSOC_DBG_ASSERT(m_p_nd != NULL);
-
-    inc(int_to_type<Is_Forward_Iterator>());
-
-    return (*this);
-  }
-
-  inline PB_ASSOC_CONST_IT_C_DEC
-  operator++(int)
-  {
-    PB_ASSOC_CONST_IT_C_DEC
-      ret_it(m_p_nd);
-
-    operator++();
-
-    return (ret_it);
-  }
-
-  inline PB_ASSOC_CONST_IT_C_DEC& 
-  operator--()
-  {
-    dec(int_to_type<Is_Forward_Iterator>());
-
-    return (*this);
-  }
-
-  inline PB_ASSOC_CONST_IT_C_DEC
-  operator--(int)
-  {
-    PB_ASSOC_CONST_IT_C_DEC
-      ret_it(m_p_nd);
-
-    operator--();
-
-    return (ret_it);
-  }
-
-protected:
-  inline void
-  inc(int_to_type<false>)
-  {
-    dec(int_to_type<true>());
-  }
-
-  void
-  inc(int_to_type<true>)
-  {
-    if (m_p_nd->m_p_right != NULL)
-      {
-	m_p_nd = m_p_nd->m_p_right;
-
-	while (m_p_nd->m_p_left != NULL)
-	  m_p_nd = m_p_nd->m_p_left;
-
-	return;
-      }
-
-    node_pointer p_y = m_p_nd->m_p_parent;
-
-    while (m_p_nd == p_y->m_p_right)
-      {
-	m_p_nd = p_y;
-
-	p_y = p_y->m_p_parent;
-      }
-
-    if (m_p_nd->m_p_right != p_y)
-      m_p_nd = p_y;
-  }
-
-  inline void
-  dec(int_to_type<false>)
-  {
-    inc(int_to_type<true>());
-  }
-
-  void
-  dec(int_to_type<true>)
-  {
-    if (m_p_nd->special_dec_check()&& 
-	m_p_nd->m_p_parent->m_p_parent == m_p_nd)
-      {
-	m_p_nd = m_p_nd->m_p_right;
-
-	return;
-      }
-
-    if (m_p_nd->m_p_left != NULL)
-      {
-	node_pointer p_y = m_p_nd->m_p_left;
-
-	while (p_y->m_p_right != NULL)
-	  p_y = p_y->m_p_right;
-
-	m_p_nd = p_y;
-
-	return;
-      }
-
-    node_pointer p_y = m_p_nd->m_p_parent;
-
-    while (m_p_nd == p_y->m_p_left)
-      {
-	m_p_nd = p_y;
-
-	p_y = p_y->m_p_parent;
-      }
-
-    /*
-     * This seems to correct an apparent bug in the SGI STL
-     * implementation. */
-    if (m_p_nd->m_p_left != p_y)
-      m_p_nd = p_y;
-  }
-
-  friend class PB_ASSOC_CLASS_C_DEC;
-
-public:
-  node_pointer m_p_nd;
-};
-
-template<bool Is_Forward_Iterator>
-class it_ : 
-  public PB_ASSOC_CONST_IT_C_DEC
-
-{
-
-public:
-
-  inline
-  it_(const node_pointer p_nd = NULL) : PB_ASSOC_CONST_IT_C_DEC((node_pointer)p_nd)
-  { }
-
-  inline
-  it_(const PB_ASSOC_ODIR_IT_C_DEC& 
-      r_other)
-
-    : PB_ASSOC_CONST_IT_C_DEC(
-			      r_other.m_p_nd)
-  { }
-
-  inline
-  PB_ASSOC_IT_C_DEC& 
-  operator=(const PB_ASSOC_IT_C_DEC& 
-	    r_other)
-  {
-    my_base_it::m_p_nd = r_other.m_p_nd;
-
-    return (*this);
-  }
-
-  inline
-  PB_ASSOC_IT_C_DEC& 
-  operator=(const PB_ASSOC_ODIR_IT_C_DEC& 
-	    r_other)
-  {
-    my_base_it::m_p_nd = r_other.m_p_nd;
-
-    return (*this);
-  }
-
-  inline pointer
-  operator->()
-  {
-    PB_ASSOC_DBG_ASSERT(my_base_it::m_p_nd != NULL);
-
-    return (&my_base_it::m_p_nd->m_value);
-  }
-
-  inline reference
-  operator*()
-  {
-    PB_ASSOC_DBG_ASSERT(my_base_it::m_p_nd != NULL);
-
-    return (my_base_it::m_p_nd->m_value);
-  }
-
-  inline PB_ASSOC_IT_C_DEC& 
-  operator++()
-  {
-    PB_ASSOC_CONST_IT_C_DEC::
-      operator++();
-
-    return (*this);
-  }
-
-  inline PB_ASSOC_IT_C_DEC
-  operator++(int)
-  {
-    PB_ASSOC_IT_C_DEC
-      ret_it(my_base_it::m_p_nd);
-
-    operator++();
-
-    return (ret_it);
-  }
-
-  inline PB_ASSOC_IT_C_DEC& 
-  operator--()
-  {
-    PB_ASSOC_CONST_IT_C_DEC::
-      operator--();
-
-    return (*this);
-  }
-
-  inline PB_ASSOC_IT_C_DEC
-  operator--(int)
-  {
-    PB_ASSOC_IT_C_DEC
-      ret_it(my_base_it::m_p_nd);
-
-    operator--();
-
-    return (ret_it);
-  }
-
-protected:
-  typedef PB_ASSOC_CONST_IT_C_DEC my_base_it;
-
-  friend class PB_ASSOC_CLASS_C_DEC;
-};
-
-#undef PB_ASSOC_CONST_IT_C_DEC
-
-#undef PB_ASSOC_CONST_ODIR_IT_C_DEC
-
-#undef PB_ASSOC_IT_C_DEC
-
-#undef PB_ASSOC_ODIR_IT_C_DEC
-
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/bin_search_tree_/info_fn_imps.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/bin_search_tree_/info_fn_imps.hpp
deleted file mode 100644
index d60da1a9093..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/bin_search_tree_/info_fn_imps.hpp
+++ /dev/null
@@ -1,87 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file info_fn_imps.hpp
- * Contains an implementation class for bin_search_tree_.
- */
-
-PB_ASSOC_CLASS_T_DEC
-template<class Other_Map_Type>
-bool
-PB_ASSOC_CLASS_C_DEC::
-cmp_with_other(const Other_Map_Type& r_other) const
-{
-  PB_ASSOC_DBG_ONLY(assert_valid(true, true);)
-
-    if (m_size != r_other.size())
-      return (false);
-
-  for (typename Other_Map_Type::const_iterator it = r_other.begin();
-       it != r_other.end(); ++it)
-    if (find((const_key_reference)PB_ASSOC_V2F(*it)) == end())
-      return (false);
-
-  return (true);
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline bool
-PB_ASSOC_CLASS_C_DEC::
-empty() const
-{
-  return (size() == 0);
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::size_type
-PB_ASSOC_CLASS_C_DEC::
-max_size() const
-{
-  return (s_node_allocator.max_size());
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::size_type
-PB_ASSOC_CLASS_C_DEC::
-size() const
-{
-  return (m_size);
-}
-
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/bin_search_tree_/insert_fn_imps.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/bin_search_tree_/insert_fn_imps.hpp
deleted file mode 100644
index 664a9d1d896..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/bin_search_tree_/insert_fn_imps.hpp
+++ /dev/null
@@ -1,215 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/*
- * @file insert_fn_imps.hpp
- * Contains an implementation class for bin_search_tree_.
- */
-
-PB_ASSOC_CLASS_T_DEC
-inline std::pair<typename PB_ASSOC_CLASS_C_DEC::find_iterator, bool>
-PB_ASSOC_CLASS_C_DEC::
-insert_leaf(const_mapped_reference r_mapped_value)
-{
-  PB_ASSOC_DBG_ONLY(assert_valid(true, true);)
-
-    if (m_size == 0)
-      return (std::make_pair(
-			     insert_imp_empty(r_mapped_value),
-			     true));
-
-  node_pointer p_nd = m_p_head->m_p_parent;
-  node_pointer p_pot = m_p_head;
-
-  while (p_nd != NULL)
-    if (!Cmp_Fn::operator()(
-			    PB_ASSOC_V2F(p_nd->m_value),
-			    PB_ASSOC_V2F(r_mapped_value)))
-      {
-	p_pot = p_nd;
-
-	p_nd = p_nd->m_p_left;
-      }
-    else
-      p_nd = p_nd->m_p_right;
-
-  if (p_pot == m_p_head)
-    return (std::make_pair(
-			   insert_leaf_new(r_mapped_value, m_p_head->m_p_right, false),
-			   true));
-
-  if (!Cmp_Fn::operator()(
-			  PB_ASSOC_V2F(r_mapped_value),
-			  PB_ASSOC_V2F(p_pot->m_value)))
-    {
-      PB_ASSOC_DBG_ONLY(assert_valid(true, true);)
-
-	PB_ASSOC_DBG_ONLY(my_map_debug_base::check_key_exists(
-							      PB_ASSOC_V2F(r_mapped_value)));
-
-      return (std::make_pair(p_pot, false));
-    }
-
-  PB_ASSOC_DBG_ONLY(my_map_debug_base::check_key_does_not_exist(
-								PB_ASSOC_V2F(r_mapped_value)));
-
-  p_nd = p_pot->m_p_left;
-  if (p_nd == NULL)
-    return (std::make_pair(
-			   insert_leaf_new(r_mapped_value, p_pot, true),
-			   true));
-
-  while (p_nd->m_p_right != NULL)
-    p_nd = p_nd->m_p_right;
-
-  return (std::make_pair(
-			 insert_leaf_new(r_mapped_value, p_nd, false),
-			 true));
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::iterator
-PB_ASSOC_CLASS_C_DEC::
-insert_leaf_new(const_mapped_reference r_mapped_value, node_pointer p_nd, bool left_nd)
-{
-  node_pointer p_new_nd =
-    get_new_node_for_leaf_insert(r_mapped_value, my_traits_base::s_no_throw_copies_indicator);
-
-  if (left_nd)
-    {
-      PB_ASSOC_DBG_ASSERT(p_nd->m_p_left == NULL);
-      PB_ASSOC_DBG_ASSERT(Cmp_Fn::operator()(
-					     PB_ASSOC_V2F(r_mapped_value),
-					     PB_ASSOC_V2F(p_nd->m_value)));
-
-      p_nd->m_p_left = p_new_nd;
-
-      if (m_p_head->m_p_left == p_nd)
-	m_p_head->m_p_left = p_new_nd;
-    }
-  else
-    {
-      PB_ASSOC_DBG_ASSERT(p_nd->m_p_right == NULL);
-      PB_ASSOC_DBG_ASSERT(Cmp_Fn::operator()(
-					     PB_ASSOC_V2F(p_nd->m_value),
-					     PB_ASSOC_V2F(r_mapped_value)));
-
-      p_nd->m_p_right = p_new_nd;
-
-      if (m_p_head->m_p_right == p_nd)
-	m_p_head->m_p_right = p_new_nd;
-    }
-
-  p_new_nd->m_p_parent = p_nd;
-
-  p_new_nd->m_p_left = p_new_nd->m_p_right = NULL;
-
-  PB_ASSOC_DBG_ONLY(assert_node_consistent(p_nd));
-
-  update_to_top(p_new_nd, (Node_Updator* )this);
-
-  PB_ASSOC_DBG_ONLY(my_map_debug_base::insert_new(
-						  PB_ASSOC_V2F(r_mapped_value)));
-
-  return (iterator(p_new_nd));
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::iterator
-PB_ASSOC_CLASS_C_DEC::
-insert_imp_empty(const_mapped_reference r_mapped_value)
-{
-  node_pointer p_new_node =
-    get_new_node_for_leaf_insert(r_mapped_value, my_traits_base::s_no_throw_copies_indicator);
-
-  m_p_head->m_p_left = m_p_head->m_p_right =
-    m_p_head->m_p_parent = p_new_node;
-
-  p_new_node->m_p_parent = m_p_head;
-
-  p_new_node->m_p_left = p_new_node->m_p_right = NULL;
-
-  PB_ASSOC_DBG_ONLY(my_map_debug_base::insert_new(
-						  PB_ASSOC_V2F(r_mapped_value)));
-
-  update_to_top(m_p_head->m_p_parent, (Node_Updator* )this);
-
-  return (iterator(p_new_node));
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::node_pointer
-PB_ASSOC_CLASS_C_DEC::
-get_new_node_for_leaf_insert(const_mapped_reference r_val, pb_assoc::detail::int_to_type<false>)
-{
-  node_pointer p_new_nd = s_node_allocator.allocate(1);
-
-  cond_dealtor_t cond(p_new_nd);
-
-  new (const_cast<void* >(
-			  static_cast<const void* >(&p_new_nd->m_value)))
-    typename Node::value_type(r_val);
-
-  cond.set_no_action();
-
-  p_new_nd->m_p_left = p_new_nd->m_p_right = NULL;
-
-  ++m_size;
-
-  return (p_new_nd);
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::node_pointer
-PB_ASSOC_CLASS_C_DEC::
-get_new_node_for_leaf_insert(const_mapped_reference r_val, pb_assoc::detail::int_to_type<true>)
-{
-  node_pointer p_new_nd = s_node_allocator.allocate(1);
-
-  new (const_cast<void* >(
-			  static_cast<const void* >(&p_new_nd->m_value)))
-    typename Node::value_type(r_val);
-
-  p_new_nd->m_p_left = p_new_nd->m_p_right = NULL;
-
-  ++m_size;
-
-  return (p_new_nd);
-}
-
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/bin_search_tree_/iterators_fn_imps.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/bin_search_tree_/iterators_fn_imps.hpp
deleted file mode 100644
index 57c23f21653..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/bin_search_tree_/iterators_fn_imps.hpp
+++ /dev/null
@@ -1,164 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file iterators_fn_imps.hpp
- * Contains an implementation class for bin_search_tree_.
- */
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::iterator
-PB_ASSOC_CLASS_C_DEC::
-find_end()
-{
-  return (m_end_it);
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::const_iterator
-PB_ASSOC_CLASS_C_DEC::
-find_end() const
-{
-  return (m_end_it);
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::iterator
-PB_ASSOC_CLASS_C_DEC::
-begin()
-{
-  return (iterator(m_p_head->m_p_left));
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::const_iterator
-PB_ASSOC_CLASS_C_DEC::
-begin() const
-{
-  return (const_iterator(m_p_head->m_p_left));
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::iterator
-PB_ASSOC_CLASS_C_DEC::
-end()
-{
-  return (m_end_it);
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::const_iterator
-PB_ASSOC_CLASS_C_DEC::
-end() const
-{
-  return (m_end_it);
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::reverse_iterator
-PB_ASSOC_CLASS_C_DEC::
-find_rend()
-{
-  return (m_end_it);
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::const_reverse_iterator
-PB_ASSOC_CLASS_C_DEC::
-find_rend() const
-{
-  return (m_end_it);
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::const_reverse_iterator
-PB_ASSOC_CLASS_C_DEC::
-rbegin() const
-{
-  return (const_reverse_iterator(m_p_head->m_p_right));
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::reverse_iterator
-PB_ASSOC_CLASS_C_DEC::
-rend()
-{
-  return (m_rend_it);
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::const_reverse_iterator
-PB_ASSOC_CLASS_C_DEC::
-rend() const
-{
-  return (m_rend_it);
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::const_node_iterator
-PB_ASSOC_CLASS_C_DEC::
-node_begin() const
-{
-  return (const_node_iterator(m_p_head->m_p_parent));
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::node_iterator
-PB_ASSOC_CLASS_C_DEC::
-node_begin()
-{
-  return (node_iterator(m_p_head->m_p_parent));
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::const_node_iterator
-PB_ASSOC_CLASS_C_DEC::
-node_end() const
-{
-  return (const_node_iterator(NULL));
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::node_iterator
-PB_ASSOC_CLASS_C_DEC::
-node_end()
-{
-  return (node_iterator(NULL));
-}
-
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/bin_search_tree_/node_iterators.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/bin_search_tree_/node_iterators.hpp
deleted file mode 100644
index 0386fea973b..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/bin_search_tree_/node_iterators.hpp
+++ /dev/null
@@ -1,144 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file node_iterators.hpp
- * Contains an implementation class for bin_search_tree_.
- */
-
-class const_node_it_
-{
-
-public:
-
-  typedef trivial_iterator_tag iterator_category;
-
-  typedef trivial_iterator_difference_type difference_type;
-
-  typedef const_iterator value_type;
-
-  typedef const_iterator*  pointer;
-
-  typedef const_iterator*  const_pointer;
-
-  typedef const_iterator&  reference;
-
-  typedef const iterator&  const_reference;
-
-public:
-
-  inline
-  const_node_it_(const node_pointer p_nd = NULL)
-
-    : m_p_nd(const_cast<node_pointer>(p_nd))
-  { }
-
-  inline const_iterator
-  operator*() const
-  {
-    return (const_iterator(m_p_nd));
-  }
-
-  inline const_node_it_
-  l_child() const
-  {
-    return (const_node_it_(m_p_nd->m_p_left));
-  }
-
-  inline const_node_it_
-  r_child() const
-  {
-    return (const_node_it_(m_p_nd->m_p_right));
-  }
-
-  inline bool
-  operator==(const const_node_it_& r_other) const
-  {
-    return (m_p_nd == r_other.m_p_nd);
-  }
-
-  inline bool
-  operator!=(const const_node_it_& r_other) const
-  {
-    return (m_p_nd != r_other.m_p_nd);
-  }
-
-private:
-
-  friend class PB_ASSOC_CLASS_C_DEC;
-
-public:
-  node_pointer m_p_nd;
-};
-
-class node_it_ : 
-  public const_node_it_
-
-{
-
-public:
-
-  inline
-  node_it_(const node_pointer p_nd = NULL)
-
-    : const_node_it_(const_cast<node_pointer>(p_nd))
-  { }
-
-  inline iterator
-  operator*() const
-  {
-    return (iterator(const_node_it_::m_p_nd));
-  }
-
-  inline node_it_
-  l_child()
-  {
-    return (node_it_(const_node_it_::m_p_nd->m_p_left));
-  }
-
-  inline node_it_
-  r_child()
-  {
-    return (node_it_(const_node_it_::m_p_nd->m_p_right));
-  }
-
-private:
-  friend class PB_ASSOC_CLASS_C_DEC;
-};
-
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/bin_search_tree_/r_erase_fn_imps.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/bin_search_tree_/r_erase_fn_imps.hpp
deleted file mode 100644
index 280300139c7..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/bin_search_tree_/r_erase_fn_imps.hpp
+++ /dev/null
@@ -1,124 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file r_erase_fn_imps.hpp
- * Contains an implementation class for bin_search_tree_.
- */
-
-PB_ASSOC_CLASS_T_DEC
-inline void
-PB_ASSOC_CLASS_C_DEC::
-actual_erase_node(node_pointer p_z)
-{
-  PB_ASSOC_DBG_ASSERT(m_size > 0);
-  --m_size;
-
-  PB_ASSOC_DBG_ONLY(erase_existing(PB_ASSOC_V2F(p_z->m_value)));
-
-  p_z->~node();
-
-  s_node_allocator.deallocate(p_z, 1);
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline void
-PB_ASSOC_CLASS_C_DEC::
-update_min_max_for_erased_node(node_pointer p_z)
-{
-  if (m_size == 1)
-    {
-      m_p_head->m_p_left = m_p_head->m_p_right = m_p_head;
-
-      return;
-    }
-
-  if (m_p_head->m_p_left == p_z)
-    {
-      iterator it(p_z);
-
-      ++it;
-
-      m_p_head->m_p_left = it.m_p_nd;
-    }
-  else if (m_p_head->m_p_right == p_z)
-    {
-      iterator it(p_z);
-
-      --it;
-
-      m_p_head->m_p_right = it.m_p_nd;
-    }
-}
-
-PB_ASSOC_CLASS_T_DEC
-void
-PB_ASSOC_CLASS_C_DEC::
-clear()
-{
-  PB_ASSOC_DBG_ONLY(assert_valid(true, true);)
-
-    clear_imp(m_p_head->m_p_parent);
-
-  m_size = 0;
-
-  initialize();
-
-  PB_ASSOC_DBG_ONLY(my_map_debug_base::clear();)
-
-    PB_ASSOC_DBG_ONLY(assert_valid(true, true);)
-    }
-
-PB_ASSOC_CLASS_T_DEC
-void
-PB_ASSOC_CLASS_C_DEC::
-clear_imp(node_pointer p_nd)
-{
-  if (p_nd == NULL)
-    return;
-
-  clear_imp(p_nd->m_p_left);
-
-  clear_imp(p_nd->m_p_right);
-
-  p_nd->~Node();
-
-  s_node_allocator.deallocate(p_nd, 1);
-}
-
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/bin_search_tree_/rotate_fn_imps.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/bin_search_tree_/rotate_fn_imps.hpp
deleted file mode 100644
index 356a9f79670..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/bin_search_tree_/rotate_fn_imps.hpp
+++ /dev/null
@@ -1,163 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file rotate_fn_imps.hpp
- * Contains imps for rotating nodes.
- */
-
-PB_ASSOC_CLASS_T_DEC
-inline void
-PB_ASSOC_CLASS_C_DEC::
-rotate_left(node_pointer p_x)
-{
-  node_pointer p_y = p_x->m_p_right;
-
-  p_x->m_p_right = p_y->m_p_left;
-
-  if (p_y->m_p_left != NULL)
-    p_y->m_p_left->m_p_parent = p_x;
-
-  p_y->m_p_parent = p_x->m_p_parent;
-
-  if (p_x == m_p_head->m_p_parent)
-    m_p_head->m_p_parent = p_y;
-  else if (p_x == p_x->m_p_parent->m_p_left)
-    p_x->m_p_parent->m_p_left = p_y;
-  else
-    p_x->m_p_parent->m_p_right = p_y;
-
-  p_y->m_p_left = p_x;
-  p_x->m_p_parent = p_y;
-
-  PB_ASSOC_DBG_ONLY(assert_node_consistent(p_x);)
-    PB_ASSOC_DBG_ONLY(assert_node_consistent(p_y);)
-
-    apply_update(p_x, (Node_Updator* )this);
-  apply_update(p_x->m_p_parent, (Node_Updator* )this);
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline void
-PB_ASSOC_CLASS_C_DEC::
-rotate_right(node_pointer p_x)
-{
-  node_pointer p_y = p_x->m_p_left;
-
-  p_x->m_p_left = p_y->m_p_right;
-
-  if (p_y->m_p_right != NULL)
-    p_y->m_p_right->m_p_parent = p_x;
-
-  p_y->m_p_parent = p_x->m_p_parent;
-
-  if (p_x == m_p_head->m_p_parent)
-    m_p_head->m_p_parent = p_y;
-  else if (p_x == p_x->m_p_parent->m_p_right)
-    p_x->m_p_parent->m_p_right = p_y;
-  else
-    p_x->m_p_parent->m_p_left = p_y;
-
-  p_y->m_p_right = p_x;
-  p_x->m_p_parent = p_y;
-
-  PB_ASSOC_DBG_ONLY(assert_node_consistent(p_x);)
-    PB_ASSOC_DBG_ONLY(assert_node_consistent(p_y);)
-
-    apply_update(p_x, (Node_Updator* )this);
-  apply_update(p_x->m_p_parent, (Node_Updator* )this);
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline void
-PB_ASSOC_CLASS_C_DEC::
-rotate_parent(node_pointer p_nd)
-{
-  node_pointer p_parent = p_nd->m_p_parent;
-
-  if (p_nd == p_parent->m_p_left)
-    rotate_right(p_parent);
-  else
-    rotate_left(p_parent);
-
-  PB_ASSOC_DBG_ASSERT(p_parent->m_p_parent = p_nd);
-  PB_ASSOC_DBG_ASSERT(p_nd->m_p_left == p_parent ||
-		      p_nd->m_p_right == p_parent);
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline void
-PB_ASSOC_CLASS_C_DEC::
-apply_update(node_pointer /*p_nd*/, pb_assoc::null_node_updator*  /*p_updator*/)
-{ }
-
-PB_ASSOC_CLASS_T_DEC
-template<class Node_Updator_>
-inline void
-PB_ASSOC_CLASS_C_DEC::
-apply_update(node_pointer p_nd, Node_Updator_* p_updator)
-{
-  p_updator->operator()(
-			&PB_ASSOC_V2F(p_nd->m_value),(p_nd->m_p_left == NULL)?
-			NULL :
-			&PB_ASSOC_V2F(p_nd->m_p_left->m_value),(p_nd->m_p_right == NULL)?
-			NULL :
-			&PB_ASSOC_V2F(p_nd->m_p_right->m_value));
-}
-
-PB_ASSOC_CLASS_T_DEC
-template<class Node_Updator_>
-inline void
-PB_ASSOC_CLASS_C_DEC::
-update_to_top(node_pointer p_nd, Node_Updator_* p_updator)
-{
-  while (p_nd != m_p_head)
-    {
-      apply_update(p_nd, p_updator);
-
-      p_nd = p_nd->m_p_parent;
-    }
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline void
-PB_ASSOC_CLASS_C_DEC::
-update_to_top(node_pointer /*p_nd*/, pb_assoc::null_node_updator*  /*p_updator*/)
-{ }
-
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/bin_search_tree_/split_join_fn_imps.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/bin_search_tree_/split_join_fn_imps.hpp
deleted file mode 100644
index 2bd3c64e210..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/bin_search_tree_/split_join_fn_imps.hpp
+++ /dev/null
@@ -1,192 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file split_join_fn_imps.hpp
- * Contains an implementation class for bin_search_tree_.
- */
-
-PB_ASSOC_CLASS_T_DEC
-bool
-PB_ASSOC_CLASS_C_DEC::
-join_prep(PB_ASSOC_CLASS_C_DEC& r_other)
-{
-  PB_ASSOC_DBG_ONLY(assert_valid(true, true);)
-    PB_ASSOC_DBG_ONLY(r_other.assert_valid(true, true);)
-
-    if (r_other.m_size == 0)
-      return (false);
-
-  if (m_size == 0)
-    {
-      swap(r_other);
-
-      return (false);
-    }
-
-  const bool greater = Cmp_Fn::operator()(
-					  PB_ASSOC_V2F(m_p_head->m_p_right->m_value),
-					  PB_ASSOC_V2F(r_other.m_p_head->m_p_left->m_value));
-
-  const bool lesser = Cmp_Fn::operator()(
-					 PB_ASSOC_V2F(r_other.m_p_head->m_p_right->m_value),
-					 PB_ASSOC_V2F(m_p_head->m_p_left->m_value));
-
-  if (!greater&&  !lesser)
-    throw cannot_join();
-
-  if (lesser)
-    swap(r_other);
-
-  m_size += r_other.m_size;
-
-#ifdef PB_ASSOC_BIN_SEARCH_TREE_DEBUG_
-  for (const_iterator other_it = r_other.begin(); other_it != r_other.end();
-       ++other_it)
-    {
-      my_map_debug_base::insert_new(PB_ASSOC_V2F(*other_it));
-      r_other.my_map_debug_base::erase_existing(PB_ASSOC_V2F(*other_it));
-    }
-#endif // PB_ASSOC_BIN_SEARCH_TREE_DEBUG_
-
-  return (true);
-}
-
-PB_ASSOC_CLASS_T_DEC
-void
-PB_ASSOC_CLASS_C_DEC::
-join_finish(PB_ASSOC_CLASS_C_DEC& r_other)
-{
-  initialize_min_max();
-
-  r_other.initialize();
-}
-
-PB_ASSOC_CLASS_T_DEC
-bool
-PB_ASSOC_CLASS_C_DEC::
-split_prep(const_key_reference r_key, PB_ASSOC_CLASS_C_DEC& r_other)
-{
-  PB_ASSOC_DBG_ONLY(assert_valid(true, true);)
-    PB_ASSOC_DBG_ONLY(r_other.assert_valid(true, true);)
-
-    r_other.clear();
-
-  if (m_size == 0)
-    {
-      PB_ASSOC_DBG_ONLY(assert_valid(true, true);)
-	PB_ASSOC_DBG_ONLY(r_other.assert_valid(true, true);)
-
-	return (false);
-    }
-
-  if (Cmp_Fn::operator()(r_key, PB_ASSOC_V2F(m_p_head->m_p_left->m_value)))
-    {
-      swap(r_other);
-
-      PB_ASSOC_DBG_ONLY(assert_valid(true, true);)
-	PB_ASSOC_DBG_ONLY(r_other.assert_valid(true, true);)
-
-	return (false);
-    }
-
-  if (!Cmp_Fn::operator()(
-			  r_key,
-			  PB_ASSOC_V2F(m_p_head->m_p_right->m_value)))
-    {
-      PB_ASSOC_DBG_ONLY(assert_valid(true, true);)
-	PB_ASSOC_DBG_ONLY(r_other.assert_valid(true, true);)
-
-	return (false);
-    }
-
-  if (m_size == 1)
-    {
-      swap(r_other);
-
-      PB_ASSOC_DBG_ONLY(assert_valid(true, true);)
-	PB_ASSOC_DBG_ONLY(r_other.assert_valid(true, true);)
-
-	return (false);
-    }
-
-#ifdef PB_ASSOC_BIN_SEARCH_TREE_DEBUG_
-  for (const_iterator it = begin(); it != end(); ++it)
-    if (Cmp_Fn::operator()(
-			   r_key,
-			   PB_ASSOC_V2F(*it)))
-      {
-	my_map_debug_base::erase_existing(PB_ASSOC_V2F(*it));
-	r_other.my_map_debug_base::insert_new(PB_ASSOC_V2F(*it));
-      }
-#endif // PB_ASSOC_BIN_SEARCH_TREE_DEBUG_
-
-  return (true);
-}
-
-PB_ASSOC_CLASS_T_DEC
-void
-PB_ASSOC_CLASS_C_DEC::
-split_finish(PB_ASSOC_CLASS_C_DEC& r_other)
-{
-  r_other.m_size = r_other.recursive_count(r_other.m_p_head->m_p_parent);
-
-  r_other.initialize_min_max();
-
-  m_size -= r_other.m_size;
-
-  initialize_min_max();
-
-  PB_ASSOC_DBG_ONLY(assert_valid(true, true);)
-    PB_ASSOC_DBG_ONLY(r_other.assert_valid(true, true);)
-    }
-
-PB_ASSOC_CLASS_T_DEC
-typename PB_ASSOC_CLASS_C_DEC::size_type
-PB_ASSOC_CLASS_C_DEC::
-recursive_count(node_pointer p_nd) const
-{
-  if (p_nd == NULL)
-    return (0);
-
-  return (1 +
-	  recursive_count(p_nd->m_p_left) +
-	  recursive_count(p_nd->m_p_right));
-}
-
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/cc_hash_assoc_cntnr/constructor_destructor_fn_imps.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/cc_hash_assoc_cntnr/constructor_destructor_fn_imps.hpp
deleted file mode 100644
index 5345c17323c..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/cc_hash_assoc_cntnr/constructor_destructor_fn_imps.hpp
+++ /dev/null
@@ -1,153 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file constructor_destructor_fn_imps.hpp
- * Contains implementations of cc_ht's constructors, destructor,
- *	and related functions.
- */
-
-PB_ASSOC_CLASS_T_DEC
-PB_ASSOC_CLASS_C_DEC::
-cc_hash_assoc_cntnr()
-{ }
-
-PB_ASSOC_CLASS_T_DEC
-PB_ASSOC_CLASS_C_DEC::
-cc_hash_assoc_cntnr(const Hash_Fn& r_hash_fn) :
-  my_base(r_hash_fn)
-{ }
-
-PB_ASSOC_CLASS_T_DEC
-PB_ASSOC_CLASS_C_DEC::
-cc_hash_assoc_cntnr(const Hash_Fn& r_hash_fn, const Eq_Fn& r_eq_fn) :
-  my_base(r_hash_fn, r_eq_fn)
-{ }
-
-PB_ASSOC_CLASS_T_DEC
-PB_ASSOC_CLASS_C_DEC::
-cc_hash_assoc_cntnr(const Hash_Fn& r_hash_fn, const Eq_Fn& r_eq_fn, const Comb_Hash_Fn& r_comb_hash_fn) :
-  my_base(r_hash_fn, r_eq_fn, r_comb_hash_fn)
-{ }
-
-PB_ASSOC_CLASS_T_DEC
-PB_ASSOC_CLASS_C_DEC::
-cc_hash_assoc_cntnr(const Hash_Fn& r_hash_fn, const Eq_Fn& r_eq_fn, const Comb_Hash_Fn& r_comb_hash_fn, const Resize_Policy& r_resize_policy) :
-  my_base(r_hash_fn, r_eq_fn, r_comb_hash_fn, r_resize_policy)
-{ }
-
-PB_ASSOC_CLASS_T_DEC
-PB_ASSOC_CLASS_C_DEC& 
-PB_ASSOC_CLASS_C_DEC::
-operator=(const PB_ASSOC_CLASS_C_DEC& r_other)
-{
-  if (this !=& r_other)
-    {
-      PB_ASSOC_CLASS_C_DEC tmp(r_other);
-
-      swap(tmp);
-    }
-
-  return (*this);
-}
-
-PB_ASSOC_CLASS_T_DEC
-template<class It>
-PB_ASSOC_CLASS_C_DEC::
-cc_hash_assoc_cntnr(It first_it, It last_it)
-{
-  my_base::copy_from_range(first_it, last_it);
-}
-
-PB_ASSOC_CLASS_T_DEC
-template<class It>
-PB_ASSOC_CLASS_C_DEC::
-cc_hash_assoc_cntnr(It first_it, It last_it, const Hash_Fn& r_hash_fn) :
-  my_base(r_hash_fn)
-{
-  copy_from_range(first_it, last_it);
-}
-
-// Tmp Ami make all methods in assoc_cntnr.hpp inline
-
-PB_ASSOC_CLASS_T_DEC
-template<class It>
-PB_ASSOC_CLASS_C_DEC::
-cc_hash_assoc_cntnr(It first_it, It last_it, const Hash_Fn& r_hash_fn, const Eq_Fn& r_eq_fn) :
-  my_base(r_hash_fn, r_eq_fn)
-{
-  copy_from_range(first_it, last_it);
-}
-
-PB_ASSOC_CLASS_T_DEC
-template<class It>
-PB_ASSOC_CLASS_C_DEC::
-cc_hash_assoc_cntnr(It first_it, It last_it, const Hash_Fn& r_hash_fn, const Eq_Fn& r_eq_fn, const Comb_Hash_Fn& r_comb_hash_fn) :
-  my_base(r_hash_fn, r_eq_fn, r_comb_hash_fn)
-{
-  copy_from_range(first_it, last_it);
-}
-
-PB_ASSOC_CLASS_T_DEC
-template<class It>
-PB_ASSOC_CLASS_C_DEC::
-cc_hash_assoc_cntnr(It first_it, It last_it, const Hash_Fn& r_hash_fn, const Eq_Fn& r_eq_fn, const Comb_Hash_Fn& r_comb_hash_fn, const Resize_Policy& r_resize_policy) :
-  my_base(r_hash_fn, r_eq_fn, r_comb_hash_fn, r_resize_policy)
-{
-  copy_from_range(first_it, last_it);
-}
-
-PB_ASSOC_CLASS_T_DEC
-PB_ASSOC_CLASS_C_DEC::
-cc_hash_assoc_cntnr(const PB_ASSOC_CLASS_C_DEC& r_other) :
-  PB_ASSOC_BASE_C_DEC((const PB_ASSOC_BASE_C_DEC& )r_other)
-{ }
-
-PB_ASSOC_CLASS_T_DEC
-PB_ASSOC_CLASS_C_DEC::
-~cc_hash_assoc_cntnr()
-{ }
-
-PB_ASSOC_CLASS_T_DEC
-void
-PB_ASSOC_CLASS_C_DEC::
-swap(PB_ASSOC_CLASS_C_DEC& r_other)
-{
-  my_base::swap(r_other);
-}
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/cc_ht_map_/cc_ht_map_.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/cc_ht_map_/cc_ht_map_.hpp
deleted file mode 100644
index a854afc2576..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/cc_ht_map_/cc_ht_map_.hpp
+++ /dev/null
@@ -1,602 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file cc_ht_map_.hpp
- * Contains an implementation class for cc_ht_map_.
- */
-
-#include <utility>
-#include <iterator>
-#include <ext/pb_assoc/detail/cond_dealtor.hpp>
-#include <ext/pb_assoc/trivial_iterator_def.hpp>
-#include <ext/pb_assoc/detail/hash_fn/ranged_hash_fn.hpp>
-#include <ext/pb_assoc/detail/hash_types_traits.hpp>
-#include <ext/pb_assoc/detail/types_traits.hpp>
-#include <ext/pb_assoc/exception.hpp>
-#include <ext/pb_assoc/detail/map_debug_base.hpp>
-#include <ext/pb_assoc/detail/eq_fn/hash_eq_fn.hpp>
-
-namespace pb_assoc
-{
-
-  namespace detail
-  {
-
-#ifdef PB_ASSOC_CC_HT_MAP_DEBUG
-#define PB_ASSOC_DBG_ASSERT(X) assert(X)
-#define PB_ASSOC_DBG_VERIFY(X) assert(X)
-#define PB_ASSOC_DBG_ONLY(X) X
-#else // #ifdef PB_ASSOC_CC_HT_MAP_DEBUG
-#define PB_ASSOC_DBG_ASSERT(X)
-#define PB_ASSOC_DBG_VERIFY(X) {if((X)==0);}
-#define PB_ASSOC_DBG_ONLY(X) ;
-#endif // #ifdef PB_ASSOC_CC_HT_MAP_DEBUG
-
-#define PB_ASSOC_CLASS_T_DEC \
-	template< \
-		typename Key, \
-		typename Data, \
-		class Hash_Fn, \
-		class Eq_Fn, \
-		class Allocator, \
-		bool Store_Hash, \
-		class Comb_Hash_Fn, \
-		class Resize_Policy>
-
-#ifdef PB_ASSOC_DATA_TRUE_INDICATOR
-#define PB_ASSOC_CLASS_NAME \
-	cc_ht_map_data_
-#endif // #ifdef PB_ASSOC_DATA_TRUE_INDICATOR
-
-#ifdef PB_ASSOC_DATA_FALSE_INDICATOR
-#define PB_ASSOC_CLASS_NAME \
-	cc_ht_map_no_data_
-#endif // #ifdef PB_ASSOC_DATA_FALSE_INDICATOR
-
-#define PB_ASSOC_CLASS_C_DEC \
-	PB_ASSOC_CLASS_NAME< \
-		Key, \
-		Data, \
-		Hash_Fn, \
-		Eq_Fn, \
-		Allocator, \
-		Store_Hash, \
-		Comb_Hash_Fn, \
-		Resize_Policy >
-
-#define PB_ASSOC_HASH_EQ_FN_C_DEC \
-	pb_assoc::detail::hash_eq_fn< \
-		Key, \
-		Eq_Fn, \
-		Allocator, \
-		Store_Hash>
-
-#define PB_ASSOC_RANGED_HASH_FN_C_DEC \
-	pb_assoc::detail::ranged_hash_fn< \
-		Key, \
-		Hash_Fn, \
-		Allocator, \
-		Comb_Hash_Fn, \
-		Store_Hash>
-
-#define PB_ASSOC_TYPES_TRAITS_C_DEC \
-	types_traits< \
-		Key, \
-		Data, \
-		Allocator>
-
-#define PB_ASSOC_HASH_TYPES_TRAITS_C_DEC \
-	hash_types_traits< \
-		typename Allocator::size_type, \
-		Store_Hash>
-
-#ifdef PB_ASSOC_USE_MAP_DEBUG_BASE
-#define PB_ASSOC_MAP_DEBUG_BASE_C_DEC \
-	pb_assoc::detail::map_debug_base< \
-		Key, \
-		Eq_Fn>
-#endif // #ifdef PB_ASSOC_USE_MAP_DEBUG_BASE
-
-#ifdef PB_ASSOC_DATA_TRUE_INDICATOR
-#define PB_ASSOC_V2F(X) (X).first
-#define PB_ASSOC_V2S(X) (X).second
-#endif // #ifdef PB_ASSOC_DATA_TRUE_INDICATOR
-
-#ifdef PB_ASSOC_DATA_FALSE_INDICATOR
-#define PB_ASSOC_V2F(X) (X)
-#define PB_ASSOC_V2S(X) Mapped_Data()
-#endif // #ifdef PB_ASSOC_DATA_FALSE_INDICATOR
-
-#define PB_ASSOC_STATIC_ASSERT(UNIQUE, E) \
-	typedef \
-		pb_assoc::detail::static_assert_dummy_class< \
-			sizeof(pb_assoc::detail::static_assert<(bool)(E)>)> \
-			UNIQUE##static_assert_type
-
-    template<typename Key,
-	     typename Data,
-	     class Hash_Fn,
-	     class Eq_Fn,
-	     class Allocator,
-	     bool Store_Hash,
-	     class Comb_Hash_Fn,
-	     class Resize_Policy >
-    class PB_ASSOC_CLASS_NAME:
-#ifdef PB_ASSOC_CC_HT_MAP_DEBUG
-      protected PB_ASSOC_MAP_DEBUG_BASE_C_DEC,
-#endif // #ifdef PB_ASSOC_CC_HT_MAP_DEBUG
-      public PB_ASSOC_HASH_EQ_FN_C_DEC,
-      public Resize_Policy,
-      public PB_ASSOC_RANGED_HASH_FN_C_DEC,
-      public PB_ASSOC_TYPES_TRAITS_C_DEC,
-      public PB_ASSOC_HASH_TYPES_TRAITS_C_DEC
-    {
-
-    public:
-
-      typedef typename Allocator::size_type size_type;
-
-      typedef
-      typename PB_ASSOC_TYPES_TRAITS_C_DEC::const_key_reference
-      const_key_reference;
-
-      typedef typename PB_ASSOC_TYPES_TRAITS_C_DEC::data_type data_type;
-
-      typedef
-      typename PB_ASSOC_TYPES_TRAITS_C_DEC::data_reference
-      data_reference;
-
-      typedef
-      typename PB_ASSOC_TYPES_TRAITS_C_DEC::const_data_reference
-      const_data_reference;
-
-      typedef typename PB_ASSOC_TYPES_TRAITS_C_DEC::value_type value_type;
-
-      typedef typename PB_ASSOC_TYPES_TRAITS_C_DEC::pointer pointer;
-
-      typedef
-      typename PB_ASSOC_TYPES_TRAITS_C_DEC::const_pointer
-      const_pointer;
-
-      typedef typename PB_ASSOC_TYPES_TRAITS_C_DEC::reference reference;
-
-      typedef
-      typename PB_ASSOC_TYPES_TRAITS_C_DEC::const_reference
-      const_reference;
-
-    protected:
-
-      typedef typename PB_ASSOC_HASH_TYPES_TRAITS_C_DEC::comp_hash comp_hash;
-
-      struct no_store_hash_entry
-      {
-	value_type m_value;
-
-	typename Allocator::template rebind<
-	  no_store_hash_entry>::other::pointer m_p_next;
-      };
-
-      struct store_hash_entry
-      {
-	value_type m_value;
-
-	size_type m_hash;
-
-	typename Allocator::template rebind<
-	  store_hash_entry>::other::pointer m_p_next;
-      };
-
-      typedef
-      typename cond_type<
-	Store_Hash,
-	store_hash_entry,
-	no_store_hash_entry>::type
-      entry;
-
-      typedef
-      typename Allocator::template rebind<entry>::other
-      entry_allocator;
-
-      typedef typename entry_allocator::pointer entry_pointer;
-
-      typedef typename entry_allocator::const_pointer const_entry_pointer;
-
-      typedef typename entry_allocator::reference entry_reference;
-
-      typedef
-      typename entry_allocator::const_reference
-      const_entry_reference;
-
-      typedef
-      typename Allocator::template rebind<entry_pointer>::other
-      entry_pointer_allocator;
-
-      typedef typename entry_pointer_allocator::pointer entry_pointer_array;
-
-      typedef value_type mapped_value_type;
-
-      typedef pointer mapped_pointer;
-
-      typedef const_pointer const_mapped_pointer;
-
-      typedef reference mapped_reference;
-
-      typedef const_reference const_mapped_reference;
-
-#define PB_ASSOC_GEN_POS std::pair<entry_pointer, size_type>
-
-#include <ext/pb_assoc/detail/unordered_iterator/const_find_iterator.hpp>
-#include <ext/pb_assoc/detail/unordered_iterator/find_iterator.hpp>
-#include <ext/pb_assoc/detail/unordered_iterator/const_iterator.hpp>
-#include <ext/pb_assoc/detail/unordered_iterator/iterator.hpp>
-
-#undef PB_ASSOC_GEN_POS
-
-      typedef find_iterator_ find_iterator;
-
-      typedef const_find_iterator_ const_find_iterator;
-
-      typedef iterator_ iterator;
-
-      typedef const_iterator_ const_iterator;
-
-      typedef Hash_Fn hash_fn;
-
-      typedef Eq_Fn eq_fn;
-
-      typedef Allocator allocator;
-
-      typedef Resize_Policy resize_policy;
-
-    protected:
-
-      PB_ASSOC_CLASS_NAME();
-
-      PB_ASSOC_CLASS_NAME(const Hash_Fn& r_hash_fn);
-
-      PB_ASSOC_CLASS_NAME(const Hash_Fn& r_hash_fn, const Eq_Fn& r_eq_fn);
-
-      PB_ASSOC_CLASS_NAME(const Hash_Fn& r_hash_fn, const Eq_Fn& r_eq_fn, const Comb_Hash_Fn& r_comb_hash_fn);
-
-      PB_ASSOC_CLASS_NAME(const Hash_Fn& r_hash_fn, const Eq_Fn& r_eq_fn, const Comb_Hash_Fn& r_comb_hash_fn, const Resize_Policy& r_resize_policy);
-
-      PB_ASSOC_CLASS_NAME(const PB_ASSOC_CLASS_C_DEC& r_other);
-
-      virtual
-      ~PB_ASSOC_CLASS_NAME();
-
-      void
-      swap(PB_ASSOC_CLASS_C_DEC& r_other);
-
-      template<class It>
-      void
-      copy_from_range(It first_it, It last_it);
-
-      inline size_type
-      size() const;
-
-      inline size_type
-      max_size() const;
-
-      inline bool
-      empty() const;
-
-      Hash_Fn& 
-      get_hash_fn();
-
-      const Hash_Fn& 
-      get_hash_fn() const;
-
-      Eq_Fn& 
-      get_eq_fn();
-
-      const Eq_Fn& 
-      get_eq_fn() const;
-
-      Comb_Hash_Fn& 
-      get_comb_hash_fn();
-
-      const Comb_Hash_Fn& 
-      get_comb_hash_fn() const;
-
-      Resize_Policy& 
-      get_resize_policy();
-
-      const Resize_Policy& 
-      get_resize_policy() const;
-
-      inline std::pair<find_iterator, bool>
-      insert(const_reference r_val);
-
-      inline data_reference
-      subscript_imp(const_key_reference r_key);
-
-      inline find_iterator
-      find(const_key_reference r_key);
-
-      inline const_find_iterator
-      find(const_key_reference r_key) const;
-
-      inline find_iterator
-      find_end();
-
-      inline const_find_iterator
-      find_end() const;
-
-      template<class T>
-      inline size_type
-      erase(T r_t, bool erase_entry_if_last, pb_assoc::detail::int_to_type<false>);
-
-      template<class T>
-      inline size_type
-      erase(T r_t, bool erase_entry_if_last, pb_assoc::detail::int_to_type<true>);
-
-      template<class Pred>
-      inline size_type
-      erase_if(Pred& r_pred);
-
-      void
-      clear();
-
-      inline iterator
-      begin();
-
-      inline const_iterator
-      begin() const;
-
-      inline iterator
-      end();
-
-      inline const_iterator
-      end() const;
-
-#ifdef PB_ASSOC_CC_HT_MAP_DEBUG
-
-      virtual void
-      assert_valid() const;
-
-#endif // #ifdef PB_ASSOC_CC_HT_MAP_DEBUG
-
-      virtual void
-      do_resize(size_type new_size);
-
-    private:
-
-      typedef PB_ASSOC_TYPES_TRAITS_C_DEC my_traits_base;
-
-      typedef PB_ASSOC_HASH_TYPES_TRAITS_C_DEC my_hash_traits_base;
-
-      typedef PB_ASSOC_RANGED_HASH_FN_C_DEC my_ranged_hash_fn_base;
-
-      typedef PB_ASSOC_HASH_EQ_FN_C_DEC my_hash_eq_fn_base;
-
-      typedef Resize_Policy my_resize_base;
-
-#ifdef PB_ASSOC_USE_MAP_DEBUG_BASE
-      typedef PB_ASSOC_MAP_DEBUG_BASE_C_DEC my_map_debug_base;
-#endif // #ifdef PB_ASSOC_USE_MAP_DEBUG_BASE
-
-    private:
-
-      inline bool
-      do_resize_if_needed();
-
-      inline void
-      do_resize_if_needed_no_throw();
-
-      void
-      resize_imp_no_exceptions(size_type new_size, entry_pointer_array a_p_entries_resized, size_type old_size);
-
-      inline entry_pointer
-      resize_imp_no_exceptions_reassign_pointer(entry_pointer p_e, entry_pointer_array a_p_entries_resized, int_to_type<false>);
-
-      inline entry_pointer
-      resize_imp_no_exceptions_reassign_pointer(entry_pointer p_e, entry_pointer_array a_p_entries_resized, int_to_type<true>);
-
-      template<class For_Each_Fn>
-      void
-      do_for_each(For_Each_Fn fn);
-
-      void
-      deallocate_links_in_list(entry_pointer p_e);
-
-      inline entry_pointer
-      get_entry(const_reference r_val, int_to_type<false>);
-
-      inline entry_pointer
-      get_entry(const_reference r_val, int_to_type<true>);
-
-      inline void
-      rels_entry(entry_pointer p_e);
-
-      void
-      constructor_insert_new_imp(const_reference r_val, size_type pos, int_to_type<false>);
-
-      void
-      constructor_insert_new_imp(const_reference r_val, size_type pos, int_to_type<true>);
-
-      void
-      deallocate_all();
-
-      inline data_reference
-      subscript_imp(const_key_reference r_key, int_to_type<false>);
-
-      inline data_reference
-      subscript_imp(const_key_reference r_key, int_to_type<true>);
-
-      inline std::pair<find_iterator, bool>
-      insert_imp(const_reference r_val, int_to_type<false>);
-
-      inline std::pair<find_iterator, bool>
-      insert_imp(const_reference r_val, int_to_type<true>);
-
-      inline pointer
-      insert_new_imp(const_reference r_val, size_type pos);
-
-      inline pointer
-      insert_new_imp(const_reference r_val, comp_hash& r_pos_hash_pair);
-
-      inline const_data_reference
-      const_subscript_imp(const_key_reference r_key, int_to_type<false>) const;
-
-      inline const_data_reference
-      const_subscript_imp(const_key_reference r_key, int_to_type<true>) const;
-
-      inline pointer
-      find_key_pointer(const_key_reference r_key, int_to_type<false>);
-
-      inline pointer
-      find_key_pointer(const_key_reference r_key, int_to_type<true>);
-
-      template<class T>
-      inline size_type
-      erase_in_pos_imp(T r_t, bool erase_entry_if_last, size_type pos);
-
-      template<class T>
-      inline size_type
-      erase_in_pos_imp(T r_t, bool erase_entry_if_last, const comp_hash& r_pos_hash_pair);
-
-      inline void
-      erase_entry_pointer(entry_pointer& r_p_e);
-
-#ifdef PB_ASSOC_DATA_TRUE_INDICATOR
-      void
-      inc_it_state(pointer& r_p_value, std::pair<entry_pointer, size_type>& r_pos) const;
-#endif // #ifdef PB_ASSOC_DATA_TRUE_INDICATOR
-
-      void
-      inc_it_state(const_pointer& r_p_value, std::pair<entry_pointer, size_type>& r_pos) const;
-
-      void
-      get_start_it_state(pointer& r_p_value, std::pair<entry_pointer, size_type>& r_pos) const;
-
-#ifdef PB_ASSOC_CC_HT_MAP_DEBUG
-
-      void
-      assert_entry_pointer_array_valid(const entry_pointer_array a_p_entries) const;
-
-      void
-      assert_entry_pointer_valid(const entry_pointer p_e, store_hash_true_indicator) const;
-
-      void
-      assert_entry_pointer_valid(const entry_pointer p_e, store_hash_false_indicator) const;
-
-#endif // #ifdef PB_ASSOC_CC_HT_MAP_DEBUG
-
-    private:
-      static entry_allocator s_entry_allocator;
-
-      static entry_pointer_allocator s_entry_pointer_allocator;
-
-      typedef
-      pb_assoc::detail::cond_dealtor<
-	entry,
-	Allocator>
-      cond_dealtor_t;
-
-      entry_pointer_array m_a_p_entries;
-
-      size_type m_num_e_p;
-
-      size_type m_num_used_e;
-
-      friend class iterator_;
-
-      friend class const_iterator_;
-
-      static iterator s_end_it;
-
-      static const_iterator s_const_end_it;
-
-      static find_iterator s_find_end_it;
-
-      static const_find_iterator s_const_find_end_it;
-
-      enum
-	{
-	  store_hash_ok =
-	  !Store_Hash ||
-	  !pb_assoc::detail::is_same_type<
-	  Hash_Fn,
-	  pb_assoc::null_hash_fn>::value
-	};
-
-      PB_ASSOC_STATIC_ASSERT(sth, store_hash_ok);
-    };
-
-#include <ext/pb_assoc/detail/cc_ht_map_/constructor_destructor_fn_imps.hpp>
-#include <ext/pb_assoc/detail/cc_ht_map_/entry_list_fn_imps.hpp>
-#include <ext/pb_assoc/detail/cc_ht_map_/find_fn_imps.hpp>
-#include <ext/pb_assoc/detail/cc_ht_map_/resize_fn_imps.hpp>
-#include <ext/pb_assoc/detail/cc_ht_map_/debug_fn_imps.hpp>
-#include <ext/pb_assoc/detail/cc_ht_map_/size_fn_imps.hpp>
-#include <ext/pb_assoc/detail/cc_ht_map_/policy_access_fn_imps.hpp>
-#include <ext/pb_assoc/detail/cc_ht_map_/erase_fn_imps.hpp>
-#include <ext/pb_assoc/detail/cc_ht_map_/iterators_fn_imps.hpp>
-#include <ext/pb_assoc/detail/cc_ht_map_/insert_fn_imps.hpp>
-
-#undef PB_ASSOC_CLASS_T_DEC
-
-#undef PB_ASSOC_CLASS_C_DEC
-
-#undef PB_ASSOC_HASH_EQ_FN_C_DEC
-
-#undef PB_ASSOC_RANGED_HASH_FN_C_DEC
-
-#undef PB_ASSOC_TYPES_TRAITS_C_DEC
-
-#undef PB_ASSOC_HASH_TYPES_TRAITS_C_DEC
-
-#undef PB_ASSOC_MAP_DEBUG_BASE_C_DEC
-
-#undef PB_ASSOC_CLASS_NAME
-
-#undef PB_ASSOC_V2F
-#undef PB_ASSOC_V2S
-
-#undef PB_ASSOC_DBG_ASSERT
-#undef PB_ASSOC_DBG_VERIFY
-#undef PB_ASSOC_DBG_ONLY
-
-#undef PB_ASSOC_STATIC_ASSERT
-
-  } // namespace detail
-
-} // namespace pb_assoc
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/cc_ht_map_/cmp_fn_imps.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/cc_ht_map_/cmp_fn_imps.hpp
deleted file mode 100644
index a10167fd193..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/cc_ht_map_/cmp_fn_imps.hpp
+++ /dev/null
@@ -1,92 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file cmp_fn_imps.hpp
- * Contains implementations of cc_ht_map_'s entire container comparison related
- *	functions.
- */
-
-PB_ASSOC_CLASS_T_DEC
-template<class Other_HT_Map_Type>
-bool
-PB_ASSOC_CLASS_C_DEC::
-operator==(const Other_HT_Map_Type& r_other) const
-{
-  return (cmp_with_other(r_other));
-}
-
-PB_ASSOC_CLASS_T_DEC
-template<class Other_Map_Type>
-bool
-PB_ASSOC_CLASS_C_DEC::
-cmp_with_other(const Other_Map_Type& r_other) const
-{
-  if (size() != r_other.size())
-    return (false);
-
-  for (typename Other_Map_Type::const_iterator it = r_other.begin();
-       it != r_other.end(); ++it)
-    {
-      const_key_reference r_key =(const_key_reference)PB_ASSOC_V2F(*it);
-
-      const_mapped_pointer p_mapped_value =
-	const_cast<PB_ASSOC_CLASS_C_DEC& >(*this).
-	find_key_pointer(r_key, my_traits_base::m_store_hash_indicator);
-
-      if (p_mapped_value == NULL)
-	return (false);
-
-#ifdef PB_ASSOC_DATA_TRUE_INDICATOR
-      if (p_mapped_value->second != it->second)
-	return (false);
-#endif // #ifdef PB_ASSOC_DATA_TRUE_INDICATOR
-    }
-
-  return (true);
-}
-
-PB_ASSOC_CLASS_T_DEC
-template<class Other_HT_Map_Type>
-bool
-PB_ASSOC_CLASS_C_DEC::
-operator!=(const Other_HT_Map_Type& r_other) const
-{
-  return (!operator==(r_other));
-}
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/cc_ht_map_/cond_key_dtor_entry_dealtor.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/cc_ht_map_/cond_key_dtor_entry_dealtor.hpp
deleted file mode 100644
index 343dc512653..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/cc_ht_map_/cond_key_dtor_entry_dealtor.hpp
+++ /dev/null
@@ -1,138 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file cond_key_dtor_entry_dealtor.hpp
- * Contains a conditional key destructor, used for exception handling.
- */
-
-namespace pb_assoc
-{
-
-  namespace detail
-  {
-
-#define PB_ASSOC_CLASS_T_DEC \
-	template<class HT_Map>
-
-#define PB_ASSOC_CLASS_C_DEC \
-	PB_ASSOC_CKDED_CLASS_NAME< \
-		HT_Map>
-
-    /**
-     * A conditional key destructor, used for exception handling.
-     **/
-    template<class HT_Map>
-    class PB_ASSOC_CKDED_CLASS_NAME
-    {
-    public:
-      typedef typename HT_Map::entry entry;
-
-      typedef typename HT_Map::entry_allocator entry_allocator;
-
-      typedef typename HT_Map::key_type key_type;
-
-    public:
-      inline
-      PB_ASSOC_CKDED_CLASS_NAME(entry_allocator* p_a, entry* p_e);
-
-      inline
-      ~PB_ASSOC_CKDED_CLASS_NAME();
-
-      inline void
-      set_key_destruct();
-
-      inline void
-      set_no_action_destructor();
-
-    protected:
-      entry_allocator* const m_p_a;
-      entry* const m_p_e;
-
-      bool m_key_destruct;
-      bool m_no_action_destructor;
-    };
-
-    PB_ASSOC_CLASS_T_DEC
-    inline
-    PB_ASSOC_CLASS_C_DEC::
-    PB_ASSOC_CKDED_CLASS_NAME(entry_allocator* p_a, entry* p_e) :
-      m_p_a(p_a),
-      m_p_e(p_e),
-      m_key_destruct(false),
-      m_no_action_destructor(false)
-    { }
-
-    PB_ASSOC_CLASS_T_DEC
-    inline void
-    PB_ASSOC_CLASS_C_DEC::
-    set_key_destruct()
-    {
-      m_key_destruct = true;
-    }
-
-    PB_ASSOC_CLASS_T_DEC
-    inline void
-    PB_ASSOC_CLASS_C_DEC::
-    set_no_action_destructor()
-    {
-      m_no_action_destructor = true;
-    }
-
-    PB_ASSOC_CLASS_T_DEC
-    inline
-    PB_ASSOC_CLASS_C_DEC::
-    ~PB_ASSOC_CKDED_CLASS_NAME()
-    {
-      if (m_no_action_destructor)
-	return;
-
-      if (m_key_destruct)
-	m_p_e->m_value.first.~key_type();
-
-      m_p_a->deallocate(m_p_e, 1);
-    }
-
-#undef PB_ASSOC_CLASS_T_DEC
-#undef PB_ASSOC_CLASS_C_DEC
-
-  } // namespace detail
-
-} // namespace pb_assoc
-
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/cc_ht_map_/constructor_destructor_fn_imps.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/cc_ht_map_/constructor_destructor_fn_imps.hpp
deleted file mode 100644
index 4dedb91259d..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/cc_ht_map_/constructor_destructor_fn_imps.hpp
+++ /dev/null
@@ -1,227 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file constructor_destructor_fn_imps.hpp
- * Contains implementations of cc_ht_map_'s constructors, destructor,
- *	and related functions.
- */
-
-PB_ASSOC_CLASS_T_DEC
-typename PB_ASSOC_CLASS_C_DEC::entry_allocator
-PB_ASSOC_CLASS_C_DEC::s_entry_allocator;
-
-PB_ASSOC_CLASS_T_DEC
-typename PB_ASSOC_CLASS_C_DEC::entry_pointer_allocator
-PB_ASSOC_CLASS_C_DEC::s_entry_pointer_allocator;
-
-PB_ASSOC_CLASS_T_DEC
-template<class It>
-void
-PB_ASSOC_CLASS_C_DEC::
-copy_from_range(It first_it, It last_it)
-{
-  while (first_it != last_it)
-    insert(*(first_it++));
-}
-
-PB_ASSOC_CLASS_T_DEC
-PB_ASSOC_CLASS_C_DEC::
-PB_ASSOC_CLASS_NAME() :
-  my_ranged_hash_fn_base(Resize_Policy::get_init_size()),
-  m_a_p_entries(s_entry_pointer_allocator.allocate(
-						   Resize_Policy::get_init_size())),
-  m_num_e_p(Resize_Policy::get_init_size()),
-  m_num_used_e(0)
-{
-  std::fill(m_a_p_entries, m_a_p_entries + m_num_e_p, (entry_pointer)NULL);
-
-  PB_ASSOC_DBG_ONLY(PB_ASSOC_CLASS_C_DEC::assert_valid();)
-    }
-
-PB_ASSOC_CLASS_T_DEC
-PB_ASSOC_CLASS_C_DEC::
-PB_ASSOC_CLASS_NAME(const Hash_Fn& r_hash_fn) :
-  my_ranged_hash_fn_base(Resize_Policy::get_init_size(),
-			 r_hash_fn),
-  m_a_p_entries(s_entry_pointer_allocator.allocate(
-						   Resize_Policy::get_init_size())),
-  m_num_e_p(Resize_Policy::get_init_size()),
-  m_num_used_e(0)
-{
-  std::fill(m_a_p_entries, m_a_p_entries + m_num_e_p, (entry_pointer)NULL);
-
-  PB_ASSOC_DBG_ONLY(PB_ASSOC_CLASS_C_DEC::assert_valid();)
-    }
-
-PB_ASSOC_CLASS_T_DEC
-PB_ASSOC_CLASS_C_DEC::
-PB_ASSOC_CLASS_NAME(const Hash_Fn& r_hash_fn, const Eq_Fn& r_eq_fn) :
-  PB_ASSOC_HASH_EQ_FN_C_DEC(r_eq_fn),
-  my_ranged_hash_fn_base(Resize_Policy::get_init_size(),
-			 r_hash_fn),
-  m_a_p_entries(s_entry_pointer_allocator.allocate(
-						   Resize_Policy::get_init_size())),
-  m_num_e_p(Resize_Policy::get_init_size()),
-  m_num_used_e(0)
-{
-  std::fill(m_a_p_entries, m_a_p_entries + m_num_e_p, (entry_pointer)NULL);
-
-  PB_ASSOC_DBG_ONLY(PB_ASSOC_CLASS_C_DEC::assert_valid();)
-    }
-
-PB_ASSOC_CLASS_T_DEC
-PB_ASSOC_CLASS_C_DEC::
-PB_ASSOC_CLASS_NAME(const Hash_Fn& r_hash_fn, const Eq_Fn& r_eq_fn, const Comb_Hash_Fn& r_comb_hash_fn) :
-  PB_ASSOC_HASH_EQ_FN_C_DEC(r_eq_fn),
-  my_ranged_hash_fn_base(Resize_Policy::get_init_size(),
-			 r_hash_fn, r_comb_hash_fn),
-  m_a_p_entries(s_entry_pointer_allocator.allocate(
-						   Resize_Policy::get_init_size())),
-  m_num_e_p(Resize_Policy::get_init_size()),
-  m_num_used_e(0)
-{
-  std::fill(m_a_p_entries, m_a_p_entries + m_num_e_p, (entry_pointer)NULL);
-
-  PB_ASSOC_DBG_ONLY(PB_ASSOC_CLASS_C_DEC::assert_valid();)
-    }
-
-PB_ASSOC_CLASS_T_DEC
-PB_ASSOC_CLASS_C_DEC::
-PB_ASSOC_CLASS_NAME(const Hash_Fn& r_hash_fn, const Eq_Fn& r_eq_fn, const Comb_Hash_Fn& r_comb_hash_fn, const Resize_Policy& r_resize_policy) :
-  PB_ASSOC_HASH_EQ_FN_C_DEC(r_eq_fn),
-  Resize_Policy(r_resize_policy),
-  my_ranged_hash_fn_base(Resize_Policy::get_init_size(),
-			 r_hash_fn, r_comb_hash_fn),
-  m_a_p_entries(s_entry_pointer_allocator.allocate(
-						   Resize_Policy::get_init_size())),
-  m_num_e_p(Resize_Policy::get_init_size()),
-  m_num_used_e(0)
-{
-  std::fill(m_a_p_entries, m_a_p_entries + m_num_e_p, (entry_pointer)NULL);
-
-  PB_ASSOC_DBG_ONLY(PB_ASSOC_CLASS_C_DEC::assert_valid();)
-    }
-
-PB_ASSOC_CLASS_T_DEC
-PB_ASSOC_CLASS_C_DEC::
-PB_ASSOC_CLASS_NAME(const PB_ASSOC_CLASS_C_DEC& r_other) :
-  PB_ASSOC_HASH_EQ_FN_C_DEC(r_other),
-  my_resize_base(r_other),
-  my_ranged_hash_fn_base(r_other),
-  m_a_p_entries(s_entry_pointer_allocator.allocate(
-						   r_other.m_num_e_p)),
-  m_num_e_p(r_other.m_num_e_p),
-  m_num_used_e(r_other.m_num_used_e)
-{
-  PB_ASSOC_DBG_ONLY(r_other.assert_valid();)
-
-    std::fill(m_a_p_entries, m_a_p_entries + m_num_e_p, (entry_pointer)NULL);
-
-  try
-    {
-      for (size_type i  = 0; i < m_num_e_p; ++i)
-	{
-	  entry_pointer p_e = r_other.m_a_p_entries[i];
-
-	  while (p_e != NULL)
-	    {
-	      constructor_insert_new_imp(
-					 const_mapped_reference(p_e->m_value), i,
-					 my_hash_traits_base::s_store_hash_indicator);
-
-	      p_e = p_e->m_p_next;
-	    }
-	}
-    }
-  catch(...)
-    {
-      deallocate_all();
-
-      throw;
-    }
-
-  PB_ASSOC_DBG_ONLY(PB_ASSOC_CLASS_C_DEC::assert_valid();)
-    }
-
-PB_ASSOC_CLASS_T_DEC
-PB_ASSOC_CLASS_C_DEC::
-~PB_ASSOC_CLASS_NAME()
-{
-  deallocate_all();
-}
-
-PB_ASSOC_CLASS_T_DEC
-void
-PB_ASSOC_CLASS_C_DEC::
-swap(PB_ASSOC_CLASS_C_DEC& r_other)
-{
-  PB_ASSOC_DBG_ONLY(assert_valid());
-  PB_ASSOC_DBG_ONLY(r_other.assert_valid());
-
-  std::swap(m_a_p_entries, r_other.m_a_p_entries);
-
-  std::swap(m_num_e_p, r_other.m_num_e_p);
-
-  std::swap(m_num_used_e, r_other.m_num_used_e);
-
-  my_ranged_hash_fn_base::swap(r_other);
-
-  my_hash_eq_fn_base::swap(r_other);
-
-  my_resize_base::swap(r_other);
-
-  PB_ASSOC_DBG_ONLY(my_map_debug_base::swap(r_other));
-
-  PB_ASSOC_DBG_ONLY(assert_valid());
-  PB_ASSOC_DBG_ONLY(r_other.assert_valid());
-}
-
-PB_ASSOC_CLASS_T_DEC
-void
-PB_ASSOC_CLASS_C_DEC::
-deallocate_all()
-{
-  clear();
-
-  s_entry_pointer_allocator.deallocate(m_a_p_entries, m_num_e_p);
-}
-
-#include <ext/pb_assoc/detail/cc_ht_map_/constructor_destructor_store_hash_fn_imps.hpp>
-#include <ext/pb_assoc/detail/cc_ht_map_/constructor_destructor_no_store_hash_fn_imps.hpp>
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/cc_ht_map_/constructor_destructor_no_store_hash_fn_imps.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/cc_ht_map_/constructor_destructor_no_store_hash_fn_imps.hpp
deleted file mode 100644
index 6687d5dff83..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/cc_ht_map_/constructor_destructor_no_store_hash_fn_imps.hpp
+++ /dev/null
@@ -1,61 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file constructor_destructor_no_store_hash_fn_imps.hpp
- * Contains implementations of cc_ht_map_'s constructors, destructor,
- *	and related functions.
- */
-
-PB_ASSOC_CLASS_T_DEC
-inline void
-PB_ASSOC_CLASS_C_DEC::
-constructor_insert_new_imp(const_mapped_reference r_val, size_type pos, int_to_type<false>)
-{
-  // Following lines might throw an exception.
-  entry_pointer p_e = get_entry(r_val, my_traits_base::s_no_throw_copies_indicator);
-
-  // At this point no exceptions can be thrown.
-
-  p_e->m_p_next = m_a_p_entries[pos];
-
-  m_a_p_entries[pos] = p_e;
-
-  PB_ASSOC_DBG_ONLY(my_map_debug_base::insert_new(r_key);)
-    }
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/cc_ht_map_/constructor_destructor_store_hash_fn_imps.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/cc_ht_map_/constructor_destructor_store_hash_fn_imps.hpp
deleted file mode 100644
index 2ea0864a456..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/cc_ht_map_/constructor_destructor_store_hash_fn_imps.hpp
+++ /dev/null
@@ -1,63 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file constructor_destructor_no_store_hash_fn_imps.hpp
- * Contains implementations of cc_ht_map_'s constructors, destructor,
- *	and related functions.
- */
-
-PB_ASSOC_CLASS_T_DEC
-inline void
-PB_ASSOC_CLASS_C_DEC::
-constructor_insert_new_imp(const_reference r_val, size_type pos, int_to_type<true>)
-{
-  // Following lines might throw an exception.
-  entry_pointer p_e = get_entry(r_val, my_traits_base::s_no_throw_copies_indicator);
-
-  // At this point no exceptions can be thrown.
-
-  p_e->m_p_next = m_a_p_entries[pos];
-
-  p_e->m_hash = my_ranged_hash_fn_base::operator()((const_key_reference)(PB_ASSOC_V2F(p_e->m_value))).second;
-
-  m_a_p_entries[pos] = p_e;
-
-  PB_ASSOC_DBG_ONLY(my_map_debug_base::insert_new(r_key);)
-    }
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/cc_ht_map_/debug_fn_imps.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/cc_ht_map_/debug_fn_imps.hpp
deleted file mode 100644
index cd58e234ff4..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/cc_ht_map_/debug_fn_imps.hpp
+++ /dev/null
@@ -1,83 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file debug_fn_imps.hpp
- * Contains implementations of cc_ht_map_'s debug-mode functions.
- */
-
-#ifdef PB_ASSOC_CC_HT_MAP_DEBUG
-
-PB_ASSOC_CLASS_T_DEC
-void
-PB_ASSOC_CLASS_C_DEC::
-assert_valid() const
-{
-  my_map_debug_base::check_size(m_num_used_e);
-
-  assert_entry_pointer_array_valid(m_a_p_entries);
-}
-
-PB_ASSOC_CLASS_T_DEC
-void
-PB_ASSOC_CLASS_C_DEC::
-assert_entry_pointer_array_valid(const entry_pointer_array a_p_entries) const
-{
-  size_type iterated_num_used_e = 0;
-
-  for (size_type pos = 0; pos < m_num_e_p; ++pos)
-    {
-      entry_pointer p_e = a_p_entries[pos];
-
-      while (p_e != NULL)
-	{
-	  ++iterated_num_used_e;
-
-	  assert_entry_pointer_valid(p_e, my_traits_base::m_store_hash_indicator);
-
-	  p_e = p_e->m_p_next;
-	}
-    }
-
-  PB_ASSOC_DBG_ASSERT(iterated_num_used_e == m_num_used_e);
-}
-
-#include <ext/pb_assoc/detail/cc_ht_map_/debug_store_hash_fn_imps.hpp>
-#include <ext/pb_assoc/detail/cc_ht_map_/debug_no_store_hash_fn_imps.hpp>
-#endif // #ifdef PB_ASSOC_CC_HT_MAP_DEBUG
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/cc_ht_map_/debug_no_store_hash_fn_imps.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/cc_ht_map_/debug_no_store_hash_fn_imps.hpp
deleted file mode 100644
index 889b59d39a2..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/cc_ht_map_/debug_no_store_hash_fn_imps.hpp
+++ /dev/null
@@ -1,54 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file debug_no_store_hash_fn_imps.hpp
- * Contains implementations of cc_ht_map_'s debug-mode functions.
- */
-
-#ifdef PB_ASSOC_CC_HT_MAP_DEBUG
-
-PB_ASSOC_CLASS_T_DEC
-void
-PB_ASSOC_CLASS_C_DEC::
-assert_entry_pointer_valid(const entry_pointer  p_e, store_hash_false_indicator) const
-{
-  my_map_debug_base::check_key_exists(p_e->m_value.first);
-}
-#endif // #ifdef PB_ASSOC_CC_HT_MAP_DEBUG
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/cc_ht_map_/debug_store_hash_fn_imps.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/cc_ht_map_/debug_store_hash_fn_imps.hpp
deleted file mode 100644
index 41b520ebb47..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/cc_ht_map_/debug_store_hash_fn_imps.hpp
+++ /dev/null
@@ -1,59 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file debug_store_hash_fn_imps.hpp
- * Contains implementations of cc_ht_map_'s debug-mode functions.
- */
-
-#ifdef PB_ASSOC_CC_HT_MAP_DEBUG
-
-PB_ASSOC_CLASS_T_DEC
-void
-PB_ASSOC_CLASS_C_DEC::
-assert_entry_pointer_valid(const entry_pointer  p_e, store_hash_true_indicator) const
-{
-  my_map_debug_base::check_key_exists(p_e->m_value.first);
-
-  comp_hash pos_hash_pair =
-    my_ranged_hash_fn_base::operator()(p_e->m_value.first);
-
-  PB_ASSOC_DBG_ASSERT(p_e->m_hash == pos_hash_pair.second);
-}
-#endif // #ifdef PB_ASSOC_CC_HT_MAP_DEBUG
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/cc_ht_map_/entry_list_fn_imps.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/cc_ht_map_/entry_list_fn_imps.hpp
deleted file mode 100644
index e5297ec1899..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/cc_ht_map_/entry_list_fn_imps.hpp
+++ /dev/null
@@ -1,111 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file entry_list_fn_imps.hpp
- * Contains implementations of cc_ht_map_'s entry-list related functions.
- */
-
-PB_ASSOC_CLASS_T_DEC
-void
-PB_ASSOC_CLASS_C_DEC::
-deallocate_links_in_list(entry_pointer p_e)
-{
-  while (p_e != NULL)
-    {
-      entry_pointer p_dealloc_e = p_e;
-
-      p_e = p_e->m_p_next;
-
-      s_entry_allocator.deallocate(p_dealloc_e, 1);
-    }
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::entry_pointer
-PB_ASSOC_CLASS_C_DEC::
-get_entry(const_mapped_reference r_val, int_to_type<true>)
-{
-  // Following line might throw an exception.
-
-  entry_pointer p_e = s_entry_allocator.allocate(1);
-
-  // Following lines* cannot* throw an exception.
-
-  new (&p_e->m_value) mapped_value_type(r_val);
-
-  return (p_e);
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::entry_pointer
-PB_ASSOC_CLASS_C_DEC::
-get_entry(const_mapped_reference r_val, int_to_type<false>)
-{
-  // Following line might throw an exception.
-
-  entry_pointer p_e = s_entry_allocator.allocate(1);
-
-  cond_dealtor_t cond(p_e);
-
-  // Following lines might throw an exception.
-
-  new (&p_e->m_value) mapped_value_type(r_val);
-
-  cond.set_no_action();
-
-  return (p_e);
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline void
-PB_ASSOC_CLASS_C_DEC::
-rels_entry(entry_pointer p_e)
-{
-  /* The following lines cannot throw exceptions
-   *	(unless if key-data dtors do). */
-
-  PB_ASSOC_V2F(p_e->m_value).~Key();
-#ifdef PB_ASSOC_DATA_TRUE_INDICATOR
-  p_e->m_value.second.~data_type();
-#endif // #ifdef PB_ASSOC_DATA_TRUE_INDICATOR
-
-  s_entry_allocator.deallocate(p_e, 1);
-}
-
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/cc_ht_map_/erase_fn_imps.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/cc_ht_map_/erase_fn_imps.hpp
deleted file mode 100644
index c9875c7d082..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/cc_ht_map_/erase_fn_imps.hpp
+++ /dev/null
@@ -1,114 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file erase_fn_imps.hpp
- * Contains implementations of cc_ht_map_'s erase related functions.
- */
-
-PB_ASSOC_CLASS_T_DEC
-inline void
-PB_ASSOC_CLASS_C_DEC::
-erase_entry_pointer(entry_pointer& r_p_e)
-{
-  PB_ASSOC_DBG_ONLY(my_map_debug_base::erase_existing(r_p_e->m_value.first));
-
-  entry_pointer p_e = r_p_e;
-
-  r_p_e = r_p_e->m_p_next;
-
-  rels_entry(p_e);
-
-  PB_ASSOC_DBG_ASSERT(m_num_used_e > 0);
-  my_resize_base::notify_erased(--m_num_used_e);
-}
-
-PB_ASSOC_CLASS_T_DEC
-template<class Pred>
-inline typename PB_ASSOC_CLASS_C_DEC::size_type
-PB_ASSOC_CLASS_C_DEC::
-erase_if(Pred& r_pred)
-{
-  size_type num_num_ersd = 0;
-
-  for (size_type pos = 0; pos < m_num_e_p; ++pos)
-    {
-      size_t num_ersd = 0;
-
-      if (m_a_p_entries[pos] != NULL&& 
-	  r_pred(m_a_p_entries[pos]->m_value))
-	{
-	  ++num_ersd;
-
-	  erase_entry_pointer(m_a_p_entries[pos]);
-	}
-
-      entry_pointer p_e = m_a_p_entries[pos];
-
-      while (p_e != NULL&&  p_e->m_p_next != NULL)
-	if (r_pred(p_e->m_p_next->m_value))
-	  {
-	    ++num_num_ersd;
-
-	    erase_entry_pointer(p_e->m_p_next);
-	  }
-    }
-
-  do_resize_if_needed_no_throw();
-
-  return (num_num_ersd);
-}
-
-PB_ASSOC_CLASS_T_DEC
-void
-PB_ASSOC_CLASS_C_DEC::
-clear()
-{
-  for (size_type pos = 0; pos < m_num_e_p; ++pos)
-    while (m_a_p_entries[pos] != NULL)
-      erase_entry_pointer(m_a_p_entries[pos]);
-
-  do_resize_if_needed_no_throw();
-
-  my_resize_base::notify_cleared();
-}
-
-#include <ext/pb_assoc/detail/cc_ht_map_/erase_no_store_hash_fn_imps.hpp>
-#include <ext/pb_assoc/detail/cc_ht_map_/erase_store_hash_fn_imps.hpp>
-
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/cc_ht_map_/erase_no_store_hash_fn_imps.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/cc_ht_map_/erase_no_store_hash_fn_imps.hpp
deleted file mode 100644
index 2ad4444bcff..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/cc_ht_map_/erase_no_store_hash_fn_imps.hpp
+++ /dev/null
@@ -1,159 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file erase_no_store_hash_fn_imps.hpp
- * Contains implementations of cc_ht_map_'s erase related functions, when the hash
- *	value is not stored.
- */
-
-PB_ASSOC_CLASS_T_DEC
-template<class T>
-inline typename PB_ASSOC_CLASS_C_DEC::size_type
-PB_ASSOC_CLASS_C_DEC::
-erase(T r_t, bool erase_entry_if_last, pb_assoc::detail::int_to_type<false>)
-{
-  PB_ASSOC_DBG_ONLY(assert_valid();)
-
-    return (erase_in_pos_imp<T>(r_t,
-				erase_entry_if_last,
-				my_ranged_hash_fn_base::operator()(
-								   my_traits_base::ext_eraser::extract_key(r_t))));
-}
-
-PB_ASSOC_CLASS_T_DEC
-template<class T>
-inline typename PB_ASSOC_CLASS_C_DEC::size_type
-PB_ASSOC_CLASS_C_DEC::
-erase_in_pos_imp(T r_t, bool erase_entry_if_last, size_type pos)
-{
-  PB_ASSOC_DBG_ONLY(assert_valid();)
-
-    entry_pointer p_e = m_a_p_entries[pos];
-
-  my_resize_base::notify_erase_search_start();
-
-  if (p_e == NULL)
-    {
-      my_resize_base::notify_erase_search_end();
-
-      PB_ASSOC_DBG_ONLY(my_map_debug_base::check_key_does_not_exist(
-								    ext_eraser::extract_key(r_t));)
-
-	PB_ASSOC_DBG_ONLY(assert_valid();)
-
-	return (0);
-    }
-
-  if (my_hash_eq_fn_base::operator()(
-				     p_e->m_value.first,
-				     my_traits_base::ext_eraser::extract_key(r_t)))
-    {
-      my_resize_base::notify_erase_search_end();
-
-      PB_ASSOC_DBG_ONLY(my_map_debug_base::
-			check_key_exists(my_traits_base::ext_eraser::extract_key(r_t));)
-
-	std::pair<size_type, bool> ers_pair =
-	my_traits_base::ext_eraser::erase(
-					  PB_ASSOC_EP2VP(m_a_p_entries[pos]),
-					  r_t, erase_entry_if_last);
-
-      if (ers_pair.second)
-	{
-	  erase_entry_pointer(m_a_p_entries[pos]);
-
-	  do_resize_if_needed_no_throw();
-	}
-
-      PB_ASSOC_DBG_ONLY(assert_valid();)
-
-	return (ers_pair.first);
-    }
-
-  while (true)
-    {
-      entry_pointer p_next_e = p_e->m_p_next;
-
-      if (p_next_e == NULL)
-	{
-	  my_resize_base::notify_erase_search_end();
-
-	  PB_ASSOC_DBG_ONLY(my_map_debug_base::
-			    check_key_does_not_exist(
-						     my_traits_base::ext_eraser::extract_key(r_t));)
-
-	    PB_ASSOC_DBG_ONLY(assert_valid();)
-
-	    return (0);
-	}
-
-      if (my_hash_eq_fn_base::operator()(
-					 p_next_e->m_value.first,
-					 my_traits_base::ext_eraser::extract_key(r_t)))
-	{
-	  my_resize_base::notify_erase_search_end();
-
-	  PB_ASSOC_DBG_ONLY(my_map_debug_base::
-			    check_key_exists(
-					     my_traits_base::ext_eraser::extract_key(r_t));)
-
-	    std::pair<size_type, bool> ers_pair =
-	    my_traits_base::ext_eraser::erase(
-					      PB_ASSOC_EP2VP(p_e->m_p_next),
-					      r_t, erase_entry_if_last);
-
-	  if (ers_pair.second)
-	    {
-	      erase_entry_pointer(p_e->m_p_next);
-
-	      do_resize_if_needed_no_throw();
-	    }
-
-	  PB_ASSOC_DBG_ONLY(assert_valid();)
-
-	    return (ers_pair.first);
-	}
-
-      my_resize_base::notify_erase_search_collision();
-
-      p_e = p_next_e;
-    }
-}
-
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/cc_ht_map_/erase_store_hash_fn_imps.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/cc_ht_map_/erase_store_hash_fn_imps.hpp
deleted file mode 100644
index e3d429f8390..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/cc_ht_map_/erase_store_hash_fn_imps.hpp
+++ /dev/null
@@ -1,159 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file erase_store_hash_fn_imps.hpp
- * Contains implementations of cc_ht_map_'s erase related functions, when the hash
- *	value is stored.
- */
-
-PB_ASSOC_CLASS_T_DEC
-template<class T>
-inline typename PB_ASSOC_CLASS_C_DEC::size_type
-PB_ASSOC_CLASS_C_DEC::
-erase(T r_t, bool erase_entry_if_last, pb_assoc::detail::int_to_type<true>)
-{
-  PB_ASSOC_DBG_ONLY(assert_valid();)
-
-    return (erase_in_pos_imp<T>(r_t, erase_entry_if_last,
-				my_ranged_hash_fn_base::operator()(
-								   my_traits_base::ext_eraser::extract_key(r_t))));
-}
-
-PB_ASSOC_CLASS_T_DEC
-template<class T>
-inline typename PB_ASSOC_CLASS_C_DEC::size_type
-PB_ASSOC_CLASS_C_DEC::
-erase_in_pos_imp(T r_t, bool erase_entry_if_last, const comp_hash& r_pos_hash_pair)
-{
-  PB_ASSOC_DBG_ONLY(assert_valid();)
-
-    entry_pointer p_e = m_a_p_entries[r_pos_hash_pair.first];
-
-  my_resize_base::notify_erase_search_start();
-
-  if (p_e == NULL)
-    {
-      my_resize_base::notify_erase_search_end();
-
-      PB_ASSOC_DBG_ONLY(my_map_debug_base::
-			check_key_does_not_exist(
-						 my_traits_base::ext_eraser::extract_key(r_t));)
-
-	PB_ASSOC_DBG_ONLY(assert_valid();)
-
-	return (0);
-    }
-
-  if (my_hash_eq_fn_base::operator()(p_e->m_value.first, p_e->m_hash,
-				     my_traits_base::ext_eraser::extract_key(r_t), r_pos_hash_pair.second))
-    {
-      my_resize_base::notify_erase_search_end();
-
-      PB_ASSOC_DBG_ONLY(my_map_debug_base::check_key_exists(
-							    my_traits_base::ext_eraser::extract_key(r_t));)
-
-	std::pair<size_type, bool> ers_pair =
-	my_traits_base::ext_eraser::erase(
-					  PB_ASSOC_EP2VP(m_a_p_entries[r_pos_hash_pair.first]),
-					  r_t, erase_entry_if_last);
-
-      if (ers_pair.second)
-	{
-	  erase_entry_pointer(m_a_p_entries[r_pos_hash_pair.first]);
-
-	  do_resize_if_needed_no_throw();
-	}
-
-      PB_ASSOC_DBG_ONLY(assert_valid();)
-
-	return (ers_pair.first);
-    }
-
-  while (true)
-    {
-      entry_pointer p_next_e = p_e->m_p_next;
-
-      if (p_next_e == NULL)
-	{
-	  my_resize_base::notify_erase_search_end();
-
-	  PB_ASSOC_DBG_ONLY(my_map_debug_base::
-			    check_key_does_not_exist(
-						     my_traits_base::ext_eraser::extract_key(r_t));)
-
-	    PB_ASSOC_DBG_ONLY(assert_valid();)
-
-	    return (0);
-	}
-
-      if (my_hash_eq_fn_base::operator()(
-					 p_next_e->m_value.first, p_next_e->m_hash,
-					 my_traits_base::ext_eraser::extract_key(r_t),
-					 r_pos_hash_pair.second))
-	{
-	  my_resize_base::notify_erase_search_end();
-
-	  PB_ASSOC_DBG_ONLY(my_map_debug_base::
-			    check_key_exists(
-					     my_traits_base::ext_eraser::extract_key(r_t));)
-
-	    std::pair<size_type, bool> ers_pair =
-	    my_traits_base::ext_eraser::erase(
-					      PB_ASSOC_EP2VP(p_e->m_p_next),
-					      r_t, erase_entry_if_last);
-
-	  if (ers_pair.second)
-	    {
-	      erase_entry_pointer(p_e->m_p_next);
-
-	      do_resize_if_needed_no_throw();
-	    }
-
-	  PB_ASSOC_DBG_ONLY(assert_valid();)
-
-	    return (ers_pair.first);
-	}
-
-      my_resize_base::notify_erase_search_collision();
-
-      p_e = p_next_e;
-    }
-}
-
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/cc_ht_map_/find_fn_imps.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/cc_ht_map_/find_fn_imps.hpp
deleted file mode 100644
index a287d5bffb9..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/cc_ht_map_/find_fn_imps.hpp
+++ /dev/null
@@ -1,83 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file find_fn_imps.hpp
- * Contains implementations of cc_ht_map_'s find related functions.
- */
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::find_iterator
-PB_ASSOC_CLASS_C_DEC::
-find(const_key_reference r_key)
-{
-  PB_ASSOC_DBG_ONLY(assert_valid();)
-
-    return (find_key_pointer(r_key, my_hash_traits_base::s_store_hash_indicator));
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::const_find_iterator
-PB_ASSOC_CLASS_C_DEC::
-find(const_key_reference r_key) const
-{
-  PB_ASSOC_DBG_ONLY(assert_valid();)
-
-    return (const_cast<PB_ASSOC_CLASS_C_DEC& >(*this).find_key_pointer(r_key, my_hash_traits_base::s_store_hash_indicator));
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::find_iterator
-PB_ASSOC_CLASS_C_DEC::
-find_end()
-{
-  return (NULL);
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::const_find_iterator
-PB_ASSOC_CLASS_C_DEC::
-find_end() const
-{
-  return (NULL);
-}
-
-#include <ext/pb_assoc/detail/cc_ht_map_/find_no_store_hash_fn_imps.hpp>
-#include <ext/pb_assoc/detail/cc_ht_map_/find_store_hash_fn_imps.hpp>
-
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/cc_ht_map_/find_no_store_hash_fn_imps.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/cc_ht_map_/find_no_store_hash_fn_imps.hpp
deleted file mode 100644
index c0d404d2faf..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/cc_ht_map_/find_no_store_hash_fn_imps.hpp
+++ /dev/null
@@ -1,86 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file find_no_store_hash_fn_imps.hpp
- * Contains implementations of cc_ht_map_'s find related functions, when the hash
- *	value is not stored.
- */
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::const_data_reference
-PB_ASSOC_CLASS_C_DEC::
-const_subscript_imp(const_key_reference r_key, int_to_type<false>) const
-{
-  PB_ASSOC_DBG_ONLY(assert_valid();)
-
-    return (const_cast<PB_ASSOC_CLASS_C_DEC& >(*this).
-	    find_key_pointer(r_key, my_hash_traits_base::s_store_hash_indicator)->second);
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::pointer
-PB_ASSOC_CLASS_C_DEC::
-find_key_pointer(const_key_reference r_key, int_to_type<false>)
-{
-  entry_pointer p_e =
-    m_a_p_entries[my_ranged_hash_fn_base::operator()(r_key)];
-
-  my_resize_base::notify_find_search_start();
-
-  while (p_e != NULL&& 
-	 !my_hash_eq_fn_base::operator()(PB_ASSOC_V2F(p_e->m_value), r_key))
-    {
-      my_resize_base::notify_find_search_collision();
-
-      p_e = p_e->m_p_next;
-    }
-
-  my_resize_base::notify_find_search_end();
-
-#ifdef PB_ASSOC_CC_HT_MAP_DEBUG
-  if (p_e == NULL)
-    my_map_debug_base::check_key_does_not_exist(r_key);
-  else
-    my_map_debug_base::check_key_exists(r_key);
-#endif // #ifdef PB_ASSOC_CC_HT_MAP_DEBUG
-
-  return (&p_e->m_value);
-}
-
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/cc_ht_map_/find_store_hash_fn_imps.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/cc_ht_map_/find_store_hash_fn_imps.hpp
deleted file mode 100644
index 3b9571e13b5..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/cc_ht_map_/find_store_hash_fn_imps.hpp
+++ /dev/null
@@ -1,88 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file find_store_hash_fn_imps.hpp
- * Contains implementations of cc_ht_map_'s find related functions, when the hash
- *	value is stored.
- */
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::const_data_reference
-PB_ASSOC_CLASS_C_DEC::
-const_subscript_imp(const_key_reference r_key, int_to_type<true>)  const
-{
-  PB_ASSOC_DBG_ONLY(assert_valid();)
-
-    return (const_cast<PB_ASSOC_CLASS_C_DEC& >(*this).find_key_pointer(r_key, my_traits_base::m_store_hash_indicator)->second);
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::pointer
-PB_ASSOC_CLASS_C_DEC::
-find_key_pointer(const_key_reference r_key, int_to_type<true>)
-{
-  comp_hash pos_hash_pair = my_ranged_hash_fn_base::operator()(r_key);
-
-  entry_pointer p_e = m_a_p_entries[pos_hash_pair.first];
-
-  my_resize_base::notify_find_search_start();
-
-  while (p_e != NULL&& 
-	 !my_hash_eq_fn_base::operator()(PB_ASSOC_V2F(p_e->m_value),
-					 p_e->m_hash,
-					 r_key,
-					 pos_hash_pair.second))
-    {
-      my_resize_base::notify_find_search_collision();
-
-      p_e = p_e->m_p_next;
-    }
-
-  my_resize_base::notify_find_search_end();
-
-#ifdef PB_ASSOC_CC_HT_MAP_DEBUG
-  if (p_e == NULL)
-    my_map_debug_base::check_key_does_not_exist(r_key);
-  else
-    my_map_debug_base::check_key_exists(r_key);
-#endif // #ifdef PB_ASSOC_CC_HT_MAP_DEBUG
-
-  return (const_cast<pointer>(&p_e->m_value));
-}
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/cc_ht_map_/info_fn_imps.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/cc_ht_map_/info_fn_imps.hpp
deleted file mode 100644
index 98894c81c19..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/cc_ht_map_/info_fn_imps.hpp
+++ /dev/null
@@ -1,68 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file info_fn_imps.hpp
- * Contains implementations of cc_ht_map_'s entire container info related
- *	functions.
- */
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::size_type
-PB_ASSOC_CLASS_C_DEC::
-size() const
-{
-  return (m_num_used_e);
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::size_type
-PB_ASSOC_CLASS_C_DEC::
-max_size() const
-{
-  return (m_entry_allocator.max_size());
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline bool
-PB_ASSOC_CLASS_C_DEC::
-empty() const
-{
-  return (size() == 0);
-}
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/cc_ht_map_/insert_fn_imps.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/cc_ht_map_/insert_fn_imps.hpp
deleted file mode 100644
index 15d2353fd96..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/cc_ht_map_/insert_fn_imps.hpp
+++ /dev/null
@@ -1,63 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file insert_fn_imps.hpp
- * Contains implementations of cc_ht_map_'s insert related functions.
- */
-
-PB_ASSOC_CLASS_T_DEC
-inline std::pair<typename PB_ASSOC_CLASS_C_DEC::find_iterator, bool>
-PB_ASSOC_CLASS_C_DEC::
-insert(const_reference r_val)
-{
-  return (insert_imp(r_val, my_hash_traits_base::s_store_hash_indicator));
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::data_reference
-PB_ASSOC_CLASS_C_DEC::
-subscript_imp(const_key_reference r_key)
-{
-  return (subscript_imp(r_key, my_hash_traits_base::s_store_hash_indicator));
-}
-
-#include <ext/pb_assoc/detail/cc_ht_map_/insert_no_store_hash_fn_imps.hpp>
-#include <ext/pb_assoc/detail/cc_ht_map_/insert_store_hash_fn_imps.hpp>
-
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/cc_ht_map_/insert_no_store_hash_fn_imps.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/cc_ht_map_/insert_no_store_hash_fn_imps.hpp
deleted file mode 100644
index c6383a69a39..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/cc_ht_map_/insert_no_store_hash_fn_imps.hpp
+++ /dev/null
@@ -1,148 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file insert_no_store_hash_fn_imps.hpp
- * Contains implementations of cc_ht_map_'s insert related functions, when the hash
- *	value is not stored.
- */
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::data_reference
-PB_ASSOC_CLASS_C_DEC::
-subscript_imp(const_key_reference r_key, int_to_type<false>)
-{
-  PB_ASSOC_DBG_ONLY(assert_valid();)
-
-    const size_type pos = my_ranged_hash_fn_base::operator()(r_key);
-
-  entry_pointer p_e = m_a_p_entries[pos];
-
-  my_resize_base::notify_insert_search_start();
-
-  while (p_e != NULL&& 
-	 !my_hash_eq_fn_base::operator()(p_e->m_value.first, r_key))
-    {
-      my_resize_base::notify_insert_search_collision();
-
-      p_e = p_e->m_p_next;
-    }
-
-  my_resize_base::notify_insert_search_end();
-
-  if (p_e != NULL)
-    {
-      PB_ASSOC_DBG_ONLY(my_map_debug_base::check_key_exists(r_key);)
-
-	return (p_e->m_value.second);
-    }
-
-  PB_ASSOC_DBG_ONLY(my_map_debug_base::check_key_does_not_exist(r_key);)
-
-    return (insert_new_imp(std::make_pair(r_key, data_type()), pos)->second);
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline std::pair<typename PB_ASSOC_CLASS_C_DEC::find_iterator, bool>
-PB_ASSOC_CLASS_C_DEC::
-insert_imp(const_reference r_val, int_to_type<false>)
-{
-  PB_ASSOC_DBG_ONLY(assert_valid();)
-
-    const_key_reference r_key = PB_ASSOC_V2F(r_val);
-
-  const size_type pos = my_ranged_hash_fn_base::operator()(r_key);
-
-  entry_pointer p_e = m_a_p_entries[pos];
-
-  my_resize_base::notify_insert_search_start();
-
-  while (p_e != NULL&& 
-	 !my_hash_eq_fn_base::operator()(
-					 PB_ASSOC_V2F(p_e->m_value),
-					 r_key))
-    {
-      my_resize_base::notify_insert_search_collision();
-
-      p_e = p_e->m_p_next;
-    }
-
-  my_resize_base::notify_insert_search_end();
-
-  if (p_e != NULL)
-    {
-      PB_ASSOC_DBG_ONLY(my_map_debug_base::check_key_exists(r_key);)
-
-	return (std::make_pair(&p_e->m_value, false));
-    }
-
-  PB_ASSOC_DBG_ONLY(my_map_debug_base::check_key_does_not_exist(r_key);)
-
-    return (
-	    std::make_pair(
-			   insert_new_imp(r_val, pos),
-			   true));
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::pointer
-PB_ASSOC_CLASS_C_DEC::
-insert_new_imp(const_reference r_val, size_type pos)
-{
-  if (do_resize_if_needed())
-    pos = my_ranged_hash_fn_base::operator()(PB_ASSOC_V2F(r_val));
-
-  // Following lines might throw an exception.
-  entry_pointer p_e = get_entry(r_val, my_traits_base::s_no_throw_copies_indicator);
-
-  // At this point no exceptions can be thrown.
-
-  p_e->m_p_next = m_a_p_entries[pos];
-
-  m_a_p_entries[pos] = p_e;
-
-  my_resize_base::notify_inserted(++m_num_used_e);
-
-  PB_ASSOC_DBG_ONLY(my_map_debug_base::insert_new(r_key);)
-
-    PB_ASSOC_DBG_ONLY(assert_valid();)
-
-    return (&p_e->m_value);
-}
-
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/cc_ht_map_/insert_store_hash_fn_imps.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/cc_ht_map_/insert_store_hash_fn_imps.hpp
deleted file mode 100644
index f484fcae2bb..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/cc_ht_map_/insert_store_hash_fn_imps.hpp
+++ /dev/null
@@ -1,157 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file insert_store_hash_fn_imps.hpp
- * Contains implementations of cc_ht_map_'s insert related functions, when the hash
- *	value is stored.
- */
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::data_reference
-PB_ASSOC_CLASS_C_DEC::
-subscript_imp(const_key_reference r_key, int_to_type<true>)
-{
-  PB_ASSOC_DBG_ONLY(assert_valid();)
-
-    comp_hash pos_hash_pair = my_ranged_hash_fn_base::operator()(r_key);
-
-  entry_pointer p_e = m_a_p_entries[pos_hash_pair.first];
-
-  my_resize_base::notify_insert_search_start();
-
-  while (p_e != NULL&& 
-	 !my_hash_eq_fn_base::operator()(p_e->m_value.first, p_e->m_hash, r_key, pos_hash_pair.second))
-    {
-      my_resize_base::notify_insert_search_collision();
-
-      p_e = p_e->m_p_next;
-    }
-
-  my_resize_base::notify_insert_search_end();
-
-  if (p_e != NULL)
-    {
-      PB_ASSOC_DBG_ONLY(my_map_debug_base::check_key_exists(r_key);)
-
-	return (p_e->m_value.second);
-    }
-
-  PB_ASSOC_DBG_ONLY(my_map_debug_base::check_key_does_not_exist(r_key);)
-
-    return (insert_new_imp(
-			   value_type(r_key, Data()), pos_hash_pair)->second);
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline std::pair<typename PB_ASSOC_CLASS_C_DEC::find_iterator, bool>
-PB_ASSOC_CLASS_C_DEC::
-insert_imp(const_reference r_val, int_to_type<true>)
-{
-  PB_ASSOC_DBG_ONLY(assert_valid();)
-
-    const_key_reference r_key = PB_ASSOC_V2F(r_val);
-
-  comp_hash pos_hash_pair = my_ranged_hash_fn_base::operator()(r_key);
-
-  entry_pointer p_e = m_a_p_entries[pos_hash_pair.first];
-
-  my_resize_base::notify_insert_search_start();
-
-  while (p_e != NULL&& 
-	 !my_hash_eq_fn_base::operator()(
-					 PB_ASSOC_V2F(p_e->m_value),
-					 p_e->m_hash,
-					 r_key, pos_hash_pair.second))
-    {
-      my_resize_base::notify_insert_search_collision();
-
-      p_e = p_e->m_p_next;
-    }
-
-  my_resize_base::notify_insert_search_end();
-
-  if (p_e != NULL)
-    {
-      PB_ASSOC_DBG_ONLY(my_map_debug_base::check_key_exists(r_key);)
-
-	return (
-		std::make_pair(
-			       static_cast<pointer>(&p_e->m_value),
-			       false));
-    }
-
-  PB_ASSOC_DBG_ONLY(my_map_debug_base::check_key_does_not_exist(r_key);)
-
-    return (
-	    std::make_pair(
-			   insert_new_imp(r_val, pos_hash_pair),
-			   true));
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::pointer
-PB_ASSOC_CLASS_C_DEC::
-insert_new_imp(const_reference r_val, comp_hash& r_pos_hash_pair)
-{
-  // Following lines might throw an exception.
-
-  if (do_resize_if_needed())
-    r_pos_hash_pair = my_ranged_hash_fn_base::operator()(
-							 PB_ASSOC_V2F(r_val));
-
-  entry_pointer p_e = get_entry(r_val, my_traits_base::s_no_throw_copies_indicator);
-
-  // At this point no exceptions can be thrown.
-
-  p_e->m_hash = r_pos_hash_pair.second;
-
-  p_e->m_p_next = m_a_p_entries[r_pos_hash_pair.first];
-
-  m_a_p_entries[r_pos_hash_pair.first] = p_e;
-
-  my_resize_base::notify_inserted(++m_num_used_e);
-
-  PB_ASSOC_DBG_ONLY(my_map_debug_base::insert_new(r_key);)
-
-    PB_ASSOC_DBG_ONLY(assert_valid();)
-
-    return (static_cast<pointer>(&p_e->m_value));
-}
-
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/cc_ht_map_/iterators_fn_imps.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/cc_ht_map_/iterators_fn_imps.hpp
deleted file mode 100644
index c813a321c64..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/cc_ht_map_/iterators_fn_imps.hpp
+++ /dev/null
@@ -1,153 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file iterators_fn_imps.hpp
- * Contains implementations of cc_ht_map_'s iterators related functions, e.g.,
- *	begin().
- */
-
-PB_ASSOC_CLASS_T_DEC
-typename PB_ASSOC_CLASS_C_DEC::iterator
-PB_ASSOC_CLASS_C_DEC::s_end_it;
-
-PB_ASSOC_CLASS_T_DEC
-typename PB_ASSOC_CLASS_C_DEC::const_iterator
-PB_ASSOC_CLASS_C_DEC::s_const_end_it;
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::iterator
-PB_ASSOC_CLASS_C_DEC::
-begin()
-{
-  pointer p_value;
-  std::pair<entry_pointer, size_type> pos;
-
-  get_start_it_state(p_value, pos);
-
-  return (iterator(p_value, pos, this));
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::iterator
-PB_ASSOC_CLASS_C_DEC::
-end()
-{
-  return (s_end_it);
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::const_iterator
-PB_ASSOC_CLASS_C_DEC::
-begin() const
-{
-  pointer p_value;
-
-  std::pair<entry_pointer, size_type> pos;
-
-  get_start_it_state(p_value, pos);
-
-  return (const_iterator(p_value, pos, this));
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::const_iterator
-PB_ASSOC_CLASS_C_DEC::
-end() const
-{
-  return (s_const_end_it);
-}
-
-#ifdef PB_ASSOC_DATA_TRUE_INDICATOR
-PB_ASSOC_CLASS_T_DEC
-void
-PB_ASSOC_CLASS_C_DEC::
-inc_it_state(pointer& r_p_value, std::pair<entry_pointer, size_type>& r_pos) const
-{
-  inc_it_state((const_pointer& )r_p_value, r_pos);
-}
-#endif // #ifdef PB_ASSOC_DATA_TRUE_INDICATOR
-
-PB_ASSOC_CLASS_T_DEC
-void
-PB_ASSOC_CLASS_C_DEC::
-inc_it_state(const_pointer& r_p_value, std::pair<entry_pointer, size_type>& r_pos) const
-{
-  PB_ASSOC_DBG_ASSERT(r_p_value != NULL);
-
-  r_pos.first = r_pos.first->m_p_next;
-
-  if (r_pos.first != NULL)
-    {
-      r_p_value =& r_pos.first->m_value;
-
-      return;
-    }
-
-  for (++r_pos.second; r_pos.second < m_num_e_p; ++r_pos.second)
-    if (m_a_p_entries[r_pos.second] != NULL)
-      {
-	r_pos.first = m_a_p_entries[r_pos.second];
-
-	r_p_value =& r_pos.first->m_value;
-
-	return;
-      }
-
-  r_p_value = NULL;
-}
-
-PB_ASSOC_CLASS_T_DEC
-void
-PB_ASSOC_CLASS_C_DEC::
-get_start_it_state(pointer& r_p_value, std::pair<entry_pointer, size_type>& r_pos) const
-{
-  for (r_pos.second = 0; r_pos.second < m_num_e_p; ++r_pos.second)
-    if (m_a_p_entries[r_pos.second] != NULL)
-      {
-	r_pos.first = m_a_p_entries[r_pos.second];
-
-	r_p_value = (pointer)(r_pos.first);
-
-	return;
-      }
-
-  r_p_value = NULL;
-}
-
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/cc_ht_map_/policy_access_fn_imps.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/cc_ht_map_/policy_access_fn_imps.hpp
deleted file mode 100644
index 829298bdfdc..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/cc_ht_map_/policy_access_fn_imps.hpp
+++ /dev/null
@@ -1,108 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file policy_access_fn_imps.hpp
- * Contains implementations of cc_ht_map_'s policy access
- *	functions.
- */
-
-PB_ASSOC_CLASS_T_DEC
-Hash_Fn& 
-PB_ASSOC_CLASS_C_DEC::
-get_hash_fn()
-{
-  return (*this);
-}
-
-PB_ASSOC_CLASS_T_DEC
-const Hash_Fn& 
-PB_ASSOC_CLASS_C_DEC::
-get_hash_fn() const
-{
-  return (*this);
-}
-
-PB_ASSOC_CLASS_T_DEC
-Eq_Fn& 
-PB_ASSOC_CLASS_C_DEC::
-get_eq_fn()
-{
-  return (*this);
-}
-
-PB_ASSOC_CLASS_T_DEC
-const Eq_Fn& 
-PB_ASSOC_CLASS_C_DEC::
-get_eq_fn() const
-{
-  return (*this);
-}
-
-PB_ASSOC_CLASS_T_DEC
-Comb_Hash_Fn& 
-PB_ASSOC_CLASS_C_DEC::
-get_comb_hash_fn()
-{
-  return (*this);
-}
-
-PB_ASSOC_CLASS_T_DEC
-const Comb_Hash_Fn& 
-PB_ASSOC_CLASS_C_DEC::
-get_comb_hash_fn() const
-{
-  return (*this);
-}
-
-PB_ASSOC_CLASS_T_DEC
-Resize_Policy& 
-PB_ASSOC_CLASS_C_DEC::
-get_resize_policy()
-{
-  return (*this);
-}
-
-PB_ASSOC_CLASS_T_DEC
-const Resize_Policy& 
-PB_ASSOC_CLASS_C_DEC::
-get_resize_policy() const
-{
-  return (*this);
-}
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/cc_ht_map_/resize_fn_imps.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/cc_ht_map_/resize_fn_imps.hpp
deleted file mode 100644
index f7b1f109d8e..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/cc_ht_map_/resize_fn_imps.hpp
+++ /dev/null
@@ -1,146 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file resize_fn_imps.hpp
- * Contains implementations of cc_ht_map_'s resize related functions.
- */
-
-PB_ASSOC_CLASS_T_DEC
-inline bool
-PB_ASSOC_CLASS_C_DEC::
-do_resize_if_needed()
-{
-  if (!my_resize_base::is_resize_needed())
-    return (false);
-
-  do
-    do_resize(my_resize_base::get_new_size(m_num_e_p, m_num_used_e));
-  while (my_resize_base::is_resize_needed());
-
-  return (true);
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline void
-PB_ASSOC_CLASS_C_DEC::
-do_resize_if_needed_no_throw()
-{
-  if (!my_resize_base::is_resize_needed())
-    return;
-
-  try
-    {
-      do
-	do_resize(my_resize_base::get_new_size(m_num_e_p, m_num_used_e));
-      while (my_resize_base::is_resize_needed());
-    }
-  catch(...)
-    { }
-
-  PB_ASSOC_DBG_ONLY(assert_valid();)
-    }
-
-PB_ASSOC_CLASS_T_DEC
-void
-PB_ASSOC_CLASS_C_DEC::
-do_resize(size_type new_size)
-{
-  PB_ASSOC_DBG_ONLY(assert_valid();)
-
-    const size_type old_size = m_num_e_p;
-
-  entry_pointer_array a_p_entries_resized;
-
-  // Following line might throw an exception.
-
-  my_ranged_hash_fn_base::notify_resized(new_size);
-
-  try
-    {
-      // Following line might throw an exception.
-
-      a_p_entries_resized = s_entry_pointer_allocator.allocate(new_size);
-
-      m_num_e_p = new_size;
-    }
-  catch(...)
-    {
-      my_ranged_hash_fn_base::notify_resized(old_size);
-
-      throw;
-    }
-
-  // At this point no exceptions can be thrown.
-
-  resize_imp_no_exceptions(new_size, a_p_entries_resized, old_size);
-
-  Resize_Policy::notify_resized(new_size);
-
-  PB_ASSOC_DBG_ONLY(assert_valid();)
-    }
-
-PB_ASSOC_CLASS_T_DEC
-void
-PB_ASSOC_CLASS_C_DEC::
-resize_imp_no_exceptions(size_type new_size, entry_pointer_array a_p_entries_resized, size_type old_size)
-{
-  std::fill(a_p_entries_resized, a_p_entries_resized + m_num_e_p,(entry_pointer)NULL);
-
-  for (size_type pos = 0; pos < old_size; ++pos)
-    {
-      entry_pointer p_e = m_a_p_entries[pos];
-
-      while (p_e != NULL)
-	p_e = resize_imp_no_exceptions_reassign_pointer(p_e, a_p_entries_resized, my_hash_traits_base::s_store_hash_indicator);
-    }
-
-  m_num_e_p = new_size;
-
-  PB_ASSOC_DBG_ONLY(assert_entry_pointer_array_valid(a_p_entries_resized);)
-
-    s_entry_pointer_allocator.deallocate(m_a_p_entries, old_size);
-
-  m_a_p_entries = a_p_entries_resized;
-
-  PB_ASSOC_DBG_ONLY(assert_valid();)
-    }
-
-#include <ext/pb_assoc/detail/cc_ht_map_/resize_no_store_hash_fn_imps.hpp>
-#include <ext/pb_assoc/detail/cc_ht_map_/resize_store_hash_fn_imps.hpp>
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/cc_ht_map_/resize_no_store_hash_fn_imps.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/cc_ht_map_/resize_no_store_hash_fn_imps.hpp
deleted file mode 100644
index 0b6ea2d32f8..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/cc_ht_map_/resize_no_store_hash_fn_imps.hpp
+++ /dev/null
@@ -1,61 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file resize_no_store_hash_fn_imps.hpp
- * Contains implementations of cc_ht_map_'s resize related functions, when the
- *	hash value is not stored.
- */
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::entry_pointer
-PB_ASSOC_CLASS_C_DEC::
-resize_imp_no_exceptions_reassign_pointer(entry_pointer p_e, entry_pointer_array a_p_entries_resized, int_to_type<false>)
-{
-  const size_type hash_pos =
-    my_ranged_hash_fn_base::operator()(PB_ASSOC_V2F(p_e->m_value));
-
-  entry_pointer const p_next_e = p_e->m_p_next;
-
-  p_e->m_p_next = a_p_entries_resized[hash_pos];
-
-  a_p_entries_resized[hash_pos] = p_e;
-
-  return (p_next_e);
-}
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/cc_ht_map_/resize_store_hash_fn_imps.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/cc_ht_map_/resize_store_hash_fn_imps.hpp
deleted file mode 100644
index d74a8dd46d7..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/cc_ht_map_/resize_store_hash_fn_imps.hpp
+++ /dev/null
@@ -1,63 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file resize_store_hash_fn_imps.hpp
- * Contains implementations of cc_ht_map_'s resize related functions, when the
- *	hash value is stored.
- */
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::entry_pointer
-PB_ASSOC_CLASS_C_DEC::
-resize_imp_no_exceptions_reassign_pointer(entry_pointer p_e, entry_pointer_array a_p_entries_resized, int_to_type<true>)
-{
-  const comp_hash pos_hash_pair =
-    my_ranged_hash_fn_base::operator()(
-				       PB_ASSOC_V2F(p_e->m_value),
-				       p_e->m_hash);
-
-  entry_pointer const p_next_e = p_e->m_p_next;
-
-  p_e->m_p_next = a_p_entries_resized[pos_hash_pair.first];
-
-  a_p_entries_resized[pos_hash_pair.first] = p_e;
-
-  return (p_next_e);
-}
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/cc_ht_map_/size_fn_imps.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/cc_ht_map_/size_fn_imps.hpp
deleted file mode 100644
index 3ccc172890d..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/cc_ht_map_/size_fn_imps.hpp
+++ /dev/null
@@ -1,69 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file size_fn_imps.hpp
- * Contains implementations of cc_ht_map_'s entire container size related
- *	functions.
- */
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::size_type
-PB_ASSOC_CLASS_C_DEC::
-size() const
-{
-  return (m_num_used_e);
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline bool
-PB_ASSOC_CLASS_C_DEC::
-empty() const
-{
-  return (size() == 0);
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::size_type
-PB_ASSOC_CLASS_C_DEC::
-max_size() const
-{
-  return (s_entry_allocator.max_size());
-}
-
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/cc_ht_map_/standard_policies.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/cc_ht_map_/standard_policies.hpp
deleted file mode 100644
index a32d3ec3bda..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/cc_ht_map_/standard_policies.hpp
+++ /dev/null
@@ -1,50 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file standard_policies.hpp
- * Contains standard policies for cc_ht_map types.
- */
-
-#ifndef CC_HT_MAP_STANDARD_POLICIES_HPP
-#define CC_HT_MAP_STANDARD_POLICIES_HPP
-
-#include <ext/pb_assoc/detail/standard_policies.hpp>
-
-#endif // #ifndef CC_HT_MAP_STANDARD_POLICIES_HPP
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/cond_dealtor.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/cond_dealtor.hpp
deleted file mode 100644
index 53f2c506819..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/cond_dealtor.hpp
+++ /dev/null
@@ -1,129 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file cond_dealtor.hpp
- * Contains a conditional deallocator.
- */
-
-#ifndef COND_DEALTOR_HPP
-#define COND_DEALTOR_HPP
-
-namespace pb_assoc
-{
-
-  namespace detail
-  {
-
-#define PB_ASSOC_COND_DEALTOR_CLASS_T_DEC \
-	template<class Entry, class Allocator>
-
-#define PB_ASSOC_COND_DEALTOR_CLASS_C_DEC \
-	cond_dealtor< \
-		Entry, \
-		Allocator>
-
-    template<class Entry, class Allocator>
-    class cond_dealtor
-    {
-    public:
-      typedef
-      typename Allocator::template rebind<Entry>::other
-      entry_allocator;
-
-      typedef typename entry_allocator::pointer entry_pointer;
-
-    public:
-      inline
-      cond_dealtor(entry_pointer p_e);
-
-      inline
-      ~cond_dealtor();
-
-      inline void
-      set_no_action();
-
-    private:
-      entry_pointer m_p_e;
-
-      bool m_no_action_destructor;
-
-      static entry_allocator s_alloc;
-    };
-
-    PB_ASSOC_COND_DEALTOR_CLASS_T_DEC
-    typename PB_ASSOC_COND_DEALTOR_CLASS_C_DEC::entry_allocator
-    PB_ASSOC_COND_DEALTOR_CLASS_C_DEC::s_alloc;
-
-    PB_ASSOC_COND_DEALTOR_CLASS_T_DEC
-    inline
-    PB_ASSOC_COND_DEALTOR_CLASS_C_DEC::
-    cond_dealtor(entry_pointer p_e) :
-      m_p_e(p_e),
-      m_no_action_destructor(false)
-    { }
-
-    PB_ASSOC_COND_DEALTOR_CLASS_T_DEC
-    inline void
-    PB_ASSOC_COND_DEALTOR_CLASS_C_DEC::
-    set_no_action()
-    {
-      m_no_action_destructor = true;
-    }
-
-    PB_ASSOC_COND_DEALTOR_CLASS_T_DEC
-    inline
-    PB_ASSOC_COND_DEALTOR_CLASS_C_DEC::
-    ~cond_dealtor()
-    {
-      if (m_no_action_destructor)
-	return;
-
-      s_alloc.deallocate(m_p_e, 1);
-    }
-
-#undef PB_ASSOC_COND_DEALTOR_CLASS_T_DEC
-#undef PB_ASSOC_COND_DEALTOR_CLASS_C_DEC
-
-  } // namespace detail
-
-} // namespace pb_assoc
-
-#endif // #ifndef COND_DEALTOR_HPP
-
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/constructors_destructor_fn_imps.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/constructors_destructor_fn_imps.hpp
deleted file mode 100644
index 0f682873927..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/constructors_destructor_fn_imps.hpp
+++ /dev/null
@@ -1,126 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file constructors_destructor_fn_imps.hpp
- * Contains constructors_destructor_fn_imps applicable to different containers.
- */
-
-inline
-PB_ASSOC_CLASS_NAME()
-{ }
-
-inline
-PB_ASSOC_CLASS_NAME(const PB_ASSOC_CLASS_C_DEC& r_other) : PB_ASSOC_DIRECT_BASE_C_DEC((const PB_ASSOC_DIRECT_BASE_CAST_C_DEC& )r_other)
-{ }
-
-template<typename T0>
-inline
-PB_ASSOC_CLASS_NAME(T0 t0) : PB_ASSOC_DIRECT_BASE_C_DEC(t0)
-{ }
-
-template<typename T0, typename T1>
-inline
-PB_ASSOC_CLASS_NAME(T0 t0, T1 t1) : PB_ASSOC_DIRECT_BASE_C_DEC(t0, t1)
-{ }
-
-template<typename T0, typename T1, typename T2>
-inline
-PB_ASSOC_CLASS_NAME(T0 t0, T1 t1, T2 t2) : PB_ASSOC_DIRECT_BASE_C_DEC(t0, t1, t2)
-{ }
-
-template<typename T0, typename T1, typename T2, typename T3>
-inline
-PB_ASSOC_CLASS_NAME(T0 t0, T1 t1, T2 t2, T3 t3) : PB_ASSOC_DIRECT_BASE_C_DEC(t0, t1, t2, t3)
-{ }
-
-template<typename T0,
-	 typename T1,
-	 typename T2,
-	 typename T3,
-	 typename T4>
-inline
-PB_ASSOC_CLASS_NAME(T0 t0, T1 t1, T2 t2, T3 t3, T4 t4) : PB_ASSOC_DIRECT_BASE_C_DEC(t0, t1, t2, t3, t4)
-{ }
-
-template<typename T0,
-	 typename T1,
-	 typename T2,
-	 typename T3,
-	 typename T4,
-	 typename T5>
-inline
-PB_ASSOC_CLASS_NAME(T0 t0, T1 t1, T2 t2, T3 t3, T4 t4, T5 t5) : PB_ASSOC_DIRECT_BASE_C_DEC(t0, t1, t2, t3, t4, t5)
-{ }
-
-template<typename T0,
-	 typename T1,
-	 typename T2,
-	 typename T3,
-	 typename T4,
-	 typename T5,
-	 typename T6>
-inline
-PB_ASSOC_CLASS_NAME(T0 t0, T1 t1, T2 t2, T3 t3, T4 t4, T5 t5, T6 t6) : PB_ASSOC_DIRECT_BASE_C_DEC(t0, t1, t2, t3, t4, t5, t6)
-{ }
-
-template<typename T0,
-	 typename T1,
-	 typename T2,
-	 typename T3,
-	 typename T4,
-	 typename T5,
-	 typename T6,
-	 typename T7>
-inline
-PB_ASSOC_CLASS_NAME(T0 t0, T1 t1, T2 t2, T3 t3, T4 t4, T5 t5, T6 t6, T7 t7) : PB_ASSOC_DIRECT_BASE_C_DEC(t0, t1, t2, t3, t4, t5, t6, t7)
-{ }
-
-template<typename T0,
-	 typename T1,
-	 typename T2,
-	 typename T3,
-	 typename T4,
-	 typename T5,
-	 typename T6,
-	 typename T7,
-	 typename T8>
-inline
-PB_ASSOC_CLASS_NAME(T0 t0, T1 t1, T2 t2, T3 t3, T4 t4, T5 t5, T6 t6, T7 t7, T8 t8) : PB_ASSOC_DIRECT_BASE_C_DEC(t0, t1, t2, t3, t4, t5, t6, t7, t8)
-{ }
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/ds_trait_imp.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/ds_trait_imp.hpp
deleted file mode 100644
index d0b82675390..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/ds_trait_imp.hpp
+++ /dev/null
@@ -1,336 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file ds_trait_imp.hpp
- * Contains data-structure traits implementation.
- */
-
-#ifndef DS_TRAIT_IMP_HPP
-#define DS_TRAIT_IMP_HPP
-
-namespace detail
-{
-
-  template<class Cntnr, class DS_Category>
-  struct erase_can_throw_imp
-  {
-    enum
-      {
-	value =
-	pb_assoc::detail::is_same_type<
-	DS_Category,
-	ov_tree_ds_tag>::value
-      };
-  };
-
-  template<class Cntnr>
-  struct erase_can_throw_imp<
-    Cntnr,
-    compound_ds_tag>
-  {
-    enum
-      {
-	value = Cntnr::erase_can_throw
-      };
-  };
-
-  template<class Cntnr, class DS_Category>
-  struct erase_iterators_imp
-  {
-    enum
-      {
-	value =
-	pb_assoc::detail::is_same_type<
-	DS_Category,
-	rb_tree_ds_tag>::value ||
-	pb_assoc::detail::is_same_type<
-	DS_Category,
-	splay_tree_ds_tag>::value
-      };
-  };
-
-  template<class Cntnr>
-  struct erase_iterators_imp<
-    Cntnr,
-    compound_ds_tag>
-  {
-    enum
-      {
-	value = Cntnr::erase_iterators
-      };
-  };
-
-  template<class Cntnr, class DS_Category>
-  struct order_preserving_imp
-  {
-    enum
-      {
-	value =
-	pb_assoc::detail::is_same_type<
-	DS_Category,
-	rb_tree_ds_tag>::value ||
-	pb_assoc::detail::is_same_type<
-	DS_Category,
-	splay_tree_ds_tag>::value ||
-	pb_assoc::detail::is_same_type<
-	DS_Category,
-	ov_tree_ds_tag>::value
-      };
-  };
-
-  template<class Cntnr>
-  struct order_preserving_imp<
-    Cntnr,
-    compound_ds_tag>
-  {
-    enum
-      {
-	value = Cntnr::order_preserving
-      };
-  };
-
-  template<class Cntnr, class DS_Category>
-  struct invalidation_guarantee_imp
-  {
-  private:
-    enum
-      {
-	node_based =
-	pb_assoc::detail::is_same_type<
-	DS_Category,
-	cc_hash_ds_tag>::value ||
-	pb_assoc::detail::is_same_type<
-	DS_Category,
-	rb_tree_ds_tag>::value ||
-	pb_assoc::detail::is_same_type<
-	DS_Category,
-	splay_tree_ds_tag>::value ||
-	pb_assoc::detail::is_same_type<
-	DS_Category,
-	lu_ds_tag>::value
-      };
-
-    enum
-      {
-	vector_organized =
-	pb_assoc::detail::is_same_type<
-	DS_Category,
-	cc_hash_ds_tag>::value
-      };
-
-  public:
-    typedef
-    typename cond_type<
-      node_based,
-      typename cond_type<
-      vector_organized,
-      find_invalidation_guarantee,
-      range_invalidation_guarantee>::type,
-      basic_invalidation_guarantee>::type
-    type;
-  };
-
-  template<class Cntnr>
-  struct invalidation_guarantee_imp<
-    Cntnr,
-    compound_ds_tag>
-  {
-    typedef typename Cntnr::invalidation_guarantee type;
-  };
-
-  template<class Cntnr, class DS_Category>
-  struct reverse_iteration_imp
-  {
-    enum
-      {
-	value =
-	is_same_type<
-	DS_Category,
-	rb_tree_ds_tag>::value ||
-	is_same_type<
-	DS_Category,
-	splay_tree_ds_tag>::value
-      };
-  };
-
-  template<class Cntnr>
-  struct reverse_iteration_imp<
-    Cntnr,
-    compound_ds_tag>
-  {
-    enum
-      {
-	value = Cntnr::reverse_iteration
-      };
-  };
-
-  template<class Cntnr, class DS_Category>
-  struct split_join_imp
-  {
-    enum
-      {
-	value =
-	is_same_type<
-	DS_Category,
-	rb_tree_ds_tag>::value ||
-	is_same_type<
-	DS_Category,
-	splay_tree_ds_tag>::value ||
-	is_same_type<
-	DS_Category,
-	ov_tree_ds_tag>::value
-      };
-  };
-
-  template<class Cntnr>
-  struct split_join_imp<
-    Cntnr,
-    compound_ds_tag>
-  {
-    enum
-      {
-	value = false
-      };
-  };
-
-  template<class Cntnr>
-  struct basic_data_structure_traits
-  {
-
-  private:
-    typedef Cntnr cntnr;
-
-    typedef typename Cntnr::ds_category ds_category;
-
-  public:
-    enum
-      {
-	erase_can_throw =
-	pb_assoc::detail::erase_can_throw_imp<
-	cntnr,
-	ds_category>::value
-      };
-
-    enum
-      {
-	order_preserving =
-	pb_assoc::detail::order_preserving_imp<
-	cntnr,
-	ds_category>::value
-      };
-
-    enum
-      {
-	erase_iterators =
-	pb_assoc::detail::erase_iterators_imp<
-	Cntnr,
-	ds_category>::value
-      };
-
-    typedef
-    typename pb_assoc::detail::invalidation_guarantee_imp<
-      cntnr,
-      ds_category>::type
-    invalidation_guarantee;
-
-    enum
-      {
-	reverse_iteration =
-	pb_assoc::detail::reverse_iteration_imp<
-	cntnr,
-	ds_category>::value
-      };
-
-    enum
-      {
-	split_join =
-	pb_assoc::detail::split_join_imp<
-	cntnr,
-	ds_category>::value
-      };
-  };
-
-  template<class Cntnr, class DS_Category>
-  struct data_structure_traits : public basic_data_structure_traits<
-    Cntnr>
-  { };
-
-  template<class Cntnr>
-  struct data_structure_traits<
-    Cntnr,
-    rb_tree_ds_tag> : public basic_data_structure_traits<
-    Cntnr>
-  {
-  public:
-    enum
-      {
-	split_join_can_throw = false
-      };
-  };
-
-  template<class Cntnr>
-  struct data_structure_traits<
-    Cntnr,
-    splay_tree_ds_tag> : public basic_data_structure_traits<
-    Cntnr>
-  {
-  public:
-    enum
-      {
-	split_join_can_throw = false
-      };
-  };
-
-  template<class Cntnr>
-  struct data_structure_traits<
-    Cntnr,
-    ov_tree_ds_tag> : public basic_data_structure_traits<
-    Cntnr>
-  {
-  public:
-    enum
-      {
-	split_join_can_throw = true
-      };
-  };
-
-} // namespace detail
-
-#endif // #ifndef DS_TRAIT_IMP_HPP
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/eq_fn/eq_by_less.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/eq_fn/eq_by_less.hpp
deleted file mode 100644
index d09312d0683..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/eq_fn/eq_by_less.hpp
+++ /dev/null
@@ -1,78 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file eq_by_less.hpp
- * Contains an equivalence function.
- */
-
-#ifndef EQ_BY_LESS_HPP
-#define EQ_BY_LESS_HPP
-
-#include <utility>
-#include <functional>
-#include <vector>
-#include <assert.h>
-#include <ext/pb_assoc/detail/types_traits.hpp>
-
-namespace pb_assoc
-{
-
-  namespace detail
-  {
-
-#include <functional>
-
-    template<typename Key, class Cmp_Fn>
-    struct eq_by_less : public std::binary_function<const Key& , const Key& , bool>,
-			protected Cmp_Fn
-    {
-      bool
-      operator()(const Key& r_lhs, const Key& r_rhs) const
-      {
-	return (!(Cmp_Fn::operator()(r_lhs, r_rhs)&& 
-		  !(Cmp_Fn::operator()(r_rhs, r_lhs))));
-      }
-    };
-
-  } // namespace detail
-
-} // namespace pb_assoc
-
-#endif // #ifndef EQ_BY_LESS_HPP
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/eq_fn/hash_eq_fn.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/eq_fn/hash_eq_fn.hpp
deleted file mode 100644
index bbea3709d65..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/eq_fn/hash_eq_fn.hpp
+++ /dev/null
@@ -1,211 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file hash_eq_fn.hpp
- * Contains 2 eqivalence functions, one employing a hash value,
- *	and one ignoring it.
- */
-
-#ifndef HASH_EQ_FN_HPP
-#define HASH_EQ_FN_HPP
-
-#include <utility>
-
-namespace pb_assoc
-{
-
-  namespace detail
-  {
-
-#ifdef PB_ASSOC_HASH_EQ_FN_DEBUG
-#define PB_ASSOC_DBG_ASSERT(X) assert(X)
-#define PB_ASSOC_DBG_VERIFY(X) assert(X)
-#define PB_ASSOC_DBG_ONLY(X) X
-#else // #ifdef PB_ASSOC_HASH_EQ_FN_DEBUG
-#define PB_ASSOC_DBG_ASSERT(X)
-#define PB_ASSOC_DBG_VERIFY(X) {if((X)==0);}
-#define PB_ASSOC_DBG_ONLY(X) ;
-#endif // #ifdef PB_ASSOC_HASH_EQ_FN_DEBUG
-
-    template<typename Key, class Eq_Fn, class Allocator, bool Store_Hash>
-    struct hash_eq_fn;
-
-#define PB_ASSOC_CLASS_T_DEC \
-	template<typename Key, class Eq_Fn, class Allocator>
-
-#define PB_ASSOC_CLASS_C_DEC \
-	hash_eq_fn< \
-		Key, \
-		Eq_Fn, \
-		Allocator, \
-		false>
-
-    /**
-     * Specialization 1- The client requests that hash values not be stored.
-     **/
-    template<typename Key, class Eq_Fn, class Allocator>
-    struct hash_eq_fn<Key, Eq_Fn, Allocator, false> : public Eq_Fn
-    {
-      typedef Eq_Fn my_eq_fn_base;
-
-      typedef typename Allocator::template rebind<Key>::other key_allocator;
-
-      typedef typename key_allocator::const_reference const_key_reference;
-
-      hash_eq_fn();
-
-      hash_eq_fn(const Eq_Fn& r_eq_fn);
-
-      inline bool
-      operator()(const_key_reference r_lhs_key, const_key_reference r_rhs_key) const;
-
-      inline void
-      swap(const PB_ASSOC_CLASS_C_DEC& r_other);
-    };
-
-    PB_ASSOC_CLASS_T_DEC
-    PB_ASSOC_CLASS_C_DEC::
-    hash_eq_fn()
-    { }
-
-    PB_ASSOC_CLASS_T_DEC
-    inline void
-    PB_ASSOC_CLASS_C_DEC::
-    swap(const PB_ASSOC_CLASS_C_DEC& r_other)
-    {
-      std::swap((Eq_Fn& )(*this), (Eq_Fn& )r_other);
-    }
-
-    PB_ASSOC_CLASS_T_DEC
-    PB_ASSOC_CLASS_C_DEC::
-    hash_eq_fn(const Eq_Fn& r_eq_fn) :
-      Eq_Fn(r_eq_fn)
-    { }
-
-    PB_ASSOC_CLASS_T_DEC
-    inline bool
-    PB_ASSOC_CLASS_C_DEC::
-    operator()(const_key_reference r_lhs_key, const_key_reference r_rhs_key) const
-    {
-      return (my_eq_fn_base::operator()(r_lhs_key, r_rhs_key));
-    }
-
-#undef PB_ASSOC_CLASS_T_DEC
-#undef PB_ASSOC_CLASS_C_DEC
-
-#define PB_ASSOC_CLASS_T_DEC \
-	template<typename Key, class Eq_Fn, class Allocator>
-
-#define PB_ASSOC_CLASS_C_DEC \
-	hash_eq_fn< \
-		Key, \
-		Eq_Fn, \
-		Allocator, \
-		true>
-
-    /**
-     * Specialization 2- The client requests that hash values be stored.
-     **/
-    template<typename Key, class Eq_Fn, class Allocator>
-    struct hash_eq_fn<Key, Eq_Fn, Allocator, true> :
-      public Eq_Fn
-    {
-      typedef typename Allocator::size_type size_type;
-
-      typedef Eq_Fn my_eq_fn_base;
-
-      typedef typename Allocator::template rebind<Key>::other key_allocator;
-
-      typedef typename key_allocator::const_reference const_key_reference;
-
-      hash_eq_fn();
-
-      hash_eq_fn(const Eq_Fn& r_eq_fn);
-
-      inline bool
-      operator()(const_key_reference r_lhs_key, size_type lhs_hash, const_key_reference r_rhs_key, size_type rhs_hash) const;
-
-      inline void
-      swap(const PB_ASSOC_CLASS_C_DEC& r_other);
-    };
-
-    PB_ASSOC_CLASS_T_DEC
-    PB_ASSOC_CLASS_C_DEC::
-    hash_eq_fn()
-    { }
-
-    PB_ASSOC_CLASS_T_DEC
-    PB_ASSOC_CLASS_C_DEC::
-    hash_eq_fn(const Eq_Fn& r_eq_fn) :
-      Eq_Fn(r_eq_fn)
-    { }
-
-    PB_ASSOC_CLASS_T_DEC
-    inline bool
-    PB_ASSOC_CLASS_C_DEC::
-    operator()(const_key_reference r_lhs_key, size_type lhs_hash, const_key_reference r_rhs_key, size_type rhs_hash) const
-    {
-      PB_ASSOC_DBG_ASSERT(!my_eq_fn_base::operator()(r_lhs_key, r_rhs_key) ||
-			  lhs_hash == rhs_hash);
-
-      return (lhs_hash == rhs_hash&& 
-	      my_eq_fn_base::operator()(r_lhs_key, r_rhs_key));
-    }
-
-    PB_ASSOC_CLASS_T_DEC
-    inline void
-    PB_ASSOC_CLASS_C_DEC::
-    swap(const PB_ASSOC_CLASS_C_DEC& r_other)
-    {
-      std::swap((Eq_Fn& )(*this), (Eq_Fn& )(r_other));
-    }
-
-#undef PB_ASSOC_CLASS_T_DEC
-#undef PB_ASSOC_CLASS_C_DEC
-
-#undef PB_ASSOC_DBG_ASSERT
-#undef PB_ASSOC_DBG_VERIFY
-#undef PB_ASSOC_DBG_ONLY
-
-  } // namespace detail
-
-} // namespace pb_assoc
-
-#endif // #ifndef HASH_EQ_FN_HPP
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/gp_hash_assoc_cntnr/constructor_destructor_fn_imps.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/gp_hash_assoc_cntnr/constructor_destructor_fn_imps.hpp
deleted file mode 100644
index 0a8f647ba1e..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/gp_hash_assoc_cntnr/constructor_destructor_fn_imps.hpp
+++ /dev/null
@@ -1,166 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file constructor_destructor_fn_imps.hpp
- * Contains implementations of gp_ht_maps's constructors, destructors,
- *	and related functions.
- */
-
-PB_ASSOC_CLASS_T_DEC
-PB_ASSOC_CLASS_C_DEC::
-gp_hash_assoc_cntnr()
-{ }
-
-PB_ASSOC_CLASS_T_DEC
-PB_ASSOC_CLASS_C_DEC::
-gp_hash_assoc_cntnr(const Hash_Fn& r_hash_fn) :
-  PB_ASSOC_BASE_C_DEC(r_hash_fn)
-{ }
-
-PB_ASSOC_CLASS_T_DEC
-PB_ASSOC_CLASS_C_DEC::
-gp_hash_assoc_cntnr(const Hash_Fn& r_hash_fn, const Eq_Fn& r_eq_fn) :
-  PB_ASSOC_BASE_C_DEC(r_hash_fn, r_eq_fn)
-{ }
-
-PB_ASSOC_CLASS_T_DEC
-PB_ASSOC_CLASS_C_DEC::
-gp_hash_assoc_cntnr(const Hash_Fn& r_hash_fn, const Eq_Fn& r_eq_fn, const Comb_Probe_Fn& r_comb_hash_fn) :
-  PB_ASSOC_BASE_C_DEC(r_hash_fn, r_eq_fn, r_comb_hash_fn)
-{ }
-
-PB_ASSOC_CLASS_T_DEC
-PB_ASSOC_CLASS_C_DEC::
-gp_hash_assoc_cntnr(const Hash_Fn& r_hash_fn, const Eq_Fn& r_eq_fn, const Comb_Probe_Fn& r_comb_hash_fn, const Probe_Fn& r_probe_fn) :
-  PB_ASSOC_BASE_C_DEC(r_hash_fn, r_eq_fn, r_comb_hash_fn, r_probe_fn)
-{ }
-
-PB_ASSOC_CLASS_T_DEC
-PB_ASSOC_CLASS_C_DEC::
-gp_hash_assoc_cntnr(const Hash_Fn& r_hash_fn, const Eq_Fn& r_eq_fn, const Comb_Probe_Fn& r_comb_hash_fn, const Probe_Fn& r_probe_fn, const Resize_Policy& r_resize_policy) :
-  PB_ASSOC_BASE_C_DEC(r_hash_fn, r_eq_fn, r_comb_hash_fn, r_probe_fn, r_resize_policy)
-{ }
-
-PB_ASSOC_CLASS_T_DEC
-template<class It>
-PB_ASSOC_CLASS_C_DEC::
-gp_hash_assoc_cntnr(It first_it, It last_it)
-{
-  my_base::copy_from_range(first_it, last_it);
-}
-
-PB_ASSOC_CLASS_T_DEC
-template<class It>
-PB_ASSOC_CLASS_C_DEC::
-gp_hash_assoc_cntnr(It first_it, It last_it, const Hash_Fn& r_hash_fn) :
-  PB_ASSOC_BASE_C_DEC(r_hash_fn)
-{
-  my_base::copy_from_range(first_it, last_it);
-}
-
-PB_ASSOC_CLASS_T_DEC
-template<class It>
-PB_ASSOC_CLASS_C_DEC::
-gp_hash_assoc_cntnr(It first_it, It last_it, const Hash_Fn& r_hash_fn, const Eq_Fn& r_eq_fn) :
-  PB_ASSOC_BASE_C_DEC(r_hash_fn, r_eq_fn)
-{
-  my_base::copy_from_range(first_it, last_it);
-}
-
-PB_ASSOC_CLASS_T_DEC
-template<class It>
-PB_ASSOC_CLASS_C_DEC::
-gp_hash_assoc_cntnr(It first_it, It last_it, const Hash_Fn& r_hash_fn, const Eq_Fn& r_eq_fn, const Comb_Probe_Fn& r_comb_hash_fn) :
-  PB_ASSOC_BASE_C_DEC(r_hash_fn, r_eq_fn, r_comb_hash_fn)
-{
-  my_base::copy_from_range(first_it, last_it);
-}
-
-PB_ASSOC_CLASS_T_DEC
-template<class It>
-PB_ASSOC_CLASS_C_DEC::
-gp_hash_assoc_cntnr(It first_it, It last_it, const Hash_Fn& r_hash_fn, const Eq_Fn& r_eq_fn, const Comb_Probe_Fn& r_comb_hash_fn, const Probe_Fn& r_probe_fn) :
-  PB_ASSOC_BASE_C_DEC(r_hash_fn, r_eq_fn, r_comb_hash_fn, r_probe_fn)
-{
-  my_base::copy_from_range(first_it, last_it);
-}
-
-PB_ASSOC_CLASS_T_DEC
-template<class It>
-PB_ASSOC_CLASS_C_DEC::
-gp_hash_assoc_cntnr(It first_it, It last_it, const Hash_Fn& r_hash_fn, const Eq_Fn& r_eq_fn, const Comb_Probe_Fn& r_comb_hash_fn, const Probe_Fn& r_probe_fn, const Resize_Policy& r_resize_policy) :
-  PB_ASSOC_BASE_C_DEC(r_hash_fn, r_eq_fn, r_comb_hash_fn, r_probe_fn, r_resize_policy)
-{
-  my_base::copy_from_range(first_it, last_it);
-}
-
-PB_ASSOC_CLASS_T_DEC
-PB_ASSOC_CLASS_C_DEC::
-gp_hash_assoc_cntnr(const PB_ASSOC_CLASS_C_DEC& r_other) :
-  PB_ASSOC_BASE_C_DEC((const PB_ASSOC_BASE_C_DEC& )(r_other))
-{ }
-
-PB_ASSOC_CLASS_T_DEC
-PB_ASSOC_CLASS_C_DEC& 
-PB_ASSOC_CLASS_C_DEC::
-operator=(const PB_ASSOC_CLASS_C_DEC& r_other)
-{
-  if (this !=& r_other)
-    {
-      PB_ASSOC_CLASS_C_DEC tmp(r_other);
-
-      swap(tmp);
-    }
-
-  return (*this);
-}
-
-PB_ASSOC_CLASS_T_DEC
-PB_ASSOC_CLASS_C_DEC::
-~gp_hash_assoc_cntnr()
-{ }
-
-PB_ASSOC_CLASS_T_DEC
-void
-PB_ASSOC_CLASS_C_DEC::
-swap(PB_ASSOC_CLASS_C_DEC& r_other)
-{
-  my_base::swap(r_other);
-}
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/gp_ht_map_/constructor_destructor_fn_imps.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/gp_ht_map_/constructor_destructor_fn_imps.hpp
deleted file mode 100644
index cb42444c281..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/gp_ht_map_/constructor_destructor_fn_imps.hpp
+++ /dev/null
@@ -1,255 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file constructor_destructor_fn_imps.hpp
- * Contains implementations of gp_ht_map_'s constructors, destructor,
- *	and related functions.
- */
-
-PB_ASSOC_CLASS_T_DEC
-typename PB_ASSOC_CLASS_C_DEC::entry_allocator
-PB_ASSOC_CLASS_C_DEC::s_entry_allocator;
-
-PB_ASSOC_CLASS_T_DEC
-template<class It>
-void
-PB_ASSOC_CLASS_C_DEC::
-copy_from_range(It first_it, It last_it)
-{
-  while (first_it != last_it)
-    insert(*(first_it++));
-}
-
-PB_ASSOC_CLASS_T_DEC
-PB_ASSOC_CLASS_C_DEC::
-PB_ASSOC_CLASS_NAME() :
-  my_ranged_probe_fn_base(Resize_Policy::get_init_size()),
-  m_a_entries(s_entry_allocator.allocate(
-					 Resize_Policy::get_init_size())),
-  m_num_e(Resize_Policy::get_init_size()),
-  m_num_used_e(0)
-{
-  initialize();
-
-  PB_ASSOC_DBG_ONLY(PB_ASSOC_CLASS_C_DEC::assert_valid();)
-    }
-
-PB_ASSOC_CLASS_T_DEC
-PB_ASSOC_CLASS_C_DEC::
-PB_ASSOC_CLASS_NAME(const Hash_Fn& r_hash_fn)  :
-  my_ranged_probe_fn_base(Resize_Policy::get_init_size(), r_hash_fn),
-  m_a_entries(s_entry_allocator.allocate(
-					 Resize_Policy::get_init_size())),
-  m_num_e(Resize_Policy::get_init_size()),
-  m_num_used_e(0)
-{
-  initialize();
-
-  PB_ASSOC_DBG_ONLY(PB_ASSOC_CLASS_C_DEC::assert_valid();)
-    }
-
-PB_ASSOC_CLASS_T_DEC
-PB_ASSOC_CLASS_C_DEC::
-PB_ASSOC_CLASS_NAME(const Hash_Fn& r_hash_fn, const Eq_Fn& r_eq_fn) :
-  my_hash_eq_fn_base(r_eq_fn),
-  my_ranged_probe_fn_base(Resize_Policy::get_init_size(), r_hash_fn),
-  m_a_entries(s_entry_allocator.allocate(
-					 Resize_Policy::get_init_size())),
-  m_num_e(Resize_Policy::get_init_size()),
-  m_num_used_e(0)
-{
-  initialize();
-
-  PB_ASSOC_DBG_ONLY(PB_ASSOC_CLASS_C_DEC::assert_valid();)
-    }
-
-PB_ASSOC_CLASS_T_DEC
-PB_ASSOC_CLASS_C_DEC::
-PB_ASSOC_CLASS_NAME(const Hash_Fn& r_hash_fn, const Eq_Fn& r_eq_fn, const Comb_Probe_Fn& r_comb_hash_fn) :
-  my_hash_eq_fn_base(r_eq_fn),
-  my_ranged_probe_fn_base(Resize_Policy::get_init_size(),
-			  r_hash_fn, r_comb_hash_fn),
-  m_a_entries(s_entry_allocator.allocate(
-					 Resize_Policy::get_init_size())),
-  m_num_e(Resize_Policy::get_init_size()),
-  m_num_used_e(0)
-{
-  initialize();
-
-  PB_ASSOC_DBG_ONLY(PB_ASSOC_CLASS_C_DEC::assert_valid();)
-    }
-
-PB_ASSOC_CLASS_T_DEC
-PB_ASSOC_CLASS_C_DEC::
-PB_ASSOC_CLASS_NAME(const Hash_Fn& r_hash_fn, const Eq_Fn& r_eq_fn, const Comb_Probe_Fn& r_comb_hash_fn, const Probe_Fn& r_probe_fn) :
-  my_hash_eq_fn_base(r_eq_fn),
-  my_ranged_probe_fn_base(Resize_Policy::get_init_size(),
-			  r_hash_fn, r_comb_hash_fn, r_probe_fn),
-  m_a_entries(s_entry_allocator.allocate(
-					 Resize_Policy::get_init_size())),
-  m_num_e(Resize_Policy::get_init_size()),
-  m_num_used_e(0)
-{
-  initialize();
-
-  PB_ASSOC_DBG_ONLY(PB_ASSOC_CLASS_C_DEC::assert_valid();)
-    }
-
-PB_ASSOC_CLASS_T_DEC
-PB_ASSOC_CLASS_C_DEC::
-PB_ASSOC_CLASS_NAME(const Hash_Fn& r_hash_fn, const Eq_Fn& r_eq_fn, const Comb_Probe_Fn& r_comb_hash_fn, const Probe_Fn& r_probe_fn, const Resize_Policy& r_resize_policy) :
-  my_hash_eq_fn_base(r_eq_fn),
-  my_resize_base(r_resize_policy),
-  my_ranged_probe_fn_base(Resize_Policy::get_init_size(),
-			  r_hash_fn, r_comb_hash_fn, r_probe_fn),
-  m_a_entries(s_entry_allocator.allocate(
-					 Resize_Policy::get_init_size())),
-  m_num_e(Resize_Policy::get_init_size()),
-  m_num_used_e(0)
-{
-  initialize();
-
-  PB_ASSOC_DBG_ONLY(PB_ASSOC_CLASS_C_DEC::assert_r_valid();)
-    }
-
-PB_ASSOC_CLASS_T_DEC
-PB_ASSOC_CLASS_C_DEC::
-PB_ASSOC_CLASS_NAME(const PB_ASSOC_CLASS_C_DEC& r_other) :
-  my_hash_eq_fn_base(r_other),
-  my_resize_base(r_other),
-  my_ranged_probe_fn_base(r_other),
-  m_a_entries(s_entry_allocator.allocate(
-					 r_other.m_num_e)),
-  m_num_e(r_other.m_num_e),
-  m_num_used_e(r_other.m_num_used_e)
-{
-  initialize();
-
-  try
-    {
-      for (size_type i = 0; i < m_num_e; ++i)
-	{
-	  entry_pointer p_e =& r_other.m_a_entries[i];
-	  if (p_e->m_stat == VALID_ENTRY_STATUS)
-	    constructor_insert_new_imp((const_mapped_reference)p_e->m_value,
-				       i,
-				       my_hash_traits_base::s_store_hash_indicator);
-	}
-    }
-  catch(...)
-    {
-      deallocate_all();
-
-      throw;
-    }
-
-  PB_ASSOC_DBG_ONLY(PB_ASSOC_CLASS_C_DEC::assert_valid();)
-    }
-
-PB_ASSOC_CLASS_T_DEC
-PB_ASSOC_CLASS_C_DEC::
-~PB_ASSOC_CLASS_NAME()
-{
-  deallocate_all();
-}
-
-PB_ASSOC_CLASS_T_DEC
-void
-PB_ASSOC_CLASS_C_DEC::
-swap(PB_ASSOC_CLASS_C_DEC& r_other)
-{
-  PB_ASSOC_DBG_ONLY(assert_valid());
-  PB_ASSOC_DBG_ONLY(r_other.assert_valid());
-
-  std::swap(m_a_entries, r_other.m_a_entries);
-
-  std::swap(m_num_e, r_other.m_num_e);
-
-  std::swap(m_num_used_e, r_other.m_num_used_e);
-
-  my_ranged_probe_fn_base::swap(r_other);
-
-  my_hash_eq_fn_base::swap(r_other);
-
-  my_resize_base::swap(r_other);
-
-  PB_ASSOC_DBG_ONLY(my_cntnr_debug_base::swap(r_other));
-
-  PB_ASSOC_DBG_ONLY(assert_valid());
-  PB_ASSOC_DBG_ONLY(r_other.assert_valid());
-}
-
-PB_ASSOC_CLASS_T_DEC
-void
-PB_ASSOC_CLASS_C_DEC::
-deallocate_all()
-{
-  clear();
-
-  erase_all_valid_entries(m_a_entries, m_num_e);
-
-  s_entry_allocator.deallocate(m_a_entries, m_num_e);
-}
-
-PB_ASSOC_CLASS_T_DEC
-void
-PB_ASSOC_CLASS_C_DEC::
-erase_all_valid_entries(entry_array a_entries_resized, size_type size)
-{
-  for (size_type pos = 0; pos < size; ++pos)
-    {
-      entry_pointer p_e =& a_entries_resized[pos];
-
-      if (p_e->m_stat == VALID_ENTRY_STATUS)
-	p_e->m_value.~value_type();
-    }
-}
-
-PB_ASSOC_CLASS_T_DEC
-void
-PB_ASSOC_CLASS_C_DEC::
-initialize()
-{
-  for (size_type i = 0; i < m_num_e; ++i)
-    m_a_entries[i].m_stat = (entry_status)EMPTY_ENTRY_STATUS;
-}
-
-#include <ext/pb_assoc/detail/gp_ht_map_/constructor_destructor_store_hash_fn_imps.hpp>
-#include <ext/pb_assoc/detail/gp_ht_map_/constructor_destructor_no_store_hash_fn_imps.hpp>
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/gp_ht_map_/constructor_destructor_no_store_hash_fn_imps.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/gp_ht_map_/constructor_destructor_no_store_hash_fn_imps.hpp
deleted file mode 100644
index 715ac789b14..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/gp_ht_map_/constructor_destructor_no_store_hash_fn_imps.hpp
+++ /dev/null
@@ -1,61 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file constructor_destructor_no_store_hash_fn_imps.hpp
- * Contains implementations of gp_ht_map_'s constructors, destructor,
- *	and related functions.
- */
-
-PB_ASSOC_CLASS_T_DEC
-inline void
-PB_ASSOC_CLASS_C_DEC::
-constructor_insert_new_imp(const_mapped_reference r_val, size_type pos, int_to_type<false>)
-{
-  PB_ASSOC_DBG_ASSERT(m_a_entries[pos].m_stat != VALID_ENTRY_STATUS);
-
-  entry* const p_e = m_a_entries + pos;
-
-  new (&p_e->m_value) mapped_value_type(r_val);
-
-  p_e->m_stat = VALID_ENTRY_STATUS;
-
-  PB_ASSOC_DBG_ONLY(my_map_debug_base::
-		    insert_new(p_e->m_value.first);)
-    }
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/gp_ht_map_/constructor_destructor_store_hash_fn_imps.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/gp_ht_map_/constructor_destructor_store_hash_fn_imps.hpp
deleted file mode 100644
index 22b00705486..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/gp_ht_map_/constructor_destructor_store_hash_fn_imps.hpp
+++ /dev/null
@@ -1,64 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file constructor_destructor_store_hash_fn_imps.hpp
- * Contains implementations of gp_ht_map_'s constructors, destructor,
- *	and related functions.
- */
-
-PB_ASSOC_CLASS_T_DEC
-inline void
-PB_ASSOC_CLASS_C_DEC::
-constructor_insert_new_imp(const_mapped_reference r_val, size_type pos, int_to_type<true>)
-{
-  PB_ASSOC_DBG_ASSERT(m_a_entries[pos].m_stat != VALID_ENTRY_STATUS);
-
-  entry* const p_e = m_a_entries + pos;
-
-  new (&p_e->m_value) mapped_value_type(r_val);
-
-  p_e->m_hash = my_ranged_probe_fn_base::operator()(
-						    PB_ASSOC_V2F(r_val)).second;
-
-  p_e->m_stat = VALID_ENTRY_STATUS;
-
-  PB_ASSOC_DBG_ONLY(my_map_debug_base::
-		    insert_new(p_e->m_value.first);)
-    }
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/gp_ht_map_/debug_fn_imps.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/gp_ht_map_/debug_fn_imps.hpp
deleted file mode 100644
index e5dccef0749..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/gp_ht_map_/debug_fn_imps.hpp
+++ /dev/null
@@ -1,60 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file debug_fn_imps.hpp
- * Contains implementations of gp_ht_map_'s debug-mode functions.
- */
-
-#ifdef PB_ASSOC_GP_HT_MAP_DEBUG_
-
-PB_ASSOC_CLASS_T_DEC
-void
-PB_ASSOC_CLASS_C_DEC::
-assert_valid() const
-{
-  my_map_debug_base::check_size(m_num_used_e);
-
-  assert_entry_array_valid(m_a_entries, my_traits_base::m_store_hash_indicator);
-}
-
-#include <ext/pb_assoc/detail/gp_ht_map_/debug_no_store_hash_fn_imps.hpp>
-#include <ext/pb_assoc/detail/gp_ht_map_/debug_store_hash_fn_imps.hpp>
-
-#endif // #ifdef PB_ASSOC_GP_HT_MAP_DEBUG_
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/gp_ht_map_/debug_no_store_hash_fn_imps.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/gp_ht_map_/debug_no_store_hash_fn_imps.hpp
deleted file mode 100644
index 4ce7674ac06..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/gp_ht_map_/debug_no_store_hash_fn_imps.hpp
+++ /dev/null
@@ -1,81 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file debug_no_store_hash_fn_imps.hpp
- * Contains implementations of gp_ht_map_'s debug-mode functions.
- */
-
-#ifdef PB_ASSOC_GP_HT_MAP_DEBUG_
-
-PB_ASSOC_CLASS_T_DEC
-void
-PB_ASSOC_CLASS_C_DEC::
-assert_entry_array_valid(const entry_array a_entries, store_hash_false_indicator) const
-{
-  size_type iterated_num_used_e = 0;
-
-  for (size_type pos = 0; pos < m_num_e; ++pos)
-    {
-      const_entry_pointer p_e =& a_entries[pos];
-
-      switch(p_e->m_stat)
-	{
-	case EMPTY_ENTRY_STATUS:
-	case ERASED_ENTRY_STATUS:
-	  break;
-	case VALID_ENTRY_STATUS:
-	  {
-	    const_key_reference r_key = p_e->m_value.first;
-
-	    my_map_debug_base::check_key_exists(r_key);
-
-	    ++iterated_num_used_e;
-
-	    break;
-	  }
-	default:
-	  PB_ASSOC_DBG_ASSERT(0);
-	};
-    }
-
-  PB_ASSOC_DBG_ASSERT(iterated_num_used_e == m_num_used_e);
-}
-
-#endif // #ifdef PB_ASSOC_GP_HT_MAP_DEBUG_
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/gp_ht_map_/debug_store_hash_fn_imps.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/gp_ht_map_/debug_store_hash_fn_imps.hpp
deleted file mode 100644
index 7f245d0b56d..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/gp_ht_map_/debug_store_hash_fn_imps.hpp
+++ /dev/null
@@ -1,86 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file debug_store_hash_fn_imps.hpp
- * Contains implementations of gp_ht_map_'s debug-mode functions.
- */
-
-#ifdef PB_ASSOC_GP_HT_MAP_DEBUG_
-
-PB_ASSOC_CLASS_T_DEC
-void
-PB_ASSOC_CLASS_C_DEC::
-assert_entry_array_valid(const entry_array a_entries, store_hash_true_indicator) const
-{
-  size_type iterated_num_used_e = 0;
-
-  for (size_type pos = 0; pos < m_num_e; ++pos)
-    {
-      const_entry_pointer p_e =& a_entries[pos];
-
-      switch(p_e->m_stat)
-	{
-	case EMPTY_ENTRY_STATUS:
-	case ERASED_ENTRY_STATUS:
-	  break;
-	case VALID_ENTRY_STATUS:
-	  {
-	    const_key_reference r_key = p_e->m_value.first;
-
-	    my_map_debug_base::check_key_exists(r_key);
-
-	    const comp_hash pos_hash_pair =
-	      my_ranged_probe_fn_base::operator()(r_key);
-
-	    PB_ASSOC_DBG_ASSERT(p_e->m_hash == pos_hash_pair.second);
-
-	    ++iterated_num_used_e;
-
-	    break;
-	  }
-	default:
-	  PB_ASSOC_DBG_ASSERT(0);
-	};
-    }
-
-  PB_ASSOC_DBG_ASSERT(iterated_num_used_e == m_num_used_e);
-}
-
-#endif // #ifdef PB_ASSOC_GP_HT_MAP_DEBUG_
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/gp_ht_map_/erase_fn_imps.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/gp_ht_map_/erase_fn_imps.hpp
deleted file mode 100644
index c475b2def01..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/gp_ht_map_/erase_fn_imps.hpp
+++ /dev/null
@@ -1,110 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file erase_fn_imps.hpp
- * Contains implementations of gp_ht_map_'s erase related functions.
- */
-
-PB_ASSOC_CLASS_T_DEC
-inline void
-PB_ASSOC_CLASS_C_DEC::
-erase_entry(entry_pointer p_e)
-{
-  PB_ASSOC_DBG_ASSERT(p_e->m_stat = VALID_ENTRY_STATUS);
-
-  PB_ASSOC_DBG_ONLY(my_map_debug_base::erase_existing(p_e->m_value.first);)
-
-    p_e->m_value.~value_type();
-
-  p_e->m_stat = ERASED_ENTRY_STATUS;
-
-  PB_ASSOC_DBG_ASSERT(m_num_used_e > 0);
-  my_resize_base::notify_erased(--m_num_used_e);
-}
-
-PB_ASSOC_CLASS_T_DEC
-void
-PB_ASSOC_CLASS_C_DEC::
-clear()
-{
-  for (size_type pos = 0; pos < m_num_e; ++pos)
-    {
-      entry_pointer p_e =& m_a_entries[pos];
-
-      if (p_e->m_stat == VALID_ENTRY_STATUS)
-	erase_entry(p_e);
-    }
-
-  do_resize_if_needed_no_throw();
-
-  my_resize_base::notify_cleared();
-}
-
-PB_ASSOC_CLASS_T_DEC
-template<class Pred>
-inline typename PB_ASSOC_CLASS_C_DEC::size_type
-PB_ASSOC_CLASS_C_DEC::
-erase_if(Pred pred)
-{
-  PB_ASSOC_DBG_ONLY(PB_ASSOC_CLASS_C_DEC::assert_valid();)
-
-    size_type num_ersd = 0;
-
-  for (size_type pos = 0; pos < m_num_e; ++pos)
-    {
-      entry_pointer p_e =& m_a_entries[pos];
-
-      if (p_e->m_stat == VALID_ENTRY_STATUS&&  pred(p_e->m_value))
-	{
-	  ++num_ersd;
-
-	  erase_entry(p_e);
-	}
-    }
-
-  do_resize_if_needed_no_throw();
-
-  PB_ASSOC_DBG_ONLY(PB_ASSOC_CLASS_C_DEC::assert_valid();)
-
-    return (num_ersd);
-}
-
-#include <ext/pb_assoc/detail/gp_ht_map_/erase_no_store_hash_fn_imps.hpp>
-#include <ext/pb_assoc/detail/gp_ht_map_/erase_store_hash_fn_imps.hpp>
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/gp_ht_map_/erase_no_store_hash_fn_imps.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/gp_ht_map_/erase_no_store_hash_fn_imps.hpp
deleted file mode 100644
index c4251023247..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/gp_ht_map_/erase_no_store_hash_fn_imps.hpp
+++ /dev/null
@@ -1,104 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file erase_no_store_hash_fn_imps.hpp
- * Contains implementations of gp_ht_map_'s erase related functions, when the hash
- *	value is not stored.
- */
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::size_type
-PB_ASSOC_CLASS_C_DEC::
-erase(const_key_reference r_key, int_to_type<false>)
-{
-  PB_ASSOC_DBG_ONLY(PB_ASSOC_CLASS_C_DEC::assert_valid();)
-
-    size_type hash = my_ranged_probe_fn_base::operator()(r_key);
-
-  size_type i;
-
-  my_resize_base::notify_erase_search_start();
-
-  for (i = 0; i < m_num_e; ++i)
-    {
-      const size_type pos =
-	my_ranged_probe_fn_base::operator()(r_key, hash, i);
-
-      entry* const p_e = m_a_entries + pos;
-
-      switch(p_e->m_stat)
-	{
-	case EMPTY_ENTRY_STATUS:
-	  {
-	    my_resize_base::notify_erase_search_end();
-
-	    PB_ASSOC_DBG_ONLY(my_map_debug_base::check_key_does_not_exist(
-									  r_key));
-
-	    return (0);
-	  }
-	  break;
-	case VALID_ENTRY_STATUS:
-	  if (my_hash_eq_fn_base::operator()(
-					     PB_ASSOC_V2F(p_e->m_value)))
-	    {
-	      my_resize_base::notify_erase_search_end();
-
-	      erase_entry(p_e);
-
-	      do_resize_if_needed_no_throw();
-
-	      return (1);
-	    }
-	  break;
-	case ERASED_ENTRY_STATUS:
-	  break;
-	default:
-	  PB_ASSOC_DBG_ASSERT(0);
-	};
-
-      my_resize_base::notify_erase_search_collision();
-    }
-
-  my_resize_base::notify_erase_search_end();
-
-  return (0);
-}
-
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/gp_ht_map_/erase_store_hash_fn_imps.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/gp_ht_map_/erase_store_hash_fn_imps.hpp
deleted file mode 100644
index 60d4aa51cd8..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/gp_ht_map_/erase_store_hash_fn_imps.hpp
+++ /dev/null
@@ -1,109 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file erase_store_hash_fn_imps.hpp
- * Contains implementations of gp_ht_map_'s erase related functions, when the hash
- *	value is stored.
- */
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::size_type
-PB_ASSOC_CLASS_C_DEC::
-erase(const_key_reference r_key, int_to_type<true>)
-{
-  PB_ASSOC_DBG_ONLY(PB_ASSOC_CLASS_C_DEC::assert_valid();)
-
-    PB_ASSOC_DBG_ONLY(assert_valid();)
-
-    return (erase_in_pos_imp(r_key, 0));
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::size_type
-PB_ASSOC_CLASS_C_DEC::
-erase_in_pos_imp(const_key_reference r_key, const comp_hash& /*r_pos_hash_pair*/)
-{
-  const comp_hash pos_hash_pair =
-    my_ranged_probe_fn_base::operator()(r_key);
-
-  for (size_type i = 0; i < m_num_e; ++i)
-    {
-      const size_type pos = my_ranged_probe_fn_base::operator()(r_key, pos_hash_pair.second, i);
-
-      entry* const p_e = m_a_entries + pos;
-
-      switch(p_e->m_stat)
-	{
-	case EMPTY_ENTRY_STATUS:
-	  {
-	    my_resize_base::notify_erase_search_end();
-
-	    PB_ASSOC_DBG_ONLY(my_map_debug_base::check_key_does_not_exist(
-									  r_key));
-
-	    return (0);
-	  }
-	  break;
-	case VALID_ENTRY_STATUS:
-	  if (my_hash_eq_fn_base::operator()(p_e->m_value.first, p_e->m_hash, r_key, pos_hash_pair.second))
-	    {
-	      my_resize_base::notify_erase_search_end();
-
-	      erase_entry(p_e);
-
-	      do_resize_if_needed_no_throw();
-
-	      return (1);
-	    }
-	  break;
-	case ERASED_ENTRY_STATUS:
-	  break;
-	default:
-	  PB_ASSOC_DBG_ASSERT(0);
-	};
-
-      my_resize_base::notify_erase_search_collision();
-    }
-
-  my_resize_base::notify_erase_search_end();
-
-  return (0);
-}
-
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/gp_ht_map_/find_fn_imps.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/gp_ht_map_/find_fn_imps.hpp
deleted file mode 100644
index 076b726996f..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/gp_ht_map_/find_fn_imps.hpp
+++ /dev/null
@@ -1,94 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file find_fn_imps.hpp
- * Contains implementations of gp_ht_map_'s find related functions.
- */
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::find_iterator
-PB_ASSOC_CLASS_C_DEC::
-find(const_key_reference r_key)
-{
-  PB_ASSOC_DBG_ONLY(assert_valid();)
-
-    return ((find_key_pointer(r_key, my_hash_traits_base::s_store_hash_indicator)));
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::const_find_iterator
-PB_ASSOC_CLASS_C_DEC::
-find(const_key_reference r_key) const
-{
-  PB_ASSOC_DBG_ONLY(assert_valid();)
-
-    return (const_cast<PB_ASSOC_CLASS_C_DEC& >(*this).
-	    find_key_pointer(r_key, my_hash_traits_base::s_store_hash_indicator));
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::find_iterator
-PB_ASSOC_CLASS_C_DEC::
-find_end()
-{
-  return (NULL);
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::const_find_iterator
-PB_ASSOC_CLASS_C_DEC::
-find_end() const
-{
-  return (NULL);
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::const_data_reference
-PB_ASSOC_CLASS_C_DEC::
-const_subscript_imp(const_key_reference r_key) const
-{
-  PB_ASSOC_DBG_ONLY(PB_ASSOC_CLASS_C_DEC::assert_valid();)
-
-    return (const_subscript_imp(r_key, my_hash_traits_base::s_store_hash_indicator));
-}
-
-#include <ext/pb_assoc/detail/gp_ht_map_/find_no_store_hash_fn_imps.hpp>
-#include <ext/pb_assoc/detail/gp_ht_map_/find_store_hash_fn_imps.hpp>
-
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/gp_ht_map_/find_no_store_hash_fn_imps.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/gp_ht_map_/find_no_store_hash_fn_imps.hpp
deleted file mode 100644
index bc135b9b817..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/gp_ht_map_/find_no_store_hash_fn_imps.hpp
+++ /dev/null
@@ -1,116 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file find_no_store_hash_fn_imps.hpp
- * Contains implementations of gp_ht_map_'s find related functions, when the hash
- *	value is not stored.
- */
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::const_data_reference
-PB_ASSOC_CLASS_C_DEC::
-const_subscript_imp(const_key_reference r_key, int_to_type<false>) const
-{
-  PB_ASSOC_DBG_ONLY(assert_valid();)
-
-    return (const_cast<PB_ASSOC_CLASS_C_DEC& >(*this).
-	    find_key_pointer(r_key, my_traits_base::m_store_hash_indicator)->second);
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::pointer
-PB_ASSOC_CLASS_C_DEC::find_key_pointer(const_key_reference r_key, int_to_type<false>)
-{
-  const size_type hash = my_ranged_probe_fn_base::operator()(r_key);
-
-  size_type i;
-
-  my_resize_base::notify_find_search_start();
-
-  // Loop until entry is found or until all possible entries accessed.
-
-  for (i = 0; i < m_num_e; ++i)
-    {
-      const size_type pos =
-	my_ranged_probe_fn_base::operator()(r_key, hash, i);
-
-      entry* const p_e = m_a_entries + pos;
-
-      switch(p_e->m_stat)
-	{
-	case EMPTY_ENTRY_STATUS:
-	  {
-	    my_resize_base::notify_find_search_end();
-
-	    PB_ASSOC_DBG_ONLY(my_map_debug_base::
-			      check_key_does_not_exist(r_key);)
-
-	      return (NULL);
-	  }
-	  break;
-	case VALID_ENTRY_STATUS:
-	  if (my_hash_eq_fn_base::operator()(
-					     PB_ASSOC_V2F(p_e->m_value),
-					     r_key))
-	    {
-	      my_resize_base::notify_find_search_end();
-
-	      PB_ASSOC_DBG_ONLY(my_map_debug_base::check_key_exists(r_key);)
-
-		return ((pointer)&p_e->m_value);
-	    }
-	  break;
-	case ERASED_ENTRY_STATUS:
-	  break;
-	default:
-	  PB_ASSOC_DBG_ASSERT(0);
-	};
-
-      my_resize_base::notify_find_search_collision();
-    }
-
-  PB_ASSOC_DBG_ONLY(my_map_debug_base::
-		    check_key_does_not_exist(r_key);)
-
-    my_resize_base::notify_find_search_end();
-
-  return (NULL);
-}
-
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/gp_ht_map_/find_store_hash_fn_imps.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/gp_ht_map_/find_store_hash_fn_imps.hpp
deleted file mode 100644
index b80087113a1..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/gp_ht_map_/find_store_hash_fn_imps.hpp
+++ /dev/null
@@ -1,118 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file find_store_hash_fn_imps.hpp
- * Contains implementations of gp_ht_map_'s insert related functions, when the hash
- *	value is stored.
- */
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::const_data_reference
-PB_ASSOC_CLASS_C_DEC::
-const_subscript_imp(const_key_reference r_key, int_to_type<true>)  const
-{
-  PB_ASSOC_DBG_ONLY(assert_valid();)
-
-    return (const_cast<PB_ASSOC_CLASS_C_DEC& >(*this).find_key_pointer(r_key, my_traits_base::m_store_hash_indicator)->second);
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::pointer
-PB_ASSOC_CLASS_C_DEC::
-find_key_pointer(const_key_reference r_key, int_to_type<true>)
-{
-  comp_hash pos_hash_pair = my_ranged_probe_fn_base::operator()(r_key);
-
-  size_type i;
-
-  my_resize_base::notify_find_search_start();
-
-  // Loop until entry is found or until all possible entries accessed.
-
-  for (i = 0; i < m_num_e; ++i)
-    {
-      const size_type pos =
-	my_ranged_probe_fn_base::operator()(r_key, pos_hash_pair.second, i);
-
-      entry* const p_e = m_a_entries + pos;
-
-      switch(p_e->m_stat)
-	{
-	case EMPTY_ENTRY_STATUS:
-	  {
-	    my_resize_base::notify_find_search_end();
-
-	    PB_ASSOC_DBG_ONLY(my_map_debug_base::
-			      check_key_does_not_exist(r_key);)
-
-	      return (NULL);
-	  }
-	  break;
-	case VALID_ENTRY_STATUS:
-	  if (my_hash_eq_fn_base::operator()(
-					     PB_ASSOC_V2F(p_e->m_value),
-					     p_e->m_hash,
-					     r_key,
-					     pos_hash_pair.second))
-	    {
-	      my_resize_base::notify_find_search_end();
-
-	      PB_ASSOC_DBG_ONLY(my_map_debug_base::check_key_exists(r_key);)
-
-		return ((pointer)&p_e->m_value);
-	    }
-	  break;
-	case ERASED_ENTRY_STATUS:
-	  break;
-	default:
-	  PB_ASSOC_DBG_ASSERT(0);
-	};
-
-      my_resize_base::notify_find_search_collision();
-    }
-
-  PB_ASSOC_DBG_ONLY(my_map_debug_base::
-		    check_key_does_not_exist(r_key);)
-
-    my_resize_base::notify_find_search_end();
-
-  return (NULL);
-}
-
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/gp_ht_map_/gp_ht_map_.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/gp_ht_map_/gp_ht_map_.hpp
deleted file mode 100644
index a56a0ede260..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/gp_ht_map_/gp_ht_map_.hpp
+++ /dev/null
@@ -1,602 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file gp_ht_map_.hpp
- * Contains an implementation class for gp_ht_map_.
- */
-
-#include <ext/pb_assoc/detail/cond_dealtor.hpp>
-#include <ext/pb_assoc/trivial_iterator_def.hpp>
-#include <ext/pb_assoc/detail/hash_fn/ranged_probe_fn.hpp>
-#include <ext/pb_assoc/detail/hash_types_traits.hpp>
-#include <ext/pb_assoc/detail/types_traits.hpp>
-#include <ext/pb_assoc/exception.hpp>
-#include <ext/pb_assoc/detail/map_debug_base.hpp>
-#include <ext/pb_assoc/detail/eq_fn/hash_eq_fn.hpp>
-#ifdef PB_ASSOC_BASIC_REGRESSION
-#include <pb_assoc/testsuite/regression/basic_test/throw_prob_adjustor.hpp>
-#endif // #ifdef PB_ASSOC_BASIC_REGRESSION
-#include <utility>
-
-namespace pb_assoc
-{
-
-  namespace detail
-  {
-
-#ifdef PB_ASSOC_GP_HT_MAP_DEBUG_
-#define PB_ASSOC_DBG_ASSERT(X) assert(X)
-#define PB_ASSOC_DBG_VERIFY(X) assert(X)
-#define PB_ASSOC_DBG_ONLY(X) X
-#else // #ifdef PB_ASSOC_GP_HT_MAP_DEBUG_
-#define PB_ASSOC_DBG_ASSERT(X)
-#define PB_ASSOC_DBG_VERIFY(X) {if((X)==0);}
-#define PB_ASSOC_DBG_ONLY(X) ;
-#endif // #ifdef PB_ASSOC_GP_HT_MAP_DEBUG_
-
-#define PB_ASSOC_CLASS_T_DEC \
-	template< \
-		typename Key, \
-		typename Data, \
-		class Hash_Fn, \
-		class Eq_Fn, \
-		class Allocator, \
-		bool Store_Hash, \
-		class Comb_Probe_Fn, \
-		class Probe_Fn, \
-		class Resize_Policy>
-
-#ifdef PB_ASSOC_DATA_TRUE_INDICATOR
-#define PB_ASSOC_CLASS_NAME \
-	gp_ht_map_data_
-#endif // #ifdef PB_ASSOC_DATA_TRUE_INDICATOR
-
-#ifdef PB_ASSOC_DATA_FALSE_INDICATOR
-#define PB_ASSOC_CLASS_NAME \
-	gp_ht_map_no_data_
-#endif // #ifdef PB_ASSOC_DATA_FALSE_INDICATOR
-
-#define PB_ASSOC_CLASS_C_DEC \
-	PB_ASSOC_CLASS_NAME< \
-		Key, \
-		Data, \
-		Hash_Fn, \
-		Eq_Fn, \
-		Allocator, \
-		Store_Hash, \
-		Comb_Probe_Fn, \
-		Probe_Fn, \
-		Resize_Policy>
-
-#define PB_ASSOC_HASH_EQ_FN_C_DEC \
-	pb_assoc::detail::hash_eq_fn< \
-		Key, \
-		Eq_Fn, \
-		Allocator, \
-		Store_Hash>
-
-#define PB_ASSOC_RANGED_PROBE_FN_C_DEC \
-	pb_assoc::detail::ranged_probe_fn< \
-		Key, \
-		Hash_Fn, \
-		Allocator, \
-		Comb_Probe_Fn, \
-		Probe_Fn, \
-		Store_Hash>
-
-#define PB_ASSOC_TYPES_TRAITS_C_DEC \
-	types_traits< \
-		Key, \
-		Data, \
-		Allocator>
-
-#define PB_ASSOC_HASH_TYPES_TRAITS_C_DEC \
-	hash_types_traits< \
-		typename Allocator::size_type, \
-		Store_Hash>
-
-#ifdef PB_ASSOC_USE_MAP_DEBUG_BASE
-#define PB_ASSOC_MAP_DEBUG_BASE_C_DEC \
-	pb_assoc::detail::map_debug_base< \
-		Key, \
-		Eq_Fn>
-#endif // #ifdef PB_ASSOC_USE_MAP_DEBUG_BASE
-
-#ifdef PB_ASSOC_DATA_TRUE_INDICATOR
-#define PB_ASSOC_V2F(X) (X).first
-#define PB_ASSOC_V2S(X) (X).second
-#endif // #ifdef PB_ASSOC_DATA_TRUE_INDICATOR
-
-#ifdef PB_ASSOC_DATA_FALSE_INDICATOR
-#define PB_ASSOC_V2F(X) (X)
-#define PB_ASSOC_V2S(X) Mapped_Data()
-#endif // #ifdef PB_ASSOC_DATA_FALSE_INDICATOR
-
-#define PB_ASSOC_STATIC_ASSERT(UNIQUE, E) \
-	typedef \
-		pb_assoc::detail::static_assert_dummy_class< \
-			sizeof(pb_assoc::detail::static_assert<(bool)(E)>)> \
-			UNIQUE##static_assert_type
-
-    template<typename Key,
-	     typename Data,
-	     class Hash_Fn,
-	     class Eq_Fn,
-	     class Allocator,
-	     bool Store_Hash,
-	     class Comb_Probe_Fn,
-	     class Probe_Fn,
-	     class Resize_Policy>
-    class PB_ASSOC_CLASS_NAME :
-#ifdef PB_ASSOC_GP_HT_MAP_DEBUG_
-      protected PB_ASSOC_MAP_DEBUG_BASE_C_DEC,
-#endif // #ifdef PB_ASSOC_GP_HT_MAP_DEBUG_
-      public PB_ASSOC_HASH_EQ_FN_C_DEC,
-      public Resize_Policy,
-      public PB_ASSOC_RANGED_PROBE_FN_C_DEC,
-      public PB_ASSOC_TYPES_TRAITS_C_DEC,
-      public PB_ASSOC_HASH_TYPES_TRAITS_C_DEC
-    {
-
-    public:
-
-      typedef typename Allocator::size_type size_type;
-
-      typedef
-      typename PB_ASSOC_TYPES_TRAITS_C_DEC::const_key_reference
-      const_key_reference;
-
-      typedef typename PB_ASSOC_TYPES_TRAITS_C_DEC::data_type data_type;
-
-      typedef
-      typename PB_ASSOC_TYPES_TRAITS_C_DEC::data_reference
-      data_reference;
-
-      typedef
-      typename PB_ASSOC_TYPES_TRAITS_C_DEC::const_data_reference
-      const_data_reference;
-
-      typedef typename PB_ASSOC_TYPES_TRAITS_C_DEC::value_type value_type;
-
-      typedef typename PB_ASSOC_TYPES_TRAITS_C_DEC::pointer pointer;
-
-      typedef
-      typename PB_ASSOC_TYPES_TRAITS_C_DEC::const_pointer
-      const_pointer;
-
-      typedef typename PB_ASSOC_TYPES_TRAITS_C_DEC::reference reference;
-
-      typedef
-      typename PB_ASSOC_TYPES_TRAITS_C_DEC::const_reference
-      const_reference;
-
-    protected:
-
-      typedef typename PB_ASSOC_HASH_TYPES_TRAITS_C_DEC::comp_hash comp_hash;
-
-      enum ENTRY_STATUS
-	{
-	  EMPTY_ENTRY_STATUS,
-	  VALID_ENTRY_STATUS,
-	  ERASED_ENTRY_STATUS
-	};
-
-      typedef char entry_status;
-
-      struct store_hash_entry
-      {
-	value_type m_value;
-
-	entry_status m_stat;
-
-	size_type m_hash;
-      };
-
-      struct no_store_hash_entry
-      {
-	value_type m_value;
-
-	entry_status m_stat;
-      };
-
-      typedef
-      typename cond_type<
-	Store_Hash,
-	store_hash_entry,
-	no_store_hash_entry>::type
-      entry;
-
-      typedef
-      typename Allocator::template rebind<entry>::other
-      entry_allocator;
-
-      typedef typename entry_allocator::pointer entry_pointer;
-
-      typedef typename entry_allocator::const_pointer const_entry_pointer;
-
-      typedef typename entry_allocator::reference entry_reference;
-
-      typedef
-      typename entry_allocator::const_reference
-      const_entry_reference;
-
-      typedef typename entry_allocator::pointer entry_array;
-
-      typedef value_type mapped_value_type;
-
-      typedef pointer mapped_pointer;
-
-      typedef const_pointer const_mapped_pointer;
-
-      typedef reference mapped_reference;
-
-      typedef const_reference const_mapped_reference;
-
-#define PB_ASSOC_GEN_POS size_type
-
-#include <ext/pb_assoc/detail/unordered_iterator/const_find_iterator.hpp>
-#include <ext/pb_assoc/detail/unordered_iterator/find_iterator.hpp>
-#include <ext/pb_assoc/detail/unordered_iterator/const_iterator.hpp>
-#include <ext/pb_assoc/detail/unordered_iterator/iterator.hpp>
-
-#undef PB_ASSOC_GEN_POS
-
-      typedef find_iterator_ find_iterator;
-
-      typedef const_find_iterator_ const_find_iterator;
-
-      typedef iterator_ iterator;
-
-      typedef const_iterator_ const_iterator;
-
-      typedef Hash_Fn hash_fn;
-
-      typedef Eq_Fn eq_fn;
-
-      typedef Allocator allocator;
-
-      typedef Probe_Fn probe_fn;
-
-      typedef Comb_Probe_Fn comb_hash_fn;
-
-      typedef Resize_Policy resize_policy;
-
-    protected:
-
-      PB_ASSOC_CLASS_NAME();
-
-      PB_ASSOC_CLASS_NAME(const PB_ASSOC_CLASS_C_DEC& r_other);
-
-      PB_ASSOC_CLASS_NAME(const Hash_Fn& r_hash_fn);
-
-      PB_ASSOC_CLASS_NAME(const Hash_Fn& r_hash_fn, const Eq_Fn& r_eq_fn);
-
-      PB_ASSOC_CLASS_NAME(const Hash_Fn& r_hash_fn, const Eq_Fn& r_eq_fn, const Comb_Probe_Fn& r_comb_probe_fn);
-
-      PB_ASSOC_CLASS_NAME(const Hash_Fn& r_hash_fn, const Eq_Fn& r_eq_fn, const Comb_Probe_Fn& r_comb_probe_fn, const Probe_Fn& r_probe_fn);
-
-      PB_ASSOC_CLASS_NAME(const Hash_Fn& r_hash_fn, const Eq_Fn& r_eq_fn, const Comb_Probe_Fn& r_comb_probe_fn, const Probe_Fn& r_probe_fn, const Resize_Policy& r_resize_policy);
-
-      template<class It>
-      void
-      copy_from_range(It first_it, It last_it);
-
-      virtual
-      ~PB_ASSOC_CLASS_NAME();
-
-      void
-      swap(PB_ASSOC_CLASS_C_DEC& r_other);
-
-      inline size_type
-      size() const;
-
-      inline size_type
-      max_size() const;
-
-      inline bool
-      empty() const;
-
-      Hash_Fn& 
-      get_hash_fn();
-
-      const Hash_Fn& 
-      get_hash_fn() const;
-
-      Eq_Fn& 
-      get_eq_fn();
-
-      const Eq_Fn& 
-      get_eq_fn() const;
-
-      Probe_Fn& 
-      get_probe_fn();
-
-      const Probe_Fn& 
-      get_probe_fn() const;
-
-      Comb_Probe_Fn& 
-      get_comb_probe_fn();
-
-      const Comb_Probe_Fn& 
-      get_comb_probe_fn() const;
-
-      Resize_Policy& 
-      get_resize_policy();
-
-      const Resize_Policy& 
-      get_resize_policy() const;
-
-      inline std::pair<find_iterator, bool>
-      insert(const_reference r_val);
-
-      inline data_reference
-      subscript_imp(const_key_reference r_key);
-
-      inline find_iterator
-      find(const_key_reference r_key);
-
-      inline const_find_iterator
-      find(const_key_reference r_key) const;
-
-      inline find_iterator
-      find_end();
-
-      inline const_find_iterator
-      find_end() const;
-
-      inline size_type
-      erase(const_key_reference r_key, int_to_type<false>);
-
-      inline size_type
-      erase(const_key_reference r_key, int_to_type<true>);
-
-      template<class Pred>
-      inline size_type
-      erase_if(Pred prd);
-
-      void
-      clear();
-
-      inline iterator
-      begin();
-
-      inline const_iterator
-      begin() const;
-
-      inline iterator
-      end();
-
-      inline const_iterator
-      end() const;
-
-#ifdef PB_ASSOC_CC_HT_MAP_DEBUG
-
-      virtual void
-      assert_valid() const;
-
-#endif // #ifdef PB_ASSOC_GP_HT_MAP_DEBUG_
-
-      virtual void
-      do_resize(size_type new_size);
-
-    private:
-
-      typedef PB_ASSOC_TYPES_TRAITS_C_DEC my_traits_base;
-
-      typedef PB_ASSOC_HASH_TYPES_TRAITS_C_DEC my_hash_traits_base;
-
-      typedef PB_ASSOC_RANGED_PROBE_FN_C_DEC my_ranged_probe_fn_base;
-
-#ifdef PB_ASSOC_GP_HT_MAP_DEBUG_
-      typedef PB_ASSOC_MAP_DEBUG_BASE_C_DEC my_map_debug_base;
-#endif // #ifdef PB_ASSOC_GP_HT_MAP_DEBUG_
-
-      typedef PB_ASSOC_HASH_EQ_FN_C_DEC my_hash_eq_fn_base;
-
-      typedef Resize_Policy my_resize_base;
-
-      friend class iterator_;
-
-      friend class const_iterator_;
-
-    private:
-
-      void
-      deallocate_all();
-
-      void
-      initialize();
-
-      inline void
-      constructor_insert_new_imp(const_reference r_val, size_type pos, int_to_type<true>);
-
-      inline void
-      constructor_insert_new_imp(const_reference r_val, size_type pos, int_to_type<false>);
-
-      void
-      erase_all_valid_entries(entry_array a_entries_resized, size_type size);
-
-      inline bool
-      do_resize_if_needed();
-
-      inline void
-      do_resize_if_needed_no_throw();
-
-      void
-      resize_imp(entry_array a_entries_resized, size_type old_size);
-
-      inline void
-      resize_imp_reassign(entry_pointer p_e, entry_array a_entries_resized, int_to_type<false>);
-
-      inline void
-      resize_imp_reassign(entry_pointer p_e, entry_array a_entries_resized, int_to_type<true>);
-
-      inline size_type
-      find_ins_pos(const_key_reference r_key, int_to_type<false>);
-
-      inline comp_hash
-      find_ins_pos(const_key_reference r_key, int_to_type<true>);
-
-      inline std::pair<find_iterator, bool>
-      insert_imp(const_reference r_val, int_to_type<false>);
-
-      inline std::pair<find_iterator, bool>
-      insert_imp(const_reference r_val, int_to_type<true>);
-
-      inline pointer
-      insert_new_imp(const_reference r_val, size_type pos);
-
-      inline pointer
-      insert_new_imp(const_reference r_val, comp_hash& r_pos_hash_pair);
-
-      inline data_reference
-      subscript_imp(const_key_reference r_key, int_to_type<false>);
-
-      inline data_reference
-      subscript_imp(const_key_reference r_key, int_to_type<true>);
-
-      inline const_data_reference
-      const_subscript_imp(const_key_reference r_key) const;
-
-      inline pointer
-      find_key_pointer(const_key_reference r_key, int_to_type<false>);
-
-      inline pointer
-      find_key_pointer(const_key_reference r_key, int_to_type<true>);
-
-      inline const_data_reference
-      const_subscript_imp(const_key_reference r_key, int_to_type<false>) const;
-
-      inline const_data_reference
-      const_subscript_imp(const_key_reference r_key, int_to_type<true>) const;
-
-      inline size_type
-      erase_in_pos_imp(const_key_reference r_key, const comp_hash& r_pos_hash_pair);
-
-      inline void
-      erase_entry(entry_pointer p_e);
-
-#ifdef PB_ASSOC_DATA_TRUE_INDICATOR
-      void
-      inc_it_state(pointer& r_p_value, size_type& r_pos) const;
-#endif // #ifdef PB_ASSOC_DATA_TRUE_INDICATOR
-
-      void
-      inc_it_state(const_pointer& r_p_value, size_type& r_pos) const;
-
-      void
-      get_start_it_state(const_pointer& r_p_value, size_type& r_pos) const;
-
-      void
-      get_start_it_state(pointer& r_p_value, size_type& r_pos);
-
-#ifdef PB_ASSOC_CC_HT_MAP_DEBUG
-
-      void
-      assert_entry_array_valid(const entry_array a_entries, int_to_type<false>) const;
-
-      void
-      assert_entry_array_valid(const entry_array a_entries, int_to_type<true>) const;
-
-#endif // #ifdef PB_ASSOC_GP_HT_MAP_DEBUG_
-
-    private:
-      static entry_allocator s_entry_allocator;
-
-      entry_pointer m_a_entries;
-
-      size_type m_num_e;
-
-      size_type m_num_used_e;
-
-      static iterator s_end_it;
-
-      static const_iterator s_const_end_it;
-
-      enum
-	{
-	  store_hash_ok =
-	  !Store_Hash ||
-	  !pb_assoc::detail::is_same_type<
-	  Hash_Fn,
-	  pb_assoc::null_hash_fn>::value
-	};
-
-      PB_ASSOC_STATIC_ASSERT(sth, store_hash_ok);
-    };
-
-#include <ext/pb_assoc/detail/gp_ht_map_/constructor_destructor_fn_imps.hpp>
-#include <ext/pb_assoc/detail/gp_ht_map_/find_fn_imps.hpp>
-#include <ext/pb_assoc/detail/gp_ht_map_/resize_fn_imps.hpp>
-#include <ext/pb_assoc/detail/gp_ht_map_/debug_fn_imps.hpp>
-#include <ext/pb_assoc/detail/gp_ht_map_/info_fn_imps.hpp>
-#include <ext/pb_assoc/detail/gp_ht_map_/policy_access_fn_imps.hpp>
-#include <ext/pb_assoc/detail/gp_ht_map_/erase_fn_imps.hpp>
-#include <ext/pb_assoc/detail/gp_ht_map_/iterator_fn_imps.hpp>
-#include <ext/pb_assoc/detail/gp_ht_map_/insert_fn_imps.hpp>
-
-#undef PB_ASSOC_CLASS_T_DEC
-
-#undef PB_ASSOC_CLASS_C_DEC
-
-#undef PB_ASSOC_HASH_EQ_FN_C_DEC
-
-#undef PB_ASSOC_RANGED_PROBE_FN_C_DEC
-
-#undef PB_ASSOC_TYPES_TRAITS_C_DEC
-
-#undef PB_ASSOC_HASH_TYPES_TRAITS_C_DEC
-
-#undef PB_ASSOC_MAP_DEBUG_BASE_C_DEC
-
-#undef PB_ASSOC_CLASS_NAME
-
-#undef PB_ASSOC_V2F
-#undef PB_ASSOC_V2S
-
-#undef PB_ASSOC_DBG_ASSERT
-#undef PB_ASSOC_DBG_VERIFY
-#undef PB_ASSOC_DBG_ONLY
-
-#undef PB_ASSOC_STATIC_ASSERT
-
-  } // namespace detail
-
-} // namespace pb_assoc
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/gp_ht_map_/info_fn_imps.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/gp_ht_map_/info_fn_imps.hpp
deleted file mode 100644
index 49e912807db..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/gp_ht_map_/info_fn_imps.hpp
+++ /dev/null
@@ -1,68 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file info_fn_imps.hpp
- * Contains implementations of gp_ht_map_'s entire container info related
- *	functions.
- */
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::size_type
-PB_ASSOC_CLASS_C_DEC::
-size() const
-{
-  return (m_num_used_e);
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::size_type
-PB_ASSOC_CLASS_C_DEC::
-max_size() const
-{
-  return (s_entry_allocator.max_size());
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline bool
-PB_ASSOC_CLASS_C_DEC::
-empty() const
-{
-  return (size() == 0);
-}
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/gp_ht_map_/insert_fn_imps.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/gp_ht_map_/insert_fn_imps.hpp
deleted file mode 100644
index ff88d992b04..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/gp_ht_map_/insert_fn_imps.hpp
+++ /dev/null
@@ -1,67 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file insert_fn_imps.hpp
- * Contains implementations of gp_ht_map_'s insert related functions.
- */
-
-PB_ASSOC_CLASS_T_DEC
-inline std::pair<typename PB_ASSOC_CLASS_C_DEC::find_iterator, bool>
-PB_ASSOC_CLASS_C_DEC::
-insert(const_mapped_reference r_val)
-{
-  PB_ASSOC_DBG_ONLY(PB_ASSOC_CLASS_C_DEC::assert_valid();)
-
-    return (insert_imp(r_val, my_hash_traits_base::s_store_hash_indicator));
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::data_reference
-PB_ASSOC_CLASS_C_DEC::
-subscript_imp(const_key_reference r_key)
-{
-  PB_ASSOC_DBG_ONLY(PB_ASSOC_CLASS_C_DEC::assert_valid();)
-
-    return (subscript_imp(r_key, my_hash_traits_base::s_store_hash_indicator));
-}
-
-#include <ext/pb_assoc/detail/gp_ht_map_/insert_no_store_hash_fn_imps.hpp>
-#include <ext/pb_assoc/detail/gp_ht_map_/insert_store_hash_fn_imps.hpp>
-
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/gp_ht_map_/insert_no_store_hash_fn_imps.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/gp_ht_map_/insert_no_store_hash_fn_imps.hpp
deleted file mode 100644
index 24586553777..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/gp_ht_map_/insert_no_store_hash_fn_imps.hpp
+++ /dev/null
@@ -1,184 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file insert_no_store_hash_fn_imps.hpp
- * Contains implementations of gp_ht_map_'s insert related functions, when the hash
- *	value is not stored.
- */
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::size_type
-PB_ASSOC_CLASS_C_DEC::
-find_ins_pos(const_key_reference r_key, int_to_type<false>)
-{
-  size_type hash = my_ranged_probe_fn_base::operator()(r_key);
-
-  size_type i;
-
-  /* The insertion position is initted to a non-legal value to indicate
-   *	that it has not been initted yet.
-   */
-  size_type ins_pos = m_num_e;
-
-  my_resize_base::notify_insert_search_start();
-
-  for (i = 0; i < m_num_e; ++i)
-    {
-      const size_type pos =
-	my_ranged_probe_fn_base::operator()(r_key, hash, i);
-
-      entry* const p_e = m_a_entries + pos;
-
-      switch(p_e->m_stat)
-	{
-	case EMPTY_ENTRY_STATUS:
-	  {
-	    my_resize_base::notify_insert_search_end();
-
-	    PB_ASSOC_DBG_ONLY(
-			      my_map_debug_base::check_key_does_not_exist(r_key);)
-
-	      return ((ins_pos == m_num_e)? pos : ins_pos);
-	  }
-	  break;
-	case ERASED_ENTRY_STATUS:
-	  if (ins_pos == m_num_e)
-	    ins_pos = pos;
-	  break;
-	case VALID_ENTRY_STATUS:
-	  if (my_hash_eq_fn_base::operator()(
-					     PB_ASSOC_V2F(p_e->m_value), r_key))
-	    {
-	      my_resize_base::notify_insert_search_end();
-
-	      PB_ASSOC_DBG_ONLY(my_map_debug_base::check_key_exists(r_key);)
-
-		return (pos);
-	    }
-	  break;
-	default:
-	  PB_ASSOC_DBG_ASSERT(0);
-	};
-
-      my_resize_base::notify_insert_search_collision();
-    }
-
-  my_resize_base::notify_insert_search_end();
-
-  if (ins_pos == m_num_e)
-    throw cannot_insert();
-
-  return (ins_pos);
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::data_reference
-PB_ASSOC_CLASS_C_DEC::
-subscript_imp(const_key_reference r_key, int_to_type<false>)
-{
-  PB_ASSOC_DBG_ONLY(assert_valid();)
-
-    const size_type pos =
-    find_ins_pos(r_key, my_hash_traits_base::s_store_hash_indicator);
-
-  entry_pointer p_e =& m_a_entries[pos];
-
-  if (p_e->m_stat != VALID_ENTRY_STATUS)
-    return (insert_new_imp(
-			   value_type(r_key, Data()), pos)->second);
-
-  PB_ASSOC_DBG_ONLY(my_map_debug_base::check_key_exists(r_key);)
-
-    return (p_e->m_value.second);
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline std::pair<typename PB_ASSOC_CLASS_C_DEC::find_iterator, bool>
-PB_ASSOC_CLASS_C_DEC::
-insert_imp(const_reference r_val, int_to_type<false>)
-{
-  const_key_reference r_key = PB_ASSOC_V2F(r_val);
-
-  const size_type pos =
-    find_ins_pos(r_key, my_hash_traits_base::s_store_hash_indicator);
-
-  if (m_a_entries[pos].m_stat == VALID_ENTRY_STATUS)
-    {
-      PB_ASSOC_DBG_ONLY(my_map_debug_base::check_key_exists(r_key);)
-
-	return (std::make_pair(&m_a_entries[pos].m_value, false));
-    }
-
-  PB_ASSOC_DBG_ONLY(my_map_debug_base::check_key_does_not_exist(r_key));
-
-  return (std::make_pair(
-			 insert_new_imp(r_val, pos),
-			 true));
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::pointer
-PB_ASSOC_CLASS_C_DEC::
-insert_new_imp(const_reference r_val, size_type pos)
-{
-  PB_ASSOC_DBG_ASSERT(m_a_entries[pos].m_stat != VALID_ENTRY_STATUS);
-
-  if (do_resize_if_needed())
-    pos = find_ins_pos(PB_ASSOC_V2F(r_val),
-		       my_hash_traits_base::s_store_hash_indicator);
-
-  PB_ASSOC_DBG_ASSERT(m_a_entries[pos].m_stat != VALID_ENTRY_STATUS);
-
-  entry* const p_e = m_a_entries + pos;
-
-  new (&p_e->m_value) value_type(r_val);
-
-  p_e->m_stat = VALID_ENTRY_STATUS;
-
-  my_resize_base::notify_inserted(++m_num_used_e);
-
-  PB_ASSOC_DBG_ONLY(my_map_debug_base::
-		    insert_new(p_e->m_value.first);)
-
-    PB_ASSOC_DBG_ONLY(assert_valid();)
-
-    return (static_cast<pointer>(&p_e->m_value));
-}
-
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/gp_ht_map_/insert_store_hash_fn_imps.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/gp_ht_map_/insert_store_hash_fn_imps.hpp
deleted file mode 100644
index f342a084c6a..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/gp_ht_map_/insert_store_hash_fn_imps.hpp
+++ /dev/null
@@ -1,195 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file insert_store_hash_fn_imps.hpp
- * Contains implementations of gp_ht_map_'s find related functions, when the hash
- *	value is stored.
- */
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::comp_hash
-PB_ASSOC_CLASS_C_DEC::
-find_ins_pos(const_key_reference r_key, int_to_type<true>)
-{
-  PB_ASSOC_DBG_ONLY(PB_ASSOC_CLASS_C_DEC::assert_valid();)
-
-    comp_hash pos_hash_pair = my_ranged_probe_fn_base::operator()(r_key);
-
-  size_type i;
-
-  /* The insertion position is initted to a non-legal value to indicate
-   *	that it has not been initted yet.
-   */
-  size_type ins_pos = m_num_e;
-
-  my_resize_base::notify_insert_search_start();
-
-  for (i = 0; i < m_num_e; ++i)
-    {
-      const size_type pos =
-	my_ranged_probe_fn_base::operator()(r_key, pos_hash_pair.second, i);
-
-      entry* const p_e = m_a_entries + pos;
-
-      switch(p_e->m_stat)
-	{
-	case EMPTY_ENTRY_STATUS:
-	  {
-	    my_resize_base::notify_insert_search_end();
-
-	    PB_ASSOC_DBG_ONLY(
-			      my_map_debug_base::check_key_does_not_exist(r_key);)
-
-	      return ((ins_pos == m_num_e)?
-		      std::make_pair(pos, pos_hash_pair.second) :
-		      std::make_pair(ins_pos, pos_hash_pair.second));
-	  }
-	  break;
-	case ERASED_ENTRY_STATUS:
-	  if (ins_pos == m_num_e)
-	    ins_pos = pos;
-	  break;
-	case VALID_ENTRY_STATUS:
-	  if (my_hash_eq_fn_base::operator()(
-					     PB_ASSOC_V2F(p_e->m_value),
-					     p_e->m_hash,
-					     r_key,
-					     pos_hash_pair.second))
-	    {
-	      my_resize_base::notify_insert_search_end();
-
-	      PB_ASSOC_DBG_ONLY(my_map_debug_base::check_key_exists(r_key);)
-
-		return (std::make_pair(pos, pos_hash_pair.second));
-	    }
-	  break;
-	default:
-	  PB_ASSOC_DBG_ASSERT(0);
-	};
-
-      my_resize_base::notify_insert_search_collision();
-    }
-
-  my_resize_base::notify_insert_search_end();
-
-  if (ins_pos == m_num_e)
-    throw cannot_insert();
-
-  return (std::make_pair(ins_pos, pos_hash_pair.second));
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::data_reference
-PB_ASSOC_CLASS_C_DEC::
-subscript_imp(const_key_reference r_key, int_to_type<true>)
-{
-  PB_ASSOC_DBG_ONLY(assert_valid();)
-
-    comp_hash pos_hash_pair =
-    find_ins_pos(r_key, my_hash_traits_base::s_store_hash_indicator);
-
-  if (m_a_entries[pos_hash_pair.first].m_stat != VALID_ENTRY_STATUS)
-    return (insert_new_imp(
-			   value_type(r_key, Data()), pos_hash_pair)->second);
-
-  PB_ASSOC_DBG_ONLY(my_map_debug_base::check_key_exists(r_key));
-
-  return ((m_a_entries + pos_hash_pair.first)->m_value.second);
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline std::pair<typename PB_ASSOC_CLASS_C_DEC::find_iterator, bool>
-PB_ASSOC_CLASS_C_DEC::
-insert_imp(const_reference r_val, int_to_type<true>)
-{
-  const_key_reference r_key = PB_ASSOC_V2F(r_val);
-
-  comp_hash pos_hash_pair =
-    find_ins_pos(r_key, my_hash_traits_base::s_store_hash_indicator);
-
-  entry_pointer p_e =& m_a_entries[pos_hash_pair.first];
-
-  if (p_e->m_stat == VALID_ENTRY_STATUS)
-    {
-      PB_ASSOC_DBG_ONLY(my_map_debug_base::check_key_exists(r_key));
-
-      return (std::make_pair(&p_e->m_value, false));
-    }
-
-  PB_ASSOC_DBG_ONLY(my_map_debug_base::check_key_does_not_exist(r_key));
-
-  return (std::make_pair(
-			 insert_new_imp(r_val, pos_hash_pair),
-			 true));
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::pointer
-PB_ASSOC_CLASS_C_DEC::
-insert_new_imp(const_reference r_val, comp_hash& r_pos_hash_pair)
-{
-  PB_ASSOC_DBG_ASSERT(m_a_entries[r_pos_hash_pair.first].m_stat !=
-		      VALID_ENTRY_STATUS);
-
-  if (do_resize_if_needed())
-    r_pos_hash_pair = find_ins_pos(
-				   PB_ASSOC_V2F(r_val),
-				   my_hash_traits_base::s_store_hash_indicator);
-
-  PB_ASSOC_DBG_ASSERT(m_a_entries[r_pos_hash_pair.first].m_stat !=
-		      VALID_ENTRY_STATUS);
-
-  entry* const p_e = m_a_entries + r_pos_hash_pair.first;
-
-  new (&p_e->m_value) value_type(r_val);
-
-  p_e->m_hash = r_pos_hash_pair.second;
-
-  p_e->m_stat = VALID_ENTRY_STATUS;
-
-  my_resize_base::notify_inserted(++m_num_used_e);
-
-  PB_ASSOC_DBG_ONLY(my_map_debug_base::insert_new(p_e->m_value.first);)
-
-    PB_ASSOC_DBG_ONLY(assert_valid();)
-
-    return (static_cast<pointer>(&p_e->m_value));
-}
-
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/gp_ht_map_/iterator_fn_imps.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/gp_ht_map_/iterator_fn_imps.hpp
deleted file mode 100644
index 96a9b29c5ac..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/gp_ht_map_/iterator_fn_imps.hpp
+++ /dev/null
@@ -1,181 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file iterator_fn_imps.hpp
- * Contains implementations of gp_ht_map_'s iterators related functions, e.g.,
- *	begin().
- */
-
-PB_ASSOC_CLASS_T_DEC
-typename PB_ASSOC_CLASS_C_DEC::iterator
-PB_ASSOC_CLASS_C_DEC::s_end_it;
-
-PB_ASSOC_CLASS_T_DEC
-typename PB_ASSOC_CLASS_C_DEC::const_iterator
-PB_ASSOC_CLASS_C_DEC::s_const_end_it;
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::iterator
-PB_ASSOC_CLASS_C_DEC::
-begin()
-{
-  pointer p_value;
-  size_type pos;
-
-  get_start_it_state(p_value, pos);
-
-  return (iterator(p_value, pos, this));
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::iterator
-PB_ASSOC_CLASS_C_DEC::
-end()
-{
-  return (s_end_it);
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::const_iterator
-PB_ASSOC_CLASS_C_DEC::
-begin() const
-{
-  const_pointer p_value;
-  size_type pos;
-
-  get_start_it_state(p_value, pos);
-
-  return (const_iterator(p_value, pos, this));
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::const_iterator
-PB_ASSOC_CLASS_C_DEC::
-end() const
-{
-  return (s_const_end_it);
-}
-
-#ifdef PB_ASSOC_DATA_TRUE_INDICATOR
-PB_ASSOC_CLASS_T_DEC
-void
-PB_ASSOC_CLASS_C_DEC::
-inc_it_state(pointer& r_p_value, size_type& r_pos) const
-{
-  PB_ASSOC_DBG_ASSERT(r_p_value != NULL);
-
-  for (++r_pos; r_pos < m_num_e; ++r_pos)
-    {
-      const_entry_pointer p_e =& m_a_entries[r_pos];
-
-      if (p_e->m_stat == VALID_ENTRY_STATUS)
-	{
-	  r_p_value = static_cast<const_pointer>(&p_e->m_value);
-
-	  return;
-	}
-    }
-
-  r_p_value = NULL;
-}
-#endif // #ifdef PB_ASSOC_DATA_TRUE_INDICATOR
-
-PB_ASSOC_CLASS_T_DEC
-void
-PB_ASSOC_CLASS_C_DEC::
-inc_it_state(const_pointer& r_p_value, size_type& r_pos) const
-{
-  PB_ASSOC_DBG_ASSERT(r_p_value != NULL);
-
-  for (++r_pos; r_pos < m_num_e; ++r_pos)
-    {
-      const_entry_pointer p_e =& m_a_entries[r_pos];
-
-      if (p_e->m_stat == VALID_ENTRY_STATUS)
-	{
-	  r_p_value = static_cast<const_pointer>(&p_e->m_value);
-
-	  return;
-	}
-    }
-
-  r_p_value = NULL;
-}
-
-PB_ASSOC_CLASS_T_DEC
-void
-PB_ASSOC_CLASS_C_DEC::
-get_start_it_state(const_pointer& r_p_value, size_type& r_pos) const
-{
-  for (r_pos = 0; r_pos < m_num_e; ++r_pos)
-    {
-      const_entry_pointer p_e =& m_a_entries[r_pos];
-
-      if (p_e->m_stat == VALID_ENTRY_STATUS)
-	{
-	  r_p_value =& p_e->m_value;
-
-	  return;
-	}
-    }
-
-  r_p_value = NULL;
-}
-
-PB_ASSOC_CLASS_T_DEC
-void
-PB_ASSOC_CLASS_C_DEC::
-get_start_it_state(pointer& r_p_value, size_type& r_pos)
-{
-  for (r_pos = 0; r_pos < m_num_e; ++r_pos)
-    {
-      entry_pointer p_e =& m_a_entries[r_pos];
-
-      if (p_e->m_stat == VALID_ENTRY_STATUS)
-	{
-	  r_p_value = const_cast<pointer>(&p_e->m_value);
-
-	  return;
-	}
-    }
-
-  r_p_value = NULL;
-}
-
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/gp_ht_map_/policy_access_fn_imps.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/gp_ht_map_/policy_access_fn_imps.hpp
deleted file mode 100644
index 783f6ea63b2..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/gp_ht_map_/policy_access_fn_imps.hpp
+++ /dev/null
@@ -1,124 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file policy_access_fn_imps.hpp
- * Contains implementations of gp_ht_map_'s policy agpess
- *	functions.
- */
-
-PB_ASSOC_CLASS_T_DEC
-Hash_Fn& 
-PB_ASSOC_CLASS_C_DEC::
-get_hash_fn()
-{
-  return (*this);
-}
-
-PB_ASSOC_CLASS_T_DEC
-const Hash_Fn& 
-PB_ASSOC_CLASS_C_DEC::
-get_hash_fn() const
-{
-  return (*this);
-}
-
-PB_ASSOC_CLASS_T_DEC
-Eq_Fn& 
-PB_ASSOC_CLASS_C_DEC::
-get_eq_fn()
-{
-  return (*this);
-}
-
-PB_ASSOC_CLASS_T_DEC
-const Eq_Fn& 
-PB_ASSOC_CLASS_C_DEC::
-get_eq_fn() const
-{
-  return (*this);
-}
-
-PB_ASSOC_CLASS_T_DEC
-Probe_Fn& 
-PB_ASSOC_CLASS_C_DEC::
-get_probe_fn()
-{
-  return (*this);
-}
-
-PB_ASSOC_CLASS_T_DEC
-const Probe_Fn& 
-PB_ASSOC_CLASS_C_DEC::
-get_probe_fn() const
-{
-  return (*this);
-}
-
-PB_ASSOC_CLASS_T_DEC
-Comb_Probe_Fn& 
-PB_ASSOC_CLASS_C_DEC::
-get_comb_probe_fn()
-{
-  return (*this);
-}
-
-PB_ASSOC_CLASS_T_DEC
-const Comb_Probe_Fn& 
-PB_ASSOC_CLASS_C_DEC::
-get_comb_probe_fn() const
-{
-  return (*this);
-}
-
-PB_ASSOC_CLASS_T_DEC
-Resize_Policy& 
-PB_ASSOC_CLASS_C_DEC::
-get_resize_policy()
-{
-  return (*this);
-}
-
-PB_ASSOC_CLASS_T_DEC
-const Resize_Policy& 
-PB_ASSOC_CLASS_C_DEC::
-get_resize_policy() const
-{
-  return (*this);
-}
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/gp_ht_map_/resize_fn_imps.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/gp_ht_map_/resize_fn_imps.hpp
deleted file mode 100644
index c3e8981faa9..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/gp_ht_map_/resize_fn_imps.hpp
+++ /dev/null
@@ -1,158 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file resize_fn_imps.hpp
- * Contains implementations of gp_ht_map_'s resize related functions.
- */
-
-PB_ASSOC_CLASS_T_DEC
-inline bool
-PB_ASSOC_CLASS_C_DEC::
-do_resize_if_needed()
-{
-  if (!my_resize_base::is_resize_needed())
-    return (false);
-
-  do
-    do_resize(my_resize_base::get_new_size(m_num_e, m_num_used_e));
-  while (my_resize_base::is_resize_needed());
-
-  return (true);
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline void
-PB_ASSOC_CLASS_C_DEC::
-do_resize_if_needed_no_throw()
-{
-  if (!my_resize_base::is_resize_needed())
-    return;
-
-  try
-    {
-      do
-	do_resize(my_resize_base::get_new_size(m_num_e, m_num_used_e));
-      while (my_resize_base::is_resize_needed());
-    }
-  catch(...)
-    { }
-
-  PB_ASSOC_DBG_ONLY(assert_valid();)
-    }
-
-PB_ASSOC_CLASS_T_DEC
-void
-PB_ASSOC_CLASS_C_DEC::
-do_resize(size_type new_size)
-{
-#ifdef PB_ASSOC_BASIC_REGRESSION
-  throw_prob_adjustor adjust(m_num_e);
-#endif // #ifdef PB_ASSOC_BASIC_REGRESSION
-
-  PB_ASSOC_DBG_ONLY(assert_valid();)
-
-    const size_type old_size = m_num_e;
-
-  entry_array a_entries_resized = NULL;
-
-  my_ranged_probe_fn_base::notify_resized(new_size);
-
-  // Following line might throw an exception.
-
-  try
-    {
-      a_entries_resized = s_entry_allocator.allocate(new_size);
-    }
-  catch(...)
-    {
-      my_ranged_probe_fn_base::notify_resized(old_size);
-
-      throw;
-    }
-
-  m_num_e = new_size;
-
-  for (size_type i = 0; i < m_num_e; ++i)
-    a_entries_resized[i].m_stat = (entry_status)EMPTY_ENTRY_STATUS;
-
-  try
-    {
-      resize_imp(a_entries_resized, old_size);
-    }
-  catch(...)
-    {
-      erase_all_valid_entries(a_entries_resized, new_size);
-
-      m_num_e = old_size;
-
-      s_entry_allocator.deallocate(a_entries_resized, new_size);
-
-      my_ranged_probe_fn_base::notify_resized(old_size);
-
-      throw;
-    }
-
-  // At this point no exceptions can be thrown.
-
-  PB_ASSOC_DBG_ONLY(assert_entry_array_valid(a_entries_resized, my_hash_traits_base::s_store_hash_indicator);)
-
-    Resize_Policy::notify_resized(new_size);
-
-  erase_all_valid_entries(m_a_entries, old_size);
-
-  s_entry_allocator.deallocate(m_a_entries, old_size);
-
-  m_a_entries = a_entries_resized;
-
-  PB_ASSOC_DBG_ONLY(assert_valid();)
-    }
-
-PB_ASSOC_CLASS_T_DEC
-void
-PB_ASSOC_CLASS_C_DEC::
-resize_imp(entry_array a_entries_resized, size_type old_size)
-{
-  for (size_type pos = 0; pos < old_size; ++pos)
-    if (m_a_entries[pos].m_stat == VALID_ENTRY_STATUS)
-      resize_imp_reassign(m_a_entries + pos, a_entries_resized, my_hash_traits_base::s_store_hash_indicator);
-}
-
-#include <ext/pb_assoc/detail/gp_ht_map_/resize_no_store_hash_fn_imps.hpp>
-#include <ext/pb_assoc/detail/gp_ht_map_/resize_store_hash_fn_imps.hpp>
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/gp_ht_map_/resize_no_store_hash_fn_imps.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/gp_ht_map_/resize_no_store_hash_fn_imps.hpp
deleted file mode 100644
index 019673f7df7..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/gp_ht_map_/resize_no_store_hash_fn_imps.hpp
+++ /dev/null
@@ -1,84 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file resize_no_store_hash_fn_imps.hpp
- * Contains implementations of gp_ht_map_'s resize related functions, when the
- *	hash value is not stored.
- */
-
-PB_ASSOC_CLASS_T_DEC
-inline void
-PB_ASSOC_CLASS_C_DEC::
-resize_imp_reassign(entry_pointer p_e, entry_array a_entries_resized, int_to_type<false>)
-{
-  const_key_reference r_key = PB_ASSOC_V2F(p_e->m_value);
-
-  size_type hash = my_ranged_probe_fn_base::operator()(r_key);
-
-  size_type i;
-
-  for (i = 0; i < m_num_e; ++i)
-    {
-      const size_type pos =
-	my_ranged_probe_fn_base::operator()(r_key, hash, i);
-
-      entry* const p_new_e = a_entries_resized + pos;
-
-      switch(p_new_e->m_stat)
-	{
-	case EMPTY_ENTRY_STATUS:
-	  new (&p_new_e->m_value) value_type(p_e->m_value);
-
-	  p_new_e->m_stat = VALID_ENTRY_STATUS;
-
-	  return;
-	case ERASED_ENTRY_STATUS:
-	  PB_ASSOC_DBG_ASSERT(0);
-	  break;
-	case VALID_ENTRY_STATUS:
-	  break;
-	default:
-	  PB_ASSOC_DBG_ASSERT(0);
-	};
-    }
-
-  throw cannot_insert();
-}
-
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/gp_ht_map_/resize_store_hash_fn_imps.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/gp_ht_map_/resize_store_hash_fn_imps.hpp
deleted file mode 100644
index 002512f7b9b..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/gp_ht_map_/resize_store_hash_fn_imps.hpp
+++ /dev/null
@@ -1,93 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file resize_store_hash_fn_imps.hpp
- * Contains implementations of gp_ht_map_'s resize related functions, when the
- *	hash value is stored.
- */
-
-PB_ASSOC_CLASS_T_DEC
-inline void
-PB_ASSOC_CLASS_C_DEC::
-resize_imp_reassign(entry_pointer p_e, entry_array a_entries_resized, int_to_type<true>)
-{
-  const_key_reference r_key = PB_ASSOC_V2F(p_e->m_value);
-
-  size_type hash =
-    my_ranged_probe_fn_base::operator()(r_key, p_e->m_hash);
-
-  size_type i;
-
-  for (i = 0; i < m_num_e; ++i)
-    {
-      const size_type pos =
-	my_ranged_probe_fn_base::operator()(r_key, hash, i);
-
-      entry* const p_new_e = a_entries_resized + pos;
-
-      switch(p_new_e->m_stat)
-	{
-	case EMPTY_ENTRY_STATUS:
-#ifdef PB_ASSOC_DATA_TRUE_INDICATOR
-	  new (&p_new_e->m_value) mapped_value_type(p_e->m_value);
-#endif // #ifdef PB_ASSOC_DATA_TRUE_INDICATOR
-
-#ifdef PB_ASSOC_DATA_FALSE_INDICATOR
-	  new (&p_new_e->m_value) Key(p_e->m_value);
-#endif // #ifdef PB_ASSOC_DATA_FALSE_INDICATO
-
-	  p_new_e->m_hash = hash;
-
-	  p_new_e->m_stat = VALID_ENTRY_STATUS;
-
-	  return;
-	case ERASED_ENTRY_STATUS:
-	  PB_ASSOC_DBG_ASSERT(0);
-	  break;
-	case VALID_ENTRY_STATUS:
-	  break;
-	default:
-	  PB_ASSOC_DBG_ASSERT(0);
-	};
-    }
-
-  throw cannot_insert();
-}
-
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/hash_fn/direct_mask_range_hashing_imp.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/hash_fn/direct_mask_range_hashing_imp.hpp
deleted file mode 100644
index 570211389d6..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/hash_fn/direct_mask_range_hashing_imp.hpp
+++ /dev/null
@@ -1,67 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/*
- * @file direct_mask_range_hashing_imp.hpp
- * Contains an implementation of direct_mask_range_hashing.
- */
-
-PB_ASSOC_CLASS_T_DEC
-void
-PB_ASSOC_CLASS_C_DEC::
-swap(PB_ASSOC_CLASS_C_DEC& r_other)
-{
-  my_mask_based_base::swap(r_other);
-}
-
-PB_ASSOC_CLASS_T_DEC
-void
-PB_ASSOC_CLASS_C_DEC::
-notify_resized(size_type size)
-{
-  my_mask_based_base::notify_resized(size);
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::size_type
-PB_ASSOC_CLASS_C_DEC::
-operator()(size_type hash) const
-{
-  return (my_mask_based_base::range_hash(hash));
-}
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/hash_fn/direct_mod_range_hashing_imp.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/hash_fn/direct_mod_range_hashing_imp.hpp
deleted file mode 100644
index 80ba9c215c2..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/hash_fn/direct_mod_range_hashing_imp.hpp
+++ /dev/null
@@ -1,67 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/*
- * @file direct_mod_range_hashing_imp.hpp
- * Contains an implementation of direct_mod_range_hashing.
- */
-
-PB_ASSOC_CLASS_T_DEC
-void
-PB_ASSOC_CLASS_C_DEC::
-swap(PB_ASSOC_CLASS_C_DEC& r_other)
-{
-  my_mod_based_base::swap(r_other);
-}
-
-PB_ASSOC_CLASS_T_DEC
-void
-PB_ASSOC_CLASS_C_DEC::
-notify_resized(size_type size)
-{
-  my_mod_based_base::notify_resized(size);
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::size_type
-PB_ASSOC_CLASS_C_DEC::
-operator()(size_type hash) const
-{
-  return (my_mod_based_base::range_hash(hash));
-}
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/hash_fn/linear_probe_fn_imp.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/hash_fn/linear_probe_fn_imp.hpp
deleted file mode 100644
index e0042da8a0f..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/hash_fn/linear_probe_fn_imp.hpp
+++ /dev/null
@@ -1,58 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/*
- * @file linear_probe_fn_imp.hpp
- * Contains an implementation of linear_probe_fn
- */
-
-PB_ASSOC_CLASS_T_DEC
-inline void
-PB_ASSOC_CLASS_C_DEC::
-swap(PB_ASSOC_CLASS_C_DEC& r_other)
-{ }
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::size_type
-PB_ASSOC_CLASS_C_DEC::
-operator()(Const_Key_Ref /*r_key*/, size_type i) const
-{
-  return (i);
-}
-
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/hash_fn/mask_based_range_hashing.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/hash_fn/mask_based_range_hashing.hpp
deleted file mode 100644
index 5cf6c99607d..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/hash_fn/mask_based_range_hashing.hpp
+++ /dev/null
@@ -1,141 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file mask_based_range_hashing.hpp
- * Contains a range hashing policy base.
- */
-
-#ifndef MASK_BASED_RANGE_HASHING_HPP
-#define MASK_BASED_RANGE_HASHING_HPP
-
-namespace pb_assoc
-{
-
-  namespace detail
-  {
-
-#define PB_ASSOC_CLASS_T_DEC \
-	template<typename Size_Type>
-
-#define PB_ASSOC_CLASS_C_DEC \
-	mask_based_range_hashing< \
-		Size_Type>
-
-    template<typename Size_Type>
-    class mask_based_range_hashing
-    {
-    protected:
-      typedef Size_Type size_type;
-
-    protected:
-      void
-      swap(PB_ASSOC_CLASS_C_DEC& r_other);
-
-      void
-      notify_resized(size_type size);
-
-      inline size_type
-      range_hash(size_type hash) const;
-
-    private:
-      size_type m_mask;
-
-      const static size_type s_num_bits_in_size_type;
-
-      const static size_type s_highest_bit_1;
-    };
-
-    PB_ASSOC_CLASS_T_DEC
-    const typename PB_ASSOC_CLASS_C_DEC::size_type
-    PB_ASSOC_CLASS_C_DEC::s_num_bits_in_size_type =
-    sizeof(typename PB_ASSOC_CLASS_C_DEC::size_type) << 3;
-
-    PB_ASSOC_CLASS_T_DEC
-    const typename PB_ASSOC_CLASS_C_DEC::size_type
-    PB_ASSOC_CLASS_C_DEC::s_highest_bit_1 =
-    (typename PB_ASSOC_CLASS_C_DEC::size_type) 1
-      << (s_num_bits_in_size_type - 1);
-
-    PB_ASSOC_CLASS_T_DEC
-    void
-    PB_ASSOC_CLASS_C_DEC::
-    swap(PB_ASSOC_CLASS_C_DEC& r_other)
-    {
-      std::swap(m_mask, r_other.m_mask);
-    }
-
-    PB_ASSOC_CLASS_T_DEC
-    void
-    PB_ASSOC_CLASS_C_DEC::
-    notify_resized(size_type size)
-    {
-      size_type i = 0;
-
-      while (size ^ s_highest_bit_1)
-	{
-	  size <<= 1;
-
-	  ++i;
-	}
-
-      m_mask = 1;
-
-      i += 2;
-
-      while (i++ < s_num_bits_in_size_type)
-	m_mask = (m_mask << 1) ^ 1;
-    }
-
-    PB_ASSOC_CLASS_T_DEC
-    inline typename PB_ASSOC_CLASS_C_DEC::size_type
-    PB_ASSOC_CLASS_C_DEC::
-    range_hash(size_type hash) const
-    {
-      return (hash&  m_mask);
-    }
-
-#undef PB_ASSOC_CLASS_T_DEC
-#undef PB_ASSOC_CLASS_C_DEC
-
-  } // namespace detail
-
-} // namespace pb_assoc
-
-#endif // #ifndef MASK_BASED_RANGE_HASHING_HPP
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/hash_fn/mod_based_range_hashing.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/hash_fn/mod_based_range_hashing.hpp
deleted file mode 100644
index 55dceba0619..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/hash_fn/mod_based_range_hashing.hpp
+++ /dev/null
@@ -1,112 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file mod_based_range_hashing.hpp
- * Contains a range hashing policy base.
- */
-
-#ifndef MOD_BASED_RANGE_HASHING_HPP
-#define MOD_BASED_RANGE_HASHING_HPP
-
-namespace pb_assoc
-{
-
-  namespace detail
-  {
-
-#define PB_ASSOC_CLASS_T_DEC \
-	template<typename Size_Type>
-
-#define PB_ASSOC_CLASS_C_DEC \
-	mod_based_range_hashing< \
-		Size_Type>
-
-    template<typename Size_Type>
-    class mod_based_range_hashing
-    {
-    protected:
-      typedef Size_Type size_type;
-
-    protected:
-      void
-      swap(PB_ASSOC_CLASS_C_DEC& r_other);
-
-      void
-      notify_resized(size_type size);
-
-      inline size_type
-      range_hash(size_type hash) const;
-
-    private:
-      size_type m_size;
-    };
-
-    PB_ASSOC_CLASS_T_DEC
-    void
-    PB_ASSOC_CLASS_C_DEC::
-    swap(PB_ASSOC_CLASS_C_DEC& r_other)
-    {
-      std::swap(m_size, r_other.m_size);
-    }
-
-    PB_ASSOC_CLASS_T_DEC
-    void
-    PB_ASSOC_CLASS_C_DEC::
-    notify_resized(size_type size)
-    {
-      m_size = size;
-    }
-
-    PB_ASSOC_CLASS_T_DEC
-    inline typename PB_ASSOC_CLASS_C_DEC::size_type
-    PB_ASSOC_CLASS_C_DEC::
-    range_hash(size_type hash) const
-    {
-      return (hash % m_size);
-    }
-
-#undef PB_ASSOC_CLASS_T_DEC
-#undef PB_ASSOC_CLASS_C_DEC
-
-  } // namespace detail
-
-} // namespace pb_assoc
-
-#endif // #ifndef MOD_BASED_RANGE_HASHING_HPP
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/hash_fn/probe_fn_base.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/hash_fn/probe_fn_base.hpp
deleted file mode 100644
index 9eded811246..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/hash_fn/probe_fn_base.hpp
+++ /dev/null
@@ -1,96 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file probe_fn_base.hpp
- * Contains a probe policy base.
- */
-
-#ifndef PROBE_FN_BASE_HPP
-#define PROBE_FN_BASE_HPP
-
-#include <functional>
-
-namespace pb_assoc
-{
-
-  namespace detail
-  {
-
-#ifdef PROBE_FN_BASE_DEBUG
-#define PB_ASSOC_DBG_ASSERT(X) assert(X)
-#define PB_ASSOC_DBG_VERIFY(X) assert(X)
-#define PB_ASSOC_DBG_ONLY(X) X
-#else // #ifdef PROBE_FN_BASE_DEBUG
-#define PB_ASSOC_DBG_ASSERT(X)
-#define PB_ASSOC_DBG_VERIFY(X) {if((X)==0);}
-#define PB_ASSOC_DBG_ONLY(X) ;
-#endif // #ifdef PROBE_FN_BASE_DEBUG
-
-#define PB_ASSOC_CLASS_T_DEC \
-	template<class Allocator>
-
-#define PB_ASSOC_CLASS_C_DEC \
-	probe_fn_base< \
-		Allocator>
-
-    template<class Allocator>
-    class probe_fn_base
-    {
-    protected:
-      ~probe_fn_base();
-    };
-
-    PB_ASSOC_CLASS_T_DEC
-    PB_ASSOC_CLASS_C_DEC::
-    ~probe_fn_base()
-    { }
-
-#undef PB_ASSOC_CLASS_T_DEC
-#undef PB_ASSOC_CLASS_C_DEC
-
-#undef PB_ASSOC_DBG_ASSERT
-#undef PB_ASSOC_DBG_VERIFY
-#undef PB_ASSOC_DBG_ONLY
-
-  } // namespace detail
-
-} // namespace pb_assoc
-
-#endif // #ifndef PROBE_FN_BASE_HPP
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/hash_fn/quadratic_probe_fn_imp.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/hash_fn/quadratic_probe_fn_imp.hpp
deleted file mode 100644
index fec29254736..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/hash_fn/quadratic_probe_fn_imp.hpp
+++ /dev/null
@@ -1,57 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/*
- * @file quadratic_probe_fn_imp.hpp
- * Contains an implementation of quadratic_probe_fn.
- */
-
-PB_ASSOC_CLASS_T_DEC
-inline void
-PB_ASSOC_CLASS_C_DEC::
-swap(PB_ASSOC_CLASS_C_DEC& r_other)
-{ }
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::size_type
-PB_ASSOC_CLASS_C_DEC::
-operator()(Const_Key_Ref /*r_key*/, size_type i) const
-{
-  return (i*  i);
-}
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/hash_fn/ranged_hash_fn.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/hash_fn/ranged_hash_fn.hpp
deleted file mode 100644
index c260ccabfe8..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/hash_fn/ranged_hash_fn.hpp
+++ /dev/null
@@ -1,459 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file ranged_hash_fn.hpp
- * Contains a unified ranged hash functor, allowing the hash tables to deal with
- *	a single class for ranged hashing.
- */
-
-#ifndef RANGED_HASH_FN_HPP
-#define RANGED_HASH_FN_HPP
-
-#include <utility>
-
-namespace pb_assoc
-{
-
-  namespace detail
-  {
-
-#ifdef PB_ASSOC_RANGED_HASH_FN_DEBUG
-#define PB_ASSOC_DBG_ASSERT(X) assert(X)
-#define PB_ASSOC_DBG_VERIFY(X) assert(X)
-#define PB_ASSOC_DBG_ONLY(X) X
-#else // #ifdef PB_ASSOC_RANGED_HASH_FN_DEBUG
-#define PB_ASSOC_DBG_ASSERT(X)
-#define PB_ASSOC_DBG_VERIFY(X) {if((X)==0);}
-#define PB_ASSOC_DBG_ONLY(X) ;
-#endif // #ifdef PB_ASSOC_RANGED_HASH_FN_DEBUG
-
-    template<typename Key,
-	     class Hash_Fn,
-	     class Allocator,
-	     class Comb_Hash_Fn,
-	     bool Store_Hash>
-    class ranged_hash_fn;
-
-#define PB_ASSOC_CLASS_T_DEC \
-	template< \
-		typename Key, \
-		class Hash_Fn, \
-		class Allocator, \
-		class Comb_Hash_Fn>
-
-#define PB_ASSOC_CLASS_C_DEC \
-	ranged_hash_fn< \
-		Key, \
-		Hash_Fn, \
-		Allocator, \
-		Comb_Hash_Fn, \
-		false>
-
-    /**
-     * Specialization 1- The client supplies a hash function and a ranged
-     *	hash function, and requests that hash values not be stored.
-     **/
-    template<typename Key,
-	     class Hash_Fn,
-	     class Allocator,
-	     class Comb_Hash_Fn>
-    class ranged_hash_fn<Key, Hash_Fn, Allocator, Comb_Hash_Fn, false> : public Hash_Fn,
-									 public Comb_Hash_Fn
-    {
-    protected:
-      typedef typename Allocator::size_type size_type;
-
-      typedef Hash_Fn my_hash_fn_base;
-
-      typedef Comb_Hash_Fn my_comb_hash_fn_base;
-
-      typedef typename Allocator::template rebind<Key>::other key_allocator;
-
-      typedef typename key_allocator::const_reference const_key_reference;
-
-    protected:
-      ranged_hash_fn(size_type size);
-
-      ranged_hash_fn(size_type size, const Hash_Fn& r_hash_fn);
-
-      ranged_hash_fn(size_type size, const Hash_Fn& r_hash_fn, const Comb_Hash_Fn& r_comb_hash_fn);
-
-      void
-      swap(PB_ASSOC_CLASS_C_DEC& r_other);
-
-      void
-      notify_resized(size_type size);
-
-      inline size_type
-      operator()(const_key_reference r_key) const;
-    };
-
-    PB_ASSOC_CLASS_T_DEC
-    PB_ASSOC_CLASS_C_DEC::
-    ranged_hash_fn(size_type size)
-    {
-      Comb_Hash_Fn::notify_resized(size);
-    }
-
-    PB_ASSOC_CLASS_T_DEC
-    PB_ASSOC_CLASS_C_DEC::
-    ranged_hash_fn(size_type size, const Hash_Fn& r_hash_fn) :
-      Hash_Fn(r_hash_fn)
-    {
-      Comb_Hash_Fn::notify_resized(size);
-    }
-
-    PB_ASSOC_CLASS_T_DEC
-    PB_ASSOC_CLASS_C_DEC::
-    ranged_hash_fn(size_type size, const Hash_Fn& r_hash_fn, const Comb_Hash_Fn& r_comb_hash_fn) :
-      Hash_Fn(r_hash_fn),
-      Comb_Hash_Fn(r_comb_hash_fn)
-    {
-      my_comb_hash_fn_base::notify_resized(size);
-    }
-
-    PB_ASSOC_CLASS_T_DEC
-    void
-    PB_ASSOC_CLASS_C_DEC::
-    swap(PB_ASSOC_CLASS_C_DEC& r_other)
-    {
-      my_comb_hash_fn_base::swap(r_other);
-
-      std::swap((Hash_Fn& )(*this), (Hash_Fn& )r_other);
-    }
-
-    PB_ASSOC_CLASS_T_DEC
-    void
-    PB_ASSOC_CLASS_C_DEC::
-    notify_resized(size_type size)
-    {
-      my_comb_hash_fn_base::notify_resized(size);
-    }
-
-    PB_ASSOC_CLASS_T_DEC
-    inline typename PB_ASSOC_CLASS_C_DEC::size_type
-    PB_ASSOC_CLASS_C_DEC::
-    operator()(const_key_reference r_key) const
-    {
-      return (my_comb_hash_fn_base::operator()(
-					       my_hash_fn_base::operator()(r_key)));
-    }
-
-#undef PB_ASSOC_CLASS_T_DEC
-#undef PB_ASSOC_CLASS_C_DEC
-
-#define PB_ASSOC_CLASS_T_DEC \
-	template< \
-		typename Key, \
-		class Hash_Fn, \
-		class Allocator, \
-		class Comb_Hash_Fn>
-
-#define PB_ASSOC_CLASS_C_DEC \
-	ranged_hash_fn< \
-		Key, \
-		Hash_Fn, \
-		Allocator, \
-		Comb_Hash_Fn, \
-		true>
-
-    /**
-     * Specialization 2- The client supplies a hash function and a ranged
-     *	hash function, and requests that hash values be stored.
-     **/
-    template<typename Key,
-	     class Hash_Fn,
-	     class Allocator,
-	     class Comb_Hash_Fn>
-    class ranged_hash_fn<Key, Hash_Fn, Allocator, Comb_Hash_Fn, true> :
-      public Hash_Fn,
-      public Comb_Hash_Fn
-    {
-    protected:
-      typedef typename Allocator::size_type size_type;
-
-      typedef std::pair<size_type, size_type> comp_hash;
-
-      typedef Hash_Fn my_hash_fn_base;
-
-      typedef Comb_Hash_Fn my_comb_hash_fn_base;
-
-      typedef typename Allocator::template rebind<Key>::other key_allocator;
-
-      typedef typename key_allocator::const_reference const_key_reference;
-
-    protected:
-      ranged_hash_fn(size_type size);
-
-      ranged_hash_fn(size_type size, const Hash_Fn& r_hash_fn);
-
-      ranged_hash_fn(size_type size, const Hash_Fn& r_hash_fn, const Comb_Hash_Fn& r_comb_hash_fn);
-
-      void
-      swap(PB_ASSOC_CLASS_C_DEC& r_other);
-
-      void
-      notify_resized(size_type size);
-
-      inline comp_hash
-      operator()(const_key_reference r_key) const;
-
-      inline comp_hash
-      operator()(const_key_reference r_key, size_type hash) const;
-    };
-
-    PB_ASSOC_CLASS_T_DEC
-    PB_ASSOC_CLASS_C_DEC::
-    ranged_hash_fn(size_type size)
-    {
-      Comb_Hash_Fn::notify_resized(size);
-    }
-
-    PB_ASSOC_CLASS_T_DEC
-    PB_ASSOC_CLASS_C_DEC::
-    ranged_hash_fn(size_type size, const Hash_Fn& r_hash_fn) :
-      Hash_Fn(r_hash_fn)
-    {
-      Comb_Hash_Fn::notify_resized(size);
-    }
-
-    PB_ASSOC_CLASS_T_DEC
-    PB_ASSOC_CLASS_C_DEC::
-    ranged_hash_fn(size_type size, const Hash_Fn& r_hash_fn, const Comb_Hash_Fn& r_comb_hash_fn) :
-      Hash_Fn(r_hash_fn),
-      Comb_Hash_Fn(r_comb_hash_fn)
-    {
-      my_comb_hash_fn_base::notify_resized(size);
-    }
-
-    PB_ASSOC_CLASS_T_DEC
-    void
-    PB_ASSOC_CLASS_C_DEC::
-    swap(PB_ASSOC_CLASS_C_DEC& r_other)
-    {
-      my_comb_hash_fn_base::swap(r_other);
-
-      std::swap((Hash_Fn& )(*this), (Hash_Fn& )r_other);
-    }
-
-    PB_ASSOC_CLASS_T_DEC
-    void
-    PB_ASSOC_CLASS_C_DEC::
-    notify_resized(size_type size)
-    {
-      my_comb_hash_fn_base::notify_resized(size);
-    }
-
-    PB_ASSOC_CLASS_T_DEC
-    inline typename PB_ASSOC_CLASS_C_DEC::comp_hash
-    PB_ASSOC_CLASS_C_DEC::
-    operator()(const_key_reference r_key) const
-    {
-      const size_type hash = my_hash_fn_base::operator()(r_key);
-
-      return (std::make_pair(my_comb_hash_fn_base::operator()(hash), hash));
-    }
-
-    PB_ASSOC_CLASS_T_DEC
-    inline typename PB_ASSOC_CLASS_C_DEC::comp_hash
-    PB_ASSOC_CLASS_C_DEC::
-    operator()
-#ifdef PB_ASSOC_RANGED_HASH_FN_DEBUG
-      (const_key_reference r_key, size_type hash) const
-#else // #ifdef PB_ASSOC_RANGED_HASH_FN_DEBUG
-      (const_key_reference /*r_key*/, size_type hash) const
-#endif // #ifdef PB_ASSOC_RANGED_HASH_FN_DEBUG
-    {
-      PB_ASSOC_DBG_ASSERT(hash == my_hash_fn_base::operator()(r_key));
-
-      return (std::make_pair(my_comb_hash_fn_base::operator()(hash), hash));
-    }
-
-#undef PB_ASSOC_CLASS_T_DEC
-#undef PB_ASSOC_CLASS_C_DEC
-
-#define PB_ASSOC_CLASS_T_DEC \
-	template<typename Key, class Allocator, class Comb_Hash_Fn>
-
-#define PB_ASSOC_CLASS_C_DEC \
-	ranged_hash_fn< \
-		Key, \
-		null_hash_fn, \
-		Allocator, \
-		Comb_Hash_Fn, \
-		false>
-
-    /**
-     * Specialization 3- The client does not supply a hash function
-     *	(by specifying null_hash_fn as the Hash_Fn parameter),
-     *	and requests that hash values not be stored.
-
-    **/
-    template<typename Key, class Allocator, class Comb_Hash_Fn>
-    class ranged_hash_fn<Key, null_hash_fn, Allocator,
-			 Comb_Hash_Fn, false> :
-      public null_hash_fn,
-      public Comb_Hash_Fn
-    {
-    protected:
-
-      typedef typename Allocator::size_type size_type;
-
-      typedef Comb_Hash_Fn my_comb_hash_fn_base;
-
-    protected:
-      ranged_hash_fn(size_type size);
-
-      ranged_hash_fn(size_type size, const Comb_Hash_Fn& r_comb_hash_fn);
-
-      ranged_hash_fn(size_type size, const null_hash_fn&r_null_hash_fn, const Comb_Hash_Fn& r_comb_hash_fn);
-
-      void
-      swap(PB_ASSOC_CLASS_C_DEC& r_other);
-    };
-
-    PB_ASSOC_CLASS_T_DEC
-    PB_ASSOC_CLASS_C_DEC::
-    ranged_hash_fn(size_type size)
-    {
-      Comb_Hash_Fn::notify_resized(size);
-    }
-
-    PB_ASSOC_CLASS_T_DEC
-    PB_ASSOC_CLASS_C_DEC::
-    ranged_hash_fn(size_type size, const Comb_Hash_Fn& r_comb_hash_fn) :
-      Comb_Hash_Fn(r_comb_hash_fn)
-    { }
-
-    PB_ASSOC_CLASS_T_DEC
-    PB_ASSOC_CLASS_C_DEC::
-    ranged_hash_fn(size_type size, const null_hash_fn& r_null_hash_fn, const Comb_Hash_Fn& r_comb_hash_fn) :
-      Comb_Hash_Fn(r_comb_hash_fn)
-    { }
-
-    PB_ASSOC_CLASS_T_DEC
-    void
-    PB_ASSOC_CLASS_C_DEC::
-    swap(PB_ASSOC_CLASS_C_DEC& r_other)
-    {
-      my_comb_hash_fn_base::swap(r_other);
-    }
-
-#undef PB_ASSOC_CLASS_T_DEC
-#undef PB_ASSOC_CLASS_C_DEC
-
-#define PB_ASSOC_CLASS_T_DEC \
-	template<typename Key, class Allocator, class Comb_Hash_Fn>
-
-#define PB_ASSOC_CLASS_C_DEC \
-	ranged_hash_fn< \
-		Key, \
-		null_hash_fn, \
-		Allocator, \
-		Comb_Hash_Fn, \
-		true>
-
-    /**
-     * Specialization 4- The client does not supply a hash function
-     *	(by specifying null_hash_fn as the Hash_Fn parameter),
-     *	and requests that hash values be stored.
-
-    **/
-    template<typename Key, class Allocator, class Comb_Hash_Fn>
-    class ranged_hash_fn<Key, null_hash_fn, Allocator,
-			 Comb_Hash_Fn, true> :
-      public null_hash_fn,
-      public Comb_Hash_Fn
-    {
-    protected:
-      typedef typename Allocator::size_type size_type;
-
-      typedef Comb_Hash_Fn my_comb_hash_fn_base;
-
-    protected:
-      ranged_hash_fn(size_type size);
-
-      ranged_hash_fn(size_type size, const Comb_Hash_Fn& r_comb_hash_fn);
-
-      ranged_hash_fn(size_type size, const null_hash_fn&r_null_hash_fn, const Comb_Hash_Fn& r_comb_hash_fn);
-
-      void
-      swap(PB_ASSOC_CLASS_C_DEC& r_other);
-    };
-
-    PB_ASSOC_CLASS_T_DEC
-    PB_ASSOC_CLASS_C_DEC::
-    ranged_hash_fn(size_type size)
-    {
-      Comb_Hash_Fn::notify_resized(size);
-    }
-
-    PB_ASSOC_CLASS_T_DEC
-    PB_ASSOC_CLASS_C_DEC::
-    ranged_hash_fn(size_type size, const Comb_Hash_Fn& r_comb_hash_fn) :
-      Comb_Hash_Fn(r_comb_hash_fn)
-    { }
-
-    PB_ASSOC_CLASS_T_DEC
-    PB_ASSOC_CLASS_C_DEC::
-    ranged_hash_fn(size_type size, const null_hash_fn&r_null_hash_fn, const Comb_Hash_Fn& r_comb_hash_fn) :
-      Comb_Hash_Fn(r_comb_hash_fn)
-    { }
-
-    PB_ASSOC_CLASS_T_DEC
-    void
-    PB_ASSOC_CLASS_C_DEC::
-    swap(PB_ASSOC_CLASS_C_DEC& r_other)
-    {
-      my_comb_hash_fn_base::swap(r_other);
-    }
-
-#undef PB_ASSOC_CLASS_T_DEC
-#undef PB_ASSOC_CLASS_C_DEC
-
-#undef PB_ASSOC_DBG_ASSERT
-#undef PB_ASSOC_DBG_VERIFY
-#undef PB_ASSOC_DBG_ONLY
-
-  } // namespace detail
-
-} // namespace pb_assoc
-
-#endif // #ifndef RANGED_HASH_FN_HPP
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/hash_fn/ranged_probe_fn.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/hash_fn/ranged_probe_fn.hpp
deleted file mode 100644
index 61643d8d246..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/hash_fn/ranged_probe_fn.hpp
+++ /dev/null
@@ -1,473 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file ranged_probe_fn.hpp
- * Contains a unified ranged probe functor, allowing the probe tables to deal with
- *	a single class for ranged probeing.
- */
-
-#ifndef RANGED_PROBE_FN_HPP
-#define RANGED_PROBE_FN_HPP
-
-#include <ext/pb_assoc/hash_policy.hpp>
-#include <utility>
-
-namespace pb_assoc
-{
-
-  namespace detail
-  {
-
-#ifdef PB_ASSOC_RANGED_PROBE_FN_DEBUG
-#define PB_ASSOC_DBG_ASSERT(X) assert(X)
-#define PB_ASSOC_DBG_VERIFY(X) assert(X)
-#define PB_ASSOC_DBG_ONLY(X) X
-#else // #ifdef PB_ASSOC_RANGED_PROBE_FN_DEBUG
-#define PB_ASSOC_DBG_ASSERT(X)
-#define PB_ASSOC_DBG_VERIFY(X) {if((X)==0);}
-#define PB_ASSOC_DBG_ONLY(X) ;
-#endif // #ifdef PB_ASSOC_RANGED_PROBE_FN_DEBUG
-
-    template<typename Key,
-	     class Hash_Fn,
-	     class Allocator,
-	     class Comb_Probe_Fn,
-	     class Probe_Fn,
-	     bool Store_Hash>
-    class ranged_probe_fn;
-
-#define PB_ASSOC_CLASS_T_DEC \
-	template< \
-		typename Key, \
-		class Hash_Fn, \
-		class Allocator, \
-		class Comb_Probe_Fn, \
-		class Probe_Fn>
-
-#define PB_ASSOC_CLASS_C_DEC \
-	ranged_probe_fn< \
-		Key, \
-		Hash_Fn, \
-		Allocator, \
-		Comb_Probe_Fn, \
-		Probe_Fn, \
-		false>
-
-    /**
-     * Specialization 1- The client supplies a probe function and a ranged
-     *	probe function, and requests that hash values not be stored.
-     **/
-    template<typename Key,
-	     class Hash_Fn,
-	     class Allocator,
-	     class Comb_Probe_Fn,
-	     class Probe_Fn>
-    class ranged_probe_fn<
-      Key,
-      Hash_Fn,
-      Allocator,
-      Comb_Probe_Fn,
-      Probe_Fn,
-      false> : public Hash_Fn,
-	       public Comb_Probe_Fn,
-	       public Probe_Fn
-    {
-    protected:
-      typedef typename Allocator::size_type size_type;
-
-      typedef Comb_Probe_Fn my_comb_probe_fn_base;
-
-      typedef Hash_Fn my_hash_fn_base;
-
-      typedef Probe_Fn my_probe_fn_base;
-
-      typedef typename Allocator::template rebind< Key>::other key_allocator;
-
-      typedef typename key_allocator::const_reference const_key_reference;
-
-    protected:
-      ranged_probe_fn(size_type size);
-
-      ranged_probe_fn(size_type size, const Hash_Fn& r_hash_fn);
-
-      ranged_probe_fn(size_type size, const Hash_Fn& r_hash_fn, const Comb_Probe_Fn& r_comb_probe_fn);
-
-      ranged_probe_fn(size_type size, const Hash_Fn& r_hash_fn, const Comb_Probe_Fn& r_comb_probe_fn, const Probe_Fn& r_probe_fn);
-
-      void
-      swap(PB_ASSOC_CLASS_C_DEC& r_other);
-
-      void
-      notify_resized(size_type size);
-
-      inline size_type
-      operator()(const_key_reference r_key) const;
-
-      inline size_type
-      operator()(const_key_reference r_key, size_type hash, size_type i) const;
-    };
-
-    PB_ASSOC_CLASS_T_DEC
-    PB_ASSOC_CLASS_C_DEC::
-    ranged_probe_fn(size_type size)
-    {
-      Comb_Probe_Fn::notify_resized(size);
-    }
-
-    PB_ASSOC_CLASS_T_DEC
-    PB_ASSOC_CLASS_C_DEC::
-    ranged_probe_fn(size_type size, const Hash_Fn& r_hash_fn) :
-      Hash_Fn(r_hash_fn)
-    {
-      Comb_Probe_Fn::notify_resized(size);
-    }
-
-    PB_ASSOC_CLASS_T_DEC
-    PB_ASSOC_CLASS_C_DEC::
-    ranged_probe_fn(size_type size, const Hash_Fn& r_hash_fn, const Comb_Probe_Fn& r_comb_probe_fn) :
-      Hash_Fn(r_hash_fn),
-      Comb_Probe_Fn(r_comb_probe_fn)
-    {
-      my_comb_probe_fn_base::notify_resized(size);
-    }
-
-    PB_ASSOC_CLASS_T_DEC
-    PB_ASSOC_CLASS_C_DEC::
-    ranged_probe_fn(size_type size, const Hash_Fn& r_hash_fn, const Comb_Probe_Fn& r_comb_probe_fn, const Probe_Fn& r_probe_fn) :
-      Hash_Fn(r_hash_fn),
-      Comb_Probe_Fn(r_comb_probe_fn),
-      Probe_Fn(r_probe_fn)
-    {
-      my_comb_probe_fn_base::notify_resized(size);
-    }
-
-    PB_ASSOC_CLASS_T_DEC
-    void
-    PB_ASSOC_CLASS_C_DEC::
-    swap(PB_ASSOC_CLASS_C_DEC& r_other)
-    {
-      my_comb_probe_fn_base::swap(r_other);
-
-      std::swap((Hash_Fn& )(*this), (Hash_Fn& )r_other);
-    }
-
-    PB_ASSOC_CLASS_T_DEC
-    void
-    PB_ASSOC_CLASS_C_DEC::
-    notify_resized(size_type size)
-    {
-      my_comb_probe_fn_base::notify_resized(size);
-    }
-
-    PB_ASSOC_CLASS_T_DEC
-    inline typename PB_ASSOC_CLASS_C_DEC::size_type
-    PB_ASSOC_CLASS_C_DEC::
-    operator()(const_key_reference r_key) const
-    {
-      return (my_comb_probe_fn_base::operator()(
-						my_hash_fn_base::operator()(r_key)));
-    }
-
-    PB_ASSOC_CLASS_T_DEC
-    inline typename PB_ASSOC_CLASS_C_DEC::size_type
-    PB_ASSOC_CLASS_C_DEC::
-    operator()(const_key_reference r_key, size_type hash, size_type i) const
-    {
-      return (my_comb_probe_fn_base::operator()(
-						hash + my_probe_fn_base::operator()(r_key, i)));
-    }
-
-#undef PB_ASSOC_CLASS_T_DEC
-#undef PB_ASSOC_CLASS_C_DEC
-
-#define PB_ASSOC_CLASS_T_DEC \
-	template< \
-		typename Key, \
-		class Hash_Fn, \
-		class Allocator, \
-		class Comb_Probe_Fn, \
-		class Probe_Fn>
-
-#define PB_ASSOC_CLASS_C_DEC \
-	ranged_probe_fn< \
-		Key, \
-		Hash_Fn, \
-		Allocator, \
-		Comb_Probe_Fn, \
-		Probe_Fn, \
-		true>
-
-    /**
-     * Specialization 2- The client supplies a probe function and a ranged
-     *	probe function, and requests that hash values be stored.
-     **/
-    template<typename Key,
-	     class Hash_Fn,
-	     class Allocator,
-	     class Comb_Probe_Fn,
-	     class Probe_Fn>
-    class ranged_probe_fn<
-      Key,
-      Hash_Fn,
-      Allocator,
-      Comb_Probe_Fn,
-      Probe_Fn,
-      true> :
-      public Hash_Fn,
-      public Comb_Probe_Fn,
-      public Probe_Fn
-    {
-    protected:
-      typedef typename Allocator::size_type size_type;
-
-      typedef std::pair<size_type, size_type> comp_hash;
-
-      typedef Comb_Probe_Fn my_comb_probe_fn_base;
-
-      typedef Hash_Fn my_hash_fn_base;
-
-      typedef Probe_Fn my_probe_fn_base;
-
-      typedef typename Allocator::template rebind<Key>::other key_allocator;
-
-      typedef typename key_allocator::const_reference const_key_reference;
-
-    protected:
-      ranged_probe_fn(size_type size);
-
-      ranged_probe_fn(size_type size, const Hash_Fn& r_hash_fn);
-
-      ranged_probe_fn(size_type size, const Hash_Fn& r_hash_fn, const Comb_Probe_Fn& r_comb_probe_fn);
-
-      ranged_probe_fn(size_type size, const Hash_Fn& r_hash_fn, const Comb_Probe_Fn& r_comb_probe_fn, const Probe_Fn& r_probe_fn);
-
-      void
-      swap(PB_ASSOC_CLASS_C_DEC& r_other);
-
-      void
-      notify_resized(size_type size);
-
-      inline comp_hash
-      operator()(const_key_reference r_key) const;
-
-      inline size_type
-      operator()(const_key_reference r_key, size_type hash, size_type i) const;
-
-      inline size_type
-      operator()(const_key_reference r_key, size_type hash) const;
-    };
-
-    PB_ASSOC_CLASS_T_DEC
-    PB_ASSOC_CLASS_C_DEC::
-    ranged_probe_fn(size_type size)
-    {
-      Comb_Probe_Fn::notify_resized(size);
-    }
-
-    PB_ASSOC_CLASS_T_DEC
-    PB_ASSOC_CLASS_C_DEC::
-    ranged_probe_fn(size_type size, const Hash_Fn& r_hash_fn) :
-      Hash_Fn(r_hash_fn)
-    {
-      Comb_Probe_Fn::notify_resized(size);
-    }
-
-    PB_ASSOC_CLASS_T_DEC
-    PB_ASSOC_CLASS_C_DEC::
-    ranged_probe_fn(size_type size, const Hash_Fn& r_hash_fn, const Comb_Probe_Fn& r_comb_probe_fn) :
-      Hash_Fn(r_hash_fn),
-      Comb_Probe_Fn(r_comb_probe_fn)
-    {
-      my_comb_probe_fn_base::notify_resized(size);
-    }
-
-    PB_ASSOC_CLASS_T_DEC
-    PB_ASSOC_CLASS_C_DEC::
-    ranged_probe_fn(size_type size, const Hash_Fn& r_hash_fn, const Comb_Probe_Fn& r_comb_probe_fn, const Probe_Fn& r_probe_fn) :
-      Hash_Fn(r_hash_fn),
-      Comb_Probe_Fn(r_comb_probe_fn),
-      Probe_Fn(r_probe_fn)
-    {
-      my_comb_probe_fn_base::notify_resized(size);
-    }
-
-    PB_ASSOC_CLASS_T_DEC
-    void
-    PB_ASSOC_CLASS_C_DEC::
-    swap(PB_ASSOC_CLASS_C_DEC& r_other)
-    {
-      my_comb_probe_fn_base::swap(r_other);
-
-      std::swap((Hash_Fn& )(*this), (Hash_Fn& )r_other);
-    }
-
-    PB_ASSOC_CLASS_T_DEC
-    void
-    PB_ASSOC_CLASS_C_DEC::
-    notify_resized(size_type size)
-    {
-      my_comb_probe_fn_base::notify_resized(size);
-    }
-
-    PB_ASSOC_CLASS_T_DEC
-    inline typename PB_ASSOC_CLASS_C_DEC::comp_hash
-    PB_ASSOC_CLASS_C_DEC::
-    operator()(const_key_reference r_key) const
-    {
-      const size_type hash = my_hash_fn_base::operator()(r_key);
-
-      return (std::make_pair(my_comb_probe_fn_base::operator()(hash), hash));
-    }
-
-    PB_ASSOC_CLASS_T_DEC
-    inline typename PB_ASSOC_CLASS_C_DEC::size_type
-    PB_ASSOC_CLASS_C_DEC::
-    operator()(const_key_reference r_key, size_type hash, size_type i) const
-    {
-      return (my_comb_probe_fn_base::operator()(
-						hash + my_probe_fn_base::operator()(r_key, i)));
-    }
-
-    PB_ASSOC_CLASS_T_DEC
-    inline typename PB_ASSOC_CLASS_C_DEC::size_type
-    PB_ASSOC_CLASS_C_DEC::
-    operator()
-#ifdef PB_ASSOC_RANGED_PROBE_FN_DEBUG
-      (const_key_reference r_key, size_type hash) const
-#else // #ifdef PB_ASSOC_RANGED_PROBE_FN_DEBUG
-      (const_key_reference /*r_key*/, size_type hash) const
-#endif // #ifdef PB_ASSOC_RANGED_PROBE_FN_DEBUG
-    {
-      PB_ASSOC_DBG_ASSERT(hash == my_hash_fn_base::operator()(r_key));
-
-      return (hash);
-    }
-
-#undef PB_ASSOC_CLASS_T_DEC
-#undef PB_ASSOC_CLASS_C_DEC
-
-#define PB_ASSOC_CLASS_T_DEC \
-	template<typename Key, class Allocator, class Comb_Probe_Fn>
-
-#define PB_ASSOC_CLASS_C_DEC \
-	ranged_probe_fn< \
-		Key, \
-		null_hash_fn, \
-		Allocator, \
-		Comb_Probe_Fn, \
-		null_probe_fn, \
-		false>
-
-    /**
-     * Specialization 3 and 4- The client does not supply a hash function or
-     *	probe function, and requests that hash values not be stored.
-     **/
-    template<typename Key, class Allocator, class Comb_Probe_Fn>
-    class ranged_probe_fn<
-      Key,
-      null_hash_fn,
-      Allocator,
-      Comb_Probe_Fn,
-      null_probe_fn,
-      false> :
-      public Comb_Probe_Fn,
-      public null_hash_fn,
-      public null_probe_fn
-    {
-    protected:
-      typedef typename Allocator::size_type size_type;
-
-      typedef Comb_Probe_Fn my_comb_probe_fn_base;
-
-      typedef typename Allocator::template rebind<Key>::other key_allocator;
-
-      typedef typename key_allocator::const_reference const_key_reference;
-
-    protected:
-      ranged_probe_fn(size_type size);
-
-      ranged_probe_fn(size_type size, const Comb_Probe_Fn& r_comb_probe_fn);
-
-      ranged_probe_fn(size_type size, const null_hash_fn& r_null_hash_fn, const Comb_Probe_Fn& r_comb_probe_fn, const null_probe_fn& r_null_probe_fn);
-
-      void
-      swap(PB_ASSOC_CLASS_C_DEC& r_other);
-    };
-
-    PB_ASSOC_CLASS_T_DEC
-    PB_ASSOC_CLASS_C_DEC::
-    ranged_probe_fn(size_type size)
-    {
-      Comb_Probe_Fn::notify_resized(size);
-    }
-
-    PB_ASSOC_CLASS_T_DEC
-    PB_ASSOC_CLASS_C_DEC::
-    ranged_probe_fn(size_type size, const Comb_Probe_Fn& r_comb_probe_fn) :
-      Comb_Probe_Fn(r_comb_probe_fn)
-    { }
-
-    PB_ASSOC_CLASS_T_DEC
-    PB_ASSOC_CLASS_C_DEC::
-    ranged_probe_fn(size_type size, const null_hash_fn& r_null_hash_fn, const Comb_Probe_Fn& r_comb_probe_fn, const null_probe_fn& r_null_probe_fn) :
-      Comb_Probe_Fn(r_comb_probe_fn)
-    { }
-
-    PB_ASSOC_CLASS_T_DEC
-    void
-    PB_ASSOC_CLASS_C_DEC::
-    swap(PB_ASSOC_CLASS_C_DEC& r_other)
-    {
-      my_comb_probe_fn_base::swap(r_other);
-    }
-
-#undef PB_ASSOC_CLASS_T_DEC
-#undef PB_ASSOC_CLASS_C_DEC
-
-#undef PB_ASSOC_DBG_ASSERT
-#undef PB_ASSOC_DBG_VERIFY
-#undef PB_ASSOC_DBG_ONLY
-
-  } // namespace detail
-
-} // namespace pb_assoc
-
-#endif // #ifndef RANGED_PROBE_FN_HPP
-
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/hash_types_traits.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/hash_types_traits.hpp
deleted file mode 100644
index 01b723f436a..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/hash_types_traits.hpp
+++ /dev/null
@@ -1,94 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file types_traits.hpp
- * Contains a traits class of types used by containers.
- */
-
-#ifndef HASH_TYPES_TRAITS
-#define HASH_TYPES_TRAITS
-
-#include <ext/pb_assoc/detail/type_utils.hpp>
-
-namespace pb_assoc
-{
-
-  namespace detail
-  {
-
-#define PB_ASSOC_CLASS_T_DEC \
-	template<typename Size_Type, bool Store_Hash>
-
-#define PB_ASSOC_CLASS_C_DEC \
-	hash_types_traits< \
-		Size_Type, \
-		Store_Hash>
-
-    template<typename Size_Type, bool Store_Hash>
-    struct hash_types_traits
-    {
-    public:
-      typedef
-      typename cond_type<
-	Store_Hash,
-	std::pair<Size_Type, Size_Type>,
-	Size_Type>::type
-      comp_hash;
-
-      typedef int_to_type<false> store_hash_false_indicator;
-
-      typedef int_to_type<true> store_hash_true_indicator;
-
-      static pb_assoc::detail::int_to_type<Store_Hash>
-      s_store_hash_indicator;
-    };
-
-    PB_ASSOC_CLASS_T_DEC
-    pb_assoc::detail::int_to_type<Store_Hash>
-    PB_ASSOC_CLASS_C_DEC::s_store_hash_indicator;
-
-#undef PB_ASSOC_CLASS_T_DEC
-#undef PB_ASSOC_CLASS_C_DEC
-
-  } // namespace detail
-
-} // namespace pb_assoc
-
-#endif // #ifndef HASH_TYPES_TRAITS
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/lu_assoc_cntnr/constructor_destructor_fn_imps.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/lu_assoc_cntnr/constructor_destructor_fn_imps.hpp
deleted file mode 100644
index 94ded017788..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/lu_assoc_cntnr/constructor_destructor_fn_imps.hpp
+++ /dev/null
@@ -1,121 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file constructor_destructor_fn_imps.hpp
- * Contains implementations of lu's constructors, destructor,
- *	and related functions.
- */
-
-PB_ASSOC_CLASS_T_DEC
-PB_ASSOC_CLASS_C_DEC::
-lu_assoc_cntnr()
-{ }
-
-PB_ASSOC_CLASS_T_DEC
-PB_ASSOC_CLASS_C_DEC::
-lu_assoc_cntnr(const Eq_Fn& r_eq_fn) :
-  my_base(r_eq_fn)
-{ }
-
-PB_ASSOC_CLASS_T_DEC
-PB_ASSOC_CLASS_C_DEC::
-lu_assoc_cntnr(const Eq_Fn& r_eq_fn, const Update_Policy& r_update_policy) :
-  my_base(r_eq_fn, r_update_policy)
-{ }
-
-PB_ASSOC_CLASS_T_DEC
-template<class It>
-PB_ASSOC_CLASS_C_DEC::
-lu_assoc_cntnr(It first_it, It last_it)
-{
-  my_base::copy_from_range(first_it, last_it);
-}
-
-PB_ASSOC_CLASS_T_DEC
-template<class It>
-PB_ASSOC_CLASS_C_DEC::
-lu_assoc_cntnr(It first_it, It last_it, const Eq_Fn& r_eq_fn) :
-  my_base(r_eq_fn)
-{
-  my_base::copy_from_range(first_it, last_it);
-}
-
-PB_ASSOC_CLASS_T_DEC
-template<class It>
-PB_ASSOC_CLASS_C_DEC::
-lu_assoc_cntnr(It first_it, It last_it, const Eq_Fn& r_eq_fn, const Update_Policy& r_update_policy) :
-  my_base(r_eq_fn, r_update_policy)
-{
-  my_base::copy_from_range(first_it, last_it);
-}
-
-PB_ASSOC_CLASS_T_DEC
-PB_ASSOC_CLASS_C_DEC::
-lu_assoc_cntnr(const PB_ASSOC_CLASS_C_DEC& r_other) :
-  my_base((const my_base& )(r_other))
-{ }
-
-PB_ASSOC_CLASS_T_DEC
-PB_ASSOC_CLASS_C_DEC::
-~lu_assoc_cntnr()
-{ }
-
-PB_ASSOC_CLASS_T_DEC
-PB_ASSOC_CLASS_C_DEC& 
-PB_ASSOC_CLASS_C_DEC::
-operator=(const PB_ASSOC_CLASS_C_DEC& r_other)
-{
-  if (this !=& r_other)
-    {
-      PB_ASSOC_CLASS_C_DEC tmp(r_other);
-
-      swap(tmp);
-    }
-
-  return (*this);
-}
-
-PB_ASSOC_CLASS_T_DEC
-void
-PB_ASSOC_CLASS_C_DEC::
-swap(PB_ASSOC_CLASS_C_DEC& r_other)
-{
-  my_base::swap(r_other);
-}
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/lu_assoc_cntnr/policy_access_fn_imps.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/lu_assoc_cntnr/policy_access_fn_imps.hpp
deleted file mode 100644
index fe9395cc8e2..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/lu_assoc_cntnr/policy_access_fn_imps.hpp
+++ /dev/null
@@ -1,77 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file policy_access_fn_imps.hpp
- * Contains implementations of lu_map_'s policy access
- *	functions.
- */
-
-PB_ASSOC_CLASS_T_DEC
-Eq_Fn& 
-PB_ASSOC_CLASS_C_DEC::
-get_eq_fn()
-{
-  return (my_base::get_eq_fn());
-}
-
-PB_ASSOC_CLASS_T_DEC
-const Eq_Fn& 
-PB_ASSOC_CLASS_C_DEC::
-get_eq_fn() const
-{
-  return (my_base::get_eq_fn());
-}
-
-PB_ASSOC_CLASS_T_DEC
-Update_Policy& 
-PB_ASSOC_CLASS_C_DEC::
-get_update_policy()
-{
-  return (*this);
-}
-
-PB_ASSOC_CLASS_T_DEC
-const Update_Policy& 
-PB_ASSOC_CLASS_C_DEC::
-get_update_policy() const
-{
-  return (*this);
-}
-
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/lu_map_/constructor_destructor_fn_imps.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/lu_map_/constructor_destructor_fn_imps.hpp
deleted file mode 100644
index 4b6738973c3..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/lu_map_/constructor_destructor_fn_imps.hpp
+++ /dev/null
@@ -1,178 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file constructor_destructor_fn_imps.hpp
- * Contains implementations of PB_ASSOC_CLASS_NAME.
- */
-
-PB_ASSOC_CLASS_T_DEC
-typename PB_ASSOC_CLASS_C_DEC::entry_allocator
-PB_ASSOC_CLASS_C_DEC::s_entry_allocator;
-
-PB_ASSOC_CLASS_T_DEC
-template<class It>
-void
-PB_ASSOC_CLASS_C_DEC::
-copy_from_range(It first_it, It last_it)
-{
-  while (first_it != last_it)
-    insert(*(first_it++));
-}
-
-PB_ASSOC_CLASS_T_DEC
-PB_ASSOC_CLASS_C_DEC::
-PB_ASSOC_CLASS_NAME() :
-  m_p_l(s_entry_allocator.allocate(1)),
-  m_size(0)
-{
-  initialize();
-
-  PB_ASSOC_DBG_ONLY(assert_valid();)
-    }
-
-PB_ASSOC_CLASS_T_DEC
-PB_ASSOC_CLASS_C_DEC::
-PB_ASSOC_CLASS_NAME(const Eq_Fn& r_eq_fn) :
-  Eq_Fn(r_eq_fn),
-  m_p_l(s_entry_allocator.allocate(1)),
-  m_size(0)
-{
-  initialize();
-
-  PB_ASSOC_DBG_ONLY(assert_valid();)
-    }
-
-PB_ASSOC_CLASS_T_DEC
-PB_ASSOC_CLASS_C_DEC::
-PB_ASSOC_CLASS_NAME(const Eq_Fn& r_eq_fn, const Update_Policy& r_update_policy) :
-  Eq_Fn(r_eq_fn),
-  Update_Policy(r_update_policy),
-  m_p_l(s_entry_allocator.allocate(1)),
-  m_size(0)
-{
-  initialize();
-
-  PB_ASSOC_DBG_ONLY(assert_valid();)
-    }
-
-PB_ASSOC_CLASS_T_DEC
-PB_ASSOC_CLASS_C_DEC::
-PB_ASSOC_CLASS_NAME(const PB_ASSOC_CLASS_C_DEC& r_other) :
-  Eq_Fn(r_other),
-  Update_Policy(r_other),
-  m_p_l(s_entry_allocator.allocate(1)),
-  m_size(0)
-{
-  initialize();
-
-  try
-    {
-      copy_from_range(r_other.begin(), r_other.end());
-    }
-  catch(...)
-    {
-      deallocate_all(true);
-
-      throw;
-    }
-
-  PB_ASSOC_DBG_ONLY(assert_valid();)
-    }
-
-PB_ASSOC_CLASS_T_DEC
-void
-PB_ASSOC_CLASS_C_DEC::
-swap(PB_ASSOC_CLASS_C_DEC& r_other)
-{
-  PB_ASSOC_DBG_ONLY(assert_valid();)
-    PB_ASSOC_DBG_ONLY(r_other.assert_valid();)
-
-    std::swap(m_p_l, r_other.m_p_l);
-
-  std::swap(m_size, r_other.m_size);
-
-  std::swap((Eq_Fn& )(*this), (Eq_Fn& )r_other);
-
-  Update_Policy::swap(r_other);
-
-  PB_ASSOC_DBG_ONLY(my_map_debug_base::swap(r_other);)
-
-    PB_ASSOC_DBG_ONLY(assert_valid();)
-    PB_ASSOC_DBG_ONLY(r_other.assert_valid();)
-    }
-
-PB_ASSOC_CLASS_T_DEC
-void
-PB_ASSOC_CLASS_C_DEC::
-deallocate_all(bool deallocate_root)
-{
-  entry_pointer p_l = m_p_l->m_p_next;
-
-  while (p_l != NULL)
-    {
-      entry_pointer p_next_l = p_l->m_p_next;
-
-      p_l->~entry();
-
-      s_entry_allocator.deallocate(p_l, 1);
-
-      p_l = p_next_l;
-    }
-
-  if (deallocate_root)
-    s_entry_allocator.deallocate(m_p_l, 1);
-  else
-    m_p_l->m_p_next = NULL;
-}
-
-PB_ASSOC_CLASS_T_DEC
-PB_ASSOC_CLASS_C_DEC::
-~PB_ASSOC_CLASS_NAME()
-{
-  deallocate_all(true);
-}
-
-PB_ASSOC_CLASS_T_DEC
-void
-PB_ASSOC_CLASS_C_DEC::
-initialize()
-{
-  m_p_l->m_p_next = NULL;
-}
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/lu_map_/debug_fn_imps.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/lu_map_/debug_fn_imps.hpp
deleted file mode 100644
index 54982776dc5..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/lu_map_/debug_fn_imps.hpp
+++ /dev/null
@@ -1,66 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file debug_fn_imps.hpp
- * Contains implementations of cc_ht_map_'s debug-mode functions.
- */
-
-#ifdef PB_ASSOC_LU_MAP_DEBUG_
-
-PB_ASSOC_CLASS_T_DEC
-void
-PB_ASSOC_CLASS_C_DEC::
-assert_valid() const
-{
-  size_type calc_size = 0;
-
-  for (const_iterator it = begin(); it != end(); ++it)
-    {
-      my_map_debug_base::check_key_exists(PB_ASSOC_V2F(*it));
-
-      ++calc_size;
-    }
-
-  PB_ASSOC_DBG_ASSERT(calc_size == m_size);
-
-  my_map_debug_base::check_size(m_size);
-}
-
-#endif // #ifdef PB_ASSOC_LU_MAP_DEBUG_
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/lu_map_/erase_fn_imps.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/lu_map_/erase_fn_imps.hpp
deleted file mode 100644
index 7b5f554ff5a..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/lu_map_/erase_fn_imps.hpp
+++ /dev/null
@@ -1,129 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file erase_fn_imps.hpp
- * Contains implementations of lu_map_.
- */
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::size_type
-PB_ASSOC_CLASS_C_DEC::
-erase(const_key_reference r_key)
-{
-  PB_ASSOC_DBG_ONLY(PB_ASSOC_CLASS_C_DEC::assert_valid();)
-
-    entry_pointer p_l = find_imp(r_key);
-
-  if (p_l->m_p_next == NULL)
-    return (0);
-
-  erase_imp(p_l);
-
-  PB_ASSOC_DBG_ONLY(assert_valid();)
-
-    return (1);
-}
-
-PB_ASSOC_CLASS_T_DEC
-void
-PB_ASSOC_CLASS_C_DEC::
-clear()
-{
-  PB_ASSOC_DBG_ONLY(assert_valid();)
-
-    PB_ASSOC_DBG_ONLY(my_map_debug_base::clear();)
-
-    deallocate_all(false);
-
-  m_size = 0;
-
-  PB_ASSOC_DBG_ONLY(assert_valid();)
-    }
-
-PB_ASSOC_CLASS_T_DEC
-template<class Pred>
-inline typename PB_ASSOC_CLASS_C_DEC::size_type
-PB_ASSOC_CLASS_C_DEC::
-erase_if(Pred& r_pred)
-{
-  PB_ASSOC_DBG_ONLY(PB_ASSOC_CLASS_C_DEC::assert_valid();)
-
-    size_type num_ersd = 0;
-
-  entry_pointer p_l = m_p_l;
-
-  while (p_l->m_p_next != NULL)
-    {
-      if (r_pred(p_l->m_p_next->m_value))
-	{
-	  erase_imp(p_l);
-
-	  ++num_ersd;
-	}
-      else
-	p_l = p_l->m_p_next;
-    }
-
-  PB_ASSOC_DBG_ONLY(PB_ASSOC_CLASS_C_DEC::assert_valid();)
-
-    return (num_ersd);
-}
-
-PB_ASSOC_CLASS_T_DEC
-void
-PB_ASSOC_CLASS_C_DEC::
-erase_imp(entry_pointer p_l)
-{
-  PB_ASSOC_DBG_ASSERT(p_l->m_p_next != NULL);
-
-  entry_pointer p_next_l = p_l->m_p_next->m_p_next;
-
-  PB_ASSOC_DBG_ONLY(my_map_debug_base::erase_existing(
-						      PB_ASSOC_V2F(p_l->m_p_next->m_value));)
-
-    p_l->m_p_next->m_value.~mapped_value_type();
-
-  s_entry_allocator.deallocate(p_l->m_p_next, 1);
-
-  p_l->m_p_next = p_next_l;
-
-  PB_ASSOC_DBG_ASSERT(m_size > 0);
-  --m_size;
-}
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/lu_map_/find_fn_imps.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/lu_map_/find_fn_imps.hpp
deleted file mode 100644
index 38ae5f81af7..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/lu_map_/find_fn_imps.hpp
+++ /dev/null
@@ -1,136 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file find_fn_imps.hpp
- * Contains implementations of lu_map_.
- */
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::find_iterator
-PB_ASSOC_CLASS_C_DEC::
-find_end()
-{
-  return (NULL);
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::const_find_iterator
-PB_ASSOC_CLASS_C_DEC::
-find_end() const
-{
-  return (NULL);
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline void
-PB_ASSOC_CLASS_C_DEC::
-move_next_to_front(entry_pointer p_l) const
-{
-  entry_pointer p_move_l = p_l->m_p_next;
-
-  PB_ASSOC_DBG_ASSERT(p_move_l != NULL);
-
-  p_l->m_p_next = p_move_l->m_p_next;
-
-  p_move_l->m_p_next = m_p_l->m_p_next;
-
-  m_p_l->m_p_next = p_move_l;
-}
-
-#ifdef PB_ASSOC_DATA_TRUE_INDICATOR
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::const_data_reference
-PB_ASSOC_CLASS_C_DEC::
-const_subscript_imp(const_key_reference r_key) const
-{
-  entry_pointer p_l = find_imp(r_key);
-
-  PB_ASSOC_DBG_ASSERT(p_l->m_p_next != NULL)
-
-    if (Update_Policy::operator()(p_l->m_update_metadata))
-      {
-	move_next_to_front(p_l);
-
-	return (m_p_l->m_p_next->m_value.second);
-      }
-    else
-      return (p_l->m_p_next->m_value.second);
-}
-#endif // #ifdef PB_ASSOC_DATA_TRUE_INDICATOR
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::find_iterator
-PB_ASSOC_CLASS_C_DEC::find(const_key_reference r_key)
-{
-  PB_ASSOC_DBG_ONLY(assert_valid();)
-
-    entry_pointer p_l = find_imp(r_key);
-
-  if (p_l->m_p_next != NULL)
-    {
-      PB_ASSOC_DBG_ONLY(assert_valid();)
-
-	return (&p_l->m_p_next->m_value);
-    }
-
-  PB_ASSOC_DBG_ONLY(assert_valid();)
-
-    return (find_end());
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::const_find_iterator
-PB_ASSOC_CLASS_C_DEC::find(const_key_reference r_key) const
-{
-  PB_ASSOC_DBG_ONLY(assert_valid();)
-
-    entry_pointer p_l = find_imp(r_key);
-
-  if (p_l->m_p_next != NULL)
-    {
-      PB_ASSOC_DBG_ONLY(assert_valid();)
-
-	return (&m_p_l->m_p_next->m_value);
-    }
-
-  PB_ASSOC_DBG_ONLY(assert_valid();)
-
-    return (find_end());
-}
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/lu_map_/info_fn_imps.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/lu_map_/info_fn_imps.hpp
deleted file mode 100644
index 663ffe7c174..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/lu_map_/info_fn_imps.hpp
+++ /dev/null
@@ -1,67 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file info_fn_imps.hpp
- * Contains implementations of lu_map_.
- */
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::size_type
-PB_ASSOC_CLASS_C_DEC::
-size() const
-{
-  return (m_size);
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::size_type
-PB_ASSOC_CLASS_C_DEC::
-max_size() const
-{
-  return (s_entry_allocator.max_size());
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline bool
-PB_ASSOC_CLASS_C_DEC::
-empty() const
-{
-  return (m_size == 0);
-}
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/lu_map_/insert_fn_imps.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/lu_map_/insert_fn_imps.hpp
deleted file mode 100644
index df600435d00..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/lu_map_/insert_fn_imps.hpp
+++ /dev/null
@@ -1,148 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file insert_fn_imps.hpp
- * Contains implementations of lu_map_.
- */
-
-PB_ASSOC_CLASS_T_DEC
-inline std::pair<
-  typename PB_ASSOC_CLASS_C_DEC::find_iterator,
-  bool>
-PB_ASSOC_CLASS_C_DEC::
-insert(const_reference r_val)
-{
-  PB_ASSOC_DBG_ONLY(assert_valid();)
-
-    entry_pointer p_l = find_imp(PB_ASSOC_V2F(r_val));
-
-  bool found = true;
-
-  if (p_l->m_p_next == NULL)
-    {
-      found = false;
-
-      insert_new_after(p_l, r_val);
-    }
-
-  PB_ASSOC_DBG_ASSERT(Eq_Fn::operator()(
-					PB_ASSOC_V2F(p_l->m_p_next->m_value),
-					PB_ASSOC_V2F(r_val)));
-
-  PB_ASSOC_DBG_ONLY(assert_valid();)
-
-    if (Update_Policy::operator()(p_l->m_update_metadata))
-      {
-	move_next_to_front(p_l);
-
-	return (std::make_pair(
-			       find_iterator(&m_p_l->m_p_next->m_value),
-			       !found));
-      }
-    else
-      return (std::make_pair(
-			     find_iterator(&p_l->m_p_next->m_value),
-			     !found));
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline void
-PB_ASSOC_CLASS_C_DEC::
-insert_new_after(entry_pointer p_l, const_reference r_val)
-{
-  PB_ASSOC_DBG_ONLY(my_map_debug_base::check_key_does_not_exist(
-								PB_ASSOC_V2F(r_val));)
-
-    entry_pointer p_new_l = s_entry_allocator.allocate(1);
-
-  cond_dealtor_t cond(p_new_l);
-
-  new (const_cast<void* >(
-			  static_cast<const void* >(&p_new_l->m_value)))
-    value_type(r_val);
-
-  cond.set_no_action();
-
-  PB_ASSOC_DBG_ASSERT(p_l->m_p_next == NULL);
-  p_l->m_p_next = p_new_l;
-
-  p_new_l->m_p_next = NULL;
-
-  ++m_size;
-
-  PB_ASSOC_DBG_ONLY(my_map_debug_base::insert_new(PB_ASSOC_V2F(r_val));)
-    }
-
-#ifdef PB_ASSOC_DATA_TRUE_INDICATOR
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::data_reference
-PB_ASSOC_CLASS_C_DEC::
-subscript_imp(const_key_reference r_key)
-{
-  PB_ASSOC_DBG_ONLY(assert_valid();)
-
-    entry_pointer p_l = find_imp(r_key);
-
-  bool found = true;
-
-  if (p_l->m_p_next == NULL)
-    {
-      found = false;
-
-      insert_new_after(p_l, value_type(r_key, data_type()));
-    }
-
-  PB_ASSOC_DBG_ASSERT(Eq_Fn::operator()(
-					PB_ASSOC_V2F(p_l->m_p_next->m_value),
-					PB_ASSOC_V2F(r_val)));
-
-  PB_ASSOC_DBG_ONLY(assert_valid();)
-
-    if (Update_Policy::operator()(p_l->m_update_metadata))
-      {
-	move_next_to_front(p_l);
-
-	return (m_p_l->m_p_next->m_value.second);
-      }
-    else
-      return (p_l->m_p_next->m_value.second);
-}
-#endif // #ifdef PB_ASSOC_DATA_TRUE_INDICATOR
-
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/lu_map_/iterators_fn_imps.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/lu_map_/iterators_fn_imps.hpp
deleted file mode 100644
index 6ad96a8f45c..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/lu_map_/iterators_fn_imps.hpp
+++ /dev/null
@@ -1,106 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file iterators_fn_imps.hpp
- * Contains implementations of lu_map_.
- */
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::iterator
-PB_ASSOC_CLASS_C_DEC::
-begin()
-{
-  if (m_size == 0)
-    {
-      PB_ASSOC_DBG_ASSERT(m_p_l->m_p_next == NULL);
-
-      return (end());
-    }
-
-  PB_ASSOC_DBG_ASSERT(m_p_l->m_p_next != NULL);
-
-  return (iterator(&m_p_l->m_p_next->m_value, m_p_l->m_p_next, this));
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::const_iterator
-PB_ASSOC_CLASS_C_DEC::
-begin()  const
-{
-  if (m_size == 0)
-    {
-      PB_ASSOC_DBG_ASSERT(m_p_l->m_p_next == NULL);
-
-      return (end());
-    }
-
-  PB_ASSOC_DBG_ASSERT(m_p_l->m_p_next != NULL);
-
-  return (iterator(&m_p_l->m_p_next->m_value, m_p_l->m_p_next,
-		   const_cast<PB_ASSOC_CLASS_C_DEC* >(this)));
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::iterator
-PB_ASSOC_CLASS_C_DEC::
-end()
-{
-  return (iterator(NULL, NULL, this));
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::const_iterator
-PB_ASSOC_CLASS_C_DEC::
-end() const
-{
-  return (const_iterator(NULL, NULL,
-			 const_cast<PB_ASSOC_CLASS_C_DEC* const>(this)));
-}
-
-PB_ASSOC_CLASS_T_DEC
-void
-PB_ASSOC_CLASS_C_DEC::
-inc_it_state(const_mapped_pointer& r_p_value, entry_pointer& r_pos) const
-{
-  r_pos = r_pos->m_p_next;
-
-  r_p_value = (r_pos == NULL)? NULL :& r_pos->m_value;
-}
-
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/lu_map_/lu_map_.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/lu_map_/lu_map_.hpp
deleted file mode 100644
index b91f95fc6d3..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/lu_map_/lu_map_.hpp
+++ /dev/null
@@ -1,464 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file lu_map_.hpp
- * Contains a list update map.
- */
-
-#include <utility>
-#include <iterator>
-#include <ext/pb_assoc/detail/cond_dealtor.hpp>
-#include <ext/pb_assoc/trivial_iterator_def.hpp>
-#include <ext/pb_assoc/detail/types_traits.hpp>
-#include <ext/pb_assoc/exception.hpp>
-#include <ext/pb_assoc/detail/map_debug_base.hpp>
-
-namespace pb_assoc
-{
-
-  namespace detail
-  {
-
-#ifdef PB_ASSOC_LU_MAP_DEBUG_
-#define PB_ASSOC_DBG_ASSERT(X) assert(X)
-#define PB_ASSOC_DBG_VERIFY(X) assert(X)
-#define PB_ASSOC_DBG_ONLY(X) X
-#else // #ifdef PB_ASSOC_LU_MAP_DEBUG_
-#define PB_ASSOC_DBG_ASSERT(X)
-#define PB_ASSOC_DBG_VERIFY(X) {if((X)==0);}
-#define PB_ASSOC_DBG_ONLY(X) ;
-#endif // #ifdef PB_ASSOC_LU_MAP_DEBUG_
-
-#define PB_ASSOC_CLASS_T_DEC \
-	template< \
-		typename Key, \
-		typename Data, \
-		class Eq_Fn, \
-		class Allocator, \
-		class Update_Policy>
-
-#ifdef PB_ASSOC_DATA_TRUE_INDICATOR
-#define PB_ASSOC_CLASS_NAME \
-	lu_map_data_
-#endif // #ifdef PB_ASSOC_DATA_TRUE_INDICATOR
-
-#ifdef PB_ASSOC_DATA_FALSE_INDICATOR
-#define PB_ASSOC_CLASS_NAME \
-	lu_map_no_data_
-#endif // #ifdef PB_ASSOC_DATA_FALSE_INDICATOR
-
-#define PB_ASSOC_CLASS_C_DEC \
-	PB_ASSOC_CLASS_NAME< \
-		Key, \
-		Data, \
-		Eq_Fn, \
-		Allocator, \
-		Update_Policy>
-
-#define PB_ASSOC_TYPES_TRAITS_C_DEC \
-	pb_assoc::detail::types_traits< \
-		Key, \
-		Data, \
-		Allocator>
-
-#ifdef PB_ASSOC_USE_MAP_DEBUG_BASE
-#define PB_ASSOC_MAP_DEBUG_BASE_C_DEC \
-	pb_assoc::detail::map_debug_base< \
-		Key, \
-		Eq_Fn>
-#endif // #ifdef PB_ASSOC_USE_MAP_DEBUG_BASE
-
-#ifdef PB_ASSOC_DATA_TRUE_INDICATOR
-#define PB_ASSOC_V2F(X) (X).first
-#define PB_ASSOC_V2S(X) (X).second
-#define PB_ASSOC_EP2VP(X)& ((X)->m_value)
-#endif // #ifdef PB_ASSOC_DATA_TRUE_INDICATOR
-
-#ifdef PB_ASSOC_DATA_FALSE_INDICATOR
-#define PB_ASSOC_V2F(X) (X)
-#define PB_ASSOC_V2S(X) Data()
-#define PB_ASSOC_EP2VP(X)& ((X)->m_value.first)
-#endif // #ifdef PB_ASSOC_DATA_FALSE_INDICATOR
-
-#ifdef PB_ASSOC_LU_MAP_DEBUG_
-#define PB_ASSOC_DBG_ASSERT(X) assert(X)
-#define PB_ASSOC_DBG_VERIFY(X) assert(X)
-#define PB_ASSOC_DBG_ONLY(X) X
-#else // #ifdef PB_ASSOC_LU_MAP_DEBUG_
-#define PB_ASSOC_DBG_ASSERT(X)
-#define PB_ASSOC_DBG_VERIFY(X) {if((X)==0);}
-#define PB_ASSOC_DBG_ONLY(X) ;
-#endif // #ifdef PB_ASSOC_LU_MAP_DEBUG_
-
-    /* Skip to the lu, my darling. */
-
-    template<typename Key,
-	     typename Data,
-	     class Eq_Fn,
-	     class Allocator,
-	     class Update_Policy>
-    class PB_ASSOC_CLASS_NAME :
-#ifdef PB_ASSOC_LU_MAP_DEBUG_
-      protected PB_ASSOC_MAP_DEBUG_BASE_C_DEC,
-#endif // #ifdef PB_ASSOC_LU_MAP_DEBUG_
-      public Eq_Fn,
-      public Update_Policy,
-      public PB_ASSOC_TYPES_TRAITS_C_DEC
-    {
-
-    protected:
-
-      typedef typename Allocator::size_type size_type;
-
-      typedef
-      typename PB_ASSOC_TYPES_TRAITS_C_DEC::const_key_reference
-      const_key_reference;
-
-#ifdef PB_ASSOC_DATA_TRUE_INDICATOR
-
-      typedef typename PB_ASSOC_TYPES_TRAITS_C_DEC::data_type data_type;
-
-      typedef
-      typename PB_ASSOC_TYPES_TRAITS_C_DEC::data_reference
-      data_reference;
-
-      typedef
-      typename PB_ASSOC_TYPES_TRAITS_C_DEC::const_data_reference
-      const_data_reference;
-
-#endif // #ifdef PB_ASSOC_DATA_TRUE_INDICATOR
-
-      typedef typename PB_ASSOC_TYPES_TRAITS_C_DEC::value_type value_type;
-
-      typedef typename PB_ASSOC_TYPES_TRAITS_C_DEC::pointer pointer;
-
-      typedef
-      typename PB_ASSOC_TYPES_TRAITS_C_DEC::const_pointer
-      const_pointer;
-
-      typedef typename PB_ASSOC_TYPES_TRAITS_C_DEC::reference reference;
-
-      typedef
-      typename PB_ASSOC_TYPES_TRAITS_C_DEC::const_reference
-      const_reference;
-
-      typedef Update_Policy update_policy;
-
-      typedef typename Update_Policy::metadata_type update_metadata;
-
-      struct entry
-      {
-	typename PB_ASSOC_TYPES_TRAITS_C_DEC::value_type m_value;
-
-	update_metadata m_update_metadata;
-
-	typename Allocator::template rebind<entry>::other::pointer m_p_next;
-      };
-
-      typedef
-      typename Allocator::template rebind<entry>::other
-      entry_allocator;
-
-      typedef typename entry_allocator::pointer entry_pointer;
-
-      typedef typename entry_allocator::const_pointer const_entry_pointer;
-
-      typedef typename entry_allocator::reference entry_reference;
-
-      typedef
-      typename entry_allocator::const_reference
-      const_entry_reference;
-
-      typedef
-      typename Allocator::template rebind<entry_pointer>::other
-      entry_pointer_allocator;
-
-      typedef typename entry_pointer_allocator::pointer entry_pointer_array;
-
-#define PB_ASSOC_GEN_POS entry_pointer
-
-      typedef value_type mapped_value_type;
-
-      typedef pointer mapped_pointer;
-
-      typedef const_pointer const_mapped_pointer;
-
-      typedef reference mapped_reference;
-
-      typedef const_reference const_mapped_reference;
-
-#include <ext/pb_assoc/detail/unordered_iterator/const_find_iterator.hpp>
-#include <ext/pb_assoc/detail/unordered_iterator/find_iterator.hpp>
-#include <ext/pb_assoc/detail/unordered_iterator/const_iterator.hpp>
-#include <ext/pb_assoc/detail/unordered_iterator/iterator.hpp>
-
-#undef PB_ASSOC_GEN_POS
-
-      typedef find_iterator_ find_iterator;
-
-      typedef const_find_iterator_ const_find_iterator;
-
-      typedef iterator_ iterator;
-
-      typedef const_iterator_ const_iterator;
-
-      typedef Eq_Fn eq_fn;
-
-      typedef Allocator allocator;
-
-    protected:
-
-      PB_ASSOC_CLASS_NAME();
-
-      PB_ASSOC_CLASS_NAME(const Eq_Fn& r_eq_fn);
-
-      PB_ASSOC_CLASS_NAME(const Eq_Fn& r_eq_fn, const Update_Policy& r_update_policy);
-
-      PB_ASSOC_CLASS_NAME(const PB_ASSOC_CLASS_C_DEC& r_other);
-
-      virtual
-      ~PB_ASSOC_CLASS_NAME();
-
-      void
-      swap(PB_ASSOC_CLASS_C_DEC& r_other);
-
-      template<class It>
-      void
-      copy_from_range(It first_it, It last_it);
-
-      inline size_type
-      size() const;
-
-      inline size_type
-      max_size() const;
-
-      inline bool
-      empty() const;
-
-      Eq_Fn& 
-      get_eq_fn();
-
-      const Eq_Fn& 
-      get_eq_fn() const;
-
-      inline std::pair<find_iterator, bool>
-      insert(const_reference r_val);
-
-#ifdef PB_ASSOC_DATA_TRUE_INDICATOR
-      inline data_reference
-      subscript_imp(const_key_reference r_key);
-#endif // #ifdef PB_ASSOC_DATA_TRUE_INDICATOR
-
-      inline find_iterator
-      find(const_key_reference r_key);
-
-      inline const_find_iterator
-      find(const_key_reference r_key) const;
-
-#ifdef PB_ASSOC_DATA_TRUE_INDICATOR
-      inline const_data_reference
-      const_subscript_imp(const_key_reference r_key) const;
-#endif // #ifdef PB_ASSOC_DATA_TRUE_INDICATOR
-
-      inline size_type
-      erase(const_key_reference r_key);
-
-      template<class Pred>
-      inline size_type
-      erase_if(Pred& r_pred);
-
-      void
-      clear();
-
-      inline iterator
-      begin();
-
-      inline const_iterator
-      begin() const;
-
-      inline iterator
-      end();
-
-      inline const_iterator
-      end() const;
-
-#ifdef PB_ASSOC_LU_MAP_DEBUG_
-
-      virtual void
-      assert_valid() const;
-
-#endif // #ifdef PB_ASSOC_LU_MAP_DEBUG_
-
-    private:
-
-      typedef PB_ASSOC_TYPES_TRAITS_C_DEC my_traits_base;
-
-#ifdef PB_ASSOC_USE_MAP_DEBUG_BASE
-      typedef PB_ASSOC_MAP_DEBUG_BASE_C_DEC my_map_debug_base;
-#endif // #ifdef PB_ASSOC_USE_MAP_DEBUG_BASE
-
-      typedef
-      pb_assoc::detail::cond_dealtor<
-	entry,
-	Allocator>
-      cond_dealtor_t;
-
-    private:
-
-      void
-      deallocate_all(bool deallocate_root);
-
-      inline void
-      move_next_to_front(entry_pointer p_l) const;
-
-      void
-      initialize();
-
-      inline void
-      insert_new_after(entry_pointer p_l, const_reference r_val);
-
-      inline entry_pointer
-      find_imp(const_key_reference r_key) const
-      {
-	entry_pointer p_l = m_p_l;
-
-	while (p_l->m_p_next != NULL)
-	  if (Eq_Fn::operator()(
-				r_key,
-				PB_ASSOC_V2F(p_l->m_p_next->m_value)))
-	    {
-	      if (Update_Policy::operator()(p_l->m_update_metadata))
-		{
-		  move_next_to_front(p_l);
-
-		  return (m_p_l);
-		}
-	      else
-		return (p_l);
-	    }
-	  else
-	    p_l = p_l->m_p_next;
-
-	return (p_l);
-      }
-
-      inline void
-      erase_imp(entry_pointer p_l);
-
-      inline find_iterator
-      find_end();
-
-      inline const_find_iterator
-      find_end() const;
-
-      void
-      inc_it_state(pointer& r_p_value, std::pair<entry_pointer, size_type>& r_pos) const;
-
-      void
-      inc_it_state(const_pointer& r_p_value, entry_pointer& r_pos) const;
-
-      void
-      get_start_it_state(pointer& r_p_value, std::pair<entry_pointer, size_type>& r_pos) const;
-
-#ifdef PB_ASSOC_LU_MAP_DEBUG_
-
-      void
-      assert_entry_pointer_array_valid(const entry_pointer_array a_p_lntries) const;
-
-      void
-      assert_entry_pointer_valid(const entry_pointer p_l, store_hash_true_indicator) const;
-
-      void
-      assert_entry_pointer_valid(const entry_pointer p_l, store_hash_false_indicator) const;
-
-#endif // #ifdef PB_ASSOC_LU_MAP_DEBUG_
-
-    private:
-
-      static entry_allocator s_entry_allocator;
-
-      mutable entry_pointer m_p_l;
-
-      size_type m_size;
-
-      friend class iterator_;
-
-      friend class const_iterator_;
-
-      static iterator s_end_it;
-
-      static const_iterator s_const_end_it;
-
-      static find_iterator s_find_end_it;
-
-      static const_find_iterator s_const_find_end_it;
-
-    };
-
-#include <ext/pb_assoc/detail/lu_map_/constructor_destructor_fn_imps.hpp>
-#include <ext/pb_assoc/detail/lu_map_/info_fn_imps.hpp>
-#include <ext/pb_assoc/detail/lu_map_/debug_fn_imps.hpp>
-#include <ext/pb_assoc/detail/lu_map_/policy_access_fn_imps.hpp>
-#include <ext/pb_assoc/detail/lu_map_/iterators_fn_imps.hpp>
-#include <ext/pb_assoc/detail/lu_map_/erase_fn_imps.hpp>
-#include <ext/pb_assoc/detail/lu_map_/find_fn_imps.hpp>
-#include <ext/pb_assoc/detail/lu_map_/insert_fn_imps.hpp>
-
-#undef PB_ASSOC_CLASS_T_DEC
-
-#undef PB_ASSOC_CLASS_C_DEC
-
-#undef PB_ASSOC_TYPES_TRAITS_C_DEC
-
-#undef PB_ASSOC_MAP_DEBUG_BASE_C_DEC
-
-#undef PB_ASSOC_CLASS_NAME
-
-#undef PB_ASSOC_V2F
-#undef PB_ASSOC_EP2VP
-#undef PB_ASSOC_V2S
-
-#undef PB_ASSOC_DBG_ASSERT
-#undef PB_ASSOC_DBG_VERIFY
-#undef PB_ASSOC_DBG_ONLY
-
-  } // namespace detail
-
-} // namespace pb_assoc
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/lu_map_/policy_access_fn_imps.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/lu_map_/policy_access_fn_imps.hpp
deleted file mode 100644
index e11e1408772..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/lu_map_/policy_access_fn_imps.hpp
+++ /dev/null
@@ -1,60 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file policy_access_fn_imps.hpp
- * Contains implementations of lu_map_.
- */
-
-PB_ASSOC_CLASS_T_DEC
-Eq_Fn& 
-PB_ASSOC_CLASS_C_DEC::
-get_eq_fn()
-{
-  return (*this);
-}
-
-PB_ASSOC_CLASS_T_DEC
-const Eq_Fn& 
-PB_ASSOC_CLASS_C_DEC::
-get_eq_fn() const
-{
-  return (*this);
-}
-
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/lu_policy/counter_lu_metadata_imp.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/lu_policy/counter_lu_metadata_imp.hpp
deleted file mode 100644
index 446b1d6c9f3..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/lu_policy/counter_lu_metadata_imp.hpp
+++ /dev/null
@@ -1,66 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file counter_lu_metadata_imp.hpp
- * Contains implementation of a lu counter policy's metadata.
- */
-
-PB_ASSOC_CLASS_T_DEC
-counter_lu_metadata<
-  Size_Type>
-PB_ASSOC_CLASS_C_DEC::
-operator()(size_type m_max_count) const
-{
-  return (counter_lu_metadata<Size_Type>(std::rand() % m_max_count));
-}
-
-PB_ASSOC_CLASS_T_DEC
-template<typename Metadata_Reference>
-inline bool
-PB_ASSOC_CLASS_C_DEC::
-operator()(Metadata_Reference r_data, size_type m_max_count) const
-{
-  if (++r_data.m_count != m_max_count)
-    return (false);
-
-  r_data.m_count = 0;
-
-  return (true);
-}
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/lu_policy/counter_lu_policy_imp.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/lu_policy/counter_lu_policy_imp.hpp
deleted file mode 100644
index 1cc8029a370..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/lu_policy/counter_lu_policy_imp.hpp
+++ /dev/null
@@ -1,74 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file counter_lu_policy_imp.hpp
- * Contains a lu counter policy implementation.
- */
-
-PB_ASSOC_CLASS_T_DEC
-PB_ASSOC_CLASS_C_DEC::
-counter_lu_policy(size_type max_count /*= 5*/) :
-  m_max_count(max_count)
-{ }
-
-PB_ASSOC_CLASS_T_DEC
-void
-PB_ASSOC_CLASS_C_DEC::
-swap(PB_ASSOC_CLASS_C_DEC& r_other)
-{
-  std::swap(m_max_count, r_other.m_max_count);
-}
-
-PB_ASSOC_CLASS_T_DEC
-counter_lu_metadata<
-  Size_Type>
-PB_ASSOC_CLASS_C_DEC::
-operator()() const
-{
-  return (my_base::operator()(m_max_count));
-}
-
-PB_ASSOC_CLASS_T_DEC
-bool
-PB_ASSOC_CLASS_C_DEC::
-operator()(metadata_reference r_data) const
-{
-  return (my_base::operator()(r_data, m_max_count));
-}
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/lu_policy/mtf_lu_policy_imp.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/lu_policy/mtf_lu_policy_imp.hpp
deleted file mode 100644
index 291e1064094..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/lu_policy/mtf_lu_policy_imp.hpp
+++ /dev/null
@@ -1,65 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file mtf_lu_policy.hpp
- * Contains a move-to-front policy implementation.
- */
-
-PB_ASSOC_CLASS_T_DEC
-void
-PB_ASSOC_CLASS_C_DEC::
-swap(PB_ASSOC_CLASS_C_DEC& /*r_other*/)
-{ }
-
-PB_ASSOC_CLASS_T_DEC
-typename PB_ASSOC_CLASS_C_DEC::metadata_type
-PB_ASSOC_CLASS_C_DEC::
-operator()() const
-{
-  return (move_to_front_lu_metadata());
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline bool
-PB_ASSOC_CLASS_C_DEC::
-operator()(metadata_reference /*r_data*/) const
-{
-  return (true);
-}
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/map_debug_base.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/map_debug_base.hpp
deleted file mode 100644
index 1f7dbc07fbd..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/map_debug_base.hpp
+++ /dev/null
@@ -1,248 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file map_debug_base.hpp
- * Contains a debug-mode base for all maps.
- */
-
-#ifndef MAP_DEBUG_BASE_HPP
-#define MAP_DEBUG_BASE_HPP
-
-#ifdef PB_ASSOC_USE_MAP_DEBUG_BASE
-
-#include <assert.h>
-#include <utility>
-#include <set>
-#include <pb_assoc/testsuite/regression/res_mng/dbg_ex_allocator_base.hpp>
-
-namespace pb_assoc
-{
-
-  namespace detail
-  {
-
-#ifdef PB_ASSOC_MAP_DEBUG_BASE_DEBUG
-#define PB_ASSOC_DBG_ASSERT(X) assert(X)
-#define PB_ASSOC_DBG_VERIFY(X) assert(X)
-#define PB_ASSOC_DBG_ONLY(X) X
-#else // #ifdef PB_ASSOC_MAP_DEBUG_BASE_DEBUG
-#define PB_ASSOC_DBG_ASSERT(X)
-#define PB_ASSOC_DBG_VERIFY(X) {if((X)==0);}
-#define PB_ASSOC_DBG_ONLY(X) ;
-#endif // #ifdef PB_ASSOC_MAP_DEBUG_BASE_DEBUG
-
-#define PB_ASSOC_CLASS_T_DEC \
-	template<typename Key, class Eq_Fn>
-
-#define PB_ASSOC_CLASS_C_DEC \
-	map_debug_base< \
-		Key, \
-		Eq_Fn>
-
-    template<typename Key, class Eq_Fn>
-    class map_debug_base
-    {
-    private:
-      typedef typename std::allocator<Key> key_allocator;
-
-      typedef typename key_allocator::size_type size_type;
-
-      typedef typename key_allocator::const_reference const_key_reference;
-
-    protected:
-      map_debug_base();
-
-      map_debug_base(const PB_ASSOC_CLASS_C_DEC& r_other);
-
-      ~map_debug_base();
-
-      inline void
-      insert_new(const_key_reference r_key);
-
-      inline void
-      insert_existing(const_key_reference r_key);
-
-      inline void
-      erase_existing(const_key_reference r_key);
-
-      void
-      clear();
-
-      inline void
-      check_key_exists(const_key_reference r_key) const;
-
-      inline void
-      check_key_does_not_exist(const_key_reference r_key) const;
-
-      inline void
-      check_size(size_type size) const;
-
-      void
-      swap(PB_ASSOC_CLASS_C_DEC& r_other);
-
-    private:
-      typedef std::set<Key> key_set;
-
-    private:
-      key_set m_key_set;
-    };
-
-    PB_ASSOC_CLASS_T_DEC
-    PB_ASSOC_CLASS_C_DEC::
-    map_debug_base()
-    {
-
-    }
-
-    PB_ASSOC_CLASS_T_DEC
-    PB_ASSOC_CLASS_C_DEC::
-    map_debug_base(const PB_ASSOC_CLASS_C_DEC& r_other) :
-      m_key_set(r_other.m_key_set)
-    { }
-
-    PB_ASSOC_CLASS_T_DEC
-    PB_ASSOC_CLASS_C_DEC::
-    ~map_debug_base()
-    { }
-
-    PB_ASSOC_CLASS_T_DEC
-    inline void
-    PB_ASSOC_CLASS_C_DEC::
-    insert_new(const_key_reference r_key)
-    {
-      const double orig_throw_prob =
-	pb_assoc::detail::test::dbg_ex_allocator_base().get_throw_prob();
-
-      pb_assoc::detail::test::dbg_ex_allocator_base().
-	set_throw_prob(0);
-
-      if (m_key_set.find(r_key) != m_key_set.end())
-	std::abort();
-
-      try
-	{
-	  m_key_set.insert(r_key);
-	}
-      catch(...)
-	{
-	  pb_assoc::detail::test::dbg_ex_allocator_base().
-	    set_throw_prob(orig_throw_prob);
-
-	  throw;
-	}
-
-      pb_assoc::detail::test::dbg_ex_allocator_base().
-	set_throw_prob(orig_throw_prob);
-    }
-
-    PB_ASSOC_CLASS_T_DEC
-    inline void
-    PB_ASSOC_CLASS_C_DEC::
-    erase_existing(const_key_reference r_key)
-    {
-      if (m_key_set.find(r_key) == m_key_set.end())
-	std::abort();
-
-      m_key_set.erase(r_key);
-
-      if (m_key_set.find(r_key) != m_key_set.end())
-	std::abort();
-    }
-
-    PB_ASSOC_CLASS_T_DEC
-    void
-    PB_ASSOC_CLASS_C_DEC::
-    clear()
-    {
-      m_key_set.clear();
-    }
-
-    PB_ASSOC_CLASS_T_DEC
-    inline void
-    PB_ASSOC_CLASS_C_DEC::
-    check_key_exists(const_key_reference r_key) const
-    {
-      if (m_key_set.find(r_key) == m_key_set.end())
-	std::abort();
-    }
-
-    PB_ASSOC_CLASS_T_DEC
-    inline void
-    PB_ASSOC_CLASS_C_DEC::
-    check_key_does_not_exist(const_key_reference r_key) const
-    {
-      if (m_key_set.find(r_key) != m_key_set.end())
-	std::abort();
-    }
-
-    PB_ASSOC_CLASS_T_DEC
-    inline void
-    PB_ASSOC_CLASS_C_DEC::
-    check_size(size_type size) const
-    {
-      const size_type key_set_size = m_key_set.size();
-
-      if (size != key_set_size)
-	std::abort();
-    }
-
-    PB_ASSOC_CLASS_T_DEC
-    void
-    PB_ASSOC_CLASS_C_DEC::
-    swap(PB_ASSOC_CLASS_C_DEC& r_other)
-    {
-      m_key_set.swap(r_other.m_key_set);
-    }
-
-#undef PB_ASSOC_CLASS_T_DEC
-#undef PB_ASSOC_CLASS_C_DEC
-
-#undef PB_ASSOC_DBG_ASSERT
-#undef PB_ASSOC_DBG_VERIFY
-#undef PB_ASSOC_DBG_ONLY
-
-  } // namespace detail
-
-} // namespace pb_assoc
-
-#endif // #ifdef PB_ASSOC_USE_MAP_DEBUG_BASE
-
-#endif // #ifndef MAP_DEBUG_BASE_HPP
-
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/mapping_level_imp.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/mapping_level_imp.hpp
deleted file mode 100644
index 76ffc8c1cf8..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/mapping_level_imp.hpp
+++ /dev/null
@@ -1,90 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file mapping_level_imp.hpp
- * Contains mapping level implementation.
- */
-
-#ifndef MAPPING_LEVEL_IMP_HPP
-#define MAPPING_LEVEL_IMP_HPP
-
-namespace pb_assoc
-{
-
-  namespace detail
-  {
-
-    template<class Given_Data>
-    struct mapping_level_imp
-    {
-      enum
-	{
-	  value = 1
-	};
-    };
-
-    template<>
-    struct mapping_level_imp<
-      null_data_type>
-    {
-      enum
-	{
-	  value = 1
-	};
-    };
-
-    template<class Cntnr>
-    struct mapping_level_imp<
-      compound_data_type<
-      Cntnr> >
-    {
-      enum
-	{
-	  value = 1 +
-	  mapping_level_imp<
-	  typename Cntnr::given_data_type>::value
-	};
-    };
-
-  } // namespace detail
-
-} // namespace pb_assoc
-
-#endif // #ifndef MAPPING_LEVEL_IMP_HPP
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/ms_category_imp.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/ms_category_imp.hpp
deleted file mode 100644
index 7afd168fd7d..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/ms_category_imp.hpp
+++ /dev/null
@@ -1,81 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file ms_category_imp.hpp
- * Contains mapping-semantics category implementation.
- */
-
-#ifndef MS_CATEGORY_IMP_HPP
-#define MS_CATEGORY_IMP_HPP
-
-namespace pb_assoc
-{
-
-  namespace detail
-  {
-
-    template<typename Key, class Data>
-    struct ms_category_imp
-    {
-      typedef data_enabled_ms_tag type;
-    };
-
-    template<typename Key>
-    struct ms_category_imp<
-      Key,
-      null_data_type>
-    {
-      typedef basic_ms_tag type;
-    };
-
-    template<typename Key, class Cntnr>
-    struct ms_category_imp<
-      Key,
-      compound_data_type<
-      Cntnr> >
-    {
-      typedef compound_data_enabled_ms_tag type;
-    };
-
-  } // namespace detail
-
-} // namespace pb_assoc
-
-#endif // #ifndef MS_CATEGORY_IMP_HPP
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/ms_trait_imp.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/ms_trait_imp.hpp
deleted file mode 100644
index 2d22075089a..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/ms_trait_imp.hpp
+++ /dev/null
@@ -1,136 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file ms_category_imp.hpp
- * Contains mapping-semantics category implementation.
- */
-
-#ifndef MS_TRAIT_IMP_HPP
-#define MS_TRAIT_IMP_HPP
-
-namespace detail
-{
-
-  template<class Cntnr, class Mapping_Semantics_Category>
-  struct mapping_semantics_traits;
-
-#define PB_ASSOC_CLASS_T_DEC \
-	template<class Cntnr>
-
-#define PB_ASSOC_CLASS_C_DEC \
-	mapping_semantics_traits< \
-		Cntnr, \
-		basic_ms_tag>
-
-  template<class Cntnr>
-  struct mapping_semantics_traits<
-    Cntnr,
-    basic_ms_tag>
-  {
-
-  public:
-    enum
-      {
-	has_data = false,
-	has_compound_data = false,
-	mapping_level = 1
-      };
-  };
-
-#undef PB_ASSOC_CLASS_T_DEC
-
-#undef PB_ASSOC_CLASS_C_DEC
-
-#define PB_ASSOC_CLASS_T_DEC \
-	template<class Cntnr>
-
-#define PB_ASSOC_CLASS_C_DEC \
-	mapping_semantics_traits< \
-		Cntnr, \
-		data_enabled_ms_tag>
-
-  template<class Cntnr>
-  struct mapping_semantics_traits<
-    Cntnr,
-    data_enabled_ms_tag>
-  {
-  public:
-    enum
-      {
-	has_data = true,
-	has_compound_data = false,
-	mapping_level = 1
-      };
-  };
-
-#undef PB_ASSOC_CLASS_T_DEC
-
-#undef PB_ASSOC_CLASS_C_DEC
-
-#define PB_ASSOC_CLASS_T_DEC \
-	template<class Cntnr>
-
-#define PB_ASSOC_CLASS_C_DEC \
-	mapping_semantics_traits< \
-		Cntnr, \
-		compound_data_enabled_ms_tag>
-
-  template<class Cntnr>
-  struct mapping_semantics_traits<
-    Cntnr,
-    compound_data_enabled_ms_tag>
-  {
-  public:
-    enum
-      {
-	has_data = true,
-	has_compound_data = true,
-	mapping_level = mapping_level_imp<
-	typename Cntnr::given_data_type>::value
-      };
-  };
-
-#undef PB_ASSOC_CLASS_T_DEC
-
-#undef PB_ASSOC_CLASS_C_DEC
-
-} // namespace detail
-
-#endif // #ifndef MS_TRAIT_IMP_HPP
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/order_statistics_imp.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/order_statistics_imp.hpp
deleted file mode 100644
index 7e3550188d6..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/order_statistics_imp.hpp
+++ /dev/null
@@ -1,436 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/*
- * @file order_statistics_imp.hpp
- * Contains forward declarations for order_statistics_key
- */
-
-#ifndef ORDER_STATISTICS_IMP_HPP
-#define ORDER_STATISTICS_IMP_HPP
-
-#define PB_ASSOC_CLASS_T_DEC \
-	template<class Key, class Allocator>
-
-#define PB_ASSOC_CLASS_C_DEC \
-	order_statistics_key< \
-		Key, \
-		Allocator>
-
-PB_ASSOC_CLASS_T_DEC
-inline
-PB_ASSOC_CLASS_C_DEC::
-order_statistics_key(const_key_reference r_key) :
-  m_key(r_key),
-  m_rank(1)
-{ }
-
-PB_ASSOC_CLASS_T_DEC
-inline
-PB_ASSOC_CLASS_C_DEC::
-operator typename PB_ASSOC_CLASS_C_DEC::key_reference()
-{
-  return (m_key);
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline
-PB_ASSOC_CLASS_C_DEC::
-operator typename PB_ASSOC_CLASS_C_DEC::key_type() const
-{
-  return (m_key);
-}
-
-#undef PB_ASSOC_CLASS_T_DEC
-
-#undef PB_ASSOC_CLASS_C_DEC
-
-#define PB_ASSOC_CLASS_T_DEC \
-	template<class Cmp_Fn, class Allocator>
-
-#define PB_ASSOC_CLASS_C_DEC \
-	order_statistics_key_cmp< \
-		Cmp_Fn, \
-		Allocator>
-
-PB_ASSOC_CLASS_T_DEC
-inline
-PB_ASSOC_CLASS_C_DEC::
-order_statistics_key_cmp()
-{ }
-
-PB_ASSOC_CLASS_T_DEC
-inline
-PB_ASSOC_CLASS_C_DEC::
-order_statistics_key_cmp(const Cmp_Fn& r_cmp_fn) :
-  Cmp_Fn(r_cmp_fn)
-{ }
-
-PB_ASSOC_CLASS_T_DEC
-inline bool
-PB_ASSOC_CLASS_C_DEC::
-operator()(const_key_reference r_lhs_key, const_key_reference r_rhs_key) const
-{
-  return Cmp_Fn::operator()((key_type)r_lhs_key, (key_type)r_rhs_key);
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::cmp_fn& 
-PB_ASSOC_CLASS_C_DEC::
-get_cmp_fn()
-{
-  return (*this);
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline const typename PB_ASSOC_CLASS_C_DEC::cmp_fn& 
-PB_ASSOC_CLASS_C_DEC::
-get_cmp_fn() const
-{
-  return (*this);
-}
-
-#undef PB_ASSOC_CLASS_T_DEC
-
-#undef PB_ASSOC_CLASS_C_DEC
-
-#define PB_ASSOC_CLASS_T_DEC \
-	template<class Key, class Allocator>
-
-#define PB_ASSOC_CLASS_C_DEC \
-	order_statistics_node_updator< \
-		Key, \
-		Allocator>
-
-PB_ASSOC_CLASS_T_DEC
-inline void
-PB_ASSOC_CLASS_C_DEC::
-operator()(const_key_pointer p_key, const_key_pointer p_l_child_key, const_key_pointer p_r_child_key)
-{
-  /*
-   * The left rank is 0 if there is no left child,
-   *	or the rank of the left child, otherwise.
-   */
-  const size_type l_rank =(p_l_child_key == NULL)? 0 : p_l_child_key->m_rank;
-
-  /*
-   * The right rank is 0 if there is no right child,
-   *	or the rank of the right child, otherwise.
-   */
-  const size_type r_rank =(p_r_child_key == NULL)? 0 : p_r_child_key->m_rank;
-
-  /*
-   * The rand of the entry is the sumb of the ranks of its
-   *	children + 1 (for itself).
-   */
-  p_key->m_rank = 1 + l_rank + r_rank;
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline void
-PB_ASSOC_CLASS_C_DEC::
-swap(PB_ASSOC_CLASS_C_DEC& /*r_other*/)
-{ }
-
-#undef PB_ASSOC_CLASS_T_DEC
-
-#undef PB_ASSOC_CLASS_C_DEC
-
-#define PB_ASSOC_CLASS_T_DEC \
-	template<class Cntnr>
-
-#define PB_ASSOC_CLASS_C_DEC \
-	find_by_order< \
-		Cntnr>
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::iterator
-PB_ASSOC_CLASS_C_DEC::
-operator()(Cntnr& r_c, size_type order) const
-{
-  return find(r_c, order);
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::const_iterator
-PB_ASSOC_CLASS_C_DEC::
-operator()(const Cntnr& r_c, size_type order) const
-{
-  return find(r_c, order);
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::const_iterator
-PB_ASSOC_CLASS_C_DEC::
-find(const Cntnr& r_c, size_type order)
-{
-  if (order > r_c.size())
-    return (r_c.end());
-
-  /*
-   * Start at the top of the tree.
-   */
-  typename Cntnr::const_node_iterator it = r_c.node_begin();
-
-  /*
-   * Loop up to a leaf.
-   */
-  while (it != r_c.node_end())
-    {
-      typename Cntnr::const_node_iterator l_it = it.l_child();
-
-      /*
-       * The order of the element, o, is the rank of the left
-       *	child (for the entry itself).
-       */
-      const size_type o = (l_it == r_c.node_end())?
-	0 :(*l_it)->m_rank;
-
-      /*
-       * If the current order, o, is the order requested,
-       *	the key has been found.
-       */
-      if (order == o)
-	return (*it);
-      /*
-       * If the current order, o, is larger than the order requested,
-       *	we should move to the left subtree.
-       */
-      else if (order < o)
-	it = l_it;
-      /*
-       * Otherwise adujst the requested order and move to the right subtree.
-       */
-      else
-	{
-	  order -= o + 1;
-
-	  it = it.r_child();
-	}
-    }
-
-  return (r_c.end());
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::iterator
-PB_ASSOC_CLASS_C_DEC::
-find(Cntnr& r_c, size_type order)
-{
-  if (order > r_c.size())
-    return (r_c.end());
-
-  /*
-   * Start at the top of the tree.
-   */
-  typename Cntnr::node_iterator it = r_c.node_begin();
-
-  /*
-   * Loop up to a leaf.
-   */
-  while (it != r_c.node_end())
-    {
-      typename Cntnr::node_iterator l_it = it.l_child();
-
-      /*
-       * The order of the element, o, is the rank of the left
-       *	child (for the entry itself).
-       */
-      const size_type o = (l_it == r_c.node_end())?
-	0 :
-	r_c.extract_key(*(*l_it)).m_rank;
-
-      /*
-       * If the current order, o, is the order requested,
-       *	the key has been found.
-       */
-      if (order == o)
-	return (*it);
-      /*
-       * If the current order, o, is larger than the order requested,
-       *	we should move to the left subtree.
-       */
-      else if (order < o)
-	it = l_it;
-      /*
-       * Otherwise adujst the requested order and move to the right subtree.
-       */
-      else
-	{
-	  order -= o + 1;
-
-	  it = it.r_child();
-	}
-    }
-
-  return (r_c.end());
-}
-
-#undef PB_ASSOC_CLASS_T_DEC
-
-#undef PB_ASSOC_CLASS_C_DEC
-
-#define PB_ASSOC_CLASS_T_DEC \
-	template<class Cntnr>
-
-#define PB_ASSOC_CLASS_C_DEC \
-	order_by_key< \
-		Cntnr>
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::size_type
-PB_ASSOC_CLASS_C_DEC::
-operator()(const Cntnr& r_c, const underlying_key_type& r_key) const
-{
-  /*
-   * The logic here is similar to that in order_by_key.
-   */
-
-  typename Cntnr::const_node_iterator it = r_c.node_begin();
-
-  size_type ord = 0;
-
-  while (it != r_c.node_end())
-    {
-      typename Cntnr::const_node_iterator l_it = it.l_child();
-
-      if (r_c.get_cmp_fn().get_cmp_fn()(
-					r_key,
-					r_c.extract_key(*(*it)).m_key))
-	it = l_it;
-      else if (r_c.get_cmp_fn().get_cmp_fn()(
-					     r_c.extract_key(*(*it)).m_key,
-					     r_key))
-	{
-
-	  ord += (l_it == r_c.node_end())?
-	    1 :
-	    1 + r_c.extract_key(*(*l_it)).m_rank;
-
-	  it = it.r_child();
-	}
-      else
-	{
-	  ord += (l_it == r_c.node_end())?
-	    0 :
-	    r_c.extract_key(*(*l_it)).m_rank;
-
-	  it = r_c.node_end();
-	}
-    }
-
-  return (ord);
-}
-
-#undef PB_ASSOC_CLASS_T_DEC
-
-#undef PB_ASSOC_CLASS_C_DEC
-
-#define PB_ASSOC_CLASS_T_DEC \
-	template<class Cntnr, class Allocator>
-
-#define PB_ASSOC_CLASS_C_DEC \
-	order_statistics_key_verifier< \
-		Cntnr, \
-		Allocator>
-
-template<class Cntnr, class Allocator = std::allocator<char> >
-class order_statistics_key_verifier
-{
-public:
-  typedef Cntnr map;
-
-  typedef Allocator allocator;
-
-  typedef typename allocator::size_type size_type;
-
-  typedef
-  typename allocator::template rebind<map>::other::const_reference
-  const_map_reference;
-
-public:
-  bool
-  operator()(const Cntnr& r_c) const;
-
-private:
-  typedef typename Cntnr::const_node_iterator const_node_iterator;
-
-  typedef typename Cntnr::const_iterator cntnr_const_it;
-
-  typedef std::pair<bool, size_type> stat;
-
-private:
-  static stat
-  verify_imp(const_node_iterator it, const_node_iterator end_it)
-  {
-    if (it == end_it)
-      return (std::make_pair(true, 0));
-
-    const stat l_ret =
-      verify_imp(it.l_child(), end_it);
-
-    const stat r_ret =
-      verify_imp(it.r_child(), end_it);
-
-    if (!l_ret.first || !r_ret.first)
-      return (std::make_pair(false, 0));
-
-    if ((*it)->m_rank != 1 + l_ret.second + r_ret.second)
-      return (std::make_pair(false, 0));
-
-    return (std::make_pair(true, (*it)->m_rank));
-  }
-};
-
-PB_ASSOC_CLASS_T_DEC
-bool
-PB_ASSOC_CLASS_C_DEC::
-operator()(const Cntnr& r_c) const
-{
-  const stat top_stat =
-    verify_imp(r_c.node_begin(), r_c.node_end());
-
-  return (top_stat.first);
-}
-
-#undef PB_ASSOC_CLASS_T_DEC
-
-#undef PB_ASSOC_CLASS_C_DEC
-
-#endif // #ifndef ORDER_STATISTICS_IMP_HPP
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/ov_tree_map_/cond_dtor.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/ov_tree_map_/cond_dtor.hpp
deleted file mode 100644
index aa3e65ded93..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/ov_tree_map_/cond_dtor.hpp
+++ /dev/null
@@ -1,88 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file cond_dtor.hpp
- * Contains a conditional destructor
- */
-
-class cond_dtor
-{
-public:
-  cond_dtor(pointer a_vec, iterator& r_last_it, size_type total_size) : m_a_vec(a_vec),
-									m_r_last_it(r_last_it),
-									m_max_size(total_size),
-									m_no_action(false)
-  { }
-
-  ~cond_dtor()
-  {
-    if (m_no_action)
-      return;
-
-    iterator it = m_a_vec;
-
-    while (it != m_r_last_it)
-      {
-	it->~value_type();
-
-	++it;
-      }
-
-    if (m_max_size > 0)
-      value_allocator().deallocate(
-				   const_cast<typename value_allocator::pointer>(m_a_vec),
-				   m_max_size);
-  }
-
-  inline void
-  set_no_action()
-  {
-    m_no_action = true;
-  }
-
-protected:
-  pointer m_a_vec;
-
-  iterator& m_r_last_it;
-
-  const size_type m_max_size;
-
-  bool m_no_action;
-};
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/ov_tree_map_/constructors_destructor_fn_imps.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/ov_tree_map_/constructors_destructor_fn_imps.hpp
deleted file mode 100644
index 3285cfbbd57..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/ov_tree_map_/constructors_destructor_fn_imps.hpp
+++ /dev/null
@@ -1,278 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file constructors_destructor_fn_imps.hpp
- * Contains an implementation class for ov_tree_.
- */
-
-PB_ASSOC_CLASS_T_DEC
-typename PB_ASSOC_CLASS_C_DEC::value_allocator
-PB_ASSOC_CLASS_C_DEC::s_alloc;
-
-PB_ASSOC_CLASS_T_DEC
-PB_ASSOC_CLASS_C_DEC::
-PB_ASSOC_OV_TREE_CLASS_NAME() :
-  m_a_values(NULL),
-  m_end_it(NULL),
-  m_size(0)
-{
-  update(node_begin(), (Node_Updator* )this);
-
-  PB_ASSOC_DBG_ONLY(PB_ASSOC_CLASS_C_DEC::assert_valid();)
-    }
-
-PB_ASSOC_CLASS_T_DEC
-PB_ASSOC_CLASS_C_DEC::
-PB_ASSOC_OV_TREE_CLASS_NAME(const Cmp_Fn& r_cmp_fn) :
-  my_cmp_fn_base(r_cmp_fn),
-  m_a_values(NULL),
-  m_end_it(NULL),
-  m_size(0)
-{
-  update(node_begin(), (Node_Updator* )this);
-
-  PB_ASSOC_DBG_ONLY(PB_ASSOC_CLASS_C_DEC::assert_valid();)
-    }
-
-PB_ASSOC_CLASS_T_DEC
-PB_ASSOC_CLASS_C_DEC::
-PB_ASSOC_OV_TREE_CLASS_NAME(const Cmp_Fn& r_cmp_fn, const Node_Updator& r_node_updator) :
-  my_cmp_fn_base(r_cmp_fn),
-  Node_Updator(r_node_updator),
-  m_a_values(NULL),
-  m_end_it(NULL),
-  m_size(0)
-{
-  update(node_begin(), (Node_Updator* )this);
-
-  PB_ASSOC_DBG_ONLY(PB_ASSOC_CLASS_C_DEC::assert_valid();)
-    }
-
-PB_ASSOC_CLASS_T_DEC
-PB_ASSOC_CLASS_C_DEC::
-PB_ASSOC_OV_TREE_CLASS_NAME(const PB_ASSOC_CLASS_C_DEC& r_other) :
-  my_cmp_fn_base(r_other),
-  m_a_values(NULL),
-  m_end_it(NULL),
-  m_size(0)
-{
-  copy_from_ordered_range(r_other.begin(), r_other.end());
-
-  PB_ASSOC_DBG_ONLY(PB_ASSOC_CLASS_C_DEC::assert_valid();)
-    }
-
-PB_ASSOC_CLASS_T_DEC
-template<class It>
-inline void
-PB_ASSOC_CLASS_C_DEC::
-copy_from_range(It first_it, It last_it)
-{
-  enum
-    {
-      is_set_type = is_same_type<Data, null_data_type>::value
-    };
-
-  typedef
-    typename cond_type<
-    is_set_type,
-    std::set<
-    Key,
-    Cmp_Fn,
-    typename Allocator::template rebind<
-    Key>::other>,
-    std::map<
-    Key,
-    Data,
-    Cmp_Fn,
-    typename Allocator::template rebind<
-    std::pair<const Key, Data> >::other> >::type
-    map_type;
-
-  map_type m(first_it, last_it);
-
-  copy_from_ordered_range(m.begin(), m.end());
-}
-
-PB_ASSOC_CLASS_T_DEC
-template<class It>
-void
-PB_ASSOC_CLASS_C_DEC::
-copy_from_ordered_range(It first_it, It last_it)
-{
-  clear();
-
-  const size_type size = std::distance(first_it, last_it);
-
-  pointer a_values = s_alloc.allocate(size);
-
-  iterator target_it = a_values;
-  It source_it = first_it;
-  It source_end_it = last_it;
-
-  cond_dtor cd(a_values, target_it, size);
-
-  while (source_it != source_end_it)
-    {
-      new (const_cast<void* >(
-			      static_cast<const void* >(target_it)))
-	value_type(*source_it++);
-
-      ++target_it;
-    }
-
-  cd.set_no_action();
-
-  m_a_values = a_values;
-
-  m_size = size;
-
-  m_end_it = m_a_values + m_size;
-
-  update(node_begin(), (Node_Updator* )this);
-
-#ifdef PB_ASSOC_OV_TREE_DEBUG_
-  const_iterator dbg_it = m_a_values;
-
-  while (dbg_it != m_end_it)
-    {
-      my_map_debug_base::insert_new(PB_ASSOC_V2F(*dbg_it));
-
-      dbg_it++;
-    }
-
-  PB_ASSOC_CLASS_C_DEC::assert_valid();
-#endif // #ifdef PB_ASSOC_OV_TREE_DEBUG_
-}
-
-PB_ASSOC_CLASS_T_DEC
-template<class It>
-void
-PB_ASSOC_CLASS_C_DEC::
-copy_from_ordered_range(It first_it, It last_it, It other_first_it, It other_last_it)
-{
-  clear();
-
-  const size_type size =
-    std::distance(first_it, last_it) +
-    std::distance(other_first_it, other_last_it);
-
-  pointer a_values = s_alloc.allocate(size);
-
-  iterator target_it = a_values;
-  It source_it = first_it;
-  It source_end_it = last_it;
-
-  cond_dtor cd(a_values, target_it, size);
-
-  while (source_it != source_end_it)
-    {
-      new (const_cast<void* >(
-			      static_cast<const void* >(target_it)))
-	value_type(*source_it++);
-
-      ++target_it;
-    }
-
-  source_it = other_first_it;
-  source_end_it = other_last_it;
-
-  while (source_it != source_end_it)
-    {
-      new (const_cast<void* >(
-			      static_cast<const void* >(target_it)))
-	value_type(*source_it++);
-
-      ++target_it;
-    }
-
-  cd.set_no_action();
-
-  m_a_values = a_values;
-
-  m_size = size;
-
-  m_end_it = m_a_values + m_size;
-
-  update(node_begin(), (Node_Updator* )this);
-
-#ifdef PB_ASSOC_OV_TREE_DEBUG_
-  const_iterator dbg_it = m_a_values;
-
-  while (dbg_it != m_end_it)
-    {
-      my_map_debug_base::insert_new(PB_ASSOC_V2F(*dbg_it));
-
-      dbg_it++;
-    }
-
-  PB_ASSOC_CLASS_C_DEC::assert_valid();
-#endif // #ifdef PB_ASSOC_OV_TREE_DEBUG_
-}
-
-PB_ASSOC_CLASS_T_DEC
-void
-PB_ASSOC_CLASS_C_DEC::
-swap(PB_ASSOC_CLASS_C_DEC& r_other)
-{
-  PB_ASSOC_DBG_ONLY(assert_valid();)
-
-    std::swap(m_a_values, r_other.m_a_values);
-
-  std::swap(m_size, r_other.m_size);
-
-  std::swap(m_end_it, r_other.m_end_it);
-
-  std::swap((Cmp_Fn& )(*this), (Cmp_Fn& )r_other);
-
-  Node_Updator::swap(r_other);
-
-  PB_ASSOC_DBG_ONLY(my_map_debug_base::swap(r_other);)
-
-    PB_ASSOC_DBG_ONLY(assert_valid();)
-    }
-
-PB_ASSOC_CLASS_T_DEC
-PB_ASSOC_CLASS_C_DEC::
-~PB_ASSOC_OV_TREE_CLASS_NAME()
-{
-  PB_ASSOC_DBG_ONLY(assert_valid();)
-
-    cond_dtor cd(m_a_values, m_end_it, m_size);
-}
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/ov_tree_map_/debug_fn_imps.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/ov_tree_map_/debug_fn_imps.hpp
deleted file mode 100644
index 156c540540c..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/ov_tree_map_/debug_fn_imps.hpp
+++ /dev/null
@@ -1,101 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file debug_fn_imps.hpp
- * Contains an implementation class for ov_tree_.
- */
-
-#ifdef PB_ASSOC_OV_TREE_DEBUG_
-
-PB_ASSOC_CLASS_T_DEC
-void
-PB_ASSOC_CLASS_C_DEC::
-assert_valid() const
-{
-  if (m_a_mapped_values == NULL || m_end_it == NULL || m_size == 0)
-    PB_ASSOC_DBG_ASSERT(m_a_mapped_values == NULL&&  m_end_it == NULL&& 
-			m_size == 0);
-
-  assert_iterators();
-}
-
-PB_ASSOC_CLASS_T_DEC
-void
-PB_ASSOC_CLASS_C_DEC::
-assert_iterators() const
-{
-  my_map_debug_base::check_size(m_size);
-
-  size_type iterated_num = 0;
-
-  const_iterator prev_it = end();
-
-  PB_ASSOC_DBG_ASSERT( m_end_it == m_a_mapped_values + m_size);
-
-  for (const_iterator it = begin(); it != end(); ++it)
-    {
-      ++iterated_num;
-
-      PB_ASSOC_DBG_ONLY(my_map_debug_base::check_key_exists(
-							    PB_ASSOC_V2F(*it)));
-
-      PB_ASSOC_DBG_ASSERT(lower_bound(
-				      PB_ASSOC_V2F(*it)) == it);
-
-      const_iterator upper_bound_it = upper_bound(
-						  PB_ASSOC_V2F(*it));
-
-      --upper_bound_it;
-
-      PB_ASSOC_DBG_ASSERT(upper_bound_it == it);
-
-      if (prev_it != end())
-	PB_ASSOC_DBG_ASSERT(Cmp_Fn::operator()(
-					       PB_ASSOC_V2F(*prev_it),
-					       PB_ASSOC_V2F(*it)));
-
-      prev_it = it;
-    }
-
-  PB_ASSOC_DBG_ASSERT(iterated_num == m_size);
-}
-
-#endif // #ifdef PB_ASSOC_OV_TREE_DEBUG_
-
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/ov_tree_map_/erase_fn_imps.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/ov_tree_map_/erase_fn_imps.hpp
deleted file mode 100644
index d1bbe6cc197..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/ov_tree_map_/erase_fn_imps.hpp
+++ /dev/null
@@ -1,234 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file erase_fn_imps.hpp
- * Contains an implementation class for ov_tree_.
- */
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::size_type
-PB_ASSOC_CLASS_C_DEC::
-erase(const_key_reference r_key)
-{
-  iterator it = find(r_key);
-
-  if (it == find_end())
-    return (0);
-
-  erase(it);
-
-  return (1);
-}
-
-PB_ASSOC_CLASS_T_DEC
-void
-PB_ASSOC_CLASS_C_DEC::
-clear()
-{
-  PB_ASSOC_DBG_ONLY(assert_valid();)
-
-    if (m_size == 0)
-      {
-	PB_ASSOC_DBG_ONLY(assert_valid();)
-
-	  return;
-      }
-    else
-      {
-	cond_dtor cd(m_a_values, m_end_it, m_size);
-      }
-
-  PB_ASSOC_DBG_ONLY(my_map_debug_base::clear();)
-
-    m_a_values = NULL;
-
-  m_size = 0;
-
-  m_end_it = m_a_values;
-
-  PB_ASSOC_DBG_ONLY(PB_ASSOC_CLASS_C_DEC::assert_valid();)
-
-    PB_ASSOC_DBG_ONLY(assert_valid();)
-    }
-
-PB_ASSOC_CLASS_T_DEC
-template<class Pred>
-inline typename PB_ASSOC_CLASS_C_DEC::size_type
-PB_ASSOC_CLASS_C_DEC::
-erase_if(Pred pred)
-{
-  PB_ASSOC_DBG_ONLY(PB_ASSOC_CLASS_C_DEC::assert_valid();)
-
-#ifdef PB_ASSOC_BASIC_REGRESSION
-    throw_prob_adjustor adjust(m_size);
-#endif // #ifdef PB_ASSOC_BASIC_REGRESSION
-
-  size_type new_size = 0;
-
-  size_type num_val_ersd = 0;
-
-  iterator source_it = m_a_values;
-
-  for (source_it = begin(); source_it != m_end_it; ++source_it)
-    {
-      if (pred(*source_it))
-	++num_val_ersd;
-      else
-	++new_size;
-    }
-
-  if (new_size == 0)
-    {
-      clear();
-
-      return (num_val_ersd);
-    }
-
-  pointer a_new_values = s_alloc.allocate(new_size);
-
-  iterator target_it = a_new_values;
-
-  cond_dtor cd(a_new_values, target_it, new_size);
-
-  PB_ASSOC_DBG_ONLY(my_map_debug_base::clear());
-
-  for (source_it = begin(); source_it != m_end_it; ++source_it)
-    {
-      if (!pred(*source_it))
-	{
-	  new (const_cast<void* >(
-				  static_cast<const void* >(target_it)))
-	    value_type(*source_it);
-
-	  PB_ASSOC_DBG_ONLY(my_map_debug_base::insert_new(
-							  PB_ASSOC_V2F(*source_it)));
-
-	  ++target_it;
-	}
-    }
-
-  cd.set_no_action();
-
-  {
-    cond_dtor cd1(m_a_values, m_end_it, m_size);
-  }
-
-  m_a_values = a_new_values;
-
-  m_size = new_size;
-
-  m_end_it = target_it;
-
-  PB_ASSOC_DBG_ONLY(assert_valid();)
-
-    return (num_val_ersd);
-}
-
-PB_ASSOC_CLASS_T_DEC
-template<class It>
-It
-PB_ASSOC_CLASS_C_DEC::
-erase(It it)
-{
-  PB_ASSOC_DBG_ONLY(PB_ASSOC_CLASS_C_DEC::assert_valid();)
-
-    if (it == end())
-      return end();
-
-  PB_ASSOC_DBG_ONLY(
-		    PB_ASSOC_CLASS_C_DEC::check_key_exists(PB_ASSOC_V2F(*it));)
-
-#ifdef PB_ASSOC_BASIC_REGRESSION
-    throw_prob_adjustor adjust(m_size);
-#endif // #ifdef PB_ASSOC_BASIC_REGRESSION
-
-  PB_ASSOC_DBG_ASSERT(m_size > 0);
-
-  pointer a_values = s_alloc.allocate(m_size - 1);
-
-  iterator source_it = begin();
-  iterator source_end_it = end();
-  iterator target_it = a_values;
-  iterator ret_it = end();
-
-  cond_dtor cd(a_values, target_it, m_size - 1);
-
-  PB_ASSOC_DBG_ONLY(size_type cnt = 0;)
-
-    while (source_it != source_end_it)
-      {
-	if (source_it != it)
-	  {
-	    PB_ASSOC_DBG_ONLY(++cnt;)
-	      PB_ASSOC_DBG_ASSERT(cnt != m_size);
-
-	    new (const_cast<void* >(
-				    static_cast<const void* >(target_it)))
-	      value_type(*source_it);
-
-	    ++target_it;
-	  }
-	else
-	  ret_it = target_it;
-
-	++source_it;
-      }
-
-  cd.set_no_action();
-
-  PB_ASSOC_DBG_ONLY(
-		    PB_ASSOC_CLASS_C_DEC::erase_existing(PB_ASSOC_V2F(*it));)
-    {
-      cond_dtor cd1(m_a_values, m_end_it, m_size);
-    }
-
-  m_a_values = a_values;
-
-  --m_size;
-
-  m_end_it = m_a_values + m_size;
-
-  update(node_begin(), (Node_Updator* )this);
-
-  PB_ASSOC_DBG_ONLY(PB_ASSOC_CLASS_C_DEC::assert_valid();)
-
-    return (It(ret_it));
-}
-
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/ov_tree_map_/find_fn_imps.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/ov_tree_map_/find_fn_imps.hpp
deleted file mode 100644
index 1615546a412..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/ov_tree_map_/find_fn_imps.hpp
+++ /dev/null
@@ -1,44 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file find_fn_imps.hpp
- * Contains an implementation class for ov_tree_.
- */
-
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/ov_tree_map_/info_fn_imps.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/ov_tree_map_/info_fn_imps.hpp
deleted file mode 100644
index 11ccd3e80e1..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/ov_tree_map_/info_fn_imps.hpp
+++ /dev/null
@@ -1,95 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file info_fn_imps.hpp
- * Contains an implementation class for ov_tree_.
- */
-
-PB_ASSOC_CLASS_T_DEC
-bool
-PB_ASSOC_CLASS_C_DEC::
-cmp_with_other(const PB_ASSOC_CLASS_C_DEC& r_other) const
-{
-  PB_ASSOC_DBG_ONLY(assert_valid();)
-
-    if (size() != r_other.size())
-      return (false);
-
-  const_iterator other_it = r_other.begin();
-  const_iterator it = begin();
-
-  while (it != end())
-    {
-      if (*it !=* other_it)
-	return (false);
-
-      ++it;
-
-      ++other_it;
-    }
-
-  return (true);
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::size_type
-PB_ASSOC_CLASS_C_DEC::
-size() const
-{
-  PB_ASSOC_DBG_ONLY(assert_valid();)
-
-    return (m_size);
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::size_type
-PB_ASSOC_CLASS_C_DEC::
-max_size() const
-{
-  return (s_alloc.max_size());
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline bool
-PB_ASSOC_CLASS_C_DEC::
-empty() const
-{
-  return (size() == 0);
-}
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/ov_tree_map_/insert_fn_imps.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/ov_tree_map_/insert_fn_imps.hpp
deleted file mode 100644
index 072eb0fa6b3..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/ov_tree_map_/insert_fn_imps.hpp
+++ /dev/null
@@ -1,44 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file insert_fn_imps.hpp
- * Contains an implementation class for ov_tree_.
- */
-
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/ov_tree_map_/iterators_fn_imps.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/ov_tree_map_/iterators_fn_imps.hpp
deleted file mode 100644
index 8705b09744a..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/ov_tree_map_/iterators_fn_imps.hpp
+++ /dev/null
@@ -1,44 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file iterators_fn_imps.hpp
- * Contains an implementation class for ov_tree_.
- */
-
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/ov_tree_map_/node_iterators.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/ov_tree_map_/node_iterators.hpp
deleted file mode 100644
index 9ec3cd9d7d1..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/ov_tree_map_/node_iterators.hpp
+++ /dev/null
@@ -1,178 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file node_iterators.hpp
- * Contains an implementation class for ov_tree_.
- */
-
-class const_node_iterator
-{
-
-public:
-
-  typedef trivial_iterator_tag iterator_category;
-
-  typedef trivial_iterator_difference_type difference_type;
-
-  typedef const_iterator value_type;
-
-  typedef const_iterator*  pointer;
-
-  typedef const_iterator*  const_pointer;
-
-  typedef const_iterator&  reference;
-
-  typedef const iterator&  const_reference;
-
-public:
-  inline
-  const_node_iterator(value_pointer p_nd = NULL, value_pointer p_begin_nd = NULL, value_pointer p_end_nd = NULL) : m_p_value(p_nd),
-														   m_p_begin_value(p_begin_nd),
-														   m_p_end_value(p_end_nd)
-  { }
-
-  inline const_iterator
-  operator*() const
-  {
-    return (m_p_value);
-  }
-
-  inline const_node_iterator
-  l_child() const
-  {
-    if (m_p_begin_value == m_p_value)
-      return (const_node_iterator(m_p_begin_value, m_p_begin_value, m_p_begin_value));
-
-    return (const_node_iterator(
-				mid_pointer(m_p_begin_value, m_p_value),
-				m_p_begin_value,
-				m_p_value));
-  }
-
-  inline const_node_iterator
-  r_child() const
-  {
-    if (m_p_value == m_p_end_value)
-      return (const_node_iterator(m_p_end_value, m_p_end_value, m_p_end_value));
-
-    return (const_node_iterator(
-				mid_pointer(m_p_value + 1, m_p_end_value),
-				m_p_value + 1,
-				m_p_end_value));
-  }
-
-  inline bool
-  operator==(const const_node_iterator& r_other) const
-  {
-    const bool is_end = m_p_begin_value == m_p_end_value;
-    const bool is_other_end = r_other.m_p_begin_value == r_other.m_p_end_value;
-
-    if (is_end)
-      return (is_other_end);
-
-    if (is_other_end)
-      return (is_end);
-
-    if (r_other.m_p_begin_value == r_other.m_p_end_value)
-      return (m_p_begin_value == m_p_end_value);
-
-    return (m_p_value == r_other.m_p_value);
-  }
-
-  inline bool
-  operator!=(const const_node_iterator& r_other) const
-  {
-    return (!operator==(r_other));
-  }
-
-private:
-  friend class PB_ASSOC_CLASS_C_DEC;
-
-public:
-  value_pointer m_p_value;
-  value_pointer m_p_begin_value;
-  value_pointer m_p_end_value;
-};
-
-class node_iterator : 
-  public const_node_iterator
-
-{
-
-public:
-  inline
-  node_iterator(value_pointer p_nd = NULL, value_pointer p_begin_nd = NULL, value_pointer p_end_nd = NULL) : const_node_iterator(p_nd, p_begin_nd, p_end_nd)
-  { }
-
-  inline iterator
-  operator*() const
-  {
-    return (iterator(const_node_iterator::m_p_value));
-  }
-
-  inline node_iterator
-  l_child() const
-  {
-    if (const_node_iterator::m_p_begin_value == const_node_iterator::m_p_value)
-      return (node_iterator(const_node_iterator::m_p_begin_value, const_node_iterator::m_p_begin_value, const_node_iterator::m_p_begin_value));
-
-    return (node_iterator(
-			  mid_pointer(const_node_iterator::m_p_begin_value, const_node_iterator::m_p_value),
-			  const_node_iterator::m_p_begin_value,
-			  const_node_iterator::m_p_value));
-  }
-
-  inline node_iterator
-  r_child() const
-  {
-    if (const_node_iterator::m_p_value == const_node_iterator::m_p_end_value)
-      return (node_iterator(const_node_iterator::m_p_end_value, const_node_iterator::m_p_end_value, const_node_iterator::m_p_end_value));
-
-    return (node_iterator(
-			  mid_pointer(const_node_iterator::m_p_value + 1, const_node_iterator::m_p_end_value),
-			  const_node_iterator::m_p_value + 1,
-			  const_node_iterator::m_p_end_value));
-  }
-
-private:
-
-  friend class PB_ASSOC_CLASS_C_DEC;
-};
-
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/ov_tree_map_/ov_tree_map_.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/ov_tree_map_/ov_tree_map_.hpp
deleted file mode 100644
index 94ff223a734..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/ov_tree_map_/ov_tree_map_.hpp
+++ /dev/null
@@ -1,628 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file ov_tree_map_.hpp
- * Contains an implementation class for ov_tree_.
- */
-
-#include <map>
-#include <set>
-#include <ext/pb_assoc/trivial_iterator_def.hpp>
-#include <ext/pb_assoc/tree_policy.hpp>
-#include <ext/pb_assoc/detail/eq_fn/eq_by_less.hpp>
-#include <ext/pb_assoc/detail/types_traits.hpp>
-#include <ext/pb_assoc/detail/map_debug_base.hpp>
-#include <ext/pb_assoc/detail/type_utils.hpp>
-#include <ext/pb_assoc/exception.hpp>
-#include <utility>
-#include <functional>
-#include <algorithm>
-#include <vector>
-#include <cassert>
-#ifdef PB_ASSOC_BASIC_REGRESSION
-#include <pb_assoc/testsuite/regression/basic_test/throw_prob_adjustor.hpp>
-#endif // #ifdef PB_ASSOC_BASIC_REGRESSION
-
-namespace pb_assoc
-{
-
-  namespace detail
-  {
-
-#ifdef PB_ASSOC_OV_TREE_DEBUG_
-#define PB_ASSOC_DBG_ASSERT(X) assert(X);
-#define PB_ASSOC_DBG_VERIFY(X) PB_ASSOC_DBG_ASSERT(X)
-#define PB_ASSOC_DBG_ONLY(X) X
-#else // #ifdef PB_ASSOC_OV_TREE_DEBUG_
-#define PB_ASSOC_DBG_ASSERT(X) ((void)0)
-#define PB_ASSOC_DBG_VERIFY(X) X
-#define PB_ASSOC_DBG_ONLY(X) ;
-#endif // #ifdef PB_ASSOC_OV_TREE_DEBUG_
-
-#define PB_ASSOC_CLASS_T_DEC \
-	template< \
-		typename Key, \
-		typename Data, \
-		class Cmp_Fn, \
-		class Allocator, \
-		class Node_Updator>
-
-#ifdef PB_ASSOC_DATA_TRUE_INDICATOR
-#define PB_ASSOC_OV_TREE_CLASS_NAME \
-	ov_tree_data_
-#endif // #ifdef PB_ASSOC_DATA_TRUE_INDICATOR
-
-#ifdef PB_ASSOC_DATA_FALSE_INDICATOR
-#define PB_ASSOC_OV_TREE_CLASS_NAME \
-	ov_tree_no_data_
-#endif // #ifdef PB_ASSOC_DATA_FALSE_INDICATOR
-
-#define PB_ASSOC_CLASS_C_DEC \
-	PB_ASSOC_OV_TREE_CLASS_NAME< \
-		Key, \
-		Data, \
-		Cmp_Fn, \
-		Allocator, \
-		Node_Updator>
-
-#define PB_ASSOC_TYPES_TRAITS_C_DEC \
-	types_traits< \
-		Key, \
-		Data, \
-		Allocator>
-
-#ifdef PB_ASSOC_USE_MAP_DEBUG_BASE
-#define PB_ASSOC_MAP_DEBUG_BASE_C_DEC \
-	pb_assoc::detail::map_debug_base< \
-		Key, \
-		eq_by_less<Key, Cmp_Fn> >
-#endif // #ifdef PB_ASSOC_USE_MAP_DEBUG_BASE
-
-#ifdef PB_ASSOC_DATA_TRUE_INDICATOR
-#define PB_ASSOC_V2F(X) (X).first
-#define PB_ASSOC_V2S(X) (X).second
-#define PB_ASSOC_EP2VP(X)& ((X)->m_value)
-#endif // #ifdef PB_ASSOC_DATA_TRUE_INDICATOR
-
-#ifdef PB_ASSOC_DATA_FALSE_INDICATOR
-#define PB_ASSOC_V2F(X) (X)
-#define PB_ASSOC_V2S(X) Mapped_Data()
-#define PB_ASSOC_EP2VP(X)& ((X)->m_value.first)
-#endif // #ifdef PB_ASSOC_DATA_FALSE_INDICATOR
-
-    template<typename Key,
-	     typename Data,
-	     class Cmp_Fn,
-	     class Allocator,
-	     class Node_Updator>
-    class PB_ASSOC_OV_TREE_CLASS_NAME :
-#ifdef PB_ASSOC_OV_TREE_DEBUG_
-      protected PB_ASSOC_MAP_DEBUG_BASE_C_DEC,
-#endif // #ifdef PB_ASSOC_OV_TREE_DEBUG_
-      public Cmp_Fn,
-      public PB_ASSOC_TYPES_TRAITS_C_DEC,
-      public Node_Updator
-    {
-
-    protected:
-
-      typedef typename Allocator::size_type size_type;
-
-      typedef typename Allocator::difference_type difference_type;
-
-      typedef
-      typename PB_ASSOC_TYPES_TRAITS_C_DEC::const_key_reference
-      const_key_reference;
-
-      typedef typename PB_ASSOC_TYPES_TRAITS_C_DEC::data_type data_type;
-
-      typedef
-      typename PB_ASSOC_TYPES_TRAITS_C_DEC::data_reference
-      data_reference;
-
-      typedef
-      typename PB_ASSOC_TYPES_TRAITS_C_DEC::const_data_reference
-      const_data_reference;
-
-      typedef typename PB_ASSOC_TYPES_TRAITS_C_DEC::value_type value_type;
-
-      typedef typename PB_ASSOC_TYPES_TRAITS_C_DEC::pointer pointer;
-
-      typedef
-      typename PB_ASSOC_TYPES_TRAITS_C_DEC::const_pointer
-      const_pointer;
-
-      typedef typename PB_ASSOC_TYPES_TRAITS_C_DEC::reference reference;
-
-      typedef
-      typename PB_ASSOC_TYPES_TRAITS_C_DEC::const_reference
-      const_reference;
-
-      typedef const_pointer const_find_iterator;
-
-      typedef pointer find_iterator;
-
-      typedef const_find_iterator const_iterator;
-
-      typedef find_iterator iterator;
-
-      typedef pointer value_pointer;
-
-#include <ext/pb_assoc/detail/ov_tree_map_/node_iterators.hpp>
-
-#include <ext/pb_assoc/detail/ov_tree_map_/cond_dtor.hpp>
-
-      typedef Cmp_Fn cmp_fn;
-
-      typedef Allocator allocator;
-
-      typedef PB_ASSOC_TYPES_TRAITS_C_DEC my_traits_base;
-
-      typedef cmp_fn my_cmp_fn_base;
-
-#ifdef PB_ASSOC_USE_MAP_DEBUG_BASE
-      typedef PB_ASSOC_MAP_DEBUG_BASE_C_DEC my_map_debug_base;
-#endif // #ifdef PB_ASSOC_USE_MAP_DEBUG_BASE
-
-    protected:
-
-      PB_ASSOC_OV_TREE_CLASS_NAME();
-
-      PB_ASSOC_OV_TREE_CLASS_NAME(const Cmp_Fn& r_cmp_fn);
-
-      PB_ASSOC_OV_TREE_CLASS_NAME(const Cmp_Fn& r_cmp_fn, const Node_Updator& r_node_updator);
-
-      PB_ASSOC_OV_TREE_CLASS_NAME(const PB_ASSOC_CLASS_C_DEC& r_other);
-
-      ~PB_ASSOC_OV_TREE_CLASS_NAME();
-
-      void
-      swap(PB_ASSOC_CLASS_C_DEC& r_other);
-
-      template<class It>
-      void
-      copy_from_range(It first_it, It last_it);
-
-      template<class Node_Updator_>
-      void
-      update(node_iterator it, Node_Updator_* p_updator)
-      {
-	if (it == node_end())
-	  return;
-
-	update(it.l_child(), p_updator);
-	update(it.r_child(), p_updator);
-
-	p_updator->operator()(it.m_p_value,(it.l_child() == node_end())? NULL : it.l_child().m_p_value,(it.r_child() == node_end())? NULL : it.r_child().m_p_value);
-      }
-
-      inline void
-      update(node_iterator /*it*/, pb_assoc::null_node_updator* )
-      { }
-
-      bool
-      cmp_with_other(const PB_ASSOC_CLASS_C_DEC& r_other) const;
-
-      inline size_type
-      max_size() const;
-
-      inline bool
-      empty() const;
-
-      inline size_type
-      size() const;
-
-      Cmp_Fn& 
-      get_cmp_fn();
-
-      const Cmp_Fn& 
-      get_cmp_fn() const;
-
-#ifdef PB_ASSOC_DATA_TRUE_INDICATOR
-      inline data_reference
-      subscript_imp(const_key_reference r_key)
-      {
-	PB_ASSOC_DBG_ONLY(assert_valid();)
-
-	  find_iterator it = lower_bound(r_key);
-
-	if (it != find_end()&&  !Cmp_Fn::operator()(
-						    r_key,
-						    PB_ASSOC_V2F(*it)))
-	  {
-	    PB_ASSOC_DBG_ONLY(my_map_debug_base::check_key_exists(r_key));
-
-	    PB_ASSOC_DBG_ONLY(assert_valid();)
-
-	      return (it->second);
-	  }
-
-	PB_ASSOC_DBG_ONLY(assert_valid();)
-
-	  return (insert_new_val(it,
-				 std::make_pair(r_key, data_type()))->second);
-      }
-
-      inline const_data_reference
-      subscript_imp(const_key_reference r_key) const
-      {
-	PB_ASSOC_DBG_ONLY(assert_valid();)
-
-	  PB_ASSOC_DBG_ONLY(my_map_debug_base::check_key_exists(r_key));
-
-	find_iterator it =	 lower_bound(r_key);
-
-	PB_ASSOC_DBG_ASSERT(it != find_end());
-
-	return (it->second);
-      }
-#endif // #ifdef PB_ASSOC_DATA_TRUE_INDICATOR
-
-      inline std::pair<find_iterator, bool>
-      insert(const_reference r_value)
-      {
-	PB_ASSOC_DBG_ONLY(assert_valid();)
-
-	  const_key_reference r_key = PB_ASSOC_V2F(r_value);
-
-	find_iterator it = lower_bound(r_key);
-
-	if (it != find_end()&&  !Cmp_Fn::operator()(
-						    r_key,
-						    PB_ASSOC_V2F(*it)))
-	  {
-	    PB_ASSOC_DBG_ONLY(assert_valid();)
-
-	      PB_ASSOC_DBG_ONLY(my_map_debug_base::check_key_exists(r_key));
-
-	    return (std::make_pair(it, false));
-	  }
-
-	PB_ASSOC_DBG_ONLY(assert_valid();)
-
-	  return (std::make_pair(insert_new_val(it, r_value), true));
-      }
-
-      inline static pointer
-      mid_pointer(pointer p_begin, pointer p_end)
-      {
-	PB_ASSOC_DBG_ASSERT(p_end >= p_begin);
-
-	return (p_begin + (p_end - p_begin) / 2);
-      }
-
-      inline find_iterator
-      lower_bound(const_key_reference r_key)
-      {
-	pointer it = m_a_values;
-
-	difference_type dist = m_size;
-
-	while (dist > 0)
-	  {
-	    const difference_type mid_dist  = dist >> 1;
-
-	    pointer mid_it = it + mid_dist;
-
-	    if (my_cmp_fn_base::operator()(
-					   PB_ASSOC_V2F(*(it + mid_dist)),
-					   r_key))
-	      {
-		it = ++mid_it;
-
-		dist -= mid_dist + 1;
-	      }
-	    else
-	      dist = mid_dist;
-	  }
-
-	return (it);
-      }
-
-      inline const_find_iterator
-      lower_bound(const_key_reference r_key) const
-      {
-	return (const_cast<PB_ASSOC_CLASS_C_DEC& >(*this).lower_bound(r_key));
-      }
-
-      inline find_iterator
-      upper_bound(const_key_reference r_key)
-      {
-	iterator pot_it = lower_bound(r_key);
-
-	if (pot_it != find_end()&&  !Cmp_Fn::operator()(
-							r_key,
-							PB_ASSOC_V2F(*pot_it)))
-	  {
-	    PB_ASSOC_DBG_ONLY(my_map_debug_base::check_key_exists(r_key));
-
-	    return (++pot_it);
-	  }
-
-	PB_ASSOC_DBG_ONLY(my_map_debug_base::check_key_does_not_exist(r_key));
-
-	return (pot_it);
-      }
-
-      inline const_find_iterator
-      upper_bound(const_key_reference r_key) const
-      {
-	return (const_cast<PB_ASSOC_CLASS_C_DEC& >(*this).upper_bound(r_key));
-      }
-
-      inline find_iterator
-      find(const_key_reference r_key)
-      {
-	PB_ASSOC_DBG_ONLY(assert_valid();)
-
-	  iterator pot_it = lower_bound(r_key);
-
-	if (pot_it != find_end()&&  !Cmp_Fn::operator()(
-							r_key,
-							PB_ASSOC_V2F(*pot_it)))
-	  {
-	    PB_ASSOC_DBG_ONLY(my_map_debug_base::check_key_exists(r_key));
-
-	    return (pot_it);
-	  }
-
-	PB_ASSOC_DBG_ONLY(my_map_debug_base::check_key_does_not_exist(r_key));
-
-	return (find_end());
-      }
-
-      inline const_find_iterator
-      find(const_key_reference r_key) const
-      {
-	return (const_cast<PB_ASSOC_CLASS_C_DEC& >(*this).find(r_key));
-      }
-
-      inline size_type
-      erase(const_key_reference r_key);
-
-      template<class Pred>
-      inline size_type
-      erase_if(Pred pred);
-
-      template<class It>
-      inline It
-      erase(It it);
-
-      void
-      clear();
-
-      void
-      join(PB_ASSOC_CLASS_C_DEC& r_other);
-
-      void
-      split(const_key_reference r_key, PB_ASSOC_CLASS_C_DEC& r_other);
-
-      inline iterator
-      begin()
-      {
-	return (m_a_values);
-      }
-
-      inline const_iterator
-      begin() const
-      {
-	return (m_a_values);
-      }
-
-      inline iterator
-      find_end()
-      {
-	return (end());
-      }
-
-      inline const_iterator
-      find_end() const
-      {
-	return (end());
-      }
-
-      inline iterator
-      end()
-      {
-	return (m_end_it);
-      }
-
-      inline const_iterator
-      end() const
-      {
-	return (m_end_it);
-      }
-
-      inline const_node_iterator
-      node_begin() const
-      {
-	return (const_node_iterator(mid_pointer(begin(), end()), begin(), end()));
-      }
-
-      inline node_iterator
-      node_begin()
-      {
-	return (node_iterator(mid_pointer(begin(), end()), begin(), end()));
-      }
-
-      inline const_node_iterator
-      node_end() const
-      {
-	return (const_node_iterator(end(), end(), end()));
-      }
-
-      inline node_iterator
-      node_end()
-      {
-	return (node_iterator(end(), end(), end()));
-      }
-
-    private:
-
-      inline pointer
-      insert_new_val(iterator it, const_reference r_value)
-      {
-	PB_ASSOC_DBG_ONLY(assert_valid();)
-
-#ifdef PB_ASSOC_BASIC_REGRESSION
-	  throw_prob_adjustor adjust(m_size);
-#endif // #ifdef PB_ASSOC_BASIC_REGRESSION
-
-	PB_ASSOC_DBG_ONLY(my_map_debug_base::check_key_does_not_exist(
-								      PB_ASSOC_V2F(r_value)));
-
-	pointer a_values = s_alloc.allocate(m_size + 1);
-
-	iterator source_it = begin();
-	iterator source_end_it = end();
-	iterator target_it = a_values;
-	iterator ret_it;
-
-	cond_dtor cd(a_values, target_it, m_size + 1);
-
-	while (source_it != it)
-	  {
-	    new (const_cast<void* >(
-				    static_cast<const void* >(target_it)))
-	      value_type(*source_it++);
-
-	    ++target_it;
-	  }
-
-	new (const_cast<void* >(
-				static_cast<const void* >(ret_it = target_it)))
-	  value_type(r_value);
-
-	++target_it;
-
-	while (source_it != source_end_it)
-	  {
-	    new (const_cast<void* >(
-				    static_cast<const void* >(target_it)))
-	      value_type(*source_it++);
-
-	    ++target_it;
-	  }
-
-	cd.set_no_action();
-
-	if (m_size != 0)
-	  {
-	    cond_dtor cd1(m_a_values, m_end_it, m_size);
-	  }
-
-	++m_size;
-
-	m_a_values = a_values;
-
-	m_end_it = m_a_values + m_size;
-
-	PB_ASSOC_DBG_ONLY(my_map_debug_base::insert_new(
-							PB_ASSOC_V2F(r_value)));
-
-	update(node_begin(), (Node_Updator* )this);
-
-	PB_ASSOC_DBG_ONLY(PB_ASSOC_CLASS_C_DEC::assert_valid();)
-
-	  return (ret_it);
-      }
-
-#ifdef PB_ASSOC_OV_TREE_DEBUG_
-
-      virtual void
-      assert_valid() const;
-
-      void
-      assert_iterators() const;
-
-#endif // #ifdef PB_ASSOC_OV_TREE_DEBUG_
-
-      template<class It>
-      void
-      copy_from_ordered_range(It first_it, It last_it);
-
-      template<class It>
-      void
-      copy_from_ordered_range(It first_it, It last_it, It other_first_it, It other_last_it);
-
-    private:
-      typedef
-      typename PB_ASSOC_TYPES_TRAITS_C_DEC::value_type_allocator
-      value_allocator;
-
-      pointer m_a_values;
-
-      static value_allocator s_alloc;
-
-      pointer m_end_it;
-
-      size_type m_size;
-    };
-
-#include <ext/pb_assoc/detail/ov_tree_map_/constructors_destructor_fn_imps.hpp>
-#include <ext/pb_assoc/detail/ov_tree_map_/iterators_fn_imps.hpp>
-#include <ext/pb_assoc/detail/ov_tree_map_/debug_fn_imps.hpp>
-#include <ext/pb_assoc/detail/ov_tree_map_/erase_fn_imps.hpp>
-#include <ext/pb_assoc/detail/ov_tree_map_/insert_fn_imps.hpp>
-#include <ext/pb_assoc/detail/ov_tree_map_/find_fn_imps.hpp>
-#include <ext/pb_assoc/detail/ov_tree_map_/info_fn_imps.hpp>
-#include <ext/pb_assoc/detail/ov_tree_map_/split_join_fn_imps.hpp>
-
-#undef PB_ASSOC_CLASS_C_DEC
-
-#undef PB_ASSOC_CLASS_T_DEC
-
-#undef PB_ASSOC_OV_TREE_CLASS_NAME
-
-#undef PB_ASSOC_TYPES_TRAITS_C_DEC
-
-#undef PB_ASSOC_MAP_DEBUG_BASE_C_DEC
-
-#undef PB_ASSOC_V2F
-#undef PB_ASSOC_EP2VP
-#undef PB_ASSOC_V2S
-
-#undef PB_ASSOC_DBG_ASSERT
-#undef PB_ASSOC_DBG_VERIFY
-#undef PB_ASSOC_DBG_ONLY
-
-  } // namespace detail
-
-} // namespace pb_assoc
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/ov_tree_map_/split_join_fn_imps.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/ov_tree_map_/split_join_fn_imps.hpp
deleted file mode 100644
index b93084bf386..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/ov_tree_map_/split_join_fn_imps.hpp
+++ /dev/null
@@ -1,189 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file split_join_fn_imps.hpp
- * Contains an implementation class for ov_tree_.
- */
-
-PB_ASSOC_CLASS_T_DEC
-void
-PB_ASSOC_CLASS_C_DEC::
-split(const_key_reference r_key, PB_ASSOC_CLASS_C_DEC& r_other)
-{
-  PB_ASSOC_DBG_ONLY(assert_valid();)
-    PB_ASSOC_DBG_ONLY(r_other.assert_valid();)
-
-    if (m_size == 0)
-      {
-	r_other.clear();
-
-	PB_ASSOC_DBG_ONLY(assert_valid();)
-	  PB_ASSOC_DBG_ONLY(r_other.assert_valid();)
-
-	  return;
-      }
-
-  if (Cmp_Fn::operator()(r_key, PB_ASSOC_V2F(*begin())))
-    {
-      swap(r_other);
-
-      PB_ASSOC_DBG_ONLY(assert_valid();)
-	PB_ASSOC_DBG_ONLY(r_other.assert_valid();)
-
-	return;
-    }
-
-  if (!Cmp_Fn::operator()(
-			  r_key,
-			  PB_ASSOC_V2F(*(end() - 1))))
-    {
-      PB_ASSOC_DBG_ONLY(assert_valid();)
-	PB_ASSOC_DBG_ONLY(r_other.assert_valid();)
-
-	return;
-    }
-
-  if (m_size == 1)
-    {
-      swap(r_other);
-
-      PB_ASSOC_DBG_ONLY(assert_valid();)
-	PB_ASSOC_DBG_ONLY(r_other.assert_valid();)
-
-	return;
-    }
-
-#ifdef PB_ASSOC_BIN_SEARCH_TREE_DEBUG_
-  for (const_iterator it = begin(); it != end(); ++it)
-    if (Cmp_Fn::operator()(
-			   r_key,
-			   PB_ASSOC_V2F(*it)))
-      {
-	my_map_debug_base::erase_existing(PB_ASSOC_V2F(*it));
-	r_other.my_map_debug_base::insert_new(PB_ASSOC_V2F(*it));
-      }
-#endif // PB_ASSOC_BIN_SEARCH_TREE_DEBUG_
-
-  iterator it = upper_bound(r_key);
-
-  PB_ASSOC_CLASS_C_DEC new_other(r_other, r_other);
-
-  new_other.copy_from_ordered_range(it, end());
-
-  PB_ASSOC_CLASS_C_DEC new_this(*this, * this);
-
-  new_this.copy_from_ordered_range(begin(), it);
-
-  // No exceptions from this point.
-
-  r_other.update(r_other.node_begin(), (Node_Updator* )(&r_other));
-
-  update(node_begin(), (Node_Updator* )this);
-
-  r_other.swap(new_other);
-
-  swap(new_this);
-
-  PB_ASSOC_DBG_ONLY(assert_valid();)
-    PB_ASSOC_DBG_ONLY(r_other.assert_valid();)
-    }
-
-PB_ASSOC_CLASS_T_DEC
-void
-PB_ASSOC_CLASS_C_DEC::
-join(PB_ASSOC_CLASS_C_DEC& r_other)
-{
-  PB_ASSOC_DBG_ONLY(assert_valid();)
-    PB_ASSOC_DBG_ONLY(r_other.assert_valid();)
-
-    if (r_other.m_size == 0)
-      return;
-
-  if (m_size == 0)
-    {
-      swap(r_other);
-
-      return;
-    }
-
-  const bool greater = Cmp_Fn::operator()(
-					  PB_ASSOC_V2F(*(end() - 1)),
-					  PB_ASSOC_V2F(*r_other.begin()));
-
-  const bool lesser = Cmp_Fn::operator()(
-					 PB_ASSOC_V2F(*(r_other.end() - 1)),
-					 PB_ASSOC_V2F(*begin()));
-
-  if (!greater&&  !lesser)
-    throw cannot_join();
-
-#ifdef PB_ASSOC_BIN_SEARCH_TREE_DEBUG_
-  for (const_iterator other_it = r_other.begin(); other_it != r_other.end();
-       ++other_it)
-    {
-      my_map_debug_base::insert_new(PB_ASSOC_V2F(*other_it));
-      r_other.my_map_debug_base::erase_existing(PB_ASSOC_V2F(*other_it));
-    }
-#endif // PB_ASSOC_BIN_SEARCH_TREE_DEBUG_
-
-  PB_ASSOC_CLASS_C_DEC new_this(*this, * this);
-
-  if (greater)
-    new_this.copy_from_ordered_range(
-				     begin(),
-				     end(),
-				     r_other.begin(),
-				     r_other.end());
-  else
-    new_this.copy_from_ordered_range(
-				     r_other.begin(),
-				     r_other.end(),
-				     begin(),
-				     end());
-
-  // No exceptions from this point.
-
-  swap(new_this);
-
-  r_other.clear();
-
-  PB_ASSOC_DBG_ONLY(assert_valid();)
-    PB_ASSOC_DBG_ONLY(r_other.assert_valid();)
-    }
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/rb_tree_map_/constructors_destructor_fn_imps.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/rb_tree_map_/constructors_destructor_fn_imps.hpp
deleted file mode 100644
index eacdffd027c..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/rb_tree_map_/constructors_destructor_fn_imps.hpp
+++ /dev/null
@@ -1,116 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file constructors_destructor_fn_imps.hpp
- * Contains an implementation for rb_tree_.
- */
-
-PB_ASSOC_CLASS_T_DEC
-template<class It>
-void
-PB_ASSOC_CLASS_C_DEC::
-copy_from_range(It first_it, It last_it)
-{
-  while (first_it != last_it)
-    insert(*(first_it++));
-}
-
-PB_ASSOC_CLASS_T_DEC
-PB_ASSOC_CLASS_C_DEC::
-PB_ASSOC_CLASS_NAME()
-{
-  initialize();
-
-  PB_ASSOC_DBG_ONLY(PB_ASSOC_CLASS_C_DEC::assert_valid();)
-    PB_ASSOC_DBG_ONLY(PB_ASSOC_BASE_C_DEC::assert_valid(true, true);)
-    }
-
-PB_ASSOC_CLASS_T_DEC
-PB_ASSOC_CLASS_C_DEC::
-PB_ASSOC_CLASS_NAME(const Cmp_Fn& r_cmp_fn) :
-  PB_ASSOC_BASE_C_DEC(r_cmp_fn)
-{
-  initialize();
-
-  PB_ASSOC_DBG_ONLY(PB_ASSOC_CLASS_C_DEC::assert_valid();)
-    }
-
-PB_ASSOC_CLASS_T_DEC
-PB_ASSOC_CLASS_C_DEC::
-PB_ASSOC_CLASS_NAME(const Cmp_Fn& r_cmp_fn, const Node_Updator& r_node_updator) :
-  PB_ASSOC_BASE_C_DEC(r_cmp_fn, r_node_updator)
-{
-  initialize();
-
-  PB_ASSOC_DBG_ONLY(PB_ASSOC_CLASS_C_DEC::assert_valid();)
-    }
-
-PB_ASSOC_CLASS_T_DEC
-PB_ASSOC_CLASS_C_DEC::
-PB_ASSOC_CLASS_NAME(const PB_ASSOC_CLASS_C_DEC& r_other) :
-  PB_ASSOC_BASE_C_DEC(r_other)
-{
-  initialize();
-
-  PB_ASSOC_DBG_ONLY(PB_ASSOC_CLASS_C_DEC::assert_valid();)
-    PB_ASSOC_DBG_ONLY(PB_ASSOC_BASE_C_DEC::assert_valid(true, true);)
-    }
-
-PB_ASSOC_CLASS_T_DEC
-void
-PB_ASSOC_CLASS_C_DEC::
-swap(PB_ASSOC_CLASS_C_DEC& r_other)
-{
-  PB_ASSOC_DBG_ONLY(PB_ASSOC_CLASS_C_DEC::assert_valid();)
-    PB_ASSOC_DBG_ONLY(r_other.PB_ASSOC_CLASS_C_DEC::assert_valid();)
-
-    PB_ASSOC_BASE_C_DEC::swap(r_other);
-
-  PB_ASSOC_DBG_ONLY(PB_ASSOC_CLASS_C_DEC::assert_valid();)
-    PB_ASSOC_DBG_ONLY(r_other.PB_ASSOC_CLASS_C_DEC::assert_valid();)
-    }
-
-PB_ASSOC_CLASS_T_DEC
-void
-PB_ASSOC_CLASS_C_DEC::
-initialize()
-{
-  PB_ASSOC_BASE_C_DEC::m_p_head->m_red = true;
-}
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/rb_tree_map_/debug_fn_imps.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/rb_tree_map_/debug_fn_imps.hpp
deleted file mode 100644
index e3ae668850f..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/rb_tree_map_/debug_fn_imps.hpp
+++ /dev/null
@@ -1,87 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file debug_fn_imps.hpp
- * Contains an implementation for rb_tree_.
- */
-
-#ifdef PB_ASSOC_RB_TREE_DEBUG_
-
-PB_ASSOC_CLASS_T_DEC
-typename PB_ASSOC_CLASS_C_DEC::size_type
-PB_ASSOC_CLASS_C_DEC::
-assert_node_consistent(const node_pointer p_nd) const
-{
-  if (p_nd == NULL)
-    return (1);
-
-  const size_type l_height = assert_node_consistent(p_nd->m_p_left);
-  const size_type r_height = assert_node_consistent(p_nd->m_p_right);
-
-  if (p_nd->m_red)
-    {
-      PB_ASSOC_DBG_ASSERT(is_effectively_black(p_nd->m_p_left));
-
-      PB_ASSOC_DBG_ASSERT(is_effectively_black(p_nd->m_p_right));
-    }
-
-  PB_ASSOC_DBG_ASSERT(l_height == r_height);
-
-  return ((p_nd->m_red? 0 : 1) + l_height);
-}
-
-PB_ASSOC_CLASS_T_DEC
-void
-PB_ASSOC_CLASS_C_DEC::
-assert_valid() const
-{
-  PB_ASSOC_DBG_ASSERT(PB_ASSOC_BASE_C_DEC::m_p_head->m_red);
-
-  if (PB_ASSOC_BASE_C_DEC::m_p_head->m_p_parent != NULL)
-    {
-      PB_ASSOC_DBG_ASSERT(PB_ASSOC_BASE_C_DEC::m_p_head->m_p_parent->m_red
-			  == false);
-
-      assert_node_consistent(PB_ASSOC_BASE_C_DEC::m_p_head->m_p_parent);
-    }
-}
-
-#endif // #ifdef PB_ASSOC_RB_TREE_DEBUG_
-
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/rb_tree_map_/erase_fn_imps.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/rb_tree_map_/erase_fn_imps.hpp
deleted file mode 100644
index e137fb7cad2..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/rb_tree_map_/erase_fn_imps.hpp
+++ /dev/null
@@ -1,403 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file erase_fn_imps.hpp
- * Contains an implementation for rb_tree_.
- */
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::size_type
-PB_ASSOC_CLASS_C_DEC::
-erase(const_key_reference r_key)
-{
-  iterator it = find(r_key);
-
-  if (it == PB_ASSOC_BASE_C_DEC::find_end())
-    return (0);
-
-  erase(it);
-
-  return (1);
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::const_iterator
-PB_ASSOC_CLASS_C_DEC::
-erase(const_iterator it)
-{
-  PB_ASSOC_DBG_ONLY(assert_valid());
-  PB_ASSOC_DBG_ONLY(PB_ASSOC_BASE_C_DEC::assert_valid(true, false);)
-
-    if (it == PB_ASSOC_BASE_C_DEC::find_end())
-      return (it);
-
-  const_iterator ret_it = it;
-
-  ++ret_it;
-
-  erase_node(it.m_p_nd);
-
-  PB_ASSOC_DBG_ONLY(assert_valid());
-  PB_ASSOC_DBG_ONLY(PB_ASSOC_BASE_C_DEC::assert_valid(true, false);)
-
-    return (ret_it);
-}
-
-#ifdef PB_ASSOC_DATA_TRUE_INDICATOR
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::iterator
-PB_ASSOC_CLASS_C_DEC::
-erase(iterator it)
-{
-  PB_ASSOC_DBG_ONLY(PB_ASSOC_CLASS_C_DEC::assert_valid());
-  PB_ASSOC_DBG_ONLY(PB_ASSOC_BASE_C_DEC::assert_iterators();)
-
-    if (it == PB_ASSOC_BASE_C_DEC::find_end())
-      return (it);
-
-  iterator ret_it = it;
-
-  ++ret_it;
-
-  erase_node(it.m_p_nd);
-
-  PB_ASSOC_DBG_ONLY(PB_ASSOC_CLASS_C_DEC::assert_valid());
-  PB_ASSOC_DBG_ONLY(PB_ASSOC_BASE_C_DEC::assert_iterators();)
-
-    return (ret_it);
-}
-#endif // #ifdef PB_ASSOC_DATA_TRUE_INDICATOR
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::const_reverse_iterator
-PB_ASSOC_CLASS_C_DEC::
-erase(const_reverse_iterator it)
-{
-  PB_ASSOC_DBG_ONLY(PB_ASSOC_CLASS_C_DEC::assert_valid());
-  PB_ASSOC_DBG_ONLY(PB_ASSOC_BASE_C_DEC::assert_iterators();)
-
-    if (it == PB_ASSOC_BASE_C_DEC::find_rend())
-      return (it);
-
-  const_reverse_iterator ret_it = it;
-
-  ++ret_it;
-
-  erase_node(it.m_p_nd);
-
-  PB_ASSOC_DBG_ONLY(PB_ASSOC_CLASS_C_DEC::assert_valid());
-  PB_ASSOC_DBG_ONLY(PB_ASSOC_BASE_C_DEC::assert_iterators();)
-
-    return (ret_it);
-}
-
-#ifdef PB_ASSOC_DATA_TRUE_INDICATOR
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::reverse_iterator
-PB_ASSOC_CLASS_C_DEC::
-erase(reverse_iterator it)
-{
-  PB_ASSOC_DBG_ONLY(PB_ASSOC_CLASS_C_DEC::assert_valid());
-
-  if (it == PB_ASSOC_BASE_C_DEC::find_rend())
-    return (it);
-
-  reverse_iterator ret_it = it;
-
-  ++ret_it;
-
-  erase_node(it.m_p_nd);
-
-  PB_ASSOC_DBG_ONLY(PB_ASSOC_CLASS_C_DEC::assert_valid());
-
-  return (ret_it);
-}
-#endif // #ifdef PB_ASSOC_DATA_TRUE_INDICATOR
-
-PB_ASSOC_CLASS_T_DEC
-template<class Pred>
-inline typename PB_ASSOC_CLASS_C_DEC::size_type
-PB_ASSOC_CLASS_C_DEC::
-erase_if(Pred pred)
-{
-  PB_ASSOC_DBG_ONLY(PB_ASSOC_CLASS_C_DEC::assert_valid();)
-
-    size_type num_ersd = 0;
-
-  iterator it = PB_ASSOC_BASE_C_DEC::begin();
-
-  while (it != PB_ASSOC_BASE_C_DEC::end())
-    if (pred(*it))
-      {
-	++num_ersd;
-
-	it = erase(it);
-      }
-    else
-      ++it;
-
-  PB_ASSOC_DBG_ONLY(PB_ASSOC_CLASS_C_DEC::assert_valid();)
-
-    return (num_ersd);
-}
-
-PB_ASSOC_CLASS_T_DEC
-void
-PB_ASSOC_CLASS_C_DEC::
-erase_node(node_pointer p_nd)
-{
-  remove_node(p_nd);
-
-  PB_ASSOC_BASE_C_DEC::actual_erase_node(p_nd);
-
-  PB_ASSOC_DBG_ONLY(assert_valid());
-  PB_ASSOC_DBG_ONLY(PB_ASSOC_BASE_C_DEC::assert_valid(true, false);)
-    }
-
-PB_ASSOC_CLASS_T_DEC
-void
-PB_ASSOC_CLASS_C_DEC::
-remove_node(node_pointer p_z)
-{
-  update_min_max_for_erased_node(p_z);
-
-  node_pointer p_y = p_z;
-
-  node_pointer p_x = NULL;
-
-  node_pointer p_new_x_parent = NULL;
-
-  if (p_y->m_p_left == NULL)
-    p_x = p_y->m_p_right;
-  else if (p_y->m_p_right == NULL)
-    p_x = p_y->m_p_left;
-  else
-    {
-      p_y = p_y->m_p_right;
-
-      while (p_y->m_p_left != NULL)
-	p_y = p_y->m_p_left;
-
-      p_x = p_y->m_p_right;
-    }
-
-  if (p_y == p_z)
-    {
-      p_new_x_parent = p_y->m_p_parent;
-
-      if (p_x != NULL)
-	p_x->m_p_parent = p_y->m_p_parent;
-
-      if (PB_ASSOC_BASE_C_DEC::m_p_head->m_p_parent == p_z)
-	PB_ASSOC_BASE_C_DEC::m_p_head->m_p_parent = p_x;
-      else if (p_z->m_p_parent->m_p_left == p_z)
-	{
-	  p_y->m_p_left = p_z->m_p_parent;
-
-	  p_z->m_p_parent->m_p_left = p_x;
-	}
-      else
-	{
-	  p_y->m_p_left = NULL;
-
-	  p_z->m_p_parent->m_p_right = p_x;
-	}
-    }
-  else
-    {
-      p_z->m_p_left->m_p_parent = p_y;
-
-      p_y->m_p_left = p_z->m_p_left;
-
-      if (p_y != p_z->m_p_right)
-	{
-	  p_new_x_parent = p_y->m_p_parent;
-
-	  if (p_x != NULL)
-	    p_x->m_p_parent = p_y->m_p_parent;
-
-	  p_y->m_p_parent->m_p_left = p_x;
-
-	  p_y->m_p_right = p_z->m_p_right;
-
-	  p_z->m_p_right->m_p_parent = p_y;
-	}
-      else
-	p_new_x_parent = p_y;
-
-      if (PB_ASSOC_BASE_C_DEC::m_p_head->m_p_parent == p_z)
-	PB_ASSOC_BASE_C_DEC::m_p_head->m_p_parent = p_y;
-      else if (p_z->m_p_parent->m_p_left == p_z)
-	p_z->m_p_parent->m_p_left = p_y;
-      else
-	p_z->m_p_parent->m_p_right = p_y;
-
-      p_y->m_p_parent = p_z->m_p_parent;
-
-      std::swap(p_y->m_red, p_z->m_red);
-
-      p_y = p_z;
-    }
-
-  update_to_top(p_new_x_parent, (Node_Updator* )this);
-
-  if (p_y->m_red)
-    return;
-
-  remove_fixup(p_x, p_new_x_parent);
-}
-
-PB_ASSOC_CLASS_T_DEC
-void
-PB_ASSOC_CLASS_C_DEC::
-remove_fixup(node_pointer p_x, node_pointer p_new_x_parent)
-{
-  PB_ASSOC_DBG_ASSERT(p_x == NULL || p_x->m_p_parent == p_new_x_parent);
-
-  while (p_x != PB_ASSOC_BASE_C_DEC::m_p_head->m_p_parent&& 
-	 is_effectively_black(p_x))
-    if (p_x == p_new_x_parent->m_p_left)
-      {
-	node_pointer p_w = p_new_x_parent->m_p_right;
-
-	if (p_w->m_red)
-	  {
-	    p_w->m_red = false;
-
-	    p_new_x_parent->m_red = true;
-
-	    PB_ASSOC_BASE_C_DEC::rotate_left(p_new_x_parent);
-
-	    p_w = p_new_x_parent->m_p_right;
-	  }
-
-	if (is_effectively_black(p_w->m_p_left)&& 
-	    is_effectively_black(p_w->m_p_right))
-	  {
-	    p_w->m_red = true;
-
-	    p_x = p_new_x_parent;
-
-	    p_new_x_parent = p_new_x_parent->m_p_parent;
-	  }
-	else
-	  {
-	    if (is_effectively_black(p_w->m_p_right))
-	      {
-		if (p_w->m_p_left != NULL)
-		  p_w->m_p_left->m_red = false;
-
-		p_w->m_red = true;
-
-		PB_ASSOC_BASE_C_DEC::rotate_right(p_w);
-
-		p_w = p_new_x_parent->m_p_right;
-	      }
-
-	    p_w->m_red = p_new_x_parent->m_red;
-
-	    p_new_x_parent->m_red = false;
-
-	    if (p_w->m_p_right != NULL)
-	      p_w->m_p_right->m_red = false;
-
-	    PB_ASSOC_BASE_C_DEC::rotate_left(p_new_x_parent);
-
-	    update_to_top(p_new_x_parent, (Node_Updator* )this);
-
-	    break;
-	  }
-      }
-    else
-      {
-	node_pointer p_w = p_new_x_parent->m_p_left;
-
-	if (p_w->m_red == true)
-	  {
-	    p_w->m_red = false;
-
-	    p_new_x_parent->m_red = true;
-
-	    PB_ASSOC_BASE_C_DEC::rotate_right(p_new_x_parent);
-
-	    p_w = p_new_x_parent->m_p_left;
-	  }
-
-	if (is_effectively_black(p_w->m_p_right)&& 
-	    is_effectively_black(p_w->m_p_left))
-	  {
-	    p_w->m_red = true;
-
-	    p_x = p_new_x_parent;
-
-	    p_new_x_parent = p_new_x_parent->m_p_parent;
-	  }
-	else
-	  {
-	    if (is_effectively_black(p_w->m_p_left))
-	      {
-		if (p_w->m_p_right != NULL)
-		  p_w->m_p_right->m_red = false;
-
-		p_w->m_red = true;
-
-		PB_ASSOC_BASE_C_DEC::rotate_left(p_w);
-
-		p_w = p_new_x_parent->m_p_left;
-	      }
-
-	    p_w->m_red = p_new_x_parent->m_red;
-
-	    p_new_x_parent->m_red = false;
-
-	    if (p_w->m_p_left != NULL)
-	      p_w->m_p_left->m_red = false;
-
-	    PB_ASSOC_BASE_C_DEC::rotate_right(p_new_x_parent);
-
-	    update_to_top(p_new_x_parent, (Node_Updator* )this);
-
-	    break;
-	  }
-      }
-
-  if (p_x != NULL)
-    p_x->m_red = false;
-}
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/rb_tree_map_/find_fn_imps.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/rb_tree_map_/find_fn_imps.hpp
deleted file mode 100644
index 1ab6be5c696..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/rb_tree_map_/find_fn_imps.hpp
+++ /dev/null
@@ -1,44 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file find_fn_imps.hpp
- * Contains an implementation for rb_tree_.
- */
-
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/rb_tree_map_/info_fn_imps.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/rb_tree_map_/info_fn_imps.hpp
deleted file mode 100644
index 288017d7a2e..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/rb_tree_map_/info_fn_imps.hpp
+++ /dev/null
@@ -1,52 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file info_fn_imps.hpp
- * Contains an implementation for rb_tree_.
- */
-
-PB_ASSOC_CLASS_T_DEC
-inline bool
-PB_ASSOC_CLASS_C_DEC::
-is_effectively_black(const node_pointer p_nd)
-{
-  return (p_nd == NULL || !p_nd->m_red);
-}
-
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/rb_tree_map_/insert_fn_imps.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/rb_tree_map_/insert_fn_imps.hpp
deleted file mode 100644
index 0ed22bfccd4..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/rb_tree_map_/insert_fn_imps.hpp
+++ /dev/null
@@ -1,176 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/*
- * @file insert_fn_imps.hpp
- * Contains an implementation for rb_tree_.
- */
-
-PB_ASSOC_CLASS_T_DEC
-inline std::pair<typename PB_ASSOC_CLASS_C_DEC::find_iterator, bool>
-PB_ASSOC_CLASS_C_DEC::
-insert(const_reference r_value)
-{
-  PB_ASSOC_DBG_ONLY(PB_ASSOC_CLASS_C_DEC::assert_valid();)
-
-    std::pair<find_iterator, bool> ins_pair =
-    PB_ASSOC_BASE_C_DEC::insert_leaf(r_value);
-
-  if (ins_pair.second == true)
-    {
-      ins_pair.first.m_p_nd->m_red = true;
-
-      PB_ASSOC_DBG_ONLY(PB_ASSOC_BASE_C_DEC::assert_valid(false, true);)
-
-	insert_fixup(ins_pair.first.m_p_nd);
-    }
-
-  PB_ASSOC_DBG_ONLY(PB_ASSOC_BASE_C_DEC::assert_valid(true, true);)
-    PB_ASSOC_DBG_ONLY(PB_ASSOC_CLASS_C_DEC::assert_valid());
-
-  return (ins_pair);
-}
-
-#ifdef PB_ASSOC_DATA_TRUE_INDICATOR
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::data_reference
-PB_ASSOC_CLASS_C_DEC::
-subscript_imp(const_key_reference r_key)
-{
-  PB_ASSOC_DBG_ONLY(PB_ASSOC_CLASS_C_DEC::assert_valid();)
-
-    std::pair<find_iterator, bool> ins_pair =
-    PB_ASSOC_BASE_C_DEC::insert_leaf(
-				     value_type(r_key, data_type()));
-
-  if (ins_pair.second == true)
-    {
-      ins_pair.first.m_p_nd->m_red = true;
-
-      PB_ASSOC_DBG_ONLY(PB_ASSOC_BASE_C_DEC::assert_valid());
-
-      insert_fixup(ins_pair.first.m_p_nd);
-    }
-
-  PB_ASSOC_DBG_ONLY(PB_ASSOC_CLASS_C_DEC::assert_valid());
-  PB_ASSOC_DBG_ONLY(PB_ASSOC_BASE_C_DEC::assert_iterators();)
-
-    return (ins_pair.first.m_p_nd->m_value.second);
-}
-#endif // #ifdef PB_ASSOC_DATA_TRUE
-
-PB_ASSOC_CLASS_T_DEC
-inline void
-PB_ASSOC_CLASS_C_DEC::
-insert_fixup(node_pointer p_nd)
-{
-  PB_ASSOC_DBG_ASSERT(p_nd->m_red == true);
-
-  while (p_nd != PB_ASSOC_BASE_C_DEC::m_p_head->m_p_parent&& 
-	 p_nd->m_p_parent->m_red)
-    {
-      if (p_nd->m_p_parent == p_nd->m_p_parent->m_p_parent->m_p_left)
-	{
-	  node_pointer p_y = p_nd->m_p_parent->m_p_parent->m_p_right;
-
-	  if (p_y != NULL&&  p_y->m_red)
-	    {
-	      p_nd->m_p_parent->m_red = false;
-
-	      p_y->m_red = false;
-
-	      p_nd->m_p_parent->m_p_parent->m_red = true;
-
-	      p_nd = p_nd->m_p_parent->m_p_parent;
-	    }
-	  else
-	    {
-	      if (p_nd == p_nd->m_p_parent->m_p_right)
-		{
-		  p_nd = p_nd->m_p_parent;
-
-		  PB_ASSOC_BASE_C_DEC::rotate_left(p_nd);
-		}
-
-	      p_nd->m_p_parent->m_red = false;
-
-	      p_nd->m_p_parent->m_p_parent->m_red = true;
-
-	      PB_ASSOC_BASE_C_DEC::rotate_right(
-						p_nd->m_p_parent->m_p_parent);
-	    }
-	}
-      else
-	{
-	  node_pointer p_y = p_nd->m_p_parent->m_p_parent->m_p_left;
-
-	  if (p_y != NULL&&  p_y->m_red)
-	    {
-	      p_nd->m_p_parent->m_red = false;
-
-	      p_y->m_red = false;
-
-	      p_nd->m_p_parent->m_p_parent->m_red = true;
-
-	      p_nd = p_nd->m_p_parent->m_p_parent;
-	    }
-	  else
-	    {
-	      if (p_nd == p_nd->m_p_parent->m_p_left)
-		{
-		  p_nd = p_nd->m_p_parent;
-
-		  PB_ASSOC_BASE_C_DEC::rotate_right(p_nd);
-		}
-
-	      p_nd->m_p_parent->m_red = false;
-
-	      p_nd->m_p_parent->m_p_parent->m_red = true;
-
-	      PB_ASSOC_BASE_C_DEC::rotate_left(
-					       p_nd->m_p_parent->m_p_parent);
-	    }
-	}
-    }
-
-  PB_ASSOC_BASE_C_DEC::update_to_top(p_nd, (Node_Updator* )this);
-
-  PB_ASSOC_BASE_C_DEC::m_p_head->m_p_parent->m_red = false;
-}
-
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/rb_tree_map_/node.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/rb_tree_map_/node.hpp
deleted file mode 100644
index 801137267b7..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/rb_tree_map_/node.hpp
+++ /dev/null
@@ -1,89 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file node.hpp
- * Contains an implementation for rb_tree_.
- */
-
-#ifndef RB_TREE_NODE_HPP
-#define RB_TREE_NODE_HPP
-
-namespace pb_assoc
-{
-
-  namespace detail
-  {
-
-    template<class Value_Type, class Allocator>
-    struct rb_tree_node_
-    {
-    public:
-      typedef
-      typename Allocator::template rebind<
-	rb_tree_node_<
-	Value_Type,
-	Allocator> >::other::pointer
-      node_pointer;
-
-    public:
-      inline bool
-      special_dec_check() const
-      {
-	return (m_red);
-      }
-
-    public:
-      node_pointer m_p_left;
-      node_pointer m_p_right;
-
-      node_pointer m_p_parent;
-
-      typedef Value_Type value_type;
-
-      value_type m_value;
-
-      bool m_red;
-    };
-
-  } // namespace detail
-
-} // namespace pb_assoc
-
-#endif // #ifndef RB_TREE_NODE_HPP
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/rb_tree_map_/rb_tree_.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/rb_tree_map_/rb_tree_.hpp
deleted file mode 100644
index e91d8eaa736..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/rb_tree_map_/rb_tree_.hpp
+++ /dev/null
@@ -1,360 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file rb_tree_.hpp
- * Contains an implementation for rb_tree_.
- */
-
-/*
- * This implementation uses an idea from the SGI STL (using a "header" node
- *	which is needed for efficient iteration).
- */
-
-#ifdef PB_ASSOC_DATA_TRUE_INDICATOR
-#ifndef BIN_SEARCH_TREE_HPP__DATA_TRUE_INDICATOR
-#define BIN_SEARCH_TREE_HPP__DATA_TRUE_INDICATOR
-#include <ext/pb_assoc/detail/bin_search_tree_/bin_search_tree_.hpp>
-#endif // #ifndef BIN_SEARCH_TREE_HPP__DATA_TRUE_INDICATOR
-#endif // #ifdef PB_ASSOC_DATA_TRUE_INDICATOR
-
-#ifdef PB_ASSOC_DATA_FALSE_INDICATOR
-#ifndef BIN_SEARCH_TREE_HPP__DATA_FALSE_INDICATOR
-#define BIN_SEARCH_TREE_HPP__DATA_FALSE_INDICATOR
-#include <ext/pb_assoc/detail/bin_search_tree_/bin_search_tree_.hpp>
-#endif // #ifndef BIN_SEARCH_TREE_HPP__DATA_FALSE_INDICATOR
-#endif // #ifdef PB_ASSOC_DATA_FALSE_INDICATOR
-
-#include <ext/pb_assoc/tree_policy.hpp>
-#include <ext/pb_assoc/detail/standard_policies.hpp>
-#include <ext/pb_assoc/detail/rb_tree_map_/node.hpp>
-#include <utility>
-#include <vector>
-#include <assert.h>
-
-namespace pb_assoc
-{
-
-  namespace detail
-  {
-
-#ifdef PB_ASSOC_RB_TREE_DEBUG_
-#define PB_ASSOC_DBG_ASSERT(X) assert(X)
-#define PB_ASSOC_DBG_VERIFY(X) assert(X)
-#define PB_ASSOC_DBG_ONLY(X) X
-#else // #ifdef PB_ASSOC_RB_TREE_DEBUG_
-#define PB_ASSOC_DBG_ASSERT(X)
-#define PB_ASSOC_DBG_VERIFY(X) {if((X)==0);}
-#define PB_ASSOC_DBG_ONLY(X) ;
-#endif // #ifdef PB_ASSOC_RB_TREE_DEBUG_
-
-#define PB_ASSOC_CLASS_T_DEC \
-	template< \
-		typename Key, \
-		typename Data, \
-		class Cmp_Fn, \
-		class Allocator, \
-		class Node_Updator>
-
-#ifdef PB_ASSOC_DATA_TRUE_INDICATOR
-#define PB_ASSOC_CLASS_NAME \
-	rb_tree_data_
-#endif // #ifdef PB_ASSOC_DATA_TRUE_INDICATOR
-
-#ifdef PB_ASSOC_DATA_FALSE_INDICATOR
-#define PB_ASSOC_CLASS_NAME \
-	rb_tree_no_data_
-#endif // #ifdef PB_ASSOC_DATA_FALSE_INDICATOR
-
-#ifdef PB_ASSOC_DATA_TRUE_INDICATOR
-#define PB_ASSOC_BASE_CLASS_NAME \
-	bin_search_tree_data_
-#endif // #ifdef PB_ASSOC_DATA_TRUE_INDICATOR
-
-#ifdef PB_ASSOC_DATA_FALSE_INDICATOR
-#define PB_ASSOC_BASE_CLASS_NAME \
-	bin_search_tree_no_data_
-#endif // #ifdef PB_ASSOC_DATA_FALSE_INDICATOR
-
-#define PB_ASSOC_CLASS_C_DEC \
-	PB_ASSOC_CLASS_NAME< \
-		Key, \
-		Data, \
-		Cmp_Fn, \
-		Allocator, \
-		Node_Updator>
-
-#define PB_ASSOC_TYPES_TRAITS_C_DEC \
-	types_traits< \
-		Key, \
-		Data, \
-		Allocator>
-
-#define PB_ASSOC_NODE_C_DEC \
-	rb_tree_node_< \
-		typename PB_ASSOC_TYPES_TRAITS_C_DEC::value_type, \
-		Allocator>
-
-#define PB_ASSOC_BASE_C_DEC \
-	PB_ASSOC_BASE_CLASS_NAME< \
-		Key, \
-		Data, \
-		PB_ASSOC_NODE_C_DEC, \
-		Cmp_Fn, \
-		Allocator, \
-		Node_Updator>
-
-#ifdef PB_ASSOC_DATA_TRUE_INDICATOR
-#define PB_ASSOC_V2F(X) (X).first
-#define PB_ASSOC_V2S(X) (X).second
-#define PB_ASSOC_EP2VP(X)& ((X)->m_value)
-#endif // #ifdef PB_ASSOC_DATA_TRUE_INDICATOR
-
-#ifdef PB_ASSOC_DATA_FALSE_INDICATOR
-#define PB_ASSOC_V2F(X) (X)
-#define PB_ASSOC_V2S(X) Mapped_Data()
-#define PB_ASSOC_EP2VP(X)& ((X)->m_value.first)
-#endif // #ifdef PB_ASSOC_DATA_FALSE_INDICATOR
-
-    template<typename Key,
-	     typename Data,
-	     class Cmp_Fn,
-	     class Allocator,
-	     class Node_Updator>
-    struct PB_ASSOC_CLASS_NAME : public PB_ASSOC_BASE_C_DEC
-    {
-
-    public:
-
-      typedef typename Allocator::size_type size_type;
-
-      typedef
-      typename PB_ASSOC_TYPES_TRAITS_C_DEC::const_key_reference
-      const_key_reference;
-
-      typedef typename PB_ASSOC_TYPES_TRAITS_C_DEC::data_type data_type;
-
-      typedef
-      typename PB_ASSOC_TYPES_TRAITS_C_DEC::data_reference
-      data_reference;
-
-      typedef
-      typename PB_ASSOC_TYPES_TRAITS_C_DEC::const_data_reference
-      const_data_reference;
-
-      typedef typename PB_ASSOC_TYPES_TRAITS_C_DEC::value_type value_type;
-
-      typedef typename PB_ASSOC_TYPES_TRAITS_C_DEC::pointer pointer;
-
-      typedef
-      typename PB_ASSOC_TYPES_TRAITS_C_DEC::const_pointer
-      const_pointer;
-
-      typedef typename PB_ASSOC_TYPES_TRAITS_C_DEC::reference reference;
-
-      typedef
-      typename PB_ASSOC_TYPES_TRAITS_C_DEC::const_reference
-      const_reference;
-
-      typedef typename PB_ASSOC_BASE_C_DEC::find_iterator find_iterator;
-
-      typedef
-      typename PB_ASSOC_BASE_C_DEC::const_iterator
-      const_find_iterator;
-
-      typedef typename PB_ASSOC_BASE_C_DEC::iterator iterator;
-
-      typedef typename PB_ASSOC_BASE_C_DEC::const_iterator const_iterator;
-
-      typedef
-      typename PB_ASSOC_BASE_C_DEC::reverse_iterator
-      reverse_iterator;
-
-      typedef
-      typename PB_ASSOC_BASE_C_DEC::const_reverse_iterator
-      const_reverse_iterator;
-
-    private:
-
-      typedef typename PB_ASSOC_BASE_C_DEC::node_pointer node_pointer;
-
-    protected:
-
-      PB_ASSOC_CLASS_NAME();
-
-      PB_ASSOC_CLASS_NAME(const Cmp_Fn& r_cmp_fn);
-
-      PB_ASSOC_CLASS_NAME(const Cmp_Fn& r_cmp_fn, const Node_Updator& r_node_updator);
-
-      PB_ASSOC_CLASS_NAME(const PB_ASSOC_CLASS_C_DEC& r_other);
-
-      void
-      swap(PB_ASSOC_CLASS_C_DEC& r_other);
-
-      template<class It>
-      void
-      copy_from_range(It first_it, It last_it);
-
-      inline std::pair<find_iterator, bool>
-      insert(const_reference r_value);
-
-#ifdef PB_ASSOC_DATA_TRUE_INDICATOR
-      inline data_reference
-      subscript_imp(const_key_reference r_key);
-#endif // #ifdef PB_ASSOC_DATA_TRUE
-
-      inline static bool
-      is_effectively_black(const node_pointer p_nd);
-
-      inline size_type
-      erase(const_key_reference r_key);
-
-      inline const_iterator
-      erase(const_iterator it);
-
-#ifdef PB_ASSOC_DATA_TRUE_INDICATOR
-      inline iterator
-      erase(iterator it);
-#endif // #ifdef PB_ASSOC_DATA_TRUE_INDICATOR
-
-      inline const_reverse_iterator
-      erase(const_reverse_iterator it);
-
-#ifdef PB_ASSOC_DATA_TRUE_INDICATOR
-      inline reverse_iterator
-      erase(reverse_iterator it);
-#endif // #ifdef PB_ASSOC_DATA_TRUE_INDICATOR
-
-      template<class Pred>
-      inline size_type
-      erase_if(Pred pred);
-
-      void
-      join(PB_ASSOC_CLASS_C_DEC& r_other);
-
-      void
-      split(const_key_reference r_key, PB_ASSOC_CLASS_C_DEC& r_other);
-
-#ifdef PB_ASSOC_RB_TREE_DEBUG_
-
-      virtual void
-      assert_valid() const;
-
-      size_type
-      assert_node_consistent(const node_pointer p_nd) const;
-
-#endif // #ifdef PB_ASSOC_RB_TREE_DEBUG_
-
-    private:
-
-      void
-      initialize();
-
-      void
-      insert_fixup(node_pointer p_nd);
-
-      void
-      erase_node(node_pointer p_nd);
-
-      void
-      remove_node(node_pointer p_nd);
-
-      void
-      remove_fixup(node_pointer p_x, node_pointer p_new_x_parent);
-
-      void
-      split_imp(node_pointer p_nd, PB_ASSOC_CLASS_C_DEC& r_other);
-
-      inline node_pointer
-      split_min();
-
-      std::pair<node_pointer, node_pointer>
-      split_min_imp();
-
-      void
-      join_imp(node_pointer p_x, node_pointer p_r);
-
-      std::pair<node_pointer, node_pointer>
-      find_join_pos_right(node_pointer p_l, size_type h_l, size_type h_r);
-
-      std::pair<node_pointer, node_pointer>
-      find_join_pos_left(node_pointer p_r, size_type h_l, size_type h_r);
-
-      inline size_type
-      black_height(node_pointer p_nd);
-
-      void
-      split_at_node(node_pointer p_nd, PB_ASSOC_CLASS_C_DEC& r_other);
-
-    };
-
-#include <ext/pb_assoc/detail/rb_tree_map_/constructors_destructor_fn_imps.hpp>
-#include <ext/pb_assoc/detail/rb_tree_map_/insert_fn_imps.hpp>
-#include <ext/pb_assoc/detail/rb_tree_map_/erase_fn_imps.hpp>
-#include <ext/pb_assoc/detail/rb_tree_map_/find_fn_imps.hpp>
-#include <ext/pb_assoc/detail/rb_tree_map_/debug_fn_imps.hpp>
-#include <ext/pb_assoc/detail/rb_tree_map_/split_join_fn_imps.hpp>
-#include <ext/pb_assoc/detail/rb_tree_map_/info_fn_imps.hpp>
-
-#undef PB_ASSOC_CLASS_T_DEC
-
-#undef PB_ASSOC_CLASS_C_DEC
-
-#undef PB_ASSOC_CLASS_NAME
-
-#undef PB_ASSOC_TYPES_TRAITS_C_DEC
-
-#undef PB_ASSOC_BASE_CLASS_NAME
-
-#undef PB_ASSOC_NODE_C_DEC
-
-#undef PB_ASSOC_BASE_C_DEC
-
-#undef PB_ASSOC_DBG_ASSERT
-#undef PB_ASSOC_DBG_VERIFY
-#undef PB_ASSOC_DBG_ONLY
-
-#undef PB_ASSOC_V2F
-#undef PB_ASSOC_EP2VP
-#undef PB_ASSOC_V2S
-
-  } // namespace detail
-
-} // namespace pb_assoc
-
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/rb_tree_map_/split_join_fn_imps.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/rb_tree_map_/split_join_fn_imps.hpp
deleted file mode 100644
index 6bc8c17472b..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/rb_tree_map_/split_join_fn_imps.hpp
+++ /dev/null
@@ -1,381 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file split_join_fn_imps.hpp
- * Contains an implementation for rb_tree_.
- */
-
-PB_ASSOC_CLASS_T_DEC
-inline void
-PB_ASSOC_CLASS_C_DEC::
-join(PB_ASSOC_CLASS_C_DEC& r_other)
-{
-  PB_ASSOC_DBG_ONLY(assert_valid();)
-    PB_ASSOC_DBG_ONLY(PB_ASSOC_BASE_C_DEC::assert_valid(true, true);)
-
-    PB_ASSOC_DBG_ONLY(r_other.assert_valid();)
-    PB_ASSOC_DBG_ONLY(r_other.PB_ASSOC_BASE_C_DEC::assert_valid(true, true);)
-
-    if (PB_ASSOC_BASE_C_DEC::join_prep(r_other) == false)
-      {
-	PB_ASSOC_DBG_ONLY(assert_valid();)
-	  PB_ASSOC_DBG_ONLY(r_other.assert_valid();)
-
-	  return;
-      }
-
-  const node_pointer p_x = r_other.split_min();
-
-  join_imp(p_x, r_other.m_p_head->m_p_parent);
-
-  PB_ASSOC_BASE_C_DEC::join_finish(r_other);
-
-  PB_ASSOC_DBG_ONLY(assert_valid();)
-    PB_ASSOC_DBG_ONLY(PB_ASSOC_BASE_C_DEC::assert_valid(true, true);)
-
-    PB_ASSOC_DBG_ONLY(r_other.assert_valid();)
-    PB_ASSOC_DBG_ONLY(r_other.PB_ASSOC_BASE_C_DEC::assert_valid(true, true);)
-    }
-
-PB_ASSOC_CLASS_T_DEC
-void
-PB_ASSOC_CLASS_C_DEC::
-join_imp(node_pointer p_x, node_pointer p_r)
-{
-  PB_ASSOC_DBG_ASSERT(p_x != NULL);
-
-  if (p_r != NULL)
-    p_r->m_red = false;
-
-  const size_type h =
-    black_height(PB_ASSOC_BASE_C_DEC::m_p_head->m_p_parent);
-  const size_type other_h = black_height(p_r);
-
-  node_pointer p_x_l;
-  node_pointer p_x_r;
-
-  std::pair<node_pointer, node_pointer> join_pos;
-
-  const bool right_join = h >= other_h;
-
-  if (right_join)
-    {
-      join_pos = find_join_pos_right(PB_ASSOC_BASE_C_DEC::m_p_head->m_p_parent, h, other_h);
-
-      p_x_l = join_pos.first;
-      p_x_r = p_r;
-    }
-  else
-    {
-      p_x_l = PB_ASSOC_BASE_C_DEC::m_p_head->m_p_parent;
-
-      PB_ASSOC_BASE_C_DEC::m_p_head->m_p_parent = p_r;
-      if (p_r != NULL)
-	p_r->m_p_parent = PB_ASSOC_BASE_C_DEC::m_p_head;
-
-      join_pos = find_join_pos_left(PB_ASSOC_BASE_C_DEC::m_p_head->m_p_parent, h, other_h);
-
-      p_x_r = join_pos.first;
-    }
-
-  node_pointer p_parent = join_pos.second;
-
-  if (p_parent == PB_ASSOC_BASE_C_DEC::m_p_head)
-    {
-      PB_ASSOC_BASE_C_DEC::m_p_head->m_p_parent = p_x;
-
-      p_x->m_p_parent = PB_ASSOC_BASE_C_DEC::m_p_head;
-    }
-  else
-    {
-      p_x->m_p_parent = p_parent;
-
-      if (right_join)
-	p_x->m_p_parent->m_p_right = p_x;
-      else
-	p_x->m_p_parent->m_p_left = p_x;
-    }
-
-  p_x->m_p_left = p_x_l;
-  if (p_x_l != NULL)
-    p_x_l->m_p_parent = p_x;
-
-  p_x->m_p_right = p_x_r;
-  if (p_x_r != NULL)
-    p_x_r->m_p_parent = p_x;
-
-  p_x->m_red = true;
-
-  PB_ASSOC_BASE_C_DEC::initialize_min_max();
-
-  PB_ASSOC_DBG_ONLY(PB_ASSOC_BASE_C_DEC::assert_valid(true, false);)
-
-    PB_ASSOC_BASE_C_DEC::update_to_top(p_x, (Node_Updator* )this);
-
-  insert_fixup(p_x);
-
-  PB_ASSOC_DBG_ONLY(assert_valid());
-  PB_ASSOC_DBG_ONLY(PB_ASSOC_BASE_C_DEC::assert_valid(true, false);)
-    }
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::node_pointer
-PB_ASSOC_CLASS_C_DEC::
-split_min()
-{
-  PB_ASSOC_DBG_ASSERT(PB_ASSOC_BASE_C_DEC::m_p_head->m_p_left !=
-		      PB_ASSOC_BASE_C_DEC::m_p_head);
-
-  node_pointer p_min = PB_ASSOC_BASE_C_DEC::m_p_head->m_p_left;
-
-  remove_node(p_min);
-
-  return (p_min);
-}
-
-PB_ASSOC_CLASS_T_DEC
-std::pair<
-  typename PB_ASSOC_CLASS_C_DEC::node_pointer,
-  typename PB_ASSOC_CLASS_C_DEC::node_pointer>
-PB_ASSOC_CLASS_C_DEC::
-find_join_pos_right(node_pointer p_l, size_type h_l, size_type h_r)
-{
-  PB_ASSOC_DBG_ASSERT(h_l >= h_r);
-
-  if (PB_ASSOC_BASE_C_DEC::m_p_head->m_p_parent == NULL)
-    return (std::make_pair((node_pointer)NULL,
-			   PB_ASSOC_BASE_C_DEC::m_p_head));
-
-  node_pointer p_l_parent = PB_ASSOC_BASE_C_DEC::m_p_head;
-
-  while (h_l > h_r)
-    {
-      if (p_l->m_red == false)
-	{
-	  PB_ASSOC_DBG_ASSERT(h_l > 0);
-
-	  --h_l;
-	}
-
-      p_l_parent = p_l;
-
-      p_l = p_l->m_p_right;
-    }
-
-  if (!is_effectively_black(p_l))
-    {
-      p_l_parent = p_l;
-
-      p_l = p_l->m_p_right;
-    }
-
-  PB_ASSOC_DBG_ASSERT(is_effectively_black(p_l));
-  PB_ASSOC_DBG_ASSERT(black_height(p_l) == h_r);
-  PB_ASSOC_DBG_ASSERT(p_l == NULL || p_l->m_p_parent == p_l_parent);
-
-  return (std::make_pair(p_l, p_l_parent));
-}
-
-PB_ASSOC_CLASS_T_DEC
-std::pair<
-  typename PB_ASSOC_CLASS_C_DEC::node_pointer,
-  typename PB_ASSOC_CLASS_C_DEC::node_pointer>
-PB_ASSOC_CLASS_C_DEC::
-find_join_pos_left(node_pointer p_r, size_type h_l, size_type h_r)
-{
-  PB_ASSOC_DBG_ASSERT(h_r > h_l);
-
-  if (PB_ASSOC_BASE_C_DEC::m_p_head->m_p_parent == NULL)
-    return (std::make_pair((node_pointer)NULL,
-			   PB_ASSOC_BASE_C_DEC::m_p_head));
-
-  node_pointer p_r_parent = PB_ASSOC_BASE_C_DEC::m_p_head;
-
-  while (h_r > h_l)
-    {
-      if (p_r->m_red == false)
-	{
-	  PB_ASSOC_DBG_ASSERT(h_r > 0);
-
-	  --h_r;
-	}
-
-      p_r_parent = p_r;
-
-      p_r = p_r->m_p_left;
-    }
-
-  if (!is_effectively_black(p_r))
-    {
-      p_r_parent = p_r;
-
-      p_r = p_r->m_p_left;
-    }
-
-  PB_ASSOC_DBG_ASSERT(is_effectively_black(p_r));
-  PB_ASSOC_DBG_ASSERT(black_height(p_r) == h_l);
-  PB_ASSOC_DBG_ASSERT(p_r == NULL || p_r->m_p_parent == p_r_parent);
-
-  return (std::make_pair(p_r, p_r_parent));
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::size_type
-PB_ASSOC_CLASS_C_DEC::
-black_height(node_pointer p_nd)
-{
-  size_type h = 1;
-
-  while (p_nd != NULL)
-    {
-      if (p_nd->m_red == false)
-	++h;
-
-      p_nd = p_nd->m_p_left;
-    }
-
-  return (h);
-}
-
-PB_ASSOC_CLASS_T_DEC
-void
-PB_ASSOC_CLASS_C_DEC::
-split(const_key_reference r_key, PB_ASSOC_CLASS_C_DEC& r_other)
-{
-  PB_ASSOC_DBG_ONLY(assert_valid());
-  PB_ASSOC_DBG_ONLY(PB_ASSOC_BASE_C_DEC::assert_valid(true, true);)
-
-    PB_ASSOC_DBG_ONLY(r_other.assert_valid());
-  PB_ASSOC_DBG_ONLY(r_other.PB_ASSOC_BASE_C_DEC::assert_valid(true, true);)
-
-    if (PB_ASSOC_BASE_C_DEC::split_prep(r_key, r_other) == false)
-      {
-	PB_ASSOC_DBG_ONLY(assert_valid());
-	PB_ASSOC_DBG_ONLY(r_other.assert_valid());
-
-	return;
-      }
-
-  PB_ASSOC_DBG_ONLY(assert_valid());
-  PB_ASSOC_DBG_ONLY(PB_ASSOC_BASE_C_DEC::assert_valid(true, false);)
-
-    PB_ASSOC_DBG_ONLY(r_other.assert_valid());
-  PB_ASSOC_DBG_ONLY(r_other.PB_ASSOC_BASE_C_DEC::assert_valid(true, false);)
-
-    node_pointer p_nd = upper_bound(r_key).m_p_nd;
-
-  do
-    {
-      node_pointer p_next_nd = p_nd->m_p_parent;
-
-      if (Cmp_Fn::operator()(
-			     r_key,
-			     PB_ASSOC_V2F(p_nd->m_value)))
-	split_at_node(p_nd, r_other);
-
-      PB_ASSOC_DBG_ONLY(assert_valid());
-      PB_ASSOC_DBG_ONLY(PB_ASSOC_BASE_C_DEC::assert_valid(true, false);)
-
-	PB_ASSOC_DBG_ONLY(r_other.assert_valid());
-      PB_ASSOC_DBG_ONLY(r_other.PB_ASSOC_BASE_C_DEC::assert_valid(true, false);)
-
-	p_nd = p_next_nd;
-    }
-  while (p_nd != PB_ASSOC_BASE_C_DEC::m_p_head);
-
-  PB_ASSOC_BASE_C_DEC::split_finish(r_other);
-
-  PB_ASSOC_DBG_ONLY(assert_valid());
-  PB_ASSOC_DBG_ONLY(PB_ASSOC_BASE_C_DEC::assert_valid(true, true);)
-
-    PB_ASSOC_DBG_ONLY(r_other.assert_valid());
-  PB_ASSOC_DBG_ONLY(r_other.PB_ASSOC_BASE_C_DEC::assert_valid(true, true);)
-    }
-
-PB_ASSOC_CLASS_T_DEC
-void
-PB_ASSOC_CLASS_C_DEC::
-split_at_node(node_pointer p_nd, PB_ASSOC_CLASS_C_DEC& r_other)
-{
-  PB_ASSOC_DBG_ASSERT(p_nd != NULL);
-
-  node_pointer p_l = p_nd->m_p_left;
-  node_pointer p_r = p_nd->m_p_right;
-
-  node_pointer p_parent = p_nd->m_p_parent;
-
-  if (p_parent == PB_ASSOC_BASE_C_DEC::m_p_head)
-    {
-      PB_ASSOC_BASE_C_DEC::m_p_head->m_p_parent = p_l;
-
-      if (p_l != NULL)
-	{
-	  p_l->m_p_parent = PB_ASSOC_BASE_C_DEC::m_p_head;
-
-	  p_l->m_red = false;
-	}
-    }
-  else
-    {
-      if (p_parent->m_p_left == p_nd)
-	p_parent->m_p_left = p_l;
-      else
-	p_parent->m_p_right = p_l;
-
-      if (p_l != NULL)
-	p_l->m_p_parent = p_parent;
-
-      update_to_top(p_parent, (Node_Updator* )this);
-
-      if (!p_nd->m_red)
-	remove_fixup(p_l, p_parent);
-    }
-
-  PB_ASSOC_BASE_C_DEC::initialize_min_max();
-
-  PB_ASSOC_DBG_ONLY(assert_valid());
-  PB_ASSOC_DBG_ONLY(PB_ASSOC_BASE_C_DEC::assert_valid(true, false);)
-
-    PB_ASSOC_DBG_ONLY(r_other.assert_valid());
-  PB_ASSOC_DBG_ONLY(r_other.PB_ASSOC_BASE_C_DEC::assert_valid(true, false);)
-
-    r_other.join_imp(p_nd, p_r);
-}
-
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/resize_policy/cc_hash_max_collision_resize_trigger_imp.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/resize_policy/cc_hash_max_collision_resize_trigger_imp.hpp
deleted file mode 100644
index 2220195f77d..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/resize_policy/cc_hash_max_collision_resize_trigger_imp.hpp
+++ /dev/null
@@ -1,227 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/*
- * @file cc_hash_max_collision_check_resize_trigger_imp.hpp
- * Contains an implementation of cc_hash_max_collision_check_resize_trigger.
- */
-
-PB_ASSOC_CLASS_T_DEC
-pb_assoc::detail::int_to_type<External_Load_Access>
-PB_ASSOC_CLASS_C_DEC::s_external_load_access_ind;
-
-PB_ASSOC_CLASS_T_DEC
-PB_ASSOC_CLASS_C_DEC::
-cc_hash_max_collision_check_resize_trigger(float load) :
-  m_load(load),
-  m_size(0),
-  m_num_col(0),
-  m_max_col(0),
-  m_resize_needed(false)
-{ }
-
-PB_ASSOC_CLASS_T_DEC
-inline void
-PB_ASSOC_CLASS_C_DEC::
-notify_find_search_start()
-{ }
-
-PB_ASSOC_CLASS_T_DEC
-inline void
-PB_ASSOC_CLASS_C_DEC::
-notify_find_search_collision()
-{ }
-
-PB_ASSOC_CLASS_T_DEC
-inline void
-PB_ASSOC_CLASS_C_DEC::
-notify_find_search_end()
-{ }
-
-PB_ASSOC_CLASS_T_DEC
-inline void
-PB_ASSOC_CLASS_C_DEC::
-notify_insert_search_start()
-{
-  m_num_col = 0;
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline void
-PB_ASSOC_CLASS_C_DEC::
-notify_insert_search_collision()
-{
-  ++m_num_col;
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline void
-PB_ASSOC_CLASS_C_DEC::
-notify_insert_search_end()
-{
-  PB_ASSOC_DBG_ASSERT(NOTHING_HT_RESIZE_ACTION == 0);
-
-  m_resize_needed =
-    m_resize_needed || (m_num_col >= m_max_col);
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline void
-PB_ASSOC_CLASS_C_DEC::
-notify_erase_search_start()
-{ }
-
-PB_ASSOC_CLASS_T_DEC
-inline void
-PB_ASSOC_CLASS_C_DEC::
-notify_erase_search_collision()
-{ }
-
-PB_ASSOC_CLASS_T_DEC
-inline void
-PB_ASSOC_CLASS_C_DEC::
-notify_erase_search_end()
-{ }
-
-PB_ASSOC_CLASS_T_DEC
-inline void
-PB_ASSOC_CLASS_C_DEC::
-notify_inserted(size_type num_e)
-{
-  PB_ASSOC_DBG_ASSERT(num_e <= m_size);
-
-  if (num_e == m_size)
-    m_resize_needed = true;
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline void
-PB_ASSOC_CLASS_C_DEC::
-notify_erased(size_type num_e)
-{
-  PB_ASSOC_DBG_ASSERT(num_e <= m_size);
-
-  m_resize_needed = false;
-}
-
-PB_ASSOC_CLASS_T_DEC
-void
-PB_ASSOC_CLASS_C_DEC::
-notify_cleared()
-{
-  m_resize_needed = false;
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline bool
-PB_ASSOC_CLASS_C_DEC::
-is_resize_needed() const
-{
-  return (m_resize_needed);
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline bool
-PB_ASSOC_CLASS_C_DEC::
-is_grow_needed(size_type /*size*/, size_type /*num_used_e*/) const
-{
-  PB_ASSOC_DBG_ASSERT(m_resize_needed);
-
-  return (true);
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline bool
-PB_ASSOC_CLASS_C_DEC::
-is_shrink_needed(size_type size, size_type num_used_e) const
-{
-  PB_ASSOC_DBG_ASSERT(m_resize_needed);
-
-  return (false);
-}
-
-PB_ASSOC_CLASS_T_DEC
-void
-PB_ASSOC_CLASS_C_DEC::
-notify_resized(size_type new_size)
-{
-  m_size = new_size;
-
-  // max_col <-- \sqrt{2 load \ln( 2 m \ln( m ) ) }
-
-  const double ln_arg = 2*  m_size*  ::log( (double)m_size);
-
-  m_max_col = (size_type)::ceil(  ::sqrt(2*   m_load*  ::log(ln_arg) ) );
-
-  m_num_col = 0;
-
-  m_resize_needed = false;
-}
-
-PB_ASSOC_CLASS_T_DEC
-void
-PB_ASSOC_CLASS_C_DEC::
-notify_externally_resized(size_type new_size)
-{
-  notify_resized(new_size);
-}
-
-PB_ASSOC_CLASS_T_DEC
-void
-PB_ASSOC_CLASS_C_DEC::
-swap(PB_ASSOC_CLASS_C_DEC& r_other)
-{
-  std::swap(m_load, r_other.m_load);
-
-  std::swap(m_size, r_other.m_size);
-
-  std::swap(m_num_col, r_other.m_num_col);
-
-  std::swap(m_max_col, r_other.m_max_col);
-
-  std::swap(m_resize_needed, r_other.m_resize_needed);
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline float
-PB_ASSOC_CLASS_C_DEC::
-get_load_imp(pb_assoc::detail::int_to_type<true>) const
-{
-  return (m_load);
-}
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/resize_policy/hash_exponential_size_policy_imp.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/resize_policy/hash_exponential_size_policy_imp.hpp
deleted file mode 100644
index 05e7a97661e..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/resize_policy/hash_exponential_size_policy_imp.hpp
+++ /dev/null
@@ -1,123 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/*
- * @file hash_exponential_size_policy_imp.hpp
- * Contains an implementation of hash_exponential_size_policy.
- */
-
-#ifdef PB_ASSOC_HT_EXPONENTIAL_SIZE_POLICY_DEBUG
-#define PB_ASSOC_DBG_ASSERT(X) assert(X)
-#define PB_ASSOC_DBG_VERIFY(X) assert(X)
-#define PB_ASSOC_DBG_ONLY(X) X
-#else // #ifdef PB_ASSOC_HT_EXPONENTIAL_SIZE_POLICY_DEBUG
-#define PB_ASSOC_DBG_ASSERT(X)
-#define PB_ASSOC_DBG_VERIFY(X) {if((X)==0);}
-#define PB_ASSOC_DBG_ONLY(X) ;
-#endif // #ifdef PB_ASSOC_HT_EXPONENTIAL_SIZE_POLICY_DEBUG
-
-PB_ASSOC_CLASS_T_DEC
-PB_ASSOC_CLASS_C_DEC::
-hash_exponential_size_policy(size_type start_size, size_type grow_factor) :
-  m_start_size(start_size),
-  m_grow_factor(grow_factor)
-{ }
-
-PB_ASSOC_CLASS_T_DEC
-void
-PB_ASSOC_CLASS_C_DEC::
-swap(PB_ASSOC_CLASS_C_DEC& r_other)
-{
-  std::swap(m_start_size, r_other.m_start_size);
-
-  std::swap(m_grow_factor, r_other.m_grow_factor);
-}
-
-PB_ASSOC_CLASS_T_DEC
-typename PB_ASSOC_CLASS_C_DEC::size_type
-PB_ASSOC_CLASS_C_DEC::
-get_init_size(size_type suggested_size) const
-{
-  size_type ret = m_start_size;
-
-  while (ret < suggested_size)
-    ret *=  m_grow_factor;
-
-  return (ret);
-}
-
-PB_ASSOC_CLASS_T_DEC
-typename PB_ASSOC_CLASS_C_DEC::size_type
-PB_ASSOC_CLASS_C_DEC::
-get_nearest_larger_size(size_type cur_size) const
-{
-  PB_ASSOC_DBG_ONLY(assert_is_one_of_my_sizes(size);)
-
-    const size_type pot_ret = cur_size*  m_grow_factor;
-
-  return ((pot_ret > cur_size)? pot_ret : cur_size);
-}
-
-PB_ASSOC_CLASS_T_DEC
-typename PB_ASSOC_CLASS_C_DEC::size_type
-PB_ASSOC_CLASS_C_DEC::
-get_nearest_smaller_size(size_type cur_size) const
-{
-  PB_ASSOC_DBG_ONLY(assert_is_one_of_my_sizes(size);)
-
-    const size_type pot_ret = cur_size / m_grow_factor;
-
-  return ((pot_ret > 0)? pot_ret : m_start_size);
-}
-
-#ifdef PB_ASSOC_HT_EXPONENTIAL_SIZE_POLICY_DEBUG
-PB_ASSOC_CLASS_T_DEC
-void
-PB_ASSOC_CLASS_C_DEC::
-assert_is_one_of_my_sizes(size_type size)
-{
-  PB_ASSOC_DBG_ASSERT(size >= m_start_size);
-
-  while (size >m_start_size)
-    size /= m_grow_factor;
-
-  PB_ASSOC_DBG_ASSERT(size == m_start_size);
-}
-#endif // #ifdef PB_ASSOC_HT_EXPONENTIAL_SIZE_POLICY_DEBUG
-
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/resize_policy/hash_load_check_resize_trigger_imp.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/resize_policy/hash_load_check_resize_trigger_imp.hpp
deleted file mode 100644
index e17f9c2f588..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/resize_policy/hash_load_check_resize_trigger_imp.hpp
+++ /dev/null
@@ -1,352 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/*
- * @file hash_load_check_resize_trigger_imp.hpp.hpp
- * Contains an implementation of hash_load_check_resize_trigger..
- */
-
-PB_ASSOC_CLASS_T_DEC
-pb_assoc::detail::int_to_type<External_Load_Access>
-PB_ASSOC_CLASS_C_DEC::s_external_load_access_ind;
-
-PB_ASSOC_CLASS_T_DEC
-PB_ASSOC_CLASS_C_DEC::
-hash_load_check_resize_trigger(float load_min, float load_max) :
-  m_load_min(load_min),
-  m_load_max(load_max),
-  m_next_shrink_size(0),
-  m_next_grow_size(0),
-  m_resize_needed(false)
-{
-  PB_ASSOC_DBG_ONLY(assert_valid();)
-    }
-
-PB_ASSOC_CLASS_T_DEC
-inline void
-PB_ASSOC_CLASS_C_DEC::
-notify_find_search_start()
-{
-  PB_ASSOC_DBG_ONLY(assert_valid();)
-    }
-
-PB_ASSOC_CLASS_T_DEC
-inline void
-PB_ASSOC_CLASS_C_DEC::
-notify_find_search_collision()
-{
-  PB_ASSOC_DBG_ONLY(assert_valid();)
-    }
-
-PB_ASSOC_CLASS_T_DEC
-inline void
-PB_ASSOC_CLASS_C_DEC::
-notify_find_search_end()
-{
-  PB_ASSOC_DBG_ONLY(assert_valid();)
-    }
-
-PB_ASSOC_CLASS_T_DEC
-inline void
-PB_ASSOC_CLASS_C_DEC::
-notify_insert_search_start()
-{
-  PB_ASSOC_DBG_ONLY(assert_valid();)
-    }
-
-PB_ASSOC_CLASS_T_DEC
-inline void
-PB_ASSOC_CLASS_C_DEC::
-notify_insert_search_collision()
-{
-  PB_ASSOC_DBG_ONLY(assert_valid();)
-    }
-
-PB_ASSOC_CLASS_T_DEC
-inline void
-PB_ASSOC_CLASS_C_DEC::
-notify_insert_search_end()
-{
-  PB_ASSOC_DBG_ONLY(assert_valid();)
-    }
-
-PB_ASSOC_CLASS_T_DEC
-inline void
-PB_ASSOC_CLASS_C_DEC::
-notify_erase_search_start()
-{
-  PB_ASSOC_DBG_ONLY(assert_valid();)
-    }
-
-PB_ASSOC_CLASS_T_DEC
-inline void
-PB_ASSOC_CLASS_C_DEC::
-notify_erase_search_collision()
-{
-  PB_ASSOC_DBG_ONLY(assert_valid();)
-    }
-
-PB_ASSOC_CLASS_T_DEC
-inline void
-PB_ASSOC_CLASS_C_DEC::
-notify_erase_search_end()
-{
-  PB_ASSOC_DBG_ONLY(assert_valid();)
-    }
-
-PB_ASSOC_CLASS_T_DEC
-inline void
-PB_ASSOC_CLASS_C_DEC::
-notify_inserted(size_type num_entries)
-{
-  PB_ASSOC_DBG_ASSERT(num_entries <= m_next_grow_size);
-
-  my_size_base::set_size(num_entries);
-
-  m_resize_needed = (num_entries == m_next_grow_size);
-
-  PB_ASSOC_DBG_ONLY(assert_valid();)
-    }
-
-PB_ASSOC_CLASS_T_DEC
-inline void
-PB_ASSOC_CLASS_C_DEC::
-notify_erased(size_type num_entries)
-{
-  PB_ASSOC_DBG_ASSERT(num_entries >= m_next_shrink_size);
-
-  my_size_base::set_size(num_entries);
-
-  m_resize_needed = (num_entries == m_next_shrink_size);
-
-  PB_ASSOC_DBG_ONLY(assert_valid();)
-
-    PB_ASSOC_DBG_ONLY(assert_valid();)
-    }
-
-PB_ASSOC_CLASS_T_DEC
-inline bool
-PB_ASSOC_CLASS_C_DEC::
-is_resize_needed() const
-{
-  PB_ASSOC_DBG_ONLY(assert_valid();)
-
-    return (m_resize_needed);
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline bool
-PB_ASSOC_CLASS_C_DEC::
-is_grow_needed(size_type /*size*/, size_type num_entries) const
-{
-  PB_ASSOC_DBG_ASSERT(m_resize_needed);
-
-  return (num_entries >= m_next_grow_size);
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline bool
-PB_ASSOC_CLASS_C_DEC::
-is_shrink_needed(size_type /*size*/, size_type num_entries) const
-{
-  PB_ASSOC_DBG_ASSERT(m_resize_needed);
-
-  return (num_entries <= m_next_shrink_size);
-}
-
-PB_ASSOC_CLASS_T_DEC
-PB_ASSOC_CLASS_C_DEC::
-~hash_load_check_resize_trigger()
-{ }
-
-PB_ASSOC_CLASS_T_DEC
-void
-PB_ASSOC_CLASS_C_DEC::
-notify_resized(size_type new_size)
-{
-  m_resize_needed = false;
-
-  m_next_grow_size =
-    size_type(m_load_max*  new_size - 1);
-
-  m_next_shrink_size =
-    size_type(m_load_min*  new_size );
-
-  PB_ASSOC_DBG_ONLY(assert_valid();)
-    }
-
-PB_ASSOC_CLASS_T_DEC
-void
-PB_ASSOC_CLASS_C_DEC::
-notify_externally_resized(size_type new_size)
-{
-  m_resize_needed = false;
-
-  size_type new_grow_size =
-    size_type(m_load_max*  new_size - 1);
-
-  size_type new_shrink_size =
-    size_type(m_load_min*  new_size );
-
-  if (new_grow_size >= m_next_grow_size)
-    {
-      PB_ASSOC_DBG_ASSERT(new_shrink_size > m_next_shrink_size);
-
-      m_next_grow_size = new_grow_size;
-
-      PB_ASSOC_DBG_ONLY(assert_valid();)
-
-	return;
-    }
-
-  PB_ASSOC_DBG_ASSERT(new_shrink_size <= m_next_shrink_size);
-
-  m_next_shrink_size = new_shrink_size;
-
-  PB_ASSOC_DBG_ONLY(assert_valid();)
-    }
-
-PB_ASSOC_CLASS_T_DEC
-void
-PB_ASSOC_CLASS_C_DEC::
-notify_cleared()
-{
-  my_size_base::set_size(0);
-
-  m_resize_needed = (0 < m_next_shrink_size);
-
-  PB_ASSOC_DBG_ONLY(assert_valid();)
-    }
-
-PB_ASSOC_CLASS_T_DEC
-void
-PB_ASSOC_CLASS_C_DEC::
-swap(PB_ASSOC_CLASS_C_DEC& r_other)
-{
-  PB_ASSOC_DBG_ONLY(assert_valid();)
-    PB_ASSOC_DBG_ONLY(r_other.assert_valid();)
-
-    my_size_base::swap(r_other);
-
-  std::swap(m_load_min, r_other.m_load_min);
-  std::swap(m_load_max, r_other.m_load_max);
-
-  std::swap(m_resize_needed, r_other.m_resize_needed);
-
-  std::swap(m_next_grow_size, r_other.m_next_grow_size);
-  std::swap(m_next_shrink_size, r_other.m_next_shrink_size);
-
-  PB_ASSOC_DBG_ONLY(assert_valid();)
-    PB_ASSOC_DBG_ONLY(r_other.assert_valid();)
-    }
-
-PB_ASSOC_CLASS_T_DEC
-inline std::pair<float, float>
-PB_ASSOC_CLASS_C_DEC::
-get_loads() const
-{
-  return (get_loads_imp(s_external_load_access_ind));
-}
-
-PB_ASSOC_CLASS_T_DEC
-void
-PB_ASSOC_CLASS_C_DEC::
-set_loads(std::pair<float, float> load_pair)
-{
-  set_loads_imp(load_pair, s_external_load_access_ind);
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline std::pair<float, float>
-PB_ASSOC_CLASS_C_DEC::
-get_loads_imp(pb_assoc::detail::int_to_type<true>) const
-{
-  return (std::make_pair(m_load_min, m_load_max));
-}
-
-PB_ASSOC_CLASS_T_DEC
-void
-PB_ASSOC_CLASS_C_DEC::
-set_loads_imp(std::pair<float, float> load_pair, pb_assoc::detail::int_to_type<true>)
-{
-  const float old_load_min = m_load_min;
-  const float old_load_max = m_load_max;
-  const size_type old_next_shrink_size = m_next_shrink_size;
-  const size_type old_next_grow_size = m_next_grow_size;
-  const bool old_resize_needed = m_resize_needed;
-
-  try
-    {
-      m_load_min = load_pair.first;
-      m_load_max = load_pair.second;
-
-      do_resize(static_cast<size_type>(
-				       my_size_base::get_size() / ((m_load_min + m_load_max) / 2)));
-    }
-  catch(...)
-    {
-      m_load_min = old_load_min;
-      m_load_max = old_load_max;
-      m_next_shrink_size = old_next_shrink_size;
-      m_next_grow_size = old_next_grow_size;
-      m_resize_needed = old_resize_needed;
-
-      throw;
-    }
-}
-
-PB_ASSOC_CLASS_T_DEC
-void
-PB_ASSOC_CLASS_C_DEC::
-do_resize(size_type /*new_size*/)
-{
-  std::abort();
-}
-
-#ifdef PB_ASSOC_HT_LOAD_CHECK_RESIZE_TRIGGER_DEBUG
-PB_ASSOC_CLASS_T_DEC
-void
-PB_ASSOC_CLASS_C_DEC::
-assert_valid() const
-{
-  PB_ASSOC_DBG_ASSERT(m_load_max > m_load_min);
-
-  PB_ASSOC_DBG_ASSERT(m_next_grow_size >= m_next_shrink_size);
-}
-#endif // #ifdef PB_ASSOC_HT_LOAD_CHECK_RESIZE_TRIGGER_DEBUG
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/resize_policy/hash_prime_size_policy_imp.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/resize_policy/hash_prime_size_policy_imp.hpp
deleted file mode 100644
index a2e98548694..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/resize_policy/hash_prime_size_policy_imp.hpp
+++ /dev/null
@@ -1,150 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/*
- * @file hash_prime_size_policy_imp.hpp
- * Contains an implementation of hash_prime_size_policy.
- */
-
-namespace detail
-{
-
-  enum
-    {
-      num_distinct_sizes = 28
-    };
-
-  static const size_t s_a_sizes[num_distinct_sizes] =
-    {
-      /* Dealing cards... */
-      /* 0	*/ 53ul,
-      /* 1	*/ 97ul,
-      /* 2	*/ 193ul,
-      /* 3	*/ 389ul,
-      /* 4	*/ 769ul,
-      /* 5	*/ 1543ul,
-      /* 6	*/ 3079ul,
-      /* 7	*/ 6151ul,
-      /* 8	*/ 12289ul,
-      /* 9	*/ 24593ul,
-      /* 10	*/ 49157ul,
-      /* 11	*/ 98317ul,
-      /* 12	*/ 196613ul,
-      /* 13	*/ 393241ul,
-      /* 14	*/ 786433ul,
-      /* 15	*/ 1572869ul,
-      /* 16	*/ 3145739ul,
-      /* 17	*/ 6291469ul,
-      /* 18	*/ 12582917ul,
-      /* 19	*/ 25165843ul,
-      /* 20	*/ 50331653ul,
-      /* 21	*/ 100663319ul,
-      /* 22	*/ 201326611ul,
-      /* 23	*/ 402653189ul,
-      /* 24	*/ 805306457ul,
-      /* 25	*/ 1610612741,
-      /* 26	*/ 3221225473ul,
-      /* 27	*/ 4294967291ul
-      /* Pot's good, let's play */
-    };
-
-} // namespace detail
-
-PB_ASSOC_CLASS_T_DEC
-inline void
-PB_ASSOC_CLASS_C_DEC::
-swap(PB_ASSOC_CLASS_C_DEC& /*r_other*/)
-{ }
-
-PB_ASSOC_CLASS_T_DEC
-PB_ASSOC_CLASS_C_DEC::size_type
-PB_ASSOC_CLASS_C_DEC::
-get_init_size(size_type suggested_size) const
-{
-  return (get_nearest_larger_size_imp(suggested_size));
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline PB_ASSOC_CLASS_C_DEC::size_type
-PB_ASSOC_CLASS_C_DEC::
-get_nearest_larger_size(size_type cur_size) const
-{
-  PB_ASSOC_DBG_ONLY(assert_is_one_of_my_sizes(cur_size);)
-
-    return (get_nearest_larger_size_imp(cur_size));
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline PB_ASSOC_CLASS_C_DEC::size_type
-PB_ASSOC_CLASS_C_DEC::
-get_nearest_smaller_size(size_type cur_size) const
-{
-  PB_ASSOC_DBG_ONLY(assert_is_one_of_my_sizes(cur_size);)
-
-    return (*std::lower_bound(detail::s_a_sizes, detail::s_a_sizes + detail::num_distinct_sizes, cur_size - 1));
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline PB_ASSOC_CLASS_C_DEC::size_type
-PB_ASSOC_CLASS_C_DEC::
-get_nearest_larger_size_imp(size_type size) const
-{
-  const size_t* const p_upper =
-    std::upper_bound(detail::s_a_sizes, detail::s_a_sizes + detail::num_distinct_sizes, size);
-
-  return ((p_upper == detail::s_a_sizes + detail::num_distinct_sizes)?
-	  size :
-	  *p_upper);
-}
-
-#ifdef PB_ASSOC_HT_PRIME_SIZE_POLICY_DEBUG
-PB_ASSOC_CLASS_T_DEC
-void
-PB_ASSOC_CLASS_C_DEC::
-assert_is_one_of_my_sizes(size_type size)
-{
-  const size_t* const p_end =
-    detail::s_a_sizes + detail::num_distinct_sizes;
-
-  const size_t* const p_found =
-    std::find(detail::s_a_sizes, p_end, size)
-
-    PB_ASSOC_DBG_ASSERT(p_found != p_end);
-}
-#endif // #ifdef PB_ASSOC_HT_PRIME_SIZE_POLICY_DEBUG
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/resize_policy/hash_standard_resize_policy_imp.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/resize_policy/hash_standard_resize_policy_imp.hpp
deleted file mode 100644
index c1df321071b..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/resize_policy/hash_standard_resize_policy_imp.hpp
+++ /dev/null
@@ -1,342 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/*
- * @file hash_standard_resize_policy_imp.hpp
- * Contains an implementation of hash_standard_resize_policy.
- */
-
-#ifdef PB_ASSOC_HT_STANDARD_RESIZE_POLICY_DEBUG
-#define PB_ASSOC_DBG_ASSERT(X) assert(X)
-#define PB_ASSOC_DBG_VERIFY(X) assert(X)
-#define PB_ASSOC_DBG_ONLY(X) X
-#else // #ifdef PB_ASSOC_HT_STANDARD_RESIZE_POLICY_DEBUG
-#define PB_ASSOC_DBG_ASSERT(X)
-#define PB_ASSOC_DBG_VERIFY(X) {if((X)==0);}
-#define PB_ASSOC_DBG_ONLY(X) ;
-#endif // #ifdef PB_ASSOC_HT_STANDARD_RESIZE_POLICY_DEBUG
-
-PB_ASSOC_CLASS_T_DEC
-pb_assoc::detail::int_to_type<External_Size_Access>
-PB_ASSOC_CLASS_C_DEC::s_external_size_access_indicator;
-
-PB_ASSOC_CLASS_T_DEC
-PB_ASSOC_CLASS_C_DEC::
-hash_standard_resize_policy(size_type suggested_size /*= 8*/) :
-  m_size(Size_Policy::get_init_size(suggested_size))
-{
-  my_trigger_policy_base::notify_externally_resized(
-						    Size_Policy::get_init_size(suggested_size));
-}
-
-PB_ASSOC_CLASS_T_DEC
-PB_ASSOC_CLASS_C_DEC::
-hash_standard_resize_policy(const Size_Policy& r_size_policy, size_type suggested_size /*= 8*/) :
-  Size_Policy(r_size_policy),
-  m_size(Size_Policy::get_init_size(suggested_size))
-{ }
-
-PB_ASSOC_CLASS_T_DEC
-PB_ASSOC_CLASS_C_DEC::
-hash_standard_resize_policy(const Size_Policy& r_size_policy, const Trigger_Policy& r_trigger_policy, size_type suggested_size /*= 8*/) :
-  Size_Policy(r_size_policy),
-  Trigger_Policy(r_trigger_policy),
-  m_size(Size_Policy::get_init_size(suggested_size))
-{ }
-
-PB_ASSOC_CLASS_T_DEC
-PB_ASSOC_CLASS_C_DEC::
-~hash_standard_resize_policy()
-{ }
-
-PB_ASSOC_CLASS_T_DEC
-void
-PB_ASSOC_CLASS_C_DEC::
-swap(PB_ASSOC_CLASS_C_DEC& r_other)
-{
-  my_trigger_policy_base::swap(r_other);
-
-  my_size_policy_base::swap(r_other);
-
-  std::swap(m_size, r_other.m_size);
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline void
-PB_ASSOC_CLASS_C_DEC::
-notify_find_search_start()
-{
-  my_trigger_policy_base::notify_find_search_start();
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline void
-PB_ASSOC_CLASS_C_DEC::
-notify_find_search_collision()
-{
-  my_trigger_policy_base::notify_find_search_collision();
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline void
-PB_ASSOC_CLASS_C_DEC::
-notify_find_search_end()
-{
-  my_trigger_policy_base::notify_find_search_end();
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline void
-PB_ASSOC_CLASS_C_DEC::
-notify_insert_search_start()
-{
-  my_trigger_policy_base::notify_insert_search_start();
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline void
-PB_ASSOC_CLASS_C_DEC::
-notify_insert_search_collision()
-{
-  my_trigger_policy_base::notify_insert_search_collision();
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline void
-PB_ASSOC_CLASS_C_DEC::
-notify_insert_search_end()
-{
-  my_trigger_policy_base::notify_insert_search_end();
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline void
-PB_ASSOC_CLASS_C_DEC::
-notify_erase_search_start()
-{
-  my_trigger_policy_base::notify_erase_search_start();
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline void
-PB_ASSOC_CLASS_C_DEC::
-notify_erase_search_collision()
-{
-  my_trigger_policy_base::notify_erase_search_collision();
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline void
-PB_ASSOC_CLASS_C_DEC::
-notify_erase_search_end()
-{
-  my_trigger_policy_base::notify_erase_search_end();
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline void
-PB_ASSOC_CLASS_C_DEC::
-notify_inserted(size_type num_e)
-{
-  my_trigger_policy_base::notify_inserted(num_e);
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline void
-PB_ASSOC_CLASS_C_DEC::
-notify_erased(size_type num_e)
-{
-  my_trigger_policy_base::notify_inserted(num_e);
-}
-
-PB_ASSOC_CLASS_T_DEC
-void
-PB_ASSOC_CLASS_C_DEC::
-notify_cleared()
-{
-  my_trigger_policy_base::notify_cleared();
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline bool
-PB_ASSOC_CLASS_C_DEC::
-is_resize_needed() const
-{
-  return (my_trigger_policy_base::is_resize_needed());
-}
-
-PB_ASSOC_CLASS_T_DEC
-typename PB_ASSOC_CLASS_C_DEC::size_type
-PB_ASSOC_CLASS_C_DEC::
-get_new_size(size_type size, size_type num_used_e) const
-{
-  PB_ASSOC_DBG_ASSERT(m_size == size);
-
-  if (my_trigger_policy_base::
-      is_grow_needed(size, num_used_e))
-    return (my_size_policy_base::get_nearest_larger_size(m_size));
-
-  PB_ASSOC_DBG_ASSERT(my_trigger_policy_base::
-		      is_shrink_needed(size, num_used_e));
-
-  return (my_size_policy_base::get_nearest_smaller_size(m_size));
-}
-
-PB_ASSOC_CLASS_T_DEC
-typename PB_ASSOC_CLASS_C_DEC::size_type
-PB_ASSOC_CLASS_C_DEC::
-get_init_size() const
-{
-  PB_ASSOC_DBG_ASSERT(m_size ==
-		      my_trigger_policy_base::get_init_size());
-
-  return (m_size);
-}
-
-PB_ASSOC_CLASS_T_DEC
-void
-PB_ASSOC_CLASS_C_DEC::
-notify_resized(size_type new_size)
-{
-  my_trigger_policy_base::notify_resized(new_size);
-
-  m_size = new_size;
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::size_type
-PB_ASSOC_CLASS_C_DEC::
-get_actual_size() const
-{
-  return (get_actual_size(s_external_size_access_indicator));
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::size_type
-PB_ASSOC_CLASS_C_DEC::
-get_actual_size(external_resize_true_indicator) const
-{
-  return (m_size);
-}
-
-PB_ASSOC_CLASS_T_DEC
-void
-PB_ASSOC_CLASS_C_DEC::
-resize(size_type new_size)
-{
-  resize(new_size, s_external_size_access_indicator);
-}
-
-PB_ASSOC_CLASS_T_DEC
-void
-PB_ASSOC_CLASS_C_DEC::
-resize(size_type new_size, external_resize_true_indicator)
-{
-  size_type actual_new_size = my_size_policy_base::get_init_size(1);
-  while (actual_new_size < new_size)
-    {
-      const size_type pot =
-	my_size_policy_base::get_nearest_larger_size(actual_new_size);
-
-      if (pot == actual_new_size&&  pot < new_size)
-	throw cannot_resize();
-
-      actual_new_size = pot;
-    }
-
-  const size_type old_size = m_size;
-
-  try
-    {
-      do_resize(actual_new_size);
-    }
-  catch(cannot_insert& )
-    {
-      m_size = old_size;
-
-      throw cannot_resize();
-    }
-  catch(...)
-    {
-      m_size = old_size;
-
-      throw;
-    }
-}
-
-PB_ASSOC_CLASS_T_DEC
-void
-PB_ASSOC_CLASS_C_DEC::
-do_resize(size_type /*new_size*/)
-{
-  // Tmp Ami
-  std::abort();
-}
-
-PB_ASSOC_CLASS_T_DEC
-Trigger_Policy& 
-PB_ASSOC_CLASS_C_DEC::
-get_trigger_policy()
-{
-  return (*this);
-}
-
-PB_ASSOC_CLASS_T_DEC
-const Trigger_Policy& 
-PB_ASSOC_CLASS_C_DEC::
-get_trigger_policy() const
-{
-  return (*this);
-}
-
-PB_ASSOC_CLASS_T_DEC
-Size_Policy& 
-PB_ASSOC_CLASS_C_DEC::
-get_size_policy()
-{
-  return (*this);
-}
-
-PB_ASSOC_CLASS_T_DEC
-const Size_Policy& 
-PB_ASSOC_CLASS_C_DEC::
-get_size_policy() const
-{
-  return (*this);
-}
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/resize_policy/ht_prime_size_policy_imp.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/resize_policy/ht_prime_size_policy_imp.hpp
deleted file mode 100644
index b4dfb4e0fb5..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/resize_policy/ht_prime_size_policy_imp.hpp
+++ /dev/null
@@ -1,97 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file ht_prime_size_policy_imp.hpp
- * Contains implementation details for ht_prime_size_policy.
- */
-
-#ifndef HT_PRIME_SIZE_POLICY_IMP_HPP
-#define HT_PRIME_SIZE_POLICY_IMP_HPP
-
-namespace pb_assoc
-{
-
-  namespace detail
-  {
-
-    enum
-      {
-	num_distinct_sizes = 28
-      };
-
-    static const size_t s_a_sizes[num_distinct_sizes] =
-      {
-	/* Dealing cards... */
-	/* 0	*/ 53ul,
-	/* 1	*/ 97ul,
-	/* 2	*/ 193ul,
-	/* 3	*/ 389ul,
-	/* 4	*/ 769ul,
-	/* 5	*/ 1543ul,
-	/* 6	*/ 3079ul,
-	/* 7	*/ 6151ul,
-	/* 8	*/ 12289ul,
-	/* 9	*/ 24593ul,
-	/* 10	*/ 49157ul,
-	/* 11	*/ 98317ul,
-	/* 12	*/ 196613ul,
-	/* 13	*/ 393241ul,
-	/* 14	*/ 786433ul,
-	/* 15	*/ 1572869ul,
-	/* 16	*/ 3145739ul,
-	/* 17	*/ 6291469ul,
-	/* 18	*/ 12582917ul,
-	/* 19	*/ 25165843ul,
-	/* 20	*/ 50331653ul,
-	/* 21	*/ 100663319ul,
-	/* 22	*/ 201326611ul,
-	/* 23	*/ 402653189ul,
-	/* 24	*/ 805306457ul,
-	/* 25	*/ 1610612741,
-	/* 26	*/ 3221225473ul,
-	/* 27	*/ 4294967291ul
-	/* Pot's good, let's play */
-      };
-
-  } // namespace detail
-
-} // namespace pb_assoc
-
-#endif // #ifndef HT_PRIME_SIZE_POLICY_IMP_HPP
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/resize_policy/size_base.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/resize_policy/size_base.hpp
deleted file mode 100644
index d9fb53a585c..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/resize_policy/size_base.hpp
+++ /dev/null
@@ -1,170 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file size_base.hpp
- * Contains an base holding size for some resize policies.
- */
-
-#ifndef SIZE_BASE_HPP
-#define SIZE_BASE_HPP
-
-namespace pb_assoc
-{
-
-  namespace detail
-  {
-
-    template<typename Size_Type, bool Hold_Size>
-    class size_base;
-
-#define PB_ASSOC_CLASS_T_DEC \
-	template<typename Size_Type>
-
-#define PB_ASSOC_CLASS_C_DEC \
-	size_base< \
-		Size_Type, \
-		true>
-
-    template<typename Size_Type>
-    class size_base<
-      Size_Type,
-      true>
-    {
-    protected:
-      typedef Size_Type size_type;
-
-    protected:
-      inline
-      size_base();
-
-      inline void
-      swap(PB_ASSOC_CLASS_C_DEC& r_other);
-
-      inline void
-      set_size(size_type size);
-
-      inline size_type
-      get_size() const;
-
-    private:
-      size_type m_size;
-    };
-
-    PB_ASSOC_CLASS_T_DEC
-    PB_ASSOC_CLASS_C_DEC::
-    size_base() :
-      m_size(0)
-    { }
-
-    PB_ASSOC_CLASS_T_DEC
-    inline void
-    PB_ASSOC_CLASS_C_DEC::
-    set_size(size_type size)
-    {
-      m_size = size;
-    }
-
-    PB_ASSOC_CLASS_T_DEC
-    inline typename PB_ASSOC_CLASS_C_DEC::size_type
-    PB_ASSOC_CLASS_C_DEC::
-    get_size() const
-    {
-      return (m_size);
-    }
-
-    PB_ASSOC_CLASS_T_DEC
-    inline void
-    PB_ASSOC_CLASS_C_DEC::
-    swap(PB_ASSOC_CLASS_C_DEC& r_other)
-    {
-      std::swap(m_size, r_other.m_size);
-    }
-
-#undef PB_ASSOC_CLASS_T_DEC
-
-#undef PB_ASSOC_CLASS_C_DEC
-
-#define PB_ASSOC_CLASS_T_DEC \
-	template<typename Size_Type>
-
-#define PB_ASSOC_CLASS_C_DEC \
-	size_base< \
-		Size_Type, \
-		false>
-
-    template<typename Size_Type>
-    class size_base<
-      Size_Type,
-      false>
-    {
-    protected:
-      typedef Size_Type size_type;
-
-    protected:
-      inline void
-      swap(PB_ASSOC_CLASS_C_DEC& r_other);
-
-      inline void
-      set_size(size_type size);
-    };
-
-    PB_ASSOC_CLASS_T_DEC
-    inline void
-    PB_ASSOC_CLASS_C_DEC::
-    swap(PB_ASSOC_CLASS_C_DEC& /*r_other*/)
-    { }
-
-    PB_ASSOC_CLASS_T_DEC
-    inline void
-    PB_ASSOC_CLASS_C_DEC::
-    set_size(size_type /*size*/)
-    {
-      // Do nothing
-    }
-
-#undef PB_ASSOC_CLASS_T_DEC
-
-#undef PB_ASSOC_CLASS_C_DEC
-
-  } // namespace detail
-
-} // namespace pb_assoc
-
-#endif // #ifndef SIZE_BASE_HPP
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/splay_tree_/constructors_destructor_fn_imps.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/splay_tree_/constructors_destructor_fn_imps.hpp
deleted file mode 100644
index 3d2b53721d0..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/splay_tree_/constructors_destructor_fn_imps.hpp
+++ /dev/null
@@ -1,112 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file constructors_destructor_fn_imps.hpp
- * Contains an implementation class for splay_tree_.
- */
-
-PB_ASSOC_CLASS_T_DEC
-template<class It>
-void
-PB_ASSOC_CLASS_C_DEC::
-copy_from_range(It first_it, It last_it)
-{
-  while (first_it != last_it)
-    insert(*(first_it++));
-}
-
-PB_ASSOC_CLASS_T_DEC
-PB_ASSOC_CLASS_C_DEC::
-PB_ASSOC_CLASS_NAME()
-{
-  initialize();
-
-  PB_ASSOC_DBG_ONLY(PB_ASSOC_CLASS_C_DEC::assert_valid();)
-    }
-
-PB_ASSOC_CLASS_T_DEC
-PB_ASSOC_CLASS_C_DEC::
-PB_ASSOC_CLASS_NAME(const Cmp_Fn& r_cmp_fn) :
-  PB_ASSOC_BASE_C_DEC(r_cmp_fn)
-{
-  initialize();
-
-  PB_ASSOC_DBG_ONLY(PB_ASSOC_CLASS_C_DEC::assert_valid();)
-    }
-
-PB_ASSOC_CLASS_T_DEC
-PB_ASSOC_CLASS_C_DEC::
-PB_ASSOC_CLASS_NAME(const Cmp_Fn& r_cmp_fn, const Node_Updator& r_node_updator) :
-  PB_ASSOC_BASE_C_DEC(r_cmp_fn, r_node_updator)
-{
-  initialize();
-
-  PB_ASSOC_DBG_ONLY(PB_ASSOC_CLASS_C_DEC::assert_valid();)
-    }
-
-PB_ASSOC_CLASS_T_DEC
-PB_ASSOC_CLASS_C_DEC::
-PB_ASSOC_CLASS_NAME(const PB_ASSOC_CLASS_C_DEC& r_other) :
-  PB_ASSOC_BASE_C_DEC(r_other)
-{
-  PB_ASSOC_DBG_ONLY(PB_ASSOC_CLASS_C_DEC::assert_valid();)
-    }
-
-PB_ASSOC_CLASS_T_DEC
-void
-PB_ASSOC_CLASS_C_DEC::
-swap(PB_ASSOC_CLASS_C_DEC& r_other)
-{
-  PB_ASSOC_DBG_ONLY(PB_ASSOC_CLASS_C_DEC::assert_valid();)
-    PB_ASSOC_DBG_ONLY(r_other.PB_ASSOC_CLASS_C_DEC::assert_valid();)
-
-    PB_ASSOC_BASE_C_DEC::swap(r_other);
-
-  PB_ASSOC_DBG_ONLY(PB_ASSOC_CLASS_C_DEC::assert_valid();)
-    PB_ASSOC_DBG_ONLY(r_other.PB_ASSOC_CLASS_C_DEC::assert_valid();)
-    }
-
-PB_ASSOC_CLASS_T_DEC
-void
-PB_ASSOC_CLASS_C_DEC::
-initialize()
-{
-  PB_ASSOC_BASE_C_DEC::m_p_head->m_special = true;
-}
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/splay_tree_/debug_fn_imps.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/splay_tree_/debug_fn_imps.hpp
deleted file mode 100644
index 73230ad568e..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/splay_tree_/debug_fn_imps.hpp
+++ /dev/null
@@ -1,73 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file debug_fn_imps.hpp
- * Contains an implementation class for splay_tree_.
- */
-
-#ifdef PB_ASSOC_SPLAY_TREE_DEBUG_
-
-PB_ASSOC_CLASS_T_DEC
-void
-PB_ASSOC_CLASS_C_DEC::
-assert_valid() const
-{
-  PB_ASSOC_BASE_C_DEC::assert_valid(true, true);
-
-  assert_special_imp(m_p_head->m_p_parent);
-}
-
-PB_ASSOC_CLASS_T_DEC
-void
-PB_ASSOC_CLASS_C_DEC::
-assert_special_imp(const node_pointer p_nd) const
-{
-  if (p_nd == NULL)
-    return;
-
-  PB_ASSOC_DBG_ASSERT(!p_nd->m_special);
-
-  assert_special_imp(p_nd->m_p_left);
-
-  assert_special_imp(p_nd->m_p_right);
-}
-
-#endif // #ifdef PB_ASSOC_SPLAY_TREE_DEBUG_
-
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/splay_tree_/erase_fn_imps.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/splay_tree_/erase_fn_imps.hpp
deleted file mode 100644
index 06806275ecf..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/splay_tree_/erase_fn_imps.hpp
+++ /dev/null
@@ -1,245 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file erase_fn_imps.hpp
- * Contains an implementation class for splay_tree_.
- */
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::size_type
-PB_ASSOC_CLASS_C_DEC::
-erase(const_key_reference r_key)
-{
-  iterator it = find(r_key);
-
-  if (it == PB_ASSOC_BASE_C_DEC::find_end())
-    return (0);
-
-  erase(it);
-
-  return (1);
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::const_iterator
-PB_ASSOC_CLASS_C_DEC::
-erase(const_iterator it)
-{
-  PB_ASSOC_DBG_ONLY(PB_ASSOC_CLASS_C_DEC::assert_valid());
-
-  if (it == PB_ASSOC_BASE_C_DEC::find_end())
-    return (it);
-
-  const_iterator ret_it = it;
-
-  ++ret_it;
-
-  erase_node(it.m_p_nd);
-
-  return (ret_it);
-}
-
-#ifdef PB_ASSOC_DATA_TRUE_INDICATOR
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::iterator
-PB_ASSOC_CLASS_C_DEC::
-erase(iterator it)
-{
-  PB_ASSOC_DBG_ONLY(PB_ASSOC_CLASS_C_DEC::assert_valid());
-  PB_ASSOC_DBG_ONLY(PB_ASSOC_BASE_C_DEC::assert_iterators();)
-
-    if (it == PB_ASSOC_BASE_C_DEC::find_end())
-      return (it);
-
-  iterator ret_it = it;
-
-  ++ret_it;
-
-  erase_node(it.m_p_nd);
-
-  PB_ASSOC_DBG_ONLY(PB_ASSOC_CLASS_C_DEC::assert_valid());
-  PB_ASSOC_DBG_ONLY(PB_ASSOC_BASE_C_DEC::assert_iterators();)
-
-    return (ret_it);
-}
-#endif // #ifdef PB_ASSOC_DATA_TRUE_INDICATOR
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::const_reverse_iterator
-PB_ASSOC_CLASS_C_DEC::
-erase(const_reverse_iterator it)
-{
-  PB_ASSOC_DBG_ONLY(PB_ASSOC_CLASS_C_DEC::assert_valid());
-
-  if (it == PB_ASSOC_BASE_C_DEC::find_rend())
-    return (it);
-
-  const_reverse_iterator ret_it = it;
-
-  ++ret_it;
-
-  erase_node(it.m_p_nd);
-
-  PB_ASSOC_DBG_ONLY(PB_ASSOC_CLASS_C_DEC::assert_valid());
-
-  return (ret_it);
-}
-
-#ifdef PB_ASSOC_DATA_TRUE_INDICATOR
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::reverse_iterator
-PB_ASSOC_CLASS_C_DEC::
-erase(reverse_iterator it)
-{
-  PB_ASSOC_DBG_ONLY(PB_ASSOC_CLASS_C_DEC::assert_valid());
-
-  if (it == PB_ASSOC_BASE_C_DEC::find_rend())
-    return (it);
-
-  reverse_iterator ret_it = it;
-
-  ++ret_it;
-
-  erase_node(it.m_p_nd);
-
-  PB_ASSOC_DBG_ONLY(PB_ASSOC_CLASS_C_DEC::assert_valid());
-
-  return (ret_it);
-}
-#endif // #ifdef PB_ASSOC_DATA_TRUE_INDICATOR
-
-PB_ASSOC_CLASS_T_DEC
-template<class Pred>
-inline typename PB_ASSOC_CLASS_C_DEC::size_type
-PB_ASSOC_CLASS_C_DEC::
-erase_if(Pred pred)
-{
-  PB_ASSOC_DBG_ONLY(PB_ASSOC_CLASS_C_DEC::assert_valid();)
-
-    size_type num_ersd = 0;
-
-  iterator it = PB_ASSOC_BASE_C_DEC::begin();
-
-  while (it != PB_ASSOC_BASE_C_DEC::end())
-    if (pred(*it))
-      {
-	++num_ersd;
-
-	it = erase(it);
-      }
-    else
-      ++it;
-
-  PB_ASSOC_DBG_ONLY(PB_ASSOC_CLASS_C_DEC::assert_valid();)
-
-    return (num_ersd);
-}
-
-PB_ASSOC_CLASS_T_DEC
-void
-PB_ASSOC_CLASS_C_DEC::
-erase_node(node_pointer p_nd)
-{
-  PB_ASSOC_DBG_ASSERT(p_nd != NULL);
-
-  splay(p_nd);
-
-  PB_ASSOC_DBG_ONLY(assert_valid();)
-    PB_ASSOC_DBG_ASSERT(p_nd == PB_ASSOC_BASE_C_DEC::m_p_head->m_p_parent);
-
-  node_pointer p_l = p_nd->m_p_left;
-  node_pointer p_r = p_nd->m_p_right;
-
-  PB_ASSOC_BASE_C_DEC::update_min_max_for_erased_node(p_nd);
-
-  PB_ASSOC_BASE_C_DEC::actual_erase_node(p_nd);
-
-  if (p_r == NULL)
-    {
-      PB_ASSOC_BASE_C_DEC::m_p_head->m_p_parent = p_l;
-
-      if (p_l != NULL)
-	p_l->m_p_parent = PB_ASSOC_BASE_C_DEC::m_p_head;
-
-      PB_ASSOC_DBG_ONLY(assert_valid();)
-
-	return;
-    }
-
-  node_pointer p_target_r = leftmost(p_r);
-
-  PB_ASSOC_DBG_ASSERT(p_target_r != NULL);
-
-  p_r->m_p_parent = PB_ASSOC_BASE_C_DEC::m_p_head;
-
-  PB_ASSOC_BASE_C_DEC::m_p_head->m_p_parent = p_r;
-
-  splay(p_target_r);
-
-  PB_ASSOC_DBG_ONLY(p_target_r->m_p_left = NULL);
-
-  PB_ASSOC_DBG_ASSERT(p_target_r->m_p_parent ==
-		      PB_ASSOC_BASE_C_DEC::m_p_head);
-
-  PB_ASSOC_DBG_ASSERT(PB_ASSOC_BASE_C_DEC::m_p_head->m_p_parent ==
-		      p_target_r);
-
-  p_target_r->m_p_left = p_l;
-
-  if (p_l != NULL)
-    p_l->m_p_parent = p_target_r;
-
-  PB_ASSOC_DBG_ONLY(assert_valid();)
-
-    apply_update(p_target_r, (Node_Updator* )this);
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::node_pointer
-PB_ASSOC_CLASS_C_DEC::
-leftmost(node_pointer p_nd)
-{
-  PB_ASSOC_DBG_ASSERT(p_nd != NULL);
-
-  while (p_nd->m_p_left != NULL)
-    p_nd = p_nd->m_p_left;
-
-  return (p_nd);
-}
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/splay_tree_/find_fn_imps.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/splay_tree_/find_fn_imps.hpp
deleted file mode 100644
index 137712711aa..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/splay_tree_/find_fn_imps.hpp
+++ /dev/null
@@ -1,122 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file find_fn_imps.hpp
- * Contains an implementation class for splay_tree_.
- */
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::find_iterator
-PB_ASSOC_CLASS_C_DEC::
-lower_bound(const_key_reference r_key)
-{
-  find_iterator it = PB_ASSOC_BASE_C_DEC::find(r_key);
-
-  if (it != PB_ASSOC_BASE_C_DEC::end())
-    splay(it.m_p_nd);
-
-  return (it);
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::const_find_iterator
-PB_ASSOC_CLASS_C_DEC::
-lower_bound(const_key_reference r_key) const
-{
-  find_iterator it = PB_ASSOC_BASE_C_DEC::lower_bound(r_key);
-
-  if (it != PB_ASSOC_BASE_C_DEC::end())
-    splay(it.m_p_nd);
-
-  return (it);
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::find_iterator
-PB_ASSOC_CLASS_C_DEC::
-upper_bound(const_key_reference r_key)
-{
-  find_iterator it = PB_ASSOC_BASE_C_DEC::upper_bound(r_key);
-
-  if (it != PB_ASSOC_BASE_C_DEC::end())
-    splay(it.m_p_nd);
-
-  return (it);
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::const_find_iterator
-PB_ASSOC_CLASS_C_DEC::
-upper_bound(const_key_reference r_key) const
-{
-  find_iterator it = PB_ASSOC_BASE_C_DEC::upper_bound(r_key);
-
-  if (it != PB_ASSOC_BASE_C_DEC::end())
-    splay(it.m_p_nd);
-
-  return (it);
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::find_iterator
-PB_ASSOC_CLASS_C_DEC::
-find(const_key_reference r_key)
-{
-  find_iterator it = PB_ASSOC_BASE_C_DEC::find(r_key);
-
-  if (it != PB_ASSOC_BASE_C_DEC::end())
-    splay(it.m_p_nd);
-
-  return (it);
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::const_find_iterator
-PB_ASSOC_CLASS_C_DEC::
-find(const_key_reference r_key) const
-{
-  const_find_iterator it = PB_ASSOC_BASE_C_DEC::find(r_key);
-
-  if (it != PB_ASSOC_BASE_C_DEC::end())
-    const_cast<PB_ASSOC_CLASS_C_DEC* >(this)->splay(it.m_p_nd);
-
-  return (it);
-}
-
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/splay_tree_/info_fn_imps.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/splay_tree_/info_fn_imps.hpp
deleted file mode 100644
index cb01109cf16..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/splay_tree_/info_fn_imps.hpp
+++ /dev/null
@@ -1,43 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file info_fn_imps.hpp
- * Contains an implementation.
- */
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/splay_tree_/insert_fn_imps.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/splay_tree_/insert_fn_imps.hpp
deleted file mode 100644
index 917284f20ed..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/splay_tree_/insert_fn_imps.hpp
+++ /dev/null
@@ -1,89 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file insert_fn_imps.hpp
- * Contains an implementation class for splay_tree_.
- */
-
-PB_ASSOC_CLASS_T_DEC
-inline std::pair<typename PB_ASSOC_CLASS_C_DEC::find_iterator, bool>
-PB_ASSOC_CLASS_C_DEC::
-insert(const_reference r_value)
-{
-  PB_ASSOC_DBG_ONLY(PB_ASSOC_CLASS_C_DEC::assert_valid();)
-
-    std::pair<find_iterator, bool> ins_pair =
-    PB_ASSOC_BASE_C_DEC::insert_leaf(r_value);
-
-  ins_pair.first.m_p_nd->m_special = false;
-
-  PB_ASSOC_DBG_ONLY(PB_ASSOC_BASE_C_DEC::assert_valid(true, true));
-
-  splay(ins_pair.first.m_p_nd);
-
-  PB_ASSOC_DBG_ONLY(PB_ASSOC_BASE_C_DEC::assert_valid(true, true));
-
-  return (ins_pair);
-}
-
-#ifdef PB_ASSOC_DATA_TRUE_INDICATOR
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::data_reference
-PB_ASSOC_CLASS_C_DEC::
-subscript_imp(const_key_reference r_key)
-{
-  PB_ASSOC_DBG_ONLY(PB_ASSOC_CLASS_C_DEC::assert_valid();)
-
-    std::pair<find_iterator, bool> ins_pair =
-    PB_ASSOC_BASE_C_DEC::insert_leaf(
-				     value_type(r_key, Data()));
-
-  ins_pair.first.m_p_nd->m_special = false;
-
-  PB_ASSOC_DBG_ONLY(PB_ASSOC_BASE_C_DEC::assert_valid());
-
-  splay(ins_pair.first.m_p_nd);
-
-  PB_ASSOC_DBG_ONLY(PB_ASSOC_CLASS_C_DEC::assert_valid();)
-
-    return (ins_pair.first.m_p_nd->m_value.second);
-}
-#endif // #ifdef PB_ASSOC_DATA_TRUE
-
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/splay_tree_/node.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/splay_tree_/node.hpp
deleted file mode 100644
index c9a54602f1f..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/splay_tree_/node.hpp
+++ /dev/null
@@ -1,89 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file node.hpp
- * Contains an implementation struct for splay_tree_'s node.
- */
-
-#ifndef SPLAY_TREE_NODE_HPP
-#define SPLAY_TREE_NODE_HPP
-
-namespace pb_assoc
-{
-
-  namespace detail
-  {
-
-    template<class Value_Type, class Allocator>
-    struct splay_tree_node_
-    {
-    public:
-      typedef
-      typename Allocator::template rebind<
-	splay_tree_node_<
-	Value_Type,
-	Allocator> >::other::pointer
-      node_pointer;
-
-    public:
-      inline bool
-      special_dec_check() const
-      {
-	return (m_special);
-      }
-
-    public:
-      typedef Value_Type value_type;
-
-      value_type m_value;
-
-      bool m_special;
-
-      node_pointer m_p_left;
-      node_pointer m_p_right;
-
-      node_pointer m_p_parent;
-    };
-
-  } // namespace detail
-
-} // namespace pb_assoc
-
-#endif // #ifndef SPLAY_TREE_NODE_HPP
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/splay_tree_/splay_fn_imps.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/splay_tree_/splay_fn_imps.hpp
deleted file mode 100644
index 24ed4a0078d..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/splay_tree_/splay_fn_imps.hpp
+++ /dev/null
@@ -1,289 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file splay_fn_imps.hpp
- * Contains an implementation class for splay_tree_.
- */
-
-PB_ASSOC_CLASS_T_DEC
-void
-PB_ASSOC_CLASS_C_DEC::
-splay(node_pointer p_nd)
-{
-  while (p_nd->m_p_parent != PB_ASSOC_BASE_C_DEC::m_p_head)
-    {
-      PB_ASSOC_DBG_ONLY(PB_ASSOC_BASE_C_DEC::assert_node_consistent(p_nd);)
-
-	if (p_nd->m_p_parent->m_p_parent ==
-	    PB_ASSOC_BASE_C_DEC::m_p_head)
-	  {
-	    PB_ASSOC_BASE_C_DEC::rotate_parent(p_nd);
-
-	    PB_ASSOC_DBG_ASSERT(p_nd ==
-				PB_ASSOC_BASE_C_DEC::m_p_head->m_p_parent);
-	  }
-	else
-	  {
-	    const node_pointer p_parent = p_nd->m_p_parent;
-	    const node_pointer p_grandparent = p_parent->m_p_parent;
-
-#ifdef PB_ASSOC_SPLAY_TREE_DEBUG_
-	    const size_type total =
-	      PB_ASSOC_BASE_C_DEC::recursive_count(p_grandparent);
-
-	    PB_ASSOC_DBG_ASSERT(total >= 3);
-#endif // #ifdef PB_ASSOC_SPLAY_TREE_DEBUG_
-
-	    if (p_parent->m_p_left == p_nd&& 
-		p_grandparent->m_p_right == p_parent)
-	      splay_zig_zag_left(p_nd, p_parent, p_grandparent);
-	    else if (p_parent->m_p_right == p_nd&& 
-		     p_grandparent->m_p_left == p_parent)
-	      splay_zig_zag_right(p_nd, p_parent, p_grandparent);
-	    else if (p_parent->m_p_left == p_nd&& 
-		     p_grandparent->m_p_left == p_parent)
-	      splay_zig_zig_left(p_nd, p_parent, p_grandparent);
-	    else
-	      splay_zig_zig_right(p_nd, p_parent, p_grandparent);
-
-	    PB_ASSOC_DBG_ASSERT(total ==
-				PB_ASSOC_BASE_C_DEC::recursive_count(p_nd));
-	  }
-
-      PB_ASSOC_DBG_ONLY(assert_node_consistent(p_nd);)
-	}
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline void
-PB_ASSOC_CLASS_C_DEC::
-splay_zig_zag_left(node_pointer p_nd, node_pointer p_parent, node_pointer p_grandparent)
-{
-  PB_ASSOC_DBG_ASSERT(p_parent == p_nd->m_p_parent);
-  PB_ASSOC_DBG_ASSERT(p_grandparent == p_parent->m_p_parent);
-
-  PB_ASSOC_DBG_ONLY(assert_node_consistent(p_grandparent);)
-
-    PB_ASSOC_DBG_ASSERT(p_parent->m_p_left == p_nd&& 
-			p_grandparent->m_p_right == p_parent);
-
-  splay_zz_start(p_nd, p_parent, p_grandparent);
-
-  node_pointer p_b = p_nd->m_p_right;
-  node_pointer p_c = p_nd->m_p_left;
-
-  p_nd->m_p_right = p_parent;
-  p_parent->m_p_parent = p_nd;
-
-  p_nd->m_p_left = p_grandparent;
-  p_grandparent->m_p_parent = p_nd;
-
-  p_parent->m_p_left = p_b;
-  if (p_b != NULL)
-    p_b->m_p_parent = p_parent;
-
-  p_grandparent->m_p_right = p_c;
-  if (p_c != NULL)
-    p_c->m_p_parent = p_grandparent;
-
-  splay_zz_end(p_nd, p_parent, p_grandparent);
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline void
-PB_ASSOC_CLASS_C_DEC::
-splay_zig_zag_right(node_pointer p_nd, node_pointer p_parent, node_pointer p_grandparent)
-{
-  PB_ASSOC_DBG_ASSERT(p_parent == p_nd->m_p_parent);
-  PB_ASSOC_DBG_ASSERT(p_grandparent == p_parent->m_p_parent);
-
-  PB_ASSOC_DBG_ONLY(assert_node_consistent(p_grandparent);)
-
-    PB_ASSOC_DBG_ASSERT(p_parent->m_p_right == p_nd&& 
-			p_grandparent->m_p_left == p_parent);
-
-  splay_zz_start(p_nd, p_parent, p_grandparent);
-
-  node_pointer p_b = p_nd->m_p_left;
-  node_pointer p_c = p_nd->m_p_right;
-
-  p_nd->m_p_left = p_parent;
-  p_parent->m_p_parent = p_nd;
-
-  p_nd->m_p_right = p_grandparent;
-  p_grandparent->m_p_parent = p_nd;
-
-  p_parent->m_p_right = p_b;
-  if (p_b != NULL)
-    p_b->m_p_parent = p_parent;
-
-  p_grandparent->m_p_left = p_c;
-  if (p_c != NULL)
-    p_c->m_p_parent = p_grandparent;
-
-  splay_zz_end(p_nd, p_parent, p_grandparent);
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline void
-PB_ASSOC_CLASS_C_DEC::
-splay_zig_zig_left(node_pointer p_nd, node_pointer p_parent, node_pointer p_grandparent)
-{
-  PB_ASSOC_DBG_ASSERT(p_parent == p_nd->m_p_parent);
-  PB_ASSOC_DBG_ASSERT(p_grandparent == p_parent->m_p_parent);
-
-  PB_ASSOC_DBG_ONLY(assert_node_consistent(p_grandparent);)
-
-    PB_ASSOC_DBG_ASSERT(p_parent->m_p_left == p_nd&& 
-			p_nd->m_p_parent->m_p_parent->m_p_left == p_nd->m_p_parent);
-
-  splay_zz_start(p_nd, p_parent, p_grandparent);
-
-  node_pointer p_b = p_nd->m_p_right;
-  node_pointer p_c = p_parent->m_p_right;
-
-  p_nd->m_p_right = p_parent;
-  p_parent->m_p_parent = p_nd;
-
-  p_parent->m_p_right = p_grandparent;
-  p_grandparent->m_p_parent = p_parent;
-
-  p_parent->m_p_left = p_b;
-  if (p_b != NULL)
-    p_b->m_p_parent = p_parent;
-
-  p_grandparent->m_p_left = p_c;
-  if (p_c != NULL)
-    p_c->m_p_parent = p_grandparent;
-
-  splay_zz_end(p_nd, p_parent, p_grandparent);
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline void
-PB_ASSOC_CLASS_C_DEC::
-splay_zig_zig_right(node_pointer p_nd, node_pointer p_parent, node_pointer p_grandparent)
-{
-  PB_ASSOC_DBG_ASSERT(p_parent == p_nd->m_p_parent);
-  PB_ASSOC_DBG_ASSERT(p_grandparent == p_parent->m_p_parent);
-
-  PB_ASSOC_DBG_ONLY(assert_node_consistent(p_grandparent);)
-
-    PB_ASSOC_DBG_ASSERT(p_parent->m_p_right == p_nd&& 
-			p_nd->m_p_parent->m_p_parent->m_p_right == p_nd->m_p_parent);
-
-  splay_zz_start(p_nd, p_parent, p_grandparent);
-
-  node_pointer p_b = p_nd->m_p_left;
-  node_pointer p_c = p_parent->m_p_left;
-
-  p_nd->m_p_left = p_parent;
-  p_parent->m_p_parent = p_nd;
-
-  p_parent->m_p_left = p_grandparent;
-  p_grandparent->m_p_parent = p_parent;
-
-  p_parent->m_p_right = p_b;
-  if (p_b != NULL)
-    p_b->m_p_parent = p_parent;
-
-  p_grandparent->m_p_right = p_c;
-  if (p_c != NULL)
-    p_c->m_p_parent = p_grandparent;
-
-  PB_ASSOC_BASE_C_DEC::update_to_top(
-				     p_grandparent, (Node_Updator* )this);
-
-  splay_zz_end(p_nd, p_parent, p_grandparent);
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline void
-PB_ASSOC_CLASS_C_DEC::
-splay_zz_start(node_pointer p_nd,
-#ifdef PB_ASSOC_SPLAY_TREE_DEBUG_
-	       node_pointer p_parent,
-#else // #ifdef PB_ASSOC_SPLAY_TREE_DEBUG_
-	       node_pointer /*p_parent*/,
-#endif // #ifdef PB_ASSOC_SPLAY_TREE_DEBUG_
-	       node_pointer p_grandparent)
-{
-  PB_ASSOC_DBG_ASSERT(p_nd != NULL);
-  PB_ASSOC_DBG_ASSERT(p_parent != NULL);
-  PB_ASSOC_DBG_ASSERT(p_grandparent != NULL);
-
-  const bool grandparent_head =
-    p_grandparent->m_p_parent == PB_ASSOC_BASE_C_DEC::m_p_head;
-
-  if (grandparent_head)
-    {
-      PB_ASSOC_BASE_C_DEC::m_p_head->m_p_parent =
-	PB_ASSOC_BASE_C_DEC::m_p_head->m_p_parent;
-
-      p_nd->m_p_parent = PB_ASSOC_BASE_C_DEC::m_p_head;
-
-      return;
-    }
-
-  node_pointer p_greatgrandparent = p_grandparent->m_p_parent;
-
-  p_nd->m_p_parent = p_greatgrandparent;
-
-  if (p_grandparent == p_greatgrandparent->m_p_left)
-    p_greatgrandparent->m_p_left = p_nd;
-  else
-    p_greatgrandparent->m_p_right = p_nd;
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline void
-PB_ASSOC_CLASS_C_DEC::
-splay_zz_end(node_pointer p_nd, node_pointer p_parent, node_pointer p_grandparent)
-{
-  if (p_nd->m_p_parent == PB_ASSOC_BASE_C_DEC::m_p_head)
-    PB_ASSOC_BASE_C_DEC::m_p_head->m_p_parent = p_nd;
-
-  apply_update(p_grandparent, (Node_Updator* )this);
-  apply_update(p_parent, (Node_Updator* )this);
-  apply_update(p_nd, (Node_Updator* )this);
-
-  PB_ASSOC_DBG_ONLY(assert_node_consistent(p_nd);)
-    }
-
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/splay_tree_/splay_tree_.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/splay_tree_/splay_tree_.hpp
deleted file mode 100644
index 001cc3ff5e9..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/splay_tree_/splay_tree_.hpp
+++ /dev/null
@@ -1,342 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file splay_tree_.hpp
- * Contains an implementation class for splay_tree_.
- */
-
-#ifdef PB_ASSOC_DATA_TRUE_INDICATOR
-#ifndef BIN_SEARCH_TREE_HPP__DATA_TRUE_INDICATOR
-#define BIN_SEARCH_TREE_HPP__DATA_TRUE_INDICATOR
-#include <ext/pb_assoc/detail/bin_search_tree_/bin_search_tree_.hpp>
-#endif // #ifndef BIN_SEARCH_TREE_HPP__DATA_TRUE_INDICATOR
-#endif // #ifdef PB_ASSOC_DATA_TRUE_INDICATOR
-
-#ifdef PB_ASSOC_DATA_FALSE_INDICATOR
-#ifndef BIN_SEARCH_TREE_HPP__DATA_FALSE_INDICATOR
-#define BIN_SEARCH_TREE_HPP__DATA_FALSE_INDICATOR
-#include <ext/pb_assoc/detail/bin_search_tree_/bin_search_tree_.hpp>
-#endif // #ifndef BIN_SEARCH_TREE_HPP__DATA_FALSE_INDICATOR
-#endif // #ifdef PB_ASSOC_DATA_FALSE_INDICATOR
-
-#include <ext/pb_assoc/detail/splay_tree_/node.hpp>
-#include <utility>
-#include <vector>
-#include <assert.h>
-
-namespace pb_assoc
-{
-
-  namespace detail
-  {
-
-#ifdef PB_ASSOC_SPLAY_TREE_DEBUG_
-#define PB_ASSOC_DBG_ASSERT(X) assert(X)
-#define PB_ASSOC_DBG_VERIFY(X) assert(X)
-#define PB_ASSOC_DBG_ONLY(X) X
-#else // #ifdef PB_ASSOC_SPLAY_TREE_DEBUG_
-#define PB_ASSOC_DBG_ASSERT(X)
-#define PB_ASSOC_DBG_VERIFY(X) {if((X)==0);}
-#define PB_ASSOC_DBG_ONLY(X) ;
-#endif // #ifdef PB_ASSOC_SPLAY_TREE_DEBUG_
-
-#define PB_ASSOC_CLASS_T_DEC \
-	template< \
-		typename Key, \
-		typename Data, \
-		class Cmp_Fn, \
-		class Allocator, \
-		class Node_Updator>
-
-#ifdef PB_ASSOC_DATA_TRUE_INDICATOR
-#define PB_ASSOC_CLASS_NAME \
-	splay_tree_data_
-#endif // #ifdef PB_ASSOC_DATA_TRUE_INDICATOR
-
-#ifdef PB_ASSOC_DATA_FALSE_INDICATOR
-#define PB_ASSOC_CLASS_NAME \
-	splay_tree_no_data_
-#endif // #ifdef PB_ASSOC_DATA_FALSE_INDICATOR
-
-#ifdef PB_ASSOC_DATA_TRUE_INDICATOR
-#define PB_ASSOC_BASE_CLASS_NAME \
-	bin_search_tree_data_
-#endif // #ifdef PB_ASSOC_DATA_TRUE_INDICATOR
-
-#ifdef PB_ASSOC_DATA_FALSE_INDICATOR
-#define PB_ASSOC_BASE_CLASS_NAME \
-	bin_search_tree_no_data_
-#endif // #ifdef PB_ASSOC_DATA_FALSE_INDICATOR
-
-#define PB_ASSOC_CLASS_C_DEC \
-	PB_ASSOC_CLASS_NAME< \
-		Key, \
-		Data, \
-		Cmp_Fn, \
-		Allocator, \
-		Node_Updator>
-
-#define PB_ASSOC_TYPES_TRAITS_C_DEC \
-	types_traits< \
-		Key, \
-		Data, \
-		Allocator>
-
-#define PB_ASSOC_NODE_C_DEC \
-	splay_tree_node_< \
-		typename PB_ASSOC_TYPES_TRAITS_C_DEC::value_type, \
-		Allocator>
-
-#define PB_ASSOC_BASE_C_DEC \
-	PB_ASSOC_BASE_CLASS_NAME< \
-		Key, \
-		Data, \
-		PB_ASSOC_NODE_C_DEC, \
-		Cmp_Fn, \
-		Allocator, \
-		Node_Updator>
-
-    template<typename Key,
-	     typename Data,
-	     class Cmp_Fn,
-	     class Allocator,
-	     class Node_Updator>
-    struct PB_ASSOC_CLASS_NAME : public PB_ASSOC_BASE_C_DEC
-    {
-
-    protected:
-
-      typedef typename Allocator::size_type size_type;
-
-      typedef
-      typename PB_ASSOC_TYPES_TRAITS_C_DEC::const_key_reference
-      const_key_reference;
-
-      typedef typename PB_ASSOC_TYPES_TRAITS_C_DEC::data_type data_type;
-
-      typedef
-      typename PB_ASSOC_TYPES_TRAITS_C_DEC::data_reference
-      data_reference;
-
-      typedef
-      typename PB_ASSOC_TYPES_TRAITS_C_DEC::const_data_reference
-      const_data_reference;
-
-      typedef typename PB_ASSOC_TYPES_TRAITS_C_DEC::value_type value_type;
-
-      typedef typename PB_ASSOC_TYPES_TRAITS_C_DEC::pointer pointer;
-
-      typedef
-      typename PB_ASSOC_TYPES_TRAITS_C_DEC::const_pointer
-      const_pointer;
-
-      typedef typename PB_ASSOC_TYPES_TRAITS_C_DEC::reference reference;
-
-      typedef
-      typename PB_ASSOC_TYPES_TRAITS_C_DEC::const_reference
-      const_reference;
-
-      typedef typename PB_ASSOC_BASE_C_DEC::node_pointer node_pointer;
-
-      typedef typename PB_ASSOC_BASE_C_DEC::find_iterator find_iterator;
-
-      typedef
-      typename PB_ASSOC_BASE_C_DEC::const_iterator
-      const_find_iterator;
-
-      typedef typename PB_ASSOC_BASE_C_DEC::iterator iterator;
-
-      typedef typename PB_ASSOC_BASE_C_DEC::const_iterator const_iterator;
-
-      typedef
-      typename PB_ASSOC_BASE_C_DEC::reverse_iterator
-      reverse_iterator;
-
-      typedef
-      typename PB_ASSOC_BASE_C_DEC::const_reverse_iterator
-      const_reverse_iterator;
-
-    protected:
-
-      PB_ASSOC_CLASS_NAME();
-
-      PB_ASSOC_CLASS_NAME(const Cmp_Fn& r_cmp_fn);
-
-      PB_ASSOC_CLASS_NAME(const Cmp_Fn& r_cmp_fn, const Node_Updator& r_node_updator);
-
-      PB_ASSOC_CLASS_NAME(const PB_ASSOC_CLASS_C_DEC& r_other);
-
-      void
-      swap(PB_ASSOC_CLASS_C_DEC& r_other);
-
-      template<class It>
-      void
-      copy_from_range(It first_it, It last_it);
-
-      void
-      initialize();
-
-      inline std::pair<find_iterator, bool>
-      insert(const_reference r_value);
-
-#ifdef PB_ASSOC_DATA_TRUE_INDICATOR
-      inline data_reference
-      subscript_imp(const_key_reference r_key);
-#endif // #ifdef PB_ASSOC_DATA_TRUE
-
-      inline find_iterator
-      lower_bound(const_key_reference r_key);
-
-      inline const_find_iterator
-      lower_bound(const_key_reference r_key) const;
-
-      inline find_iterator
-      upper_bound(const_key_reference r_key);
-
-      inline const_find_iterator
-      upper_bound(const_key_reference r_key) const;
-
-      inline find_iterator
-      find(const_key_reference r_key);
-
-      inline const_find_iterator
-      find(const_key_reference r_key) const;
-
-      inline size_type
-      erase(const_key_reference r_key);
-
-      inline const_iterator
-      erase(const_iterator it);
-
-#ifdef PB_ASSOC_DATA_TRUE_INDICATOR
-      inline iterator
-      erase(iterator it);
-#endif // #ifdef PB_ASSOC_DATA_TRUE_INDICATOR
-
-      inline const_reverse_iterator
-      erase(const_reverse_iterator it);
-
-#ifdef PB_ASSOC_DATA_TRUE_INDICATOR
-      inline reverse_iterator
-      erase(reverse_iterator it);
-#endif // #ifdef PB_ASSOC_DATA_TRUE_INDICATOR
-
-      template<class Pred>
-      inline size_type
-      erase_if(Pred pred);
-
-      inline node_pointer
-      leftmost(node_pointer p_nd);
-
-      void
-      join(PB_ASSOC_CLASS_C_DEC& r_other);
-
-      void
-      split(const_key_reference r_key, PB_ASSOC_CLASS_C_DEC& r_other);
-
-#ifdef PB_ASSOC_SPLAY_TREE_DEBUG_
-
-      virtual void
-      assert_valid() const;
-
-      void
-      assert_special_imp(const node_pointer p_nd) const;
-
-#endif // #ifdef PB_ASSOC_SPLAY_TREE_DEBUG_
-
-    private:
-
-      void
-      splay(node_pointer p_nd);
-
-      inline void
-      splay_zig_zag_left(node_pointer p_nd, node_pointer p_parent, node_pointer p_grandparent);
-
-      inline void
-      splay_zig_zag_right(node_pointer p_nd, node_pointer p_parent, node_pointer p_grandparent);
-
-      inline void
-      splay_zig_zig_left(node_pointer p_nd, node_pointer p_parent, node_pointer p_grandparent);
-
-      inline void
-      splay_zig_zig_right(node_pointer p_nd, node_pointer p_parent, node_pointer p_grandparent);
-
-      inline void
-      splay_zz_start(node_pointer p_nd, node_pointer p_parent, node_pointer p_grandparent);
-
-      inline void
-      splay_zz_end(node_pointer p_nd, node_pointer p_parent, node_pointer p_grandparent);
-
-      void
-      erase_node(node_pointer p_nd);
-
-    };
-
-#include <ext/pb_assoc/detail/splay_tree_/constructors_destructor_fn_imps.hpp>
-#include <ext/pb_assoc/detail/splay_tree_/info_fn_imps.hpp>
-#include <ext/pb_assoc/detail/splay_tree_/insert_fn_imps.hpp>
-#include <ext/pb_assoc/detail/splay_tree_/splay_fn_imps.hpp>
-#include <ext/pb_assoc/detail/splay_tree_/erase_fn_imps.hpp>
-#include <ext/pb_assoc/detail/splay_tree_/find_fn_imps.hpp>
-#include <ext/pb_assoc/detail/splay_tree_/debug_fn_imps.hpp>
-#include <ext/pb_assoc/detail/splay_tree_/split_join_fn_imps.hpp>
-
-#undef PB_ASSOC_CLASS_T_DEC
-
-#undef PB_ASSOC_CLASS_C_DEC
-
-#undef PB_ASSOC_CLASS_NAME
-
-#undef PB_ASSOC_TYPES_TRAITS_C_DEC
-
-#undef PB_ASSOC_BASE_CLASS_NAME
-
-#undef PB_ASSOC_NODE_C_DEC
-
-#undef PB_ASSOC_BASE_C_DEC
-
-#undef PB_ASSOC_DBG_ASSERT
-#undef PB_ASSOC_DBG_VERIFY
-#undef PB_ASSOC_DBG_ONLY
-
-  } // namespace detail
-
-} // namespace pb_assoc
-
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/splay_tree_/split_join_fn_imps.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/splay_tree_/split_join_fn_imps.hpp
deleted file mode 100644
index 4d3d3e6e8c3..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/splay_tree_/split_join_fn_imps.hpp
+++ /dev/null
@@ -1,125 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file split_join_fn_imps.hpp
- * Contains an implementation class for splay_tree_.
- */
-
-PB_ASSOC_CLASS_T_DEC
-inline void
-PB_ASSOC_CLASS_C_DEC::
-join(PB_ASSOC_CLASS_C_DEC& r_other)
-{
-  PB_ASSOC_DBG_ONLY(PB_ASSOC_CLASS_C_DEC::assert_valid();)
-    PB_ASSOC_DBG_ONLY(r_other.PB_ASSOC_CLASS_C_DEC::assert_valid();)
-
-    if (PB_ASSOC_BASE_C_DEC::join_prep(r_other) == false)
-      {
-	PB_ASSOC_DBG_ONLY(PB_ASSOC_CLASS_C_DEC::assert_valid();)
-	  PB_ASSOC_DBG_ONLY(r_other.PB_ASSOC_CLASS_C_DEC::assert_valid();)
-
-	  return;
-      }
-
-  node_pointer p_target_r = r_other.leftmost(r_other.m_p_head);
-
-  PB_ASSOC_DBG_ASSERT(p_target_r != NULL);
-
-  r_other.splay(p_target_r);
-
-  PB_ASSOC_DBG_ASSERT(p_target_r == r_other.m_p_head->m_p_parent);
-  PB_ASSOC_DBG_ASSERT(p_target_r->m_p_left == NULL);
-
-  p_target_r->m_p_left = PB_ASSOC_BASE_C_DEC::m_p_head->m_p_parent;
-
-  PB_ASSOC_DBG_ASSERT(p_target_r->m_p_left != NULL);
-  p_target_r->m_p_left->m_p_parent = p_target_r;
-
-  PB_ASSOC_BASE_C_DEC::m_p_head->m_p_parent = p_target_r;
-  p_target_r->m_p_parent = PB_ASSOC_BASE_C_DEC::m_p_head;
-
-  apply_update(p_target_r, (Node_Updator* )this);
-
-  PB_ASSOC_BASE_C_DEC::join_finish(r_other);
-
-  PB_ASSOC_DBG_ONLY(PB_ASSOC_CLASS_C_DEC::assert_valid();)
-    PB_ASSOC_DBG_ONLY(r_other.PB_ASSOC_CLASS_C_DEC::assert_valid();)
-    }
-
-PB_ASSOC_CLASS_T_DEC
-void
-PB_ASSOC_CLASS_C_DEC::
-split(const_key_reference r_key, PB_ASSOC_CLASS_C_DEC& r_other)
-{
-  PB_ASSOC_DBG_ONLY(PB_ASSOC_CLASS_C_DEC::assert_valid());
-  PB_ASSOC_DBG_ONLY(r_other.PB_ASSOC_CLASS_C_DEC::assert_valid());
-
-  if (PB_ASSOC_BASE_C_DEC::split_prep(r_key, r_other) == false)
-    {
-      PB_ASSOC_DBG_ONLY(PB_ASSOC_CLASS_C_DEC::assert_valid());
-      PB_ASSOC_DBG_ONLY(r_other.PB_ASSOC_CLASS_C_DEC::assert_valid());
-
-      return;
-    }
-
-  node_pointer p_upper_bound = upper_bound(r_key).m_p_nd;
-  PB_ASSOC_DBG_ASSERT(p_upper_bound != NULL);
-
-  PB_ASSOC_DBG_ASSERT(p_upper_bound->m_p_parent ==
-		      PB_ASSOC_BASE_C_DEC::m_p_head);
-
-  node_pointer p_new_root = p_upper_bound->m_p_left;
-  PB_ASSOC_DBG_ASSERT(p_new_root != NULL);
-
-  PB_ASSOC_BASE_C_DEC::m_p_head->m_p_parent = p_new_root;
-  p_new_root->m_p_parent = PB_ASSOC_BASE_C_DEC::m_p_head;
-
-  r_other.m_p_head->m_p_parent = p_upper_bound;
-  p_upper_bound->m_p_parent = r_other.m_p_head;
-  p_upper_bound->m_p_left = NULL;
-
-  apply_update(p_upper_bound, (Node_Updator* )this);
-
-  PB_ASSOC_BASE_C_DEC::split_finish(r_other);
-
-  PB_ASSOC_DBG_ONLY(PB_ASSOC_CLASS_C_DEC::assert_valid());
-  PB_ASSOC_DBG_ONLY(r_other.PB_ASSOC_CLASS_C_DEC::assert_valid());
-}
-
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/standard_policies.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/standard_policies.hpp
deleted file mode 100644
index 7597b52a3ce..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/standard_policies.hpp
+++ /dev/null
@@ -1,181 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file standard_policies.hpp
- * Contains standard policies for containers.
- */
-
-#ifndef STANDARD_POLICIES_HPP
-#define STANDARD_POLICIES_HPP
-
-#include <memory>
-#include <ext/pb_assoc/hash_policy.hpp>
-#include <ext/pb_assoc/lu_policy.hpp>
-#include <ext/pb_assoc/tree_policy.hpp>
-#if defined(__GNUC__)
-#include <ext/hash_map>
-#elif defined(_MSC_VER)
-#include <hash_map>
-#else
-#error "Unable to determine the namespaces for your compiler. Please" \
-	"Contact pbassoc@gmail.com"
-#endif // #if defined(__GNUC__)
-
-namespace pb_assoc
-{
-
-  namespace detail
-  {
-
-#ifdef __GNUC__
-
-    template<typename Key>
-    struct def_hash_fn
-    {
-      typedef __gnu_cxx::hash<Key> type;
-    };
-
-    template<typename Key>
-    struct def_eq_fn
-    {
-      typedef std::equal_to<Key> type;
-    };
-
-#elif defined(_MSC_VER)
-
-    template<typename Key>
-    struct hash_value_class_adapter
-    {
-      inline size_t
-      operator()(const Key& r_key) const
-      {
-	return (stdext::hash_value(r_key));
-      }
-    };
-
-    template<typename Key>
-    struct def_hash_fn
-    {
-      typedef hash_value_class_adapter<Key> type;
-    };
-
-    template<typename Key>
-    struct def_eq_fn
-    {
-      typedef std::equal_to<Key> type;
-    };
-
-#else // #elif defined(_MSC_VER)
-
-#error Sorry, cannot determine headers, namespaces, etc. for your compiler.
-#error If you encounter this error, pls write to pbassoc@gmail.com
-
-#endif // #elif defined(_MSC_VER)
-
-    enum
-      {
-	def_store_hash = false
-      };
-
-    struct def_comb_hash_fn
-    {
-      typedef pb_assoc::direct_mask_range_hashing<> type;
-    };
-
-    template<class Comb_Hash_Fn>
-    struct def_resize_policy
-    {
-    private:
-      typedef typename Comb_Hash_Fn::size_type size_type;
-
-      typedef
-      typename pb_assoc::detail::cond_type<
-	pb_assoc::detail::is_same_type<
-	pb_assoc::direct_mask_range_hashing<size_type>,
-	Comb_Hash_Fn>::value,
-	pb_assoc::hash_exponential_size_policy<
-	size_type>,
-	pb_assoc::hash_prime_size_policy>::type
-      size_policy_type;
-
-    public:
-      typedef
-      pb_assoc::hash_standard_resize_policy<
-	size_policy_type,
-	pb_assoc::hash_load_check_resize_trigger<
-	false,
-	size_type>,
-	false,
-	size_type>
-      type;
-    };
-
-    struct def_update_policy
-    {
-      typedef pb_assoc::move_to_front_lu_policy<> type;
-    };
-
-    template<class Comb_Probe_Fn>
-    struct def_probe_fn
-    {
-    private:
-      typedef typename Comb_Probe_Fn::size_type size_type;
-
-    public:
-      typedef
-      typename pb_assoc::detail::cond_type<
-	pb_assoc::detail::is_same_type<
-	pb_assoc::direct_mask_range_hashing<size_t>,
-	Comb_Probe_Fn>::value,
-	pb_assoc::linear_probe_fn<
-	size_type>,
-	pb_assoc::quadratic_probe_fn<
-	size_type> >::type
-      type;
-    };
-
-    typedef pb_assoc::null_node_updator def_node_updator;
-
-  } // namespace detail
-
-} // namespace pb_assoc
-
-#endif // #ifndef STANDARD_POLICIES_HPP
-
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/standard_sizes.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/standard_sizes.hpp
deleted file mode 100644
index cc667b91d3a..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/standard_sizes.hpp
+++ /dev/null
@@ -1,65 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file standard_sizes.hpp
- * Contains standard sizes for containers.
- */
-
-#ifndef STANDARD_SIZES_HPP
-#define STANDARD_SIZES_HPP
-
-namespace pb_assoc
-{
-
-  namespace detail
-  {
-
-    enum
-      {
-	def_init_size = 8,
-	def_grow_factor = 2
-      };
-
-  } // namespace detail
-
-} // namespace pb_assoc
-
-#endif // #ifndef STANDARD_SIZES_HPP
-
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/tree_assoc_cntnr/constructor_destructor_fn_imps.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/tree_assoc_cntnr/constructor_destructor_fn_imps.hpp
deleted file mode 100644
index cc8495fe428..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/tree_assoc_cntnr/constructor_destructor_fn_imps.hpp
+++ /dev/null
@@ -1,130 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/*
- * @file constructor_destructor_fn_imps.hpp
- * Contains implementation of rb trees
- */
-
-PB_ASSOC_CLASS_T_DEC
-PB_ASSOC_CLASS_C_DEC::
-tree_assoc_cntnr()
-{
-  //Do nothing
-}
-
-PB_ASSOC_CLASS_T_DEC
-PB_ASSOC_CLASS_C_DEC::
-tree_assoc_cntnr(const Cmp_Fn& r_cmp_fn) :
-  PB_ASSOC_CLASS_C_DEC::my_base(r_cmp_fn)
-{
-  //Do nothing
-}
-
-PB_ASSOC_CLASS_T_DEC
-PB_ASSOC_CLASS_C_DEC::
-tree_assoc_cntnr(const Cmp_Fn& r_cmp_fn, const Node_Updator& r_node_updator) :
-  PB_ASSOC_CLASS_C_DEC::my_base(r_cmp_fn, r_node_updator)
-{
-  //Do nothing
-}
-
-PB_ASSOC_CLASS_T_DEC
-template<class It>
-PB_ASSOC_CLASS_C_DEC::
-tree_assoc_cntnr(It first_it, It last_it)
-{
-  my_base::copy_from_range(first_it, last_it);
-}
-
-PB_ASSOC_CLASS_T_DEC
-template<class It>
-PB_ASSOC_CLASS_C_DEC::
-tree_assoc_cntnr(It first_it, It last_it, const Cmp_Fn& r_cmp_fn) :
-  PB_ASSOC_CLASS_C_DEC::my_base(r_cmp_fn)
-{
-  my_base::copy_from_range(first_it, last_it);
-}
-
-PB_ASSOC_CLASS_T_DEC
-template<class It>
-PB_ASSOC_CLASS_C_DEC::
-tree_assoc_cntnr(It first_it, It last_it, const Cmp_Fn& r_cmp_fn, const Node_Updator& r_node_updator) :
-  PB_ASSOC_CLASS_C_DEC::my_base(r_cmp_fn, r_node_updator)
-{
-  my_base::copy_from_range(first_it, last_it);
-}
-
-PB_ASSOC_CLASS_T_DEC
-PB_ASSOC_CLASS_C_DEC::
-tree_assoc_cntnr(const PB_ASSOC_CLASS_C_DEC& r_other) :
-  my_base((const PB_ASSOC_BASE_C_DEC& )r_other)
-{
-  //Do nothing
-}
-
-PB_ASSOC_CLASS_T_DEC
-PB_ASSOC_CLASS_C_DEC::
-~tree_assoc_cntnr()
-{
-  //Do nothing
-}
-
-PB_ASSOC_CLASS_T_DEC
-PB_ASSOC_CLASS_C_DEC& 
-PB_ASSOC_CLASS_C_DEC::
-operator=(const PB_ASSOC_CLASS_C_DEC& r_other)
-{
-  if (this !=& r_other)
-    {
-      PB_ASSOC_CLASS_C_DEC tmp(r_other);
-
-      swap(tmp);
-    }
-
-  return (*this);
-}
-
-PB_ASSOC_CLASS_T_DEC
-void
-PB_ASSOC_CLASS_C_DEC::
-swap(PB_ASSOC_CLASS_C_DEC& r_other)
-{
-  return (my_base::swap(r_other));
-}
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/tree_policy/null_node_updator_imp.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/tree_policy/null_node_updator_imp.hpp
deleted file mode 100644
index 8cd0013cedd..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/tree_policy/null_node_updator_imp.hpp
+++ /dev/null
@@ -1,49 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/*
- * @file null_node_updator_imp.hpp
- * Contains an implementation of null_node_updator.
- */
-
-inline void
-null_node_updator::
-swap(null_node_updator& /*r_other*/)
-{ }
-
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/tree_policy/order_statistics_imp.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/tree_policy/order_statistics_imp.hpp
deleted file mode 100644
index 7e3550188d6..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/tree_policy/order_statistics_imp.hpp
+++ /dev/null
@@ -1,436 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/*
- * @file order_statistics_imp.hpp
- * Contains forward declarations for order_statistics_key
- */
-
-#ifndef ORDER_STATISTICS_IMP_HPP
-#define ORDER_STATISTICS_IMP_HPP
-
-#define PB_ASSOC_CLASS_T_DEC \
-	template<class Key, class Allocator>
-
-#define PB_ASSOC_CLASS_C_DEC \
-	order_statistics_key< \
-		Key, \
-		Allocator>
-
-PB_ASSOC_CLASS_T_DEC
-inline
-PB_ASSOC_CLASS_C_DEC::
-order_statistics_key(const_key_reference r_key) :
-  m_key(r_key),
-  m_rank(1)
-{ }
-
-PB_ASSOC_CLASS_T_DEC
-inline
-PB_ASSOC_CLASS_C_DEC::
-operator typename PB_ASSOC_CLASS_C_DEC::key_reference()
-{
-  return (m_key);
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline
-PB_ASSOC_CLASS_C_DEC::
-operator typename PB_ASSOC_CLASS_C_DEC::key_type() const
-{
-  return (m_key);
-}
-
-#undef PB_ASSOC_CLASS_T_DEC
-
-#undef PB_ASSOC_CLASS_C_DEC
-
-#define PB_ASSOC_CLASS_T_DEC \
-	template<class Cmp_Fn, class Allocator>
-
-#define PB_ASSOC_CLASS_C_DEC \
-	order_statistics_key_cmp< \
-		Cmp_Fn, \
-		Allocator>
-
-PB_ASSOC_CLASS_T_DEC
-inline
-PB_ASSOC_CLASS_C_DEC::
-order_statistics_key_cmp()
-{ }
-
-PB_ASSOC_CLASS_T_DEC
-inline
-PB_ASSOC_CLASS_C_DEC::
-order_statistics_key_cmp(const Cmp_Fn& r_cmp_fn) :
-  Cmp_Fn(r_cmp_fn)
-{ }
-
-PB_ASSOC_CLASS_T_DEC
-inline bool
-PB_ASSOC_CLASS_C_DEC::
-operator()(const_key_reference r_lhs_key, const_key_reference r_rhs_key) const
-{
-  return Cmp_Fn::operator()((key_type)r_lhs_key, (key_type)r_rhs_key);
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::cmp_fn& 
-PB_ASSOC_CLASS_C_DEC::
-get_cmp_fn()
-{
-  return (*this);
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline const typename PB_ASSOC_CLASS_C_DEC::cmp_fn& 
-PB_ASSOC_CLASS_C_DEC::
-get_cmp_fn() const
-{
-  return (*this);
-}
-
-#undef PB_ASSOC_CLASS_T_DEC
-
-#undef PB_ASSOC_CLASS_C_DEC
-
-#define PB_ASSOC_CLASS_T_DEC \
-	template<class Key, class Allocator>
-
-#define PB_ASSOC_CLASS_C_DEC \
-	order_statistics_node_updator< \
-		Key, \
-		Allocator>
-
-PB_ASSOC_CLASS_T_DEC
-inline void
-PB_ASSOC_CLASS_C_DEC::
-operator()(const_key_pointer p_key, const_key_pointer p_l_child_key, const_key_pointer p_r_child_key)
-{
-  /*
-   * The left rank is 0 if there is no left child,
-   *	or the rank of the left child, otherwise.
-   */
-  const size_type l_rank =(p_l_child_key == NULL)? 0 : p_l_child_key->m_rank;
-
-  /*
-   * The right rank is 0 if there is no right child,
-   *	or the rank of the right child, otherwise.
-   */
-  const size_type r_rank =(p_r_child_key == NULL)? 0 : p_r_child_key->m_rank;
-
-  /*
-   * The rand of the entry is the sumb of the ranks of its
-   *	children + 1 (for itself).
-   */
-  p_key->m_rank = 1 + l_rank + r_rank;
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline void
-PB_ASSOC_CLASS_C_DEC::
-swap(PB_ASSOC_CLASS_C_DEC& /*r_other*/)
-{ }
-
-#undef PB_ASSOC_CLASS_T_DEC
-
-#undef PB_ASSOC_CLASS_C_DEC
-
-#define PB_ASSOC_CLASS_T_DEC \
-	template<class Cntnr>
-
-#define PB_ASSOC_CLASS_C_DEC \
-	find_by_order< \
-		Cntnr>
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::iterator
-PB_ASSOC_CLASS_C_DEC::
-operator()(Cntnr& r_c, size_type order) const
-{
-  return find(r_c, order);
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::const_iterator
-PB_ASSOC_CLASS_C_DEC::
-operator()(const Cntnr& r_c, size_type order) const
-{
-  return find(r_c, order);
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::const_iterator
-PB_ASSOC_CLASS_C_DEC::
-find(const Cntnr& r_c, size_type order)
-{
-  if (order > r_c.size())
-    return (r_c.end());
-
-  /*
-   * Start at the top of the tree.
-   */
-  typename Cntnr::const_node_iterator it = r_c.node_begin();
-
-  /*
-   * Loop up to a leaf.
-   */
-  while (it != r_c.node_end())
-    {
-      typename Cntnr::const_node_iterator l_it = it.l_child();
-
-      /*
-       * The order of the element, o, is the rank of the left
-       *	child (for the entry itself).
-       */
-      const size_type o = (l_it == r_c.node_end())?
-	0 :(*l_it)->m_rank;
-
-      /*
-       * If the current order, o, is the order requested,
-       *	the key has been found.
-       */
-      if (order == o)
-	return (*it);
-      /*
-       * If the current order, o, is larger than the order requested,
-       *	we should move to the left subtree.
-       */
-      else if (order < o)
-	it = l_it;
-      /*
-       * Otherwise adujst the requested order and move to the right subtree.
-       */
-      else
-	{
-	  order -= o + 1;
-
-	  it = it.r_child();
-	}
-    }
-
-  return (r_c.end());
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::iterator
-PB_ASSOC_CLASS_C_DEC::
-find(Cntnr& r_c, size_type order)
-{
-  if (order > r_c.size())
-    return (r_c.end());
-
-  /*
-   * Start at the top of the tree.
-   */
-  typename Cntnr::node_iterator it = r_c.node_begin();
-
-  /*
-   * Loop up to a leaf.
-   */
-  while (it != r_c.node_end())
-    {
-      typename Cntnr::node_iterator l_it = it.l_child();
-
-      /*
-       * The order of the element, o, is the rank of the left
-       *	child (for the entry itself).
-       */
-      const size_type o = (l_it == r_c.node_end())?
-	0 :
-	r_c.extract_key(*(*l_it)).m_rank;
-
-      /*
-       * If the current order, o, is the order requested,
-       *	the key has been found.
-       */
-      if (order == o)
-	return (*it);
-      /*
-       * If the current order, o, is larger than the order requested,
-       *	we should move to the left subtree.
-       */
-      else if (order < o)
-	it = l_it;
-      /*
-       * Otherwise adujst the requested order and move to the right subtree.
-       */
-      else
-	{
-	  order -= o + 1;
-
-	  it = it.r_child();
-	}
-    }
-
-  return (r_c.end());
-}
-
-#undef PB_ASSOC_CLASS_T_DEC
-
-#undef PB_ASSOC_CLASS_C_DEC
-
-#define PB_ASSOC_CLASS_T_DEC \
-	template<class Cntnr>
-
-#define PB_ASSOC_CLASS_C_DEC \
-	order_by_key< \
-		Cntnr>
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::size_type
-PB_ASSOC_CLASS_C_DEC::
-operator()(const Cntnr& r_c, const underlying_key_type& r_key) const
-{
-  /*
-   * The logic here is similar to that in order_by_key.
-   */
-
-  typename Cntnr::const_node_iterator it = r_c.node_begin();
-
-  size_type ord = 0;
-
-  while (it != r_c.node_end())
-    {
-      typename Cntnr::const_node_iterator l_it = it.l_child();
-
-      if (r_c.get_cmp_fn().get_cmp_fn()(
-					r_key,
-					r_c.extract_key(*(*it)).m_key))
-	it = l_it;
-      else if (r_c.get_cmp_fn().get_cmp_fn()(
-					     r_c.extract_key(*(*it)).m_key,
-					     r_key))
-	{
-
-	  ord += (l_it == r_c.node_end())?
-	    1 :
-	    1 + r_c.extract_key(*(*l_it)).m_rank;
-
-	  it = it.r_child();
-	}
-      else
-	{
-	  ord += (l_it == r_c.node_end())?
-	    0 :
-	    r_c.extract_key(*(*l_it)).m_rank;
-
-	  it = r_c.node_end();
-	}
-    }
-
-  return (ord);
-}
-
-#undef PB_ASSOC_CLASS_T_DEC
-
-#undef PB_ASSOC_CLASS_C_DEC
-
-#define PB_ASSOC_CLASS_T_DEC \
-	template<class Cntnr, class Allocator>
-
-#define PB_ASSOC_CLASS_C_DEC \
-	order_statistics_key_verifier< \
-		Cntnr, \
-		Allocator>
-
-template<class Cntnr, class Allocator = std::allocator<char> >
-class order_statistics_key_verifier
-{
-public:
-  typedef Cntnr map;
-
-  typedef Allocator allocator;
-
-  typedef typename allocator::size_type size_type;
-
-  typedef
-  typename allocator::template rebind<map>::other::const_reference
-  const_map_reference;
-
-public:
-  bool
-  operator()(const Cntnr& r_c) const;
-
-private:
-  typedef typename Cntnr::const_node_iterator const_node_iterator;
-
-  typedef typename Cntnr::const_iterator cntnr_const_it;
-
-  typedef std::pair<bool, size_type> stat;
-
-private:
-  static stat
-  verify_imp(const_node_iterator it, const_node_iterator end_it)
-  {
-    if (it == end_it)
-      return (std::make_pair(true, 0));
-
-    const stat l_ret =
-      verify_imp(it.l_child(), end_it);
-
-    const stat r_ret =
-      verify_imp(it.r_child(), end_it);
-
-    if (!l_ret.first || !r_ret.first)
-      return (std::make_pair(false, 0));
-
-    if ((*it)->m_rank != 1 + l_ret.second + r_ret.second)
-      return (std::make_pair(false, 0));
-
-    return (std::make_pair(true, (*it)->m_rank));
-  }
-};
-
-PB_ASSOC_CLASS_T_DEC
-bool
-PB_ASSOC_CLASS_C_DEC::
-operator()(const Cntnr& r_c) const
-{
-  const stat top_stat =
-    verify_imp(r_c.node_begin(), r_c.node_end());
-
-  return (top_stat.first);
-}
-
-#undef PB_ASSOC_CLASS_T_DEC
-
-#undef PB_ASSOC_CLASS_C_DEC
-
-#endif // #ifndef ORDER_STATISTICS_IMP_HPP
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/type_utils.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/type_utils.hpp
deleted file mode 100644
index 6c6a4e5c72b..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/type_utils.hpp
+++ /dev/null
@@ -1,449 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file type_utils.hpp
- * Contains utilities for handnling types. All of these classes are based on
- *	"Modern C++" by Andrei Alxandrescu.
- */
-
-#ifndef TYPE_UTILS_HPP
-#define TYPE_UTILS_HPP
-
-#include <cstddef>
-#include <utility>
-
-namespace pb_assoc
-{
-
-  namespace detail
-  {
-
-    template<bool>
-    struct static_assert;
-
-    template<>
-    struct static_assert<true>
-    { };
-
-    template<int>
-    struct static_assert_dummy_class
-    {
-      enum
-	{
-	  v = 1
-	};
-    };
-
-    template<class T, class U>
-    class is_same_type
-    {
-    public:
-      enum
-	{
-	  value = false
-	};
-    };
-
-    template<class T>
-    class is_same_type<
-      T,
-      T>
-    {
-    public:
-      enum
-	{
-	  value = true
-	};
-    };
-
-    template<int n>
-    struct int_to_type
-    {
-      enum
-	{
-	  value = n
-	};
-    };
-
-    template<typename Type>
-    struct type_to_type
-    {
-      typedef Type type;
-    };
-
-    template<typename T>
-    class unconst
-    {
-    private:
-      template<class U>
-      struct unconst_imp
-      {
-	typedef U type;
-      };
-
-      template<class U>
-      struct unconst_imp<
-	const U>
-      {
-	typedef U type;
-      };
-    public:
-      typedef typename unconst_imp<T>::type type;
-    };
-
-    template<typename T>
-    class unreference
-    {
-    private:
-      template<class U>
-      struct unreference_imp
-      {
-	typedef U type;
-      };
-
-      template<class U>
-      struct unreference_imp<U&>
-      {
-	typedef U type;
-      };
-    public:
-      typedef typename unreference_imp<T>::type type;
-    };
-
-    /* is_const_type
-     * Idea by Andrei Alecsandrescu
-     *	(Modern C++ Design: Generic Programming and Design Patterns Applied)
-     **/
-    template<typename T>
-    class is_const_type
-    {
-    private:
-      template<class U>
-      struct is_const_type_imp
-      {
-	enum
-	  {
-	    value = 0
-	  };
-      };
-
-      template<class U>
-      struct is_const_type_imp<const U>
-      {
-	enum
-	  {
-	    value = 1
-	  };
-      };
-
-    public:
-      enum
-	{
-	  value = is_const_type_imp<T>::value
-	};
-    };
-
-    /* is_pointer_type
-    **/
-    template<typename T>
-    class is_pointer_type
-    {
-    private:
-      template<class U>
-      struct is_pointer_type_imp
-      {
-	enum
-	  {
-	    value = 0
-	  };
-      };
-
-      template<class U>
-      struct is_pointer_type_imp
-      <U* >
-      {
-	enum
-	  {
-	    value = 1
-	  };
-      };
-
-    public:
-      enum
-	{
-	  value = is_pointer_type_imp<T>::value
-	};
-    };
-
-    /* is_pointer_type
-    **/
-    template<typename T>
-    class is_const_pointer_type
-    {
-    private:
-      template<class U>
-      struct is_const_pointer_type_imp
-      {
-	enum
-	  {
-	    value = 0
-	  };
-      };
-
-      template<class U>
-      struct is_const_pointer_type_imp
-      <const U* >
-      {
-	enum
-	  {
-	    value = 1
-	  };
-      };
-
-    public:
-      enum
-	{
-	  value = is_const_pointer_type_imp<T>::value
-	};
-    };
-
-    template<typename T>
-    class is_reference_type
-    {
-    private:
-      template<class U>
-      struct is_reference_type_imp
-      {
-	enum
-	  {
-	    value = 0
-	  };
-      };
-
-      template<class U>
-      struct is_reference_type_imp<U& >
-      {
-	enum
-	  {
-	    value = 1
-	  };
-      };
-
-    public:
-      enum
-	{
-	  value = is_reference_type_imp<T>::value
-	};
-    };
-
-    template<typename T>
-    class is_const_reference_type
-    {
-    private:
-      template<class U>
-      struct is_const_reference_type_imp
-      {
-	enum
-	  {
-	    value = 0
-	  };
-      };
-
-      template<class U>
-      struct is_const_reference_type_imp<U& >
-      {
-	enum
-	  {
-	    value = 1
-	  };
-      };
-
-    public:
-      enum
-	{
-	  value = is_const_reference_type_imp<T>::value
-	};
-    };
-
-    template<typename T>
-    class is_member_pointer_type
-    {
-    private:
-      template<typename U>
-      struct is_member_pointer_type_imp
-      {
-	enum
-	  {
-	    value = 0
-	  };
-      };
-
-      template<typename U, typename V>
-      struct is_member_pointer_type_imp<
-	U V::*>
-      {
-	enum
-	  {
-	    value = 1
-	  };
-      };
-
-    public:
-      enum
-	{
-	  value = is_member_pointer_type_imp<T>::value
-	};
-    };
-
-#define PB_ASSOC_IS_SAME_TYPE(TYPE) is_same_type<T, TYPE>::value
-
-    template<class T>
-    class is_simple_type
-    {
-      template<class U>
-      struct is_simple_type_imp
-      {
-	enum
-	  {
-	    value = 0
-	  };
-      };
-
-      template<class U, size_t M>
-      struct is_simple_type_imp<
-	U[M]>
-      {
-	enum
-	  {
-	    value = is_simple_type<U>::value
-	  };
-      };
-
-      template<class U>
-      struct is_simple_type_imp<
-	U[]>
-      {
-	enum
-	  {
-	    value = is_simple_type<U>::value
-	  };
-      };
-
-      template<typename T0, typename T1>
-      struct is_simple_type_imp<
-	std::pair<
-	T0,
-	T1> >
-      {
-	enum
-	  {
-	    value = is_simple_type<T0>::value&& 
-	    is_simple_type<T1>::value
-	  };
-      };
-
-    public:
-      enum
-	{
-	  value =
-	  PB_ASSOC_IS_SAME_TYPE(void) ||
-	  PB_ASSOC_IS_SAME_TYPE(size_t) ||
-	  PB_ASSOC_IS_SAME_TYPE(const void)	||
-	  PB_ASSOC_IS_SAME_TYPE(unsigned char) ||
-	  PB_ASSOC_IS_SAME_TYPE(unsigned short int) ||
-	  PB_ASSOC_IS_SAME_TYPE(unsigned int) ||
-	  PB_ASSOC_IS_SAME_TYPE(unsigned long int) ||
-	  PB_ASSOC_IS_SAME_TYPE(signed char) ||
-	  PB_ASSOC_IS_SAME_TYPE(signed short int) ||
-	  PB_ASSOC_IS_SAME_TYPE(int) ||
-	  PB_ASSOC_IS_SAME_TYPE(long int) ||
-	  PB_ASSOC_IS_SAME_TYPE(bool) ||
-	  PB_ASSOC_IS_SAME_TYPE(char) ||
-	  PB_ASSOC_IS_SAME_TYPE(float) ||
-	  PB_ASSOC_IS_SAME_TYPE(double) ||
-	  PB_ASSOC_IS_SAME_TYPE(long double) ||
-	  PB_ASSOC_IS_SAME_TYPE(const unsigned char) ||
-	  PB_ASSOC_IS_SAME_TYPE(const unsigned short int) ||
-	  PB_ASSOC_IS_SAME_TYPE(const unsigned int) ||
-	  PB_ASSOC_IS_SAME_TYPE(const unsigned long int) ||
-	  PB_ASSOC_IS_SAME_TYPE(const signed char) ||
-	  PB_ASSOC_IS_SAME_TYPE(const signed short int) ||
-	  PB_ASSOC_IS_SAME_TYPE(const int) ||
-	  PB_ASSOC_IS_SAME_TYPE(const long int) ||
-	  PB_ASSOC_IS_SAME_TYPE(const bool) ||
-	  PB_ASSOC_IS_SAME_TYPE(const char) ||
-	  PB_ASSOC_IS_SAME_TYPE(const float) ||
-	  PB_ASSOC_IS_SAME_TYPE(const double) ||
-	  PB_ASSOC_IS_SAME_TYPE(const long double) ||
-	  is_pointer_type<T>::value ||
-	  is_const_pointer_type<T>::value ||
-	  is_member_pointer_type<T>::value ||
-	  is_simple_type_imp<T>::value
-	};
-    };
-
-#undef PB_ASSOC_IS_SAME_TYPE
-
-    template<bool Cond, class A, class B>
-    struct cond_type;
-
-    template<class A, class B>
-    struct cond_type<
-      true,
-      A,
-      B>
-    {
-      typedef A type;
-    };
-
-    template<class A, class B>
-    struct cond_type<
-      false,
-      A,
-      B>
-    {
-      typedef B type;
-    };
-
-  } // namespace detail
-
-} // namespace pb_assoc
-
-#endif // #ifndef TYPE_UTILS_HPP
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/typelist.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/typelist.hpp
deleted file mode 100644
index 08f50c81848..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/typelist.hpp
+++ /dev/null
@@ -1,220 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file typelist.hpp
- * Contains typelist_chain definitions.
- * Typelists are an idea by Andrei Alexandrescu.
- */
-
-#ifndef TYPELIST_HPP
-#define TYPELIST_HPP
-
-#ifdef _MSC_VER
-#pragma warning(disable: 4503)
-#endif // #ifdef _MSC_VER
-
-#include <ext/pb_assoc/detail/type_utils.hpp>
-
-namespace pb_assoc
-{
-
-  namespace detail
-  {
-
-    struct null_type
-    { };
-
-    template<typename Hd, typename Tl>
-    struct typelist_chain
-    {
-      typedef Hd head;
-
-      typedef Tl tail;
-    };
-
-    template<class Root>
-    struct typelist
-    {
-      typedef Root root;
-    };
-
-#define PB_ASSOC_TYPELIST_CHAIN1(X0) pb_assoc::detail::typelist_chain<X0, pb_assoc::detail::null_type>
-#define PB_ASSOC_TYPELIST_CHAIN2(X0, X1) pb_assoc::detail::typelist_chain<X0, PB_ASSOC_TYPELIST_CHAIN1(X1) >
-#define PB_ASSOC_TYPELIST_CHAIN3(X0, X1, X2) pb_assoc::detail::typelist_chain<X0, PB_ASSOC_TYPELIST_CHAIN2(X1, X2) >
-#define PB_ASSOC_TYPELIST_CHAIN4(X0, X1, X2, X3) pb_assoc::detail::typelist_chain<X0, PB_ASSOC_TYPELIST_CHAIN3(X1, X2, X3) >
-#define PB_ASSOC_TYPELIST_CHAIN5(X0, X1, X2, X3, X4) pb_assoc::detail::typelist_chain<X0, PB_ASSOC_TYPELIST_CHAIN4(X1, X2, X3, X4) >
-#define PB_ASSOC_TYPELIST_CHAIN6(X0, X1, X2, X3, X4, X5) pb_assoc::detail::typelist_chain<X0, PB_ASSOC_TYPELIST_CHAIN5(X1, X2, X3, X4, X5) >
-#define PB_ASSOC_TYPELIST_CHAIN7(X0, X1, X2, X3, X4, X5, X6) pb_assoc::detail::typelist_chain<X0, PB_ASSOC_TYPELIST_CHAIN6(X1, X2, X3, X4, X5, X6) >
-#define PB_ASSOC_TYPELIST_CHAIN8(X0, X1, X2, X3, X4, X5, X6, X7) pb_assoc::detail::typelist_chain<X0, PB_ASSOC_TYPELIST_CHAIN7(X1, X2, X3, X4, X5, X6, X7) >
-#define PB_ASSOC_TYPELIST_CHAIN9(X0, X1, X2, X3, X4, X5, X6, X7, X8) pb_assoc::detail::typelist_chain<X0, PB_ASSOC_TYPELIST_CHAIN8(X1, X2, X3, X4, X5, X6, X7, X8) >
-#define PB_ASSOC_TYPELIST_CHAIN10(X0, X1, X2, X3, X4, X5, X6, X7, X8, X9) pb_assoc::detail::typelist_chain<X0, PB_ASSOC_TYPELIST_CHAIN9(X1, X2, X3, X4, X5, X6, X7, X8, X9) >
-#define PB_ASSOC_TYPELIST_CHAIN11(X0, X1, X2, X3, X4, X5, X6, X7, X8, X9, X10) pb_assoc::detail::typelist_chain<X0, PB_ASSOC_TYPELIST_CHAIN10(X1, X2, X3, X4, X5, X6, X7, X8, X9, X10) >
-#define PB_ASSOC_TYPELIST_CHAIN12(X0, X1, X2, X3, X4, X5, X6, X7, X8, X9, X10, X11) pb_assoc::detail::typelist_chain<X0, PB_ASSOC_TYPELIST_CHAIN11(X1, X2, X3, X4, X5, X6, X7, X8, X9, X10, X11) >
-#define PB_ASSOC_TYPELIST_CHAIN13(X0, X1, X2, X3, X4, X5, X6, X7, X8, X9, X10, X11, X12) pb_assoc::detail::typelist_chain<X0, PB_ASSOC_TYPELIST_CHAIN12(X1, X2, X3, X4, X5, X6, X7, X8, X9, X10, X11, X12) >
-#define PB_ASSOC_TYPELIST_CHAIN14(X0, X1, X2, X3, X4, X5, X6, X7, X8, X9, X10, X11, X12, X13) pb_assoc::detail::typelist_chain<X0, PB_ASSOC_TYPELIST_CHAIN13(X1, X2, X3, X4, X5, X6, X7, X8, X9, X10, X11, X12, X13) >
-#define PB_ASSOC_TYPELIST_CHAIN15(X0, X1, X2, X3, X4, X5, X6, X7, X8, X9, X10, X11, X12, X13, X14) pb_assoc::detail::typelist_chain<X0, PB_ASSOC_TYPELIST_CHAIN14(X1, X2, X3, X4, X5, X6, X7, X8, X9, X10, X11, X12, X13, X14) >
-
-#include <ext/pb_assoc/detail/typelist/typelist_apply.hpp>
-
-    template<class Fn, class Typelist>
-    void
-    typelist_apply(Fn& r_fn, Typelist /*tl*/)
-    {
-      detail::apply_<
-	Fn,
-	typename Typelist::root>
-	a;
-
-      a(r_fn);
-    }
-
-#include <ext/pb_assoc/detail/typelist/typelist_append.hpp>
-
-    template<class Typelist0, class Typelist1>
-    struct typelist_append
-    {
-    private:
-      typedef
-      typename detail::typelist_append_<
-	typename Typelist0::root,
-	typename Typelist1::root>::type
-      res_hd;
-
-    public:
-      typedef typelist< res_hd> type;
-    };
-
-#include <ext/pb_assoc/detail/typelist/typelist_typelist_append.hpp>
-
-    template<class Typelist_Typelist>
-    struct typelist_typelist_append
-    {
-    private:
-      typedef
-      typename detail::typelist_typelist_append_<
-	typename Typelist_Typelist::root>::type
-      res_hd;
-
-    public:
-      typedef typelist< res_hd> type;
-    };
-
-#include <ext/pb_assoc/detail/typelist/typelist_contains.hpp>
-
-    template<class Typelist, class T>
-    struct typelist_contains
-    {
-      enum
-	{
-	  value =
-	  detail::typelist_contains_<
-	  typename Typelist::root,
-	  T>::value
-	};
-    };
-
-#include <ext/pb_assoc/detail/typelist/typelist_filter.hpp>
-
-    template<class Typelist, template<typename T>
-    class Pred>
-    struct typelist_filter
-    {
-    private:
-      typedef
-      typename detail::typelist_chain_filter_<
-	typename Typelist::root,
-	Pred>::type
-      root_type;
-
-    public:
-      typedef typelist< root_type> type;
-    };
-
-#include <ext/pb_assoc/detail/typelist/typelist_at_index.hpp>
-
-    template<class Typelist, int i>
-    struct typelist_at_index
-    {
-      typedef
-      typename detail::typelist_chain_at_index_<
-	typename Typelist::root,
-	i>::type
-      type;
-    };
-
-#include <ext/pb_assoc/detail/typelist/typelist_transform.hpp>
-
-    template<class Typelist, template<class T>
-    class Transform>
-    struct typelist_transform
-    {
-    private:
-      typedef
-      typename detail::typelist_chain_transform_<
-	typename Typelist::root,
-	Transform>::type
-      root_type;
-
-    public:
-      typedef typelist< root_type> type;
-    };
-
-#undef PB_ASSOC_TYPELIST_CHAIN1
-#undef PB_ASSOC_TYPELIST_CHAIN2
-#undef PB_ASSOC_TYPELIST_CHAIN3
-#undef PB_ASSOC_TYPELIST_CHAIN4
-#undef PB_ASSOC_TYPELIST_CHAIN5
-#undef PB_ASSOC_TYPELIST_CHAIN6
-#undef PB_ASSOC_TYPELIST_CHAIN7
-#undef PB_ASSOC_TYPELIST_CHAIN8
-#undef PB_ASSOC_TYPELIST_CHAIN9
-#undef PB_ASSOC_TYPELIST_CHAIN10
-#undef PB_ASSOC_TYPELIST_CHAIN11
-#undef PB_ASSOC_TYPELIST_CHAIN12
-#undef PB_ASSOC_TYPELIST_CHAIN13
-#undef PB_ASSOC_TYPELIST_CHAIN14
-#undef PB_ASSOC_TYPELIST_CHAIN15
-
-  } // namespace detail
-
-} // namespace pb_assoc
-
-#endif // #ifndef TYPELIST_HPP
-
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/typelist/typelist_append.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/typelist/typelist_append.hpp
deleted file mode 100644
index 8b98392845a..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/typelist/typelist_append.hpp
+++ /dev/null
@@ -1,84 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file typelist_append.hpp
- * Contains typelist_chain utilities.
- * Typelists are an idea by Andrei Alexandrescu.
- */
-
-#ifndef TYPELIST_APPEND_HPP
-#define TYPELIST_APPEND_HPP
-
-#ifdef _MSC_VER
-#pragma warning(disable: 4503)
-#endif // #ifdef _MSC_VER
-
-#include <ext/pb_assoc/detail/type_utils.hpp>
-
-namespace detail
-{
-
-  template<class Typelist_Chain0, class Typelist_Chain1>
-  struct typelist_append_;
-
-  template<typename Hd, typename Tl, class Typelist_Chain1>
-  struct typelist_append_<
-    typelist_chain<Hd, Tl>,
-    Typelist_Chain1>
-  {
-    typedef
-    typelist_chain<
-      Hd,
-      typename typelist_append_<Tl, Typelist_Chain1>::type>
-    type;
-  };
-
-  template<class Typelist_Chain1>
-  struct typelist_append_<
-    null_type,
-    Typelist_Chain1>
-  {
-    typedef Typelist_Chain1 type;
-  };
-
-} // namespace detail
-
-#endif // #ifndef TYPELIST_APPEND_HPP
-
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/typelist/typelist_apply.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/typelist/typelist_apply.hpp
deleted file mode 100644
index 29f969212ab..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/typelist/typelist_apply.hpp
+++ /dev/null
@@ -1,90 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file typelist_apply.hpp
- * Contains typelist utilities.
- * Typelists are an idea by Andrei Alexandrescu.
- */
-
-#ifndef TYPELIST_APPLY_HPP
-#define TYPELIST_APPLY_HPP
-
-#ifdef _MSC_VER
-#pragma warning(disable: 4503)
-#endif // #ifdef _MSC_VER
-
-#include <ext/pb_assoc/detail/type_utils.hpp>
-
-namespace detail
-{
-
-  template<class Fn, class Typelist_Chain>
-  struct apply_;
-
-  template<class Fn, class Hd, class Tl>
-  struct apply_<
-    Fn,
-    typelist_chain<Hd, Tl> >
-  {
-    void
-    operator()(Fn& r_fn)
-    {
-      r_fn(Hd());
-
-      apply_<Fn, Tl> next;
-
-      next(r_fn);
-    }
-  };
-
-  template<class Fn>
-  struct apply_<
-    Fn,
-    null_type>
-  {
-    void
-    operator()(Fn& /*r_fn*/)
-    { }
-  };
-
-} // namespace detail
-
-#endif // #ifndef TYPELIST_APPLY_HPP
-
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/typelist/typelist_at_index.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/typelist/typelist_at_index.hpp
deleted file mode 100644
index 2f1bbd5fd5c..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/typelist/typelist_at_index.hpp
+++ /dev/null
@@ -1,80 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file typelist_at_index.hpp
- * Contains typelist utilities.
- * Typelists are an idea by Andrei Alexandrescu.
- */
-
-#ifndef TYPELIST_AT_INDEX_HPP
-#define TYPELIST_AT_INDEX_HPP
-
-#ifdef _MSC_VER
-#pragma warning(disable: 4503)
-#endif // #ifdef _MSC_VER
-
-#include <ext/pb_assoc/detail/type_utils.hpp>
-
-namespace detail
-{
-
-  template<class Typelist_Chain, int i>
-  struct typelist_chain_at_index_;
-
-  template<class Hd, class Tl>
-  struct typelist_chain_at_index_<
-    typelist_chain<Hd, Tl>,
-    0>
-  {
-    typedef Hd type;
-  };
-
-  template<class Hd, class Tl, int i>
-  struct typelist_chain_at_index_<
-    typelist_chain<Hd, Tl>,
-    i>
-  {
-    typedef typename typelist_chain_at_index_< Tl, i - 1>::type type;
-  };
-
-} // namespace detail
-
-#endif // #ifndef TYPELIST_AT_INDEX_HPP
-
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/typelist/typelist_contains.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/typelist/typelist_contains.hpp
deleted file mode 100644
index 470ce02d0e1..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/typelist/typelist_contains.hpp
+++ /dev/null
@@ -1,99 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file typelist_contains.hpp
- * Contains typelist utilities.
- * Typelists are an idea by Andrei Alexandrescu.
- */
-
-#ifndef TYPELIST_CONTAINS_HPP
-#define TYPELIST_CONTAINS_HPP
-
-#ifdef _MSC_VER
-#pragma warning(disable: 4503)
-#endif // #ifdef _MSC_VER
-
-#include <ext/pb_assoc/detail/type_utils.hpp>
-
-namespace detail
-{
-
-  template<class Typelist_Chain, class T>
-  struct typelist_contains_;
-
-  template<class T>
-  struct typelist_contains_<
-    null_type,
-    T>
-  {
-    enum
-      {
-	value = false
-      };
-  };
-
-  template<class Hd, class Tl, class T>
-  struct typelist_contains_<
-    typelist_chain<Hd, Tl>,
-    T>
-  {
-    enum
-      {
-	value =
-	typelist_contains_<
-	Tl, T>::value
-      };
-  };
-
-  template<class Tl, class T>
-  struct typelist_contains_<
-    typelist_chain<T, Tl>,
-    T>
-  {
-    enum
-      {
-	value = true
-      };
-  };
-
-} // namespace detail
-
-#endif // #ifndef TYPELIST_CONTAINS_HPP
-
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/typelist/typelist_filter.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/typelist/typelist_filter.hpp
deleted file mode 100644
index 7e3d8479ce4..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/typelist/typelist_filter.hpp
+++ /dev/null
@@ -1,97 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file typelist_filter.hpp
- * Contains typelist utilities.
- * Typelists are an idea by Andrei Alexandrescu.
- */
-
-#ifndef TYPELIST_FILTER_HPP
-#define TYPELIST_FILTER_HPP
-
-#ifdef _MSC_VER
-#pragma warning(disable: 4503)
-#endif // #ifdef _MSC_VER
-
-#include <ext/pb_assoc/detail/type_utils.hpp>
-
-namespace detail
-{
-
-  template<class Typelist_Chain, template<typename T>
-  class Pred>
-  struct typelist_chain_filter_;
-
-  template<template<typename T>
-  class Pred>
-  struct typelist_chain_filter_<
-    null_type,
-    Pred>
-  {
-    typedef null_type type;
-  };
-
-  template<class Hd, class Tl, template<typename T>
-  class Pred>
-  struct typelist_chain_filter_<
-    typelist_chain<Hd, Tl>,
-    Pred>
-  {
-    typedef typename typelist_chain_filter_< Tl, Pred>::type rest;
-
-    enum
-      {
-	include_hd = Pred<Hd>::value
-      };
-
-    typedef
-    typename cond_type<
-      include_hd,
-      typelist_chain<
-      Hd,
-      rest>,
-      rest>::type
-    type;
-  };
-
-} // namespace detail
-
-#endif // #ifndef TYPELIST_FILTER_HPP
-
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/typelist/typelist_transform.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/typelist/typelist_transform.hpp
deleted file mode 100644
index 60a5ce7e349..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/typelist/typelist_transform.hpp
+++ /dev/null
@@ -1,87 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file typelist_transform.hpp
- * Contains typelist utilities.
- * Typelists are an idea by Andrei Alexandrescu.
- */
-
-#ifndef TYPELIST_TRANSFORM_HPP
-#define TYPELIST_TRANSFORM_HPP
-
-#ifdef _MSC_VER
-#pragma warning(disable: 4503)
-#endif // #ifdef _MSC_VER
-
-#include <ext/pb_assoc/detail/type_utils.hpp>
-
-namespace detail
-{
-
-  template<class Typelist_Chain, template<typename T>
-  class Transform>
-  struct typelist_chain_transform_;
-
-  template<template<typename T>
-  class Transform>
-  struct typelist_chain_transform_<
-    null_type,
-    Transform>
-  {
-    typedef null_type type;
-  };
-
-  template<class Hd, class Tl, template<typename T>
-  class Transform>
-  struct typelist_chain_transform_<
-    typelist_chain<Hd, Tl>,
-    Transform>
-  {
-    typedef typename typelist_chain_transform_< Tl, Transform>::type rest;
-
-    typedef typename Transform<Hd>::type my_type;
-
-    typedef typelist_chain< my_type, rest> type;
-  };
-
-} // namespace detail
-
-#endif // #ifndef TYPELIST_TRANSFORM_HPP
-
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/typelist/typelist_typelist_append.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/typelist/typelist_typelist_append.hpp
deleted file mode 100644
index fd2fba6c867..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/typelist/typelist_typelist_append.hpp
+++ /dev/null
@@ -1,89 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file typelist_typelist_append.hpp
- * Contains typelist_chain utilities.
- * Typelists are an idea by Andrei Alexandrescu.
- */
-
-#ifndef TYPELIST_TYPELIST_APPEND_HPP
-#define TYPELIST_TYPELIST_APPEND_HPP
-
-#ifdef _MSC_VER
-#pragma warning(disable: 4503)
-#endif // #ifdef _MSC_VER
-
-#include <ext/pb_assoc/detail/type_utils.hpp>
-
-namespace detail
-{
-
-  template<class Typelist_Typelist_Chain>
-  struct typelist_typelist_append_;
-
-  template<typename Hd>
-  struct typelist_typelist_append_<
-    typelist_chain<Hd, null_type> >
-  {
-    typedef typelist_chain< Hd, null_type> type;
-  };
-
-  template<class Hd, class Tl>
-  struct typelist_typelist_append_<
-    typelist_chain<
-    Hd,
-    Tl> >
-  {
-  private:
-    typedef typename typelist_typelist_append_< Tl>::type rest;
-
-  public:
-    typedef
-    typename typelist_append<
-      Hd,
-      typelist<
-      rest> >::type::root
-    type;
-  };
-
-} // namespace detail
-
-#endif // #ifndef TYPELIST_TYPELIST_APPEND_HPP
-
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/types_traits.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/types_traits.hpp
deleted file mode 100644
index 130242c1076..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/types_traits.hpp
+++ /dev/null
@@ -1,295 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file types_traits.hpp
- * Contains a traits class of types used by containers.
- */
-
-#ifndef TYPES_TRAITS_HPP
-#define TYPES_TRAITS_HPP
-
-#include <ext/pb_assoc/data_type.hpp>
-#include <ext/pb_assoc/detail/type_utils.hpp>
-#include <utility>
-
-namespace pb_assoc
-{
-
-  namespace detail
-  {
-
-    template<typename Data, class Allocator>
-    struct basic_data_types_traits
-    {
-
-    public:
-
-      typedef
-      typename Allocator::template rebind<
-	Data>::other::value_type
-      data_type;
-
-      typedef
-      typename Allocator::template rebind<
-	Data>::other::pointer
-      data_pointer;
-
-      typedef
-      typename Allocator::template rebind<
-	Data>::other::const_pointer
-      const_data_pointer;
-
-      typedef
-      typename Allocator::template rebind<
-	Data>::other::reference
-      data_reference;
-
-      typedef
-      typename Allocator::template rebind<
-	Data>::other::const_reference
-      const_data_reference;
-
-    };
-
-    template<typename Data, class Allocator>
-    struct data_types_traits : public basic_data_types_traits<
-      Data,
-      Allocator>
-    {
-
-    public:
-
-      typedef Data given_data_type;
-
-    };
-
-#define PB_ASSOC_CLASS_T_DEC \
-	template<class Allocator>
-
-#define PB_ASSOC_CLASS_C_DEC \
-	data_types_traits< \
-			null_data_type, \
-			Allocator>
-
-    template<class Allocator>
-    struct data_types_traits<
-      null_data_type,
-      Allocator> : public basic_data_types_traits<
-      null_data_type,
-      Allocator>
-    {
-
-    public:
-
-      typedef null_data_type given_data_type;
-
-    };
-
-#undef PB_ASSOC_CLASS_T_DEC
-
-#undef PB_ASSOC_CLASS_C_DEC
-
-    template<class Cntnr, class Allocator>
-    struct data_types_traits<
-      compound_data_type<
-      Cntnr>,
-      Allocator> : public basic_data_types_traits<
-      Cntnr,
-      Allocator>
-    {
-
-    public:
-
-      typedef compound_data_type< Cntnr> given_data_type;
-
-    };
-
-#define PB_ASSOC_CLASS_T_DEC \
-	template<typename Key, typename Data>
-
-#define PB_ASSOC_CLASS_C_DEC \
-	exception_throw_types_traits< \
-		Key, \
-		Data>
-
-    template<typename Key, typename Data>
-    struct exception_throw_types_traits
-    {
-
-    public:
-
-      typedef int_to_type<false> no_throw_copies_false_indicator;
-
-      typedef int_to_type<true> no_throw_copies_true_indicator;
-
-    private:
-      enum
-	{
-	  key_no_throw = is_simple_type<Key>::value,
-	  data_no_throw = is_same_type<Data, null_data_type>::value ||
-	  is_simple_type<Data>::value,
-	  no_throw_copies = key_no_throw&&  data_no_throw
-	};
-
-      typedef int_to_type<no_throw_copies> no_throw_copies_t;
-
-    public:
-      static no_throw_copies_t s_no_throw_copies_indicator;
-    };
-
-    PB_ASSOC_CLASS_T_DEC
-    typename PB_ASSOC_CLASS_C_DEC::no_throw_copies_t
-    PB_ASSOC_CLASS_C_DEC::s_no_throw_copies_indicator;
-
-#undef PB_ASSOC_CLASS_T_DEC
-
-#undef PB_ASSOC_CLASS_C_DEC
-
-    template<typename Key, typename Data, class Allocator>
-    struct value_types_traits
-    {
-
-    public:
-
-      typedef
-      typename Allocator::template rebind<
-	std::pair<const Key, Data> >::other
-      value_type_allocator;
-
-      typedef typename value_type_allocator::value_type value_type;
-
-      typedef typename value_type_allocator::pointer pointer;
-
-      typedef typename value_type_allocator::const_pointer const_pointer;
-
-      typedef typename value_type_allocator::reference reference;
-
-      typedef typename value_type_allocator::const_reference const_reference;
-
-    };
-
-    template<typename Key, class Allocator>
-    struct value_types_traits<
-      Key,
-      null_data_type,
-      Allocator>
-    {
-
-    public:
-
-      typedef
-      typename Allocator::template rebind<
-	Key>::other
-      value_type_allocator;
-
-      typedef typename value_type_allocator::value_type value_type;
-
-      typedef typename value_type_allocator::const_pointer pointer;
-
-      typedef typename value_type_allocator::const_pointer const_pointer;
-
-      typedef typename value_type_allocator::const_reference reference;
-
-      typedef typename value_type_allocator::const_reference const_reference;
-
-    };
-
-    template<typename Key, class Cntnr, class Allocator>
-    struct value_types_traits<
-      Key,
-      compound_data_type<
-      Cntnr>,
-      Allocator>
-    {
-    private:
-
-      typedef
-      typename Allocator::template rebind<
-	std::pair<const Key, Cntnr> >::other
-      value_type_allocator;
-
-    public:
-
-      typedef typename value_type_allocator::value_type value_type;
-
-      typedef typename value_type_allocator::pointer pointer;
-
-      typedef typename value_type_allocator::const_pointer const_pointer;
-
-      typedef typename value_type_allocator::reference reference;
-
-      typedef typename value_type_allocator::const_reference const_reference;
-
-    };
-
-    template<typename Key, typename Data, class Allocator>
-    struct types_traits : public data_types_traits<
-      Data,
-      Allocator>,
-public value_types_traits<
-      Key,
-      Data,
-      Allocator>,
-public exception_throw_types_traits<
-      Key,
-      Data>
-    {
-
-    public:
-
-      typedef typename Allocator::template rebind<Key>::other key_allocator;
-
-      typedef typename key_allocator::value_type key_type;
-
-      typedef typename key_allocator::pointer key_pointer;
-
-      typedef typename key_allocator::const_pointer const_key_pointer;
-
-      typedef typename key_allocator::reference key_reference;
-
-      typedef typename key_allocator::const_reference const_key_reference;
-
-    };
-
-  } // namespace detail
-
-} // namespace pb_assoc
-
-#endif // #ifndef TYPES_TRAITS_HPP
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/unordered_iterator/const_find_iterator.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/unordered_iterator/const_find_iterator.hpp
deleted file mode 100644
index a854e8a2aea..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/unordered_iterator/const_find_iterator.hpp
+++ /dev/null
@@ -1,138 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file const_find_iterator.hpp
- * Contains an iterator class returned by the tables' const find and insert
- *   methods.
- */
-
-class find_iterator_;
-
-class const_find_iterator_
-{
-
-public:
-
-  typedef trivial_iterator_tag iterator_category;
-
-  typedef trivial_iterator_difference_type difference_type;
-
-  typedef mapped_value_type value_type;
-
-  typedef mapped_pointer pointer;
-
-  typedef const_mapped_pointer const_pointer;
-
-  typedef mapped_reference reference;
-
-  typedef const_mapped_reference const_reference;
-
-public:
-
-  inline
-  const_find_iterator_(const_pointer p_value) : m_p_value(p_value)
-  { }
-
-  inline
-  const_find_iterator_()
-
-    : m_p_value(NULL)
-  { }
-
-  inline
-  const_find_iterator_(const const_find_iterator_& r_other)
-
-    : m_p_value(r_other.m_p_value)
-  { }
-
-  inline
-  const_find_iterator_(const find_iterator_& r_other)
-
-    : m_p_value(r_other.m_p_value)
-  { }
-
-  inline const_pointer
-  operator->() const
-  {
-    PB_ASSOC_DBG_ASSERT(m_p_value != NULL);
-
-    return (m_p_value);
-  }
-
-  inline const_reference
-  operator*() const
-  {
-    PB_ASSOC_DBG_ASSERT(m_p_value != NULL);
-
-    return (*m_p_value);
-  }
-
-  inline bool
-  operator==(const find_iterator_& r_other) const
-  {
-    return (m_p_value == r_other.m_p_value);
-  }
-
-  inline bool
-  operator==(const const_find_iterator_& r_other) const
-  {
-    return (m_p_value == r_other.m_p_value);
-  }
-
-  inline bool
-  operator!=(const find_iterator_& r_other) const
-  {
-    return (m_p_value != r_other.m_p_value);
-  }
-
-  inline bool
-  operator!=(const const_find_iterator_& r_other) const
-  {
-    return (m_p_value != r_other.m_p_value);
-  }
-
-protected:
-  const_pointer m_p_value;
-
-  friend class find_iterator_;
-
-  friend class PB_ASSOC_CLASS_C_DEC;
-};
-
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/unordered_iterator/const_iterator.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/unordered_iterator/const_iterator.hpp
deleted file mode 100644
index cff9abdb01f..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/unordered_iterator/const_iterator.hpp
+++ /dev/null
@@ -1,122 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file const_iterator.hpp
- * Contains an iterator class used for const ranging over the elements of the
- *   table.
- */
-
-class const_iterator_ : 
-  public const_find_iterator_
-
-{
-
-public:
-
-  typedef std::forward_iterator_tag iterator_category;
-
-  typedef typename Allocator::difference_type difference_type;
-
-  typedef mapped_value_type value_type;
-
-  typedef mapped_pointer pointer;
-
-  typedef const_mapped_pointer const_pointer;
-
-  typedef mapped_reference reference;
-
-  typedef const_mapped_reference const_reference;
-
-public:
-
-  inline
-  const_iterator_()
-
-    : m_p_tbl(NULL)
-  { }
-
-  inline const_iterator_& 
-  operator++()
-  {
-    m_p_tbl->inc_it_state(my_base::m_p_value, m_pos);
-
-    return (*this);
-  }
-
-  inline const_iterator_
-  operator++(int)
-  {
-    const_iterator_ ret =* this;
-
-    m_p_tbl->inc_it_state(my_base::m_p_value, m_pos);
-
-    return (ret);
-  }
-
-protected:
-
-  typedef const_find_iterator_ my_base;
-
-protected:
-
-  /**
-   * Constructor used by the table to initiate the generalized
-   *   pointer and position (e.g., this is called from within a find()
-   *   of a table.
-   **/
-  inline
-  const_iterator_(const_mapped_pointer p_value, PB_ASSOC_GEN_POS pos, const PB_ASSOC_CLASS_C_DEC* p_tbl) : const_find_iterator_(p_value),
-													   m_p_tbl(p_tbl),
-													   m_pos(pos)
-  { }
-
-protected:
-
-  /**
-   * Pointer to the table object which created the iterator (used for
-   *   incrementing its position.
-   **/
-  const PB_ASSOC_CLASS_C_DEC* m_p_tbl;
-
-  PB_ASSOC_GEN_POS m_pos;
-
-  friend class PB_ASSOC_CLASS_C_DEC;
-};
-
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/unordered_iterator/find_iterator.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/unordered_iterator/find_iterator.hpp
deleted file mode 100644
index f91b6a7e2db..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/unordered_iterator/find_iterator.hpp
+++ /dev/null
@@ -1,147 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file find_iterator.hpp
- * Contains an iterator class returned by the tables' find and insert
- *   methods.
- */
-
-class find_iterator_
-{
-
-public:
-
-  typedef trivial_iterator_tag iterator_category;
-
-  typedef trivial_iterator_difference_type difference_type;
-
-  typedef mapped_value_type value_type;
-
-  typedef mapped_pointer pointer;
-
-  typedef const_mapped_pointer const_pointer;
-
-  typedef mapped_reference reference;
-
-  typedef const_mapped_reference const_reference;
-
-public:
-
-  inline
-  find_iterator_()
-
-    : m_p_value(NULL)
-  { }
-
-  inline
-  find_iterator_(const find_iterator_& r_other)
-
-    : m_p_value(r_other.m_p_value)
-  { }
-
-  inline pointer
-  operator->()
-  {
-    PB_ASSOC_DBG_ASSERT(m_p_value != NULL);
-
-    return (m_p_value);
-  }
-
-  inline const_pointer
-  operator->() const
-  {
-    PB_ASSOC_DBG_ASSERT(m_p_value != NULL);
-
-    return (m_p_value);
-  }
-
-  inline reference
-  operator*()
-  {
-    PB_ASSOC_DBG_ASSERT(m_p_value != NULL);
-
-    return (*m_p_value);
-  }
-
-  inline const_reference
-  operator*() const
-  {
-    PB_ASSOC_DBG_ASSERT(m_p_value != NULL);
-
-    return (*m_p_value);
-  }
-
-  inline bool
-  operator==(const find_iterator_& r_other) const
-  {
-    return (m_p_value == r_other.m_p_value);
-  }
-
-  inline bool
-  operator==(const const_find_iterator_& r_other) const
-  {
-    return (m_p_value == r_other.m_p_value);
-  }
-
-  inline bool
-  operator!=(const find_iterator_& r_other) const
-  {
-    return (m_p_value != r_other.m_p_value);
-  }
-
-  inline bool
-  operator!=(const const_find_iterator_& r_other) const
-  {
-    return (m_p_value != r_other.m_p_value);
-  }
-
-  inline
-  find_iterator_(pointer p_value) : m_p_value(p_value)
-  { }
-
-protected:
-  friend class const_find_iterator_;
-
-  friend class PB_ASSOC_CLASS_C_DEC;
-
-protected:
-  pointer m_p_value;
-};
-
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/unordered_iterator/iterator.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/unordered_iterator/iterator.hpp
deleted file mode 100644
index f15d8189ce6..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/unordered_iterator/iterator.hpp
+++ /dev/null
@@ -1,139 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file iterator.hpp
- * Contains an iterator_ class used for ranging over the elements of the
- *	table.
- */
-
-class iterator_ : 
-  public const_iterator_
-
-{
-
-public:
-
-  typedef std::forward_iterator_tag iterator_category;
-
-  typedef typename Allocator::difference_type difference_type;
-
-  typedef mapped_value_type value_type;
-
-  typedef mapped_pointer pointer;
-
-  typedef const_mapped_pointer const_pointer;
-
-  typedef mapped_reference reference;
-
-  typedef const_mapped_reference const_reference;
-
-public:
-
-  inline
-  iterator_()
-
-    : const_iterator_(NULL, PB_ASSOC_GEN_POS(), NULL)
-  { }
-
-  inline
-  operator find_iterator_()
-  {
-    return (find_iterator_(
-			   const_cast<pointer>(const_iterator_::m_p_value)));
-  }
-
-  inline
-  operator const find_iterator_() const
-  {
-    return (find_iterator_(
-			   const_cast<pointer>(const_iterator_::m_p_value)));
-  }
-
-  inline pointer
-  operator->()
-  {
-    PB_ASSOC_DBG_ASSERT(my_base::m_p_value != NULL);
-
-    return (const_cast<pointer>(my_base::m_p_value));
-  }
-
-  inline reference
-  operator*()
-  {
-    PB_ASSOC_DBG_ASSERT(my_base::m_p_value != NULL);
-
-    return (*(operator->()));
-  }
-
-  inline iterator_& 
-  operator++()
-  {
-    my_base::m_p_tbl->inc_it_state(my_base::m_p_value, my_base::m_pos);
-
-    return (*this);
-  }
-
-  inline iterator_
-  operator++(int)
-  {
-    iterator_ ret =* this;
-
-    my_base::m_p_tbl->inc_it_state(my_base::m_p_value, my_base::m_pos);
-
-    return (ret);
-  }
-
-protected:
-  typedef const_iterator_ my_base;
-
-protected:
-
-  /**
-   * Constructor used by the table to initiate the generalized
-   *   pointer and position (e.g., this is called from within a find()
-   *   of a table.
-   **/
-  inline
-  iterator_(pointer p_value, PB_ASSOC_GEN_POS pos, PB_ASSOC_CLASS_C_DEC* p_tbl) : const_iterator_(p_value, pos, p_tbl)
-  { }
-
-  friend class PB_ASSOC_CLASS_C_DEC;
-};
-
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/value_type_adapter/constructor_destructor_and_related.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/value_type_adapter/constructor_destructor_and_related.hpp
deleted file mode 100644
index 185e4b6be59..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/value_type_adapter/constructor_destructor_and_related.hpp
+++ /dev/null
@@ -1,183 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file constructor_destructor_and_related.hpp
- * Contains an adapter of mapping levels.
- */
-
-PB_ASSOC_CLASS_T_DEC
-inline
-PB_ASSOC_CLASS_C_DEC::
-value_type_adapter()
-{ }
-
-PB_ASSOC_CLASS_T_DEC
-template<typename T0>
-inline
-PB_ASSOC_CLASS_C_DEC::
-value_type_adapter(T0 t0) :
-  my_base(t0)
-{ }
-
-PB_ASSOC_CLASS_T_DEC
-template<typename T0, typename T1>
-inline
-PB_ASSOC_CLASS_C_DEC::
-value_type_adapter(T0 t0, T1 t1)  :
-  my_base(t0, t1)
-{ }
-
-PB_ASSOC_CLASS_T_DEC
-template<typename T0, typename T1, typename T2>
-inline
-PB_ASSOC_CLASS_C_DEC::
-value_type_adapter(T0 t0, T1 t1, T2 t2) :
-  my_base(t0, t1, t2)
-{ }
-
-PB_ASSOC_CLASS_T_DEC
-template<typename T0, typename T1, typename T2, typename T3>
-inline
-PB_ASSOC_CLASS_C_DEC::
-value_type_adapter(T0 t0, T1 t1, T2 t2, T3 t3) :
-  my_base(t0, t1, t2, t3)
-{ }
-
-PB_ASSOC_CLASS_T_DEC
-template<typename T0,
-	 typename T1,
-	 typename T2,
-	 typename T3,
-	 typename T4>
-inline
-PB_ASSOC_CLASS_C_DEC::
-value_type_adapter(T0 t0, T1 t1, T2 t2, T3 t3, T4 t4) :
-  my_base(t0, t1, t2, t3, t4)
-{ }
-
-PB_ASSOC_CLASS_T_DEC
-template<typename T0,
-	 typename T1,
-	 typename T2,
-	 typename T3,
-	 typename T4,
-	 typename T5>
-inline
-PB_ASSOC_CLASS_C_DEC::
-value_type_adapter(T0 t0, T1 t1, T2 t2, T3 t3, T4 t4, T5 t5)  :
-  my_base(t0,
-	  t1,
-	  t2,
-	  t3,
-	  t4,
-	  t5)
-{ }
-
-PB_ASSOC_CLASS_T_DEC
-template<typename T0,
-	 typename T1,
-	 typename T2,
-	 typename T3,
-	 typename T4,
-	 typename T5,
-	 typename T6>
-inline
-PB_ASSOC_CLASS_C_DEC::
-value_type_adapter(T0 t0, T1 t1, T2 t2, T3 t3, T4 t4, T5 t5, T6 t6)   :
-  my_base(t0,
-	  t1,
-	  t2,
-	  t3,
-	  t4,
-	  t5,
-	  t6)
-{ }
-
-PB_ASSOC_CLASS_T_DEC
-template<typename T0,
-	 typename T1,
-	 typename T2,
-	 typename T3,
-	 typename T4,
-	 typename T5,
-	 typename T6,
-	 typename T7>
-inline
-PB_ASSOC_CLASS_C_DEC::
-value_type_adapter(T0 t0, T1 t1, T2 t2, T3 t3, T4 t4, T5 t5, T6 t6, T7 t7) :
-  my_base(t0,
-	  t1,
-	  t2,
-	  t3,
-	  t4,
-	  t5,
-	  t6,
-	  t7)
-{ }
-
-PB_ASSOC_CLASS_T_DEC
-template<typename T0,
-	 typename T1,
-	 typename T2,
-	 typename T3,
-	 typename T4,
-	 typename T5,
-	 typename T6,
-	 typename T7,
-	 typename T8>
-inline
-PB_ASSOC_CLASS_C_DEC::
-value_type_adapter(T0 t0, T1 t1, T2 t2, T3 t3, T4 t4, T5 t5, T6 t6, T7 t7, T8 t8)  :
-  my_base(t0,
-	  t1,
-	  t2,
-	  t3,
-	  t4,
-	  t5,
-	  t6,
-	  t7,
-	  t8)
-{ }
-
-PB_ASSOC_CLASS_T_DEC
-PB_ASSOC_CLASS_C_DEC::
-~value_type_adapter()
-{ }
-
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/value_type_adapter/erase_fn_imps.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/value_type_adapter/erase_fn_imps.hpp
deleted file mode 100644
index 05a2dde131e..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/value_type_adapter/erase_fn_imps.hpp
+++ /dev/null
@@ -1,43 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file erase_fn_imps.hpp
- * Contains an adapter of mapping levels.
- */
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/value_type_adapter/erase_if_pred.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/value_type_adapter/erase_if_pred.hpp
deleted file mode 100644
index b3a7bbbc92a..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/value_type_adapter/erase_if_pred.hpp
+++ /dev/null
@@ -1,72 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file erase_if_pred.hpp
- * Contains a bridge erase_if predicate
- */
-
-template<class Pred>
-class erase_if_pred
-{
-public:
-  // Tmp Ami all erase-ifs should take a reference to a predicate?
-  erase_if_pred(Pred& r_pred, typename my_base::iterator base_it) : m_r_pred(r_pred),
-								    m_base_it(base_it)
-  { }
-
-  inline bool
-  operator()(typename my_base_data_type::iterator::reference r_val)
-  {
-    it_value_type_traits_t::make_valid(m_value_type_holder, m_base_it->first, r_val);
-
-    typename it_value_type_traits_t::pointer p_exp_val =
-      it_value_type_traits_t::recast(m_value_type_holder);
-
-    return (m_r_pred(*p_exp_val));
-  }
-
-private:
-  Pred& m_r_pred;
-
-  typename my_base::iterator m_base_it;
-
-  typename it_value_type_traits_t::value_type_holder m_value_type_holder;
-};
-
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/value_type_adapter/find_fn_imps.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/value_type_adapter/find_fn_imps.hpp
deleted file mode 100644
index 8bf8df441b6..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/value_type_adapter/find_fn_imps.hpp
+++ /dev/null
@@ -1,43 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file find_fn_imps.hpp
- * Contains an adapter of mapping levels.
- */
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/value_type_adapter/info_fn_imps.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/value_type_adapter/info_fn_imps.hpp
deleted file mode 100644
index 2e33a3c25d2..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/value_type_adapter/info_fn_imps.hpp
+++ /dev/null
@@ -1,68 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file info_fn_imps.hpp
- * Contains an adapter of mapping levels.
- */
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::size_type
-PB_ASSOC_CLASS_C_DEC::
-size() const
-{
-  return (std::distance(begin(), end()));
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline typename PB_ASSOC_CLASS_C_DEC::size_type
-PB_ASSOC_CLASS_C_DEC::
-max_size() const
-{
-  return (my_base::max_size());
-}
-
-PB_ASSOC_CLASS_T_DEC
-inline bool
-PB_ASSOC_CLASS_C_DEC::
-empty() const
-{
-  return (size() == 0);
-}
-
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/value_type_adapter/insert_fn_imps.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/value_type_adapter/insert_fn_imps.hpp
deleted file mode 100644
index 8501c130575..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/value_type_adapter/insert_fn_imps.hpp
+++ /dev/null
@@ -1,44 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file insert_fn_imps.hpp
- * Contains an adapter of mapping levels.
- */
-
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/value_type_adapter/invalidation_guarantee_selector.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/value_type_adapter/invalidation_guarantee_selector.hpp
deleted file mode 100644
index 68dd4bd306b..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/value_type_adapter/invalidation_guarantee_selector.hpp
+++ /dev/null
@@ -1,128 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file invalidation_guarantee_selector.hpp
- * Contains an adapter of mapping levels.
- */
-
-namespace pb_assoc
-{
-
-  namespace detail
-  {
-
-    template<class IG0, class IG1>
-    struct ig_sel;
-
-    template<>
-    struct ig_sel<
-      basic_invalidation_guarantee,
-      basic_invalidation_guarantee>
-    {
-      typedef basic_invalidation_guarantee type;
-    };
-
-    template<>
-    struct ig_sel<
-      basic_invalidation_guarantee,
-      find_invalidation_guarantee>
-    {
-      typedef basic_invalidation_guarantee type;
-    };
-
-    template<>
-    struct ig_sel<
-      basic_invalidation_guarantee,
-      range_invalidation_guarantee>
-    {
-      typedef basic_invalidation_guarantee type;
-    };
-
-    template<>
-    struct ig_sel<
-      find_invalidation_guarantee,
-      basic_invalidation_guarantee>
-    {
-      typedef basic_invalidation_guarantee type;
-    };
-
-    template<>
-    struct ig_sel<
-      find_invalidation_guarantee,
-      find_invalidation_guarantee>
-    {
-      typedef find_invalidation_guarantee type;
-    };
-
-    template<>
-    struct ig_sel<
-      find_invalidation_guarantee,
-      range_invalidation_guarantee>
-    {
-      typedef find_invalidation_guarantee type;
-    };
-
-    template<>
-    struct ig_sel<
-      range_invalidation_guarantee,
-      basic_invalidation_guarantee>
-    {
-      typedef basic_invalidation_guarantee type;
-    };
-
-    template<>
-    struct ig_sel<
-      range_invalidation_guarantee,
-      find_invalidation_guarantee>
-    {
-      typedef find_invalidation_guarantee type;
-    };
-
-    template<>
-    struct ig_sel<
-      range_invalidation_guarantee,
-      range_invalidation_guarantee>
-    {
-      typedef range_invalidation_guarantee type;
-    };
-
-  } // namespace detail
-
-} // namespace pb_assoc
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/value_type_adapter/it_value_type_traits.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/value_type_adapter/it_value_type_traits.hpp
deleted file mode 100644
index 4be113d8ecd..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/value_type_adapter/it_value_type_traits.hpp
+++ /dev/null
@@ -1,218 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file it_value_type_traits.hpp
- * Contains an adapter of mapping levels.
- */
-
-template<class Base, bool Lowest>
-struct base_it_key_type
-{
-  typedef typename Base::it_key_type type;
-};
-
-template<class Base>
-struct base_it_key_type<
-  Base,
-  true>
-{
-  typedef typename Base::const_key_reference type;
-};
-
-template<typename Base_Key_,
-	 typename Key_,
-	 typename Data_,
-	 typename Value_,
-	 class Allocator_ >
-struct it_value_type_traits_
-{
-  typedef ref_pair< Base_Key_, Key_> key_ref_pair;
-
-  typedef
-  typename Allocator_::template rebind<
-    key_ref_pair>::other::const_reference
-  key_ref_pair_val;
-
-  typedef key_ref_pair_val key_type;
-
-  typedef ref_pair< key_ref_pair_val, Data_> value_type;
-
-  typedef
-  typename Allocator_::template rebind<
-    value_type>::other::reference
-  reference;
-
-  typedef
-  typename Allocator_::template rebind<
-    value_type>::other::const_reference
-  const_reference;
-
-  typedef
-  typename Allocator_::template rebind<
-    value_type>::other::pointer
-  pointer;
-
-  typedef
-  typename Allocator_::template rebind<
-    value_type>::other::const_pointer
-  const_pointer;
-
-  struct value_type_holder
-  {
-    typename std::tr1::aligned_storage<sizeof(key_ref_pair),
-      std::tr1::alignment_of<key_ref_pair>::value>::type  m_a_key_buf;
-
-    typename std::tr1::aligned_storage<sizeof(value_type),
-      std::tr1::alignment_of<value_type>::value>::type  m_a_value_buf;
-  };
-
-  typedef
-  typename Allocator_::template rebind<
-    value_type_holder>::other::reference
-  value_type_hoder_valerence;
-
-  inline static pointer
-  recast(value_type_hoder_valerence r_holder)
-  {
-    return reinterpret_cast<pointer>(&r_holder.m_a_value_buf);
-  }
-
-  inline static void
-  make_valid(value_type_hoder_valerence r_holder, Base_Key_ r_bk, Value_ r_val)
-  {
-    typedef
-      typename Allocator_::template rebind<
-      void* >::other::value_type
-      void_pointer;
-
-    void_pointer p_target = &r_holder.m_a_key_buf;
-
-    new (p_target) key_ref_pair(r_bk, r_val.first);
-
-    typedef
-      typename Allocator_::template rebind<
-      key_ref_pair>::other::pointer
-      key_ref_pair_pointer;
-
-    key_ref_pair_pointer p_key =
-      reinterpret_cast<key_ref_pair_pointer>(&r_holder.m_a_key_buf);
-
-    p_target = &r_holder.m_a_value_buf;
-
-    new (p_target) value_type(*p_key, r_val.second);
-  }
-};
-
-template<typename Base_Key_,
-	 typename Key_,
-	 typename Value_,
-	 class Allocator_>
-struct it_value_type_traits_<
-  Base_Key_,
-  Key_,
-  null_data_type,
-  Value_,
-  Allocator_>
-{
-  typedef ref_pair< Base_Key_, Key_> key_ref_pair;
-
-  typedef
-  typename Allocator_::template rebind<
-    key_ref_pair>::other::const_reference
-  key_ref_pair_val;
-
-  typedef key_ref_pair_val key_type;
-
-  typedef key_ref_pair value_type;
-
-  typedef
-  typename Allocator_::template rebind<
-    value_type>::other::const_reference
-  reference;
-
-  typedef
-  typename Allocator_::template rebind<
-    value_type>::other::const_reference
-  const_reference;
-
-  typedef
-  typename Allocator_::template rebind<
-    value_type>::other::const_pointer
-  pointer;
-
-  typedef
-  typename Allocator_::template rebind<
-    value_type>::other::const_pointer
-  const_pointer;
-
-  struct value_type_holder
-  {
-    typename std::tr1::aligned_storage<sizeof(key_ref_pair),
-      std::tr1::alignment_of<key_ref_pair>::value>::type  m_a_key_buf;
-
-    typename std::tr1::aligned_storage<sizeof(value_type),
-      std::tr1::alignment_of<value_type>::value>::type  m_a_value_buf;
-  };
-
-  typedef
-  typename Allocator_::template rebind<
-    value_type_holder>::other::reference
-  value_type_hoder_valerence;
-
-  inline static pointer
-  recast(value_type_hoder_valerence r_holder)
-  {
-    return reinterpret_cast<pointer>(&r_holder.m_a_value_buf);
-  }
-
-  inline static void
-  make_valid(value_type_hoder_valerence r_holder, Base_Key_ r_bk, Value_ r_val)
-  {
-    typedef
-      typename Allocator_::template rebind<
-      void* >::other::value_type
-      void_pointer;
-
-    void_pointer p_target = &r_holder.m_a_value_buf;
-
-    new (p_target) key_ref_pair(r_bk, r_val.first);
-  }
-};
-
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/value_type_adapter/iterator.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/value_type_adapter/iterator.hpp
deleted file mode 100644
index a03ce358a0c..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/value_type_adapter/iterator.hpp
+++ /dev/null
@@ -1,196 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file it_.hpp
- * Contains an it_ for an adapter of mapping levels.
- */
-
-#define PB_ASSOC_IT_C_DEC \
-	it_< \
-		It0, \
-		It1, \
-		Has_Data, \
-		Const>
-
-#define PB_ASSOC_OIT_T_DEC \
-	template<class OIt0, class OIt1, bool OHas_Data, bool OConst>
-
-#define PB_ASSOC_OIT_C_DEC \
-	it_< \
-		OIt0, \
-		OIt1, \
-		OHas_Data, \
-		OConst>
-
-template<class It0, class It1, bool Has_Data, bool Const>
-class it_
-{
-public:
-
-  typedef typename it_value_type_traits_t::value_type value_type;
-
-  typedef typename it_value_type_traits_t::reference reference;
-
-  typedef
-  typename it_value_type_traits_t::const_reference
-  const_reference;
-
-  typedef typename it_value_type_traits_t::pointer pointer;
-
-  typedef typename it_value_type_traits_t::const_pointer const_pointer;
-
-public:
-  inline
-  it_(It0 it0 = It0(),
-      It0 end_it0 = It0(),
-      It1 it1 = It1()) : m_it0(it0),
-			 m_end_it0(end_it0),
-			 m_it1(it1)
-  { }
-
-  inline
-  it_(const PB_ASSOC_IT_C_DEC& r_other) : m_it0(r_other.m_it0),
-					  m_end_it0(r_other.m_end_it0),
-					  m_it1(r_other.m_it1)
-  { }
-
-  PB_ASSOC_OIT_T_DEC
-  inline
-  it_(const PB_ASSOC_OIT_C_DEC& r_other) : m_it0(r_other.m_it0),
-					   m_end_it0(r_other.m_end_it0),
-					   m_it1(r_other.m_it1)
-  { }
-
-  inline bool
-  operator==(const PB_ASSOC_IT_C_DEC& r_other) const
-  {
-    if (m_it0 != r_other.m_it0)
-      return (false);
-
-    if (m_it0 == m_end_it0)
-      return (true);
-
-    return (m_it1 == r_other.m_it1);
-  }
-
-  inline bool
-  operator!=(const PB_ASSOC_IT_C_DEC& r_other) const
-  {
-    return (!operator==(r_other));
-  }
-
-  inline PB_ASSOC_IT_C_DEC& 
-  operator++()
-  {
-    ++m_it1;
-
-    if (m_it1 == m_it0->second.end())
-      do
-	{
-	  ++m_it0;
-	}
-      while (m_it0 != m_end_it0&&  m_it0->second.empty());
-
-    if (m_it0 != m_end_it0&&  !m_it0->second.empty())
-      m_it1 = m_it0->second.begin();
-
-    return (*this);
-  }
-
-  inline PB_ASSOC_IT_C_DEC
-  operator++(int)
-  {
-    PB_ASSOC_IT_C_DEC ret =* this;
-
-    operator++();
-
-    return (ret);
-  }
-
-  inline const_pointer
-  operator->() const
-  {
-    it_value_type_traits_t::make_valid(m_value_type_holder, m_it0->first, * m_it1);
-
-    return (it_value_type_traits_t::recast(m_value_type_holder));
-  }
-
-  inline pointer
-  operator->()
-  {
-    // Tmp Ami PB_ASSOC_STATIC_ASSERT(non_const, !Const);
-
-    it_value_type_traits_t::make_valid(m_value_type_holder, m_it0->first, * m_it1);
-
-    return (it_value_type_traits_t::recast(m_value_type_holder));
-  }
-
-  inline const_reference
-  operator*() const
-  {
-    return (*operator->());
-  }
-
-  inline reference
-  operator*()
-  {
-    PB_ASSOC_STATIC_ASSERT(non_const, !Const);
-
-    return (*operator->());
-  }
-
-public:
-  mutable It0 m_it0;
-  It0 m_end_it0;
-
-  mutable It1 m_it1;
-
-  int_to_type<Has_Data> m_has_data;
-
-private:
-  mutable typename it_value_type_traits_t::value_type_holder m_value_type_holder;
-};
-
-#undef PB_ASSOC_IT_C_DEC
-
-#undef PB_ASSOC_OIT_T_DEC
-
-#undef PB_ASSOC_OIT_C_DEC
-
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/value_type_adapter/iterator_fn_imps.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/value_type_adapter/iterator_fn_imps.hpp
deleted file mode 100644
index 754faf720e0..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/value_type_adapter/iterator_fn_imps.hpp
+++ /dev/null
@@ -1,44 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file iterator_fn_imps.hpp
- * Contains an adapter of mapping levels.
- */
-
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/value_type_adapter/ref_pair.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/value_type_adapter/ref_pair.hpp
deleted file mode 100644
index 8e8fda0702c..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/value_type_adapter/ref_pair.hpp
+++ /dev/null
@@ -1,73 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file ref_pair.hpp
- * Contains an adapter of mapping levels.
- */
-
-namespace pb_assoc
-{
-
-  namespace detail
-  {
-
-    template<typename T0, typename T1>
-    struct ref_pair
-    {
-    public:
-      typedef T0 first_type;
-
-      typedef T1 second_type;
-
-    public:
-      inline
-      ref_pair(T0 t0, T1 t1) : first(t0),
-			       second(t1)
-      { }
-
-    public:
-      T0 first;
-
-      T1 second;
-    };
-
-  } // namespace detail
-
-} // namespace pb_assoc
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/value_type_adapter/value_type_adapter.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/value_type_adapter/value_type_adapter.hpp
deleted file mode 100644
index 9f2dfb2fb6a..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/value_type_adapter/value_type_adapter.hpp
+++ /dev/null
@@ -1,601 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file value_type_adapter.hpp
- * Contains an adapter of mapping levels.
- */
-
-#ifndef VALUE_TYPE_ADAPTER_HPP
-#define VALUE_TYPE_ADAPTER_HPP
-
-#include <ext/pb_assoc/detail/value_type_adapter/ref_pair.hpp>
-#include <ext/pb_assoc/detail/assoc_cntnr_base.hpp>
-#include <ext/pb_assoc/detail/value_type_adapter/invalidation_guarantee_selector.hpp>
-#include <ext/pb_assoc/detail/type_utils.hpp>
-#include <utility>
-#include <algorithm>
-#include <tr1/type_traits>  // for aligned_storage/alignment_of
-
-namespace pb_assoc
-{
-
-  namespace detail
-  {
-
-#define PB_ASSOC_STATIC_ASSERT(UNIQUE, E) \
-	typedef \
-		pb_assoc::detail::static_assert_dummy_class< \
-			sizeof(pb_assoc::detail::static_assert<(bool)(E)>)> \
-			UNIQUE##static_assert_type
-
-#define PB_ASSOC_CLASS_T_DEC \
-	template< \
-		typename Key, \
-		typename Data, \
-		class DS_Tag, \
-		class Policy_Tl, \
-		class Allocator, \
-		int Mapping_Level>
-
-#define PB_ASSOC_CLASS_C_DEC \
-	value_type_adapter< \
-		Key, \
-		Data, \
-		DS_Tag, \
-		Policy_Tl, \
-		Allocator, \
-		Mapping_Level>
-
-#define PB_ASSOC_BASE_C_DEC \
-	cond_type< \
-		Mapping_Level != 1, \
-		value_type_adapter< \
-			Key, \
-			Data, \
-			DS_Tag, \
-			Policy_Tl, \
-			Allocator, \
-			Mapping_Level - 1>, \
-		typename assoc_cntnr_base< \
-			Key, \
-			Data, \
-			DS_Tag, \
-			Policy_Tl, \
-			Allocator>::type>::type
-
-    template<typename Key,
-	     typename Data,
-	     class DS_Tag,
-	     class Policy_Tl,
-	     class Allocator,
-	     int Mapping_Level>
-    struct value_type_adapter : public PB_ASSOC_BASE_C_DEC
-    {
-
-    private:
-      typedef typename PB_ASSOC_BASE_C_DEC my_base;
-
-      typedef typename my_base::data_type my_base_data_type;
-
-      enum
-	{
-	  same_alloc_type =
-	  is_same_type<
-	  typename my_base::allocator::template rebind<
-	  char>::other,
-	  typename my_base_data_type::allocator::template rebind<
-	  char>::other>::value
-	};
-
-      PB_ASSOC_STATIC_ASSERT(wrong_level, Mapping_Level > 0);
-
-      PB_ASSOC_STATIC_ASSERT(must_be_same_alloc, same_alloc_type);
-
-#include <ext/pb_assoc/detail/value_type_adapter/value_type_traits.hpp>
-#include <ext/pb_assoc/detail/value_type_adapter/it_value_type_traits.hpp>
-
-      typedef
-      it_value_type_traits_<
-	typename base_it_key_type<
-	my_base,
-	Mapping_Level == 1>::type,
-	typename my_base_data_type::const_key_reference,
-	typename cond_type<
-	is_same_type<
-	typename my_base_data_type::data_type,
-	null_data_type>::value,
-	null_data_type,
-	typename my_base_data_type::data_reference>::type,
-	typename my_base_data_type::reference,
-	typename my_base::allocator>
-      it_value_type_traits_t;
-
-#include <ext/pb_assoc/detail/value_type_adapter/iterator.hpp>
-
-      typedef
-      value_type_traits_<
-	typename my_base::key_type,
-	typename my_base_data_type::key_type,
-	typename my_base_data_type::data_type,
-	typename my_base::allocator>
-      value_type_traits_t;
-
-      enum
-	{
-	  has_data =
-	  !is_same_type<
-	  typename my_base_data_type::data_type,
-	  null_data_type>::value
-	};
-
-    public:
-
-      typedef typename Allocator::size_type size_type;
-
-      typedef typename Allocator::difference_type difference_type;
-
-      typedef typename my_base::allocator allocator;
-
-      typedef typename it_value_type_traits_t::key_type it_key_type;
-
-      typedef
-      std::pair<
-	typename my_base::key_type,
-	typename my_base_data_type::key_type>
-      key_type;
-
-      typedef
-      typename allocator::template rebind<
-	key_type>::other::reference
-      key_reference;
-
-      typedef
-      typename allocator::template rebind<
-	key_type>::other::const_reference
-      const_key_reference;
-
-      typedef
-      typename allocator::template rebind<
-	key_type>::other::pointer
-      key_pointer;
-
-      typedef
-      typename allocator::template rebind<
-	key_type>::other::const_pointer
-      const_key_pointer;
-
-      typedef typename my_base_data_type::data_type data_type;
-
-      typedef
-      typename allocator::template rebind<
-	data_type>::other::reference
-      data_reference;
-
-      typedef
-      typename allocator::template rebind<
-	data_type>::other::const_reference
-      const_data_reference;
-
-      typedef
-      typename allocator::template rebind<
-	data_type>::other::pointer
-      data_pointer;
-
-      typedef
-      typename allocator::template rebind<
-	data_type>::other::const_pointer
-      const_data_pointer;
-
-      typedef typename value_type_traits_t::value_type value_type;
-
-      typedef typename value_type_traits_t::reference reference;
-
-      typedef typename value_type_traits_t::const_reference const_reference;
-
-      typedef typename value_type_traits_t::pointer pointer;
-
-      typedef typename value_type_traits_t::const_pointer const_pointer;
-
-      typedef
-      it_<
-	typename my_base::const_find_iterator,
-	typename my_base_data_type::const_find_iterator,
-	has_data,
-	true>
-      const_find_iterator;
-
-      typedef
-      it_<
-	typename my_base::find_iterator,
-	typename my_base_data_type::find_iterator,
-	has_data,
-	false>
-      find_iterator;
-
-      typedef
-      it_<
-	typename my_base::const_iterator,
-	typename my_base_data_type::const_iterator,
-	has_data,
-	true>
-      const_iterator;
-
-      typedef
-      it_<
-	typename my_base::iterator,
-	typename my_base_data_type::iterator,
-	has_data,
-	false>
-      iterator;
-
-      enum
-	{
-	  mapping_level = mapping_level_imp<
-	  typename my_base::given_data_type>::value -1
-	};
-
-      // Tmp Ami rebind
-
-      typedef compound_ds_tag ds_category;
-
-      typedef
-      typename cond_type<
-	mapping_level == 1,
-	typename cond_type<
-	has_data,
-	data_enabled_ms_tag,
-	basic_ms_tag>::type,
-	compound_data_enabled_ms_tag>::type
-      ms_category;
-
-      typedef
-      typename cond_type<
-	Mapping_Level == 1,
-	DS_Tag,
-	compound_ds_tag>::type
-      effective_base_ds_tag;
-
-      typedef ds_traits< my_base_data_type> base_data_ds_traits;
-
-      enum
-	{
-	  erase_can_throw =
-	  base_data_ds_traits::erase_can_throw
-	};
-
-      enum
-	{
-	  order_preserving =
-	  order_preserving_imp<
-	  my_base,
-	  effective_base_ds_tag>::value&& 
-	  base_data_ds_traits::order_preserving
-	};
-
-      enum
-	{
-	  erase_iterators =
-	  base_data_ds_traits::erase_iterators
-	};
-
-      typedef
-      typename ig_sel<
-	typename invalidation_guarantee_imp<
-	my_base,
-	effective_base_ds_tag>::type,
-	typename ds_traits<
-	my_base_data_type>::invalidation_guarantee>::type
-      invalidation_guarantee;
-
-      enum
-	{
-	  reverse_iteration =
-	  reverse_iteration_imp<
-	  my_base,
-	  effective_base_ds_tag>::value&& 
-	  base_data_ds_traits::reverse_iteration
-	};
-
-      enum
-	{
-	  split_join = false
-	};
-
-    protected:
-      typedef typename my_base_data_type::data_pointer erase_imp_ret_t;
-
-    private:
-      inline const_key_reference
-      extract_key_imp(const_reference r_val, int_to_type<true>)
-      {
-	return (r_val.first);
-      }
-
-      inline const_key_reference
-      extract_key_imp(const_reference r_val, int_to_type<false>)
-      {
-	return (r_val);
-      }
-
-      inline it_key_type
-      extract_key_imp(typename iterator::const_reference r_val, int_to_type<true>)
-      {
-	return (r_val.first);
-      }
-
-      inline it_key_type
-      extract_key_imp(typename iterator::const_reference r_val, int_to_type<false>)
-      {
-	return (r_val);
-      }
-
-    public:
-
-      inline size_type
-      size() const
-      {
-	return (std::distance(begin(), end()));
-      }
-
-      inline size_type
-      max_size() const
-      {
-	return (my_base::max_size());
-      }
-
-      inline bool
-      empty() const
-      {
-	return (size() == 0);
-      }
-
-      inline static const_key_reference
-      extract_key(const_reference r_val)
-      {
-	return (extract_key_imp(
-				r_val,
-				int_to_type<has_data>()));
-      }
-
-      inline it_key_type
-      extract_key(typename iterator::const_reference r_val)
-      {
-	return (extract_key_imp(
-				r_val,
-				int_to_type<has_data>()));
-      }
-
-      inline std::pair<
-	find_iterator,
-	bool>
-      insert(const_reference r_val)
-      {
-	typedef std::pair< typename my_base::find_iterator, bool> base_ins_ret;
-
-	// Tmp Ami
-      }
-
-      inline data_reference
-      operator[](const_key_reference r_key)
-      {
-	return (subscript_imp(r_key));
-      }
-
-      inline const_find_iterator
-      find(const_key_reference r_key) const
-      {
-	typename my_base::const_find_iterator it = my_base::find(r_key.first);
-
-	if (it == my_base::end())
-	  return (end());
-
-	typename my_base_data_type::const_find_iterator sec_it =
-	  it->second.find(r_key.second);
-
-	if (sec_it == it->second.end())
-	  return (end());
-
-	return (const_find_iterator(it, sec_it));
-      }
-
-      inline find_iterator
-      find(const_key_reference r_key)
-      {
-	typename my_base::find_iterator it = my_base::find(r_key.first);
-
-	if (it == my_base::end())
-	  return (end());
-
-	typename my_base_data_type::find_iterator sec_it =
-	  it->second.find(r_key.second);
-
-	if (sec_it == it->second.end())
-	  return (end());
-
-	return (find_iterator(it, my_base::end(), sec_it));
-      }
-
-      inline const_data_reference
-      operator[](const_key_reference r_key) const
-      {
-	return (my_base::operator[](r_key.first).operator[](r_key.second));
-      }
-
-      inline size_type
-      erase(const_key_reference r_key)
-      {
-	typename my_base::find_iterator it =
-	  my_base::find(r_key.first);
-
-	if (it == my_base::end())
-	  return (0);
-
-	if (it->second.find(r_key.second) == it->second.end())
-	  return (0);
-
-	it->second.erase(r_key.second);
-
-	return (1);
-      }
-
-#include <ext/pb_assoc/detail/value_type_adapter/erase_if_pred.hpp>
-
-      template<class Pred>
-      inline size_type
-      erase_if(Pred prd)
-      {
-	typename my_base::iterator it = my_base::begin();
-
-	typename my_base::iterator end_it = my_base::end();
-
-	size_type ersd = 0;
-
-	// Tmp Ami check erase can throw
-
-	while (it != end_it)
-	  {
-	    if (it->second.empty() == false)
-	      {
-		erase_if_pred<Pred> p(prd, it);
-
-		ersd += it->second.erase_if(p);
-	      }
-
-	    ++it;
-	  }
-
-	return (ersd);
-      }
-
-      void
-      clear()
-      {
-	typename my_base::iterator it = my_base::begin();
-
-	typename my_base::iterator end_it = my_base::end();
-
-	while (it != end_it)
-	  it->second.clear();
-      }
-
-      inline const_iterator
-      begin() const
-      {
-	typename my_base::const_iterator it = my_base::begin();
-
-	while (it != my_base::end()&&  it->second.size() == 0)
-	  ++it;
-
-	if (it == my_base::end())
-	  return (end());
-
-	return (const_iterator(it, my_base::end(), it->second.begin()));
-      }
-
-      inline iterator
-      begin()
-      {
-	typename my_base::iterator it = my_base::begin();
-
-	while (it != my_base::end()&&  it->second.size() == 0)
-	  ++it;
-
-	if (it == my_base::end())
-	  return (end());
-
-	return (iterator(it, my_base::end(), it->second.begin()));
-      }
-
-      inline const_iterator
-      end() const
-      {
-	return (const_iterator(my_base::end(), my_base::end()));
-      }
-
-      inline iterator
-      end()
-      {
-	return (iterator(my_base::end(), my_base::end()));
-      }
-
-    protected:
-
-      virtual
-      ~value_type_adapter()
-      { }
-
-#define PB_ASSOC_CLASS_NAME value_type_adapter
-
-#define PB_ASSOC_DIRECT_BASE_C_DEC PB_ASSOC_BASE_C_DEC
-
-#define PB_ASSOC_DIRECT_BASE_CAST_C_DEC \
-	typename PB_ASSOC_DIRECT_BASE_C_DEC
-
-#include <ext/pb_assoc/detail/constructors_destructor_fn_imps.hpp>
-
-#undef PB_ASSOC_CLASS_NAME
-
-#undef PB_ASSOC_DIRECT_BASE_C_DEC
-
-#undef PB_ASSOC_DIRECT_BASE_CAST_C_DEC
-
-      data_reference
-      subscript_imp(const_key_reference r_key)
-      {
-	return (my_base::subscript_imp(r_key.first)[r_key.second]);
-      }
-
-    private:
-      value_type_adapter& 
-      operator=(const value_type_adapter& r_other);
-    };
-
-#undef PB_ASSOC_CLASS_T_DEC
-
-#undef PB_ASSOC_CLASS_C_DEC
-
-#undef PB_ASSOC_BASE_C_DEC
-
-  } // namespace detail
-
-} // namespace pb_assoc
-
-#endif // #ifndef VALUE_TYPE_ADAPTER_HPP
-
diff --git a/libstdc++-v3/include/ext/pb_assoc/detail/value_type_adapter/value_type_traits.hpp b/libstdc++-v3/include/ext/pb_assoc/detail/value_type_adapter/value_type_traits.hpp
deleted file mode 100644
index 8fbd3e74aa5..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/detail/value_type_adapter/value_type_traits.hpp
+++ /dev/null
@@ -1,102 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file value_type_traits.hpp
- * Contains an adapter of mapping levels.
- */
-
-template<typename Base_Key_,
-	 typename Key_,
-	 typename Data_,
-	 class Allocator_ >
-struct value_type_traits_
-{
-  typedef std::pair< std::pair< Base_Key_, Key_>, Data_> value_type;
-
-  typedef
-  typename Allocator_::template rebind<
-    value_type>::other::reference
-  reference;
-
-  typedef
-  typename Allocator_::template rebind<
-    value_type>::other::const_reference
-  const_reference;
-
-  typedef
-  typename Allocator_::template rebind<
-    value_type>::other::pointer
-  pointer;
-
-  typedef
-  typename Allocator_::template rebind<
-    value_type>::other::const_pointer
-  const_pointer;
-};
-
-template<typename Base_Key_, typename Key_, class Allocator_>
-struct value_type_traits_<
-  Base_Key_,
-  Key_,
-  null_data_type,
-  Allocator_>
-{
-  typedef std::pair< Base_Key_, Key_> value_type;
-
-  typedef
-  typename Allocator_::template rebind<
-    value_type>::other::const_reference
-  reference;
-
-  typedef
-  typename Allocator_::template rebind<
-    value_type>::other::const_reference
-  const_reference;
-
-  typedef
-  typename Allocator_::template rebind<
-    value_type>::other::const_pointer
-  pointer;
-
-  typedef
-  typename Allocator_::template rebind<
-    value_type>::other::const_pointer
-  const_pointer;
-};
diff --git a/libstdc++-v3/include/ext/pb_assoc/ds_trait.hpp b/libstdc++-v3/include/ext/pb_assoc/ds_trait.hpp
deleted file mode 100644
index bf391afca86..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/ds_trait.hpp
+++ /dev/null
@@ -1,125 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file ds_trait.hpp
- * Contains data-structure traits.
- */
-
-#ifndef DS_TRAIT_HPP
-#define DS_TRAIT_HPP
-
-#include <ext/pb_assoc/detail/type_utils.hpp>
-
-namespace pb_assoc
-{
-  struct basic_invalidation_guarantee
-  { };
-
-  struct find_invalidation_guarantee : public basic_invalidation_guarantee
-  { };
-
-  struct range_invalidation_guarantee : public find_invalidation_guarantee
-  { };
-
-  struct basic_ds_tag
-  { };
-
-  struct basic_hash_ds_tag : public basic_ds_tag
-  { };
-
-  struct cc_hash_ds_tag : public basic_hash_ds_tag
-  { };
-
-  struct gp_hash_ds_tag : public basic_hash_ds_tag
-  { };
-
-  struct basic_tree_ds_tag : public basic_ds_tag
-  { };
-
-  struct rb_tree_ds_tag : public basic_tree_ds_tag
-  { };
-
-  struct splay_tree_ds_tag : public basic_tree_ds_tag
-  { };
-
-  struct ov_tree_ds_tag : public basic_tree_ds_tag
-  { };
-
-  struct lu_ds_tag : public basic_ds_tag
-  { };
-
-  struct compound_ds_tag : public basic_ds_tag
-  { };
-
-#include <ext/pb_assoc/detail/ds_trait_imp.hpp>
-
-#define PB_ASSOC_BASE_C_DEC \
-	detail::data_structure_traits<Cntnr, typename Cntnr::ds_category>
-
-  template<typename Cntnr>
-    struct ds_traits 
-    : private detail::data_structure_traits<Cntnr, typename Cntnr::ds_category>
-    {
-    public:
-      enum
-	{
-	  erase_can_throw = PB_ASSOC_BASE_C_DEC::erase_can_throw,
-	  order_preserving = PB_ASSOC_BASE_C_DEC::order_preserving,
-	  erase_iterators = PB_ASSOC_BASE_C_DEC::erase_iterators,
-	  reverse_iteration = PB_ASSOC_BASE_C_DEC::reverse_iteration,
-	  split_join = PB_ASSOC_BASE_C_DEC::split_join
-	};
-      
-      typedef typename PB_ASSOC_BASE_C_DEC::invalidation_guarantee 
-      invalidation_guarantee;
-
-    /*
-      enum
-      {
-      split_join_can_throw = PB_ASSOC_BASE_C_DEC::split_join_can_throw
-      };
-    */
-  };
-
-#undef PB_ASSOC_BASE_C_DEC
-
-} // namespace pb_assoc
-
-#endif // #ifndef DS_TRAIT_HPP
diff --git a/libstdc++-v3/include/ext/pb_assoc/exception.hpp b/libstdc++-v3/include/ext/pb_assoc/exception.hpp
deleted file mode 100644
index 7e38c28b680..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/exception.hpp
+++ /dev/null
@@ -1,69 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file pb_assoc_ex.hpp
- * Contains exception classes for pb_assoc.
- */
-
-#ifndef EXCEPTION_HPP
-#define EXCEPTION_HPP
-
-#include <stdexcept>
-
-namespace pb_assoc
-{
-  struct pb_assoc_ex : public std::logic_error
-  {
-    pb_assoc_ex() : std::logic_error("pb_assoc exception") { }
-  };
-
-  struct cannot_insert : public pb_assoc_ex
-  { };
-
-   // An join cannot be performed for logical reasons (i.e., the ranges of
-   // the two container objects being joined overlaps.)
-  struct cannot_join : public cannot_insert
-  { };
-
-  struct cannot_resize : public cannot_insert
-  { };
-} // namespace pb_assoc
-
-#endif // #ifndef EXCEPTION_HPP
diff --git a/libstdc++-v3/include/ext/pb_assoc/hash_policy.hpp b/libstdc++-v3/include/ext/pb_assoc/hash_policy.hpp
deleted file mode 100644
index d4118c0664d..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/hash_policy.hpp
+++ /dev/null
@@ -1,717 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/*
- * @file hash_policy.hpp
- * Contains hash-related policies.
- */
-
-#ifndef HASH_POLICY_HPP
-#define HASH_POLICY_HPP
-
-#include <algorithm>
-#include <vector>
-#include <cmath>
-#include <ext/pb_assoc/exception.hpp>
-#include <ext/pb_assoc/detail/hash_fn/mask_based_range_hashing.hpp>
-#include <ext/pb_assoc/detail/hash_fn/mod_based_range_hashing.hpp>
-#include <ext/pb_assoc/detail/resize_policy/size_base.hpp>
-
-namespace pb_assoc
-{
-  struct null_hash_fn
-  { };
-
-  struct null_probe_fn
-  { };
-
-#define PB_ASSOC_CLASS_T_DEC \
-	template<typename Const_Key_Ref, typename Size_Type>
-
-#define PB_ASSOC_CLASS_C_DEC \
-	linear_probe_fn< \
-		Const_Key_Ref, \
-		Size_Type>
-
-  template<typename Const_Key_Ref, typename Size_Type = size_t>
-    class linear_probe_fn
-    {
-    public:
-      typedef Size_Type size_type;
-      
-      void
-      swap(PB_ASSOC_CLASS_C_DEC& r_other);
-      
-    protected:
-      inline size_type
-      operator()(Const_Key_Ref r_key, size_type i) const;
-    };
-
-#include <ext/pb_assoc/detail/hash_fn/linear_probe_fn_imp.hpp>
-
-#undef PB_ASSOC_CLASS_T_DEC
-#undef PB_ASSOC_CLASS_C_DEC
-
-#define PB_ASSOC_CLASS_T_DEC \
-	template<class Const_Key_Ref, typename Size_Type>
-
-#define PB_ASSOC_CLASS_C_DEC \
-	quadratic_probe_fn<Const_Key_Ref, Size_Type>
-
-  template<typename Const_Key_Ref, typename Size_Type = size_t>
-    class quadratic_probe_fn
-    {
-    public:
-      typedef Size_Type size_type;
-      
-      void
-      swap(PB_ASSOC_CLASS_C_DEC& r_other);
-      
-    protected:
-      inline size_type
-      operator()(Const_Key_Ref r_key, size_type i) const;
-    };
-
-#include <ext/pb_assoc/detail/hash_fn/quadratic_probe_fn_imp.hpp>
-
-#undef PB_ASSOC_CLASS_T_DEC
-#undef PB_ASSOC_CLASS_C_DEC
-
-#define PB_ASSOC_CLASS_T_DEC \
-	template<typename Size_Type>
-
-#define PB_ASSOC_CLASS_C_DEC \
-	direct_mask_range_hashing<Size_Type>
-
-  template<typename Size_Type =	size_t>
-    class direct_mask_range_hashing 
-    : public pb_assoc::detail::mask_based_range_hashing<Size_Type>
-    {
-    public:
-      typedef Size_Type size_type;
-      
-      void
-      swap(PB_ASSOC_CLASS_C_DEC& r_other);
-      
-    protected:
-      void
-      notify_resized(size_type size);
-      
-      inline size_type
-      operator()(size_type hash) const;
-      
-    private:
-      typedef pb_assoc::detail::mask_based_range_hashing<Size_Type>
-      my_mask_based_base;
-    };
-
-#define PB_ASSOC_MASK_BASED_C_DEC \
-	pb_assoc::detail::mask_based_range_hashing< \
-		Size_Type>
-
-#include <ext/pb_assoc/detail/hash_fn/direct_mask_range_hashing_imp.hpp>
-
-#undef PB_ASSOC_CLASS_T_DEC
-#undef PB_ASSOC_CLASS_C_DEC
-
-#undef PB_ASSOC_MASK_BASED_C_DEC
-
-#define PB_ASSOC_CLASS_T_DEC \
-	template<typename Size_Type>
-
-#define PB_ASSOC_CLASS_C_DEC \
-	direct_mod_range_hashing<Size_Type>
-
-#define PB_ASSOC_MOD_BASED_C_DEC \
-	pb_assoc::detail::mod_based_range_hashing<Size_Type>
-
-  template<typename Size_Type =	size_t>
-    class direct_mod_range_hashing : public PB_ASSOC_MOD_BASED_C_DEC
-    {
-    public:
-      typedef Size_Type size_type;
-      
-      void
-      swap(PB_ASSOC_CLASS_C_DEC& r_other);
-      
-    protected:
-      /*
-       *   description = "Notifies the policy object that the container's
-       *	  __size has changed to size.">
-       **/
-      void
-      notify_resized(size_type size);
-      
-      inline size_type
-    operator()(size_type hash) const;
-      
-    private:
-      typedef PB_ASSOC_MOD_BASED_C_DEC my_mod_based_base;
-    };
-
-#include <ext/pb_assoc/detail/hash_fn/direct_mod_range_hashing_imp.hpp>
-
-#undef PB_ASSOC_CLASS_T_DEC
-#undef PB_ASSOC_CLASS_C_DEC
-
-#undef PB_ASSOC_MOD_BASED_C_DEC
-
-#ifdef PB_ASSOC_HT_LOAD_CHECK_RESIZE_TRIGGER_DEBUG
-#define PB_ASSOC_DBG_ASSERT(X) assert(X)
-#define PB_ASSOC_DBG_VERIFY(X) assert(X)
-#define PB_ASSOC_DBG_ONLY(X) X
-#else // #ifdef PB_ASSOC_HT_LOAD_CHECK_RESIZE_TRIGGER_DEBUG
-#define PB_ASSOC_DBG_ASSERT(X)
-#define PB_ASSOC_DBG_VERIFY(X) {if((X)==0);}
-#define PB_ASSOC_DBG_ONLY(X) ;
-#endif // #ifdef PB_ASSOC_HT_LOAD_CHECK_RESIZE_TRIGGER_DEBUG
-
-#define PB_ASSOC_CLASS_T_DEC \
-	template<bool External_Load_Access, typename Size_Type>
-
-#define PB_ASSOC_CLASS_C_DEC \
-	hash_load_check_resize_trigger<External_Load_Access, Size_Type>
-
-#define PB_ASSOC_SIZE_BASE_C_DEC \
-	pb_assoc::detail::size_base<Size_Type, External_Load_Access>
-
-  template<bool External_Load_Access = false, typename Size_Type = size_t>
-    class hash_load_check_resize_trigger : private PB_ASSOC_SIZE_BASE_C_DEC
-    {
-    public:
-      typedef Size_Type size_type;
-      
-      enum
-	{
-	  external_load_access = External_Load_Access
-	};
-            
-      hash_load_check_resize_trigger(float load_min = 0.125, 
-				     float load_max = 0.5);
-
-      void
-      swap(PB_ASSOC_CLASS_C_DEC& r_other);
-      
-      virtual
-      ~hash_load_check_resize_trigger();
-      
-      inline std::pair<float, float>
-      get_loads() const;
-      
-      void
-      set_loads(std::pair<float, float> load_pair);
-
-    protected:
-      inline void
-      notify_insert_search_start();
-      
-      inline void
-      notify_insert_search_collision();
-
-      inline void
-      notify_insert_search_end();
-      
-      inline void
-      notify_find_search_start();
-      
-      inline void
-      notify_find_search_collision();
-      
-      inline void
-      notify_find_search_end();
-      
-      inline void
-      notify_erase_search_start();
-      
-      inline void
-      notify_erase_search_collision();
-      
-      inline void
-      notify_erase_search_end();
-      
-      inline void
-      notify_inserted(size_type num_entries);
-      
-      inline void
-      notify_erased(size_type num_entries);
-      
-      void
-      notify_cleared();
-      
-      void
-      notify_resized(size_type new_size);
-      
-      void
-      notify_externally_resized(size_type new_size);
-      
-      inline bool
-      is_resize_needed() const;
-      
-      inline bool
-      is_grow_needed(size_type size, size_type num_entries) const;
-      
-      inline bool
-      is_shrink_needed(size_type size, size_type num_entries) const;
-      
-      typedef PB_ASSOC_SIZE_BASE_C_DEC my_size_base;
-      
-    private:
-      inline std::pair<float, float>
-      get_loads_imp(pb_assoc::detail::int_to_type<true>) const;
-      
-      void
-      set_loads_imp(std::pair<float, float>, 
-		    pb_assoc::detail::int_to_type<true>);
-
-      virtual void
-      do_resize(size_type new_size);
-      
-#ifdef PB_ASSOC_HT_LOAD_CHECK_RESIZE_TRIGGER_DEBUG
-      void
-      assert_valid() const;
-#endif // #ifdef PB_ASSOC_HT_LOAD_CHECK_RESIZE_TRIGGER_DEBUG
-
-      float m_load_min, m_load_max;
-      
-      size_type m_next_shrink_size;
-      
-      size_type m_next_grow_size;
-      
-      bool m_resize_needed;
-      
-      static pb_assoc::detail::int_to_type<External_Load_Access>
-      s_external_load_access_ind;
-    };
-
-#include <ext/pb_assoc/detail/resize_policy/hash_load_check_resize_trigger_imp.hpp>
-
-#undef PB_ASSOC_CLASS_T_DEC
-#undef PB_ASSOC_CLASS_C_DEC
-
-#undef PB_ASSOC_SIZE_BASE_C_DEC
-
-#undef PB_ASSOC_DBG_ASSERT
-#undef PB_ASSOC_DBG_VERIFY
-#undef PB_ASSOC_DBG_ONLY
-
-#ifdef PB_ASSOC_HT_MAX_COLLISION_CHECK_RESIZE_TRIGGER_POLICY_DEBUG
-#define PB_ASSOC_DBG_ASSERT(X) assert(X)
-#define PB_ASSOC_DBG_VERIFY(X) assert(X)
-#define PB_ASSOC_DBG_ONLY(X) X
-#else // #ifdef PB_ASSOC_HT_MAX_COLLISION_CHECK_RESIZE_TRIGGER_POLICY_DEBUG
-#define PB_ASSOC_DBG_ASSERT(X)
-#define PB_ASSOC_DBG_VERIFY(X) {if((X)==0);}
-#define PB_ASSOC_DBG_ONLY(X) ;
-#endif // #ifdef PB_ASSOC_HT_MAX_COLLISION_CHECK_RESIZE_TRIGGER_POLICY_DEBUG
-
-#define PB_ASSOC_CLASS_T_DEC \
-	template<bool External_Load_Access, typename Size_Type>
-
-#define PB_ASSOC_CLASS_C_DEC \
-	cc_hash_max_collision_check_resize_trigger< \
-		External_Load_Access, \
-		Size_Type>
-
-  template<bool External_Load_Access = false, typename Size_Type = size_t>
-    class cc_hash_max_collision_check_resize_trigger
-    {
-    public:
-      typedef Size_Type size_type;
-      
-      enum
-	{
-	  external_load_access = External_Load_Access
-	};
-      
-      cc_hash_max_collision_check_resize_trigger(float load = 0.5);
-      
-      void
-      swap(PB_ASSOC_CLASS_C_DEC& r_other);
-      
-      inline float
-      get_load() const;
-      
-    protected:
-      inline void
-      notify_insert_search_start();
-
-      inline void
-      notify_insert_search_collision();
-
-      inline void
-      notify_insert_search_end();
-
-      inline void
-      notify_find_search_start();
-
-      inline void
-      notify_find_search_collision();
-
-      inline void
-      notify_find_search_end();
-
-      inline void
-      notify_erase_search_start();
-
-      inline void
-      notify_erase_search_collision();
-
-      inline void
-      notify_erase_search_end();
-
-      inline void
-      notify_inserted(size_type num_entries);
-
-      inline void
-      notify_erased(size_type num_entries);
-
-      void
-      notify_cleared();
-
-      void
-      notify_resized(size_type new_size);
-
-      void
-      notify_externally_resized(size_type new_size);
-
-      inline bool
-      is_resize_needed() const;
-
-      inline bool
-      is_grow_needed(size_type size, size_type num_entries) const;
-
-      inline bool
-      is_shrink_needed(size_type size, size_type num_entries) const;
-
-    private:
-      template<typename Key>
-      class max_col_checker
-      {
-      public:
-	max_col_checker(size_type size, size_type* p_max_col) 
-	: m_p_max_col(p_max_col), m_a_col(size, 0)
-	{ }
-
-	void
-	operator()(const std::pair<const Key, size_type>& r_key_pos_pair)
-	{ ++m_a_col[r_key_pos_pair.second]; }
-
-      private:
-	std::vector<size_type> m_a_col;
-	
-	size_type* const m_p_max_col;
-      };
-      
-    private:
-      inline float
-      get_load_imp(pb_assoc::detail::int_to_type<true>) const;
-      
-      float m_load;
-      
-      size_type m_size;
-      
-      size_type m_num_col;
-      
-      size_type m_max_col;
-      
-      bool m_resize_needed;
-      
-      static pb_assoc::detail::int_to_type<External_Load_Access>
-      s_external_load_access_ind;
-    };
-
-#include <ext/pb_assoc/detail/resize_policy/cc_hash_max_collision_resize_trigger_imp.hpp>
-
-#undef PB_ASSOC_CLASS_T_DEC
-#undef PB_ASSOC_CLASS_C_DEC
-
-#undef PB_ASSOC_DBG_ASSERT
-#undef PB_ASSOC_DBG_VERIFY
-#undef PB_ASSOC_DBG_ONLY
-
-#define PB_ASSOC_CLASS_T_DEC \
-	template<typename Size_Type>
-
-#define PB_ASSOC_CLASS_C_DEC \
-	hash_exponential_size_policy< \
-		Size_Type>
-
-  template<typename Size_Type =	size_t>
-  class hash_exponential_size_policy
-  {
-  public:
-    typedef Size_Type size_type;
-
-    hash_exponential_size_policy(size_type start_size = 8, 
-				 size_type grow_factor = 2);
-
-    void
-    swap(PB_ASSOC_CLASS_C_DEC& r_other);
-
-  protected:
-    size_type
-    get_init_size(size_type suggested_size) const;
-
-    size_type
-    get_nearest_larger_size(size_type cur_size) const;
-
-    size_type
-    get_nearest_smaller_size(size_type cur_size) const;
-
-#ifdef PB_ASSOC_HT_EXPONENTIAL_SIZE_POLICY_DEBUG
-    void
-    assert_is_one_of_my_sizes(size_type size) const;
-#endif // #ifdef PB_ASSOC_HT_EXPONENTIAL_SIZE_POLICY_DEBUG
-
-  private:
-    size_type m_start_size;
-    size_type m_grow_factor;
-  };
-
-#include <ext/pb_assoc/detail/resize_policy/hash_exponential_size_policy_imp.hpp>
-
-#undef PB_ASSOC_CLASS_T_DEC
-#undef PB_ASSOC_CLASS_C_DEC
-
-#undef PB_ASSOC_DBG_ASSERT
-#undef PB_ASSOC_DBG_VERIFY
-#undef PB_ASSOC_DBG_ONLY
-
-#define PB_ASSOC_CLASS_T_DEC
-
-#define PB_ASSOC_CLASS_C_DEC \
-	hash_prime_size_policy
-
-#ifdef PB_ASSOC_HT_PRIME_SIZE_POLICY_DEBUG
-#define PB_ASSOC_DBG_ASSERT(X) assert(X)
-#define PB_ASSOC_DBG_VERIFY(X) assert(X)
-#define PB_ASSOC_DBG_ONLY(X) X
-#else // #ifdef PB_ASSOC_HT_PRIME_SIZE_POLICY_DEBUG
-#define PB_ASSOC_DBG_ASSERT(X)
-#define PB_ASSOC_DBG_VERIFY(X) {if((X)==0);}
-#define PB_ASSOC_DBG_ONLY(X) ;
-#endif // #ifdef PB_ASSOC_HT_PRIME_SIZE_POLICY_DEBUG
-
-  struct hash_prime_size_policy
-  {
-    typedef size_t size_type;
-
-    inline void
-    swap(PB_ASSOC_CLASS_C_DEC& r_other);
-
-  protected:
-    inline size_type
-    get_init_size(size_type suggested_size) const;
-    
-    inline size_type
-    get_nearest_larger_size(size_type cur_size) const;
-    
-    inline size_type
-    get_nearest_smaller_size(size_type cur_size) const;
-    
-    inline size_type
-    get_nearest_larger_size_imp(size_type size) const;
-    
-#ifdef PB_ASSOC_HT_PRIME_SIZE_POLICY_DEBUG
-    void
-    assert_is_one_of_my_sizes(size_type size) const;
-#endif // #ifdef PB_ASSOC_HT_PRIME_SIZE_POLICY_DEBUG
-  };
-
-#include <ext/pb_assoc/detail/resize_policy/hash_prime_size_policy_imp.hpp>
-
-#undef PB_ASSOC_CLASS_T_DEC
-#undef PB_ASSOC_CLASS_C_DEC
-
-#undef PB_ASSOC_DBG_ASSERT
-#undef PB_ASSOC_DBG_VERIFY
-#undef PB_ASSOC_DBG_ONLY
-
-#define PB_ASSOC_CLASS_T_DEC \
-	template< \
-		class Size_Policy, \
-		class Trigger_Policy, \
-		bool External_Size_Access, \
-		typename Size_Type>
-
-#define PB_ASSOC_CLASS_C_DEC \
-	hash_standard_resize_policy< \
-		Size_Policy, \
-		Trigger_Policy, \
-		External_Size_Access, \
-		Size_Type>
-
-  template<class Size_Policy =	pb_assoc::hash_exponential_size_policy<>,
-	   class Trigger_Policy = pb_assoc::hash_load_check_resize_trigger<>,
-	   bool External_Size_Access = false,
-	   typename Size_Type = size_t>
-  class hash_standard_resize_policy : public Size_Policy, public Trigger_Policy
-  {
-  public:
-    typedef Size_Type 		size_type;
-    typedef Trigger_Policy 	trigger_policy;
-    typedef Size_Policy 	size_policy;
-
-    enum
-      {
-	external_size_access = External_Size_Access
-      };
-
-    hash_standard_resize_policy(size_type suggested_size = 8);
-    
-    hash_standard_resize_policy(const Size_Policy&, 
-				size_type suggested_size = 8);
-
-    hash_standard_resize_policy(const Size_Policy&, const Trigger_Policy&, 
-				size_type suggested_size = 8);
-
-    virtual
-    ~hash_standard_resize_policy();
-
-    inline void
-    swap(PB_ASSOC_CLASS_C_DEC& r_other);
-
-    Size_Policy& 
-    get_size_policy();
-
-    const Size_Policy& 
-    get_size_policy() const;
-
-    Trigger_Policy& 
-    get_trigger_policy();
-
-    const Trigger_Policy& 
-    get_trigger_policy() const;
-
-    inline size_type
-    get_actual_size() const;
-
-    void
-    resize(size_type suggested_new_size);
-
-  protected:
-
-    inline void
-    notify_insert_search_start();
-
-    inline void
-    notify_insert_search_collision();
-
-    inline void
-    notify_insert_search_end();
-
-    inline void
-    notify_find_search_start();
-
-    inline void
-    notify_find_search_collision();
-
-    inline void
-    notify_find_search_end();
-
-    inline void
-    notify_erase_search_start();
-
-    inline void
-    notify_erase_search_collision();
-
-    inline void
-    notify_erase_search_end();
-
-    inline void
-    notify_inserted(size_type num_e);
-
-    inline void
-    notify_erased(size_type num_e);
-
-    void
-    notify_cleared();
-
-    void
-    notify_resized(size_type new_size);
-
-    size_type
-    get_init_size() const;
-
-    inline bool
-    is_resize_needed() const;
-
-    size_type
-    get_new_size(size_type size, size_type num_used_e) const;
-
-  private:
-    typedef Trigger_Policy my_trigger_policy_base;
-
-    typedef Size_Policy my_size_policy_base;
-
-    typedef
-    pb_assoc::detail::int_to_type<false>
-    external_resize_false_indicator;
-
-    typedef
-    pb_assoc::detail::int_to_type<true>
-    external_resize_true_indicator;
-
-    inline size_type
-    get_actual_size(external_resize_true_indicator) const;
-
-    void
-    resize(size_type new_size, external_resize_true_indicator);
-
-    virtual void
-    do_resize(size_type new_size);
-
-    static pb_assoc::detail::int_to_type<External_Size_Access>
-    s_external_size_access_indicator;
-
-    size_type m_size;
-  };
-
-#include <ext/pb_assoc/detail/resize_policy/hash_standard_resize_policy_imp.hpp>
-
-#undef PB_ASSOC_CLASS_T_DEC
-#undef PB_ASSOC_CLASS_C_DEC
-
-#undef PB_ASSOC_DBG_ASSERT
-#undef PB_ASSOC_DBG_VERIFY
-#undef PB_ASSOC_DBG_ONLY
-
-} // namespace pb_assoc
-
-#endif // #ifndef HASH_POLICY_HPP
diff --git a/libstdc++-v3/include/ext/pb_assoc/lu_policy.hpp b/libstdc++-v3/include/ext/pb_assoc/lu_policy.hpp
deleted file mode 100644
index dcdb0e5ac05..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/lu_policy.hpp
+++ /dev/null
@@ -1,181 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file lu_policy.hpp
- * Contains policies for list update containers.
- */
-
-#ifndef LU_POLICY_HPP
-#define LU_POLICY_HPP
-
-namespace pb_assoc
-{
-  struct move_to_front_lu_metadata
-  { };
-
-#define PB_ASSOC_CLASS_T_DEC \
-	template<typename Metadata_Reference>
-
-#define PB_ASSOC_CLASS_C_DEC \
-	move_to_front_lu_policy<Metadata_Reference>
-
-  template<typename Metadata_Reference = 
-           std::allocator<move_to_front_lu_metadata>::reference>
-    class move_to_front_lu_policy
-    {
-    public:
-      void
-      swap(PB_ASSOC_CLASS_C_DEC& r_other);
-      
-    protected:
-      typedef move_to_front_lu_metadata metadata_type;
-      
-      typedef Metadata_Reference metadata_reference;
-      
-      metadata_type
-      operator()() const;
-      
-      inline bool
-      operator()(metadata_reference r_data) const;
-    };
-
-#include <ext/pb_assoc/detail/lu_policy/mtf_lu_policy_imp.hpp>
-
-#undef PB_ASSOC_CLASS_T_DEC
-
-#undef PB_ASSOC_CLASS_C_DEC
-
-  template<typename Size_Type>
-    class counter_lu_policy_base;
-
-  template<typename Size_Type =	size_t>
-    class counter_lu_metadata
-    {
-    public:
-      typedef Size_Type size_type;
-
-  private:
-      counter_lu_metadata(size_type init_count) : m_count(init_count)
-      { }
-      
-      mutable size_type m_count;
-      
-      friend class counter_lu_policy_base<Size_Type>;
-    };
-
-  template<typename Size_Type>
-    class counter_lu_policy_base;
-
-#define PB_ASSOC_CLASS_T_DEC \
-	template<typename Size_Type>
-
-#define PB_ASSOC_CLASS_C_DEC \
-	counter_lu_policy_base<Size_Type>
-
-  template<typename Size_Type>
-    class counter_lu_policy_base
-    {
-    protected:
-      typedef Size_Type size_type;
-      
-    counter_lu_metadata<Size_Type>
-    operator()(size_type max_size) const;
-
-    template<typename Metadata_Reference>
-      bool
-      operator()(Metadata_Reference r_data, size_type m_max_count) const;
-    };
-
-#include <ext/pb_assoc/detail/lu_policy/counter_lu_metadata_imp.hpp>
-
-#undef PB_ASSOC_CLASS_T_DEC
-
-#undef PB_ASSOC_CLASS_C_DEC
-
-#define PB_ASSOC_CLASS_T_DEC \
-	template<typename Size_Type, typename Metadata_Reference>
-
-#define PB_ASSOC_CLASS_C_DEC \
-	counter_lu_policy<Size_Type, Metadata_Reference>
-
-  template<typename Size_Type = size_t,
-	   typename Metadata_Reference =
-	   typename std::allocator<counter_lu_metadata<Size_Type> >::reference>
-    class counter_lu_policy : private counter_lu_policy_base<Size_Type>
-    {
-    public:
-      typedef Size_Type size_type;
-      
-      counter_lu_policy(size_type max_count = 5);
-      
-      void
-      swap(PB_ASSOC_CLASS_C_DEC& r_other);
-      
-      inline
-      size_type
-      get_max_count() const;
-      
-    protected:
-      
-      typedef counter_lu_metadata< Size_Type> metadata_type;
-      
-      typedef Metadata_Reference metadata_reference;
-      
-      metadata_type
-      operator()() const;
-      
-      bool
-      operator()(metadata_reference r_data) const;
-      
-    private:
-      typedef counter_lu_policy_base< Size_Type> my_base;
-      
-      size_type m_max_count;
-    };
-
-#include <ext/pb_assoc/detail/lu_policy/counter_lu_policy_imp.hpp>
-
-#undef PB_ASSOC_CLASS_T_DEC
-
-#undef PB_ASSOC_CLASS_C_DEC
-
-} // namespace pb_assoc
-
-#endif // #ifndef LU_POLICY_HPP
diff --git a/libstdc++-v3/include/ext/pb_assoc/ms_trait.hpp b/libstdc++-v3/include/ext/pb_assoc/ms_trait.hpp
deleted file mode 100644
index 1aaddc7b903..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/ms_trait.hpp
+++ /dev/null
@@ -1,82 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file ms_trait.hpp
- * Contains mapping-semantic traits.
- */
-
-#ifndef MS_TRAIT_HPP
-#define MS_TRAIT_HPP
-
-#include <ext/pb_assoc/data_type.hpp>
-#include <ext/pb_assoc/detail/mapping_level_imp.hpp>
-
-namespace pb_assoc
-{
-  struct basic_ms_tag
-  { };
-
-  struct data_enabled_ms_tag : public basic_ms_tag
-  { };
-
-  struct compound_data_enabled_ms_tag : public data_enabled_ms_tag
-  { };
-
-#include <ext/pb_assoc/detail/ms_trait_imp.hpp>
-
-#define PB_ASSOC_BASE_C_DEC \
-	detail::mapping_semantics_traits<Cntnr, typename Cntnr::ms_category>
-
-  template<typename Cntnr>
-    struct ms_traits : private PB_ASSOC_BASE_C_DEC
-    {
-      enum
-	{
-	  has_data = PB_ASSOC_BASE_C_DEC::has_data,
-	  has_compound_data = PB_ASSOC_BASE_C_DEC::has_compound_data,
-	  mapping_level = PB_ASSOC_BASE_C_DEC::mapping_level
-      };
-  };
-
-#undef PB_ASSOC_BASE_C_DEC
-
-} // namespace pb_assoc
-
-#endif // #ifndef MS_TRAIT_HPP
diff --git a/libstdc++-v3/include/ext/pb_assoc/tree_policy.hpp b/libstdc++-v3/include/ext/pb_assoc/tree_policy.hpp
deleted file mode 100644
index f13b76e2d2f..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/tree_policy.hpp
+++ /dev/null
@@ -1,215 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/*
- * @file tree_policy.hpp
- * Contains tree-related policies.
- */
-
-#ifndef TREE_POLICY_HPP
-#define TREE_POLICY_HPP
-
-#include <functional>
-#include <ext/pb_assoc/ms_trait.hpp>
-
-namespace pb_assoc
-{
-  struct null_node_updator
-  {
-    inline void
-    swap(null_node_updator& r_other);
-  };
-
-#include <ext/pb_assoc/detail/tree_policy/null_node_updator_imp.hpp>
-
-  template<typename Key, typename Allocator = std::allocator<char> >
-    class order_statistics_key
-    {
-    public:
-      typedef Allocator 			allocator;
-      typedef Key 				key_type;
-      typedef typename allocator::template rebind<Key>::other::const_reference
-      						const_key_reference;
-      typedef typename allocator::template rebind<Key>::other::reference
-      						key_reference;
-      typedef typename allocator::size_type 	size_type;
-      
-      inline explicit
-      order_statistics_key(const_key_reference r_key = Key());
-      
-      inline
-      operator key_reference();
-      
-      inline
-      operator key_type() const;
-      
-    private:
-      // The logical key of the entry.
-      key_type m_key;
-      
-      // The number of entries in the subtree rooted at the node of
-      // this element.
-      mutable size_type m_rank;
-
-      template<typename Cntnr>
-        friend class order_by_key;
-      
-      template<typename Some_Cmp_Fn, typename Some_Allocator>
-        friend class order_statistics_key_cmp;
-      
-      template<typename Some_Key, typename Some_Allocator>
-        friend class order_statistics_node_updator;
-      
-      template<typename Cntnr>
-        friend class find_by_order;
-      
-      template<typename Cntnr, typename Some_Allocator>
-        friend class order_statistics_key_verifier;
-  };
-
-  template<typename Cmp_Fn, typename Allocator = std::allocator<char> >
-    class order_statistics_key_cmp 
-    : public std::binary_function<
-      order_statistics_key<typename Cmp_Fn::first_argument_type, Allocator>,
-      order_statistics_key<typename Cmp_Fn::second_argument_type, Allocator>, bool>, 
-    private Cmp_Fn
-    {
-    public:
-      typedef Allocator allocator;
-      typedef Cmp_Fn cmp_fn;
-      
-      typedef 
-      order_statistics_key<typename Cmp_Fn::first_argument_type, Allocator>
-      key_type;
-      
-      typedef
-      typename allocator::template rebind<key_type>::other::const_reference
-      const_key_reference;
-      
-      inline
-      order_statistics_key_cmp();
-      
-      inline
-      order_statistics_key_cmp(const Cmp_Fn& r_cmp_fn);
-      
-      inline bool
-      operator()(const_key_reference, const_key_reference) const;
-      
-      inline cmp_fn& 
-      get_cmp_fn();
-      
-      inline const cmp_fn& 
-      get_cmp_fn() const;
-    };
-  
-#define PB_ASSOC_CLASS_C_DEC \
-	order_statistics_node_updator<Key, Allocator>
-
-  template<typename Key, typename Allocator = std::allocator<char> >
-    class order_statistics_node_updator
-    {
-    public:
-      typedef Allocator allocator;
-      typedef order_statistics_key< Key, Allocator> key_type;
-
-      typedef
-      typename Allocator::template rebind<key_type>::other::const_pointer
-      const_key_pointer;
-      
-      inline void
-      swap(PB_ASSOC_CLASS_C_DEC& r_other);
-
-      inline void
-      operator()(const_key_pointer, const_key_pointer, const_key_pointer);
-
-    private:
-      typedef typename Allocator::size_type size_type;
-    };
-
-#undef PB_ASSOC_CLASS_C_DEC
-
-  template<class Cntnr>
-    class find_by_order
-    {
-    public:
-      typedef Cntnr 				cntnr;
-      typedef typename cntnr::iterator 		iterator;
-      typedef typename cntnr::const_iterator	const_iterator;
-      typedef typename cntnr::size_type 	size_type;
-      
-      inline iterator
-      operator()(Cntnr& r_c, size_type order) const;
-      
-      inline const_iterator
-      operator()(const Cntnr& r_c, size_type order) const;
-      
-    private:
-      typedef typename Cntnr::node_iterator 	node_iterator;
-      typedef typename Cntnr::const_iterator 	cntnr_const_it;
-      typedef typename Cntnr::iterator 		cntnr_it;
-      
-      inline static iterator
-      find(Cntnr& r_c, size_type order);
-      
-      inline static const_iterator
-      find(const Cntnr& r_c, size_type order);
-    };
-
-  template<class Cntnr>
-    class order_by_key
-    {
-    public:
-      typedef Cntnr 				cntnr;
-      typedef typename Cntnr::key_type 		order_statistics_key_type;
-      typedef typename order_statistics_key_type::key_type
-      						underlying_key_type;
-      typedef typename cntnr::size_type 	size_type;
-      
-      inline size_type
-      operator()(const Cntnr& r_c, const underlying_key_type& r_key) const;
-      
-    private:
-      typedef typename cntnr::const_iterator cntnr_const_it;
-      typedef typename cntnr::iterator cntnr_it;
-    };
-  
-#include <ext/pb_assoc/detail/tree_policy/order_statistics_imp.hpp>
-} // namespace pb_assoc
-
-#endif // #ifndef TREE_POLICY_HPP
diff --git a/libstdc++-v3/include/ext/pb_assoc/trivial_iterator_def.hpp b/libstdc++-v3/include/ext/pb_assoc/trivial_iterator_def.hpp
deleted file mode 100644
index e8a65b75f1c..00000000000
--- a/libstdc++-v3/include/ext/pb_assoc/trivial_iterator_def.hpp
+++ /dev/null
@@ -1,58 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file trivial_iterator_def.hpp
- * Contains definitions for "trivial"-type iterators.
- */
-
-#ifndef TRIVIAL_ITERATOR_DEF_HPP
-#define TRIVIAL_ITERATOR_DEF_HPP
-
-namespace pb_assoc
-{
-  struct trivial_iterator_tag
-  { };
-
-  // Prohibit moving trivial iterators.
-  typedef void trivial_iterator_difference_type;
-
-} // namespace pb_assoc
-
-#endif // #ifndef TRIVIAL_ITERATOR_DEF_HPP
diff --git a/libstdc++-v3/include/ext/pb_ds/assoc_container.hpp b/libstdc++-v3/include/ext/pb_ds/assoc_container.hpp
new file mode 100644
index 00000000000..bfc88b480d6
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/assoc_container.hpp
@@ -0,0 +1,690 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file assoc_container.hpp
+ * Contains associative containers.
+ */
+
+#ifndef PB_DS_ASSOC_CNTNR_HPP
+#define PB_DS_ASSOC_CNTNR_HPP
+
+#include <ext/pb_ds/detail/typelist.hpp>
+#include <ext/pb_ds/tag_and_trait.hpp>
+#include <ext/pb_ds/detail/standard_policies.hpp>
+#include <ext/pb_ds/detail/container_base_dispatch.hpp>
+#include <ext/pb_ds/detail/basic_tree_policy/traits.hpp>
+
+namespace pb_ds
+{
+#define PB_DS_BASE_C_DEC						\
+  detail::container_base_dispatch<Key, Mapped, Tag, Policy_Tl, Allocator>::type
+
+  // An abstract basic associative container.
+  template<typename Key, 
+	   typename Mapped, 
+	   typename Tag, 
+	   typename Policy_Tl, 
+	   typename Allocator>
+  class container_base : public PB_DS_BASE_C_DEC
+  {
+  private:
+    typedef typename PB_DS_BASE_C_DEC 			base_type;
+
+  public:
+    typedef Tag 					container_category;
+    typedef Allocator 					allocator;
+    typedef typename allocator::size_type 		size_type;
+    typedef typename allocator::difference_type 	difference_type;
+
+    // key_type
+    typedef typename allocator::template rebind<Key>::other::value_type key_type;
+    typedef typename allocator::template rebind<key_type>::other key_rebind;
+    typedef typename key_rebind::reference 		key_reference;
+    typedef typename key_rebind::const_reference 	const_key_reference;
+    typedef typename key_rebind::pointer 		key_pointer;
+    typedef typename key_rebind::const_pointer 		const_key_pointer;
+
+    // mapped_type
+    typedef Mapped 					mapped_type;
+    typedef typename allocator::template rebind<mapped_type>::other mapped_rebind;
+    typedef typename mapped_rebind::reference 		mapped_reference;
+    typedef typename mapped_rebind::const_reference	const_mapped_reference;
+    typedef typename mapped_rebind::pointer 		mapped_pointer;
+    typedef typename mapped_rebind::const_pointer 	const_mapped_pointer;
+
+    // value_type
+    typedef typename base_type::value_type 		value_type;
+    typedef typename allocator::template rebind<value_type>::other value_rebind;
+    typedef typename value_rebind::reference		reference;
+    typedef typename value_rebind::const_reference 	const_reference;
+    typedef typename value_rebind::pointer 		pointer;
+    typedef typename value_rebind::const_pointer 	const_pointer;
+
+    // iterators
+    typedef typename base_type::iterator 		iterator;
+    typedef typename base_type::const_iterator 		const_iterator;
+    typedef typename base_type::point_iterator 		point_iterator;
+    typedef typename base_type::const_point_iterator 	const_point_iterator;
+
+    virtual
+    ~container_base() { }
+
+  protected:
+#define PB_DS_CLASS_NAME 		container_base
+#include <ext/pb_ds/detail/constructors_destructor_fn_imps.hpp>
+#undef PB_DS_CLASS_NAME
+  };
+
+#undef PB_DS_BASE_C_DEC
+
+
+#define PB_DS_BASE_C_DEC						\
+  container_base<Key, Mapped, Tag, typename detail::typelist_append< \
+										   typename detail::typelist4<Hash_Fn, Eq_Fn, Resize_Policy, detail::integral_constant<int,Store_Hash> >::type, \
+										   Policy_TL>::type, Allocator>
+
+  // An abstract basic hash-based associative container.
+  template<typename Key,
+	   typename Mapped,
+	   typename Hash_Fn,
+	   typename Eq_Fn,
+	   typename Resize_Policy,
+	   bool Store_Hash,
+	   typename Tag,
+	   typename Policy_TL,
+	   typename Allocator>
+  class basic_hash_table : public PB_DS_BASE_C_DEC
+  {
+  private:
+    typedef PB_DS_BASE_C_DEC base_type;
+
+  public:
+    virtual
+    ~basic_hash_table() { }
+
+  protected:
+#define PB_DS_CLASS_NAME basic_hash_table
+#include <ext/pb_ds/detail/constructors_destructor_fn_imps.hpp>
+#undef PB_DS_CLASS_NAME
+
+  private:
+    basic_hash_table& 
+    operator=(const base_type&);
+  };
+
+#undef PB_DS_BASE_C_DEC
+
+
+#define PB_DS_BASE_C_DEC						\
+  basic_hash_table<Key, Mapped,	Hash_Fn, Eq_Fn, Resize_Policy, Store_Hash, \
+		   cc_hash_tag,						\
+		   typename detail::typelist1<Comb_Hash_Fn>::type, Allocator>
+
+  // A concrete collision-chaining hash-based associative container.
+  template<typename Key,
+	   typename Mapped,
+	   typename Hash_Fn = typename detail::default_hash_fn<Key>::type,
+	   typename Eq_Fn = typename detail::default_eq_fn<Key>::type,
+	   typename Comb_Hash_Fn = detail::default_comb_hash_fn::type,
+	   typename Resize_Policy = typename detail::default_resize_policy<Comb_Hash_Fn>::type,
+	   bool Store_Hash = detail::default_store_hash,
+	   typename Allocator = std::allocator<char> >
+  class cc_hash_table :  public PB_DS_BASE_C_DEC
+  {
+  private:
+    typedef PB_DS_BASE_C_DEC 	base_type;
+
+  public:
+    typedef Hash_Fn 		hash_fn;
+    typedef Eq_Fn 		eq_fn;
+    typedef Resize_Policy 	resize_policy;
+    typedef Comb_Hash_Fn 	comb_hash_fn;
+
+    // Default constructor.
+    cc_hash_table() { }
+
+    // Constructor taking some policy objects. r_hash_fn will be
+    // copied by the Hash_Fn object of the container object.
+    cc_hash_table(const hash_fn& h) 
+      : base_type(h) { }
+
+    // Constructor taking some policy objects. r_hash_fn will be
+    // copied by the hash_fn object of the container object, and
+    // r_eq_fn will be copied by the eq_fn object of the container
+    // object.
+    cc_hash_table(const hash_fn& h, const eq_fn& e)
+      : base_type(h, e) { }
+
+    // Constructor taking some policy objects. r_hash_fn will be
+    // copied by the hash_fn object of the container object, r_eq_fn
+    // will be copied by the eq_fn object of the container object, and
+    // r_comb_hash_fn will be copied by the comb_hash_fn object of the
+    // container object.
+    cc_hash_table(const hash_fn& h, const eq_fn& e, const comb_hash_fn& ch)
+      : base_type(h, e, ch) { }
+
+    // Constructor taking some policy objects. r_hash_fn will be
+    // copied by the hash_fn object of the container object, r_eq_fn
+    // will be copied by the eq_fn object of the container object,
+    // r_comb_hash_fn will be copied by the comb_hash_fn object of the
+    // container object, and r_resize_policy will be copied by the
+    // resize_policy object of the container object.
+    cc_hash_table(const hash_fn& h, const eq_fn& e, const comb_hash_fn& ch, 
+		  const resize_policy& rp)    
+      : base_type(h, e, ch, rp) { }
+
+    // Constructor taking __iterators to a range of value_types. The
+    // value_types between first_it and last_it will be inserted into
+    // the container object.
+    template<typename It>
+    cc_hash_table(It first, It last)
+    { base_type::copy_from_range(first, last); }
+
+    // Constructor taking __iterators to a range of value_types and
+    // some policy objects. The value_types between first_it and
+    // last_it will be inserted into the container object.
+    template<typename It>
+    cc_hash_table(It first, It last, const hash_fn& h)
+      : base_type(h)
+    { copy_from_range(first, last); }
+
+    // Constructor taking __iterators to a range of value_types and
+    // some policy objects The value_types between first_it and
+    // last_it will be inserted into the container object. r_hash_fn
+    // will be copied by the hash_fn object of the container object,
+    // and r_eq_fn will be copied by the eq_fn object of the container
+    // object.
+    template<typename It>
+    cc_hash_table(It first, It last, const hash_fn& h, const eq_fn& e)
+      : base_type(h, e)
+    { copy_from_range(first, last); }
+
+    // Constructor taking __iterators to a range of value_types and
+    // some policy objects The value_types between first_it and
+    // last_it will be inserted into the container object. r_hash_fn
+    // will be copied by the hash_fn object of the container object,
+    // r_eq_fn will be copied by the eq_fn object of the container
+    // object, and r_comb_hash_fn will be copied by the comb_hash_fn
+    // object of the container object.
+    template<typename It>
+    cc_hash_table(It first, It last, const hash_fn& h, const eq_fn& e,
+		  const comb_hash_fn& ch)
+      : base_type(h, e, ch)
+    { copy_from_range(first, last); }
+
+    // Constructor taking __iterators to a range of value_types and
+    // some policy objects The value_types between first_it and
+    // last_it will be inserted into the container object. r_hash_fn
+    // will be copied by the hash_fn object of the container object,
+    // r_eq_fn will be copied by the eq_fn object of the container
+    // object, r_comb_hash_fn will be copied by the comb_hash_fn
+    // object of the container object, and r_resize_policy will be
+    // copied by the resize_policy object of the container object.
+    template<typename It>
+    cc_hash_table(It first, It last, const hash_fn& h, const eq_fn& e, 
+		  const comb_hash_fn& ch, const resize_policy& rp)
+      : base_type(h, e, ch, rp)
+    { copy_from_range(first, last); }
+
+    cc_hash_table(const cc_hash_table& other)
+      : base_type((const base_type&)other)
+    { }
+
+    virtual
+    ~cc_hash_table() { }
+
+    cc_hash_table& 
+    operator=(const cc_hash_table& other)
+    {
+      if (this !=& other)
+	{
+	  cc_hash_table tmp(other);
+	  swap(tmp);
+	}
+      return *this;
+    }
+
+    void
+    swap(cc_hash_table& other)
+    { base_type::swap(other); }
+  };
+
+#undef PB_DS_BASE_C_DEC
+
+
+#define PB_DS_BASE_C_DEC						\
+  basic_hash_table<Key, Mapped,	Hash_Fn, Eq_Fn, Resize_Policy, Store_Hash, \
+		   gp_hash_tag,						\
+		   typename detail::typelist2<Comb_Probe_Fn, Probe_Fn>::type, Allocator>
+
+  // A concrete general-probing hash-based associative container.
+  template<typename Key,
+	   typename Mapped,
+	   typename Hash_Fn = typename detail::default_hash_fn<Key>::type,
+	   typename Eq_Fn = typename detail::default_eq_fn<Key>::type,
+	   typename Comb_Probe_Fn = detail::default_comb_hash_fn::type,
+	   typename Probe_Fn = typename detail::default_probe_fn<Comb_Probe_Fn>::type,
+	   typename Resize_Policy = typename detail::default_resize_policy<Comb_Probe_Fn>::type,
+	   bool Store_Hash = detail::default_store_hash,
+	   typename Allocator = std::allocator<char> >
+  class gp_hash_table : public PB_DS_BASE_C_DEC
+  {
+  private:
+    typedef PB_DS_BASE_C_DEC 	base_type;
+
+  public:
+    typedef Hash_Fn 		hash_fn;
+    typedef Eq_Fn 		eq_fn;
+    typedef Comb_Probe_Fn	comb_probe_fn;
+    typedef Probe_Fn 		probe_fn;
+    typedef Resize_Policy 	resize_policy;
+
+    // Default constructor.
+    gp_hash_table() { }
+
+    // Constructor taking some policy objects. r_hash_fn will be
+    // copied by the hash_fn object of the container object.
+    gp_hash_table(const hash_fn& h)
+      : base_type(h) { }
+
+    // Constructor taking some policy objects. r_hash_fn will be
+    // copied by the hash_fn object of the container object, and
+    // r_eq_fn will be copied by the eq_fn object of the container
+    // object.
+    gp_hash_table(const hash_fn& h, const eq_fn& e)
+      : base_type(h, e) { }
+
+    // Constructor taking some policy objects. r_hash_fn will be
+    // copied by the hash_fn object of the container object, r_eq_fn
+    // will be copied by the eq_fn object of the container object, and
+    // r_comb_probe_fn will be copied by the comb_probe_fn object of
+    // the container object.
+    gp_hash_table(const hash_fn& h, const eq_fn& e, const comb_probe_fn& cp)
+      : base_type(h, e, cp) { }
+
+    // Constructor taking some policy objects. r_hash_fn will be
+    // copied by the hash_fn object of the container object, r_eq_fn
+    // will be copied by the eq_fn object of the container object,
+    // r_comb_probe_fn will be copied by the comb_probe_fn object of
+    // the container object, and r_probe_fn will be copied by the
+    // probe_fn object of the container object.
+    gp_hash_table(const hash_fn& h, const eq_fn& e, const comb_probe_fn& cp, 
+		  const probe_fn& p)
+      : base_type(h, e, cp, p) { }
+
+    // Constructor taking some policy objects. r_hash_fn will be
+    // copied by the hash_fn object of the container object, r_eq_fn
+    // will be copied by the eq_fn object of the container object,
+    // r_comb_probe_fn will be copied by the comb_probe_fn object of
+    // the container object, r_probe_fn will be copied by the probe_fn
+    // object of the container object, and r_resize_policy will be
+    // copied by the Resize_Policy object of the container object.
+    gp_hash_table(const hash_fn& h, const eq_fn& e, const comb_probe_fn& cp, 
+		  const probe_fn& p, const resize_policy& rp)
+      : base_type(h, e, cp, p, rp) { }
+
+    // Constructor taking __iterators to a range of value_types. The
+    // value_types between first_it and last_it will be inserted into
+    // the container object.
+    template<typename It>
+    gp_hash_table(It first, It last)
+    { base_type::copy_from_range(first, last); }
+
+    // Constructor taking __iterators to a range of value_types and
+    // some policy objects. The value_types between first_it and
+    // last_it will be inserted into the container object. r_hash_fn
+    // will be copied by the hash_fn object of the container object.
+    template<typename It>
+    gp_hash_table(It first, It last, const hash_fn& h)
+      : base_type(h)
+    { base_type::copy_from_range(first, last); }
+
+    // Constructor taking __iterators to a range of value_types and
+    // some policy objects. The value_types between first_it and
+    // last_it will be inserted into the container object. r_hash_fn
+    // will be copied by the hash_fn object of the container object,
+    // and r_eq_fn will be copied by the eq_fn object of the container
+    // object.
+    template<typename It>
+    gp_hash_table(It first, It last, const hash_fn& h, const eq_fn& e)
+      : base_type(h, e)
+    { base_type::copy_from_range(first, last); }
+
+    // Constructor taking __iterators to a range of value_types and
+    // some policy objects. The value_types between first_it and
+    // last_it will be inserted into the container object. r_hash_fn
+    // will be copied by the hash_fn object of the container object,
+    // r_eq_fn will be copied by the eq_fn object of the container
+    // object, and r_comb_probe_fn will be copied by the comb_probe_fn
+    // object of the container object.
+    template<typename It>
+    gp_hash_table(It first, It last, const hash_fn& h, const eq_fn& e, 
+		  const comb_probe_fn& cp)
+      : base_type(h, e, cp)
+    { base_type::copy_from_range(first, last); }
+
+    // Constructor taking __iterators to a range of value_types and
+    // some policy objects. The value_types between first_it and
+    // last_it will be inserted into the container object. r_hash_fn
+    // will be copied by the hash_fn object of the container object,
+    // r_eq_fn will be copied by the eq_fn object of the container
+    // object, r_comb_probe_fn will be copied by the comb_probe_fn
+    // object of the container object, and r_probe_fn will be copied
+    // by the probe_fn object of the container object.
+    template<typename It>
+    gp_hash_table(It first, It last, const hash_fn& h, const eq_fn& e, 
+		  const comb_probe_fn& cp, const probe_fn& p)
+      : base_type(h, e, cp, p)
+    { base_type::copy_from_range(first, last); }
+
+    // Constructor taking __iterators to a range of value_types and
+    // some policy objects. The value_types between first_it and
+    // last_it will be inserted into the container object. r_hash_fn
+    // will be copied by the hash_fn object of the container object,
+    // r_eq_fn will be copied by the eq_fn object of the container
+    // object, r_comb_probe_fn will be copied by the comb_probe_fn
+    // object of the container object, r_probe_fn will be copied by
+    // the probe_fn object of the container object, and
+    // r_resize_policy will be copied by the resize_policy object of
+    // the container object.
+    template<typename It>
+    gp_hash_table(It first, It last, const hash_fn& h, const eq_fn& e, 
+		  const comb_probe_fn& cp, const probe_fn& p, 
+		  const resize_policy& rp)
+      : base_type(h, e, cp, p, rp)
+    { base_type::copy_from_range(first, last); }
+
+    gp_hash_table(const gp_hash_table& other)
+      : base_type((const base_type&)other)
+    { }
+
+    virtual
+    ~gp_hash_table() { }
+
+    gp_hash_table& 
+    operator=(const gp_hash_table& other)
+    {
+      if (this !=& other)
+	{
+	  gp_hash_table tmp(other);
+	  swap(tmp);
+	}
+      return *this;
+    }
+
+    void
+    swap(gp_hash_table& other)
+    { base_type::swap(other); }
+  };
+
+#undef PB_DS_BASE_C_DEC
+
+
+#define PB_DS_BASE_C_DEC					\
+  container_base<Key, Mapped, Tag, Policy_Tl, Allocator>
+
+  // An abstract basic tree-like (tree, trie) associative container.
+  template<typename Key, typename Mapped, typename Tag, 
+	   typename Node_Update, typename Policy_Tl, typename Allocator>
+  class basic_tree : public PB_DS_BASE_C_DEC
+  {
+  private:
+    typedef PB_DS_BASE_C_DEC 	base_type;
+
+  public:
+    typedef Node_Update 	node_update;
+
+    virtual
+    ~basic_tree() { }
+
+  protected:
+#define PB_DS_CLASS_NAME 		basic_tree
+#include <ext/pb_ds/detail/constructors_destructor_fn_imps.hpp>
+#undef PB_DS_CLASS_NAME
+  };
+
+#undef PB_DS_BASE_C_DEC
+
+
+#define PB_DS_TREE_NODE_AND_IT_TRAITS_C_DEC				\
+  detail::tree_traits<Key, Mapped,Cmp_Fn,Node_Update,Tag, Allocator>
+
+#define PB_DS_BASE_C_DEC						\
+  basic_tree<Key,Mapped,Tag,typename PB_DS_TREE_NODE_AND_IT_TRAITS_C_DEC::node_update, \
+	     typename detail::typelist2<Cmp_Fn, PB_DS_TREE_NODE_AND_IT_TRAITS_C_DEC >::type, Allocator>
+
+  // A concrete basic tree-based associative container.
+  template<typename Key, typename Mapped, typename Cmp_Fn = std::less<Key>,
+	   typename Tag = rb_tree_tag,
+	   template<typename Const_Node_Iterator, typename Node_Iterator, typename Cmp_Fn_, typename Allocator_>
+  class Node_Update = pb_ds::null_tree_node_update,
+	   typename Allocator = std::allocator<char> >
+  class tree : public PB_DS_BASE_C_DEC
+  {
+  private:
+    typedef PB_DS_BASE_C_DEC 	base_type;
+
+  public:
+    // Comparison functor type.
+    typedef Cmp_Fn 		cmp_fn;
+
+    tree() { }
+
+    // Constructor taking some policy objects. r_cmp_fn will be copied
+    // by the Cmp_Fn object of the container object.
+    tree(const cmp_fn& c)
+      : base_type(c) { }
+
+    // Constructor taking __iterators to a range of value_types. The
+    // value_types between first_it and last_it will be inserted into
+    // the container object.
+    template<typename It>
+    tree(It first, It last)
+    { base_type::copy_from_range(first, last); }
+
+    // Constructor taking __iterators to a range of value_types and
+    // some policy objects The value_types between first_it and
+    // last_it will be inserted into the container object. r_cmp_fn
+    // will be copied by the cmp_fn object of the container object.
+    template<typename It>
+    tree(It first, It last, const cmp_fn& c)
+      : base_type(c)
+    { base_type::copy_from_range(first, last); }
+
+    tree(const tree& other)
+      : base_type((const base_type&)other) { }
+
+    virtual
+    ~tree() { }
+
+    tree& 
+    operator=(const tree& other)
+    {
+      if (this !=& other)
+	{
+	  tree tmp(other);
+	  swap(tmp);
+	}
+      return *this;
+    }
+
+    void
+    swap(tree& other)
+    { base_type::swap(other); }
+  };
+
+#undef PB_DS_BASE_C_DEC
+#undef PB_DS_TREE_NODE_AND_IT_TRAITS_C_DEC
+
+
+#define PB_DS_TRIE_NODE_AND_ITS_TRAITS					\
+  detail::trie_traits<Key,Mapped,E_Access_Traits,Node_Update,Tag,Allocator>
+
+#define PB_DS_BASE_C_DEC						\
+  basic_tree<Key,Mapped,Tag, typename PB_DS_TRIE_NODE_AND_ITS_TRAITS::node_update, \
+	     typename detail::typelist2<E_Access_Traits, PB_DS_TRIE_NODE_AND_ITS_TRAITS >::type, Allocator>
+
+  // A concrete basic trie-based associative container.
+  template<typename Key,
+	   typename Mapped,
+	   typename E_Access_Traits = typename detail::default_trie_e_access_traits<Key>::type,
+	   typename Tag = pat_trie_tag,
+	   template<typename Const_Node_Iterator,
+		    typename Node_Iterator,
+		    typename E_Access_Traits_,
+		    typename Allocator_>
+  class Node_Update = null_trie_node_update,
+	   typename Allocator = std::allocator<char> >
+  class trie : public PB_DS_BASE_C_DEC
+  {
+  private:
+    typedef PB_DS_BASE_C_DEC base_type;
+
+  public:
+    // Element access traits type.
+    typedef E_Access_Traits e_access_traits;
+
+    trie() { }
+
+    // Constructor taking some policy objects. r_e_access_traits will
+    // be copied by the E_Access_Traits object of the container
+    // object.
+    trie(const e_access_traits& t)
+      : base_type(t) { }
+
+    // Constructor taking __iterators to a range of value_types. The
+    // value_types between first_it and last_it will be inserted into
+    // the container object.
+    template<typename It>
+    trie(It first, It last)
+    { base_type::copy_from_range(first, last); }
+
+    // Constructor taking __iterators to a range of value_types and
+    // some policy objects. The value_types between first_it and
+    // last_it will be inserted into the container object.
+    template<typename It>
+    trie(It first, It last, const e_access_traits& t)
+      : base_type(t)
+    { base_type::copy_from_range(first, last); }
+
+    trie(const trie& other)
+      : base_type((const base_type&)other) { }
+
+    virtual
+    ~trie() { }
+
+    trie& 
+    operator=(const trie& other)
+    {
+      if (this !=& other)
+	{
+	  trie tmp(other);
+	  swap(tmp);
+	}
+      return *this;
+    }
+
+    void
+    swap(trie& other)
+    { base_type::swap(other); }
+  };
+
+#undef PB_DS_BASE_C_DEC
+#undef PB_DS_TRIE_NODE_AND_ITS_TRAITS
+
+
+#define PB_DS_BASE_C_DEC						\
+  container_base<Key, Mapped, list_update_tag,			\
+			typename detail::typelist2<Eq_Fn, Update_Policy>::type, Allocator>
+
+  // A list-update based associative container.
+  template<typename Key,
+	   typename Mapped,
+	   class Eq_Fn = typename detail::default_eq_fn<Key>::type,
+	   class Update_Policy = detail::default_update_policy::type,
+	   class Allocator = std::allocator<char> >
+  class list_update : public PB_DS_BASE_C_DEC
+  {
+  private:
+    typedef PB_DS_BASE_C_DEC 	base_type;
+
+  public:
+    typedef Eq_Fn 		eq_fn;
+    typedef Update_Policy 	update_policy;
+    typedef Allocator 		allocator;
+
+    list_update() { }
+
+    // Constructor taking __iterators to a range of value_types. The
+    // value_types between first_it and last_it will be inserted into
+    // the container object.
+    template<typename It>
+    list_update(It first, It last)
+    { base_type::copy_from_range(first, last); }
+
+    list_update(const list_update& other)
+      : base_type((const base_type&)other) { }
+
+    virtual
+    ~list_update() { }
+
+    list_update& 
+    operator=(const list_update& other)
+    {
+      if (this !=& other)
+	{
+	  list_update tmp(other);
+	  swap(tmp);
+	}
+      return *this;
+    }
+
+    void
+    swap(list_update& other)
+    { base_type::swap(other); }
+  };
+
+#undef PB_DS_BASE_C_DEC
+
+} // namespace pb_ds
+
+#endif 
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/basic_tree_policy/basic_tree_policy_base.hpp b/libstdc++-v3/include/ext/pb_ds/detail/basic_tree_policy/basic_tree_policy_base.hpp
new file mode 100644
index 00000000000..d396d7d5da5
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/basic_tree_policy/basic_tree_policy_base.hpp
@@ -0,0 +1,179 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file basic_tree_policy_base.hpp
+ * Contains a base class for tree_like policies.
+ */
+
+#ifndef PB_DS_TREE_LIKE_POLICY_BASE_HPP
+#define PB_DS_TREE_LIKE_POLICY_BASE_HPP
+
+namespace pb_ds
+{
+  namespace detail
+  {
+
+#define PB_DS_CLASS_C_DEC						\
+    basic_tree_policy_base<						\
+							Const_Node_Iterator, \
+							Node_Iterator,	\
+							Allocator>
+
+    template<typename Const_Node_Iterator,
+	     typename Node_Iterator,
+	     typename Allocator>
+    struct basic_tree_policy_base
+    {
+    protected:
+      typedef typename Node_Iterator::value_type it_type;
+
+      typedef typename std::iterator_traits< it_type>::value_type value_type;
+
+      typedef typename value_type::first_type key_type;
+
+      typedef
+      typename Allocator::template rebind<
+	typename remove_const<
+	key_type>::type>::other::const_reference
+      const_key_reference;
+
+      typedef
+      typename Allocator::template rebind<
+	typename remove_const<
+	value_type>::type>::other::const_reference
+      const_reference;
+
+      typedef
+      typename Allocator::template rebind<
+	typename remove_const<
+	value_type>::type>::other::reference
+      reference;
+
+      typedef
+      typename Allocator::template rebind<
+	typename remove_const<
+	value_type>::type>::other::const_pointer
+      const_pointer;
+
+      static inline const_key_reference
+      extract_key(const_reference r_val)
+      {
+	return (r_val.first);
+      }
+
+      virtual it_type
+      end() = 0;
+
+      it_type
+      end_iterator() const
+      {
+	return (const_cast<PB_DS_CLASS_C_DEC* >(this)->end());
+      }
+
+      virtual
+      ~basic_tree_policy_base()
+      { }
+    };
+
+    template<typename Const_Node_Iterator, typename Allocator>
+    struct basic_tree_policy_base<
+      Const_Node_Iterator,
+      Const_Node_Iterator,
+      Allocator>
+    {
+    protected:
+      typedef typename Const_Node_Iterator::value_type it_type;
+
+      typedef typename std::iterator_traits< it_type>::value_type value_type;
+
+      typedef value_type key_type;
+
+      typedef
+      typename Allocator::template rebind<
+	typename remove_const<
+	key_type>::type>::other::const_reference
+      const_key_reference;
+
+      typedef
+      typename Allocator::template rebind<
+	typename remove_const<
+	value_type>::type>::other::const_reference
+      const_reference;
+
+      typedef
+      typename Allocator::template rebind<
+	typename remove_const<
+	value_type>::type>::other::reference
+      reference;
+
+      typedef
+      typename Allocator::template rebind<
+	typename remove_const<
+	value_type>::type>::other::const_pointer
+      const_pointer;
+
+      static inline const_key_reference
+      extract_key(const_reference r_val)
+      {
+	return (r_val);
+      }
+
+      virtual it_type
+      end() const = 0;
+
+      it_type
+      end_iterator() const
+      {
+	return (end());
+      }
+
+      virtual
+      ~basic_tree_policy_base()
+      { }
+    };
+
+#undef PB_DS_CLASS_C_DEC
+
+  } // namespace detail
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_TREE_LIKE_POLICY_BASE_HPP
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/basic_tree_policy/null_node_metadata.hpp b/libstdc++-v3/include/ext/pb_ds/detail/basic_tree_policy/null_node_metadata.hpp
new file mode 100644
index 00000000000..1e050f807ac
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/basic_tree_policy/null_node_metadata.hpp
@@ -0,0 +1,83 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file null_node_metadata.hpp
+ * Contains an implementation class for tree-like classes.
+ */
+
+#ifndef PB_DS_NULL_NODE_METADATA_HPP
+#define PB_DS_NULL_NODE_METADATA_HPP
+
+#include <ext/pb_ds/detail/types_traits.hpp>
+
+namespace pb_ds
+{
+  namespace detail
+  {
+
+    template<typename Key, class Data, class Allocator>
+    struct dumconst_node_iterator
+    {
+    private:
+      typedef
+      typename types_traits<
+      Key,
+      Data,
+      Allocator,
+      false>::pointer
+      const_iterator;
+
+    public:
+      typedef const_iterator value_type;
+
+      typedef const_iterator const_reference;
+
+      typedef const_reference reference;
+    };
+
+    struct null_node_metadata
+    { };
+
+  } // namespace detail
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_NULL_NODE_METADATA_HPP
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/basic_tree_policy/traits.hpp b/libstdc++-v3/include/ext/pb_ds/detail/basic_tree_policy/traits.hpp
new file mode 100644
index 00000000000..c574bc09aa4
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/basic_tree_policy/traits.hpp
@@ -0,0 +1,91 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file traits.hpp
+ * Contains an implementation class for tree-like classes.
+ */
+
+#ifndef PB_DS_NODE_AND_IT_TRAITS_HPP
+#define PB_DS_NODE_AND_IT_TRAITS_HPP
+
+#include <ext/pb_ds/detail/types_traits.hpp>
+#include <ext/pb_ds/detail/bin_search_tree_/traits.hpp>
+#include <ext/pb_ds/detail/tree_policy/node_metadata_selector.hpp>
+#include <ext/pb_ds/detail/trie_policy/node_metadata_selector.hpp>
+
+namespace pb_ds
+{
+  namespace detail
+  {    
+    template<typename Key,
+	     typename Data,
+	     class Cmp_Fn,
+	     template<typename Const_Node_Iterator,
+		      class Node_Iterator,
+		      class Cmp_Fn_,
+		      class Allocator>
+    class Node_Update,
+	     class Tag,
+	     class Allocator>
+    struct tree_traits;
+
+    template<typename Key,
+	     typename Data,
+	     class E_Access_Traits,
+	     template<typename Const_Node_Iterator,
+		      class Node_Iterator,
+		      class E_Access_Traits_,
+		      class Allocator>
+    class Node_Update,
+	     class Tag,
+	     class Allocator>
+    struct trie_traits;
+
+  } // namespace detail
+} // namespace pb_ds
+
+#include <ext/pb_ds/detail/rb_tree_map_/traits.hpp>
+#include <ext/pb_ds/detail/splay_tree_/traits.hpp>
+#include <ext/pb_ds/detail/ov_tree_map_/traits.hpp>
+#include <ext/pb_ds/detail/pat_trie_/traits.hpp>
+
+#endif // #ifndef PB_DS_NODE_AND_IT_TRAITS_HPP
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/basic_types.hpp b/libstdc++-v3/include/ext/pb_ds/detail/basic_types.hpp
new file mode 100644
index 00000000000..4bad6c04a7f
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/basic_types.hpp
@@ -0,0 +1,377 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file basic_types.hpp
+ * Contains basic types used by containers.
+ */
+
+#ifndef PB_DS_BASIC_TYPES_HPP
+#define PB_DS_BASIC_TYPES_HPP
+
+#include <algorithm>
+#include <utility>
+#include <ext/pb_ds/tag_and_trait.hpp>
+#include <ext/pb_ds/detail/type_utils.hpp>
+
+namespace pb_ds
+{
+  namespace detail
+  {
+
+    template<typename Key, class Mapped, class Allocator, bool Store_Hash>
+    struct value_type_base;
+
+#define PB_DS_CLASS_T_DEC					\
+    template<typename Key, class Mapped, class Allocator>
+
+#define PB_DS_CLASS_C_DEC					\
+    value_type_base<						\
+						Key,		\
+						Mapped,		\
+						Allocator,	\
+						false>
+
+    /**
+     * Specialization of value_type_base for the case where the hash value
+     *    is not stored alongside each value.
+     **/
+    template<typename Key, class Mapped, class Allocator>
+    struct value_type_base<
+      Key,
+      Mapped,
+      Allocator,
+      false>
+    {
+
+      typedef
+      typename Allocator::template rebind<
+	Mapped>::other
+      mapped_type_allocator;
+
+      typedef typename mapped_type_allocator::value_type mapped_type;
+
+      typedef typename mapped_type_allocator::pointer mapped_pointer;
+
+      typedef
+      typename mapped_type_allocator::const_pointer
+      const_mapped_pointer;
+
+      typedef typename mapped_type_allocator::reference mapped_reference;
+
+      typedef
+      typename mapped_type_allocator::const_reference
+      const_mapped_reference;
+
+      typedef
+      typename Allocator::template rebind<
+	std::pair<const Key, Mapped> >::other
+      value_type_allocator;
+
+      typedef typename value_type_allocator::value_type value_type;
+
+      typedef typename value_type_allocator::pointer pointer;
+
+      typedef typename value_type_allocator::const_pointer const_pointer;
+
+      typedef typename value_type_allocator::reference reference;
+
+      typedef typename value_type_allocator::const_reference const_reference;
+
+      struct stored_value_type
+      {
+	value_type m_value;
+      };
+    };
+
+#undef PB_DS_CLASS_T_DEC
+
+#undef PB_DS_CLASS_C_DEC
+
+#define PB_DS_CLASS_T_DEC					\
+    template<typename Key, class Mapped, class Allocator>
+
+#define PB_DS_CLASS_C_DEC					\
+    value_type_base<						\
+						Key,		\
+						Mapped,		\
+						Allocator,	\
+						true>
+
+    /**
+     * Specialization of value_type_base for the case where the hash value
+     *    is stored alongside each value.
+     **/
+    template<typename Key, class Mapped, class Allocator>
+    struct value_type_base<
+      Key,
+      Mapped,
+      Allocator,
+      true>
+    {
+
+      typedef
+      typename Allocator::template rebind<
+	Mapped>::other
+      mapped_type_allocator;
+
+      typedef typename mapped_type_allocator::value_type mapped_type;
+
+      typedef typename mapped_type_allocator::pointer mapped_pointer;
+
+      typedef
+      typename mapped_type_allocator::const_pointer
+      const_mapped_pointer;
+
+      typedef typename mapped_type_allocator::reference mapped_reference;
+
+      typedef
+      typename mapped_type_allocator::const_reference
+      const_mapped_reference;
+
+      typedef
+      typename Allocator::template rebind<
+	std::pair<const Key, Mapped> >::other
+      value_type_allocator;
+
+      typedef typename value_type_allocator::value_type value_type;
+
+      typedef typename value_type_allocator::pointer pointer;
+
+      typedef typename value_type_allocator::const_pointer const_pointer;
+
+      typedef typename value_type_allocator::reference reference;
+
+      typedef typename value_type_allocator::const_reference const_reference;
+
+      struct stored_value_type
+      {
+	value_type m_value;
+
+	typename Allocator::size_type m_hash;
+      };
+    };
+
+#undef PB_DS_CLASS_T_DEC
+
+#undef PB_DS_CLASS_C_DEC
+
+#define PB_DS_CLASS_T_DEC			\
+    template<typename Key, class Allocator>
+
+#define PB_DS_CLASS_C_DEC						\
+    value_type_base<							\
+						Key,			\
+						null_mapped_type,	\
+						Allocator,		\
+						false>
+
+    /**
+     * Specialization of value_type_base for the case where the hash value
+     *    is not stored alongside each value.
+     **/
+    template<typename Key, class Allocator>
+    struct value_type_base<
+      Key,
+      null_mapped_type,
+      Allocator,
+      false>
+    {
+
+      typedef
+      typename Allocator::template rebind<
+	null_mapped_type>::other
+      mapped_type_allocator;
+
+      typedef typename mapped_type_allocator::value_type mapped_type;
+
+      typedef typename mapped_type_allocator::pointer mapped_pointer;
+
+      typedef
+      typename mapped_type_allocator::const_pointer
+      const_mapped_pointer;
+
+      typedef typename mapped_type_allocator::reference mapped_reference;
+
+      typedef
+      typename mapped_type_allocator::const_reference
+      const_mapped_reference;
+
+      typedef Key value_type;
+
+      typedef
+      typename Allocator::template rebind<
+	value_type>::other
+      value_type_allocator;
+
+      typedef typename value_type_allocator::pointer pointer;
+
+      typedef typename value_type_allocator::const_pointer const_pointer;
+
+      typedef typename value_type_allocator::reference reference;
+
+      typedef typename value_type_allocator::const_reference const_reference;
+
+      struct stored_value_type
+      {
+	Key m_value;
+      };
+
+    public:
+      static null_mapped_type s_null_mapped;
+    };
+
+    PB_DS_CLASS_T_DEC
+    null_mapped_type PB_DS_CLASS_C_DEC::s_null_mapped;
+
+#undef PB_DS_CLASS_T_DEC
+
+#undef PB_DS_CLASS_C_DEC
+
+#define PB_DS_CLASS_T_DEC			\
+    template<typename Key, class Allocator>
+
+#define PB_DS_CLASS_C_DEC						\
+    value_type_base<							\
+						Key,			\
+						null_mapped_type,	\
+						Allocator,		\
+						true>
+
+    /**
+     * Specialization of value_type_base for the case where the hash value
+     *    is stored alongside each value.
+     **/
+    template<typename Key, class Allocator>
+    struct value_type_base<
+      Key,
+      null_mapped_type,
+      Allocator,
+      true>
+    {
+
+      typedef
+      typename Allocator::template rebind<
+	null_mapped_type>::other
+      mapped_type_allocator;
+
+      typedef typename mapped_type_allocator::value_type mapped_type;
+
+      typedef typename mapped_type_allocator::pointer mapped_pointer;
+
+      typedef
+      typename mapped_type_allocator::const_pointer
+      const_mapped_pointer;
+
+      typedef typename mapped_type_allocator::reference mapped_reference;
+
+      typedef
+      typename mapped_type_allocator::const_reference
+      const_mapped_reference;
+
+      typedef Key value_type;
+
+      typedef
+      typename Allocator::template rebind<
+	Key>::other
+      value_type_allocator;
+
+      typedef typename value_type_allocator::pointer pointer;
+
+      typedef typename value_type_allocator::const_pointer const_pointer;
+
+      typedef typename value_type_allocator::reference reference;
+
+      typedef typename value_type_allocator::const_reference const_reference;
+
+      struct stored_value_type
+      {
+	Key m_value;
+
+	typename Allocator::size_type m_hash;
+      };
+
+    public:
+      static null_mapped_type s_null_mapped;
+    };
+
+    PB_DS_CLASS_T_DEC
+    null_mapped_type PB_DS_CLASS_C_DEC::s_null_mapped;
+
+#undef PB_DS_CLASS_T_DEC
+
+#undef PB_DS_CLASS_C_DEC
+
+    template<typename Key, class Mapped>
+    struct no_throw_copies;
+
+    template<typename Key, class Mapped>
+    struct no_throw_copies
+    {
+      typedef
+      integral_constant<int,
+				       is_simple<Key>::value&& 
+      is_simple<Mapped>::value>
+      indicator;
+    };
+
+    template<typename Key>
+    struct no_throw_copies<
+      Key,
+      null_mapped_type>
+    {
+      typedef
+      integral_constant<int,
+				       is_simple<Key>::value>
+      indicator;
+    };
+
+    template<typename Size_Type>
+    struct comp_hash_
+    {
+      typedef std::pair< Size_Type, Size_Type> comp_hash;
+    };
+
+  } // namespace detail
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_BASIC_TYPES_HPP
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/bin_search_tree_/bin_search_tree_.hpp b/libstdc++-v3/include/ext/pb_ds/detail/bin_search_tree_/bin_search_tree_.hpp
new file mode 100644
index 00000000000..8f325538f29
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/bin_search_tree_/bin_search_tree_.hpp
@@ -0,0 +1,530 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file bin_search_tree_.hpp
+ * Contains an implementation class for bin_search_tree_.
+ */
+/*
+ * This implementation uses an idea from the SGI STL (using a "header" node
+ *    which is needed for efficient iteration).
+ */
+
+#include <ext/pb_ds/exception.hpp>
+#include <ext/pb_ds/detail/eq_fn/eq_by_less.hpp>
+#include <ext/pb_ds/detail/types_traits.hpp>
+#include <ext/pb_ds/detail/map_debug_base.hpp>
+#include <ext/pb_ds/tree_policy.hpp>
+#include <ext/pb_ds/detail/cond_dealtor.hpp>
+#include <ext/pb_ds/detail/type_utils.hpp>
+#include <ext/pb_ds/detail/tree_trace_base.hpp>
+#include <utility>
+#include <functional>
+#include <assert.h>
+
+namespace pb_ds
+{
+  namespace detail
+  {
+
+#ifdef PB_DS_BIN_SEARCH_TREE_DEBUG_
+#define PB_DS_DBG_ASSERT(X) assert(X)
+#define PB_DS_DBG_VERIFY(X) assert(X)
+#define PB_DS_DBG_ONLY(X) X
+#else // #ifdef PB_DS_BIN_SEARCH_TREE_DEBUG_
+#define PB_DS_DBG_ASSERT(X)
+#define PB_DS_DBG_VERIFY(X) {if((X)==0);}
+#define PB_DS_DBG_ONLY(X) ;
+#endif // #ifdef PB_DS_BIN_SEARCH_TREE_DEBUG_
+
+#define PB_DS_CLASS_T_DEC						\
+    template<								\
+						typename Key,		\
+						typename Mapped,	\
+						class Cmp_Fn,		\
+						class Node_And_It_Traits, \
+						class Allocator>
+
+#ifdef PB_DS_DATA_TRUE_INDICATOR
+#define PB_DS_CLASS_NAME			\
+    bin_search_tree_data_
+#endif // #ifdef PB_DS_DATA_TRUE_INDICATOR
+
+#ifdef PB_DS_DATA_FALSE_INDICATOR
+#define PB_DS_CLASS_NAME			\
+    bin_search_tree_no_data_
+#endif // #ifdef PB_DS_DATA_FALSE_INDICATOR
+
+#define PB_DS_CLASS_C_DEC						\
+    PB_DS_CLASS_NAME<							\
+						Key,			\
+						Mapped,			\
+						Cmp_Fn,			\
+						Node_And_It_Traits,	\
+						Allocator>
+
+#define PB_DS_TYPES_TRAITS_C_DEC				\
+    types_traits<				\
+						Key,		\
+						Mapped,		\
+						Allocator,	\
+						false>
+
+#ifdef PB_DS_USE_MAP_DEBUG_BASE
+#define PB_DS_MAP_DEBUG_BASE_C_DEC					\
+    map_debug_base<					\
+								Key,	\
+								eq_by_less<Key, Cmp_Fn>, \
+								typename Allocator::template rebind< \
+												     Key>::other::const_reference>
+#endif // #ifdef PB_DS_USE_MAP_DEBUG_BASE
+
+#ifdef PB_DS_DATA_TRUE_INDICATOR
+#define PB_DS_V2F(X) (X).first
+#define PB_DS_V2S(X) (X).second
+#define PB_DS_EP2VP(X)& ((X)->m_value)
+#endif // #ifdef PB_DS_DATA_TRUE_INDICATOR
+
+#ifdef PB_DS_DATA_FALSE_INDICATOR
+#define PB_DS_V2F(X) (X)
+#define PB_DS_V2S(X) Mapped_Data()
+#define PB_DS_EP2VP(X)& ((X)->m_value.first)
+#endif // #ifdef PB_DS_DATA_FALSE_INDICATOR
+
+#ifdef PB_DS_TREE_TRACE
+#define PB_DS_TREE_TRACE_BASE_C_DEC					\
+    tree_trace_base<							\
+									typename Node_And_It_Traits::const_node_iterator, \
+									typename Node_And_It_Traits::node_iterator, \
+									Cmp_Fn,	\
+									true, \
+									Allocator>
+#endif // #ifdef PB_DS_TREE_TRACE
+
+    /**
+     * class description = "8i|\|4ree $34rc|-| 7r33 74813.">
+     **/
+    template<typename Key,
+	     typename Mapped,
+	     class Cmp_Fn,
+	     class Node_And_It_Traits,
+	     class Allocator>
+    class PB_DS_CLASS_NAME :
+#ifdef PB_DS_BIN_SEARCH_TREE_DEBUG_
+      public PB_DS_MAP_DEBUG_BASE_C_DEC,
+#endif // #ifdef PB_DS_BIN_SEARCH_TREE_DEBUG_
+#ifdef PB_DS_TREE_TRACE
+      public PB_DS_TREE_TRACE_BASE_C_DEC,
+#endif // #ifdef PB_DS_TREE_TRACE
+      public Cmp_Fn,
+      public PB_DS_TYPES_TRAITS_C_DEC,
+      public Node_And_It_Traits::node_update
+    {
+
+    protected:
+      typedef
+      typename Allocator::template rebind<
+      typename Node_And_It_Traits::node>::other
+      node_allocator;
+
+      typedef typename node_allocator::value_type node;
+
+      typedef typename node_allocator::pointer node_pointer;
+
+      typedef PB_DS_TYPES_TRAITS_C_DEC traits_base;
+
+      typedef
+      typename Node_And_It_Traits::null_node_update_pointer
+      null_node_update_pointer;
+
+    private:
+      typedef cond_dealtor< node, Allocator> cond_dealtor_t;
+
+#ifdef PB_DS_BIN_SEARCH_TREE_DEBUG_
+      typedef PB_DS_MAP_DEBUG_BASE_C_DEC map_debug_base;
+#endif // #ifdef PB_DS_BIN_SEARCH_TREE_DEBUG_
+
+    public:
+
+      typedef typename Allocator::size_type size_type;
+
+      typedef typename Allocator::difference_type difference_type;
+
+      typedef typename PB_DS_TYPES_TRAITS_C_DEC::key_type key_type;
+
+      typedef typename PB_DS_TYPES_TRAITS_C_DEC::key_pointer key_pointer;
+
+      typedef
+      typename PB_DS_TYPES_TRAITS_C_DEC::const_key_pointer
+      const_key_pointer;
+
+      typedef typename PB_DS_TYPES_TRAITS_C_DEC::key_reference key_reference;
+
+      typedef
+      typename PB_DS_TYPES_TRAITS_C_DEC::const_key_reference
+      const_key_reference;
+
+#ifdef PB_DS_DATA_TRUE_INDICATOR
+
+      typedef typename PB_DS_TYPES_TRAITS_C_DEC::mapped_type mapped_type;
+
+      typedef
+      typename PB_DS_TYPES_TRAITS_C_DEC::mapped_pointer
+      mapped_pointer;
+
+      typedef
+      typename PB_DS_TYPES_TRAITS_C_DEC::const_mapped_pointer
+      const_mapped_pointer;
+
+      typedef
+      typename PB_DS_TYPES_TRAITS_C_DEC::mapped_reference
+      mapped_reference;
+
+      typedef
+      typename PB_DS_TYPES_TRAITS_C_DEC::const_mapped_reference
+      const_mapped_reference;
+
+#endif // #ifdef PB_DS_DATA_TRUE_INDICATOR
+
+      typedef typename PB_DS_TYPES_TRAITS_C_DEC::value_type value_type;
+
+      typedef typename PB_DS_TYPES_TRAITS_C_DEC::pointer pointer;
+
+      typedef typename PB_DS_TYPES_TRAITS_C_DEC::const_pointer const_pointer;
+
+      typedef typename PB_DS_TYPES_TRAITS_C_DEC::reference reference;
+
+      typedef
+      typename PB_DS_TYPES_TRAITS_C_DEC::const_reference
+      const_reference;
+
+      typedef
+      typename Node_And_It_Traits::const_point_iterator
+      const_point_iterator;
+
+      typedef const_point_iterator const_iterator;
+
+      typedef typename Node_And_It_Traits::point_iterator point_iterator;
+
+      typedef point_iterator iterator;
+
+      typedef
+      typename Node_And_It_Traits::const_reverse_iterator
+      const_reverse_iterator;
+
+      typedef typename Node_And_It_Traits::reverse_iterator reverse_iterator;
+
+      typedef
+      typename Node_And_It_Traits::const_node_iterator
+      const_node_iterator;
+
+      typedef typename Node_And_It_Traits::node_iterator node_iterator;
+
+      typedef Cmp_Fn cmp_fn;
+
+      typedef Allocator allocator;
+
+      typedef typename Node_And_It_Traits::node_update node_update;
+
+    public:
+
+      PB_DS_CLASS_NAME();
+
+      PB_DS_CLASS_NAME(const Cmp_Fn& r_cmp_fn);
+
+      PB_DS_CLASS_NAME(const Cmp_Fn& r_cmp_fn, const node_update& r_update);
+
+      PB_DS_CLASS_NAME(const PB_DS_CLASS_C_DEC& other);
+
+      void
+      swap(PB_DS_CLASS_C_DEC& other);
+
+      ~PB_DS_CLASS_NAME();
+
+      inline bool
+      empty() const;
+
+      inline size_type
+      size() const;
+
+      inline size_type
+      max_size() const;
+
+      Cmp_Fn& 
+      get_cmp_fn();
+
+      const Cmp_Fn& 
+      get_cmp_fn() const;
+
+      inline point_iterator
+      lower_bound(const_key_reference r_key);
+
+      inline const_point_iterator
+      lower_bound(const_key_reference r_key) const;
+
+      inline point_iterator
+      upper_bound(const_key_reference r_key);
+
+      inline const_point_iterator
+      upper_bound(const_key_reference r_key) const;
+
+      inline point_iterator
+      find(const_key_reference r_key);
+
+      inline const_point_iterator
+      find(const_key_reference r_key) const;
+
+      inline iterator
+      begin();
+
+      inline const_iterator
+      begin() const;
+
+      inline iterator
+      end();
+
+      inline const_iterator
+      end() const;
+
+      inline reverse_iterator
+      rbegin();
+
+      inline const_reverse_iterator
+      rbegin() const;
+
+      inline reverse_iterator
+      rend();
+
+      inline const_reverse_iterator
+      rend() const;
+
+      inline const_node_iterator
+      node_begin() const;
+
+      inline node_iterator
+      node_begin();
+
+      inline const_node_iterator
+      node_end() const;
+
+      inline node_iterator
+      node_end();
+
+      void
+      clear();
+
+    protected:
+
+      void
+      value_swap(PB_DS_CLASS_C_DEC& other);
+
+      void
+      initialize_min_max();
+
+      inline iterator
+      insert_imp_empty(const_reference r_value);
+
+      inline iterator
+      insert_leaf_new(const_reference r_value, node_pointer p_nd, bool left_nd);
+
+      inline node_pointer
+      get_new_node_for_leaf_insert(const_reference r_val, false_type);
+
+      inline node_pointer
+      get_new_node_for_leaf_insert(const_reference r_val, true_type);
+
+      inline void
+      actual_erase_node(node_pointer p_nd);
+
+      inline std::pair<node_pointer, bool>
+      erase(node_pointer p_nd);
+
+      inline void
+      update_min_max_for_erased_node(node_pointer p_nd);
+
+      static void
+      clear_imp(node_pointer p_nd);
+
+      inline std::pair<
+	point_iterator,
+	bool>
+      insert_leaf(const_reference r_value);
+
+      inline void
+      rotate_left(node_pointer p_x);
+
+      inline void
+      rotate_right(node_pointer p_y);
+
+      inline void
+      rotate_parent(node_pointer p_nd);
+
+      inline void
+      apply_update(node_pointer p_nd, null_node_update_pointer);
+
+      template<typename Node_Update_>
+      inline void
+      apply_update(node_pointer p_nd, Node_Update_* p_update);
+
+      inline void
+      update_to_top(node_pointer p_nd, null_node_update_pointer);
+
+      template<typename Node_Update_>
+      inline void
+      update_to_top(node_pointer p_nd, Node_Update_* p_update);
+
+      bool
+      join_prep(PB_DS_CLASS_C_DEC& other);
+
+      void
+      join_finish(PB_DS_CLASS_C_DEC& other);
+
+      bool
+      split_prep(const_key_reference r_key, PB_DS_CLASS_C_DEC& other);
+
+      void
+      split_finish(PB_DS_CLASS_C_DEC& other);
+
+      size_type
+      recursive_count(node_pointer p_nd) const;
+
+#ifdef PB_DS_BIN_SEARCH_TREE_DEBUG_
+
+      void
+      assert_valid() const;
+
+      void
+      structure_only_assert_valid() const;
+
+      void
+      assert_node_consistent(const node_pointer p_nd) const;
+
+#endif // #ifdef PB_DS_BIN_SEARCH_TREE_DEBUG_
+
+    private:
+#ifdef PB_DS_BIN_SEARCH_TREE_DEBUG_
+
+      void
+      assert_iterators() const;
+
+      void
+      assert_consistent_with_debug_base() const;
+
+      void
+      assert_node_consistent_with_left(const node_pointer p_nd) const;
+
+      void
+      assert_node_consistent_with_right(const node_pointer p_nd) const;
+
+      void
+      assert_consistent_with_debug_base(const node_pointer p_nd) const;
+
+      void
+      assert_min() const;
+
+      void
+      assert_min_imp(const node_pointer p_nd) const;
+
+      void
+      assert_max() const;
+
+      void
+      assert_max_imp(const node_pointer p_nd) const;
+
+      void
+      assert_size() const;
+
+      typedef std::pair< const_pointer, const_pointer> node_consistent_t;
+
+      node_consistent_t
+      assert_node_consistent_(const node_pointer p_nd) const;
+
+#endif // #ifdef PB_DS_BIN_SEARCH_TREE_DEBUG_
+
+      void
+      initialize();
+
+      node_pointer
+      recursive_copy_node(const node_pointer p_nd);
+
+    protected:
+      node_pointer m_p_head;
+
+      size_type m_size;
+
+      static node_allocator s_node_allocator;
+    };
+
+#include <ext/pb_ds/detail/bin_search_tree_/constructors_destructor_fn_imps.hpp>
+#include <ext/pb_ds/detail/bin_search_tree_/iterators_fn_imps.hpp>
+#include <ext/pb_ds/detail/bin_search_tree_/debug_fn_imps.hpp>
+#include <ext/pb_ds/detail/bin_search_tree_/insert_fn_imps.hpp>
+#include <ext/pb_ds/detail/bin_search_tree_/erase_fn_imps.hpp>
+#include <ext/pb_ds/detail/bin_search_tree_/find_fn_imps.hpp>
+#include <ext/pb_ds/detail/bin_search_tree_/info_fn_imps.hpp>
+#include <ext/pb_ds/detail/bin_search_tree_/split_join_fn_imps.hpp>
+#include <ext/pb_ds/detail/bin_search_tree_/rotate_fn_imps.hpp>
+#include <ext/pb_ds/detail/bin_search_tree_/policy_access_fn_imps.hpp>
+
+#undef PB_DS_CLASS_C_DEC
+
+#undef PB_DS_CLASS_T_DEC
+
+#undef PB_DS_CLASS_NAME
+
+#undef PB_DS_TYPES_TRAITS_C_DEC
+
+#undef PB_DS_MAP_DEBUG_BASE_C_DEC
+
+#ifdef PB_DS_TREE_TRACE
+#undef PB_DS_TREE_TRACE_BASE_C_DEC
+#endif // #ifdef PB_DS_TREE_TRACE
+
+#undef PB_DS_V2F
+#undef PB_DS_EP2VP
+#undef PB_DS_V2S
+
+#undef PB_DS_DBG_ASSERT
+#undef PB_DS_DBG_VERIFY
+#undef PB_DS_DBG_ONLY
+
+  } // namespace detail
+} // namespace pb_ds
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/bin_search_tree_/cond_dtor_entry_dealtor.hpp b/libstdc++-v3/include/ext/pb_ds/detail/bin_search_tree_/cond_dtor_entry_dealtor.hpp
new file mode 100644
index 00000000000..d14d7bfaaa4
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/bin_search_tree_/cond_dtor_entry_dealtor.hpp
@@ -0,0 +1,76 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file cond_dtor_entry_dealtor.hpp
+ * Contains a binary tree container conditional deallocator
+ */
+
+class bin_search_tree_cond_dtor_entry_dealtor_
+{
+public:
+  inline
+  bin_search_tree_cond_dtor_entry_dealtor_(node_pointer p_nd) : m_p_nd(p_nd),
+								m_no_action_dtor(false)
+  { }
+
+  inline void
+  set_no_action_dtor()
+  {
+    m_no_action_dtor = true;
+  }
+
+  inline
+  ~bin_search_tree_cond_dtor_entry_dealtor_()
+  {
+    if (m_no_action_dtor)
+      return;
+
+    typename Allocator::template rebind<Node>::other().
+      deallocate(m_p_nd, 1);
+  }
+
+protected:
+  node_pointer m_p_nd;
+
+  bool m_no_action_dtor;
+};
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/bin_search_tree_/cond_key_dtor_entry_dealtor.hpp b/libstdc++-v3/include/ext/pb_ds/detail/bin_search_tree_/cond_key_dtor_entry_dealtor.hpp
new file mode 100644
index 00000000000..5373e548d3b
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/bin_search_tree_/cond_key_dtor_entry_dealtor.hpp
@@ -0,0 +1,87 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file cond_key_dtor_entry_dealtor.hpp
+ * Contains a binary tree container conditional deallocator
+ */
+
+class bin_seach_tree_cond_key_dtor_entry_dealtor_
+{
+public:
+  inline
+  bin_seach_tree_cond_key_dtor_entry_dealtor_(node_pointer p_nd) : m_p_nd(p_nd),
+								   m_no_action_dtor(false),
+								   m_key_destruct(false)
+  { }
+
+  inline void
+  set_no_action_dtor()
+  {
+    m_no_action_dtor = true;
+  }
+
+  inline void
+  set_key_destruct()
+  {
+    m_key_destruct = true;
+  }
+
+  inline
+  ~bin_seach_tree_cond_key_dtor_entry_dealtor_()
+  {
+    if (m_no_action_dtor)
+      return;
+
+    if (m_key_destruct)
+      m_p_nd->m_value.first.~Key();
+
+    bin_tree_base::s_alloc.deallocate(m_p_nd, 1);
+  }
+
+protected:
+  node_pointer m_p_nd;
+
+  bool m_no_action_dtor;
+
+  bool m_key_destruct;
+};
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/bin_search_tree_/constructors_destructor_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/bin_search_tree_/constructors_destructor_fn_imps.hpp
new file mode 100644
index 00000000000..aa758a01da7
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/bin_search_tree_/constructors_destructor_fn_imps.hpp
@@ -0,0 +1,257 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file constructors_destructor_fn_imps.hpp
+ * Contains an implementation class for bin_search_tree_.
+ */
+
+PB_DS_CLASS_T_DEC
+typename PB_DS_CLASS_C_DEC::node_allocator
+PB_DS_CLASS_C_DEC::s_node_allocator;
+
+PB_DS_CLASS_T_DEC
+PB_DS_CLASS_C_DEC::
+PB_DS_CLASS_NAME() :
+  m_p_head(s_node_allocator.allocate(1)),
+  m_size(0)
+{
+  initialize();
+
+  PB_DS_DBG_ONLY(structure_only_assert_valid();)
+    }
+
+PB_DS_CLASS_T_DEC
+PB_DS_CLASS_C_DEC::
+PB_DS_CLASS_NAME(const Cmp_Fn& r_cmp_fn) :
+  Cmp_Fn(r_cmp_fn),
+  m_p_head(s_node_allocator.allocate(1)),
+  m_size(0)
+{
+  initialize();
+
+  PB_DS_DBG_ONLY(structure_only_assert_valid();)
+    }
+
+PB_DS_CLASS_T_DEC
+PB_DS_CLASS_C_DEC::
+PB_DS_CLASS_NAME(const Cmp_Fn& r_cmp_fn, const node_update& r_node_update) :
+  Cmp_Fn(r_cmp_fn),
+  node_update(r_node_update),
+  m_p_head(s_node_allocator.allocate(1)),
+  m_size(0)
+{
+  initialize();
+
+  PB_DS_DBG_ONLY(structure_only_assert_valid();)
+    }
+
+PB_DS_CLASS_T_DEC
+PB_DS_CLASS_C_DEC::
+PB_DS_CLASS_NAME(const PB_DS_CLASS_C_DEC& other) :
+#ifdef PB_DS_BIN_SEARCH_TREE_DEBUG_
+  map_debug_base(other),
+#endif // #ifdef PB_DS_BIN_SEARCH_TREE_DEBUG_
+#ifdef PB_DS_TREE_TRACE
+  PB_DS_TREE_TRACE_BASE_C_DEC(other),
+#endif // #ifdef PB_DS_TREE_TRACE
+  Cmp_Fn(other),
+  node_update(other),
+  m_p_head(s_node_allocator.allocate(1)),
+  m_size(0)
+{
+  initialize();
+
+  m_size = other.m_size;
+
+  PB_DS_DBG_ONLY(other.structure_only_assert_valid();)
+
+    try
+      {
+        m_p_head->m_p_parent =
+	  recursive_copy_node(other.m_p_head->m_p_parent);
+
+        if (m_p_head->m_p_parent != NULL)
+	  m_p_head->m_p_parent->m_p_parent = m_p_head;
+
+        m_size = other.m_size;
+
+        initialize_min_max();
+      }
+    catch(...)
+      {
+        PB_DS_DBG_ONLY(map_debug_base::clear();)
+
+	  s_node_allocator.deallocate(m_p_head, 1);
+
+        throw;
+      }
+
+  PB_DS_DBG_ONLY(structure_only_assert_valid();)
+    }
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+swap(PB_DS_CLASS_C_DEC& other)
+{
+  PB_DS_DBG_ONLY(structure_only_assert_valid();)
+    PB_DS_DBG_ONLY(other.structure_only_assert_valid();)
+
+    value_swap(other);
+
+  std::swap((Cmp_Fn& )(*this), (Cmp_Fn& )other);
+
+  PB_DS_DBG_ONLY(structure_only_assert_valid();)
+    PB_DS_DBG_ONLY(other.structure_only_assert_valid();)
+    }
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+value_swap(PB_DS_CLASS_C_DEC& other)
+{
+  PB_DS_DBG_ONLY(map_debug_base::swap(other);)
+
+    std::swap(m_p_head, other.m_p_head);
+
+  std::swap(m_size, other.m_size);
+}
+
+PB_DS_CLASS_T_DEC
+PB_DS_CLASS_C_DEC::
+~PB_DS_CLASS_NAME()
+{
+  clear();
+
+  s_node_allocator.deallocate(m_p_head, 1);
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+initialize()
+{
+  m_p_head->m_p_parent = NULL;
+  m_p_head->m_p_left = m_p_head;
+  m_p_head->m_p_right = m_p_head;
+
+  m_size = 0;
+}
+
+PB_DS_CLASS_T_DEC
+typename PB_DS_CLASS_C_DEC::node_pointer
+PB_DS_CLASS_C_DEC::
+recursive_copy_node(const node_pointer p_nd)
+{
+  if (p_nd == NULL)
+    return (NULL);
+
+  node_pointer p_ret = s_node_allocator.allocate(1);
+
+  try
+    {
+      new (p_ret) node(*p_nd);
+    }
+  catch(...)
+    {
+      s_node_allocator.deallocate(p_ret, 1);
+
+      throw;
+    }
+
+  p_ret->m_p_left = p_ret->m_p_right = NULL;
+
+  try
+    {
+      p_ret->m_p_left = recursive_copy_node(p_nd->m_p_left);
+
+      p_ret->m_p_right = recursive_copy_node(p_nd->m_p_right);
+    }
+  catch(...)
+    {
+      clear_imp(p_ret);
+
+      throw;
+    }
+
+  if (p_ret->m_p_left != NULL)
+    p_ret->m_p_left->m_p_parent = p_ret;
+
+  if (p_ret->m_p_right != NULL)
+    p_ret->m_p_right->m_p_parent = p_ret;
+
+  PB_DS_DBG_ONLY(assert_node_consistent(p_ret);)
+
+    return (p_ret);
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+initialize_min_max()
+{
+  if (m_p_head->m_p_parent == NULL)
+    {
+      m_p_head->m_p_left = m_p_head->m_p_right = m_p_head;
+
+      return;
+    }
+
+  {
+    node_pointer p_min = m_p_head->m_p_parent;
+
+    while (p_min->m_p_left != NULL)
+      p_min = p_min->m_p_left;
+
+    m_p_head->m_p_left = p_min;
+  }
+
+  {
+    node_pointer p_max = m_p_head->m_p_parent;
+
+    while (p_max->m_p_right != NULL)
+      p_max = p_max->m_p_right;
+
+    m_p_head->m_p_right = p_max;
+  }
+}
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/bin_search_tree_/debug_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/bin_search_tree_/debug_fn_imps.hpp
new file mode 100644
index 00000000000..e6a7d2b33d5
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/bin_search_tree_/debug_fn_imps.hpp
@@ -0,0 +1,325 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file debug_fn_imps.hpp
+ * Contains an implementation class for bin_search_tree_.
+ */
+
+#ifdef PB_DS_BIN_SEARCH_TREE_DEBUG_
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+assert_valid() const
+{
+  structure_only_assert_valid();
+
+  assert_consistent_with_debug_base();
+
+  assert_size();
+
+  assert_iterators();
+
+  if (m_p_head->m_p_parent == NULL)
+    {
+      PB_DS_DBG_ASSERT(m_size == 0);
+    }
+  else
+    {
+      PB_DS_DBG_ASSERT(m_size > 0);
+    }
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+structure_only_assert_valid() const
+{
+  PB_DS_DBG_ASSERT(m_p_head != NULL);
+
+  if (m_p_head->m_p_parent == NULL)
+    {
+      PB_DS_DBG_ASSERT(m_p_head->m_p_left == m_p_head);
+      PB_DS_DBG_ASSERT(m_p_head->m_p_right == m_p_head);
+    }
+  else
+    {
+      PB_DS_DBG_ASSERT(m_p_head->m_p_parent->m_p_parent == m_p_head);
+
+      PB_DS_DBG_ASSERT(m_p_head->m_p_left != m_p_head);
+      PB_DS_DBG_ASSERT(m_p_head->m_p_right != m_p_head);
+    }
+
+  if (m_p_head->m_p_parent != NULL)
+    assert_node_consistent(m_p_head->m_p_parent);
+
+  assert_min();
+  assert_max();
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+assert_node_consistent(const node_pointer p_nd) const
+{
+  assert_node_consistent_(p_nd);
+}
+
+PB_DS_CLASS_T_DEC
+typename PB_DS_CLASS_C_DEC::node_consistent_t
+PB_DS_CLASS_C_DEC::
+assert_node_consistent_(const node_pointer p_nd) const
+{
+  if (p_nd == NULL)
+    return (std::make_pair((const_pointer)NULL,(const_pointer)NULL));
+
+  assert_node_consistent_with_left(p_nd);
+  assert_node_consistent_with_right(p_nd);
+
+  const std::pair<const_pointer, const_pointer>
+    l_range =
+    assert_node_consistent_(p_nd->m_p_left);
+
+  if (l_range.second != NULL)
+    PB_DS_DBG_ASSERT(Cmp_Fn::operator()(
+					PB_DS_V2F(*l_range.second),
+					PB_DS_V2F(p_nd->m_value)));
+
+  const std::pair<const_pointer, const_pointer>
+    r_range =
+    assert_node_consistent_(p_nd->m_p_right);
+
+  if (r_range.first != NULL)
+    PB_DS_DBG_ASSERT(Cmp_Fn::operator()(
+					PB_DS_V2F(p_nd->m_value),
+					PB_DS_V2F(*r_range.first)));
+
+  return (std::make_pair((l_range.first != NULL)? l_range.first :& p_nd->m_value,(r_range.second != NULL)? r_range.second :& p_nd->m_value));
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+assert_node_consistent_with_left(const node_pointer p_nd) const
+{
+  if (p_nd->m_p_left == NULL)
+    return;
+
+  PB_DS_DBG_ASSERT(p_nd->m_p_left->m_p_parent == p_nd);
+
+  PB_DS_DBG_ASSERT(!Cmp_Fn::operator()(
+				       PB_DS_V2F(p_nd->m_value),
+				       PB_DS_V2F(p_nd->m_p_left->m_value)));
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+assert_node_consistent_with_right(const node_pointer p_nd) const
+{
+  if (p_nd->m_p_right == NULL)
+    return;
+
+  PB_DS_DBG_ASSERT(p_nd->m_p_right->m_p_parent == p_nd);
+
+  PB_DS_DBG_ASSERT(!Cmp_Fn::operator()(
+				       PB_DS_V2F(p_nd->m_p_right->m_value),
+				       PB_DS_V2F(p_nd->m_value)));
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+assert_min() const
+{
+  assert_min_imp(m_p_head->m_p_parent);
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+assert_min_imp(const node_pointer p_nd) const
+{
+  if (p_nd == NULL)
+    {
+      PB_DS_DBG_ASSERT(m_p_head->m_p_left == m_p_head);
+
+      return;
+    }
+
+  if (p_nd->m_p_left == NULL)
+    {
+      PB_DS_DBG_ASSERT(p_nd == m_p_head->m_p_left);
+
+      return;
+    }
+
+  assert_min_imp(p_nd->m_p_left);
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+assert_max() const
+{
+  assert_max_imp(m_p_head->m_p_parent);
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+assert_max_imp(const node_pointer p_nd) const
+{
+  if (p_nd == NULL)
+    {
+      PB_DS_DBG_ASSERT(m_p_head->m_p_right == m_p_head);
+
+      return;
+    }
+
+  if (p_nd->m_p_right == NULL)
+    {
+      PB_DS_DBG_ASSERT(p_nd == m_p_head->m_p_right);
+
+      return;
+    }
+
+  assert_max_imp(p_nd->m_p_right);
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+assert_iterators() const
+{
+  size_type iterated_num = 0;
+
+  const_iterator prev_it = end();
+
+  for (const_iterator it = begin(); it != end(); ++it)
+    {
+      ++iterated_num;
+
+      PB_DS_DBG_ASSERT(lower_bound(
+				   PB_DS_V2F(*it)).m_p_nd == it.m_p_nd);
+
+      const_iterator upper_bound_it = upper_bound(
+						  PB_DS_V2F(*it));
+
+      --upper_bound_it;
+
+      PB_DS_DBG_ASSERT(upper_bound_it.m_p_nd == it.m_p_nd);
+
+      if (prev_it != end())
+	PB_DS_DBG_ASSERT(Cmp_Fn::operator()(
+					    PB_DS_V2F(*prev_it),
+					    PB_DS_V2F(*it)));
+
+      prev_it = it;
+    }
+
+  PB_DS_DBG_ASSERT(iterated_num == m_size);
+
+  size_type reverse_iterated_num = 0;
+
+  const_reverse_iterator reverse_prev_it = rend();
+
+  for (const_reverse_iterator reverse_it = rbegin(); reverse_it != rend();
+       ++reverse_it)
+    {
+      ++reverse_iterated_num;
+
+      PB_DS_DBG_ASSERT(lower_bound(
+				   PB_DS_V2F(*reverse_it)).m_p_nd == reverse_it.m_p_nd);
+
+      const_iterator upper_bound_it = upper_bound(
+						  PB_DS_V2F(*reverse_it));
+
+      --upper_bound_it;
+
+      PB_DS_DBG_ASSERT(upper_bound_it.m_p_nd == reverse_it.m_p_nd);
+
+      if (reverse_prev_it != rend())
+	PB_DS_DBG_ASSERT(!Cmp_Fn::operator()(
+					     PB_DS_V2F(*reverse_prev_it),
+					     PB_DS_V2F(*reverse_it)));
+
+      reverse_prev_it = reverse_it;
+    }
+
+  PB_DS_DBG_ASSERT(reverse_iterated_num == m_size);
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+assert_consistent_with_debug_base() const
+{
+  map_debug_base::check_size(m_size);
+
+  assert_consistent_with_debug_base(m_p_head->m_p_parent);
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+assert_consistent_with_debug_base(const node_pointer p_nd) const
+{
+  if (p_nd == NULL)
+    return;
+
+  map_debug_base::check_key_exists(
+				   PB_DS_V2F(p_nd->m_value));
+
+  assert_consistent_with_debug_base(p_nd->m_p_left);
+  assert_consistent_with_debug_base(p_nd->m_p_right);
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+assert_size() const
+{
+  PB_DS_DBG_ASSERT(recursive_count(m_p_head->m_p_parent) == m_size);
+}
+
+#endif // #ifdef PB_DS_BIN_SEARCH_TREE_DEBUG_
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/bin_search_tree_/erase_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/bin_search_tree_/erase_fn_imps.hpp
new file mode 100644
index 00000000000..d34368bbb52
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/bin_search_tree_/erase_fn_imps.hpp
@@ -0,0 +1,126 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file erase_fn_imps.hpp
+ * Contains an implementation class for bin_search_tree_.
+ */
+
+PB_DS_CLASS_T_DEC
+inline void
+PB_DS_CLASS_C_DEC::
+actual_erase_node(node_pointer p_z)
+{
+  PB_DS_DBG_ASSERT(m_size > 0);
+  --m_size;
+
+  PB_DS_DBG_ONLY(erase_existing(PB_DS_V2F(p_z->m_value)));
+
+  p_z->~node();
+
+  s_node_allocator.deallocate(p_z, 1);
+}
+
+PB_DS_CLASS_T_DEC
+inline void
+PB_DS_CLASS_C_DEC::
+update_min_max_for_erased_node(node_pointer p_z)
+{
+  if (m_size == 1)
+    {
+      m_p_head->m_p_left = m_p_head->m_p_right = m_p_head;
+
+      return;
+    }
+
+  if (m_p_head->m_p_left == p_z)
+    {
+      iterator it(p_z);
+
+      ++it;
+
+      m_p_head->m_p_left = it.m_p_nd;
+    }
+  else if (m_p_head->m_p_right == p_z)
+    {
+      iterator it(p_z);
+
+      --it;
+
+      m_p_head->m_p_right = it.m_p_nd;
+    }
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+clear()
+{
+  PB_DS_DBG_ONLY(structure_only_assert_valid();)
+
+    clear_imp(m_p_head->m_p_parent);
+
+  m_size = 0;
+
+  initialize();
+
+  PB_DS_DBG_ONLY(map_debug_base::clear();)
+
+    PB_DS_DBG_ONLY(structure_only_assert_valid();)
+    }
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+clear_imp(node_pointer p_nd)
+{
+  if (p_nd == NULL)
+    return;
+
+  clear_imp(p_nd->m_p_left);
+
+  clear_imp(p_nd->m_p_right);
+
+  p_nd->~node();
+
+  s_node_allocator.deallocate(p_nd, 1);
+}
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/bin_search_tree_/find_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/bin_search_tree_/find_fn_imps.hpp
new file mode 100644
index 00000000000..0e79040280b
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/bin_search_tree_/find_fn_imps.hpp
@@ -0,0 +1,188 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file find_fn_imps.hpp
+ * Contains an implementation class for bin_search_tree_.
+ */
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::const_point_iterator
+PB_DS_CLASS_C_DEC::
+lower_bound(const_key_reference r_key) const
+{
+  node_pointer p_pot = m_p_head;
+  node_pointer p_nd = m_p_head->m_p_parent;
+
+  while (p_nd != NULL)
+    if (Cmp_Fn::operator()(
+			   PB_DS_V2F(p_nd->m_value),
+			   r_key))
+      p_nd = p_nd->m_p_right;
+    else
+      {
+	p_pot = p_nd;
+
+	p_nd = p_nd->m_p_left;
+      }
+
+  return (iterator(p_pot));
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::point_iterator
+PB_DS_CLASS_C_DEC::
+lower_bound(const_key_reference r_key)
+{
+  node_pointer p_pot = m_p_head;
+  node_pointer p_nd = m_p_head->m_p_parent;
+
+  while (p_nd != NULL)
+    if (Cmp_Fn::operator()(
+			   PB_DS_V2F(p_nd->m_value),
+			   r_key))
+      p_nd = p_nd->m_p_right;
+    else
+      {
+	p_pot = p_nd;
+
+	p_nd = p_nd->m_p_left;
+      }
+
+  return (iterator(p_pot));
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::const_point_iterator
+PB_DS_CLASS_C_DEC::
+upper_bound(const_key_reference r_key) const
+{
+  node_pointer p_pot = m_p_head;
+  node_pointer p_nd = m_p_head->m_p_parent;
+
+  while (p_nd != NULL)
+    if (Cmp_Fn::operator()(r_key,
+			   PB_DS_V2F(p_nd->m_value)))
+      {
+	p_pot = p_nd,
+
+	  p_nd = p_nd->m_p_left;
+      }
+    else
+      p_nd = p_nd->m_p_right;
+
+  return (const_iterator(p_pot));
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::point_iterator
+PB_DS_CLASS_C_DEC::
+upper_bound(const_key_reference r_key)
+{
+  node_pointer p_pot = m_p_head;
+  node_pointer p_nd = m_p_head->m_p_parent;
+
+  while (p_nd != NULL)
+    if (Cmp_Fn::operator()(r_key,
+			   PB_DS_V2F(p_nd->m_value)))
+      {
+	p_pot = p_nd,
+
+	  p_nd = p_nd->m_p_left;
+      }
+    else
+      p_nd = p_nd->m_p_right;
+
+  return (point_iterator(p_pot));
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::point_iterator
+PB_DS_CLASS_C_DEC::
+find(const_key_reference r_key)
+{
+  PB_DS_DBG_ONLY(structure_only_assert_valid();)
+
+    node_pointer p_pot = m_p_head;
+  node_pointer p_nd = m_p_head->m_p_parent;
+
+  while (p_nd != NULL)
+    if (!Cmp_Fn::operator()(PB_DS_V2F(p_nd->m_value), r_key))
+      {
+	p_pot = p_nd;
+
+	p_nd = p_nd->m_p_left;
+      }
+    else
+      p_nd = p_nd->m_p_right;
+
+  return point_iterator((p_pot != m_p_head&&  Cmp_Fn::operator()(
+								 r_key,
+								 PB_DS_V2F(p_pot->m_value)))?
+			m_p_head : p_pot);
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::const_point_iterator
+PB_DS_CLASS_C_DEC::
+find(const_key_reference r_key) const
+{
+  PB_DS_DBG_ONLY(structure_only_assert_valid();)
+
+    node_pointer p_pot = m_p_head;
+  node_pointer p_nd = m_p_head->m_p_parent;
+
+  while (p_nd != NULL)
+    if (!Cmp_Fn::operator()(PB_DS_V2F(p_nd->m_value), r_key))
+      {
+	p_pot = p_nd;
+
+	p_nd = p_nd->m_p_left;
+      }
+    else
+      p_nd = p_nd->m_p_right;
+
+  return const_point_iterator((p_pot != m_p_head&&  Cmp_Fn::operator()(
+								       r_key,
+								       PB_DS_V2F(p_pot->m_value)))?
+			      m_p_head : p_pot);
+}
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/bin_search_tree_/info_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/bin_search_tree_/info_fn_imps.hpp
new file mode 100644
index 00000000000..4381efe3dc5
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/bin_search_tree_/info_fn_imps.hpp
@@ -0,0 +1,70 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file info_fn_imps.hpp
+ * Contains an implementation class for bin_search_tree_.
+ */
+
+PB_DS_CLASS_T_DEC
+inline bool
+PB_DS_CLASS_C_DEC::
+empty() const
+{
+  return (m_size == 0);
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::size_type
+PB_DS_CLASS_C_DEC::
+size() const
+{
+  return (m_size);
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::size_type
+PB_DS_CLASS_C_DEC::
+max_size() const
+{
+  return (s_node_allocator.max_size());
+}
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/bin_search_tree_/insert_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/bin_search_tree_/insert_fn_imps.hpp
new file mode 100644
index 00000000000..2bad1d0ef91
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/bin_search_tree_/insert_fn_imps.hpp
@@ -0,0 +1,217 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file insert_fn_imps.hpp
+ * Contains an implementation class for bin_search_tree_.
+ */
+
+PB_DS_CLASS_T_DEC
+inline std::pair<typename PB_DS_CLASS_C_DEC::point_iterator, bool>
+PB_DS_CLASS_C_DEC::
+insert_leaf(const_reference r_value)
+{
+  PB_DS_DBG_ONLY(structure_only_assert_valid();)
+
+    if (m_size == 0)
+      return (std::make_pair(
+			     insert_imp_empty(r_value),
+			     true));
+
+  node_pointer p_nd = m_p_head->m_p_parent;
+  node_pointer p_pot = m_p_head;
+
+  while (p_nd != NULL)
+    if (!Cmp_Fn::operator()(
+			    PB_DS_V2F(p_nd->m_value),
+			    PB_DS_V2F(r_value)))
+      {
+	p_pot = p_nd;
+
+	p_nd = p_nd->m_p_left;
+      }
+    else
+      p_nd = p_nd->m_p_right;
+
+  if (p_pot == m_p_head)
+    return (std::make_pair(
+			   insert_leaf_new(r_value,  m_p_head->m_p_right, false),
+			   true));
+
+  if (!Cmp_Fn::operator()(
+			  PB_DS_V2F(r_value),
+			  PB_DS_V2F(p_pot->m_value)))
+    {
+      PB_DS_DBG_ONLY(structure_only_assert_valid();)
+
+        PB_DS_DBG_ONLY(map_debug_base::check_key_exists(
+							PB_DS_V2F(r_value)));
+
+      return (std::make_pair(p_pot, false));
+    }
+
+  PB_DS_DBG_ONLY(map_debug_base::check_key_does_not_exist(
+							  PB_DS_V2F(r_value)));
+
+  p_nd = p_pot->m_p_left;
+  if (p_nd == NULL)
+    return (std::make_pair(
+			   insert_leaf_new(r_value, p_pot, true),
+			   true));
+
+  while (p_nd->m_p_right != NULL)
+    p_nd = p_nd->m_p_right;
+
+  return (std::make_pair(
+			 insert_leaf_new(r_value, p_nd, false),
+			 true));
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::iterator
+PB_DS_CLASS_C_DEC::
+insert_leaf_new(const_reference r_value, node_pointer p_nd, bool left_nd)
+{
+  node_pointer p_new_nd =
+    get_new_node_for_leaf_insert(            r_value, traits_base::m_no_throw_copies_indicator);
+
+  if (left_nd)
+    {
+      PB_DS_DBG_ASSERT(p_nd->m_p_left == NULL);
+      PB_DS_DBG_ASSERT(Cmp_Fn::operator()(
+					  PB_DS_V2F(r_value),
+					  PB_DS_V2F(p_nd->m_value)));
+
+      p_nd->m_p_left = p_new_nd;
+
+      if (m_p_head->m_p_left == p_nd)
+	m_p_head->m_p_left = p_new_nd;
+    }
+  else
+    {
+      PB_DS_DBG_ASSERT(p_nd->m_p_right == NULL);
+      PB_DS_DBG_ASSERT(Cmp_Fn::operator()(
+					  PB_DS_V2F(p_nd->m_value),
+					  PB_DS_V2F(r_value)));
+
+      p_nd->m_p_right = p_new_nd;
+
+      if (m_p_head->m_p_right == p_nd)
+	m_p_head->m_p_right = p_new_nd;
+    }
+
+  p_new_nd->m_p_parent = p_nd;
+
+  p_new_nd->m_p_left = p_new_nd->m_p_right = NULL;
+
+  PB_DS_DBG_ONLY(assert_node_consistent(p_nd));
+
+  update_to_top(p_new_nd, (node_update* )this);
+
+  PB_DS_DBG_ONLY(map_debug_base::insert_new(
+					    PB_DS_V2F(r_value)));
+
+  return (iterator(p_new_nd));
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::iterator
+PB_DS_CLASS_C_DEC::
+insert_imp_empty(const_reference r_value)
+{
+  node_pointer p_new_node =
+    get_new_node_for_leaf_insert(        r_value, traits_base::m_no_throw_copies_indicator);
+
+  m_p_head->m_p_left = m_p_head->m_p_right =
+    m_p_head->m_p_parent = p_new_node;
+
+  p_new_node->m_p_parent = m_p_head;
+
+  p_new_node->m_p_left = p_new_node->m_p_right = NULL;
+
+  PB_DS_DBG_ONLY(map_debug_base::insert_new(
+					    PB_DS_V2F(r_value)));
+
+  update_to_top(m_p_head->m_p_parent, (node_update* )this);
+
+  return (iterator(p_new_node));
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::node_pointer
+PB_DS_CLASS_C_DEC::
+get_new_node_for_leaf_insert(const_reference r_val, false_type)
+{
+  node_pointer p_new_nd = s_node_allocator.allocate(1);
+
+  cond_dealtor_t cond(p_new_nd);
+
+  new (const_cast<void* >(
+			  static_cast<const void* >(&p_new_nd->m_value)))
+    typename node::value_type(r_val);
+
+  cond.set_no_action();
+
+  p_new_nd->m_p_left = p_new_nd->m_p_right = NULL;
+
+  ++m_size;
+
+  return (p_new_nd);
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::node_pointer
+PB_DS_CLASS_C_DEC::
+get_new_node_for_leaf_insert(const_reference r_val, true_type)
+{
+  node_pointer p_new_nd = s_node_allocator.allocate(1);
+
+  new (const_cast<void* >(
+			  static_cast<const void* >(&p_new_nd->m_value)))
+    typename node::value_type(r_val);
+
+  p_new_nd->m_p_left = p_new_nd->m_p_right = NULL;
+
+  ++m_size;
+
+  return (p_new_nd);
+}
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/bin_search_tree_/iterators_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/bin_search_tree_/iterators_fn_imps.hpp
new file mode 100644
index 00000000000..3132a423721
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/bin_search_tree_/iterators_fn_imps.hpp
@@ -0,0 +1,142 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file iterators_fn_imps.hpp
+ * Contains an implementation class for bin_search_tree_.
+ */
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::iterator
+PB_DS_CLASS_C_DEC::
+begin()
+{
+  return (iterator(m_p_head->m_p_left));
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::const_iterator
+PB_DS_CLASS_C_DEC::
+begin() const
+{
+  return (const_iterator(m_p_head->m_p_left));
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::iterator
+PB_DS_CLASS_C_DEC::
+end()
+{
+  return (iterator(m_p_head));
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::const_iterator
+PB_DS_CLASS_C_DEC::
+end() const
+{
+  return (const_iterator(m_p_head));
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::const_reverse_iterator
+PB_DS_CLASS_C_DEC::
+rbegin() const
+{
+  return (const_reverse_iterator(m_p_head->m_p_right));
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::reverse_iterator
+PB_DS_CLASS_C_DEC::
+rbegin()
+{
+  return (reverse_iterator(m_p_head->m_p_right));
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::reverse_iterator
+PB_DS_CLASS_C_DEC::
+rend()
+{
+  return (reverse_iterator(m_p_head));
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::const_reverse_iterator
+PB_DS_CLASS_C_DEC::
+rend() const
+{
+  return (const_reverse_iterator(m_p_head));
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::const_node_iterator
+PB_DS_CLASS_C_DEC::
+node_begin() const
+{
+  return (const_node_iterator(m_p_head->m_p_parent));
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::node_iterator
+PB_DS_CLASS_C_DEC::
+node_begin()
+{
+  return (node_iterator(m_p_head->m_p_parent));
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::const_node_iterator
+PB_DS_CLASS_C_DEC::
+node_end() const
+{
+  return (const_node_iterator(NULL));
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::node_iterator
+PB_DS_CLASS_C_DEC::
+node_end()
+{
+  return (node_iterator(NULL));
+}
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/bin_search_tree_/node_iterators.hpp b/libstdc++-v3/include/ext/pb_ds/detail/bin_search_tree_/node_iterators.hpp
new file mode 100644
index 00000000000..ce1cd22b011
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/bin_search_tree_/node_iterators.hpp
@@ -0,0 +1,243 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file node_iterators.hpp
+ * Contains an implementation class for bin_search_tree_.
+ */
+
+#ifndef PB_DS_BIN_SEARCH_TREE_NODE_ITERATORS_HPP
+#define PB_DS_BIN_SEARCH_TREE_NODE_ITERATORS_HPP
+
+#include <ext/pb_ds/tag_and_trait.hpp>
+
+namespace pb_ds
+{
+  namespace detail
+  {
+
+#define PB_DS_TREE_CONST_NODE_ITERATOR_CLASS_C_DEC			\
+    bin_search_tree_const_node_it_<					\
+							Node,		\
+							Const_Iterator,	\
+							Iterator,	\
+							Allocator>
+
+    // Const node iterator.
+    template<typename Node,
+	     class Const_Iterator,
+	     class Iterator,
+	     class Allocator>
+    class bin_search_tree_const_node_it_
+    {
+    private:
+
+    private:
+      typedef
+      typename Allocator::template rebind<
+      Node>::other::pointer
+      node_pointer;
+
+    public:
+
+      // Category.
+      typedef trivial_iterator_tag iterator_category;
+
+      // Difference type.
+      typedef trivial_iterator_difference_type difference_type;
+
+      // __Iterator's value type.
+      typedef Const_Iterator value_type;
+
+      // __Iterator's reference type.
+      typedef Const_Iterator reference;
+
+      // __Iterator's __const reference type.
+      typedef Const_Iterator const_reference;
+
+      // Metadata type.
+      typedef typename Node::metadata_type metadata_type;
+
+      // Const metadata reference type.
+      typedef
+      typename Allocator::template rebind<
+	metadata_type>::other::const_reference
+      const_metadata_reference;
+
+    public:
+
+      // Default constructor.
+      /*
+	inline
+	bin_search_tree_const_node_it_()
+      */
+
+      inline
+      bin_search_tree_const_node_it_(const node_pointer p_nd = NULL) : m_p_nd(const_cast<node_pointer>(p_nd))
+      { }
+
+      // Access.
+      inline const_reference
+      operator*() const
+      {
+	return (Const_Iterator(m_p_nd));
+      }
+
+      // Metadata access.
+      inline const_metadata_reference
+      get_metadata() const
+      {
+	return (m_p_nd->get_metadata());
+      }
+
+      // Returns the __const node iterator associated with the left node.
+      inline PB_DS_TREE_CONST_NODE_ITERATOR_CLASS_C_DEC
+      get_l_child() const
+      {
+	return (PB_DS_TREE_CONST_NODE_ITERATOR_CLASS_C_DEC(m_p_nd->m_p_left));
+      }
+
+      // Returns the __const node iterator associated with the right node.
+      inline PB_DS_TREE_CONST_NODE_ITERATOR_CLASS_C_DEC
+      get_r_child() const
+      {
+	return (PB_DS_TREE_CONST_NODE_ITERATOR_CLASS_C_DEC(m_p_nd->m_p_right));
+      }
+
+      // Compares to a different iterator object.
+      inline bool
+      operator==(const PB_DS_TREE_CONST_NODE_ITERATOR_CLASS_C_DEC& other) const
+      {
+	return (m_p_nd == other.m_p_nd);
+      }
+
+      // Compares (negatively) to a different iterator object.
+      inline bool
+      operator!=(const PB_DS_TREE_CONST_NODE_ITERATOR_CLASS_C_DEC& other) const
+      {
+	return (m_p_nd != other.m_p_nd);
+      }
+
+    public:
+      node_pointer m_p_nd;
+    };
+
+#define PB_DS_TREE_NODE_ITERATOR_CLASS_C_DEC			\
+    bin_search_tree_node_it_<					\
+						Node,		\
+						Const_Iterator, \
+						Iterator,	\
+						Allocator>
+
+    // Node iterator.
+    template<typename Node,
+	     class Const_Iterator,
+	     class Iterator,
+	     class Allocator>
+    class bin_search_tree_node_it_ : 
+      public PB_DS_TREE_CONST_NODE_ITERATOR_CLASS_C_DEC
+
+    {
+
+    private:
+      typedef
+      typename Allocator::template rebind<
+      Node>::other::pointer
+      node_pointer;
+
+    public:
+
+      // __Iterator's value type.
+      typedef Iterator value_type;
+
+      // __Iterator's reference type.
+      typedef Iterator reference;
+
+      // __Iterator's __const reference type.
+      typedef Iterator const_reference;
+
+    public:
+
+      // Default constructor.
+      /*
+	inline
+	bin_search_tree_node_it_();
+      */
+
+      inline
+      bin_search_tree_node_it_(const node_pointer p_nd = NULL) : PB_DS_TREE_CONST_NODE_ITERATOR_CLASS_C_DEC(
+													    const_cast<node_pointer>(p_nd))
+      { }
+
+      // Access.
+      inline Iterator
+      operator*() const
+      {
+	return (Iterator(PB_DS_TREE_CONST_NODE_ITERATOR_CLASS_C_DEC::m_p_nd));
+      }
+
+      // Returns the node iterator associated with the left node.
+      inline PB_DS_TREE_NODE_ITERATOR_CLASS_C_DEC
+      get_l_child() const
+      {
+	return (PB_DS_TREE_NODE_ITERATOR_CLASS_C_DEC(
+						     PB_DS_TREE_CONST_NODE_ITERATOR_CLASS_C_DEC::m_p_nd->m_p_left));
+      }
+
+      // Returns the node iterator associated with the right node.
+      inline PB_DS_TREE_NODE_ITERATOR_CLASS_C_DEC
+      get_r_child() const
+      {
+	return (PB_DS_TREE_NODE_ITERATOR_CLASS_C_DEC(
+						     PB_DS_TREE_CONST_NODE_ITERATOR_CLASS_C_DEC::m_p_nd->m_p_right));
+      }
+
+    };
+
+#undef PB_DS_TREE_CONST_NODE_ITERATOR_CLASS_C_DEC
+
+#undef PB_DS_TREE_NODE_ITERATOR_CLASS_C_DEC
+
+  } // namespace detail
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_BIN_SEARCH_TREE_NODE_ITERATORS_HPP
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/bin_search_tree_/point_iterators.hpp b/libstdc++-v3/include/ext/pb_ds/detail/bin_search_tree_/point_iterators.hpp
new file mode 100644
index 00000000000..bf320241b1d
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/bin_search_tree_/point_iterators.hpp
@@ -0,0 +1,461 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file point_iterators.hpp
+ * Contains an implementation class for bin_search_tree_.
+ */
+
+#ifndef PB_DS_BIN_SEARCH_TREE_FIND_ITERATORS_HPP
+#define PB_DS_BIN_SEARCH_TREE_FIND_ITERATORS_HPP
+
+#ifdef PB_DS_BIN_SEARCH_TREE_DEBUG_
+#include <cassert>
+#endif // #ifdef PB_DS_BIN_SEARCH_TREE_DEBUG_
+#include <ext/pb_ds/tag_and_trait.hpp>
+
+namespace pb_ds
+{
+  namespace detail
+  {
+
+#define PB_DS_TREE_CONST_IT_C_DEC					\
+    bin_search_tree_const_it_<						\
+						Node_Pointer,		\
+						Value_Type,		\
+						Pointer,		\
+						Const_Pointer,		\
+						Reference,		\
+						Const_Reference,	\
+						Is_Forward_Iterator,	\
+						Allocator>
+
+#define PB_DS_TREE_CONST_ODIR_IT_C_DEC					\
+    bin_search_tree_const_it_<						\
+						Node_Pointer,		\
+						Value_Type,		\
+						Pointer,		\
+						Const_Pointer,		\
+						Reference,		\
+						Const_Reference,	\
+						!Is_Forward_Iterator,	\
+						Allocator>
+
+#define PB_DS_TREE_IT_C_DEC						\
+    bin_search_tree_it_<						\
+						Node_Pointer,		\
+						Value_Type,		\
+						Pointer,		\
+						Const_Pointer,		\
+						Reference,		\
+						Const_Reference,	\
+						Is_Forward_Iterator,	\
+						Allocator>
+
+#define PB_DS_TREE_ODIR_IT_C_DEC					\
+    bin_search_tree_it_<						\
+							Node_Pointer,	\
+							Value_Type,	\
+							Pointer,	\
+							Const_Pointer,	\
+							Reference,	\
+							Const_Reference, \
+							!Is_Forward_Iterator, \
+							Allocator>
+
+#ifdef PB_DS_BIN_SEARCH_TREE_DEBUG_
+#define PB_DS_DBG_ASSERT(X) assert(X)
+#define PB_DS_DBG_VERIFY(X) assert(X)
+#define PB_DS_DBG_ONLY(X) X
+#else // #ifdef PB_DS_BIN_SEARCH_TREE_DEBUG_
+#define PB_DS_DBG_ASSERT(X)
+#define PB_DS_DBG_VERIFY(X) {if((X)==0);}
+#define PB_DS_DBG_ONLY(X) ;
+#endif // #ifdef PB_DS_BIN_SEARCH_TREE_DEBUG_
+
+    // Const iterator.
+    template<typename Node_Pointer,
+	     typename Value_Type,
+	     typename Pointer,
+	     typename Const_Pointer,
+	     typename Reference,
+	     typename Const_Reference,
+	     bool Is_Forward_Iterator,
+	     class Allocator>
+    class bin_search_tree_const_it_
+    {
+
+    public:
+
+      typedef std::bidirectional_iterator_tag iterator_category;
+
+      typedef typename Allocator::difference_type difference_type;
+
+      typedef Value_Type value_type;
+
+      typedef Pointer pointer;
+
+      typedef Const_Pointer const_pointer;
+
+      typedef Reference reference;
+
+      typedef Const_Reference const_reference;
+
+    public:
+
+      inline
+      bin_search_tree_const_it_(const Node_Pointer p_nd = NULL) : m_p_nd(const_cast<Node_Pointer>(p_nd))
+      { }
+
+      inline
+      bin_search_tree_const_it_(const PB_DS_TREE_CONST_ODIR_IT_C_DEC& 
+				other) : m_p_nd(other.m_p_nd)
+      { }
+
+      inline
+      PB_DS_TREE_CONST_IT_C_DEC& 
+      operator=(const PB_DS_TREE_CONST_IT_C_DEC& 
+		other)
+      {
+	m_p_nd = other.m_p_nd;
+
+	return (*this);
+      }
+
+      inline
+      PB_DS_TREE_CONST_IT_C_DEC& 
+      operator=(const PB_DS_TREE_CONST_ODIR_IT_C_DEC& 
+		other)
+      {
+	m_p_nd = other.m_p_nd;
+
+	return (*this);
+      }
+
+      inline const_pointer
+      operator->() const
+      {
+	PB_DS_DBG_ASSERT(m_p_nd != NULL);
+
+	return (&m_p_nd->m_value);
+      }
+
+      inline const_reference
+      operator*() const
+      {
+	PB_DS_DBG_ASSERT(m_p_nd != NULL);
+
+	return (m_p_nd->m_value);
+      }
+
+      inline bool
+      operator==(const PB_DS_TREE_CONST_IT_C_DEC
+		 & other) const
+      {
+	return (m_p_nd == other.m_p_nd);
+      }
+
+      inline bool
+      operator==(const PB_DS_TREE_CONST_ODIR_IT_C_DEC
+		 & other) const
+      {
+	return (m_p_nd == other.m_p_nd);
+      }
+
+      inline bool
+      operator!=(const PB_DS_TREE_CONST_IT_C_DEC& 
+		 other) const
+      {
+	return (m_p_nd != other.m_p_nd);
+      }
+
+      inline bool
+      operator!=(const PB_DS_TREE_CONST_ODIR_IT_C_DEC& 
+		 other) const
+      {
+	return (m_p_nd != other.m_p_nd);
+      }
+
+      inline PB_DS_TREE_CONST_IT_C_DEC& 
+      operator++()
+      {
+	PB_DS_DBG_ASSERT(m_p_nd != NULL);
+
+	inc(integral_constant<int,Is_Forward_Iterator>());
+
+	return (*this);
+      }
+
+      inline PB_DS_TREE_CONST_IT_C_DEC
+      operator++(int)
+      {
+	PB_DS_TREE_CONST_IT_C_DEC
+	  ret_it(m_p_nd);
+
+	operator++();
+
+	return (ret_it);
+      }
+
+      inline PB_DS_TREE_CONST_IT_C_DEC& 
+      operator--()
+      {
+	dec(integral_constant<int,Is_Forward_Iterator>());
+
+	return (*this);
+      }
+
+      inline PB_DS_TREE_CONST_IT_C_DEC
+      operator--(int)
+      {
+	PB_DS_TREE_CONST_IT_C_DEC
+	  ret_it(m_p_nd);
+
+	operator--();
+
+	return (ret_it);
+      }
+
+    protected:
+      inline void
+      inc(false_type)
+      {
+	dec(true_type());
+      }
+
+      void
+      inc(true_type)
+      {
+	if (m_p_nd->special()&& 
+	    m_p_nd->m_p_parent->m_p_parent == m_p_nd)
+	  {
+	    m_p_nd = m_p_nd->m_p_left;
+
+	    return;
+	  }
+
+	if (m_p_nd->m_p_right != NULL)
+	  {
+	    m_p_nd = m_p_nd->m_p_right;
+
+	    while (m_p_nd->m_p_left != NULL)
+	      m_p_nd = m_p_nd->m_p_left;
+
+	    return;
+	  }
+
+	Node_Pointer p_y = m_p_nd->m_p_parent;
+
+	while (m_p_nd == p_y->m_p_right)
+	  {
+	    m_p_nd = p_y;
+
+	    p_y = p_y->m_p_parent;
+	  }
+
+	if (m_p_nd->m_p_right != p_y)
+	  m_p_nd = p_y;
+      }
+
+      inline void
+      dec(false_type)
+      {
+	inc(true_type());
+      }
+
+      void
+      dec(true_type)
+      {
+	if (m_p_nd->special()&& 
+	    m_p_nd->m_p_parent->m_p_parent == m_p_nd)
+	  {
+	    m_p_nd = m_p_nd->m_p_right;
+
+	    return;
+	  }
+
+	if (m_p_nd->m_p_left != NULL)
+	  {
+	    Node_Pointer p_y = m_p_nd->m_p_left;
+
+	    while (p_y->m_p_right != NULL)
+	      p_y = p_y->m_p_right;
+
+	    m_p_nd = p_y;
+
+	    return;
+	  }
+
+	Node_Pointer p_y = m_p_nd->m_p_parent;
+
+	while (m_p_nd == p_y->m_p_left)
+	  {
+	    m_p_nd = p_y;
+
+	    p_y = p_y->m_p_parent;
+	  }
+
+	if (m_p_nd->m_p_left != p_y)
+	  m_p_nd = p_y;
+      }
+
+    public:
+      Node_Pointer m_p_nd;
+    };
+
+    // Iterator.
+    template<typename Node_Pointer,
+	     typename Value_Type,
+	     typename Pointer,
+	     typename Const_Pointer,
+	     typename Reference,
+	     typename Const_Reference,
+	     bool Is_Forward_Iterator,
+	     class Allocator>
+    class bin_search_tree_it_ : 
+      public PB_DS_TREE_CONST_IT_C_DEC
+
+    {
+
+    public:
+
+      inline
+      bin_search_tree_it_(const Node_Pointer p_nd = NULL) : PB_DS_TREE_CONST_IT_C_DEC((Node_Pointer)p_nd)
+      { }
+
+      inline
+      bin_search_tree_it_(const PB_DS_TREE_ODIR_IT_C_DEC& other) : PB_DS_TREE_CONST_IT_C_DEC(other.m_p_nd)
+      { }
+
+      inline
+      PB_DS_TREE_IT_C_DEC& 
+      operator=(const PB_DS_TREE_IT_C_DEC& other)
+      {
+	base_it_type::m_p_nd = other.m_p_nd;
+
+	return (*this);
+      }
+
+      inline
+      PB_DS_TREE_IT_C_DEC& 
+      operator=(const PB_DS_TREE_ODIR_IT_C_DEC& other)
+      {
+	base_it_type::m_p_nd = other.m_p_nd;
+
+	return (*this);
+      }
+
+      inline typename PB_DS_TREE_CONST_IT_C_DEC::pointer
+      operator->() const
+      {
+	PB_DS_DBG_ASSERT(base_it_type::m_p_nd != NULL);
+
+	return (&base_it_type::m_p_nd->m_value);
+      }
+
+      inline typename PB_DS_TREE_CONST_IT_C_DEC::reference
+      operator*() const
+      {
+	PB_DS_DBG_ASSERT(base_it_type::m_p_nd != NULL);
+
+	return (base_it_type::m_p_nd->m_value);
+      }
+
+      inline PB_DS_TREE_IT_C_DEC& 
+      operator++()
+      {
+	PB_DS_TREE_CONST_IT_C_DEC::
+	  operator++();
+
+	return (*this);
+      }
+
+      inline PB_DS_TREE_IT_C_DEC
+      operator++(int)
+      {
+	PB_DS_TREE_IT_C_DEC
+	  ret_it(base_it_type::m_p_nd);
+
+	operator++();
+
+	return (ret_it);
+      }
+
+      inline PB_DS_TREE_IT_C_DEC& 
+      operator--()
+      {
+	PB_DS_TREE_CONST_IT_C_DEC::
+	  operator--();
+
+	return (*this);
+      }
+
+      inline PB_DS_TREE_IT_C_DEC
+      operator--(int)
+      {
+	PB_DS_TREE_IT_C_DEC
+	  ret_it(base_it_type::m_p_nd);
+
+	operator--();
+
+	return (ret_it);
+      }
+
+    protected:
+      typedef PB_DS_TREE_CONST_IT_C_DEC base_it_type;
+    };
+
+#undef PB_DS_TREE_CONST_IT_C_DEC
+
+#undef PB_DS_TREE_CONST_ODIR_IT_C_DEC
+
+#undef PB_DS_TREE_IT_C_DEC
+
+#undef PB_DS_TREE_ODIR_IT_C_DEC
+
+#undef PB_DS_DBG_ASSERT
+#undef PB_DS_DBG_VERIFY
+#undef PB_DS_DBG_ONLY
+
+  } // namespace detail
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_BIN_SEARCH_TREE_FIND_ITERATORS_HPP
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/bin_search_tree_/policy_access_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/bin_search_tree_/policy_access_fn_imps.hpp
new file mode 100644
index 00000000000..eadb4782477
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/bin_search_tree_/policy_access_fn_imps.hpp
@@ -0,0 +1,62 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file policy_access_fn_imps.hpp
+ * Contains an implementation class for bin_search_tree_.
+ */
+
+PB_DS_CLASS_T_DEC
+Cmp_Fn& 
+PB_DS_CLASS_C_DEC::
+get_cmp_fn()
+{
+  return (*this);
+}
+
+PB_DS_CLASS_T_DEC
+const Cmp_Fn& 
+PB_DS_CLASS_C_DEC::
+get_cmp_fn() const
+{
+  return (*this);
+}
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/bin_search_tree_/r_erase_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/bin_search_tree_/r_erase_fn_imps.hpp
new file mode 100644
index 00000000000..772255aba6a
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/bin_search_tree_/r_erase_fn_imps.hpp
@@ -0,0 +1,126 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file r_erase_fn_imps.hpp
+ * Contains an implementation class for bin_search_tree_.
+ */
+
+PB_DS_CLASS_T_DEC
+inline void
+PB_DS_CLASS_C_DEC::
+actual_erase_node(node_pointer p_z)
+{
+  PB_DS_DBG_ASSERT(m_size > 0);
+  --m_size;
+
+  PB_DS_DBG_ONLY(erase_existing(PB_DS_V2F(p_z->m_value)));
+
+  p_z->~node();
+
+  s_node_allocator.deallocate(p_z, 1);
+}
+
+PB_DS_CLASS_T_DEC
+inline void
+PB_DS_CLASS_C_DEC::
+update_min_max_for_erased_node(node_pointer p_z)
+{
+  if (m_size == 1)
+    {
+      m_p_head->m_p_left = m_p_head->m_p_right = m_p_head;
+
+      return;
+    }
+
+  if (m_p_head->m_p_left == p_z)
+    {
+      iterator it(p_z);
+
+      ++it;
+
+      m_p_head->m_p_left = it.m_p_nd;
+    }
+  else if (m_p_head->m_p_right == p_z)
+    {
+      iterator it(p_z);
+
+      --it;
+
+      m_p_head->m_p_right = it.m_p_nd;
+    }
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+clear()
+{
+  PB_DS_DBG_ONLY(structure_only_assert_valid();)
+
+    clear_imp(m_p_head->m_p_parent);
+
+  m_size = 0;
+
+  initialize();
+
+  PB_DS_DBG_ONLY(map_debug_base::clear();)
+
+    PB_DS_DBG_ONLY(structure_only_assert_valid();)
+    }
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+clear_imp(node_pointer p_nd)
+{
+  if (p_nd == NULL)
+    return;
+
+  clear_imp(p_nd->m_p_left);
+
+  clear_imp(p_nd->m_p_right);
+
+  p_nd->~Node();
+
+  s_node_allocator.deallocate(p_nd, 1);
+}
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/bin_search_tree_/rotate_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/bin_search_tree_/rotate_fn_imps.hpp
new file mode 100644
index 00000000000..795aecfa5bb
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/bin_search_tree_/rotate_fn_imps.hpp
@@ -0,0 +1,162 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file rotate_fn_imps.hpp
+ * Contains imps for rotating nodes.
+ */
+
+PB_DS_CLASS_T_DEC
+inline void
+PB_DS_CLASS_C_DEC::
+rotate_left(node_pointer p_x)
+{
+  node_pointer p_y = p_x->m_p_right;
+
+  p_x->m_p_right = p_y->m_p_left;
+
+  if (p_y->m_p_left != NULL)
+    p_y->m_p_left->m_p_parent = p_x;
+
+  p_y->m_p_parent = p_x->m_p_parent;
+
+  if (p_x == m_p_head->m_p_parent)
+    m_p_head->m_p_parent = p_y;
+  else if (p_x == p_x->m_p_parent->m_p_left)
+    p_x->m_p_parent->m_p_left = p_y;
+  else
+    p_x->m_p_parent->m_p_right = p_y;
+
+  p_y->m_p_left = p_x;
+  p_x->m_p_parent = p_y;
+
+  PB_DS_DBG_ONLY(assert_node_consistent(p_x);)
+    PB_DS_DBG_ONLY(assert_node_consistent(p_y);)
+
+    apply_update(p_x, (node_update* )this);
+  apply_update(p_x->m_p_parent, (node_update* )this);
+}
+
+PB_DS_CLASS_T_DEC
+inline void
+PB_DS_CLASS_C_DEC::
+rotate_right(node_pointer p_x)
+{
+  node_pointer p_y = p_x->m_p_left;
+
+  p_x->m_p_left = p_y->m_p_right;
+
+  if (p_y->m_p_right != NULL)
+    p_y->m_p_right->m_p_parent = p_x;
+
+  p_y->m_p_parent = p_x->m_p_parent;
+
+  if (p_x == m_p_head->m_p_parent)
+    m_p_head->m_p_parent = p_y;
+  else if (p_x == p_x->m_p_parent->m_p_right)
+    p_x->m_p_parent->m_p_right = p_y;
+  else
+    p_x->m_p_parent->m_p_left = p_y;
+
+  p_y->m_p_right = p_x;
+  p_x->m_p_parent = p_y;
+
+  PB_DS_DBG_ONLY(assert_node_consistent(p_x);)
+    PB_DS_DBG_ONLY(assert_node_consistent(p_y);)
+
+    apply_update(p_x, (node_update* )this);
+  apply_update(p_x->m_p_parent, (node_update* )this);
+}
+
+PB_DS_CLASS_T_DEC
+inline void
+PB_DS_CLASS_C_DEC::
+rotate_parent(node_pointer p_nd)
+{
+  node_pointer p_parent = p_nd->m_p_parent;
+
+  if (p_nd == p_parent->m_p_left)
+    rotate_right(p_parent);
+  else
+    rotate_left(p_parent);
+
+  PB_DS_DBG_ASSERT(p_parent->m_p_parent = p_nd);
+  PB_DS_DBG_ASSERT(p_nd->m_p_left == p_parent ||
+		   p_nd->m_p_right == p_parent);
+}
+
+PB_DS_CLASS_T_DEC
+inline void
+PB_DS_CLASS_C_DEC::
+apply_update(node_pointer /*p_nd*/, null_node_update_pointer /*p_update*/)
+{ }
+
+PB_DS_CLASS_T_DEC
+template<typename Node_Update_>
+inline void
+PB_DS_CLASS_C_DEC::
+apply_update(node_pointer p_nd, Node_Update_*  /*p_update*/)
+{
+  node_update::operator()(
+			   node_iterator(p_nd),
+			   const_node_iterator(static_cast<node_pointer>(NULL)));
+}
+
+PB_DS_CLASS_T_DEC
+template<typename Node_Update_>
+inline void
+PB_DS_CLASS_C_DEC::
+update_to_top(node_pointer p_nd, Node_Update_* p_update)
+{
+  while (p_nd != m_p_head)
+    {
+      apply_update(p_nd, p_update);
+
+      p_nd = p_nd->m_p_parent;
+    }
+}
+
+PB_DS_CLASS_T_DEC
+inline void
+PB_DS_CLASS_C_DEC::
+update_to_top(node_pointer /*p_nd*/, null_node_update_pointer /*p_update*/)
+{ }
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/bin_search_tree_/split_join_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/bin_search_tree_/split_join_fn_imps.hpp
new file mode 100644
index 00000000000..103f636d6a5
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/bin_search_tree_/split_join_fn_imps.hpp
@@ -0,0 +1,181 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file split_join_fn_imps.hpp
+ * Contains an implementation class for bin_search_tree_.
+ */
+
+PB_DS_CLASS_T_DEC
+bool
+PB_DS_CLASS_C_DEC::
+join_prep(PB_DS_CLASS_C_DEC& other)
+{
+  PB_DS_DBG_ONLY(assert_valid();)
+    PB_DS_DBG_ONLY(other.assert_valid();)
+
+    if (other.m_size == 0)
+      return (false);
+
+  if (m_size == 0)
+    {
+      value_swap(other);
+
+      return (false);
+    }
+
+  const bool greater = Cmp_Fn::operator()(
+					  PB_DS_V2F(m_p_head->m_p_right->m_value),
+					  PB_DS_V2F(other.m_p_head->m_p_left->m_value));
+
+  const bool lesser = Cmp_Fn::operator()(
+					 PB_DS_V2F(other.m_p_head->m_p_right->m_value),
+					 PB_DS_V2F(m_p_head->m_p_left->m_value));
+
+  if (!greater&&  !lesser)
+    throw join_error();
+
+  if (lesser)
+    value_swap(other);
+
+  m_size += other.m_size;
+
+  PB_DS_DBG_ONLY(map_debug_base::join(other);)
+
+    return (true);
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+join_finish(PB_DS_CLASS_C_DEC& other)
+{
+  initialize_min_max();
+
+  other.initialize();
+}
+
+PB_DS_CLASS_T_DEC
+bool
+PB_DS_CLASS_C_DEC::
+split_prep(const_key_reference r_key, PB_DS_CLASS_C_DEC& other)
+{
+  PB_DS_DBG_ONLY(assert_valid();)
+    PB_DS_DBG_ONLY(other.assert_valid();)
+
+    other.clear();
+
+  if (m_size == 0)
+    {
+      PB_DS_DBG_ONLY(assert_valid();)
+        PB_DS_DBG_ONLY(other.assert_valid();)
+
+        return (false);
+    }
+
+  if (Cmp_Fn::operator()(r_key, PB_DS_V2F(m_p_head->m_p_left->m_value)))
+    {
+      value_swap(other);
+
+      PB_DS_DBG_ONLY(assert_valid();)
+        PB_DS_DBG_ONLY(other.assert_valid();)
+
+        return (false);
+    }
+
+  if (!Cmp_Fn::operator()(
+			  r_key,
+			  PB_DS_V2F(m_p_head->m_p_right->m_value)))
+    {
+      PB_DS_DBG_ONLY(assert_valid();)
+        PB_DS_DBG_ONLY(other.assert_valid();)
+
+        return (false);
+    }
+
+  if (m_size == 1)
+    {
+      value_swap(other);
+
+      PB_DS_DBG_ONLY(assert_valid();)
+        PB_DS_DBG_ONLY(other.assert_valid();)
+
+        return (false);
+    }
+
+  PB_DS_DBG_ONLY(map_debug_base::split(
+				       r_key,(Cmp_Fn& )(*this),
+				       other);)
+
+    return (true);
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+split_finish(PB_DS_CLASS_C_DEC& other)
+{
+  other.initialize_min_max();
+
+  other.m_size =
+    std::distance(other.begin(), other.end());
+
+  m_size -= other.m_size;
+
+  initialize_min_max();
+
+  PB_DS_DBG_ONLY(assert_valid();)
+    PB_DS_DBG_ONLY(other.assert_valid();)
+    }
+
+PB_DS_CLASS_T_DEC
+typename PB_DS_CLASS_C_DEC::size_type
+PB_DS_CLASS_C_DEC::
+recursive_count(node_pointer p_nd) const
+{
+  if (p_nd == NULL)
+    return (0);
+
+  return (1 +
+	  recursive_count(p_nd->m_p_left) +
+	  recursive_count(p_nd->m_p_right));
+}
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/bin_search_tree_/traits.hpp b/libstdc++-v3/include/ext/pb_ds/detail/bin_search_tree_/traits.hpp
new file mode 100644
index 00000000000..4c57608cc56
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/bin_search_tree_/traits.hpp
@@ -0,0 +1,256 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file traits.hpp
+ * Contains an implementation for bin_search_tree_.
+ */
+
+#ifndef PB_DS_BIN_SEARCH_TREE_NODE_AND_IT_TRAITS_HPP
+#define PB_DS_BIN_SEARCH_TREE_NODE_AND_IT_TRAITS_HPP
+
+#include <ext/pb_ds/detail/bin_search_tree_/point_iterators.hpp>
+#include <ext/pb_ds/detail/bin_search_tree_/node_iterators.hpp>
+
+namespace pb_ds
+{
+  namespace detail
+  {
+
+    template<typename Key,
+	     typename Mapped,
+	     class Cmp_Fn,
+	     template<typename Const_Node_Iterator,
+		      class Node_Iterator,
+		      class Cmp_Fn,
+		      class Allocator>
+    class Node_Update,
+	     class Node,
+	     class Allocator>
+    struct bin_search_tree_traits
+    {
+    private:
+      typedef
+      types_traits<
+      Key,
+      Mapped,
+      Allocator,
+      false>
+      type_traits;
+
+    public:
+      typedef Node node;
+
+      typedef
+      bin_search_tree_const_it_<
+	typename Allocator::template rebind<
+	node>::other::pointer,
+	typename type_traits::value_type,
+	typename type_traits::pointer,
+	typename type_traits::const_pointer,
+	typename type_traits::reference,
+	typename type_traits::const_reference,
+	true,
+	Allocator>
+      const_point_iterator;
+
+      typedef
+      bin_search_tree_it_<
+	typename Allocator::template rebind<
+	node>::other::pointer,
+	typename type_traits::value_type,
+	typename type_traits::pointer,
+	typename type_traits::const_pointer,
+	typename type_traits::reference,
+	typename type_traits::const_reference,
+	true,
+	Allocator>
+      point_iterator;
+
+      typedef
+      bin_search_tree_const_it_<
+	typename Allocator::template rebind<
+	node>::other::pointer,
+	typename type_traits::value_type,
+	typename type_traits::pointer,
+	typename type_traits::const_pointer,
+	typename type_traits::reference,
+	typename type_traits::const_reference,
+	false,
+	Allocator>
+      const_reverse_iterator;
+
+      typedef
+      bin_search_tree_it_<
+	typename Allocator::template rebind<
+	node>::other::pointer,
+	typename type_traits::value_type,
+	typename type_traits::pointer,
+	typename type_traits::const_pointer,
+	typename type_traits::reference,
+	typename type_traits::const_reference,
+	false,
+	Allocator>
+      reverse_iterator;
+
+      typedef
+      bin_search_tree_const_node_it_<
+	Node,
+	const_point_iterator,
+	point_iterator,
+	Allocator>
+      const_node_iterator;
+
+      typedef
+      bin_search_tree_node_it_<
+	Node,
+	const_point_iterator,
+	point_iterator,
+	Allocator>
+      node_iterator;
+
+      typedef
+      Node_Update<
+	const_node_iterator,
+	node_iterator,
+	Cmp_Fn,
+	Allocator>
+      node_update;
+
+      typedef
+      pb_ds::null_tree_node_update<
+	const_node_iterator,
+	node_iterator,
+	Cmp_Fn,
+	Allocator>* 
+      null_node_update_pointer;
+    };
+
+    template<typename Key,
+	     class Cmp_Fn,
+	     template<typename Const_Node_Iterator,
+		      class Node_Iterator,
+		      class Cmp_Fn,
+		      class Allocator>
+    class Node_Update,
+	     class Node,
+	     class Allocator>
+    struct bin_search_tree_traits<
+      Key,
+      null_mapped_type,
+      Cmp_Fn,
+      Node_Update,
+      Node,
+      Allocator>
+    {
+    private:
+      typedef
+      types_traits<
+      Key,
+      null_mapped_type,
+      Allocator,
+      false>
+      type_traits;
+
+    public:
+      typedef Node node;
+
+      typedef
+      bin_search_tree_const_it_<
+	typename Allocator::template rebind<
+	node>::other::pointer,
+	typename type_traits::value_type,
+	typename type_traits::pointer,
+	typename type_traits::const_pointer,
+	typename type_traits::reference,
+	typename type_traits::const_reference,
+	true,
+	Allocator>
+      const_point_iterator;
+
+      typedef const_point_iterator point_iterator;
+
+      typedef
+      bin_search_tree_const_it_<
+	typename Allocator::template rebind<
+	node>::other::pointer,
+	typename type_traits::value_type,
+	typename type_traits::pointer,
+	typename type_traits::const_pointer,
+	typename type_traits::reference,
+	typename type_traits::const_reference,
+	false,
+	Allocator>
+      const_reverse_iterator;
+
+      typedef const_reverse_iterator reverse_iterator;
+
+      typedef
+      bin_search_tree_const_node_it_<
+	Node,
+	const_point_iterator,
+	point_iterator,
+	Allocator>
+      const_node_iterator;
+
+      typedef const_node_iterator node_iterator;
+
+      typedef
+      Node_Update<
+	const_node_iterator,
+	node_iterator,
+	Cmp_Fn,
+	Allocator>
+      node_update;
+
+      typedef
+      pb_ds::null_tree_node_update<
+	const_node_iterator,
+	node_iterator,
+	Cmp_Fn,
+	Allocator>* 
+      null_node_update_pointer;
+    };
+
+  } // namespace detail
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_BIN_SEARCH_TREE_NODE_AND_IT_TRAITS_HPP
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/binary_heap_/binary_heap_.hpp b/libstdc++-v3/include/ext/pb_ds/detail/binary_heap_/binary_heap_.hpp
new file mode 100644
index 00000000000..bcc81deb770
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/binary_heap_/binary_heap_.hpp
@@ -0,0 +1,396 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file binary_heap_.hpp
+ * Contains an implementation class for a binary heap.
+ */
+
+#ifndef PB_DS_BINARY_HEAP_HPP
+#define PB_DS_BINARY_HEAP_HPP
+
+/*
+ * Based on CLRS.
+ */
+
+#include <queue>
+#include <algorithm>
+#include <ext/pb_ds/detail/cond_dealtor.hpp>
+#include <ext/pb_ds/detail/cond_dealtor.hpp>
+#include <ext/pb_ds/detail/type_utils.hpp>
+#include <ext/pb_ds/detail/binary_heap_/entry_cmp.hpp>
+#include <ext/pb_ds/detail/binary_heap_/entry_pred.hpp>
+#include <ext/pb_ds/detail/binary_heap_/resize_policy.hpp>
+#include <ext/pb_ds/detail/binary_heap_/const_point_iterator.hpp>
+#include <ext/pb_ds/detail/binary_heap_/const_iterator.hpp>
+#ifdef PB_DS_BINARY_HEAP_TRACE_
+#include <iostream>
+#endif // #ifdef PB_DS_BINARY_HEAP_TRACE_
+#include <ext/pb_ds/detail/type_utils.hpp>
+
+namespace pb_ds
+{
+  namespace detail
+  {
+
+#ifdef PB_DS_BINARY_HEAP_DEBUG_
+#define PB_DS_DBG_ASSERT(X) assert(X)
+#define PB_DS_DBG_VERIFY(X) assert(X)
+#define PB_DS_DBG_ONLY(X) X
+#else // #ifdef PB_DS_BINARY_HEAP_DEBUG_
+#define PB_DS_DBG_ASSERT(X)
+#define PB_DS_DBG_VERIFY(X) {if((X)==0);}
+#define PB_DS_DBG_ONLY(X) ;
+#endif // #ifdef PB_DS_BINARY_HEAP_DEBUG_
+
+#define PB_DS_CLASS_T_DEC						\
+    template<typename Value_Type, class Cmp_Fn, class Allocator>
+
+#define PB_DS_CLASS_C_DEC					\
+    binary_heap_<						\
+						Value_Type,	\
+						Cmp_Fn,		\
+						Allocator>
+
+#define PB_DS_ENTRY_CMP_DEC						\
+    entry_cmp<								\
+								Value_Type, \
+								Cmp_Fn,	\
+								is_simple< \
+															Value_Type>::value, \
+								Allocator>::type
+
+#define PB_DS_RESIZE_POLICY_DEC						\
+    resize_policy<							\
+							typename Allocator::size_type>
+
+    /**
+     * class description = "Base class for some types of h3ap$">
+     **/
+    template<typename Value_Type, class Cmp_Fn, class Allocator>
+    class binary_heap_ : public PB_DS_ENTRY_CMP_DEC,
+			 public PB_DS_RESIZE_POLICY_DEC
+    {
+
+    private:
+      enum
+	{
+	  simple_value = is_simple<
+	  Value_Type>::value
+	};
+
+      typedef integral_constant<int, simple_value> no_throw_copies_t;
+
+      typedef
+      typename Allocator::template rebind<
+	Value_Type>::other
+      value_allocator;
+
+      typedef
+      typename conditional_type<
+	simple_value,
+	Value_Type,
+	typename value_allocator::pointer>::type
+      entry;
+
+      typedef
+      typename Allocator::template rebind<
+	entry>::other
+      entry_allocator;
+
+      typedef typename entry_allocator::pointer entry_pointer;
+
+      typedef typename PB_DS_ENTRY_CMP_DEC entry_cmp;
+
+      typedef PB_DS_RESIZE_POLICY_DEC resize_policy;
+
+      typedef
+      cond_dealtor<
+	Value_Type,
+	Allocator>
+      cond_dealtor_t;
+
+    public:
+
+      typedef typename Allocator::size_type size_type;
+
+      typedef typename Allocator::difference_type difference_type;
+
+      typedef Value_Type value_type;
+
+      typedef
+      typename Allocator::template rebind<
+	value_type>::other::pointer
+      pointer;
+
+      typedef
+      typename Allocator::template rebind<
+	value_type>::other::const_pointer
+      const_pointer;
+
+      typedef
+      typename Allocator::template rebind<
+	value_type>::other::reference
+      reference;
+
+      typedef
+      typename Allocator::template rebind<
+	value_type>::other::const_reference
+      const_reference;
+
+      typedef
+      binary_heap_const_point_iterator_<
+	value_type,
+	entry,
+	simple_value,
+	Allocator>
+      const_point_iterator;
+
+      typedef const_point_iterator point_iterator;
+
+      typedef
+      binary_heap_const_iterator_<
+	value_type,
+	entry,
+	simple_value,
+	Allocator>
+      const_iterator;
+
+      typedef const_iterator iterator;
+
+      typedef Cmp_Fn cmp_fn;
+
+      typedef Allocator allocator;
+
+    public:
+
+      binary_heap_();
+
+      binary_heap_(const Cmp_Fn& r_cmp_fn);
+
+      binary_heap_(const PB_DS_CLASS_C_DEC& other);
+
+      void
+      swap(PB_DS_CLASS_C_DEC& other);
+
+      ~binary_heap_();
+
+      inline bool
+      empty() const;
+
+      inline size_type
+      size() const;
+
+      inline size_type
+      max_size() const;
+
+      Cmp_Fn& 
+      get_cmp_fn();
+
+      const Cmp_Fn& 
+      get_cmp_fn() const;
+
+      inline point_iterator
+      push(const_reference r_val);
+
+      void
+      modify(point_iterator it, const_reference r_new_val);
+
+      inline const_reference
+      top() const;
+
+      inline void
+      pop();
+
+      inline void
+      erase(point_iterator it);
+
+      template<typename Pred>
+      typename PB_DS_CLASS_C_DEC::size_type
+      erase_if(Pred pred);
+
+      inline static void
+      erase_at(entry_pointer a_entries, size_type size, false_type);
+
+      inline static void
+      erase_at(entry_pointer a_entries, size_type size, true_type);
+
+      inline iterator
+      begin();
+
+      inline const_iterator
+      begin() const;
+
+      inline iterator
+      end();
+
+      inline const_iterator
+      end() const;
+
+      void
+      clear();
+
+      template<typename Pred>
+      void
+      split(Pred pred, PB_DS_CLASS_C_DEC& other);
+
+      void
+      join(PB_DS_CLASS_C_DEC& other);
+
+#ifdef PB_DS_BINARY_HEAP_TRACE_
+
+      void
+      trace() const;
+
+#endif // #ifdef PB_DS_BINARY_HEAP_TRACE_
+
+    protected:
+
+      template<typename It>
+      void
+      copy_from_range(It first_it, It last_it);
+
+    private:
+
+      void
+      value_swap(PB_DS_CLASS_C_DEC& other);
+
+      inline void
+      insert_value(const_reference r_val, false_type);
+
+      inline void
+      insert_value(value_type val, true_type);
+
+      inline void
+      insert_entry(entry e);
+
+      inline void
+      resize_for_insert_if_needed();
+
+      inline void
+      swap_value_imp(entry_pointer p_e, value_type new_val, true_type);
+
+      inline void
+      swap_value_imp(entry_pointer p_e, const_reference r_new_val, false_type);
+
+      void
+      fix(entry_pointer p_e);
+
+      inline const_reference
+      top_imp(true_type) const;
+
+      inline const_reference
+      top_imp(false_type) const;
+
+      inline static size_type
+      left_child(size_type i);
+
+      inline static size_type
+      right_child(size_type i);
+
+      inline static size_type
+      parent(size_type i);
+
+      inline void
+      resize_for_erase_if_needed();
+
+      template<typename Pred>
+      size_type
+      partition(Pred pred);
+
+#ifdef PB_DS_BINARY_HEAP_DEBUG_
+
+      void
+      assert_valid() const;
+
+#endif // #ifdef PB_DS_BINARY_HEAP_DEBUG_
+
+#ifdef PB_DS_BINARY_HEAP_TRACE_
+
+      void
+      trace_entry(const entry& r_e, false_type) const;
+
+      void
+      trace_entry(const entry& r_e, true_type) const;
+
+#endif // #ifdef PB_DS_BINARY_HEAP_TRACE_
+
+    private:
+      static entry_allocator s_entry_allocator;
+
+      static value_allocator s_value_allocator;
+
+      static no_throw_copies_t s_no_throw_copies_ind;
+
+      size_type m_size;
+
+      size_type m_actual_size;
+
+      entry_pointer m_a_entries;
+    };
+
+#include <ext/pb_ds/detail/binary_heap_/insert_fn_imps.hpp>
+#include <ext/pb_ds/detail/binary_heap_/constructors_destructor_fn_imps.hpp>
+#include <ext/pb_ds/detail/binary_heap_/iterators_fn_imps.hpp>
+#include <ext/pb_ds/detail/binary_heap_/debug_fn_imps.hpp>
+#include <ext/pb_ds/detail/binary_heap_/trace_fn_imps.hpp>
+#include <ext/pb_ds/detail/binary_heap_/erase_fn_imps.hpp>
+#include <ext/pb_ds/detail/binary_heap_/info_fn_imps.hpp>
+#include <ext/pb_ds/detail/binary_heap_/find_fn_imps.hpp>
+#include <ext/pb_ds/detail/binary_heap_/split_join_fn_imps.hpp>
+#include <ext/pb_ds/detail/binary_heap_/policy_access_fn_imps.hpp>
+
+#undef PB_DS_CLASS_C_DEC
+
+#undef PB_DS_CLASS_T_DEC
+
+#undef PB_DS_ENTRY_CMP_DEC
+
+#undef PB_DS_RESIZE_POLICY_DEC
+
+#undef PB_DS_DBG_ASSERT
+#undef PB_DS_DBG_VERIFY
+#undef PB_DS_DBG_ONLY
+
+  } // namespace detail
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_BINARY_HEAP_HPP
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/binary_heap_/const_iterator.hpp b/libstdc++-v3/include/ext/pb_ds/detail/binary_heap_/const_iterator.hpp
new file mode 100644
index 00000000000..c739317e00a
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/binary_heap_/const_iterator.hpp
@@ -0,0 +1,187 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file const_iterator.hpp
+ * Contains an iterator class returned by the table's const find and insert
+ *     methods.
+ */
+
+#ifndef PB_DS_BINARY_HEAP_CONST_ITERATOR_HPP
+#define PB_DS_BINARY_HEAP_CONST_ITERATOR_HPP
+
+#include <ext/pb_ds/detail/binary_heap_/const_point_iterator.hpp>
+
+namespace pb_ds
+{
+  namespace detail
+  {
+
+#ifdef BINARY_HEAP_DEBUG_
+#define PB_DS_DBG_ASSERT(X) assert(X)
+#define PB_DS_DBG_VERIFY(X) assert(X)
+#define PB_DS_DBG_ONLY(X) X
+#else // #ifdef BINARY_HEAP_DEBUG_
+#define PB_DS_DBG_ASSERT(X)
+#define PB_DS_DBG_VERIFY(X) {if((X)==0);}
+#define PB_DS_DBG_ONLY(X) ;
+#endif // #ifdef BINARY_HEAP_DEBUG_
+
+#define PB_DS_CLASS_C_DEC					\
+    binary_heap_const_iterator_<				\
+						Value_Type,	\
+						Entry,		\
+						Simple,		\
+						Allocator>
+
+#define PB_DS_BASE_C_DEC					\
+    binary_heap_const_point_iterator_<				\
+						Value_Type,	\
+						Entry,		\
+						Simple,		\
+						Allocator>
+
+    // Const point-type iterator.
+    template<typename Value_Type,
+	     typename Entry,
+	     bool Simple,
+	     class Allocator>
+    class binary_heap_const_iterator_ : public PB_DS_BASE_C_DEC
+    {
+
+    private:
+      typedef typename PB_DS_BASE_C_DEC::entry_pointer entry_pointer;
+
+      typedef PB_DS_BASE_C_DEC base_type;
+
+    public:
+
+      // Category.
+      typedef std::forward_iterator_tag iterator_category;
+
+      // Difference type.
+      typedef typename Allocator::difference_type difference_type;
+
+      // Iterator's value type.
+      typedef typename base_type::value_type value_type;
+
+      // Iterator's pointer type.
+      typedef typename base_type::pointer pointer;
+
+      // Iterator's const pointer type.
+      typedef typename base_type::const_pointer const_pointer;
+
+      // Iterator's reference type.
+      typedef typename base_type::reference reference;
+
+      // Iterator's const reference type.
+      typedef typename base_type::const_reference const_reference;
+
+    public:
+
+      inline
+      binary_heap_const_iterator_(entry_pointer p_e) : base_type(p_e)
+      { }
+
+      // Default constructor.
+      inline
+      binary_heap_const_iterator_()
+      { }
+
+      // Copy constructor.
+      inline
+      binary_heap_const_iterator_(const PB_DS_CLASS_C_DEC& other) : base_type(other)
+      { }
+
+      // Compares content to a different iterator object.
+      inline bool
+      operator==(const PB_DS_CLASS_C_DEC& other) const
+      {
+	return (base_type::m_p_e == other.m_p_e);
+      }
+
+      // Compares content (negatively) to a different iterator object.
+      inline bool
+      operator!=(const PB_DS_CLASS_C_DEC& other) const
+      {
+	return (base_type::m_p_e != other.m_p_e);
+      }
+
+      inline PB_DS_CLASS_C_DEC& 
+      operator++()
+      {
+	PB_DS_DBG_ASSERT(base_type::m_p_e != NULL);
+
+	inc();
+
+	return (*this);
+      }
+
+      inline PB_DS_CLASS_C_DEC
+      operator++(int)
+      {
+	PB_DS_CLASS_C_DEC ret_it(base_type::m_p_e);
+
+	operator++();
+
+	return (ret_it);
+      }
+
+    private:
+      void
+      inc()
+      {
+	++base_type::m_p_e;
+      }
+    };
+
+#undef PB_DS_CLASS_C_DEC
+
+#undef PB_DS_BASE_C_DEC
+
+#undef PB_DS_DBG_ASSERT
+#undef PB_DS_DBG_VERIFY
+#undef PB_DS_DBG_ONLY
+
+  } // namespace detail
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_BINARY_HEAP_CONST_ITERATOR_HPP
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/binary_heap_/const_point_iterator.hpp b/libstdc++-v3/include/ext/pb_ds/detail/binary_heap_/const_point_iterator.hpp
new file mode 100644
index 00000000000..092a19a411a
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/binary_heap_/const_point_iterator.hpp
@@ -0,0 +1,210 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file const_point_iterator.hpp
+ * Contains an iterator class returned by the table's const find and insert
+ *     methods.
+ */
+
+#ifndef PB_DS_BINARY_HEAP_CONST_FIND_ITERATOR_HPP
+#define PB_DS_BINARY_HEAP_CONST_FIND_ITERATOR_HPP
+
+#include <ext/pb_ds/tag_and_trait.hpp>
+
+namespace pb_ds
+{
+  namespace detail
+  {
+
+#ifdef BINARY_HEAP_DEBUG_
+#define PB_DS_DBG_ASSERT(X) assert(X)
+#define PB_DS_DBG_VERIFY(X) assert(X)
+#define PB_DS_DBG_ONLY(X) X
+#else // #ifdef BINARY_HEAP_DEBUG_
+#define PB_DS_DBG_ASSERT(X)
+#define PB_DS_DBG_VERIFY(X) {if((X)==0);}
+#define PB_DS_DBG_ONLY(X) ;m_p_prev_or_parent
+#endif // #ifdef BINARY_HEAP_DEBUG_
+
+#define PB_DS_CLASS_T_DEC						\
+    template<								\
+						typename Value_Type,	\
+						typename Entry,		\
+						bool Simple,		\
+						class Allocator>
+
+#define PB_DS_CLASS_C_DEC					\
+    binary_heap_const_point_iterator_<				\
+						Value_Type,	\
+						Entry,		\
+						Simple,		\
+						Allocator>
+
+    // Const point-type iterator.
+    template<typename Value_Type,
+	     typename Entry,
+	     bool Simple,
+	     class Allocator>
+    class binary_heap_const_point_iterator_
+    {
+
+    protected:
+      typedef
+      typename Allocator::template rebind<
+      Entry>::other::pointer
+      entry_pointer;
+
+    public:
+
+      // Category.
+      typedef trivial_iterator_tag iterator_category;
+
+      // Difference type.
+      typedef trivial_iterator_difference_type difference_type;
+
+      // Iterator's value type.
+      typedef Value_Type value_type;
+
+      // Iterator's pointer type.
+      typedef
+      typename Allocator::template rebind<
+	value_type>::other::pointer
+      pointer;
+
+      // Iterator's const pointer type.
+      typedef
+      typename Allocator::template rebind<
+	value_type>::other::const_pointer
+      const_pointer;
+
+      // Iterator's reference type.
+      typedef
+      typename Allocator::template rebind<
+	value_type>::other::reference
+      reference;
+
+      // Iterator's const reference type.
+      typedef
+      typename Allocator::template rebind<
+	value_type>::other::const_reference
+      const_reference;
+
+    public:
+
+      inline
+      binary_heap_const_point_iterator_(entry_pointer p_e) : m_p_e(p_e)
+      { }
+
+      // Default constructor.
+      inline
+      binary_heap_const_point_iterator_()
+
+	: m_p_e(NULL)
+      { }
+
+      // Copy constructor.
+      inline
+      binary_heap_const_point_iterator_(const PB_DS_CLASS_C_DEC& other)
+
+	: m_p_e(other.m_p_e)
+      { }
+
+      // Access.
+      inline const_pointer
+      operator->() const
+      {
+	PB_DS_DBG_ASSERT(m_p_e != NULL);
+
+	return (to_ptr(integral_constant<int,Simple>()));
+      }
+
+      // Access.
+      inline const_reference
+      operator*() const
+      {
+	PB_DS_DBG_ASSERT(m_p_e != NULL);
+
+	return (*to_ptr(integral_constant<int,Simple>()));
+      }
+
+      // Compares content to a different iterator object.
+      inline bool
+      operator==(const PB_DS_CLASS_C_DEC& other) const
+      {
+	return (m_p_e == other.m_p_e);
+      }
+
+      // Compares content (negatively) to a different iterator object.
+      inline bool
+      operator!=(const PB_DS_CLASS_C_DEC& other) const
+      {
+	return (m_p_e != other.m_p_e);
+      }
+
+    private:
+      inline const_pointer
+      to_ptr(true_type) const
+      {
+	return m_p_e;
+      }
+
+      inline const_pointer
+      to_ptr(false_type) const
+      {
+	return* m_p_e;
+      }
+
+    public:
+      entry_pointer m_p_e;
+    };
+
+#undef PB_DS_CLASS_T_DEC
+#undef PB_DS_CLASS_C_DEC
+
+#undef PB_DS_DBG_ASSERT
+#undef PB_DS_DBG_VERIFY
+#undef PB_DS_DBG_ONLY
+
+  } // namespace detail
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_BINARY_HEAP_CONST_FIND_ITERATOR_HPP
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/binary_heap_/constructors_destructor_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/binary_heap_/constructors_destructor_fn_imps.hpp
new file mode 100644
index 00000000000..c568aaa3832
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/binary_heap_/constructors_destructor_fn_imps.hpp
@@ -0,0 +1,175 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file constructors_destructor_fn_imps.hpp
+ * Contains an implementation class for binary_heap_.
+ */
+
+PB_DS_CLASS_T_DEC
+typename PB_DS_CLASS_C_DEC::entry_allocator
+PB_DS_CLASS_C_DEC::s_entry_allocator;
+
+PB_DS_CLASS_T_DEC
+typename PB_DS_CLASS_C_DEC::value_allocator
+PB_DS_CLASS_C_DEC::s_value_allocator;
+
+PB_DS_CLASS_T_DEC
+typename PB_DS_CLASS_C_DEC::no_throw_copies_t
+PB_DS_CLASS_C_DEC::s_no_throw_copies_ind;
+
+PB_DS_CLASS_T_DEC
+template<typename It>
+void
+PB_DS_CLASS_C_DEC::
+copy_from_range(It first_it, It last_it)
+{
+  while (first_it != last_it)
+    {
+      insert_value(*first_it, s_no_throw_copies_ind);
+
+      ++first_it;
+    }
+
+  std::make_heap(m_a_entries, m_a_entries + m_size, static_cast<entry_cmp& >(*this));
+
+  PB_DS_DBG_ONLY(assert_valid();)
+    }
+
+PB_DS_CLASS_T_DEC
+PB_DS_CLASS_C_DEC::
+binary_heap_() :
+  m_size(0),
+  m_actual_size(resize_policy::min_size),
+  m_a_entries(s_entry_allocator.allocate(m_actual_size))
+{
+  PB_DS_DBG_ONLY(assert_valid();)
+    }
+
+PB_DS_CLASS_T_DEC
+PB_DS_CLASS_C_DEC::
+binary_heap_(const Cmp_Fn& r_cmp_fn) :
+  entry_cmp(r_cmp_fn),
+  m_size(0),
+  m_actual_size(resize_policy::min_size),
+  m_a_entries(s_entry_allocator.allocate(m_actual_size))
+{
+  PB_DS_DBG_ONLY(assert_valid();)
+    }
+
+PB_DS_CLASS_T_DEC
+PB_DS_CLASS_C_DEC::
+binary_heap_(const PB_DS_CLASS_C_DEC& other) :
+  entry_cmp(other),
+  resize_policy(other),
+  m_size(0),
+  m_actual_size(other.m_actual_size),
+  m_a_entries(s_entry_allocator.allocate(m_actual_size))
+{
+  PB_DS_DBG_ONLY(other.assert_valid();)
+    PB_DS_DBG_ASSERT(m_a_entries != other.m_a_entries);
+
+  const_iterator first_it = other.begin();
+  const_iterator last_it = other.end();
+
+  try
+    {
+      while (first_it != last_it)
+        {
+	  insert_value(*first_it, s_no_throw_copies_ind);
+
+	  ++first_it;
+        }
+    }
+  catch(...)
+    {
+      for (size_type i = 0; i < m_size; ++i)
+	erase_at(m_a_entries, i, s_no_throw_copies_ind);
+
+      s_entry_allocator.deallocate(m_a_entries, m_actual_size);
+
+      throw;
+    }
+
+  PB_DS_DBG_ONLY(assert_valid();)
+    }
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+swap(PB_DS_CLASS_C_DEC& other)
+{
+  PB_DS_DBG_ONLY(assert_valid();)
+    PB_DS_DBG_ONLY(other.assert_valid();)
+    PB_DS_DBG_ASSERT(m_a_entries != other.m_a_entries);
+
+  value_swap(other);
+
+  std::swap((entry_cmp& )(*this), (entry_cmp& )other);
+
+  PB_DS_DBG_ONLY(assert_valid();)
+    PB_DS_DBG_ONLY(other.assert_valid();)
+    }
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+value_swap(PB_DS_CLASS_C_DEC& other)
+{
+  std::swap(m_a_entries, other.m_a_entries);
+
+  std::swap(m_size, other.m_size);
+
+  std::swap(m_actual_size, other.m_actual_size);
+
+  static_cast<resize_policy* >(this)->swap(other);
+}
+
+PB_DS_CLASS_T_DEC
+PB_DS_CLASS_C_DEC::
+~binary_heap_()
+{
+  for (size_type i = 0; i < m_size; ++i)
+    erase_at(m_a_entries, i, s_no_throw_copies_ind);
+
+  s_entry_allocator.deallocate(m_a_entries, m_actual_size);
+}
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/binary_heap_/debug_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/binary_heap_/debug_fn_imps.hpp
new file mode 100644
index 00000000000..e24835cfe2f
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/binary_heap_/debug_fn_imps.hpp
@@ -0,0 +1,80 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file debug_fn_imps.hpp
+ * Contains an implementation class for a binary_heap.
+ */
+
+#ifdef PB_DS_BINARY_HEAP_DEBUG_
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+assert_valid() const
+{
+#ifdef PB_DS_REGRESSION
+  s_entry_allocator.check_allocated(m_a_entries, m_actual_size);
+#endif // #ifdef PB_DS_REGRESSION
+
+  resize_policy::assert_valid();
+
+  PB_DS_DBG_ASSERT(m_size <= m_actual_size);
+
+  for (size_type i = 0; i < m_size; ++i)
+    {
+#ifdef PB_DS_REGRESSION
+      s_value_allocator.check_allocated(m_a_entries[i], 1);
+#endif // #ifdef PB_DS_REGRESSION
+
+      if (left_child(i) < m_size)
+	PB_DS_DBG_ASSERT(!entry_cmp::operator()(m_a_entries[i], m_a_entries[left_child(i)]));
+
+      PB_DS_DBG_ASSERT(parent(left_child(i)) == i);
+
+      if (right_child(i) < m_size)
+	PB_DS_DBG_ASSERT(!entry_cmp::operator()(m_a_entries[i], m_a_entries[right_child(i)]));
+
+      PB_DS_DBG_ASSERT(parent(right_child(i)) == i);
+    }
+}
+
+#endif // #ifdef PB_DS_BINARY_HEAP_DEBUG_
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/binary_heap_/entry_cmp.hpp b/libstdc++-v3/include/ext/pb_ds/detail/binary_heap_/entry_cmp.hpp
new file mode 100644
index 00000000000..c98dae75cab
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/binary_heap_/entry_cmp.hpp
@@ -0,0 +1,99 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file entry_cmp.hpp
+ * Contains an implementation class for a binary_heap.
+ */
+
+#ifndef PB_DS_BINARY_HEAP_ENTRY_CMP_HPP
+#define PB_DS_BINARY_HEAP_ENTRY_CMP_HPP
+
+namespace pb_ds
+{
+  namespace detail
+  {
+
+    template<typename Value_Type,
+	     class Cmp_Fn,
+	     bool No_Throw,
+	     class Allocator>
+    struct entry_cmp
+    {
+      typedef Cmp_Fn type;
+    };
+
+    template<typename Value_Type, class Cmp_Fn, class Allocator>
+    struct entry_cmp<
+      Value_Type,
+      Cmp_Fn,
+      false,
+      Allocator>
+    {
+    public:
+      typedef
+      typename Allocator::template rebind<
+      Value_Type>::other::const_pointer
+      entry;
+
+      struct type : public Cmp_Fn
+      {
+      public:
+	inline
+	type()
+	{ }
+
+	inline
+	type(const Cmp_Fn& other) : Cmp_Fn(other)
+	{ }
+
+	inline bool
+	operator()(entry p_lhs,  entry p_rhs) const
+	{
+	  return Cmp_Fn::operator()(*p_lhs, * p_rhs);
+	}
+      };
+    };
+
+  } // namespace detail
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_BINARY_HEAP_ENTRY_CMP_HPP
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/binary_heap_/entry_pred.hpp b/libstdc++-v3/include/ext/pb_ds/detail/binary_heap_/entry_pred.hpp
new file mode 100644
index 00000000000..25102f2c1ad
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/binary_heap_/entry_pred.hpp
@@ -0,0 +1,99 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file entry_pred.hpp
+ * Contains an implementation class for a binary_heap.
+ */
+
+#ifndef PB_DS_BINARY_HEAP_ENTRY_PRED_HPP
+#define PB_DS_BINARY_HEAP_ENTRY_PRED_HPP
+
+namespace pb_ds
+{
+  namespace detail
+  {
+
+    template<typename Value_Type,
+	     class Pred,
+	     bool No_Throw,
+	     class Allocator>
+    struct entry_pred
+    {
+      typedef Pred type;
+    };
+
+    template<typename Value_Type, class Pred, class Allocator>
+    struct entry_pred<
+      Value_Type,
+      Pred,
+      false,
+      Allocator>
+    {
+    public:
+      typedef
+      typename Allocator::template rebind<
+      Value_Type>::other::const_pointer
+      entry;
+
+      struct type : public Pred
+      {
+      public:
+	inline
+	type()
+	{ }
+
+	inline
+	type(const Pred& other) : Pred(other)
+	{ }
+
+	inline bool
+	operator()(entry p_v) const
+	{
+	  return Pred::operator()(*p_v);
+	}
+      };
+    };
+
+  } // namespace detail
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_BINARY_HEAP_ENTRY_PRED_HPP
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/binary_heap_/erase_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/binary_heap_/erase_fn_imps.hpp
new file mode 100644
index 00000000000..08a42467669
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/binary_heap_/erase_fn_imps.hpp
@@ -0,0 +1,252 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file erase_fn_imps.hpp
+ * Contains an implementation class for a binary_heap.
+ */
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+clear()
+{
+  for (size_type i = 0; i < m_size; ++i)
+    erase_at(m_a_entries, i, s_no_throw_copies_ind);
+
+  try
+    {
+      const size_type actual_size = resize_policy::get_new_size_for_arbitrary(0);
+
+      entry_pointer a_entries = s_entry_allocator.allocate(actual_size);
+
+      resize_policy::notify_arbitrary(actual_size);
+
+      s_entry_allocator.deallocate(m_a_entries, m_actual_size);
+
+      m_actual_size = actual_size;
+
+      m_a_entries = a_entries;
+    }
+  catch(...)
+    { }
+
+  m_size = 0;
+
+  PB_DS_DBG_ONLY(assert_valid();)
+    }
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+erase_at(entry_pointer a_entries, size_type i, false_type)
+{
+  a_entries[i]->~value_type();
+
+  s_value_allocator.deallocate(a_entries[i], 1);
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+erase_at(entry_pointer, size_type, true_type)
+{ }
+
+PB_DS_CLASS_T_DEC
+inline void
+PB_DS_CLASS_C_DEC::
+pop()
+{
+  PB_DS_DBG_ONLY(assert_valid();)
+    PB_DS_DBG_ASSERT(!empty());
+
+  erase_at(m_a_entries, 0, s_no_throw_copies_ind);
+
+  std::pop_heap(m_a_entries, m_a_entries + m_size, static_cast<entry_cmp& >(*this));
+
+  resize_for_erase_if_needed();
+
+  PB_DS_DBG_ASSERT(m_size > 0);
+  --m_size;
+
+  PB_DS_DBG_ONLY(assert_valid();)
+    }
+
+PB_DS_CLASS_T_DEC
+template<typename Pred>
+typename PB_DS_CLASS_C_DEC::size_type
+PB_DS_CLASS_C_DEC::
+erase_if(Pred pred)
+{
+  PB_DS_DBG_ONLY(assert_valid();)
+
+    typedef
+    typename entry_pred<
+    value_type,
+    Pred,
+    simple_value,
+    Allocator>::type
+    pred_t;
+
+  const size_type left = partition(pred_t(pred));
+
+  PB_DS_DBG_ASSERT(m_size >= left);
+
+  const size_type ersd = m_size - left;
+
+  for (size_type i = left; i < m_size; ++i)
+    erase_at(m_a_entries, i, s_no_throw_copies_ind);
+
+  try
+    {
+      const size_type actual_size =
+	resize_policy::get_new_size_for_arbitrary(left);
+
+      entry_pointer a_entries = s_entry_allocator.allocate(actual_size);
+
+      std::copy(m_a_entries, m_a_entries + left, a_entries);
+
+      s_entry_allocator.deallocate(m_a_entries, m_actual_size);
+
+      m_actual_size = actual_size;
+
+      resize_policy::notify_arbitrary(m_actual_size);
+    }
+  catch(...)
+    { };
+
+  m_size = left;
+
+  std::make_heap(m_a_entries, m_a_entries + m_size, static_cast<entry_cmp& >(*this));
+
+  PB_DS_DBG_ONLY(assert_valid();)
+
+    return ersd;
+}
+
+PB_DS_CLASS_T_DEC
+inline void
+PB_DS_CLASS_C_DEC::
+erase(point_iterator it)
+{
+  PB_DS_DBG_ONLY(assert_valid();)
+    PB_DS_DBG_ASSERT(!empty());
+
+  const size_type fix_pos = it.m_p_e - m_a_entries;
+
+  std::swap(*it.m_p_e, m_a_entries[m_size - 1]);
+
+  erase_at(m_a_entries, m_size - 1, s_no_throw_copies_ind);
+
+  resize_for_erase_if_needed();
+
+  PB_DS_DBG_ASSERT(m_size > 0);
+  --m_size;
+
+  PB_DS_DBG_ASSERT(fix_pos <= m_size);
+
+  if (fix_pos != m_size)
+    fix(m_a_entries + fix_pos);
+
+  PB_DS_DBG_ONLY(assert_valid();)
+    }
+
+PB_DS_CLASS_T_DEC
+inline void
+PB_DS_CLASS_C_DEC::
+resize_for_erase_if_needed()
+{
+  if (!resize_policy::resize_needed_for_shrink(m_size))
+    return;
+
+  try
+    {
+      const size_type new_actual_size =
+	resize_policy::get_new_size_for_shrink();
+
+      entry_pointer a_new_entries = s_entry_allocator.allocate(new_actual_size);
+
+      resize_policy::notify_shrink_resize();
+
+      PB_DS_DBG_ASSERT(m_size > 0);
+      std::copy(m_a_entries, m_a_entries + m_size - 1, a_new_entries);
+
+      s_entry_allocator.deallocate(m_a_entries, m_actual_size);
+
+      m_actual_size = new_actual_size;
+
+      m_a_entries = a_new_entries;
+    }
+  catch(...)
+    { }
+}
+
+PB_DS_CLASS_T_DEC
+template<typename Pred>
+typename PB_DS_CLASS_C_DEC::size_type
+PB_DS_CLASS_C_DEC::
+partition(Pred pred)
+{
+  size_type left = 0;
+  size_type right = m_size - 1;
+
+  while (right + 1 != left)
+    {
+      PB_DS_DBG_ASSERT(left <= m_size);
+
+      if (!pred(m_a_entries[left]))
+	++left;
+      else if (pred(m_a_entries[right]))
+	--right;
+      else
+        {
+	  PB_DS_DBG_ASSERT(left < right);
+
+	  std::swap(m_a_entries[left], m_a_entries[right]);
+
+	  ++left;
+	  --right;
+        }
+    }
+
+  return left;
+}
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/binary_heap_/find_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/binary_heap_/find_fn_imps.hpp
new file mode 100644
index 00000000000..92fc949da2b
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/binary_heap_/find_fn_imps.hpp
@@ -0,0 +1,97 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file find_fn_imps.hpp
+ * Contains an implementation class for a binary_heap.
+ */
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::const_reference
+PB_DS_CLASS_C_DEC::
+top() const
+{
+  PB_DS_DBG_ONLY(assert_valid();)
+    PB_DS_DBG_ASSERT(!empty());
+
+  return top_imp(s_no_throw_copies_ind);
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::const_reference
+PB_DS_CLASS_C_DEC::
+top_imp(true_type) const
+{
+  return* m_a_entries;
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::const_reference
+PB_DS_CLASS_C_DEC::
+top_imp(false_type) const
+{
+  return** m_a_entries;
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::size_type
+PB_DS_CLASS_C_DEC::
+left_child(size_type i)
+{
+  return i*  2 + 1;
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::size_type
+PB_DS_CLASS_C_DEC::
+right_child(size_type i)
+{
+  return i*  2 + 2;
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::size_type
+PB_DS_CLASS_C_DEC::
+parent(size_type i)
+{
+  return (i - 1) / 2;
+}
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/binary_heap_/info_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/binary_heap_/info_fn_imps.hpp
new file mode 100644
index 00000000000..eb227d3beac
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/binary_heap_/info_fn_imps.hpp
@@ -0,0 +1,70 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file info_fn_imps.hpp
+ * Contains an implementation class for a binary_heap.
+ */
+
+PB_DS_CLASS_T_DEC
+inline bool
+PB_DS_CLASS_C_DEC::
+empty() const
+{
+  return (m_size == 0);
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::size_type
+PB_DS_CLASS_C_DEC::
+size() const
+{
+  return (m_size);
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::size_type
+PB_DS_CLASS_C_DEC::
+max_size() const
+{
+  return (s_entry_allocator.max_size());
+}
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/binary_heap_/insert_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/binary_heap_/insert_fn_imps.hpp
new file mode 100644
index 00000000000..543285835b8
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/binary_heap_/insert_fn_imps.hpp
@@ -0,0 +1,220 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file insert_fn_imps.hpp
+ * Contains an implementation class for a binary_heap.
+ */
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::point_iterator
+PB_DS_CLASS_C_DEC::
+push(const_reference r_val)
+{
+  PB_DS_DBG_ONLY(assert_valid();)
+
+    insert_value(r_val, s_no_throw_copies_ind);
+
+  std::push_heap(m_a_entries, m_a_entries + m_size, static_cast<entry_cmp& >(*this));
+
+  PB_DS_DBG_ONLY(assert_valid();)
+
+    return point_iterator(m_a_entries);
+}
+
+PB_DS_CLASS_T_DEC
+inline void
+PB_DS_CLASS_C_DEC::
+insert_value(value_type val, true_type)
+{
+  resize_for_insert_if_needed();
+
+  m_a_entries[m_size++] = val;
+}
+
+PB_DS_CLASS_T_DEC
+inline void
+PB_DS_CLASS_C_DEC::
+insert_value(const_reference r_val, false_type)
+{
+  resize_for_insert_if_needed();
+
+  pointer p_new = s_value_allocator.allocate(1);
+
+  cond_dealtor_t cond(p_new);
+
+  new (p_new) value_type(r_val);
+
+  cond.set_no_action();
+
+  m_a_entries[m_size++] = p_new;
+}
+
+PB_DS_CLASS_T_DEC
+inline void
+PB_DS_CLASS_C_DEC::
+insert_entry(entry e)
+{
+  resize_for_insert_if_needed();
+
+  m_a_entries[m_size++] = e;
+}
+
+PB_DS_CLASS_T_DEC
+inline void
+PB_DS_CLASS_C_DEC::
+resize_for_insert_if_needed()
+{
+  if (!resize_policy::resize_needed_for_grow(m_size))
+    {
+      PB_DS_DBG_ASSERT(m_size < m_actual_size);
+
+      return;
+    }
+
+  const size_type new_actual_size =
+    resize_policy::get_new_size_for_grow();
+
+  entry_pointer a_new_entries = s_entry_allocator.allocate(new_actual_size);
+
+  resize_policy::notify_grow_resize();
+
+  std::copy(m_a_entries, m_a_entries + m_size, a_new_entries);
+
+  s_entry_allocator.deallocate(m_a_entries, m_actual_size);
+
+  m_actual_size = new_actual_size;
+
+  m_a_entries = a_new_entries;
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+modify(point_iterator it, const_reference r_new_val)
+{
+  PB_DS_DBG_ONLY(assert_valid();)
+
+    swap_value_imp(it.m_p_e, r_new_val, s_no_throw_copies_ind);
+
+  fix(it.m_p_e);
+
+  PB_DS_DBG_ONLY(assert_valid();)
+    }
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+fix(entry_pointer p_e)
+{
+  size_type i = p_e - m_a_entries;
+
+  if (i > 0&&  entry_cmp::operator()(m_a_entries[parent(i)], m_a_entries[i]))
+    {
+      size_type parent_i = parent(i);
+
+      while (i > 0&&  entry_cmp::operator()(m_a_entries[parent_i], m_a_entries[i]))
+        {
+	  std::swap(m_a_entries[i], m_a_entries[parent_i]);
+
+	  i = parent_i;
+
+	  parent_i = parent(i);
+        }
+
+      PB_DS_DBG_ONLY(assert_valid();)
+
+        return;
+    }
+
+  while (i < m_size)
+    {
+      const size_type left_child_i = left_child(i);
+      const size_type right_child_i = right_child(i);
+
+      PB_DS_DBG_ASSERT(right_child_i > left_child_i);
+
+      const bool smaller_than_left_child =
+	left_child_i < m_size&& 
+	entry_cmp::operator()(m_a_entries[i], m_a_entries[left_child_i]);
+
+      const bool smaller_than_right_child =
+	right_child_i < m_size&& 
+	entry_cmp::operator()(m_a_entries[i], m_a_entries[right_child_i]);
+
+      const bool swap_with_r_child = smaller_than_right_child&& (!smaller_than_left_child ||
+								 entry_cmp::operator()(m_a_entries[left_child_i], m_a_entries[right_child_i]));
+
+      const bool swap_with_l_child = !swap_with_r_child&&  smaller_than_left_child;
+
+      if (swap_with_l_child)
+        {
+	  std::swap(m_a_entries[i], m_a_entries[left_child_i]);
+
+	  i = left_child_i;
+        }
+      else if (swap_with_r_child)
+        {
+	  std::swap(m_a_entries[i], m_a_entries[right_child_i]);
+
+	  i = right_child_i;
+        }
+      else
+	i = m_size;
+    }
+}
+
+PB_DS_CLASS_T_DEC
+inline void
+PB_DS_CLASS_C_DEC::
+swap_value_imp(entry_pointer p_e, value_type new_val, true_type)
+{
+  * p_e = new_val;
+}
+
+PB_DS_CLASS_T_DEC
+inline void
+PB_DS_CLASS_C_DEC::
+swap_value_imp(entry_pointer p_e, const_reference r_new_val, false_type)
+{
+  value_type tmp(r_new_val);
+  (*p_e)->swap(tmp);
+}
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/binary_heap_/iterators_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/binary_heap_/iterators_fn_imps.hpp
new file mode 100644
index 00000000000..7a647c33556
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/binary_heap_/iterators_fn_imps.hpp
@@ -0,0 +1,78 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file iterators_fn_imps.hpp
+ * Contains an implementation class for a binary_heap.
+ */
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::iterator
+PB_DS_CLASS_C_DEC::
+begin()
+{
+  return (iterator(m_a_entries));
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::const_iterator
+PB_DS_CLASS_C_DEC::
+begin() const
+{
+  return (const_iterator(m_a_entries));
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::iterator
+PB_DS_CLASS_C_DEC::
+end()
+{
+  return (iterator(m_a_entries + m_size));
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::const_iterator
+PB_DS_CLASS_C_DEC::
+end() const
+{
+  return (const_iterator(m_a_entries + m_size));
+}
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/binary_heap_/policy_access_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/binary_heap_/policy_access_fn_imps.hpp
new file mode 100644
index 00000000000..6c019c08582
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/binary_heap_/policy_access_fn_imps.hpp
@@ -0,0 +1,62 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file policy_access_fn_imps.hpp
+ * Contains an implementation class for a binary_heap.
+ */
+
+PB_DS_CLASS_T_DEC
+Cmp_Fn& 
+PB_DS_CLASS_C_DEC::
+get_cmp_fn()
+{
+  return (*this);
+}
+
+PB_DS_CLASS_T_DEC
+const Cmp_Fn& 
+PB_DS_CLASS_C_DEC::
+get_cmp_fn() const
+{
+  return (*this);
+}
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/binary_heap_/resize_policy.hpp b/libstdc++-v3/include/ext/pb_ds/detail/binary_heap_/resize_policy.hpp
new file mode 100644
index 00000000000..1982e07ae74
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/binary_heap_/resize_policy.hpp
@@ -0,0 +1,295 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file resize_policy.hpp
+ * Contains an implementation class for a binary_heap.
+ */
+
+#ifndef PB_DS_BINARY_HEAP_RESIZE_POLICY_HPP
+#define PB_DS_BINARY_HEAP_RESIZE_POLICY_HPP
+
+namespace pb_ds
+{
+  namespace detail
+  {
+
+#ifdef PB_DS_BINARY_HEAP_DEBUG_
+#define PB_DS_DBG_ASSERT(X) assert(X)
+#define PB_DS_DBG_VERIFY(X) assert(X)
+#define PB_DS_DBG_ONLY(X) X
+#else // #ifdef PB_DS_BINARY_HEAP_DEBUG_
+#define PB_DS_DBG_ASSERT(X)
+#define PB_DS_DBG_VERIFY(X) {if((X)==0);}
+#define PB_DS_DBG_ONLY(X) ;
+#endif // #ifdef PB_DS_BINARY_HEAP_DEBUG_
+
+#define PB_DS_CLASS_T_DEC			\
+    template<typename Size_Type>
+
+#define PB_DS_CLASS_C_DEC					\
+    resize_policy<						\
+						Size_Type>
+
+    template<typename Size_Type>
+    class resize_policy
+    {
+    public:
+      typedef Size_Type size_type;
+
+      enum
+	{
+	  min_size = 16
+	};
+
+    public:
+      inline
+      resize_policy();
+
+      inline void
+      swap(PB_DS_CLASS_C_DEC& other);
+
+      inline bool
+      resize_needed_for_grow(size_type size) const;
+
+      inline bool
+      resize_needed_for_shrink(size_type size) const;
+
+      inline bool
+      grow_needed(size_type size) const;
+
+      inline bool
+      shrink_needed(size_type size) const;
+
+      inline size_type
+      get_new_size_for_grow() const;
+
+      inline size_type
+      get_new_size_for_shrink() const;
+
+      size_type
+      get_new_size_for_arbitrary(size_type size) const;
+
+      inline void
+      notify_grow_resize();
+
+      inline void
+      notify_shrink_resize();
+
+      void
+      notify_arbitrary(size_type actual_size);
+
+#ifdef PB_DS_BINARY_HEAP_DEBUG_
+      void
+      assert_valid() const;
+#endif // #ifdef PB_DS_BINARY_HEAP_DEBUG_
+
+#ifdef PB_DS_BINARY_HEAP_TRACE_
+
+      void
+      trace() const;
+
+#endif // #ifdef PB_DS_BINARY_HEAP_TRACE_
+
+    private:
+      enum
+	{
+	  ratio = 8,
+	  factor = 2
+	};
+
+    private:
+      size_type m_next_shrink_size;
+
+      size_type m_next_grow_size;
+    };
+
+    PB_DS_CLASS_T_DEC
+    inline
+    PB_DS_CLASS_C_DEC::
+    resize_policy() :
+      m_next_shrink_size(0),
+      m_next_grow_size(min_size)
+    {
+      PB_DS_DBG_ONLY(assert_valid();)
+	}
+
+    PB_DS_CLASS_T_DEC
+    inline void
+    PB_DS_CLASS_C_DEC::
+    swap(PB_DS_CLASS_C_DEC& other)
+    {
+      std::swap(m_next_shrink_size, other.m_next_shrink_size);
+      std::swap(m_next_grow_size, other.m_next_grow_size);
+    }
+
+    PB_DS_CLASS_T_DEC
+    inline bool
+    PB_DS_CLASS_C_DEC::
+    resize_needed_for_grow(size_type size) const
+    {
+      PB_DS_DBG_ASSERT(size <= m_next_grow_size);
+
+      return size == m_next_grow_size;
+    }
+
+    PB_DS_CLASS_T_DEC
+    inline bool
+    PB_DS_CLASS_C_DEC::
+    resize_needed_for_shrink(size_type size) const
+    {
+      PB_DS_DBG_ASSERT(size <= m_next_grow_size);
+
+      return size == m_next_shrink_size;
+    }
+
+    PB_DS_CLASS_T_DEC
+    inline typename PB_DS_CLASS_C_DEC::size_type
+    PB_DS_CLASS_C_DEC::
+    get_new_size_for_grow() const
+    {
+      return m_next_grow_size*  factor;
+    }
+
+    PB_DS_CLASS_T_DEC
+    inline typename PB_DS_CLASS_C_DEC::size_type
+    PB_DS_CLASS_C_DEC::
+    get_new_size_for_shrink() const
+    {
+      const size_type half_size = m_next_grow_size / factor;
+
+      return std::max(static_cast<size_type>(min_size), half_size);
+    }
+
+    PB_DS_CLASS_T_DEC
+    inline typename PB_DS_CLASS_C_DEC::size_type
+    PB_DS_CLASS_C_DEC::
+    get_new_size_for_arbitrary(size_type size) const
+    {
+      size_type ret = min_size;
+
+      while (ret < size)
+	ret *= factor;
+
+      return ret;
+    }
+
+    PB_DS_CLASS_T_DEC
+    inline void
+    PB_DS_CLASS_C_DEC::
+    notify_grow_resize()
+    {
+      PB_DS_DBG_ONLY(assert_valid();)
+
+	PB_DS_DBG_ASSERT(m_next_grow_size >= min_size);
+
+      m_next_grow_size *= factor;
+
+      m_next_shrink_size = m_next_grow_size / ratio;
+
+      PB_DS_DBG_ONLY(assert_valid();)
+	}
+
+    PB_DS_CLASS_T_DEC
+    inline void
+    PB_DS_CLASS_C_DEC::
+    notify_shrink_resize()
+    {
+      PB_DS_DBG_ONLY(assert_valid();)
+
+	m_next_shrink_size /= factor;
+      if (m_next_shrink_size == 1)
+	m_next_shrink_size = 0;
+
+      m_next_grow_size =
+	std::max(m_next_grow_size / factor, static_cast<size_type>(min_size));
+
+      PB_DS_DBG_ONLY(assert_valid();)
+	}
+
+    PB_DS_CLASS_T_DEC
+    inline void
+    PB_DS_CLASS_C_DEC::
+    notify_arbitrary(size_type actual_size)
+    {
+      m_next_grow_size = actual_size;
+
+      m_next_shrink_size = m_next_grow_size / ratio;
+
+      PB_DS_DBG_ONLY(assert_valid();)
+	}
+
+#ifdef PB_DS_BINARY_HEAP_DEBUG_
+    PB_DS_CLASS_T_DEC
+    void
+    PB_DS_CLASS_C_DEC::
+    assert_valid() const
+    {
+      PB_DS_DBG_ASSERT(m_next_shrink_size == 0 ||
+		       m_next_shrink_size*  ratio == m_next_grow_size);
+
+      PB_DS_DBG_ASSERT(m_next_grow_size >= min_size);
+    }
+#endif // #ifdef PB_DS_BINARY_HEAP_DEBUG_
+
+#ifdef PB_DS_BINARY_HEAP_TRACE_
+    PB_DS_CLASS_T_DEC
+    void
+    PB_DS_CLASS_C_DEC::
+    trace() const
+    {
+      std::cerr << "shrink = " << m_next_shrink_size <<
+	" grow = " << m_next_grow_size << std::endl;
+    }
+#endif // #ifdef PB_DS_BINARY_HEAP_TRACE_
+
+#undef PB_DS_CLASS_T_DEC
+
+#undef PB_DS_CLASS_C_DEC
+
+#undef PB_DS_DBG_ASSERT
+#undef PB_DS_DBG_VERIFY
+#undef PB_DS_DBG_ONLY
+
+  } // namespace detail
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_BINARY_HEAP_RESIZE_POLICY_HPP
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/binary_heap_/split_join_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/binary_heap_/split_join_fn_imps.hpp
new file mode 100644
index 00000000000..20913c47d59
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/binary_heap_/split_join_fn_imps.hpp
@@ -0,0 +1,179 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file split_join_fn_imps.hpp
+ * Contains an implementation class for a binary_heap.
+ */
+
+PB_DS_CLASS_T_DEC
+template<typename Pred>
+void
+PB_DS_CLASS_C_DEC::
+split(Pred pred, PB_DS_CLASS_C_DEC& other)
+{
+  PB_DS_DBG_ONLY(assert_valid();)
+
+    typedef
+    typename entry_pred<
+    value_type,
+    Pred,
+    simple_value,
+    Allocator>::type
+    pred_t;
+
+  const size_type left = partition(pred_t(pred));
+
+  PB_DS_DBG_ASSERT(m_size >= left);
+
+  const size_type ersd = m_size - left;
+
+  PB_DS_DBG_ASSERT(m_size >= ersd);
+
+  const size_type actual_size =
+    resize_policy::get_new_size_for_arbitrary(left);
+
+  const size_type other_actual_size =
+    other.get_new_size_for_arbitrary(ersd);
+
+  entry_pointer a_entries = NULL;
+  entry_pointer a_other_entries = NULL;
+
+  try
+    {
+      a_entries = s_entry_allocator.allocate(actual_size);
+
+      a_other_entries = s_entry_allocator.allocate(other_actual_size);
+    }
+  catch(...)
+    {
+      if (a_entries != NULL)
+	s_entry_allocator.deallocate(a_entries, actual_size);
+
+      if (a_other_entries != NULL)
+	s_entry_allocator.deallocate(a_other_entries, other_actual_size);
+
+      throw;
+    };
+
+  for (size_type i = 0; i < other.m_size; ++i)
+    erase_at(other.m_a_entries, i, s_no_throw_copies_ind);
+
+  PB_DS_DBG_ASSERT(actual_size >= left);
+  std::copy(m_a_entries, m_a_entries + left, a_entries);
+  std::copy(m_a_entries + left, m_a_entries + m_size, a_other_entries);
+
+  s_entry_allocator.deallocate(m_a_entries, m_actual_size);
+  s_entry_allocator.deallocate(other.m_a_entries, other.m_actual_size);
+
+  m_actual_size = actual_size;
+  other.m_actual_size = other_actual_size;
+
+  m_size = left;
+  other.m_size = ersd;
+
+  m_a_entries = a_entries;
+  other.m_a_entries = a_other_entries;
+
+  std::make_heap(m_a_entries, m_a_entries + m_size, static_cast<entry_cmp& >(*this));
+  std::make_heap(other.m_a_entries, other.m_a_entries + other.m_size, static_cast<entry_cmp& >(other));
+
+  resize_policy::notify_arbitrary(m_actual_size);
+  other.notify_arbitrary(other.m_actual_size);
+
+  PB_DS_DBG_ONLY(assert_valid();)
+    PB_DS_DBG_ONLY(other.assert_valid();)
+    }
+
+PB_DS_CLASS_T_DEC
+inline void
+PB_DS_CLASS_C_DEC::
+join(PB_DS_CLASS_C_DEC& other)
+{
+  PB_DS_DBG_ONLY(assert_valid();)
+    PB_DS_DBG_ONLY(other.assert_valid();)
+
+    const size_type size = m_size + other.m_size;
+  const size_type actual_size = resize_policy::get_new_size_for_arbitrary(size);
+
+  entry_pointer a_entries = NULL;
+  entry_pointer a_other_entries = NULL;
+
+  try
+    {
+      a_entries = s_entry_allocator.allocate(actual_size);
+
+      a_other_entries = s_entry_allocator.allocate(resize_policy::min_size);
+    }
+  catch(...)
+    {
+      if (a_entries != NULL)
+	s_entry_allocator.deallocate(a_entries, actual_size);
+
+      if (a_other_entries != NULL)
+	s_entry_allocator.deallocate(a_other_entries, resize_policy::min_size);
+
+      throw;
+    }
+
+  std::copy(m_a_entries, m_a_entries + m_size, a_entries);
+  std::copy(other.m_a_entries, other.m_a_entries + other.m_size, a_entries + m_size);
+
+  s_entry_allocator.deallocate(m_a_entries, m_actual_size);
+  m_a_entries = a_entries;
+  m_size = size;
+  m_actual_size = actual_size;
+
+  resize_policy::notify_arbitrary(actual_size);
+
+  std::make_heap(m_a_entries, m_a_entries + m_size, static_cast<entry_cmp& >(*this));
+
+  s_entry_allocator.deallocate(other.m_a_entries, other.m_actual_size);
+  other.m_a_entries = a_other_entries;
+  other.m_size = 0;
+  other.m_actual_size = resize_policy::min_size;
+
+  other.notify_arbitrary(resize_policy::min_size);
+
+  PB_DS_DBG_ONLY(assert_valid();)
+    PB_DS_DBG_ONLY(other.assert_valid();)
+    }
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/binary_heap_/trace_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/binary_heap_/trace_fn_imps.hpp
new file mode 100644
index 00000000000..bcc10656abb
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/binary_heap_/trace_fn_imps.hpp
@@ -0,0 +1,84 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file trace_fn_imps.hpp
+ * Contains an implementation class for a binary_heap.
+ */
+
+#ifdef PB_DS_BINARY_HEAP_TRACE_
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+trace() const
+{
+  std::cerr << this << std::endl;
+
+  std::cerr << m_a_entries << std::endl;
+
+  for (size_type i = 0; i < m_size; ++i)
+    trace_entry(m_a_entries[i], s_no_throw_copies_ind);
+
+  std::cerr << std::endl;
+
+  std::cerr << "size = " << m_size << " " << "actual_size = " << m_actual_size << std::endl;
+
+  resize_policy::trace();
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+trace_entry(const entry& r_e, false_type) const
+{
+  std::cout << r_e << " " <<* r_e << std::endl;
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+trace_entry(const entry& r_e, true_type) const
+{
+  std::cout << r_e << std::endl;
+}
+
+#endif // #ifdef PB_DS_BINARY_HEAP_TRACE_
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/binomial_heap_/binomial_heap_.hpp b/libstdc++-v3/include/ext/pb_ds/detail/binomial_heap_/binomial_heap_.hpp
new file mode 100644
index 00000000000..2689bdb91e6
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/binomial_heap_/binomial_heap_.hpp
@@ -0,0 +1,165 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file binomial_heap_.hpp
+ * Contains an implementation class for a binomial heap.
+ */
+
+/*
+ * Binomial heap.
+ * Vuillemin J is the mastah.
+ * Modified from CLRS.
+ */
+
+#ifdef PB_DS_BINOMIAL_HEAP_DEBUG_
+#include <cassert>
+#endif // #ifdef PB_DS_BINOMIAL_HEAP_DEBUG_
+#include <ext/pb_ds/detail/cond_dealtor.hpp>
+#include <ext/pb_ds/detail/type_utils.hpp>
+#include <ext/pb_ds/detail/binomial_heap_base_/binomial_heap_base_.hpp>
+
+namespace pb_ds
+{
+  namespace detail
+  {
+
+#ifdef PB_DS_BINOMIAL_HEAP_DEBUG_
+#define PB_DS_DBG_ASSERT(X) assert(X)
+#define PB_DS_DBG_VERIFY(X) assert(X)
+#define PB_DS_DBG_ONLY(X) X
+#else // #ifdef PB_DS_BINOMIAL_HEAP_DEBUG_
+#define PB_DS_DBG_ASSERT(X)
+#define PB_DS_DBG_VERIFY(X) {if((X)==0);}
+#define PB_DS_DBG_ONLY(X) ;
+#endif // #ifdef PB_DS_BINOMIAL_HEAP_DEBUG_
+
+#define PB_DS_CLASS_T_DEC						\
+    template<typename Value_Type, class Cmp_Fn, class Allocator>
+
+#define PB_DS_CLASS_C_DEC					\
+    binomial_heap_<						\
+						Value_Type,	\
+						Cmp_Fn,		\
+						Allocator>
+
+#define PB_DS_BASE_C_DEC						\
+    binomial_heap_base_<					\
+							Value_Type,	\
+							Cmp_Fn,		\
+							Allocator>
+
+    /**
+     * class description = "8y|\|0|\/|i41 h34p 74813">
+     **/
+    template<typename Value_Type, class Cmp_Fn, class Allocator>
+    class binomial_heap_ : public PB_DS_BASE_C_DEC
+    {
+
+    private:
+      typedef PB_DS_BASE_C_DEC base_type;
+
+      typedef typename base_type::node_pointer node_pointer;
+
+      typedef typename base_type::const_node_pointer const_node_pointer;
+
+    public:
+
+      typedef typename Allocator::size_type size_type;
+
+      typedef typename Allocator::difference_type difference_type;
+
+      typedef Value_Type value_type;
+
+      typedef typename base_type::pointer pointer;
+
+      typedef typename base_type::const_pointer const_pointer;
+
+      typedef typename base_type::reference reference;
+
+      typedef typename base_type::const_reference const_reference;
+
+      typedef typename base_type::const_point_iterator const_point_iterator;
+
+      typedef typename base_type::point_iterator point_iterator;
+
+      typedef typename base_type::const_iterator const_iterator;
+
+      typedef typename base_type::iterator iterator;
+
+      typedef typename base_type::cmp_fn cmp_fn;
+
+      typedef typename base_type::allocator allocator;
+
+    public:
+
+      binomial_heap_();
+
+      binomial_heap_(const Cmp_Fn& r_cmp_fn);
+
+      binomial_heap_(const PB_DS_CLASS_C_DEC& other);
+
+      ~binomial_heap_();
+
+    protected:
+#ifdef PB_DS_BINOMIAL_HEAP_DEBUG_
+
+      void
+      assert_valid() const;
+
+#endif // #ifdef PB_DS_BINOMIAL_HEAP_DEBUG_
+    };
+
+#include <ext/pb_ds/detail/binomial_heap_/constructors_destructor_fn_imps.hpp>
+#include <ext/pb_ds/detail/binomial_heap_/debug_fn_imps.hpp>
+
+#undef PB_DS_CLASS_C_DEC
+
+#undef PB_DS_CLASS_T_DEC
+
+#undef PB_DS_BASE_C_DEC
+
+#undef PB_DS_DBG_ASSERT
+#undef PB_DS_DBG_VERIFY
+#undef PB_DS_DBG_ONLY
+
+  } // namespace detail
+} // namespace pb_ds
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/binomial_heap_/constructors_destructor_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/binomial_heap_/constructors_destructor_fn_imps.hpp
new file mode 100644
index 00000000000..ab7bec6bf94
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/binomial_heap_/constructors_destructor_fn_imps.hpp
@@ -0,0 +1,74 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file constructors_destructor_fn_imps.hpp
+ * Contains an implementation for binomial_heap_.
+ */
+
+PB_DS_CLASS_T_DEC
+PB_DS_CLASS_C_DEC::
+binomial_heap_()
+{
+  PB_DS_DBG_ONLY(assert_valid();)
+    }
+
+PB_DS_CLASS_T_DEC
+PB_DS_CLASS_C_DEC::
+binomial_heap_(const Cmp_Fn& r_cmp_fn) :
+  PB_DS_BASE_C_DEC(r_cmp_fn)
+{
+  PB_DS_DBG_ONLY(assert_valid();)
+    }
+
+PB_DS_CLASS_T_DEC
+PB_DS_CLASS_C_DEC::
+binomial_heap_(const PB_DS_CLASS_C_DEC& other) :
+  PB_DS_BASE_C_DEC(other)
+{
+  PB_DS_DBG_ONLY(assert_valid();)
+    }
+
+PB_DS_CLASS_T_DEC
+PB_DS_CLASS_C_DEC::
+~binomial_heap_()
+{ }
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/binomial_heap_/debug_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/binomial_heap_/debug_fn_imps.hpp
new file mode 100644
index 00000000000..39208a8c6e8
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/binomial_heap_/debug_fn_imps.hpp
@@ -0,0 +1,57 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file debug_fn_imps.hpp
+ * Contains an implementation for binomial_heap_.
+ */
+
+#ifdef PB_DS_BINOMIAL_HEAP_DEBUG_
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+assert_valid() const
+{
+  base_type::assert_valid(true);
+}
+
+#endif // #ifdef PB_DS_BINOMIAL_HEAP__DEBUG_
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/binomial_heap_base_/binomial_heap_base_.hpp b/libstdc++-v3/include/ext/pb_ds/detail/binomial_heap_base_/binomial_heap_base_.hpp
new file mode 100644
index 00000000000..5ad1ad5dea9
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/binomial_heap_base_/binomial_heap_base_.hpp
@@ -0,0 +1,270 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file binomial_heap_base_.hpp
+ * Contains an implementation class for a base of binomial heaps.
+ */
+
+#ifndef PB_DS_BINOMIAL_HEAP_BASE_HPP
+#define PB_DS_BINOMIAL_HEAP_BASE_HPP
+
+/*
+ * Binomial heap base.
+ * Vuillemin J is the mastah.
+ * Modified from CLRS.
+ */
+
+#ifdef PB_DS_BINOMIAL_HEAP_BASE_DEBUG_
+#include <cassert>
+#endif // #ifdef PB_DS_BINOMIAL_HEAP_BASE_DEBUG_
+#include <ext/pb_ds/detail/cond_dealtor.hpp>
+#include <ext/pb_ds/detail/type_utils.hpp>
+#include <ext/pb_ds/detail/left_child_next_sibling_heap_/left_child_next_sibling_heap_.hpp>
+#include <ext/pb_ds/detail/left_child_next_sibling_heap_/null_metadata.hpp>
+
+namespace pb_ds
+{
+  namespace detail
+  {
+
+#ifdef PB_DS_BINOMIAL_HEAP_BASE_DEBUG_
+#define PB_DS_DBG_ASSERT(X) assert(X)
+#define PB_DS_DBG_VERIFY(X) assert(X)
+#define PB_DS_DBG_ONLY(X) X
+#else // #ifdef PB_DS_BINOMIAL_HEAP_BASE_DEBUG_
+#define PB_DS_DBG_ASSERT(X)
+#define PB_DS_DBG_VERIFY(X) {if((X)==0);}
+#define PB_DS_DBG_ONLY(X) ;
+#endif // #ifdef PB_DS_BINOMIAL_HEAP_BASE_DEBUG_
+
+#define PB_DS_CLASS_T_DEC						\
+    template<typename Value_Type, class Cmp_Fn, class Allocator>
+
+#define PB_DS_CLASS_C_DEC					\
+    binomial_heap_base_<					\
+						Value_Type,	\
+						Cmp_Fn,		\
+						Allocator>
+
+#ifdef PB_DS_LC_NS_HEAP_DEBUG_
+#define PB_DS_BASE_C_DEC						\
+    left_child_next_sibling_heap_<			\
+									Value_Type, \
+									Cmp_Fn,	\
+									typename Allocator::size_type, \
+									Allocator, \
+									false>
+#else // #ifdef PB_DS_LC_NS_HEAP_DEBUG_
+#define PB_DS_BASE_C_DEC						\
+    left_child_next_sibling_heap_<			\
+									Value_Type, \
+									Cmp_Fn,	\
+									typename Allocator::size_type, \
+									Allocator>
+#endif // #ifdef PB_DS_LC_NS_HEAP_DEBUG_
+
+    /**
+     * class description = "8y|\|0|\/|i41 h34p 74813">
+     **/
+    template<typename Value_Type, class Cmp_Fn, class Allocator>
+    class binomial_heap_base_ : public PB_DS_BASE_C_DEC
+    {
+
+    private:
+      typedef PB_DS_BASE_C_DEC base_type;
+
+    protected:
+      typedef typename base_type::node node;
+
+      typedef typename base_type::node_pointer node_pointer;
+
+      typedef typename base_type::const_node_pointer const_node_pointer;
+
+    public:
+
+      typedef typename Allocator::size_type size_type;
+
+      typedef typename Allocator::difference_type difference_type;
+
+      typedef Value_Type value_type;
+
+      typedef
+      typename Allocator::template rebind<
+	value_type>::other::pointer
+      pointer;
+
+      typedef
+      typename Allocator::template rebind<
+	value_type>::other::const_pointer
+      const_pointer;
+
+      typedef
+      typename Allocator::template rebind<
+	value_type>::other::reference
+      reference;
+
+      typedef
+      typename Allocator::template rebind<
+	value_type>::other::const_reference
+      const_reference;
+
+      typedef
+      typename PB_DS_BASE_C_DEC::const_point_iterator
+      const_point_iterator;
+
+      typedef typename PB_DS_BASE_C_DEC::point_iterator point_iterator;
+
+      typedef typename PB_DS_BASE_C_DEC::const_iterator const_iterator;
+
+      typedef typename PB_DS_BASE_C_DEC::iterator iterator;
+
+      typedef Cmp_Fn cmp_fn;
+
+      typedef Allocator allocator;
+
+    public:
+
+      inline point_iterator
+      push(const_reference r_val);
+
+      void
+      modify(point_iterator it, const_reference r_new_val);
+
+      inline const_reference
+      top() const;
+
+      void
+      pop();
+
+      void
+      erase(point_iterator it);
+
+      inline void
+      clear();
+
+      template<typename Pred>
+      size_type
+      erase_if(Pred pred);
+
+      template<typename Pred>
+      void
+      split(Pred pred, PB_DS_CLASS_C_DEC& other);
+
+      void
+      join(PB_DS_CLASS_C_DEC& other);
+
+    protected:
+
+      binomial_heap_base_();
+
+      binomial_heap_base_(const Cmp_Fn& r_cmp_fn);
+
+      binomial_heap_base_(const PB_DS_CLASS_C_DEC& other);
+
+      void
+      swap(PB_DS_CLASS_C_DEC& other);
+
+      ~binomial_heap_base_();
+
+      template<typename It>
+      void
+      copy_from_range(It first_it, It last_it);
+
+      inline void
+      find_max();
+
+#ifdef PB_DS_BINOMIAL_HEAP_BASE_DEBUG_
+
+      void
+      assert_valid(bool strictly_binomial) const;
+
+      void
+      assert_max() const;
+
+#endif // #ifdef PB_DS_BINOMIAL_HEAP_BASE_DEBUG_
+
+    private:
+
+      inline node_pointer
+      fix(node_pointer p_nd) const;
+
+      inline void
+      insert_node(node_pointer p_nd);
+
+      inline void
+      remove_parentless_node(node_pointer p_nd);
+
+      inline node_pointer
+      join(node_pointer p_lhs, node_pointer p_rhs) const;
+
+#ifdef PB_DS_BINOMIAL_HEAP_BASE_DEBUG_
+
+      void
+      assert_node_consistent(const_node_pointer p_nd, bool strictly_binomial, bool increasing) const;
+
+#endif // #ifdef PB_DS_BINOMIAL_HEAP_BASE_DEBUG_
+
+    protected:
+      node_pointer m_p_max;
+    };
+
+#include <ext/pb_ds/detail/binomial_heap_base_/constructors_destructor_fn_imps.hpp>
+#include <ext/pb_ds/detail/binomial_heap_base_/debug_fn_imps.hpp>
+#include <ext/pb_ds/detail/binomial_heap_base_/find_fn_imps.hpp>
+#include <ext/pb_ds/detail/binomial_heap_base_/insert_fn_imps.hpp>
+#include <ext/pb_ds/detail/binomial_heap_base_/erase_fn_imps.hpp>
+#include <ext/pb_ds/detail/binomial_heap_base_/split_join_fn_imps.hpp>
+
+#undef PB_DS_CLASS_C_DEC
+
+#undef PB_DS_CLASS_T_DEC
+
+#undef PB_DS_BASE_C_DEC
+
+#undef PB_DS_DBG_ASSERT
+#undef PB_DS_DBG_VERIFY
+#undef PB_DS_DBG_ONLY
+
+  } // namespace detail
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_BINOMIAL_HEAP_BASE_HPP
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/binomial_heap_base_/constructors_destructor_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/binomial_heap_base_/constructors_destructor_fn_imps.hpp
new file mode 100644
index 00000000000..dd3d090e60e
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/binomial_heap_base_/constructors_destructor_fn_imps.hpp
@@ -0,0 +1,103 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file constructors_destructor_fn_imps.hpp
+ * Contains an implementation class for a base of binomial heaps.
+ */
+
+PB_DS_CLASS_T_DEC
+template<typename It>
+void
+PB_DS_CLASS_C_DEC::
+copy_from_range(It first_it, It last_it)
+{
+  while (first_it != last_it)
+    push(*(first_it++));
+
+  PB_DS_DBG_ONLY(assert_valid(false);)
+    }
+
+PB_DS_CLASS_T_DEC
+PB_DS_CLASS_C_DEC::
+binomial_heap_base_() :
+  m_p_max(NULL)
+{
+  PB_DS_DBG_ONLY(assert_valid(false);)
+    }
+
+PB_DS_CLASS_T_DEC
+PB_DS_CLASS_C_DEC::
+binomial_heap_base_(const Cmp_Fn& r_cmp_fn) :
+  PB_DS_BASE_C_DEC(r_cmp_fn),
+  m_p_max(NULL)
+{
+  PB_DS_DBG_ONLY(assert_valid(false);)
+    }
+
+PB_DS_CLASS_T_DEC
+PB_DS_CLASS_C_DEC::
+binomial_heap_base_(const PB_DS_CLASS_C_DEC& other) :
+  PB_DS_BASE_C_DEC(other),
+  m_p_max(NULL)
+{
+  PB_DS_DBG_ONLY(assert_valid(false);)
+    }
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+swap(PB_DS_CLASS_C_DEC& other)
+{
+  PB_DS_DBG_ONLY(assert_valid(false);)
+
+    base_type::swap(other);
+
+  std::swap(m_p_max, other.m_p_max);
+
+  PB_DS_DBG_ONLY(assert_valid(false);)
+    }
+
+PB_DS_CLASS_T_DEC
+PB_DS_CLASS_C_DEC::
+~binomial_heap_base_()
+{ }
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/binomial_heap_base_/debug_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/binomial_heap_base_/debug_fn_imps.hpp
new file mode 100644
index 00000000000..f50524d9c2c
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/binomial_heap_base_/debug_fn_imps.hpp
@@ -0,0 +1,108 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file debug_fn_imps.hpp
+ * Contains an implementation class for a base of binomial heaps.
+ */
+
+#ifdef PB_DS_BINOMIAL_HEAP_BASE_DEBUG_
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+assert_valid(bool strictly_binomial) const
+{
+  base_type::assert_valid();
+
+  assert_node_consistent(base_type::m_p_root, strictly_binomial, true);
+
+  assert_max();
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+assert_max() const
+{
+  if (m_p_max == NULL)
+    return;
+
+  PB_DS_DBG_ASSERT(base_type::parent(m_p_max) == NULL);
+
+  for (const_iterator it = base_type::begin(); it != base_type::end(); ++it)
+    PB_DS_DBG_ASSERT(!Cmp_Fn::operator()(m_p_max->m_value, it.m_p_nd->m_value));
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+assert_node_consistent(const_node_pointer p_nd, bool strictly_binomial, bool increasing) const
+{
+  PB_DS_DBG_ASSERT(increasing || strictly_binomial);
+
+  base_type::assert_node_consistent(p_nd, false);
+
+  if (p_nd == NULL)
+    return;
+
+  PB_DS_DBG_ASSERT(p_nd->m_metadata == base_type::degree(p_nd));
+
+  PB_DS_DBG_ASSERT(base_type::size_under_node(p_nd) ==
+		   static_cast<size_type>(1 << p_nd->m_metadata));
+
+  assert_node_consistent(p_nd->m_p_next_sibling, strictly_binomial, increasing);
+
+  assert_node_consistent(p_nd->m_p_l_child, true, false);
+
+  if (p_nd->m_p_next_sibling != NULL)
+    if (increasing)
+      {
+	if (strictly_binomial)
+	  PB_DS_DBG_ASSERT(p_nd->m_metadata < p_nd->m_p_next_sibling->m_metadata);
+	else
+	  PB_DS_DBG_ASSERT(p_nd->m_metadata <= p_nd->m_p_next_sibling->m_metadata);
+      }
+    else
+      PB_DS_DBG_ASSERT(p_nd->m_metadata > p_nd->m_p_next_sibling->m_metadata);
+}
+
+#endif // #ifdef PB_DS_BINOMIAL_HEAP_BASE_DEBUG_
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/binomial_heap_base_/erase_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/binomial_heap_base_/erase_fn_imps.hpp
new file mode 100644
index 00000000000..bb373101a5f
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/binomial_heap_base_/erase_fn_imps.hpp
@@ -0,0 +1,198 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file erase_fn_imps.hpp
+ * Contains an implementation class for a base of binomial heaps.
+ */
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+pop()
+{
+  PB_DS_DBG_ONLY(assert_valid(true);)
+    PB_DS_DBG_ASSERT(!base_type::empty());
+
+  if (m_p_max == NULL)
+    find_max();
+
+  PB_DS_DBG_ASSERT(m_p_max != NULL);
+
+  node_pointer p_nd = m_p_max;
+
+  remove_parentless_node(m_p_max);
+
+  base_type::actual_erase_node(p_nd);
+
+  m_p_max = NULL;
+
+  PB_DS_DBG_ONLY(assert_valid(true);)
+    }
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+remove_parentless_node(node_pointer p_nd)
+{
+  PB_DS_DBG_ASSERT(p_nd != NULL);
+  PB_DS_DBG_ASSERT(base_type::parent(p_nd) == NULL);
+
+  node_pointer p_cur_root = p_nd == base_type::m_p_root?
+    p_nd->m_p_next_sibling :
+    base_type::m_p_root;
+
+  if (p_cur_root != NULL)
+    p_cur_root->m_p_prev_or_parent = NULL;
+
+  if (p_nd->m_p_prev_or_parent != NULL)
+    p_nd->m_p_prev_or_parent->m_p_next_sibling = p_nd->m_p_next_sibling;
+
+  if (p_nd->m_p_next_sibling != NULL)
+    p_nd->m_p_next_sibling->m_p_prev_or_parent = p_nd->m_p_prev_or_parent;
+
+  node_pointer p_child = p_nd->m_p_l_child;
+
+  if (p_child != NULL)
+    {
+      p_child->m_p_prev_or_parent = NULL;
+
+      while (p_child->m_p_next_sibling != NULL)
+	p_child = p_child->m_p_next_sibling;
+    }
+
+  m_p_max = NULL;
+
+  base_type::m_p_root = join(p_cur_root, p_child);
+}
+
+PB_DS_CLASS_T_DEC
+inline void
+PB_DS_CLASS_C_DEC::
+clear()
+{
+  base_type::clear();
+
+  m_p_max = NULL;
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+erase(point_iterator it)
+{
+  PB_DS_DBG_ONLY(assert_valid(true);)
+    PB_DS_DBG_ASSERT(!base_type::empty());
+
+  base_type::bubble_to_top(it.m_p_nd);
+
+  remove_parentless_node(it.m_p_nd);
+
+  base_type::actual_erase_node(it.m_p_nd);
+
+  m_p_max = NULL;
+
+  PB_DS_DBG_ONLY(assert_valid(true);)
+    }
+
+PB_DS_CLASS_T_DEC
+template<typename Pred>
+typename PB_DS_CLASS_C_DEC::size_type
+PB_DS_CLASS_C_DEC::
+erase_if(Pred pred)
+{
+  PB_DS_DBG_ONLY(assert_valid(true);)
+
+    if (base_type::empty())
+      {
+        PB_DS_DBG_ONLY(assert_valid(true);)
+
+	  return 0;
+      }
+
+  base_type::to_linked_list();
+
+  node_pointer p_out = base_type::prune(pred);
+
+  size_type ersd = 0;
+
+  while (p_out != NULL)
+    {
+      ++ersd;
+
+      node_pointer p_next = p_out->m_p_next_sibling;
+
+      base_type::actual_erase_node(p_out);
+
+      p_out = p_next;
+    }
+
+  node_pointer p_cur = base_type::m_p_root;
+
+  base_type::m_p_root = NULL;
+
+  while (p_cur != NULL)
+    {
+      node_pointer p_next = p_cur->m_p_next_sibling;
+
+      p_cur->m_p_l_child = p_cur->m_p_prev_or_parent = NULL;
+
+      p_cur->m_metadata = 0;
+
+      p_cur->m_p_next_sibling = base_type::m_p_root;
+
+      if (base_type::m_p_root != NULL)
+	base_type::m_p_root->m_p_prev_or_parent = p_cur;
+
+      base_type::m_p_root = p_cur;
+
+      base_type::m_p_root = fix(base_type::m_p_root);
+
+      p_cur = p_next;
+    }
+
+  m_p_max = NULL;
+
+  PB_DS_DBG_ONLY(assert_valid(true);)
+
+    return ersd;
+}
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/binomial_heap_base_/find_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/binomial_heap_base_/find_fn_imps.hpp
new file mode 100644
index 00000000000..7b26b352a08
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/binomial_heap_base_/find_fn_imps.hpp
@@ -0,0 +1,79 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file find_fn_imps.hpp
+ * Contains an implementation class for a base of binomial heaps.
+ */
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::const_reference
+PB_DS_CLASS_C_DEC::
+top() const
+{
+  PB_DS_DBG_ONLY(assert_valid(false);)
+    PB_DS_DBG_ASSERT(!base_type::empty());
+
+  if (m_p_max == NULL)
+    const_cast<PB_DS_CLASS_C_DEC* >(this)->find_max();
+
+  PB_DS_DBG_ASSERT(m_p_max != NULL);
+  return m_p_max->m_value;
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+find_max()
+{
+  node_pointer p_cur = base_type::m_p_root;
+
+  m_p_max = p_cur;
+
+  while (p_cur != NULL)
+    {
+      if (Cmp_Fn::operator()(m_p_max->m_value, p_cur->m_value))
+	m_p_max = p_cur;
+
+      p_cur = p_cur->m_p_next_sibling;
+    }
+}
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/binomial_heap_base_/insert_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/binomial_heap_base_/insert_fn_imps.hpp
new file mode 100644
index 00000000000..56c99c43029
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/binomial_heap_base_/insert_fn_imps.hpp
@@ -0,0 +1,222 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file insert_fn_imps.hpp
+ * Contains an implementation class for a base of binomial heaps.
+ */
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::point_iterator
+PB_DS_CLASS_C_DEC::
+push(const_reference r_val)
+{
+  PB_DS_DBG_ONLY(assert_valid(true);)
+
+    node_pointer p_nd = base_type::get_new_node_for_insert(r_val);
+
+  insert_node(p_nd);
+
+  m_p_max = NULL;
+
+  PB_DS_DBG_ONLY(assert_valid(true);)
+
+    return point_iterator(p_nd);
+}
+
+PB_DS_CLASS_T_DEC
+inline void
+PB_DS_CLASS_C_DEC::
+insert_node(node_pointer p_nd)
+{
+  if (base_type::m_p_root == NULL)
+    {
+      p_nd->m_p_next_sibling = p_nd->m_p_prev_or_parent =
+	p_nd->m_p_l_child = NULL;
+
+      p_nd->m_metadata = 0;
+
+      base_type::m_p_root = p_nd;
+
+      return;
+    }
+
+  if (base_type::m_p_root->m_metadata > 0)
+    {
+      p_nd->m_p_prev_or_parent = p_nd->m_p_l_child = NULL;
+
+      p_nd->m_p_next_sibling = base_type::m_p_root;
+
+      base_type::m_p_root->m_p_prev_or_parent = p_nd;
+
+      base_type::m_p_root = p_nd;
+
+      p_nd->m_metadata = 0;
+
+      return;
+    }
+
+  if (Cmp_Fn::operator()(base_type::m_p_root->m_value, p_nd->m_value))
+    {
+      p_nd->m_p_next_sibling = base_type::m_p_root->m_p_next_sibling;
+
+      p_nd->m_p_prev_or_parent = NULL;
+
+      p_nd->m_metadata = 1;
+
+      p_nd->m_p_l_child = base_type::m_p_root;
+
+      base_type::m_p_root->m_p_prev_or_parent = p_nd;
+
+      base_type::m_p_root->m_p_next_sibling = NULL;
+
+      base_type::m_p_root = p_nd;
+    }
+  else
+    {
+      p_nd->m_p_next_sibling = NULL;
+
+      p_nd->m_p_l_child = NULL;
+
+      p_nd->m_p_prev_or_parent = base_type::m_p_root;
+
+      p_nd->m_metadata = 0;
+
+      PB_DS_DBG_ASSERT(base_type::m_p_root->m_p_l_child == 0);
+      base_type::m_p_root->m_p_l_child = p_nd;
+
+      base_type::m_p_root->m_metadata = 1;
+    }
+
+  base_type::m_p_root = fix(base_type::m_p_root);
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::node_pointer
+PB_DS_CLASS_C_DEC::
+fix(node_pointer p_nd) const
+{
+  while (p_nd->m_p_next_sibling != NULL&& 
+	 p_nd->m_metadata == p_nd->m_p_next_sibling->m_metadata)
+    {
+      node_pointer p_next = p_nd->m_p_next_sibling;
+
+      if (Cmp_Fn::operator()(p_nd->m_value, p_next->m_value))
+        {
+	  p_next->m_p_prev_or_parent =
+	    p_nd->m_p_prev_or_parent;
+
+	  if (p_nd->m_p_prev_or_parent != NULL)
+	    p_nd->m_p_prev_or_parent->m_p_next_sibling = p_next;
+
+	  base_type::make_child_of(p_nd, p_next);
+
+	  ++p_next->m_metadata;
+
+	  p_nd = p_next;
+        }
+      else
+        {
+	  p_nd->m_p_next_sibling = p_next->m_p_next_sibling;
+
+	  if (p_nd->m_p_next_sibling != NULL)
+	    p_next->m_p_next_sibling = NULL;
+
+	  base_type::make_child_of(p_next, p_nd);
+
+	  ++p_nd->m_metadata;
+        }
+    }
+
+  if (p_nd->m_p_next_sibling != NULL)
+    p_nd->m_p_next_sibling->m_p_prev_or_parent = p_nd;
+
+  return p_nd;
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+modify(point_iterator it, const_reference r_new_val)
+{
+  PB_DS_DBG_ONLY(assert_valid(true);)
+    node_pointer p_nd = it.m_p_nd;
+
+  PB_DS_DBG_ASSERT(p_nd != NULL);
+  PB_DS_DBG_ONLY(base_type::assert_node_consistent(p_nd, false);)
+
+    const bool bubble_up = Cmp_Fn::operator()(p_nd->m_value, r_new_val);
+
+  p_nd->m_value = r_new_val;
+
+  if (bubble_up)
+    {
+      node_pointer p_parent = base_type::parent(p_nd);
+
+      while (p_parent != NULL&& 
+	     Cmp_Fn::operator()(p_parent->m_value, p_nd->m_value))
+        {
+	  base_type::swap_with_parent(p_nd, p_parent);
+
+	  p_parent = base_type::parent(p_nd);
+        }
+
+      if (p_nd->m_p_prev_or_parent == NULL)
+	base_type::m_p_root = p_nd;
+
+      m_p_max = NULL;
+
+      PB_DS_DBG_ONLY(assert_valid(true);)
+
+        return;
+    }
+
+  base_type::bubble_to_top(p_nd);
+
+  remove_parentless_node(p_nd);
+
+  insert_node(p_nd);
+
+  m_p_max = NULL;
+
+  PB_DS_DBG_ONLY(assert_valid(true);)
+    }
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/binomial_heap_base_/split_join_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/binomial_heap_base_/split_join_fn_imps.hpp
new file mode 100644
index 00000000000..2823269b60b
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/binomial_heap_base_/split_join_fn_imps.hpp
@@ -0,0 +1,238 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file split_join_fn_imps.hpp
+ * Contains an implementation class for a base of binomial heaps.
+ */
+
+PB_DS_CLASS_T_DEC
+template<typename Pred>
+void
+PB_DS_CLASS_C_DEC::
+split(Pred pred, PB_DS_CLASS_C_DEC& other)
+{
+  PB_DS_DBG_ONLY(assert_valid(true);)
+    PB_DS_DBG_ONLY(other.assert_valid(true);)
+
+    other.clear();
+
+  if (base_type::empty())
+    {
+      PB_DS_DBG_ONLY(assert_valid(true);)
+        PB_DS_DBG_ONLY(other.assert_valid(true);)
+
+        return;
+    }
+
+  base_type::to_linked_list();
+
+  node_pointer p_out = base_type::prune(pred);
+
+  while (p_out != NULL)
+    {
+      PB_DS_DBG_ASSERT(base_type::m_size > 0);
+      --base_type::m_size;
+
+      ++other.m_size;
+
+      node_pointer p_next = p_out->m_p_next_sibling;
+
+      p_out->m_p_l_child = p_out->m_p_prev_or_parent = NULL;
+
+      p_out->m_metadata = 0;
+
+      p_out->m_p_next_sibling = other.m_p_root;
+
+      if (other.m_p_root != NULL)
+	other.m_p_root->m_p_prev_or_parent = p_out;
+
+      other.m_p_root = p_out;
+
+      other.m_p_root = other.fix(other.m_p_root);
+
+      p_out = p_next;
+    }
+
+  PB_DS_DBG_ONLY(other.assert_valid(true);)
+
+    node_pointer p_cur = base_type::m_p_root;
+
+  base_type::m_p_root = NULL;
+
+  while (p_cur != NULL)
+    {
+      node_pointer p_next = p_cur->m_p_next_sibling;
+
+      p_cur->m_p_l_child = p_cur->m_p_prev_or_parent = NULL;
+
+      p_cur->m_metadata = 0;
+
+      p_cur->m_p_next_sibling = base_type::m_p_root;
+
+      if (base_type::m_p_root != NULL)
+	base_type::m_p_root->m_p_prev_or_parent = p_cur;
+
+      base_type::m_p_root = p_cur;
+
+      base_type::m_p_root = fix(base_type::m_p_root);
+
+      p_cur = p_next;
+    }
+
+  m_p_max = NULL;
+
+  PB_DS_DBG_ONLY(assert_valid(true);)
+    PB_DS_DBG_ONLY(other.assert_valid(true);)
+    }
+
+PB_DS_CLASS_T_DEC
+inline void
+PB_DS_CLASS_C_DEC::
+join(PB_DS_CLASS_C_DEC& other)
+{
+  PB_DS_DBG_ONLY(assert_valid(true);)
+    PB_DS_DBG_ONLY(other.assert_valid(true);)
+
+    node_pointer p_other = other.m_p_root;
+
+  if (p_other != NULL)
+    do
+      {
+	node_pointer p_next = p_other->m_p_next_sibling;
+
+	std::swap(p_other->m_p_next_sibling, p_other->m_p_prev_or_parent);
+
+	p_other = p_next;
+      }
+    while (p_other != NULL);
+
+  base_type::m_p_root = join(base_type::m_p_root, other.m_p_root);
+  base_type::m_size += other.m_size;
+  m_p_max = NULL;
+
+  other.m_p_root = NULL;
+  other.m_size = 0;
+  other.m_p_max = NULL;
+
+  PB_DS_DBG_ONLY(assert_valid(true);)
+    PB_DS_DBG_ONLY(other.assert_valid(true);)
+    }
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::node_pointer
+PB_DS_CLASS_C_DEC::
+join(node_pointer p_lhs, node_pointer p_rhs) const
+{
+  node_pointer p_ret = NULL;
+
+  node_pointer p_cur = NULL;
+
+  while (p_lhs != NULL || p_rhs != NULL)
+    {
+      if (p_rhs == NULL)
+        {
+	  if (p_cur == NULL)
+	    p_ret = p_cur = p_lhs;
+	  else
+            {
+	      p_cur->m_p_next_sibling = p_lhs;
+
+	      p_lhs->m_p_prev_or_parent = p_cur;
+            }
+
+	  p_cur = p_lhs = NULL;
+        }
+      else if (p_lhs == NULL || p_rhs->m_metadata < p_lhs->m_metadata)
+        {
+	  if (p_cur == NULL)
+            {
+	      p_ret = p_cur = p_rhs;
+
+	      p_rhs = p_rhs->m_p_prev_or_parent;
+            }
+	  else
+            {
+	      p_cur->m_p_next_sibling = p_rhs;
+
+	      p_rhs = p_rhs->m_p_prev_or_parent;
+
+	      p_cur->m_p_next_sibling->m_p_prev_or_parent = p_cur;
+
+	      p_cur = p_cur->m_p_next_sibling;
+            }
+        }
+      else if (p_lhs->m_metadata < p_rhs->m_metadata)
+        {
+	  if (p_cur == NULL)
+	    p_ret = p_cur = p_lhs;
+	  else
+            {
+	      p_cur->m_p_next_sibling = p_lhs;
+
+	      p_lhs->m_p_prev_or_parent = p_cur;
+
+	      p_cur = p_cur->m_p_next_sibling;
+            }
+
+	  p_lhs = p_cur->m_p_next_sibling;
+        }
+      else
+        {
+	  node_pointer p_next_rhs = p_rhs->m_p_prev_or_parent;
+
+	  p_rhs->m_p_next_sibling = p_lhs;
+
+	  p_lhs = fix(p_rhs);
+
+	  p_rhs = p_next_rhs;
+        }
+    }
+
+  if (p_cur != NULL)
+    p_cur->m_p_next_sibling = NULL;
+
+  if (p_ret != NULL)
+    p_ret->m_p_prev_or_parent = NULL;
+
+  return p_ret;
+}
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/cc_hash_table_map_/cc_ht_map_.hpp b/libstdc++-v3/include/ext/pb_ds/detail/cc_hash_table_map_/cc_ht_map_.hpp
new file mode 100644
index 00000000000..89cea3fa8fb
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/cc_hash_table_map_/cc_ht_map_.hpp
@@ -0,0 +1,865 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file cc_ht_map_.hpp
+ * Contains an implementation class for cc_ht_map_.
+ */
+
+#include <utility>
+#include <iterator>
+#include <ext/pb_ds/detail/cond_dealtor.hpp>
+#include <ext/pb_ds/tag_and_trait.hpp>
+#include <ext/pb_ds/detail/hash_fn/ranged_hash_fn.hpp>
+#include <ext/pb_ds/detail/types_traits.hpp>
+#include <ext/pb_ds/exception.hpp>
+#include <ext/pb_ds/detail/eq_fn/hash_eq_fn.hpp>
+#ifdef PB_DS_CC_HT_MAP_DEBUG__
+#include <ext/pb_ds/detail/map_debug_base.hpp>
+#endif // #ifdef PB_DS_CC_HT_MAP_DEBUG__
+#ifdef PB_DS_HT_MAP_TRACE_
+#include <iostream>
+#endif // PB_DS_HT_MAP_TRACE_
+
+namespace pb_ds
+{
+  namespace detail
+  {
+
+#ifdef PB_DS_CC_HT_MAP_DEBUG__
+#define PB_DS_DBG_ASSERT(X) assert(X)
+#define PB_DS_DBG_VERIFY(X) assert(X)
+#define PB_DS_DBG_ONLY(X) X
+#else // #ifdef PB_DS_CC_HT_MAP_DEBUG_
+#define PB_DS_DBG_ASSERT(X)
+#define PB_DS_DBG_VERIFY(X) {if((X)==0);}
+#define PB_DS_DBG_ONLY(X) ;
+#endif // #ifdef PB_DS_CC_HT_MAP_DEBUG_
+
+#define PB_DS_CLASS_T_DEC						\
+    template<								\
+						typename Key,		\
+						typename Mapped,	\
+						class Hash_Fn,		\
+						class Eq_Fn,		\
+						class Allocator,	\
+						bool Store_Hash,	\
+						class Comb_Hash_Fn,	\
+						class Resize_Policy>
+
+#ifdef PB_DS_DATA_TRUE_INDICATOR
+#define PB_DS_CLASS_NAME			\
+    cc_ht_map_data_
+#endif // #ifdef PB_DS_DATA_TRUE_INDICATOR
+
+#ifdef PB_DS_DATA_FALSE_INDICATOR
+#define PB_DS_CLASS_NAME			\
+    cc_ht_map_no_data_
+#endif // #ifdef PB_DS_DATA_FALSE_INDICATOR
+
+#define PB_DS_CLASS_C_DEC					\
+    PB_DS_CLASS_NAME<						\
+						Key,		\
+						Mapped,		\
+						Hash_Fn,	\
+						Eq_Fn,		\
+						Allocator,	\
+						Store_Hash,	\
+						Comb_Hash_Fn,	\
+						Resize_Policy >
+
+#define PB_DS_HASH_EQ_FN_C_DEC					\
+    hash_eq_fn<					\
+						Key,		\
+						Eq_Fn,		\
+						Allocator,	\
+						Store_Hash>
+
+#define PB_DS_RANGED_HASH_FN_C_DEC					\
+    ranged_hash_fn<					\
+							Key,		\
+							Hash_Fn,	\
+							Allocator,	\
+							Comb_Hash_Fn,	\
+							Store_Hash>
+
+#define PB_DS_TYPES_TRAITS_C_DEC				\
+    types_traits<						\
+						Key,		\
+						Mapped,		\
+						Allocator,	\
+						Store_Hash>
+
+#ifdef PB_DS_USE_MAP_DEBUG_BASE
+#define PB_DS_MAP_DEBUG_BASE_C_DEC					\
+    map_debug_base<					\
+								Key,	\
+								Eq_Fn,	\
+								typename Allocator::template rebind< \
+												     Key>::other::const_reference>
+#endif // #ifdef PB_DS_USE_MAP_DEBUG_BASE
+
+#ifdef PB_DS_DATA_TRUE_INDICATOR
+#define PB_DS_V2F(X) (X).first
+#define PB_DS_V2S(X) (X).second
+#endif // #ifdef PB_DS_DATA_TRUE_INDICATOR
+
+#ifdef PB_DS_DATA_FALSE_INDICATOR
+#define PB_DS_V2F(X) (X)
+#define PB_DS_V2S(X) Mapped_Data()
+#endif // #ifdef PB_DS_DATA_FALSE_INDICATOR
+
+#define PB_DS_STATIC_ASSERT(UNIQUE, E)					\
+    typedef								\
+    static_assert_dumclass<				\
+									sizeof(static_assert<(bool)(E)>)> \
+    UNIQUE##static_assert_type
+
+    // <011i$i0|\|-<|-|4i|\|i|\|g |-|4$|-| 74813.
+    template<typename Key,
+	     typename Mapped,
+	     class Hash_Fn,
+	     class Eq_Fn,
+	     class Allocator,
+	     bool Store_Hash,
+	     class Comb_Hash_Fn,
+	     class Resize_Policy >
+    class PB_DS_CLASS_NAME:
+#ifdef PB_DS_CC_HT_MAP_DEBUG__
+      protected PB_DS_MAP_DEBUG_BASE_C_DEC,
+#endif // #ifdef PB_DS_CC_HT_MAP_DEBUG__
+      public PB_DS_HASH_EQ_FN_C_DEC,
+      public Resize_Policy,
+      public PB_DS_RANGED_HASH_FN_C_DEC,
+      public PB_DS_TYPES_TRAITS_C_DEC
+    {
+
+    private:
+      typedef typename PB_DS_TYPES_TRAITS_C_DEC::comp_hash comp_hash;
+
+      struct entry : public PB_DS_TYPES_TRAITS_C_DEC::stored_value_type
+      {
+	typename Allocator::template rebind<entry>::other::pointer m_p_next;
+      };
+
+      typedef
+      typename Allocator::template rebind<entry>::other
+      entry_allocator;
+
+      typedef typename entry_allocator::pointer entry_pointer;
+
+      typedef typename entry_allocator::const_pointer const_entry_pointer;
+
+      typedef typename entry_allocator::reference entry_reference;
+
+      typedef
+      typename entry_allocator::const_reference
+      const_entry_reference;
+
+      typedef
+      typename Allocator::template rebind<entry_pointer>::other
+      entry_pointer_allocator;
+
+      typedef typename entry_pointer_allocator::pointer entry_pointer_array;
+
+      typedef typename PB_DS_TYPES_TRAITS_C_DEC::value_type value_type_;
+
+      typedef typename PB_DS_TYPES_TRAITS_C_DEC::pointer pointer_;
+
+      typedef
+      typename PB_DS_TYPES_TRAITS_C_DEC::const_pointer
+      const_pointer_;
+
+      typedef typename PB_DS_TYPES_TRAITS_C_DEC::reference reference_;
+
+      typedef
+      typename PB_DS_TYPES_TRAITS_C_DEC::const_reference
+      const_reference_;
+
+#define PB_DS_GEN_POS							\
+      std::pair<							\
+							entry_pointer,	\
+							typename Allocator::size_type>
+
+#include <ext/pb_ds/detail/unordered_iterator/const_point_iterator.hpp>
+#include <ext/pb_ds/detail/unordered_iterator/point_iterator.hpp>
+#include <ext/pb_ds/detail/unordered_iterator/const_iterator.hpp>
+#include <ext/pb_ds/detail/unordered_iterator/iterator.hpp>
+
+#undef PB_DS_GEN_POS
+
+    public:
+
+      typedef typename Allocator::size_type size_type;
+
+      typedef typename Allocator::difference_type difference_type;
+
+      typedef Hash_Fn hash_fn;
+
+      typedef Eq_Fn eq_fn;
+
+      typedef Allocator allocator;
+
+      typedef Comb_Hash_Fn comb_hash_fn;
+
+      typedef Resize_Policy resize_policy;
+
+      enum
+	{
+	  store_hash = Store_Hash
+	};
+
+      typedef typename PB_DS_TYPES_TRAITS_C_DEC::key_type key_type;
+
+      typedef typename PB_DS_TYPES_TRAITS_C_DEC::key_pointer key_pointer;
+
+      typedef
+      typename PB_DS_TYPES_TRAITS_C_DEC::const_key_pointer
+      const_key_pointer;
+
+      typedef typename PB_DS_TYPES_TRAITS_C_DEC::key_reference key_reference;
+
+      typedef
+      typename PB_DS_TYPES_TRAITS_C_DEC::const_key_reference
+      const_key_reference;
+
+      typedef typename PB_DS_TYPES_TRAITS_C_DEC::mapped_type mapped_type;
+
+      typedef
+      typename PB_DS_TYPES_TRAITS_C_DEC::mapped_pointer
+      mapped_pointer;
+
+      typedef
+      typename PB_DS_TYPES_TRAITS_C_DEC::const_mapped_pointer
+      const_mapped_pointer;
+
+      typedef
+      typename PB_DS_TYPES_TRAITS_C_DEC::mapped_reference
+      mapped_reference;
+
+      typedef
+      typename PB_DS_TYPES_TRAITS_C_DEC::const_mapped_reference
+      const_mapped_reference;
+
+      typedef typename PB_DS_TYPES_TRAITS_C_DEC::value_type value_type;
+
+      typedef typename PB_DS_TYPES_TRAITS_C_DEC::pointer pointer;
+
+      typedef typename PB_DS_TYPES_TRAITS_C_DEC::const_pointer const_pointer;
+
+      typedef typename PB_DS_TYPES_TRAITS_C_DEC::reference reference;
+
+      typedef
+      typename PB_DS_TYPES_TRAITS_C_DEC::const_reference
+      const_reference;
+
+#ifdef PB_DS_DATA_TRUE_INDICATOR
+      typedef point_iterator_ point_iterator;
+#endif // #ifdef PB_DS_DATA_TRUE_INDICATOR
+
+#ifdef PB_DS_DATA_FALSE_INDICATOR
+      typedef const_point_iterator_ point_iterator;
+#endif // #ifdef PB_DS_DATA_FALSE_INDICATOR
+
+      typedef const_point_iterator_ const_point_iterator;
+
+#ifdef PB_DS_DATA_TRUE_INDICATOR
+      typedef iterator_ iterator;
+#endif // #ifdef PB_DS_DATA_TRUE_INDICATOR
+
+#ifdef PB_DS_DATA_FALSE_INDICATOR
+      typedef const_iterator_ iterator;
+#endif // #ifdef PB_DS_DATA_FALSE_INDICATOR
+
+      typedef const_iterator_ const_iterator;
+
+    public:
+
+      PB_DS_CLASS_NAME();
+
+      PB_DS_CLASS_NAME(const Hash_Fn& r_hash_fn);
+
+      PB_DS_CLASS_NAME(const Hash_Fn& r_hash_fn, const Eq_Fn& r_eq_fn);
+
+      PB_DS_CLASS_NAME(const Hash_Fn& r_hash_fn, const Eq_Fn& r_eq_fn, const Comb_Hash_Fn& r_comb_hash_fn);
+
+      PB_DS_CLASS_NAME(const Hash_Fn& r_hash_fn, const Eq_Fn& r_eq_fn, const Comb_Hash_Fn& r_comb_hash_fn, const Resize_Policy& r_resize_policy);
+
+      PB_DS_CLASS_NAME(const PB_DS_CLASS_C_DEC& other);
+
+      virtual
+      ~PB_DS_CLASS_NAME();
+
+      void
+      swap(PB_DS_CLASS_C_DEC& other);
+
+      template<typename It>
+      void
+      copy_from_range(It first_it, It last_it);
+
+      void
+      initialize();
+
+      inline size_type
+      size() const;
+
+      inline size_type
+      max_size() const;
+
+      inline bool
+      empty() const;
+
+      Hash_Fn& 
+      get_hash_fn();
+
+      const Hash_Fn& 
+      get_hash_fn() const;
+
+      Eq_Fn& 
+      get_eq_fn();
+
+      const Eq_Fn& 
+      get_eq_fn() const;
+
+      Comb_Hash_Fn& 
+      get_comb_hash_fn();
+
+      const Comb_Hash_Fn& 
+      get_comb_hash_fn() const;
+
+      Resize_Policy& 
+      get_resize_policy();
+
+      const Resize_Policy& 
+      get_resize_policy() const;
+
+      inline std::pair<point_iterator, bool>
+      insert(const_reference r_val)
+      {
+	return (insert_imp(r_val, traits_base::m_store_extra_indicator));
+      }
+
+      inline mapped_reference
+      operator[](const_key_reference r_key)
+      {
+#ifdef PB_DS_DATA_TRUE_INDICATOR
+	return (subscript_imp(r_key, traits_base::m_store_extra_indicator));
+#else // #ifdef PB_DS_DATA_TRUE_INDICATOR
+	insert(r_key);
+
+	return (traits_base::s_null_mapped);
+#endif // #ifdef PB_DS_DATA_TRUE_INDICATOR
+      }
+
+      inline point_iterator
+      find(const_key_reference r_key);
+
+      inline const_point_iterator
+      find(const_key_reference r_key) const;
+
+      inline point_iterator
+      find_end();
+
+      inline const_point_iterator
+      find_end() const;
+
+      inline bool
+      erase(const_key_reference r_key);
+
+      template<typename Pred>
+      inline size_type
+      erase_if(Pred pred);
+
+      void
+      clear();
+
+      inline iterator
+      begin();
+
+      inline const_iterator
+      begin() const;
+
+      inline iterator
+      end();
+
+      inline const_iterator
+      end() const;
+
+#ifdef PB_DS_CC_HT_MAP_DEBUG__
+
+      void
+      assert_valid() const;
+
+#endif // #ifdef PB_DS_CC_HT_MAP_DEBUG__
+
+#ifdef PB_DS_HT_MAP_TRACE_
+
+      void
+      trace() const;
+
+#endif // #ifdef PB_DS_HT_MAP_TRACE_
+
+    private:
+      typedef PB_DS_TYPES_TRAITS_C_DEC traits_base;
+
+      typedef PB_DS_RANGED_HASH_FN_C_DEC ranged_hash_fn_base;
+
+      typedef PB_DS_HASH_EQ_FN_C_DEC hash_eq_fn_base;
+
+      typedef Resize_Policy resize_base;
+
+#ifdef PB_DS_CC_HT_MAP_DEBUG__
+      typedef PB_DS_MAP_DEBUG_BASE_C_DEC map_debug_base;
+#endif // #ifdef PB_DS_CC_HT_MAP_DEBUG__
+
+      typedef
+      typename PB_DS_TYPES_TRAITS_C_DEC::store_extra_false_type
+      store_hash_false_type;
+
+      typedef
+      typename PB_DS_TYPES_TRAITS_C_DEC::store_extra_true_type
+      store_hash_true_type;
+
+      typedef
+      typename PB_DS_TYPES_TRAITS_C_DEC::
+      no_throw_copies_false_type
+      no_throw_copies_false_type;
+
+      typedef
+      typename PB_DS_TYPES_TRAITS_C_DEC::
+      no_throw_copies_true_type
+      no_throw_copies_true_type;
+
+    private:
+
+      void
+      deallocate_all();
+
+      inline bool
+      do_resize_if_needed();
+
+      inline void
+      do_resize_if_needed_no_throw();
+
+      void
+      resize_imp(size_type new_size);
+
+      void
+      do_resize(size_type new_size);
+
+      void
+      resize_imp_no_exceptions(size_type new_size, entry_pointer_array a_p_entries_resized, size_type old_size);
+
+      inline entry_pointer
+      resize_imp_no_exceptions_reassign_pointer(entry_pointer p_e, entry_pointer_array a_p_entries_resized, store_hash_false_type);
+
+      inline entry_pointer
+      resize_imp_no_exceptions_reassign_pointer(entry_pointer p_e, entry_pointer_array a_p_entries_resized, store_hash_true_type);
+
+      void
+      deallocate_links_in_list(entry_pointer p_e);
+
+      inline entry_pointer
+      get_entry(const_reference r_val, no_throw_copies_false_type);
+
+      inline entry_pointer
+      get_entry(const_reference r_val, no_throw_copies_true_type);
+
+      inline void
+      rels_entry(entry_pointer p_e);
+
+#ifdef PB_DS_DATA_TRUE_INDICATOR
+      inline mapped_reference
+      subscript_imp(const_key_reference r_key, store_hash_false_type)
+      {
+	PB_DS_DBG_ONLY(assert_valid();)
+
+	  const size_type pos = ranged_hash_fn_base::operator()(r_key);
+
+	entry_pointer p_e = m_a_p_entries[pos];
+
+	resize_base::notify_insert_search_start();
+
+	while (p_e != NULL&& 
+	       !hash_eq_fn_base::operator()(p_e->m_value.first, r_key))
+	  {
+	    resize_base::notify_insert_search_collision();
+
+	    p_e = p_e->m_p_next;
+	  }
+
+	resize_base::notify_insert_search_end();
+
+	if (p_e != NULL)
+	  {
+	    PB_DS_DBG_ONLY(map_debug_base::check_key_exists(r_key);)
+
+	      return (p_e->m_value.second);
+	  }
+
+	PB_DS_DBG_ONLY(map_debug_base::check_key_does_not_exist(r_key);)
+
+	  return (insert_new_imp(
+				 value_type(
+					    r_key,
+					    mapped_type()),
+				 pos)->second);
+      }
+
+      inline mapped_reference
+      subscript_imp(const_key_reference r_key, store_hash_true_type)
+      {
+	PB_DS_DBG_ONLY(assert_valid();)
+
+	  comp_hash pos_hash_pair = ranged_hash_fn_base::operator()(r_key);
+
+	entry_pointer p_e = m_a_p_entries[pos_hash_pair.first];
+
+	resize_base::notify_insert_search_start();
+
+	while (p_e != NULL&& 
+	       !hash_eq_fn_base::operator()(p_e->m_value.first, p_e->m_hash, r_key, pos_hash_pair.second))
+	  {
+	    resize_base::notify_insert_search_collision();
+
+	    p_e = p_e->m_p_next;
+	  }
+
+	resize_base::notify_insert_search_end();
+
+	if (p_e != NULL)
+	  {
+	    PB_DS_DBG_ONLY(map_debug_base::check_key_exists(r_key);)
+
+	      return (p_e->m_value.second);
+	  }
+
+	PB_DS_DBG_ONLY(map_debug_base::check_key_does_not_exist(r_key);)
+
+	  return (insert_new_imp(
+				 value_type(
+					    r_key,
+					    mapped_type()),
+				 pos_hash_pair)->second);
+      }
+#endif // #ifdef PB_DS_DATA_TRUE_INDICATOR
+
+      inline std::pair<
+	point_iterator,
+	bool>
+      insert_imp(const_reference r_val, store_hash_false_type);
+
+      inline std::pair<
+	point_iterator,
+	bool>
+      insert_imp(const_reference r_val, store_hash_true_type);
+
+      inline pointer
+      insert_new_imp(const_reference r_val, size_type pos)
+      {
+	if (do_resize_if_needed())
+	  pos = ranged_hash_fn_base::operator()(PB_DS_V2F(r_val));
+
+	// Following lines might throw an exception.
+	entry_pointer p_e = get_entry(            r_val, PB_DS_TYPES_TRAITS_C_DEC::m_no_throw_copies_indicator);
+
+	// At this point no exceptions can be thrown.
+
+	p_e->m_p_next = m_a_p_entries[pos];
+
+	m_a_p_entries[pos] = p_e;
+
+	resize_base::notify_inserted(++m_num_used_e);
+
+	PB_DS_DBG_ONLY(map_debug_base::insert_new(
+						  PB_DS_V2F(r_val));)
+
+	  PB_DS_DBG_ONLY(assert_valid();)
+
+	  return (&p_e->m_value);
+      }
+
+      inline pointer
+      insert_new_imp(const_reference r_val, comp_hash& r_pos_hash_pair)
+      {
+	// Following lines might throw an exception.
+
+	if (do_resize_if_needed())
+	  r_pos_hash_pair = ranged_hash_fn_base::operator()(
+							    PB_DS_V2F(r_val));
+
+	entry_pointer p_e = get_entry(            r_val, PB_DS_TYPES_TRAITS_C_DEC::m_no_throw_copies_indicator);
+
+	// At this point no exceptions can be thrown.
+
+	p_e->m_hash = r_pos_hash_pair.second;
+
+	p_e->m_p_next = m_a_p_entries[r_pos_hash_pair.first];
+
+	m_a_p_entries[r_pos_hash_pair.first] = p_e;
+
+	resize_base::notify_inserted(++m_num_used_e);
+
+	PB_DS_DBG_ONLY(map_debug_base::insert_new(
+						  PB_DS_V2F(r_val));)
+
+	  PB_DS_DBG_ONLY(assert_valid();)
+
+	  return (&p_e->m_value);
+      }
+
+      inline pointer
+      find_key_pointer(const_key_reference r_key, store_hash_false_type)
+      {
+	entry_pointer p_e =
+	  m_a_p_entries[ranged_hash_fn_base::operator()(r_key)];
+
+	resize_base::notify_find_search_start();
+
+	while (p_e != NULL&& 
+	       !hash_eq_fn_base::operator()(PB_DS_V2F(p_e->m_value), r_key))
+	  {
+	    resize_base::notify_find_search_collision();
+
+	    p_e = p_e->m_p_next;
+	  }
+
+	resize_base::notify_find_search_end();
+
+#ifdef PB_DS_CC_HT_MAP_DEBUG_
+	if (p_e == NULL)
+	  map_debug_base::check_key_does_not_exist(r_key);
+	else
+	  map_debug_base::check_key_exists(r_key);
+#endif // #ifdef PB_DS_CC_HT_MAP_DEBUG_
+
+	return (&p_e->m_value);
+      }
+
+      inline pointer
+      find_key_pointer(const_key_reference r_key, store_hash_true_type)
+      {
+	comp_hash pos_hash_pair = ranged_hash_fn_base::operator()(r_key);
+
+	entry_pointer p_e = m_a_p_entries[pos_hash_pair.first];
+
+	resize_base::notify_find_search_start();
+
+	while (p_e != NULL&& 
+	       !hash_eq_fn_base::operator()(
+					    PB_DS_V2F(p_e->m_value),
+					    p_e->m_hash,
+					    r_key, pos_hash_pair.second))
+	  {
+	    resize_base::notify_find_search_collision();
+
+	    p_e = p_e->m_p_next;
+	  }
+
+	resize_base::notify_find_search_end();
+
+#ifdef PB_DS_CC_HT_MAP_DEBUG_
+	if (p_e == NULL)
+	  map_debug_base::check_key_does_not_exist(r_key);
+	else
+	  map_debug_base::check_key_exists(r_key);
+#endif // #ifdef PB_DS_CC_HT_MAP_DEBUG_
+
+	return (&p_e->m_value);
+      }
+
+      inline bool
+      erase_in_pos_imp(const_key_reference r_key, size_type pos);
+
+      inline bool
+      erase_in_pos_imp(const_key_reference r_key, const comp_hash& r_pos_hash_pair);
+
+      inline void
+      erase_entry_pointer(entry_pointer& r_p_e);
+
+#ifdef PB_DS_DATA_TRUE_INDICATOR
+      void
+      inc_it_state(pointer& r_p_value, std::pair<entry_pointer, size_type>& r_pos) const
+      {
+	inc_it_state((const_mapped_pointer& )r_p_value, r_pos);
+      }
+#endif // #ifdef PB_DS_DATA_TRUE_INDICATOR
+
+      void
+      inc_it_state(const_pointer& r_p_value, std::pair<entry_pointer, size_type>& r_pos) const
+      {
+	PB_DS_DBG_ASSERT(r_p_value != NULL);
+
+	r_pos.first = r_pos.first->m_p_next;
+
+	if (r_pos.first != NULL)
+	  {
+	    r_p_value =& r_pos.first->m_value;
+
+	    return;
+	  }
+
+	for (++r_pos.second; r_pos.second < m_num_e_p; ++r_pos.second)
+	  if (m_a_p_entries[r_pos.second] != NULL)
+	    {
+	      r_pos.first = m_a_p_entries[r_pos.second];
+
+	      r_p_value =& r_pos.first->m_value;
+
+	      return;
+	    }
+
+	r_p_value = NULL;
+      }
+
+      void
+      get_start_it_state(pointer& r_p_value, std::pair<entry_pointer, size_type>& r_pos) const
+      {
+	for (r_pos.second = 0; r_pos.second < m_num_e_p; ++r_pos.second)
+	  if (m_a_p_entries[r_pos.second] != NULL)
+	    {
+	      r_pos.first = m_a_p_entries[r_pos.second];
+
+	      r_p_value =& r_pos.first->m_value;
+
+	      return;
+	    }
+
+	r_p_value = NULL;
+      }
+
+#ifdef PB_DS_CC_HT_MAP_DEBUG__
+
+      void
+      assert_entry_pointer_array_valid(const entry_pointer_array a_p_entries) const;
+
+      void
+      assert_entry_pointer_valid(const entry_pointer p_e, store_hash_true_type) const;
+
+      void
+      assert_entry_pointer_valid(const entry_pointer p_e, store_hash_false_type) const;
+
+#endif // #ifdef PB_DS_CC_HT_MAP_DEBUG__
+
+#ifdef PB_DS_HT_MAP_TRACE_
+
+      void
+      trace_list(const_entry_pointer p_l) const;
+
+#endif // #ifdef PB_DS_HT_MAP_TRACE_
+
+    private:
+      static entry_allocator s_entry_allocator;
+
+      static entry_pointer_allocator s_entry_pointer_allocator;
+
+      typedef cond_dealtor< entry, Allocator> cond_dealtor_t;
+
+      entry_pointer_array m_a_p_entries;
+
+      size_type m_num_e_p;
+
+      size_type m_num_used_e;
+
+#ifdef PB_DS_DATA_TRUE_INDICATOR
+      friend class iterator_;
+#endif // #ifdef PB_DS_DATA_TRUE_INDICATOR
+
+      friend class const_iterator_;
+
+      static iterator s_end_it;
+
+      static const_iterator s_const_end_it;
+
+      static point_iterator s_find_end_it;
+
+      static const_point_iterator s_const_find_end_it;
+
+      enum
+	{
+	  store_hash_ok =
+	  !Store_Hash ||
+	  !is_same<
+	  Hash_Fn,
+	  pb_ds::null_hash_fn>::value
+	};
+
+      PB_DS_STATIC_ASSERT(sth, store_hash_ok);
+    };
+
+#include <ext/pb_ds/detail/cc_hash_table_map_/constructor_destructor_fn_imps.hpp>
+#include <ext/pb_ds/detail/cc_hash_table_map_/entry_list_fn_imps.hpp>
+#include <ext/pb_ds/detail/cc_hash_table_map_/find_fn_imps.hpp>
+#include <ext/pb_ds/detail/cc_hash_table_map_/resize_fn_imps.hpp>
+#include <ext/pb_ds/detail/cc_hash_table_map_/debug_fn_imps.hpp>
+#include <ext/pb_ds/detail/cc_hash_table_map_/size_fn_imps.hpp>
+#include <ext/pb_ds/detail/cc_hash_table_map_/policy_access_fn_imps.hpp>
+#include <ext/pb_ds/detail/cc_hash_table_map_/erase_fn_imps.hpp>
+#include <ext/pb_ds/detail/cc_hash_table_map_/iterators_fn_imps.hpp>
+#include <ext/pb_ds/detail/cc_hash_table_map_/insert_fn_imps.hpp>
+#include <ext/pb_ds/detail/cc_hash_table_map_/trace_fn_imps.hpp>
+
+#undef PB_DS_CLASS_T_DEC
+
+#undef PB_DS_CLASS_C_DEC
+
+#undef PB_DS_HASH_EQ_FN_C_DEC
+
+#undef PB_DS_RANGED_HASH_FN_C_DEC
+
+#undef PB_DS_TYPES_TRAITS_C_DEC
+
+#undef PB_DS_MAP_DEBUG_BASE_C_DEC
+
+#undef PB_DS_CLASS_NAME
+
+#undef PB_DS_V2F
+#undef PB_DS_V2S
+
+#undef PB_DS_DBG_ASSERT
+#undef PB_DS_DBG_VERIFY
+#undef PB_DS_DBG_ONLY
+
+#undef PB_DS_STATIC_ASSERT
+
+  } // namespace detail
+} // namespace pb_ds
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/cc_hash_table_map_/cmp_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/cc_hash_table_map_/cmp_fn_imps.hpp
new file mode 100644
index 00000000000..6b398b0450c
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/cc_hash_table_map_/cmp_fn_imps.hpp
@@ -0,0 +1,94 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file cmp_fn_imps.hpp
+ * Contains implementations of cc_ht_map_'s entire container comparison related
+ *    functions.
+ */
+
+PB_DS_CLASS_T_DEC
+template<typename Other_HT_Map_Type>
+bool
+PB_DS_CLASS_C_DEC::
+operator==(const Other_HT_Map_Type& other) const
+{
+  return (cmp_with_other(other));
+}
+
+PB_DS_CLASS_T_DEC
+template<typename Other_Map_Type>
+bool
+PB_DS_CLASS_C_DEC::
+cmp_with_other(const Other_Map_Type& other) const
+{
+  if (size() != other.size())
+    return (false);
+
+  for (typename Other_Map_Type::const_iterator it = other.begin();
+       it != other.end(); ++it)
+    {
+      const_key_reference r_key =(const_key_reference)PB_DS_V2F(*it);
+
+      const_mapped_pointer p_mapped_value =
+	const_cast<PB_DS_CLASS_C_DEC& >(*this).
+	find_key_pointer(r_key, traits_base::m_store_hash_indicator);
+
+      if (p_mapped_value == NULL)
+	return (false);
+
+#ifdef PB_DS_DATA_TRUE_INDICATOR
+      if (p_mapped_value->second != it->second)
+	return (false);
+#endif // #ifdef PB_DS_DATA_TRUE_INDICATOR
+    }
+
+  return (true);
+}
+
+PB_DS_CLASS_T_DEC
+template<typename Other_HT_Map_Type>
+bool
+PB_DS_CLASS_C_DEC::
+operator!=(const Other_HT_Map_Type& other) const
+{
+  return (!operator==(other));
+}
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/cc_hash_table_map_/cond_key_dtor_entry_dealtor.hpp b/libstdc++-v3/include/ext/pb_ds/detail/cc_hash_table_map_/cond_key_dtor_entry_dealtor.hpp
new file mode 100644
index 00000000000..54859e83562
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/cc_hash_table_map_/cond_key_dtor_entry_dealtor.hpp
@@ -0,0 +1,138 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file cond_key_dtor_entry_dealtor.hpp
+ * Contains a conditional key destructor, used for exception handling.
+ */
+
+namespace pb_ds
+{
+  namespace detail
+  {
+
+#define PB_DS_CLASS_T_DEC			\
+    template<typename HT_Map>
+
+#define PB_DS_CLASS_C_DEC				\
+    PB_DS_CKDED_CLASS_NAME<				\
+						HT_Map>
+
+    /**
+     * A conditional key destructor, used for exception handling.
+     **/
+    template<typename HT_Map>
+    class PB_DS_CKDED_CLASS_NAME
+    {
+    public:
+      typedef typename HT_Map::entry entry;
+
+      typedef typename HT_Map::entry_allocator entry_allocator;
+
+      typedef typename HT_Map::key_type key_type;
+
+    public:
+      inline
+      PB_DS_CKDED_CLASS_NAME(entry_allocator* p_a, entry* p_e);
+
+      inline
+      ~PB_DS_CKDED_CLASS_NAME();
+
+      inline void
+      set_key_destruct();
+
+      inline void
+      set_no_action_destructor();
+
+    protected:
+      entry_allocator* const m_p_a;
+      entry* const m_p_e;
+
+      bool m_key_destruct;
+      bool m_no_action_destructor;
+    };
+
+    PB_DS_CLASS_T_DEC
+    inline
+    PB_DS_CLASS_C_DEC::
+    PB_DS_CKDED_CLASS_NAME(entry_allocator* p_a, entry* p_e) :
+      m_p_a(p_a),
+      m_p_e(p_e),
+      m_key_destruct(false),
+      m_no_action_destructor(false)
+    { }
+
+    PB_DS_CLASS_T_DEC
+    inline void
+    PB_DS_CLASS_C_DEC::
+    set_key_destruct()
+    {
+      m_key_destruct = true;
+    }
+
+    PB_DS_CLASS_T_DEC
+    inline void
+    PB_DS_CLASS_C_DEC::
+    set_no_action_destructor()
+    {
+      m_no_action_destructor = true;
+    }
+
+    PB_DS_CLASS_T_DEC
+    inline
+    PB_DS_CLASS_C_DEC::
+    ~PB_DS_CKDED_CLASS_NAME()
+    {
+      if (m_no_action_destructor)
+	return;
+
+      if (m_key_destruct)
+	m_p_e->m_value.first.~key_type();
+
+      m_p_a->deallocate(m_p_e, 1);
+    }
+
+#undef PB_DS_CLASS_T_DEC
+#undef PB_DS_CLASS_C_DEC
+
+  } // namespace detail
+} // namespace pb_ds
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/cc_hash_table_map_/constructor_destructor_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/cc_hash_table_map_/constructor_destructor_fn_imps.hpp
new file mode 100644
index 00000000000..1fe673fd3de
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/cc_hash_table_map_/constructor_destructor_fn_imps.hpp
@@ -0,0 +1,239 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file constructor_destructor_fn_imps.hpp
+ * Contains implementations of cc_ht_map_'s constructors, destructor,
+ *    and related functions.
+ */
+
+PB_DS_CLASS_T_DEC
+typename PB_DS_CLASS_C_DEC::entry_allocator
+PB_DS_CLASS_C_DEC::s_entry_allocator;
+
+PB_DS_CLASS_T_DEC
+typename PB_DS_CLASS_C_DEC::entry_pointer_allocator
+PB_DS_CLASS_C_DEC::s_entry_pointer_allocator;
+
+PB_DS_CLASS_T_DEC
+template<typename It>
+void
+PB_DS_CLASS_C_DEC::
+copy_from_range(It first_it, It last_it)
+{
+  while (first_it != last_it)
+    insert(*(first_it++));
+}
+
+PB_DS_CLASS_T_DEC
+PB_DS_CLASS_C_DEC::
+PB_DS_CLASS_NAME() :
+  ranged_hash_fn_base(resize_base::get_nearest_larger_size(1)),
+  m_a_p_entries(s_entry_pointer_allocator.allocate(
+						   resize_base::get_nearest_larger_size(1))),
+  m_num_e_p(resize_base::get_nearest_larger_size(1)),
+  m_num_used_e(0)
+{
+  initialize();
+
+  PB_DS_DBG_ONLY(PB_DS_CLASS_C_DEC::assert_valid();)
+    }
+
+PB_DS_CLASS_T_DEC
+PB_DS_CLASS_C_DEC::
+PB_DS_CLASS_NAME(const Hash_Fn& r_hash_fn) :
+  ranged_hash_fn_base(resize_base::get_nearest_larger_size(1),
+		      r_hash_fn),
+  m_a_p_entries(s_entry_pointer_allocator.allocate(
+						   resize_base::get_nearest_larger_size(1))),
+  m_num_e_p(resize_base::get_nearest_larger_size(1)),
+  m_num_used_e(0)
+{
+  initialize();
+
+  PB_DS_DBG_ONLY(PB_DS_CLASS_C_DEC::assert_valid();)
+    }
+
+PB_DS_CLASS_T_DEC
+PB_DS_CLASS_C_DEC::
+PB_DS_CLASS_NAME(const Hash_Fn& r_hash_fn, const Eq_Fn& r_eq_fn) :
+  PB_DS_HASH_EQ_FN_C_DEC(r_eq_fn),
+  ranged_hash_fn_base(resize_base::get_nearest_larger_size(1),
+		      r_hash_fn),
+  m_a_p_entries(s_entry_pointer_allocator.allocate(
+						   resize_base::get_nearest_larger_size(1))),
+  m_num_e_p(resize_base::get_nearest_larger_size(1)),
+  m_num_used_e(0)
+{
+  std::fill(m_a_p_entries, m_a_p_entries + m_num_e_p, (entry_pointer)NULL);
+
+  Resize_Policy::notify_cleared();
+
+  ranged_hash_fn_base::notify_resized(m_num_e_p);
+
+  PB_DS_DBG_ONLY(PB_DS_CLASS_C_DEC::assert_valid();)
+    }
+
+PB_DS_CLASS_T_DEC
+PB_DS_CLASS_C_DEC::
+PB_DS_CLASS_NAME(const Hash_Fn& r_hash_fn, const Eq_Fn& r_eq_fn, const Comb_Hash_Fn& r_comb_hash_fn) :
+  PB_DS_HASH_EQ_FN_C_DEC(r_eq_fn),
+  ranged_hash_fn_base(
+		      resize_base::get_nearest_larger_size(1),
+		      r_hash_fn,
+		      r_comb_hash_fn),
+  m_a_p_entries(s_entry_pointer_allocator.allocate(
+						   resize_base::get_nearest_larger_size(1))),
+  m_num_e_p(resize_base::get_nearest_larger_size(1)),
+  m_num_used_e(0)
+{
+  initialize();
+
+  PB_DS_DBG_ONLY(PB_DS_CLASS_C_DEC::assert_valid();)
+    }
+
+PB_DS_CLASS_T_DEC
+PB_DS_CLASS_C_DEC::
+PB_DS_CLASS_NAME(const Hash_Fn& r_hash_fn, const Eq_Fn& r_eq_fn, const Comb_Hash_Fn& r_comb_hash_fn, const Resize_Policy& r_resize_policy) :
+  PB_DS_HASH_EQ_FN_C_DEC(r_eq_fn),
+  Resize_Policy(r_resize_policy),
+  ranged_hash_fn_base(
+		      resize_base::get_nearest_larger_size(1),
+		      r_hash_fn,
+		      r_comb_hash_fn),
+  m_a_p_entries(s_entry_pointer_allocator.allocate(
+						   resize_base::get_nearest_larger_size(1))),
+  m_num_e_p(resize_base::get_nearest_larger_size(1)),
+  m_num_used_e(0)
+{
+  initialize();
+
+  PB_DS_DBG_ONLY(PB_DS_CLASS_C_DEC::assert_valid();)
+    }
+
+PB_DS_CLASS_T_DEC
+PB_DS_CLASS_C_DEC::
+PB_DS_CLASS_NAME(const PB_DS_CLASS_C_DEC& other) :
+#ifdef PB_DS_CC_HT_MAP_DEBUG_
+  PB_DS_MAP_DEBUG_BASE_C_DEC(other),
+#endif // #ifdef PB_DS_CC_HT_MAP_DEBUG_
+  PB_DS_HASH_EQ_FN_C_DEC(other),
+  resize_base(other),
+  ranged_hash_fn_base(other),
+  m_a_p_entries(m_a_p_entries = s_entry_pointer_allocator.allocate(
+								   resize_base::get_nearest_larger_size(1))),
+  m_num_e_p(resize_base::get_nearest_larger_size(1)),
+  m_num_used_e(0)
+{
+  initialize();
+
+  PB_DS_DBG_ONLY(PB_DS_CLASS_C_DEC::assert_valid();)
+
+    try
+      {
+        copy_from_range(other.begin(), other.end());
+      }
+    catch(...)
+      {
+        deallocate_all();
+
+        throw;
+      }
+
+  PB_DS_DBG_ONLY(PB_DS_CLASS_C_DEC::assert_valid();)
+    }
+
+PB_DS_CLASS_T_DEC
+PB_DS_CLASS_C_DEC::
+~PB_DS_CLASS_NAME()
+{
+  deallocate_all();
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+swap(PB_DS_CLASS_C_DEC& other)
+{
+  PB_DS_DBG_ONLY(assert_valid());
+  PB_DS_DBG_ONLY(other.assert_valid());
+
+  std::swap(m_a_p_entries, other.m_a_p_entries);
+
+  std::swap(m_num_e_p, other.m_num_e_p);
+
+  std::swap(m_num_used_e, other.m_num_used_e);
+
+  ranged_hash_fn_base::swap(other);
+
+  hash_eq_fn_base::swap(other);
+
+  resize_base::swap(other);
+
+  PB_DS_DBG_ONLY(map_debug_base::swap(other));
+
+  PB_DS_DBG_ONLY(assert_valid());
+  PB_DS_DBG_ONLY(other.assert_valid());
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+deallocate_all()
+{
+  clear();
+
+  s_entry_pointer_allocator.deallocate(m_a_p_entries, m_num_e_p);
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+initialize()
+{
+  std::fill(m_a_p_entries, m_a_p_entries + m_num_e_p, (entry_pointer)NULL);
+
+  Resize_Policy::notify_resized(m_num_e_p);
+
+  Resize_Policy::notify_cleared();
+
+  ranged_hash_fn_base::notify_resized(m_num_e_p);
+}
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/cc_hash_table_map_/constructor_destructor_no_store_hash_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/cc_hash_table_map_/constructor_destructor_no_store_hash_fn_imps.hpp
new file mode 100644
index 00000000000..db1eac3b7e5
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/cc_hash_table_map_/constructor_destructor_no_store_hash_fn_imps.hpp
@@ -0,0 +1,63 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file constructor_destructor_no_store_hash_fn_imps.hpp
+ * Contains implementations of cc_ht_map_'s constructors, destructor,
+ *    and related functions.
+ */
+
+PB_DS_CLASS_T_DEC
+inline void
+PB_DS_CLASS_C_DEC::
+constructor_insert_new_imp(const_mapped_reference r_val, size_type pos, integral_constant<int,false>)
+{
+  // Following lines might throw an exception.
+  entry_pointer p_e = get_entry(r_val, traits_base::s_no_throw_copies_indicator);
+
+  // At this point no exceptions can be thrown.
+
+  p_e->m_p_next = m_a_p_entries[pos];
+
+  m_a_p_entries[pos] = p_e;
+
+  PB_DS_DBG_ONLY(map_debug_base::insert_new(r_key);)
+    }
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/cc_hash_table_map_/constructor_destructor_store_hash_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/cc_hash_table_map_/constructor_destructor_store_hash_fn_imps.hpp
new file mode 100644
index 00000000000..9771d093306
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/cc_hash_table_map_/constructor_destructor_store_hash_fn_imps.hpp
@@ -0,0 +1,65 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file constructor_destructor_store_hash_fn_imps.hpp
+ * Contains implementations of cc_ht_map_'s constructors, destructor,
+ *    and related functions.
+ */
+
+PB_DS_CLASS_T_DEC
+inline void
+PB_DS_CLASS_C_DEC::
+constructor_insert_new_imp(const_reference r_val, size_type pos, true_type)
+{
+  // Following lines might throw an exception.
+  entry_pointer p_e = get_entry(r_val, traits_base::s_no_throw_copies_indicator);
+
+  // At this point no exceptions can be thrown.
+
+  p_e->m_p_next = m_a_p_entries[pos];
+
+  p_e->m_hash = ranged_hash_fn_base::operator()((const_key_reference)(PB_DS_V2F(p_e->m_value))).second;
+
+  m_a_p_entries[pos] = p_e;
+
+  PB_DS_DBG_ONLY(map_debug_base::insert_new(r_key);)
+    }
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/cc_hash_table_map_/debug_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/cc_hash_table_map_/debug_fn_imps.hpp
new file mode 100644
index 00000000000..73f747c898a
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/cc_hash_table_map_/debug_fn_imps.hpp
@@ -0,0 +1,86 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file debug_fn_imps.hpp
+ * Contains implementations of cc_ht_map_'s debug-mode functions.
+ */
+
+#ifdef PB_DS_CC_HT_MAP_DEBUG__
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+assert_valid() const
+{
+  map_debug_base::check_size(m_num_used_e);
+
+  assert_entry_pointer_array_valid(m_a_p_entries);
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+assert_entry_pointer_array_valid(const entry_pointer_array a_p_entries) const
+{
+  size_type iterated_num_used_e = 0;
+
+  for (size_type pos = 0; pos < m_num_e_p; ++pos)
+    {
+      entry_pointer p_e = a_p_entries[pos];
+
+      while (p_e != NULL)
+        {
+	  ++iterated_num_used_e;
+
+	  assert_entry_pointer_valid(p_e,  traits_base::m_store_hash_indicator);
+
+	  p_e = p_e->m_p_next;
+        }
+    }
+
+  PB_DS_DBG_ASSERT(iterated_num_used_e == m_num_used_e);
+}
+
+#include <ext/pb_ds/detail/cc_hash_table_map_/debug_store_hash_fn_imps.hpp>
+#include <ext/pb_ds/detail/cc_hash_table_map_/debug_no_store_hash_fn_imps.hpp>
+
+#endif // #ifdef PB_DS_CC_HT_MAP_DEBUG__
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/cc_hash_table_map_/debug_no_store_hash_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/cc_hash_table_map_/debug_no_store_hash_fn_imps.hpp
new file mode 100644
index 00000000000..205c6c6d553
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/cc_hash_table_map_/debug_no_store_hash_fn_imps.hpp
@@ -0,0 +1,57 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file debug_no_store_hash_fn_imps.hpp
+ * Contains implementations of cc_ht_map_'s debug-mode functions.
+ */
+
+#ifdef PB_DS_CC_HT_MAP_DEBUG__
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+assert_entry_pointer_valid(const entry_pointer    p_e, store_hash_false_type) const
+{
+  map_debug_base::check_key_exists(PB_DS_V2F(p_e->m_value));
+}
+
+#endif // #ifdef PB_DS_CC_HT_MAP_DEBUG__
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/cc_hash_table_map_/debug_store_hash_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/cc_hash_table_map_/debug_store_hash_fn_imps.hpp
new file mode 100644
index 00000000000..17dbca20d20
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/cc_hash_table_map_/debug_store_hash_fn_imps.hpp
@@ -0,0 +1,62 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file debug_store_hash_fn_imps.hpp
+ * Contains implementations of cc_ht_map_'s debug-mode functions.
+ */
+
+#ifdef PB_DS_CC_HT_MAP_DEBUG__
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+assert_entry_pointer_valid(const entry_pointer    p_e, store_hash_true_type) const
+{
+  map_debug_base::check_key_exists(PB_DS_V2F(p_e->m_value));
+
+  comp_hash pos_hash_pair =
+    ranged_hash_fn_base::operator()(PB_DS_V2F(p_e->m_value));
+
+  PB_DS_DBG_ASSERT(p_e->m_hash == pos_hash_pair.second);
+}
+
+#endif // #ifdef PB_DS_CC_HT_MAP_DEBUG__
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/cc_hash_table_map_/entry_list_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/cc_hash_table_map_/entry_list_fn_imps.hpp
new file mode 100644
index 00000000000..458ed361c94
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/cc_hash_table_map_/entry_list_fn_imps.hpp
@@ -0,0 +1,110 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file entry_list_fn_imps.hpp
+ * Contains implementations of cc_ht_map_'s entry-list related functions.
+ */
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+deallocate_links_in_list(entry_pointer p_e)
+{
+  while (p_e != NULL)
+    {
+      entry_pointer p_dealloc_e = p_e;
+
+      p_e = p_e->m_p_next;
+
+      s_entry_allocator.deallocate(p_dealloc_e, 1);
+    }
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::entry_pointer
+PB_DS_CLASS_C_DEC::
+get_entry(const_reference r_val, no_throw_copies_true_type)
+{
+  // Following line might throw an exception.
+
+  entry_pointer p_e = s_entry_allocator.allocate(1);
+
+  // Following lines* cannot* throw an exception.
+
+  new (&p_e->m_value) value_type(r_val);
+
+  return (p_e);
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::entry_pointer
+PB_DS_CLASS_C_DEC::
+get_entry(const_reference r_val, no_throw_copies_false_type)
+{
+  // Following line might throw an exception.
+
+  entry_pointer p_e = s_entry_allocator.allocate(1);
+
+  cond_dealtor_t cond(p_e);
+
+  // Following lines might throw an exception.
+
+  new (&p_e->m_value) value_type(r_val);
+
+  cond.set_no_action();
+
+  return (p_e);
+}
+
+PB_DS_CLASS_T_DEC
+inline void
+PB_DS_CLASS_C_DEC::
+rels_entry(entry_pointer p_e)
+{
+  /* The following lines cannot throw exceptions
+   *     (unless if key-data dtors do). */
+
+  p_e->m_value.~value_type();
+
+  s_entry_allocator.deallocate(p_e, 1);
+}
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/cc_hash_table_map_/erase_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/cc_hash_table_map_/erase_fn_imps.hpp
new file mode 100644
index 00000000000..1b4148d4cc0
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/cc_hash_table_map_/erase_fn_imps.hpp
@@ -0,0 +1,127 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file erase_fn_imps.hpp
+ * Contains implementations of cc_ht_map_'s erase related functions.
+ */
+
+PB_DS_CLASS_T_DEC
+inline void
+PB_DS_CLASS_C_DEC::
+erase_entry_pointer(entry_pointer& r_p_e)
+{
+  PB_DS_DBG_ONLY(map_debug_base::erase_existing(
+						PB_DS_V2F(r_p_e->m_value)));
+
+  entry_pointer p_e = r_p_e;
+
+  r_p_e = r_p_e->m_p_next;
+
+  rels_entry(p_e);
+
+  PB_DS_DBG_ASSERT(m_num_used_e > 0);
+  resize_base::notify_erased(--m_num_used_e);
+}
+
+PB_DS_CLASS_T_DEC
+template<typename Pred>
+inline typename PB_DS_CLASS_C_DEC::size_type
+PB_DS_CLASS_C_DEC::
+erase_if(Pred pred)
+{
+  size_type num_ersd = 0;
+
+  for (size_type pos = 0; pos < m_num_e_p; ++pos)
+    {
+      typedef
+	typename PB_DS_TYPES_TRAITS_C_DEC::const_reference
+	const_reference;
+
+      while (m_a_p_entries[pos] != NULL&& 
+	     pred(m_a_p_entries[pos]->m_value))
+        {
+	  ++num_ersd;
+
+	  entry_pointer p_next_e = m_a_p_entries[pos]->m_p_next;
+
+	  erase_entry_pointer(m_a_p_entries[pos]);
+
+	  m_a_p_entries[pos] = p_next_e;
+        }
+
+      entry_pointer p_e = m_a_p_entries[pos];
+
+      while (p_e != NULL&&  p_e->m_p_next != NULL)
+        {
+	  if (pred(p_e->m_p_next->m_value))
+            {
+	      ++num_ersd;
+
+	      erase_entry_pointer(p_e->m_p_next);
+            }
+	  else
+	    p_e = p_e->m_p_next;
+        }
+    }
+
+  do_resize_if_needed_no_throw();
+
+  return (num_ersd);
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+clear()
+{
+  for (size_type pos = 0; pos < m_num_e_p; ++pos)
+    while (m_a_p_entries[pos] != NULL)
+      erase_entry_pointer(m_a_p_entries[pos]);
+
+  do_resize_if_needed_no_throw();
+
+  resize_base::notify_cleared();
+}
+
+#include <ext/pb_ds/detail/cc_hash_table_map_/erase_no_store_hash_fn_imps.hpp>
+#include <ext/pb_ds/detail/cc_hash_table_map_/erase_store_hash_fn_imps.hpp>
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/cc_hash_table_map_/erase_no_store_hash_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/cc_hash_table_map_/erase_no_store_hash_fn_imps.hpp
new file mode 100644
index 00000000000..5441555ab90
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/cc_hash_table_map_/erase_no_store_hash_fn_imps.hpp
@@ -0,0 +1,139 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file erase_no_store_hash_fn_imps.hpp
+ * Contains implementations of cc_ht_map_'s erase related functions, when the hash
+ *    value is not stored.
+ */
+
+PB_DS_CLASS_T_DEC
+inline bool
+PB_DS_CLASS_C_DEC::
+erase(const_key_reference r_key)
+{
+  PB_DS_DBG_ONLY(assert_valid();)
+
+    return (erase_in_pos_imp(r_key,
+			     ranged_hash_fn_base::operator()(r_key)));
+}
+
+PB_DS_CLASS_T_DEC
+inline bool
+PB_DS_CLASS_C_DEC::
+erase_in_pos_imp(const_key_reference r_key, size_type pos)
+{
+  PB_DS_DBG_ONLY(assert_valid();)
+
+    entry_pointer p_e = m_a_p_entries[pos];
+
+  resize_base::notify_erase_search_start();
+
+  if (p_e == NULL)
+    {
+      resize_base::notify_erase_search_end();
+
+      PB_DS_DBG_ONLY(map_debug_base::check_key_does_not_exist(
+							      r_key);)
+
+        PB_DS_DBG_ONLY(assert_valid();)
+
+        return (false);
+    }
+
+  if (hash_eq_fn_base::operator()(
+				  PB_DS_V2F(p_e->m_value),
+				  r_key))
+    {
+      resize_base::notify_erase_search_end();
+
+      PB_DS_DBG_ONLY(map_debug_base::
+		     check_key_exists(r_key);)
+
+        erase_entry_pointer(m_a_p_entries[pos]);
+
+      do_resize_if_needed_no_throw();
+
+      PB_DS_DBG_ONLY(assert_valid();)
+
+        return (true);
+    }
+
+  while (true)
+    {
+      entry_pointer p_next_e = p_e->m_p_next;
+
+      if (p_next_e == NULL)
+        {
+	  resize_base::notify_erase_search_end();
+
+	  PB_DS_DBG_ONLY(map_debug_base::
+			 check_key_does_not_exist(r_key);)
+
+            PB_DS_DBG_ONLY(assert_valid();)
+
+            return (false);
+        }
+
+      if (hash_eq_fn_base::operator()(
+				      PB_DS_V2F(p_next_e->m_value),
+				      r_key))
+        {
+	  resize_base::notify_erase_search_end();
+
+	  PB_DS_DBG_ONLY(map_debug_base::
+			 check_key_exists(r_key);)
+
+            erase_entry_pointer(p_e->m_p_next);
+
+	  do_resize_if_needed_no_throw();
+
+	  PB_DS_DBG_ONLY(assert_valid();)
+
+            return (true);
+        }
+
+      resize_base::notify_erase_search_collision();
+
+      p_e = p_next_e;
+    }
+}
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/cc_hash_table_map_/erase_store_hash_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/cc_hash_table_map_/erase_store_hash_fn_imps.hpp
new file mode 100644
index 00000000000..fbc2dd5f2e5
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/cc_hash_table_map_/erase_store_hash_fn_imps.hpp
@@ -0,0 +1,134 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file erase_store_hash_fn_imps.hpp
+ * Contains implementations of cc_ht_map_'s erase related functions, when the hash
+ *    value is stored.
+ */
+
+PB_DS_CLASS_T_DEC
+inline bool
+PB_DS_CLASS_C_DEC::
+erase_in_pos_imp(const_key_reference r_key, const comp_hash& r_pos_hash_pair)
+{
+  PB_DS_DBG_ONLY(assert_valid();)
+
+    entry_pointer p_e = m_a_p_entries[r_pos_hash_pair.first];
+
+  resize_base::notify_erase_search_start();
+
+  if (p_e == NULL)
+    {
+      resize_base::notify_erase_search_end();
+
+      PB_DS_DBG_ONLY(map_debug_base::
+		     check_key_does_not_exist(
+					      r_key);)
+
+        PB_DS_DBG_ONLY(assert_valid();)
+
+        return (false);
+    }
+
+  if (hash_eq_fn_base::operator()(
+				  PB_DS_V2F(p_e->m_value),
+				  p_e->m_hash,
+				  r_key,
+				  r_pos_hash_pair.second))
+    {
+      resize_base::notify_erase_search_end();
+
+      PB_DS_DBG_ONLY(map_debug_base::check_key_exists(
+						      r_key);)
+
+        erase_entry_pointer(m_a_p_entries[r_pos_hash_pair.first]);
+
+      do_resize_if_needed_no_throw();
+
+      PB_DS_DBG_ONLY(assert_valid();)
+
+        return (true);
+    }
+
+  while (true)
+    {
+      entry_pointer p_next_e = p_e->m_p_next;
+
+      if (p_next_e == NULL)
+        {
+	  resize_base::notify_erase_search_end();
+
+	  PB_DS_DBG_ONLY(map_debug_base::
+			 check_key_does_not_exist(r_key);)
+
+            PB_DS_DBG_ONLY(assert_valid();)
+
+            return (false);
+        }
+
+      if (hash_eq_fn_base::operator()(
+				      PB_DS_V2F(p_next_e->m_value),
+				      p_next_e->m_hash,
+				      r_key,
+				      r_pos_hash_pair.second))
+        {
+	  resize_base::notify_erase_search_end();
+
+	  PB_DS_DBG_ONLY(map_debug_base::
+			 check_key_exists(
+					  r_key);)
+
+            erase_entry_pointer(p_e->m_p_next);
+
+	  do_resize_if_needed_no_throw();
+
+	  PB_DS_DBG_ONLY(assert_valid();)
+
+            return (true);
+        }
+
+      resize_base::notify_erase_search_collision();
+
+      p_e = p_next_e;
+    }
+}
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/cc_hash_table_map_/find_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/cc_hash_table_map_/find_fn_imps.hpp
new file mode 100644
index 00000000000..f1d68aa1dd0
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/cc_hash_table_map_/find_fn_imps.hpp
@@ -0,0 +1,82 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file find_fn_imps.hpp
+ * Contains implementations of cc_ht_map_'s find related functions.
+ */
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::point_iterator
+PB_DS_CLASS_C_DEC::
+find(const_key_reference r_key)
+{
+  PB_DS_DBG_ONLY(assert_valid();)
+
+    return (find_key_pointer(r_key, traits_base::m_store_extra_indicator));
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::const_point_iterator
+PB_DS_CLASS_C_DEC::
+find(const_key_reference r_key) const
+{
+  PB_DS_DBG_ONLY(assert_valid();)
+
+    return (const_cast<PB_DS_CLASS_C_DEC& >(*this).find_key_pointer(        r_key, traits_base::m_store_extra_indicator));
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::point_iterator
+PB_DS_CLASS_C_DEC::
+find_end()
+{
+  return (NULL);
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::const_point_iterator
+PB_DS_CLASS_C_DEC::
+find_end() const
+{
+  return (NULL);
+}
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/cc_hash_table_map_/find_store_hash_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/cc_hash_table_map_/find_store_hash_fn_imps.hpp
new file mode 100644
index 00000000000..b44f67497f6
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/cc_hash_table_map_/find_store_hash_fn_imps.hpp
@@ -0,0 +1,47 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file find_store_hash_fn_imps.hpp
+ * Contains implementations of cc_ht_map_'s find related functions, when the hash
+ *    value is stored.
+ */
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/cc_hash_table_map_/info_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/cc_hash_table_map_/info_fn_imps.hpp
new file mode 100644
index 00000000000..dde1d35cb71
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/cc_hash_table_map_/info_fn_imps.hpp
@@ -0,0 +1,118 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file info_fn_imps.hpp
+ * Contains implementations of cc_ht_map_'s entire container info related
+ *    functions.
+ */
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::size_type
+PB_DS_CLASS_C_DEC::
+size() const
+{
+  return (m_num_used_e);
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::size_type
+PB_DS_CLASS_C_DEC::
+max_size() const
+{
+  return (m_entry_allocator.max_size());
+}
+
+PB_DS_CLASS_T_DEC
+inline bool
+PB_DS_CLASS_C_DEC::
+empty() const
+{
+  return (size() == 0);
+}
+
+PB_DS_CLASS_T_DEC
+template<typename Other_HT_Map_Type>
+bool
+PB_DS_CLASS_C_DEC::
+operator==(const Other_HT_Map_Type& other) const
+{
+  return (cmp_with_other(other));
+}
+
+PB_DS_CLASS_T_DEC
+template<typename Other_Map_Type>
+bool
+PB_DS_CLASS_C_DEC::
+cmp_with_other(const Other_Map_Type& other) const
+{
+  if (size() != other.size())
+    return (false);
+
+  for (typename Other_Map_Type::const_iterator it = other.begin();
+       it != other.end(); ++it)
+    {
+      const_key_reference r_key =(const_key_reference)PB_DS_V2F(*it);
+
+      const_mapped_pointer p_mapped_value =
+	const_cast<PB_DS_CLASS_C_DEC& >(*this).
+	find_key_pointer(r_key, traits_base::m_store_hash_indicator);
+
+      if (p_mapped_value == NULL)
+	return (false);
+
+#ifdef PB_DS_DATA_TRUE_INDICATOR
+      if (p_mapped_value->second != it->second)
+	return (false);
+#endif // #ifdef PB_DS_DATA_TRUE_INDICATOR
+    }
+
+  return (true);
+}
+
+PB_DS_CLASS_T_DEC
+template<typename Other_HT_Map_Type>
+bool
+PB_DS_CLASS_C_DEC::
+operator!=(const Other_HT_Map_Type& other) const
+{
+  return (!operator==(other));
+}
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/cc_hash_table_map_/insert_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/cc_hash_table_map_/insert_fn_imps.hpp
new file mode 100644
index 00000000000..27260735c63
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/cc_hash_table_map_/insert_fn_imps.hpp
@@ -0,0 +1,49 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file insert_fn_imps.hpp
+ * Contains implementations of cc_ht_map_'s insert related functions.
+ */
+
+#include <ext/pb_ds/detail/cc_hash_table_map_/insert_no_store_hash_fn_imps.hpp>
+#include <ext/pb_ds/detail/cc_hash_table_map_/insert_store_hash_fn_imps.hpp>
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/cc_hash_table_map_/insert_no_store_hash_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/cc_hash_table_map_/insert_no_store_hash_fn_imps.hpp
new file mode 100644
index 00000000000..6c5fa3cb54a
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/cc_hash_table_map_/insert_no_store_hash_fn_imps.hpp
@@ -0,0 +1,89 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file insert_no_store_hash_fn_imps.hpp
+ * Contains implementations of cc_ht_map_'s insert related functions, when the hash
+ *    value is not stored.
+ */
+
+PB_DS_CLASS_T_DEC
+inline std::pair<
+  typename PB_DS_CLASS_C_DEC::point_iterator,
+  bool>
+PB_DS_CLASS_C_DEC::
+insert_imp(const_reference r_val, store_hash_false_type)
+{
+  PB_DS_DBG_ONLY(assert_valid();)
+
+    const_key_reference r_key = PB_DS_V2F(r_val);
+
+  const size_type pos = ranged_hash_fn_base::operator()(r_key);
+
+  entry_pointer p_e = m_a_p_entries[pos];
+
+  resize_base::notify_insert_search_start();
+
+  while (p_e != NULL&& 
+	 !hash_eq_fn_base::operator()(PB_DS_V2F(p_e->m_value), r_key))
+    {
+      resize_base::notify_insert_search_collision();
+
+      p_e = p_e->m_p_next;
+    }
+
+  resize_base::notify_insert_search_end();
+
+  if (p_e != NULL)
+    {
+      PB_DS_DBG_ONLY(map_debug_base::check_key_exists(r_key);)
+
+        return (
+		std::make_pair(               & p_e->m_value,  false));
+    }
+
+  PB_DS_DBG_ONLY(map_debug_base::check_key_does_not_exist(r_key);)
+
+    return (std::make_pair(
+			   insert_new_imp(r_val, pos),
+			   true));
+}
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/cc_hash_table_map_/insert_store_hash_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/cc_hash_table_map_/insert_store_hash_fn_imps.hpp
new file mode 100644
index 00000000000..480800a228d
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/cc_hash_table_map_/insert_store_hash_fn_imps.hpp
@@ -0,0 +1,91 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file insert_store_hash_fn_imps.hpp
+ * Contains implementations of cc_ht_map_'s insert related functions, when the hash
+ *    value is stored.
+ */
+
+PB_DS_CLASS_T_DEC
+inline std::pair<
+  typename PB_DS_CLASS_C_DEC::point_iterator,
+  bool>
+PB_DS_CLASS_C_DEC::
+insert_imp(const_reference r_val, store_hash_true_type)
+{
+  PB_DS_DBG_ONLY(assert_valid();)
+
+    const_key_reference r_key = PB_DS_V2F(r_val);
+
+  comp_hash pos_hash_pair = ranged_hash_fn_base::operator()(r_key);
+
+  entry_pointer p_e = m_a_p_entries[pos_hash_pair.first];
+
+  resize_base::notify_insert_search_start();
+
+  while (p_e != NULL&& 
+	 !hash_eq_fn_base::operator()(
+				      PB_DS_V2F(p_e->m_value),
+				      p_e->m_hash,
+				      r_key, pos_hash_pair.second))
+    {
+      resize_base::notify_insert_search_collision();
+
+      p_e = p_e->m_p_next;
+    }
+
+  resize_base::notify_insert_search_end();
+
+  if (p_e != NULL)
+    {
+      PB_DS_DBG_ONLY(map_debug_base::check_key_exists(r_key);)
+
+        return (std::make_pair(           & p_e->m_value, false));
+    }
+
+  PB_DS_DBG_ONLY(map_debug_base::check_key_does_not_exist(r_key);)
+
+    return (std::make_pair(
+			   insert_new_imp(r_val, pos_hash_pair),
+			   true));
+}
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/cc_hash_table_map_/iterators_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/cc_hash_table_map_/iterators_fn_imps.hpp
new file mode 100644
index 00000000000..eca3791c777
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/cc_hash_table_map_/iterators_fn_imps.hpp
@@ -0,0 +1,97 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file iterators_fn_imps.hpp
+ * Contains implementations of cc_ht_map_'s iterators related functions, e.g.,
+ *    begin().
+ */
+
+PB_DS_CLASS_T_DEC
+typename PB_DS_CLASS_C_DEC::iterator
+PB_DS_CLASS_C_DEC::s_end_it;
+
+PB_DS_CLASS_T_DEC
+typename PB_DS_CLASS_C_DEC::const_iterator
+PB_DS_CLASS_C_DEC::s_const_end_it;
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::iterator
+PB_DS_CLASS_C_DEC::
+begin()
+{
+  pointer p_value;
+  std::pair<entry_pointer, size_type> pos;
+
+  get_start_it_state(p_value, pos);
+
+  return (iterator(p_value, pos, this));
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::iterator
+PB_DS_CLASS_C_DEC::
+end()
+{
+  return (s_end_it);
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::const_iterator
+PB_DS_CLASS_C_DEC::
+begin() const
+{
+  pointer p_value;
+  std::pair<entry_pointer, size_type> pos;
+
+  get_start_it_state(p_value, pos);
+
+  return (const_iterator(p_value, pos, this));
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::const_iterator
+PB_DS_CLASS_C_DEC::
+end() const
+{
+  return (s_const_end_it);
+}
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/cc_hash_table_map_/policy_access_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/cc_hash_table_map_/policy_access_fn_imps.hpp
new file mode 100644
index 00000000000..5ed175fe171
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/cc_hash_table_map_/policy_access_fn_imps.hpp
@@ -0,0 +1,110 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file policy_access_fn_imps.hpp
+ * Contains implementations of cc_ht_map_'s policy access
+ *    functions.
+ */
+
+PB_DS_CLASS_T_DEC
+Hash_Fn& 
+PB_DS_CLASS_C_DEC::
+get_hash_fn()
+{
+  return (*this);
+}
+
+PB_DS_CLASS_T_DEC
+const Hash_Fn& 
+PB_DS_CLASS_C_DEC::
+get_hash_fn() const
+{
+  return (*this);
+}
+
+PB_DS_CLASS_T_DEC
+Eq_Fn& 
+PB_DS_CLASS_C_DEC::
+get_eq_fn()
+{
+  return (*this);
+}
+
+PB_DS_CLASS_T_DEC
+const Eq_Fn& 
+PB_DS_CLASS_C_DEC::
+get_eq_fn() const
+{
+  return (*this);
+}
+
+PB_DS_CLASS_T_DEC
+Comb_Hash_Fn& 
+PB_DS_CLASS_C_DEC::
+get_comb_hash_fn()
+{
+  return (*this);
+}
+
+PB_DS_CLASS_T_DEC
+const Comb_Hash_Fn& 
+PB_DS_CLASS_C_DEC::
+get_comb_hash_fn() const
+{
+  return (*this);
+}
+
+PB_DS_CLASS_T_DEC
+Resize_Policy& 
+PB_DS_CLASS_C_DEC::
+get_resize_policy()
+{
+  return (*this);
+}
+
+PB_DS_CLASS_T_DEC
+const Resize_Policy& 
+PB_DS_CLASS_C_DEC::
+get_resize_policy() const
+{
+  return (*this);
+}
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/cc_hash_table_map_/resize_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/cc_hash_table_map_/resize_fn_imps.hpp
new file mode 100644
index 00000000000..ea15143a71a
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/cc_hash_table_map_/resize_fn_imps.hpp
@@ -0,0 +1,157 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file resize_fn_imps.hpp
+ * Contains implementations of cc_ht_map_'s resize related functions.
+ */
+
+PB_DS_CLASS_T_DEC
+inline bool
+PB_DS_CLASS_C_DEC::
+do_resize_if_needed()
+{
+  if (!resize_base::is_resize_needed())
+    return (false);
+
+  resize_imp(resize_base::get_new_size(        m_num_e_p, m_num_used_e));
+
+  return (true);
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+do_resize(size_type size)
+{
+  resize_imp(resize_base::get_nearest_larger_size(
+						  size));
+}
+
+PB_DS_CLASS_T_DEC
+inline void
+PB_DS_CLASS_C_DEC::
+do_resize_if_needed_no_throw()
+{
+  if (!resize_base::is_resize_needed())
+    return;
+
+  try
+    {
+      resize_imp(resize_base::get_new_size(            m_num_e_p, m_num_used_e));
+    }
+  catch(...)
+    { }
+
+  PB_DS_DBG_ONLY(assert_valid();)
+    }
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+resize_imp(size_type new_size)
+{
+  PB_DS_DBG_ONLY(assert_valid();)
+
+    if (new_size == m_num_e_p)
+      return;
+
+  const size_type old_size = m_num_e_p;
+
+  entry_pointer_array a_p_entries_resized;
+
+  // Following line might throw an exception.
+
+  ranged_hash_fn_base::notify_resized(new_size);
+
+  try
+    {
+      // Following line might throw an exception.
+
+      a_p_entries_resized = s_entry_pointer_allocator.allocate(new_size);
+
+      m_num_e_p = new_size;
+    }
+  catch(...)
+    {
+      ranged_hash_fn_base::notify_resized(old_size);
+
+      throw;
+    }
+
+  // At this point no exceptions can be thrown.
+
+  resize_imp_no_exceptions(new_size, a_p_entries_resized, old_size);
+
+  Resize_Policy::notify_resized(new_size);
+
+  PB_DS_DBG_ONLY(assert_valid();)
+    }
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+resize_imp_no_exceptions(size_type new_size, entry_pointer_array a_p_entries_resized, size_type old_size)
+{
+  std::fill(a_p_entries_resized, a_p_entries_resized + m_num_e_p,(entry_pointer)NULL);
+
+  for (size_type pos = 0; pos < old_size; ++pos)
+    {
+      entry_pointer p_e = m_a_p_entries[pos];
+
+      while (p_e != NULL)
+	p_e = resize_imp_no_exceptions_reassign_pointer(p_e,  a_p_entries_resized,  traits_base::m_store_extra_indicator);
+    }
+
+  m_num_e_p = new_size;
+
+  PB_DS_DBG_ONLY(assert_entry_pointer_array_valid(a_p_entries_resized);)
+
+    s_entry_pointer_allocator.deallocate(m_a_p_entries, old_size);
+
+  m_a_p_entries = a_p_entries_resized;
+
+  PB_DS_DBG_ONLY(assert_valid();)
+    }
+
+#include <ext/pb_ds/detail/cc_hash_table_map_/resize_no_store_hash_fn_imps.hpp>
+#include <ext/pb_ds/detail/cc_hash_table_map_/resize_store_hash_fn_imps.hpp>
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/cc_hash_table_map_/resize_no_store_hash_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/cc_hash_table_map_/resize_no_store_hash_fn_imps.hpp
new file mode 100644
index 00000000000..474ac00182a
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/cc_hash_table_map_/resize_no_store_hash_fn_imps.hpp
@@ -0,0 +1,63 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file resize_no_store_hash_fn_imps.hpp
+ * Contains implementations of cc_ht_map_'s resize related functions, when the
+ *    hash value is not stored.
+ */
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::entry_pointer
+PB_DS_CLASS_C_DEC::
+resize_imp_no_exceptions_reassign_pointer(entry_pointer p_e, entry_pointer_array a_p_entries_resized, store_hash_false_type)
+{
+  const size_type hash_pos =
+    ranged_hash_fn_base::operator()(PB_DS_V2F(p_e->m_value));
+
+  entry_pointer const p_next_e = p_e->m_p_next;
+
+  p_e->m_p_next = a_p_entries_resized[hash_pos];
+
+  a_p_entries_resized[hash_pos] = p_e;
+
+  return (p_next_e);
+}
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/cc_hash_table_map_/resize_store_hash_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/cc_hash_table_map_/resize_store_hash_fn_imps.hpp
new file mode 100644
index 00000000000..d90d5786ff8
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/cc_hash_table_map_/resize_store_hash_fn_imps.hpp
@@ -0,0 +1,65 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file resize_store_hash_fn_imps.hpp
+ * Contains implementations of cc_ht_map_'s resize related functions, when the
+ *    hash value is stored.
+ */
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::entry_pointer
+PB_DS_CLASS_C_DEC::
+resize_imp_no_exceptions_reassign_pointer(entry_pointer p_e, entry_pointer_array a_p_entries_resized, store_hash_true_type)
+{
+  const comp_hash pos_hash_pair =
+    ranged_hash_fn_base::operator()(
+				    PB_DS_V2F(p_e->m_value),
+				    p_e->m_hash);
+
+  entry_pointer const p_next_e = p_e->m_p_next;
+
+  p_e->m_p_next = a_p_entries_resized[pos_hash_pair.first];
+
+  a_p_entries_resized[pos_hash_pair.first] = p_e;
+
+  return (p_next_e);
+}
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/cc_hash_table_map_/size_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/cc_hash_table_map_/size_fn_imps.hpp
new file mode 100644
index 00000000000..010834d4f2b
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/cc_hash_table_map_/size_fn_imps.hpp
@@ -0,0 +1,71 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file size_fn_imps.hpp
+ * Contains implementations of cc_ht_map_'s entire container size related
+ *    functions.
+ */
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::size_type
+PB_DS_CLASS_C_DEC::
+size() const
+{
+  return (m_num_used_e);
+}
+
+PB_DS_CLASS_T_DEC
+inline bool
+PB_DS_CLASS_C_DEC::
+empty() const
+{
+  return (size() == 0);
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::size_type
+PB_DS_CLASS_C_DEC::
+max_size() const
+{
+  return (s_entry_allocator.max_size());
+}
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/cc_hash_table_map_/standard_policies.hpp b/libstdc++-v3/include/ext/pb_ds/detail/cc_hash_table_map_/standard_policies.hpp
new file mode 100644
index 00000000000..dc175b13865
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/cc_hash_table_map_/standard_policies.hpp
@@ -0,0 +1,52 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file standard_policies.hpp
+ * Contains standard policies for cc_ht_map types.
+ */
+
+#ifndef PB_DS_CC_HT_MAP_STANDARD_POLICIES_HPP
+#define PB_DS_CC_HT_MAP_STANDARD_POLICIES_HPP
+
+#include <ext/pb_ds/detail/standard_policies.hpp>
+
+#endif // #ifndef PB_DS_CC_HT_MAP_STANDARD_POLICIES_HPP
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/cc_hash_table_map_/trace_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/cc_hash_table_map_/trace_fn_imps.hpp
new file mode 100644
index 00000000000..4c3e095ed26
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/cc_hash_table_map_/trace_fn_imps.hpp
@@ -0,0 +1,82 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file trace_fn_imps.hpp
+ * Contains implementations of cc_ht_map_'s trace-mode functions.
+ */
+
+#ifdef PB_DS_HT_MAP_TRACE_
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+trace() const
+{
+  std::cerr << static_cast<unsigned long>(m_num_e_p) << " " <<
+    static_cast<unsigned long>(m_num_used_e) << std::endl;
+
+  for (size_type i = 0; i < m_num_e_p; ++i)
+    {
+      std::cerr << static_cast<unsigned long>(i) << " ";
+
+      trace_list(m_a_p_entries[i]);
+
+      std::cerr << std::endl;
+    }
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+trace_list(const_entry_pointer p_l) const
+{
+  size_type iterated_num_used_e = 0;
+
+  while (p_l != NULL)
+    {
+      std::cerr << PB_DS_V2F(p_l->m_value) << " ";
+
+      p_l = p_l->m_p_next;
+    }
+}
+
+#endif // #ifdef PB_DS_HT_MAP_TRACE_
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/cond_dealtor.hpp b/libstdc++-v3/include/ext/pb_ds/detail/cond_dealtor.hpp
new file mode 100644
index 00000000000..3cf9ea91fa3
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/cond_dealtor.hpp
@@ -0,0 +1,131 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file cond_dealtor.hpp
+ * Contains a conditional deallocator.
+ */
+
+#ifndef PB_DS_COND_DEALTOR_HPP
+#define PB_DS_COND_DEALTOR_HPP
+
+namespace pb_ds
+{
+
+  namespace detail
+  {
+
+#define PB_DS_COND_DEALTOR_CLASS_T_DEC		\
+    template<typename Entry, class Allocator>
+
+#define PB_DS_COND_DEALTOR_CLASS_C_DEC				\
+    cond_dealtor<						\
+						Entry,		\
+						Allocator>
+
+    template<typename Entry, class Allocator>
+    class cond_dealtor
+    {
+    public:
+      typedef
+      typename Allocator::template rebind<Entry>::other
+      entry_allocator;
+
+      typedef typename entry_allocator::pointer entry_pointer;
+
+    public:
+      inline
+      cond_dealtor(entry_pointer p_e);
+
+      inline
+      ~cond_dealtor();
+
+      inline void
+      set_no_action();
+
+    private:
+      entry_pointer m_p_e;
+
+      bool m_no_action_destructor;
+
+      static entry_allocator s_alloc;
+    };
+
+    PB_DS_COND_DEALTOR_CLASS_T_DEC
+    typename PB_DS_COND_DEALTOR_CLASS_C_DEC::entry_allocator
+    PB_DS_COND_DEALTOR_CLASS_C_DEC::s_alloc;
+
+    PB_DS_COND_DEALTOR_CLASS_T_DEC
+    inline
+    PB_DS_COND_DEALTOR_CLASS_C_DEC::
+    cond_dealtor(entry_pointer p_e) :
+      m_p_e(p_e),
+      m_no_action_destructor(false)
+    { }
+
+    PB_DS_COND_DEALTOR_CLASS_T_DEC
+    inline void
+    PB_DS_COND_DEALTOR_CLASS_C_DEC::
+    set_no_action()
+    {
+      m_no_action_destructor = true;
+    }
+
+    PB_DS_COND_DEALTOR_CLASS_T_DEC
+    inline
+    PB_DS_COND_DEALTOR_CLASS_C_DEC::
+    ~cond_dealtor()
+    {
+      if (m_no_action_destructor)
+        return;
+
+      s_alloc.deallocate(m_p_e, 1);
+    }
+
+#undef PB_DS_COND_DEALTOR_CLASS_T_DEC
+#undef PB_DS_COND_DEALTOR_CLASS_C_DEC
+
+  } // namespace detail
+
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_COND_DEALTOR_HPP
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/constructors_destructor_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/constructors_destructor_fn_imps.hpp
new file mode 100644
index 00000000000..8a673e7c08b
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/constructors_destructor_fn_imps.hpp
@@ -0,0 +1,128 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file constructors_destructor_fn_imps.hpp
+ * Contains constructors_destructor_fn_imps applicable to different containers.
+ */
+
+inline
+PB_DS_CLASS_NAME()
+{ }
+
+inline
+PB_DS_CLASS_NAME(const PB_DS_CLASS_NAME& other) : base_type((const base_type&)other)
+{ }
+
+template<typename T0>
+inline
+PB_DS_CLASS_NAME(T0 t0) : base_type(t0)
+{ }
+
+template<typename T0, typename T1>
+inline
+PB_DS_CLASS_NAME(T0 t0, T1 t1) : base_type(t0, t1)
+{ }
+
+template<typename T0, typename T1, typename T2>
+inline
+PB_DS_CLASS_NAME(T0 t0, T1 t1, T2 t2) : base_type(t0, t1, t2)
+{ }
+
+template<typename T0, typename T1, typename T2, typename T3>
+inline
+PB_DS_CLASS_NAME(T0 t0, T1 t1, T2 t2, T3 t3) : base_type(t0, t1, t2, t3)
+{ }
+
+template<typename T0,
+	 typename T1,
+	 typename T2,
+	 typename T3,
+	 typename T4>
+inline
+PB_DS_CLASS_NAME(T0 t0, T1 t1, T2 t2, T3 t3, T4 t4) : base_type(t0, t1, t2, t3, t4)
+{ }
+
+template<typename T0,
+	 typename T1,
+	 typename T2,
+	 typename T3,
+	 typename T4,
+	 typename T5>
+inline
+PB_DS_CLASS_NAME(T0 t0, T1 t1, T2 t2, T3 t3, T4 t4, T5 t5) : base_type(t0, t1, t2, t3, t4, t5)
+{ }
+
+template<typename T0,
+	 typename T1,
+	 typename T2,
+	 typename T3,
+	 typename T4,
+	 typename T5,
+	 typename T6>
+inline
+PB_DS_CLASS_NAME(T0 t0, T1 t1, T2 t2, T3 t3, T4 t4, T5 t5, T6 t6) : base_type(t0, t1, t2, t3, t4, t5, t6)
+{ }
+
+template<typename T0,
+	 typename T1,
+	 typename T2,
+	 typename T3,
+	 typename T4,
+	 typename T5,
+	 typename T6,
+	 typename T7>
+inline
+PB_DS_CLASS_NAME(T0 t0, T1 t1, T2 t2, T3 t3, T4 t4, T5 t5, T6 t6, T7 t7) : base_type(t0, t1, t2, t3, t4, t5, t6, t7)
+{ }
+
+template<typename T0,
+	 typename T1,
+	 typename T2,
+	 typename T3,
+	 typename T4,
+	 typename T5,
+	 typename T6,
+	 typename T7,
+	 typename T8>
+inline
+PB_DS_CLASS_NAME(T0 t0, T1 t1, T2 t2, T3 t3, T4 t4, T5 t5, T6 t6, T7 t7, T8 t8) : base_type(t0, t1, t2, t3, t4, t5, t6, t7, t8)
+{ }
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/container_base_dispatch.hpp b/libstdc++-v3/include/ext/pb_ds/detail/container_base_dispatch.hpp
new file mode 100644
index 00000000000..6009a686305
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/container_base_dispatch.hpp
@@ -0,0 +1,409 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file container_base_dispatch.hpp
+ * Contains an associative container dispatching base.
+ */
+
+#ifndef PB_DS_ASSOC_CNTNR_BASE_DS_DISPATCHER_HPP
+#define PB_DS_ASSOC_CNTNR_BASE_DS_DISPATCHER_HPP
+
+#include <ext/pb_ds/detail/typelist.hpp>
+
+#define PB_DS_DATA_TRUE_INDICATOR
+#include <ext/pb_ds/detail/list_update_map_/lu_map_.hpp>
+#undef PB_DS_DATA_TRUE_INDICATOR
+
+#define PB_DS_DATA_FALSE_INDICATOR
+#include <ext/pb_ds/detail/list_update_map_/lu_map_.hpp>
+#undef PB_DS_DATA_FALSE_INDICATOR
+
+#define PB_DS_DATA_TRUE_INDICATOR
+#include <ext/pb_ds/detail/rb_tree_map_/rb_tree_.hpp>
+#undef PB_DS_DATA_TRUE_INDICATOR
+
+#define PB_DS_DATA_FALSE_INDICATOR
+#include <ext/pb_ds/detail/rb_tree_map_/rb_tree_.hpp>
+#undef PB_DS_DATA_FALSE_INDICATOR
+
+#define PB_DS_DATA_TRUE_INDICATOR
+#include <ext/pb_ds/detail/splay_tree_/splay_tree_.hpp>
+#undef PB_DS_DATA_TRUE_INDICATOR
+
+#define PB_DS_DATA_FALSE_INDICATOR
+#include <ext/pb_ds/detail/splay_tree_/splay_tree_.hpp>
+#undef PB_DS_DATA_FALSE_INDICATOR
+
+#define PB_DS_DATA_TRUE_INDICATOR
+#include <ext/pb_ds/detail/ov_tree_map_/ov_tree_map_.hpp>
+#undef PB_DS_DATA_TRUE_INDICATOR
+
+#define PB_DS_DATA_FALSE_INDICATOR
+#include <ext/pb_ds/detail/ov_tree_map_/ov_tree_map_.hpp>
+#undef PB_DS_DATA_FALSE_INDICATOR
+
+#define PB_DS_DATA_TRUE_INDICATOR
+#include <ext/pb_ds/detail/cc_hash_table_map_/cc_ht_map_.hpp>
+#undef PB_DS_DATA_TRUE_INDICATOR
+
+#define PB_DS_DATA_FALSE_INDICATOR
+#include <ext/pb_ds/detail/cc_hash_table_map_/cc_ht_map_.hpp>
+#undef PB_DS_DATA_FALSE_INDICATOR
+
+#define PB_DS_DATA_TRUE_INDICATOR
+#include <ext/pb_ds/detail/gp_hash_table_map_/gp_ht_map_.hpp>
+#undef PB_DS_DATA_TRUE_INDICATOR
+
+#define PB_DS_DATA_FALSE_INDICATOR
+#include <ext/pb_ds/detail/gp_hash_table_map_/gp_ht_map_.hpp>
+#undef PB_DS_DATA_FALSE_INDICATOR
+
+#define PB_DS_DATA_TRUE_INDICATOR
+#include <ext/pb_ds/detail/pat_trie_/pat_trie_.hpp>
+#undef PB_DS_DATA_TRUE_INDICATOR
+
+#define PB_DS_DATA_FALSE_INDICATOR
+#include <ext/pb_ds/detail/pat_trie_/pat_trie_.hpp>
+#undef PB_DS_DATA_FALSE_INDICATOR
+
+namespace pb_ds
+{
+  namespace detail
+    {
+
+      template<typename Key,
+	       typename Mapped,
+	       class Data_Structure_Taq,
+	       class Policy_Tl,
+	       class Allocator>
+      struct container_base_dispatch;
+
+      template<typename Key,
+	       typename Mapped,
+	       class Policy_Tl,
+	       class Allocator>
+      struct container_base_dispatch<
+	Key,
+	Mapped,
+	list_update_tag,
+	Policy_Tl,
+	Allocator>
+      {
+	typedef
+        lu_map_data_<
+	  Key,
+	  Mapped,
+	  typename typelist_at_index<Policy_Tl, 0>::type,
+	  Allocator,
+	  typename typelist_at_index<Policy_Tl, 1>::type>
+        type;
+      };
+
+      template<typename Key, class Policy_Tl, class Allocator>
+      struct container_base_dispatch<
+	Key,
+	null_mapped_type,
+	list_update_tag,
+	Policy_Tl,
+	Allocator>
+      {
+	typedef
+        lu_map_no_data_<
+	  Key,
+	  null_mapped_type,
+	  typename typelist_at_index<Policy_Tl, 0>::type,
+	  Allocator,
+	  typename typelist_at_index<Policy_Tl, 1>::type>
+        type;
+      };
+
+      template<typename Key,
+	       typename Mapped,
+	       class Policy_Tl,
+	       class Allocator>
+      struct container_base_dispatch<
+	Key,
+	Mapped,
+	pat_trie_tag,
+	Policy_Tl,
+	Allocator>
+      {
+	typedef
+        pat_trie_data_<
+	  Key,
+	  Mapped,
+	  typename typelist_at_index<Policy_Tl, 1>::type,
+	  Allocator>
+        type;
+      };
+
+      template<typename Key, class Policy_Tl, class Allocator>
+      struct container_base_dispatch<
+	Key,
+	null_mapped_type,
+	pat_trie_tag,
+	Policy_Tl,
+	Allocator>
+      {
+	typedef
+        pat_trie_no_data_<
+	  Key,
+	  null_mapped_type,
+	  typename typelist_at_index<Policy_Tl, 1>::type,
+	  Allocator>
+        type;
+      };
+
+      template<typename Key,
+	       typename Mapped,
+	       class Policy_Tl,
+	       class Allocator>
+      struct container_base_dispatch<
+	Key,
+	Mapped,
+	rb_tree_tag,
+	Policy_Tl,
+	Allocator>
+      {
+	typedef
+        rb_tree_data_<
+	  Key,
+	  Mapped,
+	  typename typelist_at_index<Policy_Tl, 0>::type,
+	  typename typelist_at_index<Policy_Tl, 1>::type,
+	  Allocator>
+        type;
+      };
+
+      template<typename Key, class Policy_Tl, class Allocator>
+      struct container_base_dispatch<
+	Key,
+	null_mapped_type,
+	rb_tree_tag,
+	Policy_Tl,
+	Allocator>
+      {
+	typedef
+        rb_tree_no_data_<
+	  Key,
+	  null_mapped_type,
+	  typename typelist_at_index<Policy_Tl, 0>::type,
+	  typename typelist_at_index<Policy_Tl, 1>::type,
+	  Allocator>
+        type;
+      };
+
+      template<typename Key,
+	       typename Mapped,
+	       class Policy_Tl,
+	       class Allocator>
+      struct container_base_dispatch<
+	Key,
+	Mapped,
+	splay_tree_tag,
+	Policy_Tl,
+	Allocator>
+
+      {
+	typedef
+        splay_tree_data_<
+	  Key,
+	  Mapped,
+	  typename typelist_at_index<Policy_Tl, 0>::type,
+	  typename typelist_at_index<Policy_Tl, 1>::type,
+	  Allocator>
+        type;
+      };
+
+      template<typename Key, class Policy_Tl, class Allocator>
+      struct container_base_dispatch<
+	Key,
+	null_mapped_type,
+	splay_tree_tag,
+	Policy_Tl,
+	Allocator>
+      {
+	typedef
+        splay_tree_no_data_<
+	  Key,
+	  null_mapped_type,
+	  typename typelist_at_index<Policy_Tl, 0>::type,
+	  typename typelist_at_index<Policy_Tl, 1>::type,
+	  Allocator>
+        type;
+      };
+
+      template<typename Key,
+	       typename Mapped,
+	       class Policy_Tl,
+	       class Allocator>
+      struct container_base_dispatch<
+	Key,
+	Mapped,
+	ov_tree_tag,
+	Policy_Tl,
+	Allocator>
+      {
+	typedef
+        ov_tree_data_<
+	  Key,
+	  Mapped,
+	  typename typelist_at_index<Policy_Tl, 0>::type,
+	  typename typelist_at_index<Policy_Tl, 1>::type,
+	  Allocator>
+        type;
+      };
+
+      template<typename Key, class Policy_Tl, class Allocator>
+      struct container_base_dispatch<
+	Key,
+	null_mapped_type,
+	ov_tree_tag,
+	Policy_Tl,
+	Allocator>
+      {
+	typedef
+        ov_tree_no_data_<
+	  Key,
+	  null_mapped_type,
+	  typename typelist_at_index<Policy_Tl, 0>::type,
+	  typename typelist_at_index<Policy_Tl, 1>::type,
+	  Allocator>
+        type;
+      };
+
+      template<typename Key,
+	       typename Mapped,
+	       class Policy_Tl,
+	       class Allocator>
+      struct container_base_dispatch<
+	Key,
+	Mapped,
+	cc_hash_tag,
+	Policy_Tl,
+	Allocator>
+      {
+	typedef
+        cc_ht_map_data_<
+	  Key,
+	  Mapped,
+	  typename typelist_at_index<Policy_Tl, 0>::type,
+	  typename typelist_at_index<Policy_Tl, 1>::type,
+	  Allocator,
+	  typelist_at_index<Policy_Tl, 3>::type::value,
+	  typename typelist_at_index<Policy_Tl, 4>::type,
+	  typename typelist_at_index<Policy_Tl, 2>::type>
+        type;
+      };
+
+      template<typename Key, class Policy_Tl, class Allocator>
+      struct container_base_dispatch<
+	Key,
+	null_mapped_type,
+	cc_hash_tag,
+	Policy_Tl,
+	Allocator>
+      {
+	typedef
+        cc_ht_map_no_data_<
+	  Key,
+	  null_mapped_type,
+	  typename typelist_at_index<Policy_Tl, 0>::type,
+	  typename typelist_at_index<Policy_Tl, 1>::type,
+	  Allocator,
+	  typelist_at_index<Policy_Tl, 3>::type::value,
+	  typename typelist_at_index<Policy_Tl, 4>::type,
+	  typename typelist_at_index<Policy_Tl, 2>::type>
+        type;
+      };
+
+      template<typename Key,
+	       typename Mapped,
+	       class Policy_Tl,
+	       class Allocator>
+      struct container_base_dispatch<
+	Key,
+	Mapped,
+	gp_hash_tag,
+	Policy_Tl,
+	Allocator>
+      {
+	typedef
+        gp_ht_map_data_<
+	  Key,
+	  Mapped,
+	  typename typelist_at_index<Policy_Tl, 0>::type,
+	  typename typelist_at_index<Policy_Tl, 1>::type,
+	  Allocator,
+	  typelist_at_index<Policy_Tl, 3>::type::value,
+	  typename typelist_at_index<Policy_Tl, 4>::type,
+	  typename typelist_at_index<Policy_Tl, 5>::type,
+	  typename typelist_at_index<Policy_Tl, 2>::type>
+        type;
+      };
+
+      template<typename Key, class Policy_Tl, class Allocator>
+      struct container_base_dispatch<
+	Key,
+	null_mapped_type,
+	gp_hash_tag,
+	Policy_Tl,
+	Allocator>
+      {
+	typedef
+        gp_ht_map_no_data_<
+	  Key,
+	  null_mapped_type,
+	  typename typelist_at_index<Policy_Tl, 0>::type,
+	  typename typelist_at_index<Policy_Tl, 1>::type,
+	  Allocator,
+	  typelist_at_index<Policy_Tl, 3>::type::value,
+	  typename typelist_at_index<Policy_Tl, 4>::type,
+	  typename typelist_at_index<Policy_Tl, 5>::type,
+	  typename typelist_at_index<Policy_Tl, 2>::type>
+        type;
+      };
+
+    } // namespace detail
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_ASSOC_CNTNR_BASE_DS_DISPATCHER_HPP
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/eq_fn/eq_by_less.hpp b/libstdc++-v3/include/ext/pb_ds/detail/eq_fn/eq_by_less.hpp
new file mode 100644
index 00000000000..6e37b544039
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/eq_fn/eq_by_less.hpp
@@ -0,0 +1,74 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file eq_by_less.hpp
+ * Contains an equivalence function.
+ */
+
+#ifndef PB_DS_EQ_BY_LESS_HPP
+#define PB_DS_EQ_BY_LESS_HPP
+
+#include <utility>
+#include <functional>
+#include <vector>
+#include <assert.h>
+#include <ext/pb_ds/detail/types_traits.hpp>
+
+namespace pb_ds
+{
+  namespace detail
+  {
+    template<typename Key, class Cmp_Fn>
+    struct eq_by_less : private Cmp_Fn
+    {
+      bool
+      operator()(const Key& r_lhs, const Key& r_rhs) const
+      {
+	const bool l = Cmp_Fn::operator()(r_lhs, r_rhs);
+	const bool g = Cmp_Fn::operator()(r_rhs, r_lhs);
+	return !(l || g);
+      }
+    };
+  } // namespace detail
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_EQ_BY_LESS_HPP
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/eq_fn/hash_eq_fn.hpp b/libstdc++-v3/include/ext/pb_ds/detail/eq_fn/hash_eq_fn.hpp
new file mode 100644
index 00000000000..b143751b563
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/eq_fn/hash_eq_fn.hpp
@@ -0,0 +1,211 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file hash_eq_fn.hpp
+ * Contains 2 eqivalence functions, one employing a hash value,
+ *    and one ignoring it.
+ */
+
+#ifndef PB_DS_HASH_EQ_FN_HPP
+#define PB_DS_HASH_EQ_FN_HPP
+
+#include <utility>
+
+namespace pb_ds
+{
+  namespace detail
+  {
+
+#ifdef PB_DS_HASH_EQ_FN_DEBUG
+#define PB_DS_DBG_ASSERT(X) assert(X)
+#define PB_DS_DBG_VERIFY(X) assert(X)
+#define PB_DS_DBG_ONLY(X) X
+#else // #ifdef PB_DS_HASH_EQ_FN_DEBUG
+#define PB_DS_DBG_ASSERT(X)
+#define PB_DS_DBG_VERIFY(X) {if((X)==0);}
+#define PB_DS_DBG_ONLY(X) ;
+#endif // #ifdef PB_DS_HASH_EQ_FN_DEBUG
+
+    template<typename Key, class Eq_Fn, class Allocator, bool Store_Hash>
+    struct hash_eq_fn;
+
+#define PB_DS_CLASS_T_DEC					\
+    template<typename Key, class Eq_Fn, class Allocator>
+
+#define PB_DS_CLASS_C_DEC				\
+    hash_eq_fn<						\
+					Key,		\
+					Eq_Fn,		\
+					Allocator,	\
+					false>
+
+    /**
+     * Specialization 1- The client requests that hash values not be stored.
+     **/
+    template<typename Key, class Eq_Fn, class Allocator>
+    struct hash_eq_fn<Key, Eq_Fn, Allocator, false> : public Eq_Fn
+    {
+      typedef Eq_Fn eq_fn_base;
+
+      typedef typename Allocator::template rebind<Key>::other key_allocator;
+
+      typedef typename key_allocator::const_reference const_key_reference;
+
+      hash_eq_fn();
+
+      hash_eq_fn(const Eq_Fn& r_eq_fn);
+
+      inline bool
+      operator()(const_key_reference r_lhs_key, const_key_reference r_rhs_key) const;
+
+      inline void
+      swap(const PB_DS_CLASS_C_DEC& other);
+    };
+
+    PB_DS_CLASS_T_DEC
+    PB_DS_CLASS_C_DEC::
+    hash_eq_fn()
+    { }
+
+    PB_DS_CLASS_T_DEC
+    inline void
+    PB_DS_CLASS_C_DEC::
+    swap(const PB_DS_CLASS_C_DEC& other)
+    {
+      std::swap((Eq_Fn& )(*this), (Eq_Fn& )other);
+    }
+
+    PB_DS_CLASS_T_DEC
+    PB_DS_CLASS_C_DEC::
+    hash_eq_fn(const Eq_Fn& r_eq_fn) :
+      Eq_Fn(r_eq_fn)
+    { }
+
+    PB_DS_CLASS_T_DEC
+    inline bool
+    PB_DS_CLASS_C_DEC::
+    operator()(const_key_reference r_lhs_key, const_key_reference r_rhs_key) const
+    {
+      return (eq_fn_base::operator()(r_lhs_key, r_rhs_key));
+    }
+
+#undef PB_DS_CLASS_T_DEC
+#undef PB_DS_CLASS_C_DEC
+
+#define PB_DS_CLASS_T_DEC					\
+    template<typename Key, class Eq_Fn, class Allocator>
+
+#define PB_DS_CLASS_C_DEC				\
+    hash_eq_fn<						\
+					Key,		\
+					Eq_Fn,		\
+					Allocator,	\
+					true>
+
+    /**
+     * Specialization 2- The client requests that hash values be stored.
+     **/
+    template<typename Key, class Eq_Fn, class Allocator>
+    struct hash_eq_fn<Key, Eq_Fn, Allocator, true> :
+      public Eq_Fn
+    {
+      typedef typename Allocator::size_type size_type;
+
+      typedef Eq_Fn eq_fn_base;
+
+      typedef typename Allocator::template rebind<Key>::other key_allocator;
+
+      typedef typename key_allocator::const_reference const_key_reference;
+
+      hash_eq_fn();
+
+      hash_eq_fn(const Eq_Fn& r_eq_fn);
+
+      inline bool
+      operator()(const_key_reference r_lhs_key, size_type lhs_hash, const_key_reference r_rhs_key, size_type rhs_hash) const;
+
+      inline void
+      swap(const PB_DS_CLASS_C_DEC& other);
+    };
+
+    PB_DS_CLASS_T_DEC
+    PB_DS_CLASS_C_DEC::
+    hash_eq_fn()
+    { }
+
+    PB_DS_CLASS_T_DEC
+    PB_DS_CLASS_C_DEC::
+    hash_eq_fn(const Eq_Fn& r_eq_fn) :
+      Eq_Fn(r_eq_fn)
+    { }
+
+    PB_DS_CLASS_T_DEC
+    inline bool
+    PB_DS_CLASS_C_DEC::
+    operator()(const_key_reference r_lhs_key, size_type lhs_hash, const_key_reference r_rhs_key, size_type rhs_hash) const
+    {
+      PB_DS_DBG_ASSERT(!eq_fn_base::operator()(r_lhs_key, r_rhs_key) ||
+		       lhs_hash == rhs_hash);
+
+      return (lhs_hash == rhs_hash&& 
+	      eq_fn_base::operator()(r_lhs_key, r_rhs_key));
+    }
+
+    PB_DS_CLASS_T_DEC
+    inline void
+    PB_DS_CLASS_C_DEC::
+    swap(const PB_DS_CLASS_C_DEC& other)
+    {
+      std::swap((Eq_Fn& )(*this), (Eq_Fn& )(other));
+    }
+
+#undef PB_DS_CLASS_T_DEC
+#undef PB_DS_CLASS_C_DEC
+
+#undef PB_DS_DBG_ASSERT
+#undef PB_DS_DBG_VERIFY
+#undef PB_DS_DBG_ONLY
+
+  } // namespace detail
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_HASH_EQ_FN_HPP
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/gp_hash_table_map_/constructor_destructor_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/gp_hash_table_map_/constructor_destructor_fn_imps.hpp
new file mode 100644
index 00000000000..6ab4b265dc6
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/gp_hash_table_map_/constructor_destructor_fn_imps.hpp
@@ -0,0 +1,263 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file constructor_destructor_fn_imps.hpp
+ * Contains implementations of gp_ht_map_'s constructors, destructor,
+ *    and related functions.
+ */
+
+PB_DS_CLASS_T_DEC
+typename PB_DS_CLASS_C_DEC::entry_allocator
+PB_DS_CLASS_C_DEC::s_entry_allocator;
+
+PB_DS_CLASS_T_DEC
+template<typename It>
+void
+PB_DS_CLASS_C_DEC::
+copy_from_range(It first_it, It last_it)
+{
+  while (first_it != last_it)
+    insert(*(first_it++));
+}
+
+PB_DS_CLASS_T_DEC
+PB_DS_CLASS_C_DEC::
+PB_DS_CLASS_NAME() :
+  ranged_probe_fn_base(resize_base::get_nearest_larger_size(1)),
+  m_a_entries(s_entry_allocator.allocate(
+					 resize_base::get_nearest_larger_size(1))),
+  m_num_e(resize_base::get_nearest_larger_size(1)),
+  m_num_used_e(0)
+{
+  initialize();
+
+  PB_DS_DBG_ONLY(PB_DS_CLASS_C_DEC::assert_valid();)
+    }
+
+PB_DS_CLASS_T_DEC
+PB_DS_CLASS_C_DEC::
+PB_DS_CLASS_NAME(const Hash_Fn& r_hash_fn)    :
+  ranged_probe_fn_base(resize_base::get_nearest_larger_size(1), r_hash_fn),
+  m_a_entries(s_entry_allocator.allocate(
+					 resize_base::get_nearest_larger_size(1))),
+  m_num_e(resize_base::get_nearest_larger_size(1)),
+  m_num_used_e(0)
+{
+  initialize();
+
+  PB_DS_DBG_ONLY(PB_DS_CLASS_C_DEC::assert_valid();)
+    }
+
+PB_DS_CLASS_T_DEC
+PB_DS_CLASS_C_DEC::
+PB_DS_CLASS_NAME(const Hash_Fn& r_hash_fn, const Eq_Fn& r_eq_fn) :
+  hash_eq_fn_base(r_eq_fn),
+  ranged_probe_fn_base(resize_base::get_nearest_larger_size(1), r_hash_fn),
+  m_a_entries(s_entry_allocator.allocate(
+					 resize_base::get_nearest_larger_size(1))),
+  m_num_e(resize_base::get_nearest_larger_size(1)),
+  m_num_used_e(0)
+{
+  initialize();
+
+  PB_DS_DBG_ONLY(PB_DS_CLASS_C_DEC::assert_valid();)
+    }
+
+PB_DS_CLASS_T_DEC
+PB_DS_CLASS_C_DEC::
+PB_DS_CLASS_NAME(const Hash_Fn& r_hash_fn, const Eq_Fn& r_eq_fn, const Comb_Probe_Fn& r_comb_hash_fn) :
+  hash_eq_fn_base(r_eq_fn),
+  ranged_probe_fn_base(resize_base::get_nearest_larger_size(1),
+		       r_hash_fn, r_comb_hash_fn),
+  m_a_entries(s_entry_allocator.allocate(
+					 resize_base::get_nearest_larger_size(1))),
+  m_num_e(resize_base::get_nearest_larger_size(1)),
+  m_num_used_e(0)
+{
+  initialize();
+
+  PB_DS_DBG_ONLY(PB_DS_CLASS_C_DEC::assert_valid();)
+    }
+
+PB_DS_CLASS_T_DEC
+PB_DS_CLASS_C_DEC::
+PB_DS_CLASS_NAME(const Hash_Fn& r_hash_fn, const Eq_Fn& r_eq_fn, const Comb_Probe_Fn& r_comb_hash_fn, const Probe_Fn& r_probe_fn) :
+  hash_eq_fn_base(r_eq_fn),
+  ranged_probe_fn_base(resize_base::get_nearest_larger_size(1),
+		       r_hash_fn, r_comb_hash_fn, r_probe_fn),
+  m_a_entries(s_entry_allocator.allocate(
+					 resize_base::get_nearest_larger_size(1))),
+  m_num_e(resize_base::get_nearest_larger_size(1)),
+  m_num_used_e(0)
+{
+  initialize();
+
+  PB_DS_DBG_ONLY(PB_DS_CLASS_C_DEC::assert_valid();)
+    }
+
+PB_DS_CLASS_T_DEC
+PB_DS_CLASS_C_DEC::
+PB_DS_CLASS_NAME(const Hash_Fn& r_hash_fn, const Eq_Fn& r_eq_fn, const Comb_Probe_Fn& r_comb_hash_fn, const Probe_Fn& r_probe_fn, const Resize_Policy& r_resize_policy) :
+  hash_eq_fn_base(r_eq_fn),
+  resize_base(r_resize_policy),
+  ranged_probe_fn_base(resize_base::get_nearest_larger_size(1),
+		       r_hash_fn, r_comb_hash_fn, r_probe_fn),
+  m_a_entries(s_entry_allocator.allocate(
+					 resize_base::get_nearest_larger_size(1))),
+  m_num_e(resize_base::get_nearest_larger_size(1)),
+  m_num_used_e(0)
+{
+  initialize();
+
+  PB_DS_DBG_ONLY(PB_DS_CLASS_C_DEC::assert_valid();)
+    }
+
+PB_DS_CLASS_T_DEC
+PB_DS_CLASS_C_DEC::
+PB_DS_CLASS_NAME(const PB_DS_CLASS_C_DEC& other) :
+#ifdef PB_DS_GP_HT_MAP_DEBUG__
+  PB_DS_MAP_DEBUG_BASE_C_DEC(other),
+#endif // #ifdef PB_DS_GP_HT_MAP_DEBUG__
+  hash_eq_fn_base(other),
+  resize_base(other),
+  ranged_probe_fn_base(other),
+  m_a_entries(s_entry_allocator.allocate(other.m_num_e)),
+  m_num_e(other.m_num_e),
+  m_num_used_e(other.m_num_used_e)
+{
+  for (size_type i = 0; i < m_num_e; ++i)
+    m_a_entries[i].m_stat = (entry_status)empty_entry_status;
+
+  try
+    {
+      for (size_type i = 0; i < m_num_e; ++i)
+        {
+	  m_a_entries[i].m_stat = other.m_a_entries[i].m_stat;
+
+	  if (m_a_entries[i].m_stat == valid_entry_status)
+	    new (m_a_entries + i) entry(other.m_a_entries[i]);
+        }
+    }
+  catch(...)
+    {
+      deallocate_all();
+
+      throw;
+    }
+
+  PB_DS_DBG_ONLY(PB_DS_CLASS_C_DEC::assert_valid();)
+    }
+
+PB_DS_CLASS_T_DEC
+PB_DS_CLASS_C_DEC::
+~PB_DS_CLASS_NAME()
+{
+  deallocate_all();
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+swap(PB_DS_CLASS_C_DEC& other)
+{
+  PB_DS_DBG_ONLY(assert_valid());
+  PB_DS_DBG_ONLY(other.assert_valid());
+
+  std::swap(m_a_entries, other.m_a_entries);
+
+  std::swap(m_num_e, other.m_num_e);
+
+  std::swap(m_num_used_e, other.m_num_used_e);
+
+  ranged_probe_fn_base::swap(other);
+
+  hash_eq_fn_base::swap(other);
+
+  resize_base::swap(other);
+
+  PB_DS_DBG_ONLY(map_debug_base::swap(other));
+
+  PB_DS_DBG_ONLY(assert_valid());
+  PB_DS_DBG_ONLY(other.assert_valid());
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+deallocate_all()
+{
+  clear();
+
+  erase_all_valid_entries(m_a_entries, m_num_e);
+
+  s_entry_allocator.deallocate(m_a_entries, m_num_e);
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+erase_all_valid_entries(entry_array a_entries_resized, size_type size)
+{
+  for (size_type pos = 0; pos < size; ++pos)
+    {
+      entry_pointer p_e =& a_entries_resized[pos];
+
+      if (p_e->m_stat == valid_entry_status)
+	p_e->m_value.~value_type();
+    }
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+initialize()
+{
+  Resize_Policy::notify_resized(m_num_e);
+
+  Resize_Policy::notify_cleared();
+
+  ranged_probe_fn_base::notify_resized(m_num_e);
+
+  for (size_type i = 0; i < m_num_e; ++i)
+    m_a_entries[i].m_stat = (entry_status)empty_entry_status;
+}
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/gp_hash_table_map_/constructor_destructor_no_store_hash_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/gp_hash_table_map_/constructor_destructor_no_store_hash_fn_imps.hpp
new file mode 100644
index 00000000000..960a79045a9
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/gp_hash_table_map_/constructor_destructor_no_store_hash_fn_imps.hpp
@@ -0,0 +1,63 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file constructor_destructor_no_store_hash_fn_imps.hpp
+ * Contains implementations of gp_ht_map_'s constructors, destructor,
+ *    and related functions.
+ */
+
+PB_DS_CLASS_T_DEC
+inline void
+PB_DS_CLASS_C_DEC::
+constructor_insert_new_imp(const_mapped_reference r_val, size_type pos, integral_constant<int,false>)
+{
+  PB_DS_DBG_ASSERT(m_a_entries[pos].m_stat != valid_entry_status);
+
+  entry* const p_e = m_a_entries + pos;
+
+  new (&p_e->m_value) mapped_value_type(r_val);
+
+  p_e->m_stat = valid_entry_status;
+
+  PB_DS_DBG_ONLY(map_debug_base::
+		 insert_new(p_e->m_value.first);)
+    }
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/gp_hash_table_map_/constructor_destructor_store_hash_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/gp_hash_table_map_/constructor_destructor_store_hash_fn_imps.hpp
new file mode 100644
index 00000000000..95389795e77
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/gp_hash_table_map_/constructor_destructor_store_hash_fn_imps.hpp
@@ -0,0 +1,66 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file constructor_destructor_store_hash_fn_imps.hpp
+ * Contains implementations of gp_ht_map_'s constructors, destructor,
+ *    and related functions.
+ */
+
+PB_DS_CLASS_T_DEC
+inline void
+PB_DS_CLASS_C_DEC::
+constructor_insert_new_imp(const_mapped_reference r_val, size_type pos, true_type)
+{
+  PB_DS_DBG_ASSERT(m_a_entries[pos].m_stat != valid_entry_status);
+
+  entry* const p_e = m_a_entries + pos;
+
+  new (&p_e->m_value) mapped_value_type(r_val);
+
+  p_e->m_hash = ranged_probe_fn_base::operator()(
+						 PB_DS_V2F(r_val)).second;
+
+  p_e->m_stat = valid_entry_status;
+
+  PB_DS_DBG_ONLY(map_debug_base::
+		 insert_new(p_e->m_value.first);)
+    }
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/gp_hash_table_map_/debug_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/gp_hash_table_map_/debug_fn_imps.hpp
new file mode 100644
index 00000000000..aaac10f76b2
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/gp_hash_table_map_/debug_fn_imps.hpp
@@ -0,0 +1,62 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file debug_fn_imps.hpp
+ * Contains implementations of gp_ht_map_'s debug-mode functions.
+ */
+
+#ifdef PB_DS_GP_HT_MAP_DEBUG__
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+assert_valid() const
+{
+  map_debug_base::check_size(m_num_used_e);
+
+  assert_entry_array_valid(m_a_entries, traits_base::m_store_extra_indicator);
+}
+
+#include <ext/pb_ds/detail/gp_hash_table_map_/debug_no_store_hash_fn_imps.hpp>
+#include <ext/pb_ds/detail/gp_hash_table_map_/debug_store_hash_fn_imps.hpp>
+
+#endif // #ifdef PB_DS_GP_HT_MAP_DEBUG__
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/gp_hash_table_map_/debug_no_store_hash_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/gp_hash_table_map_/debug_no_store_hash_fn_imps.hpp
new file mode 100644
index 00000000000..c55069ed18f
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/gp_hash_table_map_/debug_no_store_hash_fn_imps.hpp
@@ -0,0 +1,84 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file debug_no_store_hash_fn_imps.hpp
+ * Contains implementations of gp_ht_map_'s debug-mode functions.
+ */
+
+#ifdef PB_DS_GP_HT_MAP_DEBUG__
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+assert_entry_array_valid(const entry_array a_entries, store_hash_false_type) const
+{
+  size_type iterated_num_used_e = 0;
+
+  for (size_type pos = 0; pos < m_num_e; ++pos)
+    {
+      const_entry_pointer p_e =& a_entries[pos];
+
+      switch(p_e->m_stat)
+        {
+        case empty_entry_status:
+        case erased_entry_status:
+	  break;
+        case valid_entry_status:
+	  {
+	    const_key_reference r_key =
+	      PB_DS_V2F(p_e->m_value);
+
+	    map_debug_base::check_key_exists(r_key);
+
+	    ++iterated_num_used_e;
+
+	    break;
+	  }
+        default:
+	  PB_DS_DBG_ASSERT(0);
+        };
+    }
+
+  PB_DS_DBG_ASSERT(iterated_num_used_e == m_num_used_e);
+}
+
+#endif // #ifdef PB_DS_GP_HT_MAP_DEBUG__
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/gp_hash_table_map_/debug_store_hash_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/gp_hash_table_map_/debug_store_hash_fn_imps.hpp
new file mode 100644
index 00000000000..dc92deff77e
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/gp_hash_table_map_/debug_store_hash_fn_imps.hpp
@@ -0,0 +1,89 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file debug_store_hash_fn_imps.hpp
+ * Contains implementations of gp_ht_map_'s debug-mode functions.
+ */
+
+#ifdef PB_DS_GP_HT_MAP_DEBUG__
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+assert_entry_array_valid(const entry_array a_entries, store_hash_true_type) const
+{
+  size_type iterated_num_used_e = 0;
+
+  for (size_type pos = 0; pos < m_num_e; ++pos)
+    {
+      const_entry_pointer p_e =& a_entries[pos];
+
+      switch(p_e->m_stat)
+        {
+        case empty_entry_status:
+        case erased_entry_status:
+	  break;
+        case valid_entry_status:
+	  {
+	    const_key_reference r_key =
+	      PB_DS_V2F(p_e->m_value);
+
+	    map_debug_base::check_key_exists(r_key);
+
+	    const comp_hash pos_hash_pair =
+	      ranged_probe_fn_base::operator()(r_key);
+
+	    PB_DS_DBG_ASSERT(p_e->m_hash == pos_hash_pair.second);
+
+	    ++iterated_num_used_e;
+
+	    break;
+	  }
+        default:
+	  PB_DS_DBG_ASSERT(0);
+        };
+    }
+
+  PB_DS_DBG_ASSERT(iterated_num_used_e == m_num_used_e);
+}
+
+#endif // #ifdef PB_DS_GP_HT_MAP_DEBUG__
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/gp_hash_table_map_/erase_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/gp_hash_table_map_/erase_fn_imps.hpp
new file mode 100644
index 00000000000..92422873b40
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/gp_hash_table_map_/erase_fn_imps.hpp
@@ -0,0 +1,126 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file erase_fn_imps.hpp
+ * Contains implementations of gp_ht_map_'s erase related functions.
+ */
+
+PB_DS_CLASS_T_DEC
+inline void
+PB_DS_CLASS_C_DEC::
+erase_entry(entry_pointer p_e)
+{
+  PB_DS_DBG_ASSERT(p_e->m_stat = valid_entry_status);
+
+  PB_DS_DBG_ONLY(map_debug_base::erase_existing(
+						PB_DS_V2F(p_e->m_value));)
+
+    typedef
+    typename PB_DS_TYPES_TRAITS_C_DEC::stored_value_type
+    stored_value_type;
+
+  p_e->m_value.~value_type();
+
+  p_e->m_stat = erased_entry_status;
+
+  PB_DS_DBG_ASSERT(m_num_used_e > 0);
+  resize_base::notify_erased(--m_num_used_e);
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+clear()
+{
+  for (size_type pos = 0; pos < m_num_e; ++pos)
+    {
+      entry_pointer p_e =& m_a_entries[pos];
+
+      if (p_e->m_stat == valid_entry_status)
+	erase_entry(p_e);
+    }
+
+  do_resize_if_needed_no_throw();
+
+  resize_base::notify_cleared();
+}
+
+PB_DS_CLASS_T_DEC
+template<typename Pred>
+inline typename PB_DS_CLASS_C_DEC::size_type
+PB_DS_CLASS_C_DEC::
+erase_if(Pred pred)
+{
+  PB_DS_DBG_ONLY(PB_DS_CLASS_C_DEC::assert_valid();)
+
+    size_type num_ersd = 0;
+
+  for (size_type pos = 0; pos < m_num_e; ++pos)
+    {
+      entry_pointer p_e =& m_a_entries[pos];
+
+      if (p_e->m_stat == valid_entry_status)
+	if (pred(p_e->m_value))
+	  {
+	    ++num_ersd;
+
+	    erase_entry(p_e);
+	  }
+    }
+
+  do_resize_if_needed_no_throw();
+
+  PB_DS_DBG_ONLY(PB_DS_CLASS_C_DEC::assert_valid();)
+
+    return (num_ersd);
+}
+
+PB_DS_CLASS_T_DEC
+inline bool
+PB_DS_CLASS_C_DEC::
+erase(const_key_reference r_key)
+{
+  return (erase_imp(r_key, traits_base::m_store_extra_indicator));
+}
+
+#include <ext/pb_ds/detail/gp_hash_table_map_/erase_no_store_hash_fn_imps.hpp>
+#include <ext/pb_ds/detail/gp_hash_table_map_/erase_store_hash_fn_imps.hpp>
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/gp_hash_table_map_/erase_no_store_hash_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/gp_hash_table_map_/erase_no_store_hash_fn_imps.hpp
new file mode 100644
index 00000000000..eb2bf9899fd
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/gp_hash_table_map_/erase_no_store_hash_fn_imps.hpp
@@ -0,0 +1,107 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file erase_no_store_hash_fn_imps.hpp
+ * Contains implementations of gp_ht_map_'s erase related functions, when the hash
+ *    value is not stored.
+ */
+
+PB_DS_CLASS_T_DEC
+inline bool
+PB_DS_CLASS_C_DEC::
+erase_imp(const_key_reference r_key,  false_type)
+{
+  PB_DS_DBG_ONLY(PB_DS_CLASS_C_DEC::assert_valid();)
+
+    size_type hash = ranged_probe_fn_base::operator()(r_key);
+
+  size_type i;
+
+  resize_base::notify_erase_search_start();
+
+  for (i = 0; i < m_num_e; ++i)
+    {
+      const size_type pos =
+	ranged_probe_fn_base::operator()(                r_key,  hash, i);
+
+      entry* const p_e = m_a_entries + pos;
+
+      switch(p_e->m_stat)
+        {
+        case empty_entry_status:
+	  {
+	    resize_base::notify_erase_search_end();
+
+	    PB_DS_DBG_ONLY(map_debug_base::check_key_does_not_exist(
+								    r_key));
+
+	    return (false);
+	  }
+	  break;
+        case valid_entry_status:
+	  if (hash_eq_fn_base::operator()(
+					  PB_DS_V2F(p_e->m_value),
+					  r_key))
+            {
+	      resize_base::notify_erase_search_end();
+
+	      erase_entry(p_e);
+
+	      do_resize_if_needed_no_throw();
+
+	      return (true);
+            }
+	  break;
+        case erased_entry_status:
+	  break;
+        default:
+	  PB_DS_DBG_ASSERT(0);
+        };
+
+      resize_base::notify_erase_search_collision();
+    }
+
+  resize_base::notify_erase_search_end();
+
+  return (false);
+}
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/gp_hash_table_map_/erase_store_hash_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/gp_hash_table_map_/erase_store_hash_fn_imps.hpp
new file mode 100644
index 00000000000..a6f683160ce
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/gp_hash_table_map_/erase_store_hash_fn_imps.hpp
@@ -0,0 +1,107 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file erase_store_hash_fn_imps.hpp
+ * Contains implementations of gp_ht_map_'s erase related functions, when the hash
+ *    value is stored.
+ */
+
+PB_DS_CLASS_T_DEC
+inline bool
+PB_DS_CLASS_C_DEC::
+erase_imp(const_key_reference r_key,  true_type)
+{
+  const comp_hash pos_hash_pair =
+    ranged_probe_fn_base::operator()(r_key);
+
+  size_type i;
+
+  resize_base::notify_erase_search_start();
+
+  for (i = 0; i < m_num_e; ++i)
+    {
+      const size_type pos = ranged_probe_fn_base::operator()(            r_key, pos_hash_pair.second, i);
+
+      entry* const p_e = m_a_entries + pos;
+
+      switch(p_e->m_stat)
+        {
+        case empty_entry_status:
+	  {
+	    resize_base::notify_erase_search_end();
+
+	    PB_DS_DBG_ONLY(map_debug_base::check_key_does_not_exist(
+								    r_key));
+
+	    return (false);
+	  }
+	  break;
+        case valid_entry_status:
+	  if (hash_eq_fn_base::operator()(
+					  PB_DS_V2F(p_e->m_value),
+					  p_e->m_hash,
+					  r_key,
+					  pos_hash_pair.second))
+            {
+	      resize_base::notify_erase_search_end();
+
+	      erase_entry(p_e);
+
+	      do_resize_if_needed_no_throw();
+
+	      return (true);
+            }
+	  break;
+        case erased_entry_status:
+	  break;
+        default:
+	  PB_DS_DBG_ASSERT(0);
+        };
+
+      resize_base::notify_erase_search_collision();
+    }
+
+  resize_base::notify_erase_search_end();
+
+  return (false);
+}
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/gp_hash_table_map_/find_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/gp_hash_table_map_/find_fn_imps.hpp
new file mode 100644
index 00000000000..eb231d8b056
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/gp_hash_table_map_/find_fn_imps.hpp
@@ -0,0 +1,83 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file find_fn_imps.hpp
+ * Contains implementations of gp_ht_map_'s find related functions.
+ */
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::point_iterator
+PB_DS_CLASS_C_DEC::
+find(const_key_reference r_key)
+{
+  PB_DS_DBG_ONLY(assert_valid();)
+
+    return ((find_key_pointer(r_key, traits_base::m_store_extra_indicator)));
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::const_point_iterator
+PB_DS_CLASS_C_DEC::
+find(const_key_reference r_key) const
+{
+  PB_DS_DBG_ONLY(assert_valid();)
+
+    return (const_cast<PB_DS_CLASS_C_DEC& >(*this).
+	    find_key_pointer(r_key, traits_base::m_store_extra_indicator));
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::point_iterator
+PB_DS_CLASS_C_DEC::
+find_end()
+{
+  return (NULL);
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::const_point_iterator
+PB_DS_CLASS_C_DEC::
+find_end() const
+{
+  return (NULL);
+}
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/gp_hash_table_map_/find_no_store_hash_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/gp_hash_table_map_/find_no_store_hash_fn_imps.hpp
new file mode 100644
index 00000000000..f203850412a
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/gp_hash_table_map_/find_no_store_hash_fn_imps.hpp
@@ -0,0 +1,52 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file find_no_store_hash_fn_imps.hpp
+ * Contains implementations of gp_ht_map_'s find related functions, when the hash
+ *    value is not stored.
+ */
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::pointer
+PB_DS_CLASS_C_DEC::
+find_key_pointer(const_key_reference r_key, store_hash_false_type)
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/gp_hash_table_map_/find_store_hash_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/gp_hash_table_map_/find_store_hash_fn_imps.hpp
new file mode 100644
index 00000000000..89826079d0c
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/gp_hash_table_map_/find_store_hash_fn_imps.hpp
@@ -0,0 +1,46 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file find_store_hash_fn_imps.hpp
+ * Contains implementations of gp_ht_map_'s insert related functions, when the hash
+ *    value is stored.
+ */
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/gp_hash_table_map_/gp_ht_map_.hpp b/libstdc++-v3/include/ext/pb_ds/detail/gp_hash_table_map_/gp_ht_map_.hpp
new file mode 100644
index 00000000000..3f0c6c22d88
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/gp_hash_table_map_/gp_ht_map_.hpp
@@ -0,0 +1,891 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file gp_ht_map_.hpp
+ * Contains an implementation class for gp_ht_map_.
+ */
+
+#include <ext/pb_ds/tag_and_trait.hpp>
+#include <ext/pb_ds/detail/hash_fn/ranged_probe_fn.hpp>
+#include <ext/pb_ds/detail/types_traits.hpp>
+#include <ext/pb_ds/exception.hpp>
+#include <ext/pb_ds/detail/eq_fn/hash_eq_fn.hpp>
+#include <utility>
+#ifdef PB_DS_HT_MAP_TRACE_
+#include <iostream>
+#endif // PB_DS_HT_MAP_TRACE_
+#ifdef PB_DS_USE_MAP_DEBUG_BASE
+#include <ext/pb_ds/detail/map_debug_base.hpp>
+#endif // #ifdef PB_DS_USE_MAP_DEBUG_BASE
+
+namespace pb_ds
+{
+  namespace detail
+  {
+
+#ifdef PB_DS_GP_HT_MAP_DEBUG__
+#define PB_DS_DBG_ASSERT(X) assert(X)
+#define PB_DS_DBG_VERIFY(X) assert(X)
+#define PB_DS_DBG_ONLY(X) X
+#else // #ifdef PB_DS_GP_HT_MAP_DEBUG__
+#define PB_DS_DBG_ASSERT(X)
+#define PB_DS_DBG_VERIFY(X) {if((X)==0);}
+#define PB_DS_DBG_ONLY(X) ;
+#endif // #ifdef PB_DS_GP_HT_MAP_DEBUG__
+
+#define PB_DS_CLASS_T_DEC						\
+    template<								\
+						typename Key,		\
+						typename Mapped,	\
+						class Hash_Fn,		\
+						class Eq_Fn,		\
+						class Allocator,	\
+						bool Store_Hash,	\
+						class Comb_Probe_Fn,	\
+						class Probe_Fn,		\
+						class Resize_Policy>
+
+#ifdef PB_DS_DATA_TRUE_INDICATOR
+#define PB_DS_CLASS_NAME			\
+    gp_ht_map_data_
+#endif // #ifdef PB_DS_DATA_TRUE_INDICATOR
+
+#ifdef PB_DS_DATA_FALSE_INDICATOR
+#define PB_DS_CLASS_NAME			\
+    gp_ht_map_no_data_
+#endif // #ifdef PB_DS_DATA_FALSE_INDICATOR
+
+#define PB_DS_CLASS_C_DEC					\
+    PB_DS_CLASS_NAME<						\
+						Key,		\
+						Mapped,		\
+						Hash_Fn,	\
+						Eq_Fn,		\
+						Allocator,	\
+						Store_Hash,	\
+						Comb_Probe_Fn,	\
+						Probe_Fn,	\
+						Resize_Policy>
+
+#define PB_DS_HASH_EQ_FN_C_DEC					\
+    hash_eq_fn<					\
+						Key,		\
+						Eq_Fn,		\
+						Allocator,	\
+						Store_Hash>
+
+#define PB_DS_RANGED_PROBE_FN_C_DEC					\
+    ranged_probe_fn<					\
+							Key,		\
+							Hash_Fn,	\
+							Allocator,	\
+							Comb_Probe_Fn,	\
+							Probe_Fn,	\
+							Store_Hash>
+
+#define PB_DS_TYPES_TRAITS_C_DEC				\
+    types_traits<						\
+						Key,		\
+						Mapped,		\
+						Allocator,	\
+						Store_Hash>
+
+#ifdef PB_DS_USE_MAP_DEBUG_BASE
+#define PB_DS_MAP_DEBUG_BASE_C_DEC					\
+    map_debug_base<					\
+									Key, \
+									Eq_Fn, \
+									typename Allocator::template rebind< \
+													     Key>::other::const_reference>
+#endif // #ifdef PB_DS_USE_MAP_DEBUG_BASE
+
+#ifdef PB_DS_DATA_TRUE_INDICATOR
+#define PB_DS_V2F(X) (X).first
+#define PB_DS_V2S(X) (X).second
+#endif // #ifdef PB_DS_DATA_TRUE_INDICATOR
+
+#ifdef PB_DS_DATA_FALSE_INDICATOR
+#define PB_DS_V2F(X) (X)
+#define PB_DS_V2S(X) Mapped()
+#endif // #ifdef PB_DS_DATA_FALSE_INDICATOR
+
+#define PB_DS_STATIC_ASSERT(UNIQUE, E)					\
+    typedef								\
+    static_assert_dumclass<				\
+									sizeof(static_assert<(bool)(E)>)> \
+    UNIQUE##static_assert_type
+
+    template<typename Key,
+	     typename Mapped,
+	     class Hash_Fn,
+	     class Eq_Fn,
+	     class Allocator,
+	     bool Store_Hash,
+	     class Comb_Probe_Fn,
+	     class Probe_Fn,
+	     class Resize_Policy>
+    class PB_DS_CLASS_NAME :
+#ifdef PB_DS_GP_HT_MAP_DEBUG__
+      protected PB_DS_MAP_DEBUG_BASE_C_DEC,
+#endif // #ifdef PB_DS_GP_HT_MAP_DEBUG__
+      public PB_DS_HASH_EQ_FN_C_DEC,
+      public Resize_Policy,
+      public PB_DS_RANGED_PROBE_FN_C_DEC,
+      public PB_DS_TYPES_TRAITS_C_DEC
+    {
+
+    private:
+
+      typedef
+      typename PB_DS_TYPES_TRAITS_C_DEC::store_extra_false_type
+      store_hash_false_type;
+
+      typedef
+      typename PB_DS_TYPES_TRAITS_C_DEC::store_extra_true_type
+      store_hash_true_type;
+
+      typedef typename PB_DS_TYPES_TRAITS_C_DEC::value_type value_type_;
+
+      typedef typename PB_DS_TYPES_TRAITS_C_DEC::pointer pointer_;
+
+      typedef
+      typename PB_DS_TYPES_TRAITS_C_DEC::const_pointer
+      const_pointer_;
+
+      typedef typename PB_DS_TYPES_TRAITS_C_DEC::reference reference_;
+
+      typedef
+      typename PB_DS_TYPES_TRAITS_C_DEC::const_reference
+      const_reference_;
+
+#define PB_DS_GEN_POS				\
+      typename Allocator::size_type
+
+#include <ext/pb_ds/detail/unordered_iterator/const_point_iterator.hpp>
+#include <ext/pb_ds/detail/unordered_iterator/point_iterator.hpp>
+#include <ext/pb_ds/detail/unordered_iterator/const_iterator.hpp>
+#include <ext/pb_ds/detail/unordered_iterator/iterator.hpp>
+
+#undef PB_DS_GEN_POS
+
+    public:
+
+      typedef typename Allocator::size_type size_type;
+
+      typedef typename Allocator::difference_type difference_type;
+
+      typedef Hash_Fn hash_fn;
+
+      typedef Eq_Fn eq_fn;
+
+      typedef Allocator allocator;
+
+      typedef Probe_Fn probe_fn;
+
+      typedef Comb_Probe_Fn comb_probe_fn;
+
+      typedef Resize_Policy resize_policy;
+
+      enum
+	{
+	  store_hash = Store_Hash
+	};
+
+      typedef typename PB_DS_TYPES_TRAITS_C_DEC::key_type key_type;
+
+      typedef typename PB_DS_TYPES_TRAITS_C_DEC::key_pointer key_pointer;
+
+      typedef
+      typename PB_DS_TYPES_TRAITS_C_DEC::const_key_pointer
+      const_key_pointer;
+
+      typedef typename PB_DS_TYPES_TRAITS_C_DEC::key_reference key_reference;
+
+      typedef
+      typename PB_DS_TYPES_TRAITS_C_DEC::const_key_reference
+      const_key_reference;
+
+      typedef typename PB_DS_TYPES_TRAITS_C_DEC::mapped_type mapped_type;
+
+      typedef
+      typename PB_DS_TYPES_TRAITS_C_DEC::mapped_pointer
+      mapped_pointer;
+
+      typedef
+      typename PB_DS_TYPES_TRAITS_C_DEC::const_mapped_pointer
+      const_mapped_pointer;
+
+      typedef
+      typename PB_DS_TYPES_TRAITS_C_DEC::mapped_reference
+      mapped_reference;
+
+      typedef
+      typename PB_DS_TYPES_TRAITS_C_DEC::const_mapped_reference
+      const_mapped_reference;
+
+      typedef typename PB_DS_TYPES_TRAITS_C_DEC::value_type value_type;
+
+      typedef typename PB_DS_TYPES_TRAITS_C_DEC::pointer pointer;
+
+      typedef typename PB_DS_TYPES_TRAITS_C_DEC::const_pointer const_pointer;
+
+      typedef typename PB_DS_TYPES_TRAITS_C_DEC::reference reference;
+
+      typedef
+      typename PB_DS_TYPES_TRAITS_C_DEC::const_reference
+      const_reference;
+
+#ifdef PB_DS_DATA_TRUE_INDICATOR
+      typedef point_iterator_ point_iterator;
+#endif // #ifdef PB_DS_DATA_TRUE_INDICATOR
+
+#ifdef PB_DS_DATA_FALSE_INDICATOR
+      typedef const_point_iterator_ point_iterator;
+#endif // #ifdef PB_DS_DATA_FALSE_INDICATOR
+
+      typedef const_point_iterator_ const_point_iterator;
+
+#ifdef PB_DS_DATA_TRUE_INDICATOR
+      typedef iterator_ iterator;
+#endif // #ifdef PB_DS_DATA_TRUE_INDICATOR
+
+#ifdef PB_DS_DATA_FALSE_INDICATOR
+      typedef const_iterator_ iterator;
+#endif // #ifdef PB_DS_DATA_FALSE_INDICATOR
+
+      typedef const_iterator_ const_iterator;
+
+    public:
+
+      PB_DS_CLASS_NAME();
+
+      PB_DS_CLASS_NAME(const PB_DS_CLASS_C_DEC& other);
+
+      PB_DS_CLASS_NAME(const Hash_Fn& r_hash_fn);
+
+      PB_DS_CLASS_NAME(const Hash_Fn& r_hash_fn, const Eq_Fn& r_eq_fn);
+
+      PB_DS_CLASS_NAME(const Hash_Fn& r_hash_fn, const Eq_Fn& r_eq_fn, const Comb_Probe_Fn& r_comb_probe_fn);
+
+      PB_DS_CLASS_NAME(const Hash_Fn& r_hash_fn, const Eq_Fn& r_eq_fn, const Comb_Probe_Fn& r_comb_probe_fn, const Probe_Fn& r_probe_fn);
+
+      PB_DS_CLASS_NAME(const Hash_Fn& r_hash_fn, const Eq_Fn& r_eq_fn, const Comb_Probe_Fn& r_comb_probe_fn, const Probe_Fn& r_probe_fn, const Resize_Policy& r_resize_policy);
+
+      template<typename It>
+      void
+      copy_from_range(It first_it, It last_it);
+
+      virtual
+      ~PB_DS_CLASS_NAME();
+
+      void
+      swap(PB_DS_CLASS_C_DEC& other);
+
+      inline size_type
+      size() const;
+
+      inline size_type
+      max_size() const;
+
+      inline bool
+      empty() const;
+
+      Hash_Fn& 
+      get_hash_fn();
+
+      const Hash_Fn& 
+      get_hash_fn() const;
+
+      Eq_Fn& 
+      get_eq_fn();
+
+      const Eq_Fn& 
+      get_eq_fn() const;
+
+      Probe_Fn& 
+      get_probe_fn();
+
+      const Probe_Fn& 
+      get_probe_fn() const;
+
+      Comb_Probe_Fn& 
+      get_comb_probe_fn();
+
+      const Comb_Probe_Fn& 
+      get_comb_probe_fn() const;
+
+      Resize_Policy& 
+      get_resize_policy();
+
+      const Resize_Policy& 
+      get_resize_policy() const;
+
+      inline std::pair<point_iterator, bool>
+      insert(const_reference r_val)
+      {
+	PB_DS_DBG_ONLY(PB_DS_CLASS_C_DEC::assert_valid();)
+
+	  return (insert_imp(r_val, traits_base::m_store_extra_indicator));
+      }
+
+      inline mapped_reference
+      operator[](const_key_reference r_key)
+      {
+#ifdef PB_DS_DATA_TRUE_INDICATOR
+	return (subscript_imp(r_key, traits_base::m_store_extra_indicator));
+#else // #ifdef PB_DS_DATA_TRUE_INDICATOR
+	insert(r_key);
+
+	return (traits_base::s_null_mapped);
+#endif // #ifdef PB_DS_DATA_TRUE_INDICATOR
+      }
+
+      inline point_iterator
+      find(const_key_reference r_key);
+
+      inline const_point_iterator
+      find(const_key_reference r_key) const;
+
+      inline point_iterator
+      find_end();
+
+      inline const_point_iterator
+      find_end() const;
+
+      inline bool
+      erase(const_key_reference r_key);
+
+      template<typename Pred>
+      inline size_type
+      erase_if(Pred prd);
+
+      void
+      clear();
+
+      inline iterator
+      begin();
+
+      inline const_iterator
+      begin() const;
+
+      inline iterator
+      end();
+
+      inline const_iterator
+      end() const;
+
+#ifdef PB_DS_GP_HT_MAP_DEBUG__
+
+      void
+      assert_valid() const;
+
+#endif // #ifdef PB_DS_GP_HT_MAP_DEBUG__
+
+#ifdef PB_DS_HT_MAP_TRACE_
+
+      void
+      trace() const;
+
+#endif // #ifdef PB_DS_HT_MAP_TRACE_
+
+    private:
+      typedef PB_DS_TYPES_TRAITS_C_DEC traits_base;
+
+      enum ENTRY_STATUS
+	{
+	  empty_entry_status,
+	  valid_entry_status,
+	  erased_entry_status
+	};
+
+      typedef char entry_status;
+
+      struct entry : public PB_DS_TYPES_TRAITS_C_DEC::stored_value_type
+      {
+	entry_status m_stat;
+      };
+
+      typedef
+      typename Allocator::template rebind<entry>::other
+      entry_allocator;
+
+      typedef typename entry_allocator::pointer entry_pointer;
+
+      typedef typename entry_allocator::const_pointer const_entry_pointer;
+
+      typedef typename entry_allocator::reference entry_reference;
+
+      typedef
+      typename entry_allocator::const_reference
+      const_entry_reference;
+
+      typedef typename entry_allocator::pointer entry_array;
+
+      typedef PB_DS_RANGED_PROBE_FN_C_DEC ranged_probe_fn_base;
+
+#ifdef PB_DS_GP_HT_MAP_DEBUG__
+      typedef PB_DS_MAP_DEBUG_BASE_C_DEC map_debug_base;
+#endif // #ifdef PB_DS_GP_HT_MAP_DEBUG__
+
+      typedef PB_DS_HASH_EQ_FN_C_DEC hash_eq_fn_base;
+
+      typedef Resize_Policy resize_base;
+
+#ifdef PB_DS_DATA_TRUE_INDICATOR
+      friend class iterator_;
+#endif // #ifdef PB_DS_DATA_TRUE_INDICATOR
+
+      friend class const_iterator_;
+
+      typedef typename PB_DS_TYPES_TRAITS_C_DEC::comp_hash comp_hash;
+
+    private:
+
+      void
+      deallocate_all();
+
+      void
+      initialize();
+
+      void
+      erase_all_valid_entries(entry_array a_entries_resized, size_type size);
+
+      inline bool
+      do_resize_if_needed();
+
+      inline void
+      do_resize_if_needed_no_throw();
+
+      void
+      resize_imp(size_type new_size);
+
+      virtual void
+      do_resize(size_type new_size);
+
+      void
+      resize_imp(entry_array a_entries_resized, size_type old_size);
+
+      inline void
+      resize_imp_reassign(entry_pointer p_e, entry_array a_entries_resized, store_hash_false_type);
+
+      inline void
+      resize_imp_reassign(entry_pointer p_e, entry_array a_entries_resized, store_hash_true_type);
+
+      inline size_type
+      find_ins_pos(const_key_reference r_key, store_hash_false_type);
+
+      inline comp_hash
+      find_ins_pos(const_key_reference r_key, store_hash_true_type);
+
+      inline std::pair<point_iterator, bool>
+      insert_imp(const_reference r_val, store_hash_false_type);
+
+      inline std::pair<point_iterator, bool>
+      insert_imp(const_reference r_val, store_hash_true_type);
+
+      inline pointer
+      insert_new_imp(const_reference r_val, size_type pos)
+      {
+	PB_DS_DBG_ASSERT(m_a_entries[pos].m_stat != valid_entry_status);
+
+	if (do_resize_if_needed())
+	  pos = find_ins_pos(PB_DS_V2F(r_val),
+			     traits_base::m_store_extra_indicator);
+
+	PB_DS_DBG_ASSERT(m_a_entries[pos].m_stat != valid_entry_status);
+
+	entry* const p_e = m_a_entries + pos;
+
+	new (&p_e->m_value) value_type(r_val);
+
+	p_e->m_stat = valid_entry_status;
+
+	resize_base::notify_inserted(++m_num_used_e);
+
+	PB_DS_DBG_ONLY(map_debug_base::
+		       insert_new(PB_DS_V2F(p_e->m_value));)
+
+	  PB_DS_DBG_ONLY(assert_valid();)
+
+	  return (&p_e->m_value);
+      }
+
+      inline pointer
+      insert_new_imp(const_reference r_val, comp_hash& r_pos_hash_pair)
+      {
+	PB_DS_DBG_ASSERT(m_a_entries[r_pos_hash_pair.first].m_stat !=
+			 valid_entry_status);
+
+	if (do_resize_if_needed())
+	  r_pos_hash_pair = find_ins_pos(
+					 PB_DS_V2F(r_val),
+					 traits_base::m_store_extra_indicator);
+
+	PB_DS_DBG_ASSERT(m_a_entries[r_pos_hash_pair.first].m_stat !=
+			 valid_entry_status);
+
+	entry* const p_e = m_a_entries + r_pos_hash_pair.first;
+
+	new (&p_e->m_value) value_type(r_val);
+
+	p_e->m_hash = r_pos_hash_pair.second;
+
+	p_e->m_stat = valid_entry_status;
+
+	resize_base::notify_inserted(++m_num_used_e);
+
+	PB_DS_DBG_ONLY(map_debug_base::insert_new(
+						  PB_DS_V2F(p_e->m_value));)
+
+	  PB_DS_DBG_ONLY(assert_valid();)
+
+	  return (&p_e->m_value);
+      }
+
+#ifdef PB_DS_DATA_TRUE_INDICATOR
+      inline mapped_reference
+      subscript_imp(const_key_reference r_key, store_hash_false_type)
+      {
+	PB_DS_DBG_ONLY(assert_valid();)
+
+	  const size_type pos =
+	  find_ins_pos(r_key, traits_base::m_store_extra_indicator);
+
+	entry_pointer p_e =& m_a_entries[pos];
+
+	if (p_e->m_stat != valid_entry_status)
+	  return (insert_new_imp(
+				 value_type(
+					    r_key,
+					    mapped_type()),
+				 pos)->second);
+
+	PB_DS_DBG_ONLY(map_debug_base::check_key_exists(r_key);)
+
+	  return (p_e->m_value.second);
+      }
+
+      inline mapped_reference
+      subscript_imp(const_key_reference r_key, store_hash_true_type)
+      {
+	PB_DS_DBG_ONLY(assert_valid();)
+
+	  comp_hash pos_hash_pair =
+	  find_ins_pos(r_key, traits_base::m_store_extra_indicator);
+
+	if (m_a_entries[pos_hash_pair.first].m_stat != valid_entry_status)
+	  return (insert_new_imp(
+				 value_type(
+					    r_key,
+					    mapped_type()),
+				 pos_hash_pair)->second);
+
+	PB_DS_DBG_ONLY(map_debug_base::check_key_exists(r_key));
+
+	return ((m_a_entries + pos_hash_pair.first)->m_value.second);
+      }
+#endif // #ifdef PB_DS_DATA_TRUE_INDICATOR
+
+      inline pointer
+      find_key_pointer(const_key_reference r_key, store_hash_false_type)
+      {
+	const size_type hash = ranged_probe_fn_base::operator()(r_key);
+
+	size_type i;
+
+	resize_base::notify_find_search_start();
+
+	// Loop until entry is found or until all possible entries accessed.
+
+	for (i = 0; i < m_num_e; ++i)
+	  {
+	    const size_type pos =
+	      ranged_probe_fn_base::operator()(                    r_key, hash, i);
+
+	    entry* const p_e = m_a_entries + pos;
+
+	    switch(p_e->m_stat)
+	      {
+	      case empty_entry_status:
+		{
+		  resize_base::notify_find_search_end();
+
+		  PB_DS_DBG_ONLY(map_debug_base::
+				 check_key_does_not_exist(r_key);)
+
+		    return (NULL);
+		}
+		break;
+	      case valid_entry_status:
+		if (hash_eq_fn_base::operator()(
+						PB_DS_V2F(p_e->m_value),
+						r_key))
+		  {
+		    resize_base::notify_find_search_end();
+
+		    PB_DS_DBG_ONLY(map_debug_base::check_key_exists(r_key);)
+
+		      return ((pointer)&p_e->m_value);
+		  }
+		break;
+	      case erased_entry_status:
+		break;
+	      default:
+		PB_DS_DBG_ASSERT(0);
+	      };
+
+	    resize_base::notify_find_search_collision();
+	  }
+
+	PB_DS_DBG_ONLY(map_debug_base::
+		       check_key_does_not_exist(r_key);)
+
+	  resize_base::notify_find_search_end();
+
+	return (NULL);
+      }
+
+      inline pointer
+      find_key_pointer(const_key_reference r_key, store_hash_true_type)
+      {
+	comp_hash pos_hash_pair = ranged_probe_fn_base::operator()(r_key);
+
+	size_type i;
+
+	resize_base::notify_find_search_start();
+
+	// Loop until entry is found or until all possible entries accessed.
+
+	for (i = 0; i < m_num_e; ++i)
+	  {
+	    const size_type pos =
+	      ranged_probe_fn_base::operator()(                    r_key, pos_hash_pair.second, i);
+
+	    entry* const p_e = m_a_entries + pos;
+
+	    switch(p_e->m_stat)
+	      {
+	      case empty_entry_status:
+		{
+		  resize_base::notify_find_search_end();
+
+		  PB_DS_DBG_ONLY(map_debug_base::
+				 check_key_does_not_exist(r_key);)
+
+		    return (NULL);
+		}
+		break;
+	      case valid_entry_status:
+		if (hash_eq_fn_base::operator()(
+						PB_DS_V2F(p_e->m_value),
+						p_e->m_hash,
+						r_key, pos_hash_pair.second))
+		  {
+		    resize_base::notify_find_search_end();
+
+		    PB_DS_DBG_ONLY(map_debug_base::check_key_exists(r_key);)
+
+		      return ((pointer)&p_e->m_value);
+		  }
+		break;
+	      case erased_entry_status:
+		break;
+	      default:
+		PB_DS_DBG_ASSERT(0);
+	      };
+
+	    resize_base::notify_find_search_collision();
+	  }
+
+	PB_DS_DBG_ONLY(map_debug_base::
+		       check_key_does_not_exist(r_key);)
+
+	  resize_base::notify_find_search_end();
+
+	return (NULL);
+      }
+
+      inline bool
+      erase_imp(const_key_reference r_key,  true_type);
+
+      inline bool
+      erase_imp(const_key_reference r_key,  false_type);
+
+      inline void
+      erase_entry(entry_pointer p_e);
+
+#ifdef PB_DS_DATA_TRUE_INDICATOR
+      void
+      inc_it_state(pointer& r_p_value, size_type& r_pos) const
+      {
+	inc_it_state((const_mapped_pointer& )r_p_value, r_pos);
+      }
+#endif // #ifdef PB_DS_DATA_TRUE_INDICATOR
+
+      void
+      inc_it_state(const_pointer& r_p_value, size_type& r_pos) const
+      {
+	PB_DS_DBG_ASSERT(r_p_value != NULL);
+
+	for (++r_pos; r_pos < m_num_e; ++r_pos)
+	  {
+	    const_entry_pointer p_e =& m_a_entries[r_pos];
+
+	    if (p_e->m_stat == valid_entry_status)
+	      {
+		r_p_value =& p_e->m_value;
+
+		return;
+	      }
+	  }
+
+	r_p_value = NULL;
+      }
+
+      void
+      get_start_it_state(const_pointer& r_p_value, size_type& r_pos) const
+      {
+	for (r_pos = 0; r_pos < m_num_e; ++r_pos)
+	  {
+	    const_entry_pointer p_e =& m_a_entries[r_pos];
+
+	    if (p_e->m_stat == valid_entry_status)
+	      {
+		r_p_value =& p_e->m_value;
+
+		return;
+	      }
+	  }
+
+	r_p_value = NULL;
+      }
+
+      void
+      get_start_it_state(pointer& r_p_value, size_type& r_pos)
+      {
+	for (r_pos = 0; r_pos < m_num_e; ++r_pos)
+	  {
+	    entry_pointer p_e =& m_a_entries[r_pos];
+
+	    if (p_e->m_stat == valid_entry_status)
+	      {
+		r_p_value =& p_e->m_value;
+
+		return;
+	      }
+	  }
+
+	r_p_value = NULL;
+      }
+
+#ifdef PB_DS_GP_HT_MAP_DEBUG__
+
+      void
+      assert_entry_array_valid(const entry_array a_entries, store_hash_false_type) const;
+
+      void
+      assert_entry_array_valid(const entry_array a_entries, store_hash_true_type) const;
+
+#endif // #ifdef PB_DS_GP_HT_MAP_DEBUG__
+
+    private:
+      static entry_allocator s_entry_allocator;
+
+      entry_pointer m_a_entries;
+
+      size_type m_num_e;
+
+      size_type m_num_used_e;
+
+      static iterator s_end_it;
+
+      static const_iterator s_const_end_it;
+
+      enum
+	{
+	  store_hash_ok =
+	  !Store_Hash ||
+	  !is_same<
+	  Hash_Fn,
+	  pb_ds::null_hash_fn>::value
+	};
+
+      PB_DS_STATIC_ASSERT(sth, store_hash_ok);
+    };
+
+#include <ext/pb_ds/detail/gp_hash_table_map_/constructor_destructor_fn_imps.hpp>
+#include <ext/pb_ds/detail/gp_hash_table_map_/find_fn_imps.hpp>
+#include <ext/pb_ds/detail/gp_hash_table_map_/resize_fn_imps.hpp>
+#include <ext/pb_ds/detail/gp_hash_table_map_/debug_fn_imps.hpp>
+#include <ext/pb_ds/detail/gp_hash_table_map_/info_fn_imps.hpp>
+#include <ext/pb_ds/detail/gp_hash_table_map_/policy_access_fn_imps.hpp>
+#include <ext/pb_ds/detail/gp_hash_table_map_/erase_fn_imps.hpp>
+#include <ext/pb_ds/detail/gp_hash_table_map_/iterator_fn_imps.hpp>
+#include <ext/pb_ds/detail/gp_hash_table_map_/insert_fn_imps.hpp>
+#include <ext/pb_ds/detail/gp_hash_table_map_/trace_fn_imps.hpp>
+
+#undef PB_DS_CLASS_T_DEC
+
+#undef PB_DS_CLASS_C_DEC
+
+#undef PB_DS_HASH_EQ_FN_C_DEC
+
+#undef PB_DS_RANGED_PROBE_FN_C_DEC
+
+#undef PB_DS_TYPES_TRAITS_C_DEC
+
+#undef PB_DS_MAP_DEBUG_BASE_C_DEC
+
+#undef PB_DS_CLASS_NAME
+
+#undef PB_DS_V2F
+#undef PB_DS_V2S
+
+#undef PB_DS_DBG_ASSERT
+#undef PB_DS_DBG_VERIFY
+#undef PB_DS_DBG_ONLY
+
+#undef PB_DS_STATIC_ASSERT
+
+  } // namespace detail
+} // namespace pb_ds
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/gp_hash_table_map_/info_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/gp_hash_table_map_/info_fn_imps.hpp
new file mode 100644
index 00000000000..071399d553a
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/gp_hash_table_map_/info_fn_imps.hpp
@@ -0,0 +1,70 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file info_fn_imps.hpp
+ * Contains implementations of gp_ht_map_'s entire container info related
+ *    functions.
+ */
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::size_type
+PB_DS_CLASS_C_DEC::
+size() const
+{
+  return (m_num_used_e);
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::size_type
+PB_DS_CLASS_C_DEC::
+max_size() const
+{
+  return (s_entry_allocator.max_size());
+}
+
+PB_DS_CLASS_T_DEC
+inline bool
+PB_DS_CLASS_C_DEC::
+empty() const
+{
+  return (size() == 0);
+}
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/gp_hash_table_map_/insert_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/gp_hash_table_map_/insert_fn_imps.hpp
new file mode 100644
index 00000000000..de6e3c21f72
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/gp_hash_table_map_/insert_fn_imps.hpp
@@ -0,0 +1,49 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file insert_fn_imps.hpp
+ * Contains implementations of gp_ht_map_'s insert related functions.
+ */
+
+#include <ext/pb_ds/detail/gp_hash_table_map_/insert_no_store_hash_fn_imps.hpp>
+#include <ext/pb_ds/detail/gp_hash_table_map_/insert_store_hash_fn_imps.hpp>
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/gp_hash_table_map_/insert_no_store_hash_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/gp_hash_table_map_/insert_no_store_hash_fn_imps.hpp
new file mode 100644
index 00000000000..0d627df1855
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/gp_hash_table_map_/insert_no_store_hash_fn_imps.hpp
@@ -0,0 +1,140 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file insert_no_store_hash_fn_imps.hpp
+ * Contains implementations of gp_ht_map_'s insert related functions, when the hash
+ *    value is not stored.
+ */
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::size_type
+PB_DS_CLASS_C_DEC::
+find_ins_pos(const_key_reference r_key, store_hash_false_type)
+{
+  size_type hash = ranged_probe_fn_base::operator()(r_key);
+
+  size_type i;
+
+  /* The insertion position is initted to a non-legal value to indicate
+   *     that it has not been initted yet.
+   */
+  size_type ins_pos = m_num_e;
+
+  resize_base::notify_insert_search_start();
+
+  for (i = 0; i < m_num_e; ++i)
+    {
+      const size_type pos =
+	ranged_probe_fn_base::operator()(r_key, hash, i);
+
+      PB_DS_DBG_ASSERT(pos < m_num_e);
+
+      entry* const p_e = m_a_entries + pos;
+
+      switch(p_e->m_stat)
+        {
+        case empty_entry_status:
+	  {
+            resize_base::notify_insert_search_end();
+
+            PB_DS_DBG_ONLY(
+			   map_debug_base::check_key_does_not_exist(r_key);)
+
+	      return ((ins_pos == m_num_e)? pos : ins_pos);
+	  }
+	  break;
+        case erased_entry_status:
+	  if (ins_pos == m_num_e)
+	    ins_pos = pos;
+	  break;
+        case valid_entry_status:
+	  if (hash_eq_fn_base::operator()(
+					  PB_DS_V2F(p_e->m_value), r_key))
+            {
+	      resize_base::notify_insert_search_end();
+
+	      PB_DS_DBG_ONLY(map_debug_base::check_key_exists(r_key);)
+
+                return (pos);
+            }
+	  break;
+        default:
+	  PB_DS_DBG_ASSERT(0);
+        };
+
+      resize_base::notify_insert_search_collision();
+    }
+
+  resize_base::notify_insert_search_end();
+
+  if (ins_pos == m_num_e)
+    throw insert_error();
+
+  return (ins_pos);
+}
+
+PB_DS_CLASS_T_DEC
+inline std::pair<typename PB_DS_CLASS_C_DEC::point_iterator, bool>
+PB_DS_CLASS_C_DEC::
+insert_imp(const_reference r_val, store_hash_false_type)
+{
+  const_key_reference r_key = PB_DS_V2F(r_val);
+
+  const size_type pos =
+    find_ins_pos(r_key, traits_base::m_store_extra_indicator);
+
+  if (m_a_entries[pos].m_stat == valid_entry_status)
+    {
+      PB_DS_DBG_ONLY(map_debug_base::check_key_exists(r_key);)
+
+        return (std::make_pair(
+			       & (m_a_entries + pos)->m_value,
+			       false));
+    }
+
+  PB_DS_DBG_ONLY(map_debug_base::check_key_does_not_exist(r_key));
+
+  return (std::make_pair(
+			 insert_new_imp(r_val, pos),
+			 true));
+}
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/gp_hash_table_map_/insert_store_hash_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/gp_hash_table_map_/insert_store_hash_fn_imps.hpp
new file mode 100644
index 00000000000..ff11ce3db9c
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/gp_hash_table_map_/insert_store_hash_fn_imps.hpp
@@ -0,0 +1,147 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file insert_store_hash_fn_imps.hpp
+ * Contains implementations of gp_ht_map_'s find related functions, when the hash
+ *    value is stored.
+ */
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::comp_hash
+PB_DS_CLASS_C_DEC::
+find_ins_pos(const_key_reference r_key, store_hash_true_type)
+{
+  PB_DS_DBG_ONLY(PB_DS_CLASS_C_DEC::assert_valid();)
+
+    comp_hash pos_hash_pair = ranged_probe_fn_base::operator()(r_key);
+
+  size_type i;
+
+  /* The insertion position is initted to a non-legal value to indicate
+   *     that it has not been initted yet.
+   */
+  size_type ins_pos = m_num_e;
+
+  resize_base::notify_insert_search_start();
+
+  for (i = 0; i < m_num_e; ++i)
+    {
+      const size_type pos =
+	ranged_probe_fn_base::operator()(r_key, pos_hash_pair.second, i);
+
+      entry* const p_e = m_a_entries + pos;
+
+      switch(p_e->m_stat)
+        {
+        case empty_entry_status:
+	  {
+            resize_base::notify_insert_search_end();
+
+            PB_DS_DBG_ONLY(
+			   map_debug_base::check_key_does_not_exist(r_key);)
+
+	      return ((ins_pos == m_num_e)?
+		      std::make_pair(pos, pos_hash_pair.second) :
+		      std::make_pair(ins_pos, pos_hash_pair.second));
+	  }
+	  break;
+        case erased_entry_status:
+	  if (ins_pos == m_num_e)
+	    ins_pos = pos;
+	  break;
+        case valid_entry_status:
+	  if (hash_eq_fn_base::operator()(
+					  PB_DS_V2F(p_e->m_value),
+					  p_e->m_hash,
+					  r_key,
+					  pos_hash_pair.second))
+            {
+	      resize_base::notify_insert_search_end();
+
+	      PB_DS_DBG_ONLY(map_debug_base::check_key_exists(r_key);)
+
+                return (std::make_pair(pos, pos_hash_pair.second));
+            }
+	  break;
+        default:
+	  PB_DS_DBG_ASSERT(0);
+        };
+
+      resize_base::notify_insert_search_collision();
+    }
+
+  resize_base::notify_insert_search_end();
+
+  if (ins_pos == m_num_e)
+    throw insert_error();
+
+  return (std::make_pair(ins_pos, pos_hash_pair.second));
+}
+
+PB_DS_CLASS_T_DEC
+inline std::pair<typename PB_DS_CLASS_C_DEC::point_iterator, bool>
+PB_DS_CLASS_C_DEC::
+insert_imp(const_reference r_val, store_hash_true_type)
+{
+  const_key_reference r_key = PB_DS_V2F(r_val);
+
+  comp_hash pos_hash_pair =
+    find_ins_pos(r_key, traits_base::m_store_extra_indicator);
+
+  PB_DS_DBG_ASSERT(pos_hash_pair.first < m_num_e);
+
+  entry_pointer p_e =& m_a_entries[pos_hash_pair.first];
+
+  if (p_e->m_stat == valid_entry_status)
+    {
+      PB_DS_DBG_ONLY(map_debug_base::check_key_exists(r_key));
+
+      return (std::make_pair(&p_e->m_value, false));
+    }
+
+  PB_DS_DBG_ONLY(map_debug_base::check_key_does_not_exist(r_key));
+
+  return (std::make_pair(
+			 insert_new_imp(r_val, pos_hash_pair),
+			 true));
+}
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/gp_hash_table_map_/iterator_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/gp_hash_table_map_/iterator_fn_imps.hpp
new file mode 100644
index 00000000000..a73109cc6e1
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/gp_hash_table_map_/iterator_fn_imps.hpp
@@ -0,0 +1,97 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file iterator_fn_imps.hpp
+ * Contains implementations of gp_ht_map_'s iterators related functions, e.g.,
+ *    begin().
+ */
+
+PB_DS_CLASS_T_DEC
+typename PB_DS_CLASS_C_DEC::iterator
+PB_DS_CLASS_C_DEC::s_end_it;
+
+PB_DS_CLASS_T_DEC
+typename PB_DS_CLASS_C_DEC::const_iterator
+PB_DS_CLASS_C_DEC::s_const_end_it;
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::iterator
+PB_DS_CLASS_C_DEC::
+begin()
+{
+  pointer_ p_value;
+  size_type pos;
+
+  get_start_it_state(p_value, pos);
+
+  return (iterator(p_value, pos, this));
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::iterator
+PB_DS_CLASS_C_DEC::
+end()
+{
+  return (s_end_it);
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::const_iterator
+PB_DS_CLASS_C_DEC::
+begin() const
+{
+  const_pointer_ p_value;
+  size_type pos;
+
+  get_start_it_state(p_value, pos);
+
+  return (const_iterator(        p_value, pos, this));
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::const_iterator
+PB_DS_CLASS_C_DEC::
+end() const
+{
+  return (s_const_end_it);
+}
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/gp_hash_table_map_/policy_access_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/gp_hash_table_map_/policy_access_fn_imps.hpp
new file mode 100644
index 00000000000..593c8fd233b
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/gp_hash_table_map_/policy_access_fn_imps.hpp
@@ -0,0 +1,126 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file policy_access_fn_imps.hpp
+ * Contains implementations of gp_ht_map_'s policy agpess
+ *    functions.
+ */
+
+PB_DS_CLASS_T_DEC
+Hash_Fn& 
+PB_DS_CLASS_C_DEC::
+get_hash_fn()
+{
+  return (*this);
+}
+
+PB_DS_CLASS_T_DEC
+const Hash_Fn& 
+PB_DS_CLASS_C_DEC::
+get_hash_fn() const
+{
+  return (*this);
+}
+
+PB_DS_CLASS_T_DEC
+Eq_Fn& 
+PB_DS_CLASS_C_DEC::
+get_eq_fn()
+{
+  return (*this);
+}
+
+PB_DS_CLASS_T_DEC
+const Eq_Fn& 
+PB_DS_CLASS_C_DEC::
+get_eq_fn() const
+{
+  return (*this);
+}
+
+PB_DS_CLASS_T_DEC
+Probe_Fn& 
+PB_DS_CLASS_C_DEC::
+get_probe_fn()
+{
+  return (*this);
+}
+
+PB_DS_CLASS_T_DEC
+const Probe_Fn& 
+PB_DS_CLASS_C_DEC::
+get_probe_fn() const
+{
+  return (*this);
+}
+
+PB_DS_CLASS_T_DEC
+Comb_Probe_Fn& 
+PB_DS_CLASS_C_DEC::
+get_comb_probe_fn()
+{
+  return (*this);
+}
+
+PB_DS_CLASS_T_DEC
+const Comb_Probe_Fn& 
+PB_DS_CLASS_C_DEC::
+get_comb_probe_fn() const
+{
+  return (*this);
+}
+
+PB_DS_CLASS_T_DEC
+Resize_Policy& 
+PB_DS_CLASS_C_DEC::
+get_resize_policy()
+{
+  return (*this);
+}
+
+PB_DS_CLASS_T_DEC
+const Resize_Policy& 
+PB_DS_CLASS_C_DEC::
+get_resize_policy() const
+{
+  return (*this);
+}
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/gp_hash_table_map_/resize_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/gp_hash_table_map_/resize_fn_imps.hpp
new file mode 100644
index 00000000000..842169c08d3
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/gp_hash_table_map_/resize_fn_imps.hpp
@@ -0,0 +1,160 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file resize_fn_imps.hpp
+ * Contains implementations of gp_ht_map_'s resize related functions.
+ */
+
+PB_DS_CLASS_T_DEC
+inline bool
+PB_DS_CLASS_C_DEC::
+do_resize_if_needed()
+{
+  if (!resize_base::is_resize_needed())
+    return (false);
+
+  resize_imp(resize_base::get_new_size(        m_num_e, m_num_used_e));
+
+  return (true);
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+do_resize(size_type size)
+{
+  resize_imp(resize_base::get_nearest_larger_size(
+						  size));
+}
+
+PB_DS_CLASS_T_DEC
+inline void
+PB_DS_CLASS_C_DEC::
+do_resize_if_needed_no_throw()
+{
+  if (!resize_base::is_resize_needed())
+    return;
+
+  try
+    {
+      resize_imp(resize_base::get_new_size(            m_num_e, m_num_used_e));
+    }
+  catch(...)
+    { }
+
+  PB_DS_DBG_ONLY(assert_valid();)
+    }
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+resize_imp(size_type new_size)
+{
+#ifdef PB_DS_REGRESSION
+  typename Allocator::group_throw_prob_adjustor adjust(m_num_e);
+#endif // #ifdef PB_DS_REGRESSION
+
+  if (new_size == m_num_e)
+    return;
+
+  PB_DS_DBG_ONLY(assert_valid();)
+
+    const size_type old_size = m_num_e;
+
+  entry_array a_entries_resized = NULL;
+
+  // Following line might throw an exception.
+
+  a_entries_resized = s_entry_allocator.allocate(new_size);
+
+  ranged_probe_fn_base::notify_resized(new_size);
+
+  m_num_e = new_size;
+
+  for (size_type i = 0; i < m_num_e; ++i)
+    a_entries_resized[i].m_stat = empty_entry_status;
+
+  try
+    {
+      resize_imp(a_entries_resized, old_size);
+    }
+  catch(...)
+    {
+      erase_all_valid_entries(a_entries_resized, new_size);
+
+      m_num_e = old_size;
+
+      s_entry_allocator.deallocate(a_entries_resized, new_size);
+
+      ranged_probe_fn_base::notify_resized(old_size);
+
+      throw;
+    }
+
+  // At this point no exceptions can be thrown.
+
+  PB_DS_DBG_ONLY(assert_entry_array_valid(a_entries_resized, traits_base::m_store_extra_indicator);)
+
+    Resize_Policy::notify_resized(new_size);
+
+  erase_all_valid_entries(m_a_entries, old_size);
+
+  s_entry_allocator.deallocate(m_a_entries, old_size);
+
+  m_a_entries = a_entries_resized;
+
+  PB_DS_DBG_ONLY(assert_valid();)
+    }
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+resize_imp(entry_array a_entries_resized, size_type old_size)
+{
+  for (size_type pos = 0; pos < old_size; ++pos)
+    if (m_a_entries[pos].m_stat == valid_entry_status)
+      resize_imp_reassign(m_a_entries + pos,  a_entries_resized,  traits_base::m_store_extra_indicator);
+}
+
+#include <ext/pb_ds/detail/gp_hash_table_map_/resize_no_store_hash_fn_imps.hpp>
+#include <ext/pb_ds/detail/gp_hash_table_map_/resize_store_hash_fn_imps.hpp>
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/gp_hash_table_map_/resize_no_store_hash_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/gp_hash_table_map_/resize_no_store_hash_fn_imps.hpp
new file mode 100644
index 00000000000..1430d7171b1
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/gp_hash_table_map_/resize_no_store_hash_fn_imps.hpp
@@ -0,0 +1,87 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file resize_no_store_hash_fn_imps.hpp
+ * Contains implementations of gp_ht_map_'s resize related functions, when the
+ *    hash value is not stored.
+ */
+
+PB_DS_CLASS_T_DEC
+inline void
+PB_DS_CLASS_C_DEC::
+resize_imp_reassign(entry_pointer p_e, entry_array a_entries_resized, store_hash_false_type)
+{
+  const_key_reference r_key = PB_DS_V2F(p_e->m_value);
+
+  size_type hash = ranged_probe_fn_base::operator()(r_key);
+
+  size_type i;
+
+  for (i = 0; i < m_num_e; ++i)
+    {
+      const size_type pos =
+	ranged_probe_fn_base::operator()(r_key, hash, i);
+
+      entry_pointer p_new_e = a_entries_resized + pos;
+
+      switch(p_new_e->m_stat)
+        {
+        case empty_entry_status:
+
+	  new (&p_new_e->m_value) value_type(p_e->m_value);
+
+	  p_new_e->m_stat = valid_entry_status;
+
+	  return;
+        case erased_entry_status:
+	  PB_DS_DBG_ASSERT(0);
+	  break;
+        case valid_entry_status:
+	  break;
+        default:
+	  PB_DS_DBG_ASSERT(0);
+        };
+    }
+
+  throw insert_error();
+}
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/gp_hash_table_map_/resize_store_hash_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/gp_hash_table_map_/resize_store_hash_fn_imps.hpp
new file mode 100644
index 00000000000..4ab893023d9
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/gp_hash_table_map_/resize_store_hash_fn_imps.hpp
@@ -0,0 +1,90 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file resize_store_hash_fn_imps.hpp
+ * Contains implementations of gp_ht_map_'s resize related functions, when the
+ *    hash value is stored.
+ */
+
+PB_DS_CLASS_T_DEC
+inline void
+PB_DS_CLASS_C_DEC::
+resize_imp_reassign(entry_pointer p_e, entry_array a_entries_resized, store_hash_true_type)
+{
+  const_key_reference r_key = PB_DS_V2F(p_e->m_value);
+
+  size_type hash =
+    ranged_probe_fn_base::operator()(r_key, p_e->m_hash);
+
+  size_type i;
+
+  for (i = 0; i < m_num_e; ++i)
+    {
+      const size_type pos =
+	ranged_probe_fn_base::operator()(r_key, hash, i);
+
+      entry_pointer p_new_e = a_entries_resized + pos;
+
+      switch(p_new_e->m_stat)
+        {
+        case empty_entry_status:
+
+	  new (&p_new_e->m_value) value_type(p_e->m_value);
+
+	  p_new_e->m_hash = hash;
+
+	  p_new_e->m_stat = valid_entry_status;
+
+	  return;
+        case erased_entry_status:
+	  PB_DS_DBG_ASSERT(0);
+	  break;
+        case valid_entry_status:
+	  break;
+        default:
+	  PB_DS_DBG_ASSERT(0);
+        };
+    }
+
+  throw insert_error();
+}
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/gp_hash_table_map_/standard_policies.hpp b/libstdc++-v3/include/ext/pb_ds/detail/gp_hash_table_map_/standard_policies.hpp
new file mode 100644
index 00000000000..82c5ca0c78c
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/gp_hash_table_map_/standard_policies.hpp
@@ -0,0 +1,85 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file standard_policies.hpp
+ * Contains standard policies for gp_ht_map types.
+ */
+
+#ifndef PB_DS_GP_HT_MAP_STANDARD_POLICIES_HPP
+#define PB_DS_GP_HT_MAP_STANDARD_POLICIES_HPP
+
+#include <ext/pb_ds/detail/standard_policies.hpp>
+#include <ext/pb_ds/ht_load_check_resize_trigger.hpp>
+#include <ext/pb_ds/linear_probe_fn.hpp>
+#include <ext/pb_ds/quadratic_probe_fn.hpp>
+
+namespace pb_ds
+{
+
+  namespace detail
+  {
+
+    template<typename Comb_Probe_Fn>
+    struct default_probe_fn
+    {
+    private:
+      typedef typename Comb_Probe_Fn::size_type size_type;
+
+    public:
+      typedef
+      typename conditional_type<
+      is_same<
+      pb_ds::direct_mask_range_hashing<size_t>,
+      Comb_Probe_Fn>::value,
+      pb_ds::linear_probe_fn<
+      size_type>,
+      pb_ds::quadratic_probe_fn<
+      size_type> >::type
+      type;
+    };
+
+  } // namespace detail
+
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_GP_HT_MAP_STANDARD_POLICIES_HPP
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/gp_hash_table_map_/trace_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/gp_hash_table_map_/trace_fn_imps.hpp
new file mode 100644
index 00000000000..4973c5bd31e
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/gp_hash_table_map_/trace_fn_imps.hpp
@@ -0,0 +1,80 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file trace_fn_imps.hpp
+ * Contains implementations of gp_ht_map_'s trace-mode functions.
+ */
+
+#ifdef PB_DS_HT_MAP_TRACE_
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+trace() const
+{
+  std::cerr << static_cast<unsigned long>(m_num_e) << " " <<
+    static_cast<unsigned long>(m_num_used_e) << std::endl;
+
+  for (size_type i = 0; i < m_num_e; ++i)
+    {
+      std::cerr << static_cast<unsigned long>(i) << " ";
+
+      switch(m_a_entries[i].m_stat)
+        {
+	case empty_entry_status:
+	  std::cerr << "<empty>";
+	  break;
+	case erased_entry_status:
+	  std::cerr << "<erased>";
+	  break;
+	case valid_entry_status:
+	  std::cerr << PB_DS_V2F(m_a_entries[i].m_value);
+	  break;
+	default:
+	  PB_DS_DBG_ASSERT(0);
+	};
+
+      std::cerr << std::endl;
+    }
+}
+
+#endif // #ifdef PB_DS_HT_MAP_TRACE_
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/hash_fn/direct_mask_range_hashing_imp.hpp b/libstdc++-v3/include/ext/pb_ds/detail/hash_fn/direct_mask_range_hashing_imp.hpp
new file mode 100644
index 00000000000..c12901c8641
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/hash_fn/direct_mask_range_hashing_imp.hpp
@@ -0,0 +1,70 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file direct_mask_range_hashing_imp.hpp
+ * Contains a range-hashing policy implementation
+ */
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+swap(PB_DS_CLASS_C_DEC& other)
+{
+  mask_based_base::swap(other);
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+notify_resized(size_type size)
+{
+  mask_based_base::notify_resized(size);
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::size_type
+PB_DS_CLASS_C_DEC::
+operator()(size_type hash) const
+{
+  return (mask_based_base::range_hash(hash));
+}
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/hash_fn/direct_mod_range_hashing_imp.hpp b/libstdc++-v3/include/ext/pb_ds/detail/hash_fn/direct_mod_range_hashing_imp.hpp
new file mode 100644
index 00000000000..e6f2fe9bec1
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/hash_fn/direct_mod_range_hashing_imp.hpp
@@ -0,0 +1,70 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file direct_mod_range_hashing_imp.hpp
+ * Contains a range-hashing policy implementation
+ */
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+swap(PB_DS_CLASS_C_DEC& other)
+{
+  mod_based_base::swap(other);
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+notify_resized(size_type size)
+{
+  mod_based_base::notify_resized(size);
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::size_type
+PB_DS_CLASS_C_DEC::
+operator()(size_type hash) const
+{
+  return (mod_based_base::range_hash(hash));
+}
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/hash_fn/linear_probe_fn_imp.hpp b/libstdc++-v3/include/ext/pb_ds/detail/hash_fn/linear_probe_fn_imp.hpp
new file mode 100644
index 00000000000..c1e196c71c9
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/hash_fn/linear_probe_fn_imp.hpp
@@ -0,0 +1,59 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file linear_probe_fn_imp.hpp
+ * Contains a probe policy implementation
+ */
+
+PB_DS_CLASS_T_DEC
+inline void
+PB_DS_CLASS_C_DEC::
+swap(PB_DS_CLASS_C_DEC& other)
+{ }
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::size_type
+PB_DS_CLASS_C_DEC::
+operator()(size_type i) const
+{
+  return (i);
+}
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/hash_fn/mask_based_range_hashing.hpp b/libstdc++-v3/include/ext/pb_ds/detail/hash_fn/mask_based_range_hashing.hpp
new file mode 100644
index 00000000000..68d0c2b973b
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/hash_fn/mask_based_range_hashing.hpp
@@ -0,0 +1,141 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file mask_based_range_hashing.hpp
+ * Contains a range hashing policy base.
+ */
+
+#ifndef PB_DS_MASK_BASED_RANGE_HASHING_HPP
+#define PB_DS_MASK_BASED_RANGE_HASHING_HPP
+
+namespace pb_ds
+{
+
+  namespace detail
+  {
+
+#define PB_DS_CLASS_T_DEC			\
+    template<typename Size_Type>
+
+#define PB_DS_CLASS_C_DEC					\
+    mask_based_range_hashing<					\
+						Size_Type>
+
+    template<typename Size_Type>
+    class mask_based_range_hashing
+    {
+    protected:
+      typedef Size_Type size_type;
+
+    protected:
+      void
+      swap(PB_DS_CLASS_C_DEC& other);
+
+      void
+      notify_resized(size_type size);
+
+      inline size_type
+      range_hash(size_type hash) const;
+
+    private:
+      size_type m_mask;
+
+      const static size_type s_num_bits_in_size_type;
+
+      const static size_type s_highest_bit_1;
+    };
+
+    PB_DS_CLASS_T_DEC
+    const typename PB_DS_CLASS_C_DEC::size_type
+    PB_DS_CLASS_C_DEC::s_num_bits_in_size_type =
+      sizeof(typename PB_DS_CLASS_C_DEC::size_type) << 3;
+
+    PB_DS_CLASS_T_DEC
+    const typename PB_DS_CLASS_C_DEC::size_type PB_DS_CLASS_C_DEC::s_highest_bit_1 =
+						       static_cast<typename PB_DS_CLASS_C_DEC::size_type>(1) << (s_num_bits_in_size_type - 1);
+
+    PB_DS_CLASS_T_DEC
+    void
+    PB_DS_CLASS_C_DEC::
+    swap(PB_DS_CLASS_C_DEC& other)
+    {
+      std::swap(m_mask, other.m_mask);
+    }
+
+    PB_DS_CLASS_T_DEC
+    void
+    PB_DS_CLASS_C_DEC::
+    notify_resized(size_type size)
+    {
+      size_type i = 0;
+
+      while (size ^ s_highest_bit_1)
+	{
+	  size <<= 1;
+
+	  ++i;
+	}
+
+      m_mask = 1;
+
+      i += 2;
+
+      while (i++ < s_num_bits_in_size_type)
+        m_mask = (m_mask << 1) ^ 1;
+    }
+
+    PB_DS_CLASS_T_DEC
+    inline typename PB_DS_CLASS_C_DEC::size_type
+    PB_DS_CLASS_C_DEC::
+    range_hash(size_type hash) const
+    {
+      return (hash&  m_mask);
+    }
+
+#undef PB_DS_CLASS_T_DEC
+#undef PB_DS_CLASS_C_DEC
+
+  } // namespace detail
+
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_MASK_BASED_RANGE_HASHING_HPP
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/hash_fn/mod_based_range_hashing.hpp b/libstdc++-v3/include/ext/pb_ds/detail/hash_fn/mod_based_range_hashing.hpp
new file mode 100644
index 00000000000..2d5e8d6ef55
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/hash_fn/mod_based_range_hashing.hpp
@@ -0,0 +1,114 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file mod_based_range_hashing.hpp
+ * Contains a range hashing policy base.
+ */
+
+#ifndef PB_DS_MOD_BASED_RANGE_HASHING_HPP
+#define PB_DS_MOD_BASED_RANGE_HASHING_HPP
+
+namespace pb_ds
+{
+
+  namespace detail
+  {
+
+#define PB_DS_CLASS_T_DEC			\
+    template<typename Size_Type>
+
+#define PB_DS_CLASS_C_DEC					\
+    mod_based_range_hashing<					\
+						Size_Type>
+
+    template<typename Size_Type>
+    class mod_based_range_hashing
+    {
+    protected:
+      typedef Size_Type size_type;
+
+    protected:
+      void
+      swap(PB_DS_CLASS_C_DEC& other);
+
+      void
+      notify_resized(size_type size);
+
+      inline size_type
+      range_hash(size_type hash) const;
+
+    private:
+      size_type m_size;
+    };
+
+    PB_DS_CLASS_T_DEC
+    void
+    PB_DS_CLASS_C_DEC::
+    swap(PB_DS_CLASS_C_DEC& other)
+    {
+      std::swap(m_size, other.m_size);
+    }
+
+    PB_DS_CLASS_T_DEC
+    void
+    PB_DS_CLASS_C_DEC::
+    notify_resized(size_type size)
+    {
+      m_size = size;
+    }
+
+    PB_DS_CLASS_T_DEC
+    inline typename PB_DS_CLASS_C_DEC::size_type
+    PB_DS_CLASS_C_DEC::
+    range_hash(size_type hash) const
+    {
+      return (hash % m_size);
+    }
+
+#undef PB_DS_CLASS_T_DEC
+#undef PB_DS_CLASS_C_DEC
+
+  } // namespace detail
+
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_MOD_BASED_RANGE_HASHING_HPP
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/hash_fn/probe_fn_base.hpp b/libstdc++-v3/include/ext/pb_ds/detail/hash_fn/probe_fn_base.hpp
new file mode 100644
index 00000000000..bd07117b11c
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/hash_fn/probe_fn_base.hpp
@@ -0,0 +1,98 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file probe_fn_base.hpp
+ * Contains a probe policy base.
+ */
+
+#ifndef PB_DS_PROBE_FN_BASE_HPP
+#define PB_DS_PROBE_FN_BASE_HPP
+
+#include <functional>
+
+namespace pb_ds
+{
+
+  namespace detail
+  {
+
+#ifdef PROBE_FN_BASE_DEBUG
+#define PB_DS_DBG_ASSERT(X) assert(X)
+#define PB_DS_DBG_VERIFY(X) assert(X)
+#define PB_DS_DBG_ONLY(X) X
+#else // #ifdef PROBE_FN_BASE_DEBUG
+#define PB_DS_DBG_ASSERT(X)
+#define PB_DS_DBG_VERIFY(X) {if((X)==0);}
+#define PB_DS_DBG_ONLY(X) ;
+#endif // #ifdef PROBE_FN_BASE_DEBUG
+
+#define PB_DS_CLASS_T_DEC			\
+    template<typename Allocator>
+
+#define PB_DS_CLASS_C_DEC					\
+    probe_fn_base<						\
+						Allocator>
+
+    template<typename Allocator>
+    class probe_fn_base
+    {
+    protected:
+      ~probe_fn_base();
+    };
+
+    PB_DS_CLASS_T_DEC
+    PB_DS_CLASS_C_DEC::
+    ~probe_fn_base()
+    { }
+
+#undef PB_DS_CLASS_T_DEC
+#undef PB_DS_CLASS_C_DEC
+
+#undef PB_DS_DBG_ASSERT
+#undef PB_DS_DBG_VERIFY
+#undef PB_DS_DBG_ONLY
+
+  } // namespace detail
+
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_PROBE_FN_BASE_HPP
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/hash_fn/quadratic_probe_fn_imp.hpp b/libstdc++-v3/include/ext/pb_ds/detail/hash_fn/quadratic_probe_fn_imp.hpp
new file mode 100644
index 00000000000..044b18ba61d
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/hash_fn/quadratic_probe_fn_imp.hpp
@@ -0,0 +1,59 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file quadratic_probe_fn_imp.hpp
+ * Contains a probe policy implementation
+ */
+
+PB_DS_CLASS_T_DEC
+inline void
+PB_DS_CLASS_C_DEC::
+swap(PB_DS_CLASS_C_DEC& other)
+{ }
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::size_type
+PB_DS_CLASS_C_DEC::
+operator()(size_type i) const
+{
+  return (i*  i);
+}
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/hash_fn/ranged_hash_fn.hpp b/libstdc++-v3/include/ext/pb_ds/detail/hash_fn/ranged_hash_fn.hpp
new file mode 100644
index 00000000000..f31d3c8303a
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/hash_fn/ranged_hash_fn.hpp
@@ -0,0 +1,478 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file ranged_hash_fn.hpp
+ * Contains a unified ranged hash functor, allowing the hash tables to deal with
+ *    a single class for ranged hashing.
+ */
+
+#ifndef PB_DS_RANGED_HASH_FN_HPP
+#define PB_DS_RANGED_HASH_FN_HPP
+
+#include <ext/pb_ds/detail/basic_types.hpp>
+#include <utility>
+
+namespace pb_ds
+{
+  namespace detail
+  {
+
+#ifdef PB_DS_RANGED_HASH_FN_DEBUG
+#define PB_DS_DBG_ASSERT(X) assert(X)
+#define PB_DS_DBG_VERIFY(X) assert(X)
+#define PB_DS_DBG_ONLY(X) X
+#else // #ifdef PB_DS_RANGED_HASH_FN_DEBUG
+#define PB_DS_DBG_ASSERT(X)
+#define PB_DS_DBG_VERIFY(X) {if((X)==0);}
+#define PB_DS_DBG_ONLY(X) ;
+#endif // #ifdef PB_DS_RANGED_HASH_FN_DEBUG
+
+    template<typename Key,
+	     class Hash_Fn,
+	     class Allocator,
+	     class Comb_Hash_Fn,
+	     bool Store_Hash>
+    class ranged_hash_fn;
+
+#define PB_DS_CLASS_T_DEC						\
+    template<								\
+						typename Key,		\
+						class Hash_Fn,		\
+						class Allocator,	\
+						class Comb_Hash_Fn>
+
+#define PB_DS_CLASS_C_DEC					\
+    ranged_hash_fn<						\
+						Key,		\
+						Hash_Fn,	\
+						Allocator,	\
+						Comb_Hash_Fn,	\
+						false>
+
+    /**
+     * Specialization 1- The client supplies a hash function and a ranged
+     *    hash function, and requests that hash values not be stored.
+     **/
+    template<typename Key,
+	     class Hash_Fn,
+	     class Allocator,
+	     class Comb_Hash_Fn>
+    class ranged_hash_fn<
+      Key,
+      Hash_Fn,
+      Allocator,
+      Comb_Hash_Fn,
+      false> : public Hash_Fn,
+	       public Comb_Hash_Fn
+    {
+    protected:
+      typedef typename Allocator::size_type size_type;
+
+      typedef Hash_Fn hash_fn_base;
+
+      typedef Comb_Hash_Fn comb_hash_fn_base;
+
+      typedef typename Allocator::template rebind< Key>::other key_allocator;
+
+      typedef typename key_allocator::const_reference const_key_reference;
+
+    protected:
+      ranged_hash_fn(size_type size);
+
+      ranged_hash_fn(size_type size, const Hash_Fn& r_hash_fn);
+
+      ranged_hash_fn(size_type size, const Hash_Fn& r_hash_fn, const Comb_Hash_Fn& r_comb_hash_fn);
+
+      void
+      swap(PB_DS_CLASS_C_DEC& other);
+
+      void
+      notify_resized(size_type size);
+
+      inline size_type
+      operator()(const_key_reference r_key) const;
+    };
+
+    PB_DS_CLASS_T_DEC
+    PB_DS_CLASS_C_DEC::
+    ranged_hash_fn(size_type size)
+    {
+      Comb_Hash_Fn::notify_resized(size);
+    }
+
+    PB_DS_CLASS_T_DEC
+    PB_DS_CLASS_C_DEC::
+    ranged_hash_fn(size_type size, const Hash_Fn& r_hash_fn) :
+      Hash_Fn(r_hash_fn)
+    {
+      Comb_Hash_Fn::notify_resized(size);
+    }
+
+    PB_DS_CLASS_T_DEC
+    PB_DS_CLASS_C_DEC::
+    ranged_hash_fn(size_type size, const Hash_Fn& r_hash_fn, const Comb_Hash_Fn& r_comb_hash_fn) :
+      Hash_Fn(r_hash_fn),
+      Comb_Hash_Fn(r_comb_hash_fn)
+    {
+      comb_hash_fn_base::notify_resized(size);
+    }
+
+    PB_DS_CLASS_T_DEC
+    void
+    PB_DS_CLASS_C_DEC::
+    swap(PB_DS_CLASS_C_DEC& other)
+    {
+      comb_hash_fn_base::swap(other);
+
+      std::swap((Hash_Fn& )(*this), (Hash_Fn& )other);
+    }
+
+    PB_DS_CLASS_T_DEC
+    void
+    PB_DS_CLASS_C_DEC::
+    notify_resized(size_type size)
+    {
+      comb_hash_fn_base::notify_resized(size);
+    }
+
+    PB_DS_CLASS_T_DEC
+    inline typename PB_DS_CLASS_C_DEC::size_type
+    PB_DS_CLASS_C_DEC::
+    operator()(const_key_reference r_key) const
+    {
+      return (comb_hash_fn_base::operator()(
+					    hash_fn_base::operator()(r_key)));
+    }
+
+#undef PB_DS_CLASS_T_DEC
+#undef PB_DS_CLASS_C_DEC
+
+#define PB_DS_CLASS_T_DEC						\
+    template<								\
+						typename Key,		\
+						class Hash_Fn,		\
+						class Allocator,	\
+						class Comb_Hash_Fn>
+
+#define PB_DS_CLASS_C_DEC					\
+    ranged_hash_fn<						\
+						Key,		\
+						Hash_Fn,	\
+						Allocator,	\
+						Comb_Hash_Fn,	\
+						true>
+
+    /**
+     * Specialization 2- The client supplies a hash function and a ranged
+     *    hash function, and requests that hash values be stored.
+     **/
+    template<typename Key,
+	     class Hash_Fn,
+	     class Allocator,
+	     class Comb_Hash_Fn>
+    class ranged_hash_fn<
+      Key,
+      Hash_Fn,
+      Allocator,
+      Comb_Hash_Fn,
+      true> :
+      public Hash_Fn,
+      public Comb_Hash_Fn
+    {
+    protected:
+      typedef typename Allocator::size_type size_type;
+
+      typedef typename comp_hash_< size_type>::comp_hash comp_hash;
+
+      typedef Hash_Fn hash_fn_base;
+
+      typedef Comb_Hash_Fn comb_hash_fn_base;
+
+      typedef typename Allocator::template rebind< Key>::other key_allocator;
+
+      typedef typename key_allocator::const_reference const_key_reference;
+
+    protected:
+      ranged_hash_fn(size_type size);
+
+      ranged_hash_fn(size_type size, const Hash_Fn& r_hash_fn);
+
+      ranged_hash_fn(size_type size, const Hash_Fn& r_hash_fn, const Comb_Hash_Fn& r_comb_hash_fn);
+
+      void
+      swap(PB_DS_CLASS_C_DEC& other);
+
+      void
+      notify_resized(size_type size);
+
+      inline comp_hash
+      operator()(const_key_reference r_key) const;
+
+      inline comp_hash
+      operator()(const_key_reference r_key, size_type hash) const;
+    };
+
+    PB_DS_CLASS_T_DEC
+    PB_DS_CLASS_C_DEC::
+    ranged_hash_fn(size_type size)
+    {
+      Comb_Hash_Fn::notify_resized(size);
+    }
+
+    PB_DS_CLASS_T_DEC
+    PB_DS_CLASS_C_DEC::
+    ranged_hash_fn(size_type size, const Hash_Fn& r_hash_fn) :
+      Hash_Fn(r_hash_fn)
+    {
+      Comb_Hash_Fn::notify_resized(size);
+    }
+
+    PB_DS_CLASS_T_DEC
+    PB_DS_CLASS_C_DEC::
+    ranged_hash_fn(size_type size, const Hash_Fn& r_hash_fn, const Comb_Hash_Fn& r_comb_hash_fn) :
+      Hash_Fn(r_hash_fn),
+      Comb_Hash_Fn(r_comb_hash_fn)
+    {
+      comb_hash_fn_base::notify_resized(size);
+    }
+
+    PB_DS_CLASS_T_DEC
+    void
+    PB_DS_CLASS_C_DEC::
+    swap(PB_DS_CLASS_C_DEC& other)
+    {
+      comb_hash_fn_base::swap(other);
+
+      std::swap((Hash_Fn& )(*this), (Hash_Fn& )other);
+    }
+
+    PB_DS_CLASS_T_DEC
+    void
+    PB_DS_CLASS_C_DEC::
+    notify_resized(size_type size)
+    {
+      comb_hash_fn_base::notify_resized(size);
+    }
+
+    PB_DS_CLASS_T_DEC
+    inline typename PB_DS_CLASS_C_DEC::comp_hash
+    PB_DS_CLASS_C_DEC::
+    operator()(const_key_reference r_key) const
+    {
+      const size_type hash = hash_fn_base::operator()(r_key);
+
+      return (std::make_pair(comb_hash_fn_base::operator()(hash), hash));
+    }
+
+    PB_DS_CLASS_T_DEC
+    inline typename PB_DS_CLASS_C_DEC::comp_hash
+    PB_DS_CLASS_C_DEC::
+    operator()
+#ifdef PB_DS_RANGED_HASH_FN_DEBUG
+      (const_key_reference r_key, size_type hash) const
+#else // #ifdef PB_DS_RANGED_HASH_FN_DEBUG
+      (const_key_reference /*r_key*/, size_type hash) const
+#endif // #ifdef PB_DS_RANGED_HASH_FN_DEBUG
+    {
+      PB_DS_DBG_ASSERT(hash == hash_fn_base::operator()(r_key));
+
+      return (std::make_pair(comb_hash_fn_base::operator()(hash), hash));
+    }
+
+#undef PB_DS_CLASS_T_DEC
+#undef PB_DS_CLASS_C_DEC
+
+#define PB_DS_CLASS_T_DEC					\
+    template<typename Key, class Allocator, class Comb_Hash_Fn>
+
+#define PB_DS_CLASS_C_DEC					\
+    ranged_hash_fn<						\
+						Key,		\
+						null_hash_fn,	\
+						Allocator,	\
+						Comb_Hash_Fn,	\
+						false>
+
+    /**
+     * Specialization 3- The client does not supply a hash function
+     *    (by specifying null_hash_fn as the Hash_Fn parameter),
+     *    and requests that hash values not be stored.
+
+    **/
+    template<typename Key, class Allocator, class Comb_Hash_Fn>
+    class ranged_hash_fn<
+      Key,
+      null_hash_fn,
+      Allocator,
+      Comb_Hash_Fn,
+      false> :
+      public null_hash_fn,
+      public Comb_Hash_Fn
+    {
+    protected:
+
+      typedef typename Allocator::size_type size_type;
+
+      typedef Comb_Hash_Fn comb_hash_fn_base;
+
+    protected:
+      ranged_hash_fn(size_type size);
+
+      ranged_hash_fn(size_type size, const Comb_Hash_Fn& r_comb_hash_fn);
+
+      ranged_hash_fn(size_type size, const null_hash_fn           & r_null_hash_fn, const Comb_Hash_Fn& r_comb_hash_fn);
+
+      void
+      swap(PB_DS_CLASS_C_DEC& other);
+    };
+
+    PB_DS_CLASS_T_DEC
+    PB_DS_CLASS_C_DEC::
+    ranged_hash_fn(size_type size)
+    {
+      Comb_Hash_Fn::notify_resized(size);
+    }
+
+    PB_DS_CLASS_T_DEC
+    PB_DS_CLASS_C_DEC::
+    ranged_hash_fn(size_type size, const Comb_Hash_Fn& r_comb_hash_fn) :
+      Comb_Hash_Fn(r_comb_hash_fn)
+    { }
+
+    PB_DS_CLASS_T_DEC
+    PB_DS_CLASS_C_DEC::
+    ranged_hash_fn(size_type size, const null_hash_fn& r_null_hash_fn, const Comb_Hash_Fn& r_comb_hash_fn) :
+      Comb_Hash_Fn(r_comb_hash_fn)
+    { }
+
+    PB_DS_CLASS_T_DEC
+    void
+    PB_DS_CLASS_C_DEC::
+    swap(PB_DS_CLASS_C_DEC& other)
+    {
+      comb_hash_fn_base::swap(other);
+    }
+
+#undef PB_DS_CLASS_T_DEC
+#undef PB_DS_CLASS_C_DEC
+
+#define PB_DS_CLASS_T_DEC					\
+    template<typename Key, class Allocator, class Comb_Hash_Fn>
+
+#define PB_DS_CLASS_C_DEC					\
+    ranged_hash_fn<						\
+						Key,		\
+						null_hash_fn,	\
+						Allocator,	\
+						Comb_Hash_Fn,	\
+						true>
+
+    /**
+     * Specialization 4- The client does not supply a hash function
+     *    (by specifying null_hash_fn as the Hash_Fn parameter),
+     *    and requests that hash values be stored.
+
+    **/
+    template<typename Key, class Allocator, class Comb_Hash_Fn>
+    class ranged_hash_fn<
+      Key,
+      null_hash_fn,
+      Allocator,
+      Comb_Hash_Fn,
+      true> :
+      public null_hash_fn,
+      public Comb_Hash_Fn
+    {
+    protected:
+      typedef typename Allocator::size_type size_type;
+
+      typedef Comb_Hash_Fn comb_hash_fn_base;
+
+    protected:
+      ranged_hash_fn(size_type size);
+
+      ranged_hash_fn(size_type size, const Comb_Hash_Fn& r_comb_hash_fn);
+
+      ranged_hash_fn(size_type size, const null_hash_fn           & r_null_hash_fn, const Comb_Hash_Fn& r_comb_hash_fn);
+
+      void
+      swap(PB_DS_CLASS_C_DEC& other);
+    };
+
+    PB_DS_CLASS_T_DEC
+    PB_DS_CLASS_C_DEC::
+    ranged_hash_fn(size_type size)
+    {
+      Comb_Hash_Fn::notify_resized(size);
+    }
+
+    PB_DS_CLASS_T_DEC
+    PB_DS_CLASS_C_DEC::
+    ranged_hash_fn(size_type size, const Comb_Hash_Fn& r_comb_hash_fn) :
+      Comb_Hash_Fn(r_comb_hash_fn)
+    { }
+
+    PB_DS_CLASS_T_DEC
+    PB_DS_CLASS_C_DEC::
+    ranged_hash_fn(size_type size, const null_hash_fn           & r_null_hash_fn, const Comb_Hash_Fn& r_comb_hash_fn) :
+      Comb_Hash_Fn(r_comb_hash_fn)
+    { }
+
+    PB_DS_CLASS_T_DEC
+    void
+    PB_DS_CLASS_C_DEC::
+    swap(PB_DS_CLASS_C_DEC& other)
+    {
+      comb_hash_fn_base::swap(other);
+    }
+
+#undef PB_DS_CLASS_T_DEC
+#undef PB_DS_CLASS_C_DEC
+
+#undef PB_DS_DBG_ASSERT
+#undef PB_DS_DBG_VERIFY
+#undef PB_DS_DBG_ONLY
+
+  } // namespace detail
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_RANGED_HASH_FN_HPP
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/hash_fn/ranged_probe_fn.hpp b/libstdc++-v3/include/ext/pb_ds/detail/hash_fn/ranged_probe_fn.hpp
new file mode 100644
index 00000000000..b471176a1ff
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/hash_fn/ranged_probe_fn.hpp
@@ -0,0 +1,473 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file ranged_probe_fn.hpp
+ * Contains a unified ranged probe functor, allowing the probe tables to deal with
+ *    a single class for ranged probeing.
+ */
+
+#ifndef PB_DS_RANGED_PROBE_FN_HPP
+#define PB_DS_RANGED_PROBE_FN_HPP
+
+#include <ext/pb_ds/detail/basic_types.hpp>
+#include <utility>
+
+namespace pb_ds
+{
+  namespace detail
+  {
+
+#ifdef PB_DS_RANGED_PROBE_FN_DEBUG
+#define PB_DS_DBG_ASSERT(X) assert(X)
+#define PB_DS_DBG_VERIFY(X) assert(X)
+#define PB_DS_DBG_ONLY(X) X
+#else // #ifdef PB_DS_RANGED_PROBE_FN_DEBUG
+#define PB_DS_DBG_ASSERT(X)
+#define PB_DS_DBG_VERIFY(X) {if((X)==0);}
+#define PB_DS_DBG_ONLY(X) ;
+#endif // #ifdef PB_DS_RANGED_PROBE_FN_DEBUG
+
+    template<typename Key,
+	     class Hash_Fn,
+	     class Allocator,
+	     class Comb_Probe_Fn,
+	     class Probe_Fn,
+	     bool Store_Hash>
+    class ranged_probe_fn;
+
+#define PB_DS_CLASS_T_DEC						\
+    template<								\
+						typename Key,		\
+						class Hash_Fn,		\
+						class Allocator,	\
+						class Comb_Probe_Fn,	\
+						class Probe_Fn>
+
+#define PB_DS_CLASS_C_DEC					\
+    ranged_probe_fn<						\
+						Key,		\
+						Hash_Fn,	\
+						Allocator,	\
+						Comb_Probe_Fn,	\
+						Probe_Fn,	\
+						false>
+
+    /**
+     * Specialization 1- The client supplies a probe function and a ranged
+     *    probe function, and requests that hash values not be stored.
+     **/
+    template<typename Key,
+	     class Hash_Fn,
+	     class Allocator,
+	     class Comb_Probe_Fn,
+	     class Probe_Fn>
+    class ranged_probe_fn<
+      Key,
+      Hash_Fn,
+      Allocator,
+      Comb_Probe_Fn,
+      Probe_Fn,
+      false> : public Hash_Fn,
+	       public Comb_Probe_Fn,
+	       public Probe_Fn
+    {
+    protected:
+      typedef typename Allocator::size_type size_type;
+
+      typedef Comb_Probe_Fn comb_probe_fn_base;
+
+      typedef Hash_Fn hash_fn_base;
+
+      typedef Probe_Fn probe_fn_base;
+
+      typedef typename Allocator::template rebind<Key>::other key_allocator;
+
+      typedef typename key_allocator::const_reference const_key_reference;
+
+    protected:
+      ranged_probe_fn(size_type size);
+
+      ranged_probe_fn(size_type size, const Hash_Fn& r_hash_fn);
+
+      ranged_probe_fn(size_type size, const Hash_Fn& r_hash_fn, const Comb_Probe_Fn& r_comb_probe_fn);
+
+      ranged_probe_fn(size_type size, const Hash_Fn& r_hash_fn, const Comb_Probe_Fn& r_comb_probe_fn, const Probe_Fn& r_probe_fn);
+
+      void
+      swap(PB_DS_CLASS_C_DEC& other);
+
+      void
+      notify_resized(size_type size);
+
+      inline size_type
+      operator()(const_key_reference r_key) const;
+
+      inline size_type
+      operator()(const_key_reference r_key, size_type hash, size_type i) const;
+    };
+
+    PB_DS_CLASS_T_DEC
+    PB_DS_CLASS_C_DEC::
+    ranged_probe_fn(size_type size)
+    {
+      Comb_Probe_Fn::notify_resized(size);
+    }
+
+    PB_DS_CLASS_T_DEC
+    PB_DS_CLASS_C_DEC::
+    ranged_probe_fn(size_type size, const Hash_Fn& r_hash_fn) :
+      Hash_Fn(r_hash_fn)
+    {
+      Comb_Probe_Fn::notify_resized(size);
+    }
+
+    PB_DS_CLASS_T_DEC
+    PB_DS_CLASS_C_DEC::
+    ranged_probe_fn(size_type size, const Hash_Fn& r_hash_fn, const Comb_Probe_Fn& r_comb_probe_fn) :
+      Hash_Fn(r_hash_fn),
+      Comb_Probe_Fn(r_comb_probe_fn)
+    {
+      comb_probe_fn_base::notify_resized(size);
+    }
+
+    PB_DS_CLASS_T_DEC
+    PB_DS_CLASS_C_DEC::
+    ranged_probe_fn(size_type size, const Hash_Fn& r_hash_fn, const Comb_Probe_Fn& r_comb_probe_fn, const Probe_Fn& r_probe_fn) :
+      Hash_Fn(r_hash_fn),
+      Comb_Probe_Fn(r_comb_probe_fn),
+      Probe_Fn(r_probe_fn)
+    {
+      comb_probe_fn_base::notify_resized(size);
+    }
+
+    PB_DS_CLASS_T_DEC
+    void
+    PB_DS_CLASS_C_DEC::
+    swap(PB_DS_CLASS_C_DEC& other)
+    {
+      comb_probe_fn_base::swap(other);
+
+      std::swap((Hash_Fn& )(*this), (Hash_Fn& )other);
+    }
+
+    PB_DS_CLASS_T_DEC
+    void
+    PB_DS_CLASS_C_DEC::
+    notify_resized(size_type size)
+    {
+      comb_probe_fn_base::notify_resized(size);
+    }
+
+    PB_DS_CLASS_T_DEC
+    inline typename PB_DS_CLASS_C_DEC::size_type
+    PB_DS_CLASS_C_DEC::
+    operator()(const_key_reference r_key) const
+    {
+      return (comb_probe_fn_base::operator()(
+					     hash_fn_base::operator()(r_key)));
+    }
+
+    PB_DS_CLASS_T_DEC
+    inline typename PB_DS_CLASS_C_DEC::size_type
+    PB_DS_CLASS_C_DEC::
+    operator()(const_key_reference /*r_key*/, size_type hash, size_type i) const
+    {
+      return (comb_probe_fn_base::operator()(
+					     hash + probe_fn_base::operator()(i)));
+    }
+
+#undef PB_DS_CLASS_T_DEC
+#undef PB_DS_CLASS_C_DEC
+
+#define PB_DS_CLASS_T_DEC						\
+    template<								\
+						typename Key,		\
+						class Hash_Fn,		\
+						class Allocator,	\
+						class Comb_Probe_Fn,	\
+						class Probe_Fn>
+
+#define PB_DS_CLASS_C_DEC					\
+    ranged_probe_fn<						\
+						Key,		\
+						Hash_Fn,	\
+						Allocator,	\
+						Comb_Probe_Fn,	\
+						Probe_Fn,	\
+						true>
+
+    /**
+     * Specialization 2- The client supplies a probe function and a ranged
+     *    probe function, and requests that hash values not be stored.
+     **/
+    template<typename Key,
+	     class Hash_Fn,
+	     class Allocator,
+	     class Comb_Probe_Fn,
+	     class Probe_Fn>
+    class ranged_probe_fn<
+      Key,
+      Hash_Fn,
+      Allocator,
+      Comb_Probe_Fn,
+      Probe_Fn,
+      true> :
+      public Hash_Fn,
+      public Comb_Probe_Fn,
+      public Probe_Fn
+    {
+    protected:
+      typedef typename Allocator::size_type size_type;
+
+      typedef typename comp_hash_<size_type>::comp_hash comp_hash;
+
+      typedef Comb_Probe_Fn comb_probe_fn_base;
+
+      typedef Hash_Fn hash_fn_base;
+
+      typedef Probe_Fn probe_fn_base;
+
+      typedef typename Allocator::template rebind<Key>::other key_allocator;
+
+      typedef typename key_allocator::const_reference const_key_reference;
+
+    protected:
+      ranged_probe_fn(size_type size);
+
+      ranged_probe_fn(size_type size, const Hash_Fn& r_hash_fn);
+
+      ranged_probe_fn(size_type size, const Hash_Fn& r_hash_fn, const Comb_Probe_Fn& r_comb_probe_fn);
+
+      ranged_probe_fn(size_type size, const Hash_Fn& r_hash_fn, const Comb_Probe_Fn& r_comb_probe_fn, const Probe_Fn& r_probe_fn);
+
+      void
+      swap(PB_DS_CLASS_C_DEC& other);
+
+      void
+      notify_resized(size_type size);
+
+      inline comp_hash
+      operator()(const_key_reference r_key) const;
+
+      inline size_type
+      operator()(const_key_reference r_key, size_type hash, size_type i) const;
+
+      inline size_type
+      operator()(const_key_reference r_key, size_type hash) const;
+    };
+
+    PB_DS_CLASS_T_DEC
+    PB_DS_CLASS_C_DEC::
+    ranged_probe_fn(size_type size)
+    {
+      Comb_Probe_Fn::notify_resized(size);
+    }
+
+    PB_DS_CLASS_T_DEC
+    PB_DS_CLASS_C_DEC::
+    ranged_probe_fn(size_type size, const Hash_Fn& r_hash_fn) :
+      Hash_Fn(r_hash_fn)
+    {
+      Comb_Probe_Fn::notify_resized(size);
+    }
+
+    PB_DS_CLASS_T_DEC
+    PB_DS_CLASS_C_DEC::
+    ranged_probe_fn(size_type size, const Hash_Fn& r_hash_fn, const Comb_Probe_Fn& r_comb_probe_fn) :
+      Hash_Fn(r_hash_fn),
+      Comb_Probe_Fn(r_comb_probe_fn)
+    {
+      comb_probe_fn_base::notify_resized(size);
+    }
+
+    PB_DS_CLASS_T_DEC
+    PB_DS_CLASS_C_DEC::
+    ranged_probe_fn(size_type size, const Hash_Fn& r_hash_fn, const Comb_Probe_Fn& r_comb_probe_fn, const Probe_Fn& r_probe_fn) :
+      Hash_Fn(r_hash_fn),
+      Comb_Probe_Fn(r_comb_probe_fn),
+      Probe_Fn(r_probe_fn)
+    {
+      comb_probe_fn_base::notify_resized(size);
+    }
+
+    PB_DS_CLASS_T_DEC
+    void
+    PB_DS_CLASS_C_DEC::
+    swap(PB_DS_CLASS_C_DEC& other)
+    {
+      comb_probe_fn_base::swap(other);
+
+      std::swap((Hash_Fn& )(*this), (Hash_Fn& )other);
+    }
+
+    PB_DS_CLASS_T_DEC
+    void
+    PB_DS_CLASS_C_DEC::
+    notify_resized(size_type size)
+    {
+      comb_probe_fn_base::notify_resized(size);
+    }
+
+    PB_DS_CLASS_T_DEC
+    inline typename PB_DS_CLASS_C_DEC::comp_hash
+    PB_DS_CLASS_C_DEC::
+    operator()(const_key_reference r_key) const
+    {
+      const size_type hash = hash_fn_base::operator()(r_key);
+
+      return (std::make_pair(comb_probe_fn_base::operator()(hash), hash));
+    }
+
+    PB_DS_CLASS_T_DEC
+    inline typename PB_DS_CLASS_C_DEC::size_type
+    PB_DS_CLASS_C_DEC::
+    operator()(const_key_reference /*r_key*/, size_type hash, size_type i) const
+    {
+      return (comb_probe_fn_base::operator()(
+					     hash + probe_fn_base::operator()(i)));
+    }
+
+    PB_DS_CLASS_T_DEC
+    inline typename PB_DS_CLASS_C_DEC::size_type
+    PB_DS_CLASS_C_DEC::
+    operator()
+#ifdef PB_DS_RANGED_PROBE_FN_DEBUG
+      (const_key_reference r_key, size_type hash) const
+#else // #ifdef PB_DS_RANGED_PROBE_FN_DEBUG
+      (const_key_reference /*r_key*/, size_type hash) const
+#endif // #ifdef PB_DS_RANGED_PROBE_FN_DEBUG
+    {
+      PB_DS_DBG_ASSERT(hash == hash_fn_base::operator()(r_key));
+
+      return (hash);
+    }
+
+#undef PB_DS_CLASS_T_DEC
+#undef PB_DS_CLASS_C_DEC
+
+#define PB_DS_CLASS_T_DEC						\
+    template<typename Key, class Allocator, class Comb_Probe_Fn>
+
+#define PB_DS_CLASS_C_DEC					\
+    ranged_probe_fn<						\
+						Key,		\
+						null_hash_fn,	\
+						Allocator,	\
+						Comb_Probe_Fn,	\
+						null_probe_fn,	\
+						false>
+
+    /**
+     * Specialization 3 and 4- The client does not supply a hash function or
+     *    probe function, and requests that hash values not be stored.
+     **/
+    template<typename Key, class Allocator, class Comb_Probe_Fn>
+    class ranged_probe_fn<
+      Key,
+      null_hash_fn,
+      Allocator,
+      Comb_Probe_Fn,
+      null_probe_fn,
+      false> :
+      public Comb_Probe_Fn,
+      public null_hash_fn,
+      public null_probe_fn
+    {
+    protected:
+      typedef typename Allocator::size_type size_type;
+
+      typedef Comb_Probe_Fn comb_probe_fn_base;
+
+      typedef typename Allocator::template rebind<Key>::other key_allocator;
+
+      typedef typename key_allocator::const_reference const_key_reference;
+
+    protected:
+      ranged_probe_fn(size_type size);
+
+      ranged_probe_fn(size_type size, const Comb_Probe_Fn& r_comb_probe_fn);
+
+      ranged_probe_fn(size_type size, const null_hash_fn& r_null_hash_fn, const Comb_Probe_Fn& r_comb_probe_fn, const null_probe_fn& r_null_probe_fn);
+
+      void
+      swap(PB_DS_CLASS_C_DEC& other);
+    };
+
+    PB_DS_CLASS_T_DEC
+    PB_DS_CLASS_C_DEC::
+    ranged_probe_fn(size_type size)
+    {
+      Comb_Probe_Fn::notify_resized(size);
+    }
+
+    PB_DS_CLASS_T_DEC
+    PB_DS_CLASS_C_DEC::
+    ranged_probe_fn(size_type size, const Comb_Probe_Fn& r_comb_probe_fn) :
+      Comb_Probe_Fn(r_comb_probe_fn)
+    { }
+
+    PB_DS_CLASS_T_DEC
+    PB_DS_CLASS_C_DEC::
+    ranged_probe_fn(size_type size, const null_hash_fn& r_null_hash_fn, const Comb_Probe_Fn& r_comb_probe_fn, const null_probe_fn& r_null_probe_fn) :
+      Comb_Probe_Fn(r_comb_probe_fn)
+    { }
+
+    PB_DS_CLASS_T_DEC
+    void
+    PB_DS_CLASS_C_DEC::
+    swap(PB_DS_CLASS_C_DEC& other)
+    {
+      comb_probe_fn_base::swap(other);
+    }
+
+#undef PB_DS_CLASS_T_DEC
+#undef PB_DS_CLASS_C_DEC
+
+#undef PB_DS_DBG_ASSERT
+#undef PB_DS_DBG_VERIFY
+#undef PB_DS_DBG_ONLY
+
+  } // namespace detail
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_RANGED_PROBE_FN_HPP
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/hash_fn/sample_probe_fn.hpp b/libstdc++-v3/include/ext/pb_ds/detail/hash_fn/sample_probe_fn.hpp
new file mode 100644
index 00000000000..908a7199fa2
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/hash_fn/sample_probe_fn.hpp
@@ -0,0 +1,79 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file sample_probe_fn.hpp
+ * Contains a sample probe policy.
+ */
+
+#ifndef PB_DS_SAMPLE_PROBE_FN_HPP
+#define PB_DS_SAMPLE_PROBE_FN_HPP
+
+// A sample probe policy.
+class sample_probe_fn
+{
+
+public:
+
+  // Size type.
+  typedef size_t size_type;
+
+public:
+
+  // Default constructor.
+  sample_probe_fn();
+
+  // Copy constructor.
+  sample_probe_fn(const sample_probe_fn& other);
+
+  // Swaps content.
+  inline void
+  swap(sample_probe_fn& other);
+
+protected:
+
+  // Returns the i-th offset from the hash value of some key r_key.
+  inline size_type
+  operator()(const_key_reference r_key, size_type i) const;
+
+};
+
+#endif // #ifndef PB_DS_SAMPLE_PROBE_FN_HPP
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/hash_fn/sample_range_hashing.hpp b/libstdc++-v3/include/ext/pb_ds/detail/hash_fn/sample_range_hashing.hpp
new file mode 100644
index 00000000000..40ab29a921f
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/hash_fn/sample_range_hashing.hpp
@@ -0,0 +1,83 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file sample_range_hashing.hpp
+ * Contains a range hashing policy.
+ */
+
+#ifndef PB_DS_SAMPLE_RANGE_HASHING_HPP
+#define PB_DS_SAMPLE_RANGE_HASHING_HPP
+
+// A sample range-hashing functor.
+class sample_range_hashing
+{
+
+public:
+
+  // Size type.
+  typedef size_t size_type;
+
+public:
+
+  // Default constructor.
+  sample_range_hashing();
+
+  // Copy constructor.
+  sample_range_hashing(const sample_range_hashing& other);
+
+  // Swaps content.
+  inline void
+  swap(sample_range_hashing& other);
+
+protected:
+
+  // Notifies the policy object that the container's __size has changed to size.
+  void
+  notify_resized(size_type size);
+
+  // Transforms the __hash value hash into a ranged-hash value.
+  inline size_type
+  operator()(size_type hash) const;
+
+};
+
+#endif // #ifndef PB_DS_SAMPLE_RANGE_HASHING_HPP
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/hash_fn/sample_ranged_hash_fn.hpp b/libstdc++-v3/include/ext/pb_ds/detail/hash_fn/sample_ranged_hash_fn.hpp
new file mode 100644
index 00000000000..55a115d53c3
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/hash_fn/sample_ranged_hash_fn.hpp
@@ -0,0 +1,83 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file sample_ranged_hash_fn.hpp
+ * Contains a ranged hash policy.
+ */
+
+#ifndef PB_DS_SAMPLE_RANGED_HASH_FN_HPP
+#define PB_DS_SAMPLE_RANGED_HASH_FN_HPP
+
+// A sample ranged-hash functor.
+class sample_ranged_hash_fn
+{
+
+public:
+
+  // Size type.
+  typedef size_t size_type;
+
+public:
+
+  // Default constructor.
+  sample_ranged_hash_fn();
+
+  // Copy constructor.
+  sample_ranged_hash_fn(const sample_ranged_hash_fn& other);
+
+  // Swaps content.
+  inline void
+  swap(sample_ranged_hash_fn& other);
+
+protected:
+
+  // Notifies the policy object that the container's __size has changed to size.
+  void
+  notify_resized(size_type size);
+
+  // Transforms r_key into a position within the table.
+  inline size_type
+  operator()(const_key_reference r_key) const;
+
+};
+
+#endif // #ifndef PB_DS_SAMPLE_RANGED_HASH_FN_HPP
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/hash_fn/sample_ranged_probe_fn.hpp b/libstdc++-v3/include/ext/pb_ds/detail/hash_fn/sample_ranged_probe_fn.hpp
new file mode 100644
index 00000000000..01697bb41ff
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/hash_fn/sample_ranged_probe_fn.hpp
@@ -0,0 +1,83 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file sample_ranged_probe_fn.hpp
+ * Contains a ranged probe policy.
+ */
+
+#ifndef PB_DS_SAMPLE_RANGED_PROBE_FN_HPP
+#define PB_DS_SAMPLE_RANGED_PROBE_FN_HPP
+
+// A sample ranged-probe functor.
+class sample_ranged_probe_fn
+{
+
+public:
+
+  // Size type.
+  typedef size_t size_type;
+
+public:
+
+  // Default constructor.
+  sample_ranged_probe_fn();
+
+  // Copy constructor.
+  sample_ranged_probe_fn(const sample_ranged_probe_fn& other);
+
+  // Swaps content.
+  inline void
+  swap(sample_ranged_probe_fn& other);
+
+protected:
+
+  // Notifies the policy object that the container's __size has changed to size.
+  void
+  notify_resized(size_type size);
+
+  // 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.
+  inline size_type
+  operator()(const_key_reference r_key, size_t hash, size_type i) const;
+
+};
+
+#endif // #ifndef PB_DS_SAMPLE_RANGED_PROBE_FN_HPP
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/left_child_next_sibling_heap_/const_iterator.hpp b/libstdc++-v3/include/ext/pb_ds/detail/left_child_next_sibling_heap_/const_iterator.hpp
new file mode 100644
index 00000000000..c0688dbe467
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/left_child_next_sibling_heap_/const_iterator.hpp
@@ -0,0 +1,197 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file const_iterator.hpp
+ * Contains an iterator class returned by the table's const find and insert
+ *     methods.
+ */
+
+#ifndef PB_DS_LEFT_CHILD_NEXT_SIBLING_HEAP_CONST_ITERATOR_HPP
+#define PB_DS_LEFT_CHILD_NEXT_SIBLING_HEAP_CONST_ITERATOR_HPP
+
+#include <ext/pb_ds/detail/left_child_next_sibling_heap_/const_point_iterator.hpp>
+
+namespace pb_ds
+{
+  namespace detail
+  {
+
+#ifdef PB_DS_LC_NS_HEAP_DEBUG_
+#define PB_DS_DBG_ASSERT(X) assert(X)
+#define PB_DS_DBG_VERIFY(X) assert(X)
+#define PB_DS_DBG_ONLY(X) X
+#else // #ifdef PB_DS_LC_NS_HEAP_DEBUG_
+#define PB_DS_DBG_ASSERT(X)
+#define PB_DS_DBG_VERIFY(X) {if((X)==0);}
+#define PB_DS_DBG_ONLY(X) ;
+#endif // #ifdef PB_DS_LC_NS_HEAP_DEBUG_
+
+#define PB_DS_CLASS_C_DEC						\
+    left_child_next_sibling_heap_const_iterator_<			\
+								Node,	\
+								Allocator>
+
+#define PB_DS_BASE_C_DEC						\
+    left_child_next_sibling_heap_node_const_point_iterator_<		\
+									Node, \
+									Allocator>
+
+    // Const point-type iterator.
+    template<typename Node, class Allocator>
+    class left_child_next_sibling_heap_const_iterator_ : public PB_DS_BASE_C_DEC
+    {
+
+    private:
+      typedef typename PB_DS_BASE_C_DEC::node_pointer node_pointer;
+
+      typedef PB_DS_BASE_C_DEC base_type;
+
+    public:
+
+      // Category.
+      typedef std::forward_iterator_tag iterator_category;
+
+      // Difference type.
+      typedef typename Allocator::difference_type difference_type;
+
+      // Iterator's value type.
+      typedef typename base_type::value_type value_type;
+
+      // Iterator's pointer type.
+      typedef typename base_type::pointer pointer;
+
+      // Iterator's const pointer type.
+      typedef typename base_type::const_pointer const_pointer;
+
+      // Iterator's reference type.
+      typedef typename base_type::reference reference;
+
+      // Iterator's const reference type.
+      typedef typename base_type::const_reference const_reference;
+
+    public:
+
+      inline
+      left_child_next_sibling_heap_const_iterator_(node_pointer p_nd) : base_type(p_nd)
+      { }
+
+      // Default constructor.
+      inline
+      left_child_next_sibling_heap_const_iterator_()
+      { }
+
+      // Copy constructor.
+      inline
+      left_child_next_sibling_heap_const_iterator_(const PB_DS_CLASS_C_DEC& other) : base_type(other)
+      { }
+
+      // Compares content to a different iterator object.
+      inline bool
+      operator==(const PB_DS_CLASS_C_DEC& other) const
+      {
+	return (base_type::m_p_nd == other.m_p_nd);
+      }
+
+      // Compares content (negatively) to a different iterator object.
+      inline bool
+      operator!=(const PB_DS_CLASS_C_DEC& other) const
+      {
+	return (base_type::m_p_nd != other.m_p_nd);
+      }
+
+      inline PB_DS_CLASS_C_DEC& 
+      operator++()
+      {
+	PB_DS_DBG_ASSERT(base_type::m_p_nd != NULL);
+
+	inc();
+
+	return (*this);
+      }
+
+      inline PB_DS_CLASS_C_DEC
+      operator++(int)
+      {
+	PB_DS_CLASS_C_DEC ret_it(base_type::m_p_nd);
+
+	operator++();
+
+	return (ret_it);
+      }
+
+    private:
+      void
+      inc()
+      {
+	if (base_type::m_p_nd->m_p_next_sibling != NULL)
+	  {
+	    base_type::m_p_nd = base_type::m_p_nd->m_p_next_sibling;
+
+	    while (base_type::m_p_nd->m_p_l_child != NULL)
+	      base_type::m_p_nd = base_type::m_p_nd->m_p_l_child;
+
+	    return;
+	  }
+
+	while (true)
+	  {
+	    node_pointer p_next = base_type::m_p_nd;
+	    base_type::m_p_nd = base_type::m_p_nd->m_p_prev_or_parent;
+
+	    if (base_type::m_p_nd == NULL || base_type::m_p_nd->m_p_l_child == p_next)
+	      return;
+	  }
+      }
+    };
+
+#undef PB_DS_CLASS_C_DEC
+
+#undef PB_DS_BASE_C_DEC
+
+#undef PB_DS_DBG_ASSERT
+#undef PB_DS_DBG_VERIFY
+#undef PB_DS_DBG_ONLY
+
+  } // namespace detail
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_LEFT_CHILD_NEXT_SIBLING_HEAP_CONST_ITERATOR_HPP
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/left_child_next_sibling_heap_/const_point_iterator.hpp b/libstdc++-v3/include/ext/pb_ds/detail/left_child_next_sibling_heap_/const_point_iterator.hpp
new file mode 100644
index 00000000000..954b1335b9d
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/left_child_next_sibling_heap_/const_point_iterator.hpp
@@ -0,0 +1,188 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file const_point_iterator.hpp
+ * Contains an iterator class returned by the table's const find and insert
+ *     methods.
+ */
+
+#ifndef PB_DS_LEFT_CHILD_NEXT_SIBLING_HEAP_CONST_FIND_ITERATOR_HPP
+#define PB_DS_LEFT_CHILD_NEXT_SIBLING_HEAP_CONST_FIND_ITERATOR_HPP
+
+#include <ext/pb_ds/tag_and_trait.hpp>
+
+namespace pb_ds
+{
+  namespace detail
+  {
+
+#ifdef PB_DS_LC_NS_HEAP_DEBUG_
+#define PB_DS_DBG_ASSERT(X) assert(X)
+#define PB_DS_DBG_VERIFY(X) assert(X)
+#define PB_DS_DBG_ONLY(X) X
+#else // #ifdef PB_DS_LC_NS_HEAP_DEBUG_
+#define PB_DS_DBG_ASSERT(X)
+#define PB_DS_DBG_VERIFY(X) {if((X)==0);}
+#define PB_DS_DBG_ONLY(X) ;m_p_prev_or_parent
+#endif // #ifdef PB_DS_LC_NS_HEAP_DEBUG_
+
+#define PB_DS_CLASS_T_DEC			\
+    template<typename Node, class Allocator>
+
+#define PB_DS_CLASS_C_DEC						\
+    left_child_next_sibling_heap_node_const_point_iterator_<		\
+									Node, \
+									Allocator>
+
+    // Const point-type iterator.
+    template<typename Node, class Allocator>
+    class left_child_next_sibling_heap_node_const_point_iterator_
+    {
+
+    protected:
+      typedef
+      typename Allocator::template rebind<
+      Node>::other::pointer
+      node_pointer;
+
+    public:
+
+      // Category.
+      typedef trivial_iterator_tag iterator_category;
+
+      // Difference type.
+      typedef trivial_iterator_difference_type difference_type;
+
+      // Iterator's value type.
+      typedef typename Node::value_type value_type;
+
+      // Iterator's pointer type.
+      typedef
+      typename Allocator::template rebind<
+	value_type>::other::pointer
+      pointer;
+
+      // Iterator's const pointer type.
+      typedef
+      typename Allocator::template rebind<
+	value_type>::other::const_pointer
+      const_pointer;
+
+      // Iterator's reference type.
+      typedef
+      typename Allocator::template rebind<
+	value_type>::other::reference
+      reference;
+
+      // Iterator's const reference type.
+      typedef
+      typename Allocator::template rebind<
+	value_type>::other::const_reference
+      const_reference;
+
+    public:
+
+      inline
+      left_child_next_sibling_heap_node_const_point_iterator_(node_pointer p_nd) : m_p_nd(p_nd)
+      { }
+
+      // Default constructor.
+      inline
+      left_child_next_sibling_heap_node_const_point_iterator_()
+
+	: m_p_nd(NULL)
+      { }
+
+      // Copy constructor.
+      inline
+      left_child_next_sibling_heap_node_const_point_iterator_(const PB_DS_CLASS_C_DEC& other)
+
+	: m_p_nd(other.m_p_nd)
+      { }
+
+      // Access.
+      inline const_pointer
+      operator->() const
+      {
+	PB_DS_DBG_ASSERT(m_p_nd != NULL);
+
+	return (&m_p_nd->m_value);
+      }
+
+      // Access.
+      inline const_reference
+      operator*() const
+      {
+	PB_DS_DBG_ASSERT(m_p_nd != NULL);
+
+	return (m_p_nd->m_value);
+      }
+
+      // Compares content to a different iterator object.
+      inline bool
+      operator==(const PB_DS_CLASS_C_DEC& other) const
+      {
+	return (m_p_nd == other.m_p_nd);
+      }
+
+      // Compares content (negatively) to a different iterator object.
+      inline bool
+      operator!=(const PB_DS_CLASS_C_DEC& other) const
+      {
+	return (m_p_nd != other.m_p_nd);
+      }
+
+    public:
+      node_pointer m_p_nd;
+    };
+
+#undef PB_DS_CLASS_T_DEC
+#undef PB_DS_CLASS_C_DEC
+
+#undef PB_DS_DBG_ASSERT
+#undef PB_DS_DBG_VERIFY
+#undef PB_DS_DBG_ONLY
+
+  } // namespace detail
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_LEFT_CHILD_NEXT_SIBLING_HEAP_CONST_FIND_ITERATOR_HPP
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/left_child_next_sibling_heap_/constructors_destructor_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/left_child_next_sibling_heap_/constructors_destructor_fn_imps.hpp
new file mode 100644
index 00000000000..97d8277e69d
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/left_child_next_sibling_heap_/constructors_destructor_fn_imps.hpp
@@ -0,0 +1,173 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file constructors_destructor_fn_imps.hpp
+ * Contains an implementation class for left_child_next_sibling_heap_.
+ */
+
+PB_DS_CLASS_T_DEC
+typename PB_DS_CLASS_C_DEC::node_allocator
+PB_DS_CLASS_C_DEC::s_node_allocator;
+
+PB_DS_CLASS_T_DEC
+typename PB_DS_CLASS_C_DEC::no_throw_copies_t
+PB_DS_CLASS_C_DEC::s_no_throw_copies_ind;
+
+PB_DS_CLASS_T_DEC
+PB_DS_CLASS_C_DEC::
+left_child_next_sibling_heap_() :
+  m_p_root(NULL),
+  m_size(0)
+{
+  PB_DS_DBG_ONLY(assert_valid();)
+    }
+
+PB_DS_CLASS_T_DEC
+PB_DS_CLASS_C_DEC::
+left_child_next_sibling_heap_(const Cmp_Fn& r_cmp_fn) :
+  Cmp_Fn(r_cmp_fn),
+  m_p_root(NULL),
+  m_size(0)
+{
+  PB_DS_DBG_ONLY(assert_valid();)
+    }
+
+PB_DS_CLASS_T_DEC
+PB_DS_CLASS_C_DEC::
+left_child_next_sibling_heap_(const PB_DS_CLASS_C_DEC& other) :
+  Cmp_Fn(other),
+  m_p_root(NULL),
+  m_size(0)
+{
+  m_size = other.m_size;
+
+  PB_DS_DBG_ONLY(other.assert_valid();)
+
+    m_p_root = recursive_copy_node(other.m_p_root);
+
+  m_size = other.m_size;
+
+  PB_DS_DBG_ONLY(assert_valid();)
+    }
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+swap(PB_DS_CLASS_C_DEC& other)
+{
+  PB_DS_DBG_ONLY(assert_valid();)
+    PB_DS_DBG_ONLY(other.assert_valid();)
+
+    value_swap(other);
+
+  std::swap((Cmp_Fn& )(*this), (Cmp_Fn& )other);
+
+  PB_DS_DBG_ONLY(assert_valid();)
+    PB_DS_DBG_ONLY(other.assert_valid();)
+    }
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+value_swap(PB_DS_CLASS_C_DEC& other)
+{
+  std::swap(m_p_root, other.m_p_root);
+
+  std::swap(m_size, other.m_size);
+}
+
+PB_DS_CLASS_T_DEC
+PB_DS_CLASS_C_DEC::
+~left_child_next_sibling_heap_()
+{
+  clear();
+}
+
+PB_DS_CLASS_T_DEC
+typename PB_DS_CLASS_C_DEC::node_pointer
+PB_DS_CLASS_C_DEC::
+recursive_copy_node(const_node_pointer p_nd)
+{
+  if (p_nd == NULL)
+    return (NULL);
+
+  node_pointer p_ret = s_node_allocator.allocate(1);
+
+  try
+    {
+      new (p_ret) node(*p_nd);
+    }
+  catch(...)
+    {
+      s_node_allocator.deallocate(p_ret, 1);
+
+      throw;
+    }
+
+  p_ret->m_p_l_child = p_ret->m_p_next_sibling =
+    p_ret->m_p_prev_or_parent = NULL;
+
+  try
+    {
+      p_ret->m_p_l_child = recursive_copy_node(p_nd->m_p_l_child);
+
+      p_ret->m_p_next_sibling = recursive_copy_node(p_nd->m_p_next_sibling);
+    }
+  catch(...)
+    {
+      clear_imp(p_ret);
+
+      throw;
+    }
+
+  if (p_ret->m_p_l_child != NULL)
+    p_ret->m_p_l_child->m_p_prev_or_parent = p_ret;
+
+  if (p_ret->m_p_next_sibling != NULL)
+    p_ret->m_p_next_sibling->m_p_prev_or_parent =
+      p_nd->m_p_next_sibling->m_p_prev_or_parent == p_nd?
+      p_ret :
+      NULL;
+
+  return (p_ret);
+}
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/left_child_next_sibling_heap_/debug_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/left_child_next_sibling_heap_/debug_fn_imps.hpp
new file mode 100644
index 00000000000..72c0ca1b0ef
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/left_child_next_sibling_heap_/debug_fn_imps.hpp
@@ -0,0 +1,165 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file debug_fn_imps.hpp
+ * Contains an implementation class for left_child_next_sibling_heap_.
+ */
+
+#ifdef PB_DS_LC_NS_HEAP_DEBUG_
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+assert_valid() const
+{
+  PB_DS_DBG_ASSERT(m_p_root == NULL || m_p_root->m_p_prev_or_parent == NULL);
+
+  if (m_p_root != NULL)
+    assert_node_consistent(m_p_root, Single_Link_Roots);
+
+  assert_size();
+
+  assert_iterators();
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+assert_node_consistent(const_node_pointer p_nd, bool single_link) const
+{
+  if (p_nd == NULL)
+    return;
+
+  assert_node_consistent(p_nd->m_p_l_child, false);
+  assert_node_consistent(p_nd->m_p_next_sibling, single_link);
+
+  if (single_link)
+    PB_DS_DBG_ASSERT(p_nd->m_p_prev_or_parent == NULL);
+  else if (p_nd->m_p_next_sibling != NULL)
+    PB_DS_DBG_ASSERT(p_nd->m_p_next_sibling->m_p_prev_or_parent == p_nd);
+
+  if (p_nd->m_p_l_child == NULL)
+    return;
+
+  const_node_pointer p_child = p_nd->m_p_l_child;
+
+  while (p_child != NULL)
+    {
+      const_node_pointer p_next_child = p_child->m_p_next_sibling;
+
+      PB_DS_DBG_ASSERT(!Cmp_Fn::operator()(p_nd->m_value, p_child->m_value));
+
+      p_child = p_next_child;
+    }
+
+  PB_DS_DBG_ASSERT(p_nd->m_p_l_child->m_p_prev_or_parent == p_nd);
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+assert_iterators() const
+{
+  const size_type calc_size = std::distance(begin(), end());
+
+  if (calc_size == size())
+    return;
+
+  PB_DS_DBG_ASSERT(0);
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+assert_size() const
+{
+  if (size_from_node(m_p_root) == m_size)
+    return;
+
+  PB_DS_DBG_ASSERT(0);
+}
+
+PB_DS_CLASS_T_DEC
+typename PB_DS_CLASS_C_DEC::size_type
+PB_DS_CLASS_C_DEC::
+size_under_node(const_node_pointer p_nd)
+{
+  return 1 + size_from_node(p_nd->m_p_l_child);
+}
+
+PB_DS_CLASS_T_DEC
+typename PB_DS_CLASS_C_DEC::size_type
+PB_DS_CLASS_C_DEC::
+size_from_node(const_node_pointer p_nd)
+{
+  size_type ret = 0;
+
+  while (p_nd != NULL)
+    {
+      ret += 1 + size_from_node(p_nd->m_p_l_child);
+
+      p_nd = p_nd->m_p_next_sibling;
+    }
+
+  return ret;
+}
+
+PB_DS_CLASS_T_DEC
+typename PB_DS_CLASS_C_DEC::size_type
+PB_DS_CLASS_C_DEC::
+degree(const_node_pointer p_nd)
+{
+  size_type ret = 0;
+
+  const_node_pointer p_child = p_nd->m_p_l_child;
+
+  while (p_child != NULL)
+    {
+      ++ret;
+
+      p_child = p_child->m_p_next_sibling;
+    }
+
+  return ret;
+}
+
+#endif // #ifdef PB_DS_LC_NS_HEAP_DEBUG_
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/left_child_next_sibling_heap_/erase_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/left_child_next_sibling_heap_/erase_fn_imps.hpp
new file mode 100644
index 00000000000..4b88eec98f7
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/left_child_next_sibling_heap_/erase_fn_imps.hpp
@@ -0,0 +1,184 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file erase_fn_imps.hpp
+ * Contains an implementation class for left_child_next_sibling_heap_.
+ */
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+clear()
+{
+  clear_imp(m_p_root);
+
+  PB_DS_DBG_ASSERT(m_size == 0);
+  m_p_root = NULL;
+}
+
+PB_DS_CLASS_T_DEC
+inline void
+PB_DS_CLASS_C_DEC::
+actual_erase_node(node_pointer p_nd)
+{
+  PB_DS_DBG_ASSERT(m_size > 0);
+  --m_size;
+
+  p_nd->~node();
+
+  s_node_allocator.deallocate(p_nd, 1);
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+clear_imp(node_pointer p_nd)
+{
+  while (p_nd != NULL)
+    {
+      clear_imp(p_nd->m_p_l_child);
+
+      node_pointer p_next = p_nd->m_p_next_sibling;
+
+      actual_erase_node(p_nd);
+
+      p_nd = p_next;
+    }
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+to_linked_list()
+{
+  PB_DS_DBG_ONLY(assert_valid();)
+
+    node_pointer p_cur = m_p_root;
+
+  while (p_cur != NULL)
+    if (p_cur->m_p_l_child != NULL)
+      {
+	node_pointer p_child_next = p_cur->m_p_l_child->m_p_next_sibling;
+
+	p_cur->m_p_l_child->m_p_next_sibling = p_cur->m_p_next_sibling;
+
+	p_cur->m_p_next_sibling = p_cur->m_p_l_child;
+
+	p_cur->m_p_l_child = p_child_next;
+      }
+    else
+      p_cur = p_cur->m_p_next_sibling;
+
+#ifdef PB_DS_LC_NS_HEAP_DEBUG_
+  const_node_pointer p_counter = m_p_root;
+
+  size_type count = 0;
+
+  while (p_counter != NULL)
+    {
+      ++count;
+
+      PB_DS_DBG_ASSERT(p_counter->m_p_l_child == NULL);
+
+      p_counter = p_counter->m_p_next_sibling;
+    }
+
+  PB_DS_DBG_ASSERT(count == m_size);
+#endif // #ifdef PB_DS_LC_NS_HEAP_DEBUG_
+}
+
+PB_DS_CLASS_T_DEC
+template<typename Pred>
+typename PB_DS_CLASS_C_DEC::node_pointer
+PB_DS_CLASS_C_DEC::
+prune(Pred pred)
+{
+  node_pointer p_cur = m_p_root;
+
+  m_p_root = NULL;
+
+  node_pointer p_out = NULL;
+
+  while (p_cur != NULL)
+    {
+      node_pointer p_next = p_cur->m_p_next_sibling;
+
+      if (pred(p_cur->m_value))
+        {
+	  p_cur->m_p_next_sibling = p_out;
+
+	  if (p_out != NULL)
+	    p_out->m_p_prev_or_parent = p_cur;
+
+	  p_out = p_cur;
+        }
+      else
+        {
+	  p_cur->m_p_next_sibling = m_p_root;
+
+	  if (m_p_root != NULL)
+	    m_p_root->m_p_prev_or_parent = p_cur;
+
+	  m_p_root = p_cur;
+        }
+
+      p_cur = p_next;
+    }
+
+  return p_out;
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+bubble_to_top(node_pointer p_nd)
+{
+  node_pointer p_parent = parent(p_nd);
+
+  while (p_parent != NULL)
+    {
+      swap_with_parent(p_nd, p_parent);
+
+      p_parent = parent(p_nd);
+    }
+}
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/left_child_next_sibling_heap_/info_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/left_child_next_sibling_heap_/info_fn_imps.hpp
new file mode 100644
index 00000000000..3c0dde816ce
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/left_child_next_sibling_heap_/info_fn_imps.hpp
@@ -0,0 +1,70 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file info_fn_imps.hpp
+ * Contains an implementation class for left_child_next_sibling_heap_.
+ */
+
+PB_DS_CLASS_T_DEC
+inline bool
+PB_DS_CLASS_C_DEC::
+empty() const
+{
+  return (m_size == 0);
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::size_type
+PB_DS_CLASS_C_DEC::
+size() const
+{
+  return (m_size);
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::size_type
+PB_DS_CLASS_C_DEC::
+max_size() const
+{
+  return (s_node_allocator.max_size());
+}
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/left_child_next_sibling_heap_/insert_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/left_child_next_sibling_heap_/insert_fn_imps.hpp
new file mode 100644
index 00000000000..32c36783697
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/left_child_next_sibling_heap_/insert_fn_imps.hpp
@@ -0,0 +1,181 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file insert_fn_imps.hpp
+ * Contains an implementation class for left_child_next_sibling_heap_.
+ */
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::node_pointer
+PB_DS_CLASS_C_DEC::
+get_new_node_for_insert(const_reference r_val)
+{
+  return get_new_node_for_insert(r_val, s_no_throw_copies_ind);
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::node_pointer
+PB_DS_CLASS_C_DEC::
+get_new_node_for_insert(const_reference r_val, false_type)
+{
+  node_pointer p_new_nd = s_node_allocator.allocate(1);
+
+  cond_dealtor_t cond(p_new_nd);
+
+  new (const_cast<void* >(
+			  static_cast<const void* >(&p_new_nd->m_value)))
+    typename node::value_type(r_val);
+
+  cond.set_no_action();
+
+  ++m_size;
+
+  return (p_new_nd);
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::node_pointer
+PB_DS_CLASS_C_DEC::
+get_new_node_for_insert(const_reference r_val, true_type)
+{
+  node_pointer p_new_nd = s_node_allocator.allocate(1);
+
+  new (const_cast<void* >(
+			  static_cast<const void* >(&p_new_nd->m_value)))
+    typename node::value_type(r_val);
+
+  ++m_size;
+
+  return (p_new_nd);
+}
+
+PB_DS_CLASS_T_DEC
+inline void
+PB_DS_CLASS_C_DEC::
+make_child_of(node_pointer p_nd, node_pointer p_new_parent)
+{
+  PB_DS_DBG_ASSERT(p_nd != NULL);
+  PB_DS_DBG_ASSERT(p_new_parent != NULL);
+
+  p_nd->m_p_next_sibling = p_new_parent->m_p_l_child;
+
+  if (p_new_parent->m_p_l_child != NULL)
+    p_new_parent->m_p_l_child->m_p_prev_or_parent = p_nd;
+
+  p_nd->m_p_prev_or_parent = p_new_parent;
+
+  p_new_parent->m_p_l_child = p_nd;
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::node_pointer
+PB_DS_CLASS_C_DEC::
+parent(node_pointer p_nd)
+{
+  while (true)
+    {
+      node_pointer p_pot = p_nd->m_p_prev_or_parent;
+
+      if (p_pot == NULL || p_pot->m_p_l_child == p_nd)
+	return p_pot;
+
+      p_nd = p_pot;
+    }
+}
+
+PB_DS_CLASS_T_DEC
+inline void
+PB_DS_CLASS_C_DEC::
+swap_with_parent(node_pointer p_nd, node_pointer p_parent)
+{
+  if (p_parent == m_p_root)
+    m_p_root = p_nd;
+
+  PB_DS_DBG_ASSERT(p_nd != NULL);
+  PB_DS_DBG_ASSERT(p_parent != NULL);
+  PB_DS_DBG_ASSERT(parent(p_nd) == p_parent);
+
+  const bool nd_direct_child = p_parent->m_p_l_child == p_nd;
+  const bool parent_root = p_parent->m_p_prev_or_parent == NULL;
+  const bool parent_direct_child =
+    !parent_root&&  p_parent->m_p_prev_or_parent->m_p_l_child == p_parent;
+
+  std::swap(p_parent->m_p_prev_or_parent, p_nd->m_p_prev_or_parent);
+  std::swap(p_parent->m_p_next_sibling, p_nd->m_p_next_sibling);
+  std::swap(p_parent->m_p_l_child, p_nd->m_p_l_child);
+  std::swap(p_parent->m_metadata, p_nd->m_metadata);
+
+  PB_DS_DBG_ASSERT(p_nd->m_p_l_child != NULL);
+  PB_DS_DBG_ASSERT(p_parent->m_p_prev_or_parent != NULL);
+
+  if (p_nd->m_p_next_sibling != NULL)
+    p_nd->m_p_next_sibling->m_p_prev_or_parent = p_nd;
+
+  if (p_parent->m_p_next_sibling != NULL)
+    p_parent->m_p_next_sibling->m_p_prev_or_parent = p_parent;
+
+  if (p_parent->m_p_l_child != NULL)
+    p_parent->m_p_l_child->m_p_prev_or_parent = p_parent;
+
+  if (parent_direct_child)
+    p_nd->m_p_prev_or_parent->m_p_l_child = p_nd;
+  else if (!parent_root)
+    p_nd->m_p_prev_or_parent->m_p_next_sibling = p_nd;
+
+  if (!nd_direct_child)
+    {
+      p_nd->m_p_l_child->m_p_prev_or_parent = p_nd;
+
+      p_parent->m_p_prev_or_parent->m_p_next_sibling = p_parent;
+    }
+  else
+    {
+      PB_DS_DBG_ASSERT(p_nd->m_p_l_child == p_nd);
+      PB_DS_DBG_ASSERT(p_parent->m_p_prev_or_parent == p_parent);
+
+      p_nd->m_p_l_child = p_parent;
+      p_parent->m_p_prev_or_parent = p_nd;
+    }
+
+  PB_DS_DBG_ASSERT(parent(p_parent) == p_nd);
+}
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/left_child_next_sibling_heap_/iterators_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/left_child_next_sibling_heap_/iterators_fn_imps.hpp
new file mode 100644
index 00000000000..02e99821f9b
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/left_child_next_sibling_heap_/iterators_fn_imps.hpp
@@ -0,0 +1,94 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file iterators_fn_imps.hpp
+ * Contains an implementation class for left_child_next_sibling_heap_.
+ */
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::iterator
+PB_DS_CLASS_C_DEC::
+begin()
+{
+  node_pointer p_nd = m_p_root;
+
+  if (p_nd == NULL)
+    return (iterator(NULL));
+
+  while (p_nd->m_p_l_child != NULL)
+    p_nd = p_nd->m_p_l_child;
+
+  return (iterator(p_nd));
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::const_iterator
+PB_DS_CLASS_C_DEC::
+begin() const
+{
+  node_pointer p_nd = m_p_root;
+
+  if (p_nd == NULL)
+    return (const_iterator(NULL));
+
+  while (p_nd->m_p_l_child != NULL)
+    p_nd = p_nd->m_p_l_child;
+
+  return (const_iterator(p_nd));
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::iterator
+PB_DS_CLASS_C_DEC::
+end()
+{
+  return (iterator(NULL));
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::const_iterator
+PB_DS_CLASS_C_DEC::
+end() const
+{
+  return (const_iterator(NULL));
+}
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/left_child_next_sibling_heap_/left_child_next_sibling_heap_.hpp b/libstdc++-v3/include/ext/pb_ds/detail/left_child_next_sibling_heap_/left_child_next_sibling_heap_.hpp
new file mode 100644
index 00000000000..411c4f28b14
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/left_child_next_sibling_heap_/left_child_next_sibling_heap_.hpp
@@ -0,0 +1,380 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file left_child_next_sibling_heap_.hpp
+ * Contains an implementation class for a basic heap.
+ */
+
+#ifndef PB_DS_LEFT_CHILD_NEXT_SIBLING_HEAP_HPP
+#define PB_DS_LEFT_CHILD_NEXT_SIBLING_HEAP_HPP
+
+/*
+ * Based on CLRS.
+ */
+
+#include <iterator>
+#include <ext/pb_ds/detail/cond_dealtor.hpp>
+#include <ext/pb_ds/detail/type_utils.hpp>
+#include <ext/pb_ds/detail/left_child_next_sibling_heap_/node.hpp>
+#include <ext/pb_ds/detail/left_child_next_sibling_heap_/const_point_iterator.hpp>
+#include <ext/pb_ds/detail/left_child_next_sibling_heap_/const_iterator.hpp>
+#ifdef PB_DS_LC_NS_HEAP_TRACE_
+#include <iostream>
+#endif // #ifdef PB_DS_LC_NS_HEAP_TRACE_
+
+namespace pb_ds
+{
+  namespace detail
+  {
+
+#ifdef PB_DS_LC_NS_HEAP_DEBUG_
+#define PB_DS_DBG_ASSERT(X) assert(X)
+#define PB_DS_DBG_VERIFY(X) assert(X)
+#define PB_DS_DBG_ONLY(X) X
+#else // #ifdef PB_DS_LC_NS_HEAP_DEBUG_
+#define PB_DS_DBG_ASSERT(X)
+#define PB_DS_DBG_VERIFY(X) {if((X)==0);}
+#define PB_DS_DBG_ONLY(X) ;
+#endif // #ifdef PB_DS_LC_NS_HEAP_DEBUG_
+
+#ifdef PB_DS_LC_NS_HEAP_DEBUG_
+#define PB_DS_CLASS_T_DEC						\
+    template<								\
+						typename Value_Type,	\
+						class Cmp_Fn,		\
+						typename Node_Metadata,	\
+						class Allocator,	\
+						bool Single_Link_Roots>
+#else // #ifdef PB_DS_LC_NS_HEAP_DEBUG_
+#define PB_DS_CLASS_T_DEC						\
+    template<								\
+						typename Value_Type,	\
+						class Cmp_Fn,		\
+						typename Node_Metadata,	\
+						class Allocator>
+#endif // #ifdef PB_DS_LC_NS_HEAP_DEBUG_
+
+#ifdef PB_DS_LC_NS_HEAP_DEBUG_
+#define PB_DS_CLASS_C_DEC						\
+    left_child_next_sibling_heap_<					\
+							Value_Type,	\
+							Cmp_Fn,		\
+							Node_Metadata,	\
+							Allocator,	\
+							Single_Link_Roots>
+#else // #ifdef PB_DS_LC_NS_HEAP_DEBUG_
+#define PB_DS_CLASS_C_DEC						\
+    left_child_next_sibling_heap_<					\
+							Value_Type,	\
+							Cmp_Fn,		\
+							Node_Metadata,	\
+							Allocator>
+#endif // #ifdef PB_DS_LC_NS_HEAP_DEBUG_
+
+    /**
+     * class description = "Base class for some types of h3ap$">
+     **/
+#ifdef PB_DS_LC_NS_HEAP_DEBUG_
+    template<typename Value_Type,
+	     class Cmp_Fn,
+	     typename Node_Metadata,
+	     class Allocator,
+	     bool Single_Link_Roots>
+#else // #ifdef PB_DS_LC_NS_HEAP_DEBUG_
+    template<typename Value_Type,
+	     class Cmp_Fn,
+	     typename Node_Metadata,
+	     class Allocator>
+#endif // #ifdef PB_DS_LC_NS_HEAP_DEBUG_
+    class left_child_next_sibling_heap_ : public Cmp_Fn
+    {
+
+    protected:
+      typedef
+      typename Allocator::template rebind<
+      left_child_next_sibling_heap_node_<
+      Value_Type,
+      Node_Metadata,
+      Allocator> >::other
+      node_allocator;
+
+      typedef typename node_allocator::value_type node;
+
+      typedef typename node_allocator::pointer node_pointer;
+
+      typedef typename node_allocator::const_pointer const_node_pointer;
+
+      typedef Node_Metadata node_metadata;
+
+      typedef std::pair< node_pointer, node_pointer> node_pointer_pair;
+
+    private:
+      typedef cond_dealtor< node, Allocator> cond_dealtor_t;
+
+      enum
+	{
+	  simple_value = is_simple<
+	  Value_Type>::value
+	};
+
+      typedef integral_constant<int, simple_value> no_throw_copies_t;
+
+    public:
+
+      typedef typename Allocator::size_type size_type;
+
+      typedef typename Allocator::difference_type difference_type;
+
+      typedef Value_Type value_type;
+
+      typedef
+      typename Allocator::template rebind<
+	value_type>::other::pointer
+      pointer;
+
+      typedef
+      typename Allocator::template rebind<
+	value_type>::other::const_pointer
+      const_pointer;
+
+      typedef
+      typename Allocator::template rebind<
+	value_type>::other::reference
+      reference;
+
+      typedef
+      typename Allocator::template rebind<
+	value_type>::other::const_reference
+      const_reference;
+
+      typedef
+      left_child_next_sibling_heap_node_const_point_iterator_<
+	node,
+	Allocator>
+      const_point_iterator;
+
+      typedef const_point_iterator point_iterator;
+
+      typedef
+      left_child_next_sibling_heap_const_iterator_<
+	node,
+	Allocator>
+      const_iterator;
+
+      typedef const_iterator iterator;
+
+      typedef Cmp_Fn cmp_fn;
+
+      typedef Allocator allocator;
+
+    public:
+
+      left_child_next_sibling_heap_();
+
+      left_child_next_sibling_heap_(const Cmp_Fn& r_cmp_fn);
+
+      left_child_next_sibling_heap_(const PB_DS_CLASS_C_DEC& other);
+
+      void
+      swap(PB_DS_CLASS_C_DEC& other);
+
+      ~left_child_next_sibling_heap_();
+
+      inline bool
+      empty() const;
+
+      inline size_type
+      size() const;
+
+      inline size_type
+      max_size() const;
+
+      Cmp_Fn& 
+      get_cmp_fn();
+
+      const Cmp_Fn& 
+      get_cmp_fn() const;
+
+      inline iterator
+      begin();
+
+      inline const_iterator
+      begin() const;
+
+      inline iterator
+      end();
+
+      inline const_iterator
+      end() const;
+
+      void
+      clear();
+
+#ifdef PB_DS_LC_NS_HEAP_TRACE_
+
+      void
+      trace() const;
+
+#endif // #ifdef PB_DS_LC_NS_HEAP_TRACE_
+
+    protected:
+
+      inline node_pointer
+      get_new_node_for_insert(const_reference r_val);
+
+      inline static void
+      make_child_of(node_pointer p_nd, node_pointer p_new_parent);
+
+      void
+      value_swap(PB_DS_CLASS_C_DEC& other);
+
+      inline static node_pointer
+      parent(node_pointer p_nd);
+
+      inline void
+      swap_with_parent(node_pointer p_nd, node_pointer p_parent);
+
+      void
+      bubble_to_top(node_pointer p_nd);
+
+      inline void
+      actual_erase_node(node_pointer p_nd);
+
+      void
+      clear_imp(node_pointer p_nd);
+
+      void
+      to_linked_list();
+
+      template<typename Pred>
+      node_pointer
+      prune(Pred pred);
+
+#ifdef PB_DS_LC_NS_HEAP_DEBUG_
+
+      void
+      assert_valid() const;
+
+      void
+      assert_node_consistent(const_node_pointer p_nd, bool single_link) const;
+
+      static size_type
+      size_under_node(const_node_pointer p_nd);
+
+      static size_type
+      degree(const_node_pointer p_nd);
+
+#endif // #ifdef PB_DS_LC_NS_HEAP_DEBUG_
+
+#ifdef PB_DS_LC_NS_HEAP_TRACE_
+
+      static void
+      trace_node(const_node_pointer, size_type level);
+
+#endif // #ifdef PB_DS_LC_NS_HEAP_TRACE_
+
+    protected:
+      node_pointer m_p_root;
+
+      size_type m_size;
+
+    private:
+#ifdef PB_DS_LC_NS_HEAP_DEBUG_
+
+      void
+      assert_iterators() const;
+
+      void
+      assert_size() const;
+
+      static size_type
+      size_from_node(const_node_pointer p_nd);
+
+#endif // #ifdef PB_DS_LC_NS_HEAP_DEBUG_
+
+      node_pointer
+      recursive_copy_node(const_node_pointer p_nd);
+
+      inline node_pointer
+      get_new_node_for_insert(const_reference r_val, false_type);
+
+      inline node_pointer
+      get_new_node_for_insert(const_reference r_val, true_type);
+
+#ifdef PB_DS_LC_NS_HEAP_TRACE_
+
+      template<typename Metadata_>
+      static void
+      trace_node_metadata(const_node_pointer p_nd, type_to_type<Metadata_>);
+
+      static void
+      trace_node_metadata(const_node_pointer, type_to_type<null_left_child_next_sibling_heap_node_metadata>);
+
+#endif // #ifdef PB_DS_LC_NS_HEAP_TRACE_
+
+    private:
+      static node_allocator s_node_allocator;
+
+      static no_throw_copies_t s_no_throw_copies_ind;
+    };
+
+#include <ext/pb_ds/detail/left_child_next_sibling_heap_/constructors_destructor_fn_imps.hpp>
+#include <ext/pb_ds/detail/left_child_next_sibling_heap_/iterators_fn_imps.hpp>
+#include <ext/pb_ds/detail/left_child_next_sibling_heap_/debug_fn_imps.hpp>
+#include <ext/pb_ds/detail/left_child_next_sibling_heap_/trace_fn_imps.hpp>
+#include <ext/pb_ds/detail/left_child_next_sibling_heap_/insert_fn_imps.hpp>
+#include <ext/pb_ds/detail/left_child_next_sibling_heap_/erase_fn_imps.hpp>
+#include <ext/pb_ds/detail/left_child_next_sibling_heap_/info_fn_imps.hpp>
+#include <ext/pb_ds/detail/left_child_next_sibling_heap_/policy_access_fn_imps.hpp>
+
+#undef PB_DS_CLASS_C_DEC
+
+#undef PB_DS_CLASS_T_DEC
+
+#undef PB_DS_DBG_ASSERT
+#undef PB_DS_DBG_VERIFY
+#undef PB_DS_DBG_ONLY
+
+  } // namespace detail
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_LEFT_CHILD_NEXT_SIBLING_HEAP_HPP
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/left_child_next_sibling_heap_/node.hpp b/libstdc++-v3/include/ext/pb_ds/detail/left_child_next_sibling_heap_/node.hpp
new file mode 100644
index 00000000000..e3460add5ee
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/left_child_next_sibling_heap_/node.hpp
@@ -0,0 +1,129 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file node.hpp
+ * Contains an implementation struct for this type of heap's node.
+ */
+
+#ifndef PB_DS_LEFT_CHILD_NEXT_SIBLING_HEAP_NODE_HPP
+#define PB_DS_LEFT_CHILD_NEXT_SIBLING_HEAP_NODE_HPP
+
+#include <ext/pb_ds/detail/left_child_next_sibling_heap_/null_metadata.hpp>
+
+namespace pb_ds
+{
+  namespace detail
+  {
+
+    template<typename Value_Type, typename Metadata_Type, class Allocator>
+    struct left_child_next_sibling_heap_node_
+    {
+    private:
+      typedef
+      left_child_next_sibling_heap_node_<
+      Value_Type,
+      Metadata_Type,
+      Allocator>
+      this_type;
+
+    public:
+      typedef typename Allocator::size_type size_type;
+
+      typedef
+      typename Allocator::template rebind<
+	this_type>::other::pointer
+      node_pointer;
+
+      typedef Value_Type value_type;
+
+      typedef Metadata_Type metadata_type;
+
+    public:
+      value_type m_value;
+
+      metadata_type m_metadata;
+
+      node_pointer m_p_l_child;
+
+      node_pointer m_p_next_sibling;
+
+      node_pointer m_p_prev_or_parent;
+    };
+
+    template<typename Value_Type, class Allocator>
+    struct left_child_next_sibling_heap_node_<
+      Value_Type,
+      null_left_child_next_sibling_heap_node_metadata,
+      Allocator>
+    {
+    private:
+      typedef
+      left_child_next_sibling_heap_node_<
+      Value_Type,
+      null_left_child_next_sibling_heap_node_metadata,
+      Allocator>
+      this_type;
+
+    public:
+      typedef typename Allocator::size_type size_type;
+
+      typedef
+      typename Allocator::template rebind<
+	this_type>::other::pointer
+      node_pointer;
+
+      typedef Value_Type value_type;
+
+    public:
+      value_type m_value;
+
+      node_pointer m_p_l_child;
+
+      node_pointer m_p_next_sibling;
+
+      node_pointer m_p_prev_or_parent;
+    };
+
+  } // namespace detail
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_LEFT_CHILD_NEXT_SIBLING_HEAP_NODE_HPP
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/left_child_next_sibling_heap_/null_metadata.hpp b/libstdc++-v3/include/ext/pb_ds/detail/left_child_next_sibling_heap_/null_metadata.hpp
new file mode 100644
index 00000000000..1716fd1aa64
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/left_child_next_sibling_heap_/null_metadata.hpp
@@ -0,0 +1,63 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file null_metadata.hpp
+ * Contains an implementation struct for this type of heap's node.
+ */
+
+#ifndef PB_DS_LEFT_CHILD_NEXT_SIBLING_HEAP_NULL_METADATA_HPP
+#define PB_DS_LEFT_CHILD_NEXT_SIBLING_HEAP_NULL_METADATA_HPP
+
+#include <ext/pb_ds/detail/left_child_next_sibling_heap_/null_metadata.hpp>
+
+namespace pb_ds
+{
+  namespace detail
+  {
+
+    struct null_left_child_next_sibling_heap_node_metadata
+    { };
+
+  } // namespace detail
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_LEFT_CHILD_NEXT_SIBLING_HEAP_NULL_METADATA_HPP
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/left_child_next_sibling_heap_/policy_access_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/left_child_next_sibling_heap_/policy_access_fn_imps.hpp
new file mode 100644
index 00000000000..b7503c2caf4
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/left_child_next_sibling_heap_/policy_access_fn_imps.hpp
@@ -0,0 +1,62 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file policy_access_fn_imps.hpp
+ * Contains an implementation class for left_child_next_sibling_heap_.
+ */
+
+PB_DS_CLASS_T_DEC
+Cmp_Fn& 
+PB_DS_CLASS_C_DEC::
+get_cmp_fn()
+{
+  return (*this);
+}
+
+PB_DS_CLASS_T_DEC
+const Cmp_Fn& 
+PB_DS_CLASS_C_DEC::
+get_cmp_fn() const
+{
+  return (*this);
+}
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/left_child_next_sibling_heap_/trace_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/left_child_next_sibling_heap_/trace_fn_imps.hpp
new file mode 100644
index 00000000000..5c0d9acc11d
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/left_child_next_sibling_heap_/trace_fn_imps.hpp
@@ -0,0 +1,101 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file trace_fn_imps.hpp
+ * Contains an implementation class for left_child_next_sibling_heap_.
+ */
+
+#ifdef PB_DS_LC_NS_HEAP_TRACE_
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+trace() const
+{
+  std::cerr << std::endl;
+
+  trace_node(m_p_root, 0);
+
+  std::cerr << std::endl;
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+trace_node(const_node_pointer p_nd, size_type level)
+{
+  while (p_nd != NULL)
+    {
+      for (size_type i = 0; i < level; ++i)
+	std::cerr << ' ';
+
+      std::cerr << p_nd <<
+	" prev = " << p_nd->m_p_prev_or_parent <<
+	" next " << p_nd->m_p_next_sibling <<
+	" left = " << p_nd->m_p_l_child << " ";
+
+      trace_node_metadata(p_nd, type_to_type<node_metadata>());
+
+      std::cerr << p_nd->m_value << std::endl;
+
+      trace_node(p_nd->m_p_l_child, level + 1);
+
+      p_nd = p_nd->m_p_next_sibling;
+    }
+}
+
+PB_DS_CLASS_T_DEC
+template<typename Metadata_>
+void
+PB_DS_CLASS_C_DEC::
+trace_node_metadata(const_node_pointer p_nd, type_to_type<Metadata_>)
+{
+  std::cerr << "(" << p_nd->m_metadata << ") ";
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+trace_node_metadata(const_node_pointer, type_to_type<null_left_child_next_sibling_heap_node_metadata>)
+{ }
+
+#endif // #ifdef PB_DS_LC_NS_HEAP_TRACE_
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/list_update_map_/constructor_destructor_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/list_update_map_/constructor_destructor_fn_imps.hpp
new file mode 100644
index 00000000000..b9cc9dd81c6
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/list_update_map_/constructor_destructor_fn_imps.hpp
@@ -0,0 +1,165 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file constructor_destructor_fn_imps.hpp
+ * Contains implementations of PB_DS_CLASS_NAME.
+ */
+
+PB_DS_CLASS_T_DEC
+typename PB_DS_CLASS_C_DEC::entry_allocator
+PB_DS_CLASS_C_DEC::s_entry_allocator;
+
+PB_DS_CLASS_T_DEC
+Eq_Fn PB_DS_CLASS_C_DEC::s_eq_fn;
+
+PB_DS_CLASS_T_DEC
+null_lu_metadata PB_DS_CLASS_C_DEC::s_null_lu_metadata;
+
+PB_DS_CLASS_T_DEC
+Update_Policy PB_DS_CLASS_C_DEC::s_update_policy;
+
+PB_DS_CLASS_T_DEC
+type_to_type<
+  typename PB_DS_CLASS_C_DEC::update_metadata> PB_DS_CLASS_C_DEC::s_metadata_type_indicator;
+
+PB_DS_CLASS_T_DEC
+template<typename It>
+void
+PB_DS_CLASS_C_DEC::
+copy_from_range(It first_it, It last_it)
+{
+  while (first_it != last_it)
+    insert(*(first_it++));
+}
+
+PB_DS_CLASS_T_DEC
+PB_DS_CLASS_C_DEC::
+PB_DS_CLASS_NAME() :
+  m_p_l(NULL)
+{
+  PB_DS_DBG_ONLY(assert_valid();)
+    }
+
+PB_DS_CLASS_T_DEC
+template<typename It>
+PB_DS_CLASS_C_DEC::
+PB_DS_CLASS_NAME(It first_it, It last_it) :
+  m_p_l(NULL)
+{
+  copy_from_range(first_it, last_it);
+
+  PB_DS_DBG_ONLY(assert_valid(););
+}
+
+PB_DS_CLASS_T_DEC
+PB_DS_CLASS_C_DEC::
+PB_DS_CLASS_NAME(const PB_DS_CLASS_C_DEC& other) :
+#ifdef PB_DS_LU_MAP_DEBUG_
+  PB_DS_MAP_DEBUG_BASE_C_DEC(),
+#endif // #ifdef PB_DS_LU_MAP_DEBUG_
+  m_p_l(NULL)
+{
+  try
+    {
+
+      for (const_iterator it = other.begin(); it != other.end(); ++it)
+        {
+	  entry_pointer p_l =
+	    allocate_new_entry(                   * it,  PB_DS_TYPES_TRAITS_C_DEC::m_no_throw_copies_indicator);
+
+	  p_l->m_p_next = m_p_l;
+
+	  m_p_l = p_l;
+        }
+    }
+  catch(...)
+    {
+      deallocate_all();
+
+      throw;
+    }
+
+  PB_DS_DBG_ONLY(assert_valid();)
+    }
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+swap(PB_DS_CLASS_C_DEC& other)
+{
+  PB_DS_DBG_ONLY(assert_valid();)
+    PB_DS_DBG_ONLY(other.assert_valid();)
+
+    PB_DS_DBG_ONLY(map_debug_base::swap(other);)
+
+    std::swap(m_p_l, other.m_p_l);
+
+  PB_DS_DBG_ONLY(assert_valid();)
+    PB_DS_DBG_ONLY(other.assert_valid();)
+    }
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+deallocate_all()
+{
+  entry_pointer p_l = m_p_l;
+
+  while (p_l != NULL)
+    {
+      entry_pointer p_next_l = p_l->m_p_next;
+
+      actual_erase_entry(p_l);
+
+      p_l = p_next_l;
+    }
+
+  m_p_l = NULL;
+}
+
+PB_DS_CLASS_T_DEC
+PB_DS_CLASS_C_DEC::
+~PB_DS_CLASS_NAME()
+{
+  deallocate_all();
+}
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/list_update_map_/debug_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/list_update_map_/debug_fn_imps.hpp
new file mode 100644
index 00000000000..a48c17db804
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/list_update_map_/debug_fn_imps.hpp
@@ -0,0 +1,66 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file debug_fn_imps.hpp
+ * Contains implementations of cc_ht_map_'s debug-mode functions.
+ */
+
+#ifdef PB_DS_LU_MAP_DEBUG_
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+assert_valid() const
+{
+  size_type calc_size = 0;
+
+  for (const_iterator it = begin(); it != end(); ++it)
+    {
+      map_debug_base::check_key_exists(PB_DS_V2F(*it));
+
+      ++calc_size;
+    }
+
+  map_debug_base::check_size(calc_size);
+}
+
+#endif // #ifdef PB_DS_LU_MAP_DEBUG_
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/list_update_map_/entry_metadata_base.hpp b/libstdc++-v3/include/ext/pb_ds/detail/list_update_map_/entry_metadata_base.hpp
new file mode 100644
index 00000000000..41a493dd776
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/list_update_map_/entry_metadata_base.hpp
@@ -0,0 +1,66 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file entry_metadata_base.hpp
+ * Contains an implementation for a list update map.
+ */
+
+#ifndef PB_DS_LU_MAP_ENTRY_METADATA_BASE_HPP
+#define PB_DS_LU_MAP_ENTRY_METADATA_BASE_HPP
+
+namespace pb_ds
+{
+  namespace detail
+  {
+    template<typename Metadata>
+    struct lu_map_entry_metadata_base
+    {
+      Metadata m_update_metadata;
+    };
+    
+    template<>
+    struct lu_map_entry_metadata_base<null_lu_metadata>
+    { };  
+  } // namespace detail
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_LU_MAP_ENTRY_METADATA_BASE_HPP
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/list_update_map_/erase_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/list_update_map_/erase_fn_imps.hpp
new file mode 100644
index 00000000000..5800540b2cb
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/list_update_map_/erase_fn_imps.hpp
@@ -0,0 +1,162 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file erase_fn_imps.hpp
+ * Contains implementations of lu_map_.
+ */
+
+PB_DS_CLASS_T_DEC
+inline bool
+PB_DS_CLASS_C_DEC::
+erase(const_key_reference r_key)
+{
+  PB_DS_DBG_ONLY(PB_DS_CLASS_C_DEC::assert_valid();)
+
+    if (m_p_l == NULL)
+      return false;
+
+  if (s_eq_fn(r_key, PB_DS_V2F(m_p_l->m_value)))
+    {
+      entry_pointer p_next = m_p_l->m_p_next;
+
+      actual_erase_entry(m_p_l);
+
+      m_p_l = p_next;
+
+      return true;
+    }
+
+  entry_pointer p_l = m_p_l;
+
+  while (p_l->m_p_next != NULL)
+    if (s_eq_fn(r_key, PB_DS_V2F(p_l->m_p_next->m_value)))
+      {
+	erase_next(p_l);
+
+	return true;
+      }
+    else
+      p_l = p_l->m_p_next;
+
+  return false;
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+clear()
+{
+  deallocate_all();
+}
+
+PB_DS_CLASS_T_DEC
+template<typename Pred>
+inline typename PB_DS_CLASS_C_DEC::size_type
+PB_DS_CLASS_C_DEC::
+erase_if(Pred pred)
+{
+  PB_DS_DBG_ONLY(PB_DS_CLASS_C_DEC::assert_valid();)
+
+    size_type num_ersd = 0;
+
+  while (m_p_l != NULL&&  pred(m_p_l->m_value))
+    {
+      entry_pointer p_next = m_p_l->m_p_next;
+
+      ++num_ersd;
+
+      actual_erase_entry(m_p_l);
+
+      m_p_l = p_next;
+    }
+
+  if (m_p_l == NULL)
+    return num_ersd;
+
+  entry_pointer p_l = m_p_l;
+
+  while (p_l->m_p_next != NULL)
+    {
+      if (pred(p_l->m_p_next->m_value))
+        {
+	  ++num_ersd;
+
+	  erase_next(p_l);
+        }
+      else
+	p_l = p_l->m_p_next;
+    }
+
+  PB_DS_DBG_ONLY(PB_DS_CLASS_C_DEC::assert_valid();)
+
+    return (num_ersd);
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+erase_next(entry_pointer p_l)
+{
+  PB_DS_DBG_ASSERT(p_l != NULL);
+  PB_DS_DBG_ASSERT(p_l != m_p_l);
+  PB_DS_DBG_ASSERT(p_l->m_p_next != NULL);
+
+  entry_pointer p_next_l = p_l->m_p_next->m_p_next;
+
+  actual_erase_entry(p_l->m_p_next);
+
+  p_l->m_p_next = p_next_l;
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+actual_erase_entry(entry_pointer p_l)
+{
+  PB_DS_DBG_ONLY(map_debug_base::erase_existing(
+						PB_DS_V2F(p_l->m_value));)
+
+    p_l->~entry();
+
+  s_entry_allocator.deallocate(p_l, 1);
+}
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/list_update_map_/find_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/list_update_map_/find_fn_imps.hpp
new file mode 100644
index 00000000000..ce8d995b212
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/list_update_map_/find_fn_imps.hpp
@@ -0,0 +1,110 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file find_fn_imps.hpp
+ * Contains implementations of lu_map_.
+ */
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::entry_pointer
+PB_DS_CLASS_C_DEC::
+find_imp(const_key_reference r_key) const
+{
+  if (m_p_l == NULL)
+    return NULL;
+
+  if (s_eq_fn(r_key, PB_DS_V2F(m_p_l->m_value)))
+    {
+      apply_update(m_p_l, s_metadata_type_indicator);
+
+      PB_DS_DBG_ONLY(map_debug_base::check_key_exists(r_key);)
+
+        return m_p_l;
+    }
+
+  entry_pointer p_l = m_p_l;
+
+  while (p_l->m_p_next != NULL)
+    {
+      entry_pointer p_next = p_l->m_p_next;
+
+      if (s_eq_fn(r_key, PB_DS_V2F(p_next->m_value)))
+        {
+	  if (apply_update(p_next, s_metadata_type_indicator))
+            {
+	      p_l->m_p_next = p_next->m_p_next;
+
+	      p_next->m_p_next = m_p_l;
+
+	      m_p_l = p_next;
+
+	      return m_p_l;
+            }
+
+	  return p_next;
+        }
+      else
+	p_l = p_next;
+    }
+
+  PB_DS_DBG_ONLY(map_debug_base::check_key_does_not_exist(r_key);)
+
+    return NULL;
+}
+
+PB_DS_CLASS_T_DEC
+template<typename Metadata>
+inline bool
+PB_DS_CLASS_C_DEC::
+apply_update(entry_pointer p_l, type_to_type<Metadata>)
+{
+  return s_update_policy(p_l->m_update_metadata);
+}
+
+PB_DS_CLASS_T_DEC
+inline bool
+PB_DS_CLASS_C_DEC::
+apply_update(entry_pointer, type_to_type<null_lu_metadata>)
+{
+  return s_update_policy(s_null_lu_metadata);
+}
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/list_update_map_/info_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/list_update_map_/info_fn_imps.hpp
new file mode 100644
index 00000000000..56bc9bebb18
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/list_update_map_/info_fn_imps.hpp
@@ -0,0 +1,69 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file info_fn_imps.hpp
+ * Contains implementations of lu_map_.
+ */
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::size_type
+PB_DS_CLASS_C_DEC::
+size() const
+{
+  return (std::distance(begin(), end()));
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::size_type
+PB_DS_CLASS_C_DEC::
+max_size() const
+{
+  return (s_entry_allocator.max_size());
+}
+
+PB_DS_CLASS_T_DEC
+inline bool
+PB_DS_CLASS_C_DEC::
+empty() const
+{
+  return (m_p_l == NULL);
+}
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/list_update_map_/insert_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/list_update_map_/insert_fn_imps.hpp
new file mode 100644
index 00000000000..ad42590c408
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/list_update_map_/insert_fn_imps.hpp
@@ -0,0 +1,134 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file insert_fn_imps.hpp
+ * Contains implementations of lu_map_.
+ */
+
+PB_DS_CLASS_T_DEC
+inline std::pair<
+  typename PB_DS_CLASS_C_DEC::point_iterator,
+  bool>
+PB_DS_CLASS_C_DEC::
+insert(const_reference r_val)
+{
+  PB_DS_DBG_ONLY(assert_valid();)
+
+    entry_pointer p_l = find_imp(PB_DS_V2F(r_val));
+
+  if (p_l != NULL)
+    {
+      PB_DS_DBG_ONLY(map_debug_base::check_key_exists(
+						      PB_DS_V2F(r_val));)
+
+        return std::make_pair(point_iterator(&p_l->m_value), false);
+    }
+
+  PB_DS_DBG_ONLY(map_debug_base::check_key_does_not_exist(
+							  PB_DS_V2F(r_val));)
+
+    p_l = allocate_new_entry(r_val, PB_DS_TYPES_TRAITS_C_DEC::m_no_throw_copies_indicator);
+
+  p_l->m_p_next = m_p_l;
+
+  m_p_l = p_l;
+
+  PB_DS_DBG_ONLY(assert_valid();)
+
+    return std::make_pair(point_iterator(&p_l->m_value), true);
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::entry_pointer
+PB_DS_CLASS_C_DEC::
+allocate_new_entry(const_reference r_val, false_type)
+{
+  entry_pointer p_l = s_entry_allocator.allocate(1);
+
+  cond_dealtor_t cond(p_l);
+
+  new (const_cast<void* >(
+			  static_cast<const void* >(&p_l->m_value)))
+    value_type(r_val);
+
+  cond.set_no_action();
+
+  PB_DS_DBG_ONLY(map_debug_base::insert_new(
+					    PB_DS_V2F(r_val));)
+
+    init_entry_metadata(p_l, s_metadata_type_indicator);
+
+  return p_l;
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::entry_pointer
+PB_DS_CLASS_C_DEC::
+allocate_new_entry(const_reference    r_val, true_type)
+{
+  entry_pointer p_l = s_entry_allocator.allocate(1);
+
+  new (&p_l->m_value) value_type(r_val);
+
+  PB_DS_DBG_ONLY(map_debug_base::insert_new(
+					    PB_DS_V2F(r_val));)
+
+    init_entry_metadata(p_l, s_metadata_type_indicator);
+
+  return p_l;
+}
+
+PB_DS_CLASS_T_DEC
+template<typename Metadata>
+inline void
+PB_DS_CLASS_C_DEC::
+init_entry_metadata(entry_pointer p_l, type_to_type<Metadata>)
+{
+  new (&p_l->m_update_metadata) Metadata(s_update_policy());
+}
+
+PB_DS_CLASS_T_DEC
+inline void
+PB_DS_CLASS_C_DEC::
+init_entry_metadata(entry_pointer, type_to_type<null_lu_metadata>)
+{ }
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/list_update_map_/iterators_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/list_update_map_/iterators_fn_imps.hpp
new file mode 100644
index 00000000000..3c76377aa45
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/list_update_map_/iterators_fn_imps.hpp
@@ -0,0 +1,94 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file iterators_fn_imps.hpp
+ * Contains implementations of lu_map_.
+ */
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::iterator
+PB_DS_CLASS_C_DEC::
+begin()
+{
+  if (m_p_l == NULL)
+    {
+      PB_DS_DBG_ASSERT(empty());
+
+      return (end());
+    }
+
+  return (iterator(&m_p_l->m_value, m_p_l, this));
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::const_iterator
+PB_DS_CLASS_C_DEC::
+begin() const
+{
+  if (m_p_l == NULL)
+    {
+      PB_DS_DBG_ASSERT(empty());
+
+      return (end());
+    }
+
+  return (iterator(&m_p_l->m_value, m_p_l,
+		   const_cast<PB_DS_CLASS_C_DEC* >(this)));
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::iterator
+PB_DS_CLASS_C_DEC::
+end()
+{
+  return (iterator(NULL, NULL, this));
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::const_iterator
+PB_DS_CLASS_C_DEC::
+end() const
+{
+  return (const_iterator(NULL, NULL,
+			 const_cast<PB_DS_CLASS_C_DEC* const>(this)));
+}
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/list_update_map_/lu_map_.hpp b/libstdc++-v3/include/ext/pb_ds/detail/list_update_map_/lu_map_.hpp
new file mode 100644
index 00000000000..5451f56ae09
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/list_update_map_/lu_map_.hpp
@@ -0,0 +1,500 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file lu_map_.hpp
+ * Contains a list update map.
+ */
+
+#include <utility>
+#include <iterator>
+#include <ext/pb_ds/detail/cond_dealtor.hpp>
+#include <ext/pb_ds/tag_and_trait.hpp>
+#include <ext/pb_ds/detail/types_traits.hpp>
+#include <ext/pb_ds/detail/list_update_map_/entry_metadata_base.hpp>
+#include <ext/pb_ds/exception.hpp>
+#ifdef PB_DS_LU_MAP_DEBUG_
+#include <ext/pb_ds/detail/map_debug_base.hpp>
+#endif // #ifdef PB_DS_LU_MAP_DEBUG_
+#ifdef PB_DS_LU_MAP_TRACE_
+#include <iostream>
+#endif // PB_DS_LU_MAP_TRACE_
+
+namespace pb_ds
+{
+  namespace detail
+  {
+
+#ifdef PB_DS_LU_MAP_DEBUG_
+#define PB_DS_DBG_ASSERT(X) assert(X)
+#define PB_DS_DBG_VERIFY(X) assert(X)
+#define PB_DS_DBG_ONLY(X) X
+#else // #ifdef PB_DS_LU_MAP_DEBUG_
+#define PB_DS_DBG_ASSERT(X)
+#define PB_DS_DBG_VERIFY(X) {if((X)==0);}
+#define PB_DS_DBG_ONLY(X) ;
+#endif // #ifdef PB_DS_LU_MAP_DEBUG_
+
+#define PB_DS_CLASS_T_DEC						\
+    template<								\
+						typename Key,		\
+						typename Mapped,	\
+						class Eq_Fn,		\
+						class Allocator,	\
+						class Update_Policy>
+
+#ifdef PB_DS_DATA_TRUE_INDICATOR
+#define PB_DS_CLASS_NAME			\
+    lu_map_data_
+#endif // #ifdef PB_DS_DATA_TRUE_INDICATOR
+
+#ifdef PB_DS_DATA_FALSE_INDICATOR
+#define PB_DS_CLASS_NAME			\
+    lu_map_no_data_
+#endif // #ifdef PB_DS_DATA_FALSE_INDICATOR
+
+#define PB_DS_CLASS_C_DEC					\
+    PB_DS_CLASS_NAME<						\
+						Key,		\
+						Mapped,		\
+						Eq_Fn,		\
+						Allocator,	\
+						Update_Policy>
+
+#define PB_DS_TYPES_TRAITS_C_DEC				\
+    types_traits<				\
+						Key,		\
+						Mapped,		\
+						Allocator,	\
+						false>
+
+#ifdef PB_DS_USE_MAP_DEBUG_BASE
+#define PB_DS_MAP_DEBUG_BASE_C_DEC					\
+    map_debug_base<					\
+									Key, \
+									Eq_Fn, \
+									typename Allocator::template rebind< \
+													     Key>::other::const_reference>
+#endif // #ifdef PB_DS_USE_MAP_DEBUG_BASE
+
+#ifdef PB_DS_DATA_TRUE_INDICATOR
+#define PB_DS_V2F(X) (X).first
+#define PB_DS_V2S(X) (X).second
+#define PB_DS_EP2VP(X)& ((X)->m_value)
+#endif // #ifdef PB_DS_DATA_TRUE_INDICATOR
+
+#ifdef PB_DS_DATA_FALSE_INDICATOR
+#define PB_DS_V2F(X) (X)
+#define PB_DS_V2S(X) Mapped_Data()
+#define PB_DS_EP2VP(X)& ((X)->m_value.first)
+#endif // #ifdef PB_DS_DATA_FALSE_INDICATOR
+
+#ifdef PB_DS_LU_MAP_DEBUG_
+#define PB_DS_DBG_ASSERT(X) assert(X)
+#define PB_DS_DBG_VERIFY(X) assert(X)
+#define PB_DS_DBG_ONLY(X) X
+#else // #ifdef PB_DS_LU_MAP_DEBUG_
+#define PB_DS_DBG_ASSERT(X)
+#define PB_DS_DBG_VERIFY(X) {if((X)==0);}
+#define PB_DS_DBG_ONLY(X) ;
+#endif // #ifdef PB_DS_LU_MAP_DEBUG_
+
+    /* Skip to the lu, my darling. */
+
+    // list-based (with updates) associative container.
+    template<typename Key,
+	     typename Mapped,
+	     class Eq_Fn,
+	     class Allocator,
+	     class Update_Policy>
+    class PB_DS_CLASS_NAME :
+#ifdef PB_DS_LU_MAP_DEBUG_
+      protected PB_DS_MAP_DEBUG_BASE_C_DEC,
+#endif // #ifdef PB_DS_LU_MAP_DEBUG_
+      public PB_DS_TYPES_TRAITS_C_DEC
+    {
+
+    private:
+
+      struct entry : public lu_map_entry_metadata_base<
+      typename Update_Policy::metadata_type>
+      {
+	typename PB_DS_TYPES_TRAITS_C_DEC::value_type m_value;
+
+	typename Allocator::template rebind<entry>::other::pointer m_p_next;
+      };
+
+      typedef
+      typename Allocator::template rebind<entry>::other
+      entry_allocator;
+
+      typedef typename entry_allocator::pointer entry_pointer;
+
+      typedef typename entry_allocator::const_pointer const_entry_pointer;
+
+      typedef typename entry_allocator::reference entry_reference;
+
+      typedef
+      typename entry_allocator::const_reference
+      const_entry_reference;
+
+      typedef
+      typename Allocator::template rebind<entry_pointer>::other
+      entry_pointer_allocator;
+
+      typedef typename entry_pointer_allocator::pointer entry_pointer_array;
+
+      typedef typename PB_DS_TYPES_TRAITS_C_DEC::value_type value_type_;
+
+      typedef typename PB_DS_TYPES_TRAITS_C_DEC::pointer pointer_;
+
+      typedef
+      typename PB_DS_TYPES_TRAITS_C_DEC::const_pointer
+      const_pointer_;
+
+      typedef typename PB_DS_TYPES_TRAITS_C_DEC::reference reference_;
+
+      typedef
+      typename PB_DS_TYPES_TRAITS_C_DEC::const_reference
+      const_reference_;
+
+#define PB_DS_GEN_POS entry_pointer
+
+#include <ext/pb_ds/detail/unordered_iterator/const_point_iterator.hpp>
+#include <ext/pb_ds/detail/unordered_iterator/point_iterator.hpp>
+#include <ext/pb_ds/detail/unordered_iterator/const_iterator.hpp>
+#include <ext/pb_ds/detail/unordered_iterator/iterator.hpp>
+
+#undef PB_DS_GEN_POS
+
+    public:
+
+      typedef typename Allocator::size_type size_type;
+
+      typedef typename Allocator::difference_type difference_type;
+
+      typedef Eq_Fn eq_fn;
+
+      typedef Allocator allocator;
+
+      typedef Update_Policy update_policy;
+
+      typedef typename Update_Policy::metadata_type update_metadata;
+
+      typedef typename PB_DS_TYPES_TRAITS_C_DEC::key_type key_type;
+
+      typedef typename PB_DS_TYPES_TRAITS_C_DEC::key_pointer key_pointer;
+
+      typedef
+      typename PB_DS_TYPES_TRAITS_C_DEC::const_key_pointer
+      const_key_pointer;
+
+      typedef typename PB_DS_TYPES_TRAITS_C_DEC::key_reference key_reference;
+
+      typedef
+      typename PB_DS_TYPES_TRAITS_C_DEC::const_key_reference
+      const_key_reference;
+
+      typedef typename PB_DS_TYPES_TRAITS_C_DEC::mapped_type mapped_type;
+
+      typedef
+      typename PB_DS_TYPES_TRAITS_C_DEC::mapped_pointer
+      mapped_pointer;
+
+      typedef
+      typename PB_DS_TYPES_TRAITS_C_DEC::const_mapped_pointer
+      const_mapped_pointer;
+
+      typedef
+      typename PB_DS_TYPES_TRAITS_C_DEC::mapped_reference
+      mapped_reference;
+
+      typedef
+      typename PB_DS_TYPES_TRAITS_C_DEC::const_mapped_reference
+      const_mapped_reference;
+
+      typedef typename PB_DS_TYPES_TRAITS_C_DEC::value_type value_type;
+
+      typedef typename PB_DS_TYPES_TRAITS_C_DEC::pointer pointer;
+
+      typedef typename PB_DS_TYPES_TRAITS_C_DEC::const_pointer const_pointer;
+
+      typedef typename PB_DS_TYPES_TRAITS_C_DEC::reference reference;
+
+      typedef
+      typename PB_DS_TYPES_TRAITS_C_DEC::const_reference
+      const_reference;
+
+#ifdef PB_DS_DATA_TRUE_INDICATOR
+      typedef point_iterator_ point_iterator;
+#endif // #ifdef PB_DS_DATA_TRUE_INDICATOR
+
+#ifdef PB_DS_DATA_FALSE_INDICATOR
+      typedef const_point_iterator_ point_iterator;
+#endif // #ifdef PB_DS_DATA_FALSE_INDICATOR
+
+      typedef const_point_iterator_ const_point_iterator;
+
+#ifdef PB_DS_DATA_TRUE_INDICATOR
+      typedef iterator_ iterator;
+#endif // #ifdef PB_DS_DATA_TRUE_INDICATOR
+
+#ifdef PB_DS_DATA_FALSE_INDICATOR
+      typedef const_iterator_ iterator;
+#endif // #ifdef PB_DS_DATA_FALSE_INDICATOR
+
+      typedef const_iterator_ const_iterator;
+
+    public:
+
+      PB_DS_CLASS_NAME();
+
+      PB_DS_CLASS_NAME(const PB_DS_CLASS_C_DEC& other);
+
+      virtual
+      ~PB_DS_CLASS_NAME();
+
+      template<typename It>
+      PB_DS_CLASS_NAME(It first_it, It last_it);
+
+      void
+      swap(PB_DS_CLASS_C_DEC& other);
+
+      inline size_type
+      size() const;
+
+      inline size_type
+      max_size() const;
+
+      inline bool
+      empty() const;
+
+      inline mapped_reference
+      operator[](const_key_reference r_key)
+      {
+#ifdef PB_DS_DATA_TRUE_INDICATOR
+	PB_DS_DBG_ONLY(assert_valid();)
+
+	  return insert(std::make_pair(r_key, mapped_type())).first->second;
+#else // #ifdef PB_DS_DATA_TRUE_INDICATOR
+	insert(r_key);
+
+	return (traits_base::s_null_mapped);
+#endif // #ifdef PB_DS_DATA_TRUE_INDICATOR
+      }
+
+      inline std::pair<
+	point_iterator,
+	bool>
+      insert(const_reference r_val);
+
+      inline point_iterator
+      find(const_key_reference r_key)
+      {
+	PB_DS_DBG_ONLY(assert_valid();)
+
+	  entry_pointer p_e = find_imp(r_key);
+
+	return point_iterator(p_e == NULL? NULL :& p_e->m_value);
+      }
+
+      inline const_point_iterator
+      find(const_key_reference r_key) const
+      {
+	PB_DS_DBG_ONLY(assert_valid();)
+
+	  entry_pointer p_e = find_imp(r_key);
+
+	return const_point_iterator(p_e == NULL? NULL :& p_e->m_value);
+      }
+
+      inline bool
+      erase(const_key_reference r_key);
+
+      template<typename Pred>
+      inline size_type
+      erase_if(Pred pred);
+
+      void
+      clear();
+
+      inline iterator
+      begin();
+
+      inline const_iterator
+      begin() const;
+
+      inline iterator
+      end();
+
+      inline const_iterator
+      end() const;
+
+#ifdef PB_DS_LU_MAP_DEBUG_
+
+      void
+      assert_valid() const;
+
+#endif // #ifdef PB_DS_LU_MAP_DEBUG_
+
+#ifdef PB_DS_LU_MAP_TRACE_
+
+      void
+      trace() const;
+
+#endif // PB_DS_LU_MAP_TRACE_
+
+    private:
+      typedef PB_DS_TYPES_TRAITS_C_DEC traits_base;
+
+#ifdef PB_DS_LU_MAP_DEBUG_
+      typedef PB_DS_MAP_DEBUG_BASE_C_DEC map_debug_base;
+#endif // #ifdef PB_DS_LU_MAP_DEBUG_
+
+      typedef
+      typename PB_DS_TYPES_TRAITS_C_DEC::
+      no_throw_copies_false_type
+      no_throw_copies_false_type;
+
+      typedef
+      typename PB_DS_TYPES_TRAITS_C_DEC::
+      no_throw_copies_true_type
+      no_throw_copies_true_type;
+
+    protected:
+
+      template<typename It>
+      void
+      copy_from_range(It first_it, It last_it);
+
+    private:
+
+      inline entry_pointer
+      allocate_new_entry(const_reference r_val, false_type);
+
+      inline entry_pointer
+      allocate_new_entry(const_reference r_val, true_type);
+
+      template<typename Metadata>
+      inline static void
+      init_entry_metadata(entry_pointer p_l, type_to_type<Metadata>);
+
+      inline static void
+      init_entry_metadata(entry_pointer p_l, type_to_type<null_lu_metadata>);
+
+      void
+      deallocate_all();
+
+      void
+      erase_next(entry_pointer p_l);
+
+      void
+      actual_erase_entry(entry_pointer p_l);
+
+      void
+      inc_it_state(const_pointer& r_p_value, entry_pointer& r_pos) const
+      {
+	r_pos = r_pos->m_p_next;
+
+	r_p_value = (r_pos == NULL)? NULL :& r_pos->m_value;
+      }
+
+      template<typename Metadata>
+      inline static bool
+      apply_update(entry_pointer p_l, type_to_type<Metadata>);
+
+      inline static bool
+      apply_update(entry_pointer p_l, type_to_type<null_lu_metadata>);
+
+      inline entry_pointer
+      find_imp(const_key_reference r_key) const;
+
+    private:
+      mutable entry_pointer m_p_l;
+
+      typedef cond_dealtor< entry, Allocator> cond_dealtor_t;
+
+#ifdef PB_DS_DATA_TRUE_INDICATOR
+      friend class iterator_;
+#endif // #ifdef PB_DS_DATA_TRUE_INDICATOR
+
+      friend class const_iterator_;
+
+      static entry_allocator s_entry_allocator;
+
+      static Eq_Fn s_eq_fn;
+
+      static Update_Policy s_update_policy;
+
+      static type_to_type<update_metadata> s_metadata_type_indicator;
+
+      static null_lu_metadata s_null_lu_metadata;
+    };
+
+#include <ext/pb_ds/detail/list_update_map_/constructor_destructor_fn_imps.hpp>
+#include <ext/pb_ds/detail/list_update_map_/info_fn_imps.hpp>
+#include <ext/pb_ds/detail/list_update_map_/debug_fn_imps.hpp>
+#include <ext/pb_ds/detail/list_update_map_/iterators_fn_imps.hpp>
+#include <ext/pb_ds/detail/list_update_map_/erase_fn_imps.hpp>
+#include <ext/pb_ds/detail/list_update_map_/find_fn_imps.hpp>
+#include <ext/pb_ds/detail/list_update_map_/insert_fn_imps.hpp>
+#include <ext/pb_ds/detail/list_update_map_/trace_fn_imps.hpp>
+
+#undef PB_DS_CLASS_T_DEC
+
+#undef PB_DS_CLASS_C_DEC
+
+#undef PB_DS_TYPES_TRAITS_C_DEC
+
+#undef PB_DS_MAP_DEBUG_BASE_C_DEC
+
+#undef PB_DS_CLASS_NAME
+
+#undef PB_DS_V2F
+#undef PB_DS_EP2VP
+#undef PB_DS_V2S
+
+#undef PB_DS_DBG_ASSERT
+#undef PB_DS_DBG_VERIFY
+#undef PB_DS_DBG_ONLY
+
+  } // namespace detail
+} // namespace pb_ds
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/list_update_map_/trace_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/list_update_map_/trace_fn_imps.hpp
new file mode 100644
index 00000000000..f406bd82842
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/list_update_map_/trace_fn_imps.hpp
@@ -0,0 +1,69 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file trace_fn_imps.hpp
+ * Contains implementations of lu_map_.
+ */
+
+#ifdef PB_DS_LU_MAP_TRACE_
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+trace() const
+{
+  std::cerr << m_p_l << std::endl << std::endl;
+
+  const_entry_pointer p_l = m_p_l;
+
+  while (p_l != NULL)
+    {
+      std::cerr << PB_DS_V2F(p_l->m_value) << std::endl;
+
+      p_l = p_l->m_p_next;
+    }
+
+  std::cerr << std::endl;
+}
+
+#endif // #ifdef PB_DS_LU_MAP_TRACE_
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/list_update_policy/counter_lu_metadata.hpp b/libstdc++-v3/include/ext/pb_ds/detail/list_update_policy/counter_lu_metadata.hpp
new file mode 100644
index 00000000000..744f72b48ca
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/list_update_policy/counter_lu_metadata.hpp
@@ -0,0 +1,128 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file counter_lu_metadata.hpp
+ * Contains implementation of a lu counter policy's metadata.
+ */
+
+namespace pb_ds
+{
+  namespace detail
+  {
+
+    template<typename Size_Type>
+    class counter_lu_policy_base;
+
+    // A list-update metadata type that moves elements to the front of the list based on the counter algorithm.
+    template<typename Size_Type = size_t>
+    class counter_lu_metadata
+    {
+
+    public:
+
+      typedef Size_Type size_type;
+
+    private:
+      counter_lu_metadata(size_type init_count) : m_count(init_count)
+      { }
+
+    private:
+      mutable size_type m_count;
+
+      friend class counter_lu_policy_base<Size_Type>;
+    };
+
+    template<typename Size_Type>
+    class counter_lu_policy_base;
+
+#define PB_DS_CLASS_T_DEC			\
+    template<typename Size_Type>
+
+#define PB_DS_CLASS_C_DEC					\
+    counter_lu_policy_base<					\
+						Size_Type>
+
+    template<typename Size_Type>
+    class counter_lu_policy_base
+    {
+    protected:
+      typedef Size_Type size_type;
+
+    protected:
+      counter_lu_metadata<
+      Size_Type>
+      operator()(size_type max_size) const;
+
+      template<typename Metadata_Reference>
+      bool
+      operator()(Metadata_Reference r_data, size_type m_max_count) const;
+    };
+
+    PB_DS_CLASS_T_DEC
+    counter_lu_metadata<
+      Size_Type>
+    PB_DS_CLASS_C_DEC::
+    operator()(size_type m_max_count) const
+    {
+      return (counter_lu_metadata<Size_Type>(rand() % m_max_count));
+    }
+
+    PB_DS_CLASS_T_DEC
+    template<typename Metadata_Reference>
+    inline bool
+    PB_DS_CLASS_C_DEC::
+    operator()(Metadata_Reference r_data, size_type m_max_count) const
+    {
+      if (++r_data.m_count != m_max_count)
+	return (false);
+
+      r_data.m_count = 0;
+
+      return (true);
+    }
+
+  } // namespace detail
+} // namespace pb_ds
+
+#undef PB_DS_CLASS_T_DEC
+
+#undef PB_DS_CLASS_C_DEC
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/list_update_policy/counter_lu_policy_imp.hpp b/libstdc++-v3/include/ext/pb_ds/detail/list_update_policy/counter_lu_policy_imp.hpp
new file mode 100644
index 00000000000..2d0521ab1f8
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/list_update_policy/counter_lu_policy_imp.hpp
@@ -0,0 +1,62 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file counter_lu_policy_imp.hpp
+ * Contains a lu counter policy implementation.
+ */
+
+PB_DS_CLASS_T_DEC
+detail::counter_lu_metadata<
+  typename Allocator::size_type>
+PB_DS_CLASS_C_DEC::
+operator()() const
+{
+  return (base_type::operator()(max_count));
+}
+
+PB_DS_CLASS_T_DEC
+bool
+PB_DS_CLASS_C_DEC::
+operator()(metadata_reference r_data) const
+{
+  return (base_type::operator()(r_data, max_count));
+}
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/list_update_policy/mtf_lu_policy_imp.hpp b/libstdc++-v3/include/ext/pb_ds/detail/list_update_policy/mtf_lu_policy_imp.hpp
new file mode 100644
index 00000000000..0a6180cd558
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/list_update_policy/mtf_lu_policy_imp.hpp
@@ -0,0 +1,65 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file mtf_lu_policy_imp.hpp
+ * Contains a move-to-front policy implementation.
+ */
+
+PB_DS_CLASS_T_DEC
+null_lu_metadata PB_DS_CLASS_C_DEC::s_metadata;
+
+PB_DS_CLASS_T_DEC
+typename PB_DS_CLASS_C_DEC::metadata_type
+PB_DS_CLASS_C_DEC::
+operator()() const
+{
+  return s_metadata;
+}
+
+PB_DS_CLASS_T_DEC
+inline bool
+PB_DS_CLASS_C_DEC::
+operator()(metadata_reference /*r_data*/) const
+{
+  return true;
+}
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/list_update_policy/sample_update_policy.hpp b/libstdc++-v3/include/ext/pb_ds/detail/list_update_policy/sample_update_policy.hpp
new file mode 100644
index 00000000000..d16a629424e
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/list_update_policy/sample_update_policy.hpp
@@ -0,0 +1,83 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file sample_update_policy.hpp
+ * Contains a sample policy for list update containers.
+ */
+
+#ifndef PB_DS_SAMPLE_UPDATE_POLICY_HPP
+#define PB_DS_SAMPLE_UPDATE_POLICY_HPP
+
+// A sample list-update policy.
+class sample_update_policy
+{
+
+public:
+
+  // Default constructor.
+  sample_update_policy();
+
+  // Copy constructor.
+  sample_update_policy(const sample_update_policy& other);
+
+  // Swaps content.
+  inline void
+  swap(sample_update_policy& other);
+
+protected:
+
+  // Metadata on which this functor operates.
+  typedef some_metadata_type metadata_type;
+
+protected:
+
+  // Creates a metadata object.
+  metadata_type
+  operator()() const;
+
+  // 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.
+  bool
+  operator()(metadata_reference r_data) const;
+
+};
+
+#endif // #ifndef PB_DS_SAMPLE_UPDATE_POLICY_HPP
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/map_debug_base.hpp b/libstdc++-v3/include/ext/pb_ds/detail/map_debug_base.hpp
new file mode 100644
index 00000000000..b154a9baf06
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/map_debug_base.hpp
@@ -0,0 +1,438 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file map_debug_base.hpp
+ * Contains a debug-mode base for all maps.
+ */
+
+#ifndef PB_DS_MAP_DEBUG_BASE_HPP
+#define PB_DS_MAP_DEBUG_BASE_HPP
+
+#ifdef PB_DS_USE_MAP_DEBUG_BASE
+
+#include <assert.h>
+#include <list>
+#include <utility>
+#include <pb_ds/testsuite/regression/res_mng/dbg_ex_allocator.hpp>
+
+namespace pb_ds
+{
+
+  namespace detail
+  {
+
+#ifdef PB_DS_MAP_DEBUG_BASE_DEBUG
+#define PB_DS_DBG_ASSERT(X) assert(X)
+#define PB_DS_DBG_VERIFY(X) assert(X)
+#define PB_DS_DBG_ONLY(X) X
+#else // #ifdef PB_DS_MAP_DEBUG_BASE_DEBUG
+#define PB_DS_DBG_ASSERT(X)
+#define PB_DS_DBG_VERIFY(X) {if((X)==0);}
+#define PB_DS_DBG_ONLY(X) ;
+#endif // #ifdef PB_DS_MAP_DEBUG_BASE_DEBUG
+
+#define PB_DS_CLASS_T_DEC						\
+    template<typename Key, class Eq_Fn, typename Const_Key_Reference>
+
+#define PB_DS_CLASS_C_DEC						\
+    map_debug_base<							\
+						Key,			\
+						Eq_Fn,			\
+						Const_Key_Reference>
+
+    template<typename Key, class Eq_Fn, typename Const_Key_Reference>
+    class map_debug_base
+    {
+    private:
+      typedef typename std::allocator< Key> key_allocator;
+
+      typedef typename key_allocator::size_type size_type;
+
+      typedef Const_Key_Reference const_key_reference;
+
+    protected:
+      map_debug_base();
+
+      map_debug_base(const PB_DS_CLASS_C_DEC& other);
+
+      ~map_debug_base();
+
+      inline void
+      insert_new(const_key_reference r_key);
+
+      inline void
+      erase_existing(const_key_reference r_key);
+
+      void
+      clear();
+
+      inline void
+      check_key_exists(const_key_reference r_key) const;
+
+      inline void
+      check_key_does_not_exist(const_key_reference r_key) const;
+
+      inline void
+      check_size(size_type size) const;
+
+      void
+      swap(PB_DS_CLASS_C_DEC& other);
+
+      template<typename Cmp_Fn>
+      void
+      split(const_key_reference r_key, Cmp_Fn cmp_fn, PB_DS_CLASS_C_DEC& other);
+
+      void
+      join(PB_DS_CLASS_C_DEC& other);
+
+    private:
+      typedef std::list< Key> key_set;
+
+      typedef typename key_set::iterator key_set_iterator;
+
+      typedef typename key_set::const_iterator const_key_set_iterator;
+
+    private:
+#ifdef PB_DS_MAP_DEBUG_BASE_DEBUG
+      void
+      assert_valid() const;
+#endif // #ifdef PB_DS_MAP_DEBUG_BASE_DEBUG
+
+      const_key_set_iterator
+      find(const_key_reference r_key) const;
+
+      key_set_iterator
+      find(const_key_reference r_key);
+
+    private:
+      key_set m_key_set;
+
+      Eq_Fn m_eq;
+    };
+
+    PB_DS_CLASS_T_DEC
+    PB_DS_CLASS_C_DEC::
+    map_debug_base()
+    {
+      PB_DS_DBG_ONLY(assert_valid();)
+	}
+
+    PB_DS_CLASS_T_DEC
+    PB_DS_CLASS_C_DEC::
+    map_debug_base(const PB_DS_CLASS_C_DEC& other) :
+      m_key_set(other.m_key_set)
+    {
+      PB_DS_DBG_ONLY(assert_valid();)
+	}
+
+    PB_DS_CLASS_T_DEC
+    PB_DS_CLASS_C_DEC::
+    ~map_debug_base()
+    {
+      PB_DS_DBG_ONLY(assert_valid();)
+	}
+
+    PB_DS_CLASS_T_DEC
+    inline void
+    PB_DS_CLASS_C_DEC::
+    insert_new(const_key_reference r_key)
+    {
+      PB_DS_DBG_ONLY(assert_valid();)
+
+	pb_ds::test::dbg_ex_allocator<char> alloc;
+
+      const double orig_throw_prob = alloc.get_throw_prob();
+
+      alloc.set_throw_prob(0);
+
+      if (find(r_key) != m_key_set.end())
+	{
+	  std::cerr << "insert_new " << r_key << std::endl;
+
+	  abort();
+	}
+
+      try
+	{
+	  m_key_set.push_back(r_key);
+	}
+      catch(...)
+	{
+	  std::cerr << "insert_new 1" << r_key << std::endl;
+
+	  abort();
+	}
+
+      alloc.set_throw_prob(orig_throw_prob);
+
+      PB_DS_DBG_ONLY(assert_valid();)
+	}
+
+    PB_DS_CLASS_T_DEC
+    inline void
+    PB_DS_CLASS_C_DEC::
+    erase_existing(const_key_reference r_key)
+    {
+      PB_DS_DBG_ONLY(assert_valid();)
+
+	key_set_iterator it = find(r_key);
+
+      if (it == m_key_set.end())
+	{
+	  std::cerr << "erase_existing " << r_key << std::endl;
+
+	  abort();
+	}
+
+      m_key_set.erase(it);
+
+      PB_DS_DBG_ONLY(assert_valid();)
+	}
+
+    PB_DS_CLASS_T_DEC
+    void
+    PB_DS_CLASS_C_DEC::
+    clear()
+    {
+      PB_DS_DBG_ONLY(assert_valid();)
+
+	m_key_set.clear();
+
+      PB_DS_DBG_ONLY(assert_valid();)
+	}
+
+    PB_DS_CLASS_T_DEC
+    inline void
+    PB_DS_CLASS_C_DEC::
+    check_key_exists(const_key_reference r_key) const
+    {
+      PB_DS_DBG_ONLY(assert_valid();)
+
+	if (find(r_key) == m_key_set.end())
+	  {
+	    std::cerr << "check_key_exists " << r_key << std::endl;
+
+	    abort();
+	  }
+
+      PB_DS_DBG_ONLY(assert_valid();)
+	}
+
+    PB_DS_CLASS_T_DEC
+    inline void
+    PB_DS_CLASS_C_DEC::
+    check_key_does_not_exist(const_key_reference r_key) const
+    {
+      PB_DS_DBG_ONLY(assert_valid();)
+
+	if (find(r_key) != m_key_set.end())
+	  {
+	    std::cerr << "check_key_does_not_exist " << r_key << std::endl;
+
+	    abort();
+	  }
+    }
+
+    PB_DS_CLASS_T_DEC
+    inline void
+    PB_DS_CLASS_C_DEC::
+    check_size(size_type size) const
+    {
+      PB_DS_DBG_ONLY(assert_valid();)
+
+	const size_type key_set_size = m_key_set.size();
+
+      if (size != key_set_size)
+	{
+	  std::cerr << "check_size " << size << " " << key_set_size << std::endl;
+
+	  abort();
+	}
+
+      PB_DS_DBG_ONLY(assert_valid();)
+	}
+
+    PB_DS_CLASS_T_DEC
+    void
+    PB_DS_CLASS_C_DEC::
+    swap(PB_DS_CLASS_C_DEC& other)
+    {
+      PB_DS_DBG_ONLY(assert_valid();)
+
+	m_key_set.swap(other.m_key_set);
+
+      PB_DS_DBG_ONLY(assert_valid();)
+	}
+
+    PB_DS_CLASS_T_DEC
+    typename PB_DS_CLASS_C_DEC::const_key_set_iterator
+    PB_DS_CLASS_C_DEC::
+    find(const_key_reference r_key) const
+    {
+      PB_DS_DBG_ONLY(assert_valid();)
+
+	for (const_key_set_iterator it = m_key_set.begin(); it != m_key_set.end();
+	     ++it)
+	  if (m_eq(*it, r_key))
+            return (it);
+
+      return (m_key_set.end());
+    }
+
+    PB_DS_CLASS_T_DEC
+    typename PB_DS_CLASS_C_DEC::key_set_iterator
+    PB_DS_CLASS_C_DEC::
+    find(const_key_reference r_key)
+    {
+      PB_DS_DBG_ONLY(assert_valid();)
+
+	key_set_iterator it = m_key_set.begin();
+
+      while (it != m_key_set.end())
+	{
+	  if (m_eq(*it, r_key))
+            return (it);
+
+	  ++it;
+	}
+
+      return (it);
+
+      PB_DS_DBG_ONLY(assert_valid();)
+	}
+
+#ifdef PB_DS_MAP_DEBUG_BASE_DEBUG
+    PB_DS_CLASS_T_DEC
+    void
+    PB_DS_CLASS_C_DEC::
+    assert_valid() const
+    {
+      const_key_set_iterator prime_it = m_key_set.begin();
+
+      while (prime_it != m_key_set.end())
+	{
+	  const_key_set_iterator sec_it = prime_it;
+
+	  ++sec_it;
+
+	  while (sec_it != m_key_set.end())
+	    {
+	      assert(!m_eq(*sec_it, * prime_it));
+	      assert(!m_eq(*prime_it, * sec_it));
+
+	      ++sec_it;
+	    }
+
+	  ++prime_it;
+	}
+    }
+#endif // #ifdef PB_DS_MAP_DEBUG_BASE_DEBUG
+
+    PB_DS_CLASS_T_DEC
+    template<typename Cmp_Fn>
+    void
+    PB_DS_CLASS_C_DEC::
+    split(const_key_reference r_key, Cmp_Fn cmp_fn, PB_DS_CLASS_C_DEC& other)
+    {
+      pb_ds::test::dbg_ex_allocator<char> alloc;
+
+      const double orig_throw_prob = alloc.get_throw_prob();
+
+      alloc.set_throw_prob(0);
+
+      other.clear();
+
+      key_set_iterator it = m_key_set.begin();
+
+      while (it != m_key_set.end())
+        if (cmp_fn(r_key, * it))
+	  {
+            other.insert_new(*it);
+
+            it = m_key_set.erase(it);
+	  }
+        else
+	  ++it;
+
+      alloc.set_throw_prob(orig_throw_prob);
+    }
+
+    PB_DS_CLASS_T_DEC
+    void
+    PB_DS_CLASS_C_DEC::
+    join(PB_DS_CLASS_C_DEC& other)
+    {
+      pb_ds::test::dbg_ex_allocator<char> alloc;
+
+      const double orig_throw_prob = alloc.get_throw_prob();
+
+      alloc.set_throw_prob(0);
+
+      key_set_iterator it = other.m_key_set.begin();
+
+      while (it != other.m_key_set.end())
+	{
+	  insert_new(*it);
+
+	  it = other.m_key_set.erase(it);
+	}
+
+      PB_DS_DBG_ASSERT(other.m_key_set.empty());
+
+      alloc.set_throw_prob(orig_throw_prob);
+    }
+
+#undef PB_DS_CLASS_T_DEC
+#undef PB_DS_CLASS_C_DEC
+
+#undef PB_DS_DBG_ASSERT
+#undef PB_DS_DBG_VERIFY
+#undef PB_DS_DBG_ONLY
+
+  } // namespace detail
+
+} // namespace pb_ds
+
+#endif // #ifdef PB_DS_USE_MAP_DEBUG_BASE
+
+#endif // #ifndef PB_DS_MAP_DEBUG_BASE_HPP
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/ov_tree_map_/cond_dtor.hpp b/libstdc++-v3/include/ext/pb_ds/detail/ov_tree_map_/cond_dtor.hpp
new file mode 100644
index 00000000000..47e6e67b332
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/ov_tree_map_/cond_dtor.hpp
@@ -0,0 +1,89 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file cond_dtor.hpp
+ * Contains a conditional destructor
+ */
+
+template<typename Size_Type>
+class cond_dtor
+{
+public:
+  cond_dtor(value_vector a_vec, iterator& r_last_it, Size_Type total_size) : m_a_vec(a_vec),
+									     m_r_last_it(r_last_it),
+									     m_max_size(total_size),
+									     m_no_action(false)
+  { }
+
+  ~cond_dtor()
+  {
+    if (m_no_action)
+      return;
+
+    iterator it = m_a_vec;
+
+    while (it != m_r_last_it)
+      {
+	it->~value_type();
+
+	++it;
+      }
+
+    if (m_max_size > 0)
+      value_allocator().deallocate(m_a_vec, m_max_size);
+  }
+
+  inline void
+  set_no_action()
+  {
+    m_no_action = true;
+  }
+
+protected:
+  value_vector m_a_vec;
+
+  iterator& m_r_last_it;
+
+  const Size_Type m_max_size;
+
+  bool m_no_action;
+};
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/ov_tree_map_/constructors_destructor_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/ov_tree_map_/constructors_destructor_fn_imps.hpp
new file mode 100644
index 00000000000..642f79b8243
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/ov_tree_map_/constructors_destructor_fn_imps.hpp
@@ -0,0 +1,325 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file constructors_destructor_fn_imps.hpp
+ * Contains an implementation class for ov_tree_.
+ */
+
+PB_DS_CLASS_T_DEC
+typename PB_DS_CLASS_C_DEC::value_allocator
+PB_DS_CLASS_C_DEC::s_value_alloc;
+
+PB_DS_CLASS_T_DEC
+typename PB_DS_CLASS_C_DEC::metadata_allocator
+PB_DS_CLASS_C_DEC::s_metadata_alloc;
+
+PB_DS_CLASS_T_DEC
+PB_DS_CLASS_C_DEC::
+PB_DS_OV_TREE_CLASS_NAME() :
+  m_a_values(NULL),
+  m_a_metadata(NULL),
+  m_end_it(NULL),
+  m_size(0)
+{
+  PB_DS_DBG_ONLY(PB_DS_CLASS_C_DEC::assert_valid();)
+    }
+
+PB_DS_CLASS_T_DEC
+PB_DS_CLASS_C_DEC::
+PB_DS_OV_TREE_CLASS_NAME(const Cmp_Fn& r_cmp_fn) :
+  cmp_fn_base(r_cmp_fn),
+  m_a_values(NULL),
+  m_a_metadata(NULL),
+  m_end_it(NULL),
+  m_size(0)
+{
+  PB_DS_DBG_ONLY(PB_DS_CLASS_C_DEC::assert_valid();)
+    }
+
+PB_DS_CLASS_T_DEC
+PB_DS_CLASS_C_DEC::
+PB_DS_OV_TREE_CLASS_NAME(const Cmp_Fn& r_cmp_fn, const node_update& r_node_update) :
+  cmp_fn_base(r_cmp_fn),
+  node_update(r_node_update),
+  m_a_values(NULL),
+  m_a_metadata(NULL),
+  m_end_it(NULL),
+  m_size(0)
+{
+  PB_DS_DBG_ONLY(PB_DS_CLASS_C_DEC::assert_valid();)
+    }
+
+PB_DS_CLASS_T_DEC
+PB_DS_CLASS_C_DEC::
+PB_DS_OV_TREE_CLASS_NAME(const PB_DS_CLASS_C_DEC& other) :
+#ifdef PB_DS_OV_TREE_DEBUG_
+  PB_DS_MAP_DEBUG_BASE_C_DEC(other),
+#endif // #ifdef PB_DS_OV_TREE_DEBUG_
+#ifdef PB_DS_TREE_TRACE
+  PB_DS_TREE_TRACE_BASE_C_DEC(other),
+#endif // #ifdef PB_DS_TREE_TRACE
+  cmp_fn_base(other),
+  node_update(other),
+  m_a_values(NULL),
+  m_a_metadata(NULL),
+  m_end_it(NULL),
+  m_size(0)
+{
+  copy_from_ordered_range(other.begin(), other.end());
+
+  PB_DS_DBG_ONLY(PB_DS_CLASS_C_DEC::assert_valid();)
+    }
+
+PB_DS_CLASS_T_DEC
+template<typename It>
+inline void
+PB_DS_CLASS_C_DEC::
+copy_from_range(It first_it, It last_it)
+{
+#ifdef PB_DS_DATA_TRUE_INDICATOR
+  typedef
+    std::map<
+    key_type,
+    mapped_type,
+    Cmp_Fn,
+    typename Allocator::template rebind<
+    value_type>::other>
+    map_type;
+#else // #ifdef PB_DS_DATA_TRUE_INDICATOR
+  typedef
+    std::set<
+    key_type,
+    Cmp_Fn,
+    typename Allocator::template rebind<
+    Key>::other>
+    map_type;
+#endif // #ifdef PB_DS_DATA_TRUE_INDICATOR
+
+  map_type m(first_it, last_it);
+
+  copy_from_ordered_range(m.begin(), m.end());
+}
+
+PB_DS_CLASS_T_DEC
+template<typename It>
+void
+PB_DS_CLASS_C_DEC::
+copy_from_ordered_range(It first_it, It last_it)
+{
+  const size_type size = std::distance(first_it, last_it);
+
+  if (size == 0)
+    return;
+
+  value_vector a_values = s_value_alloc.allocate(size);
+
+  iterator target_it = a_values;
+  It source_it = first_it;
+  It source_end_it = last_it;
+
+  cond_dtor<size_type> cd(a_values, target_it, size);
+
+  while (source_it != source_end_it)
+    {
+      new (const_cast<void* >(
+			      static_cast<const void* >(target_it)))
+	value_type(*source_it++);
+
+      ++target_it;
+    }
+
+  reallocate_metadata((node_update* )this, size);
+
+  cd.set_no_action();
+
+  m_a_values = a_values;
+
+  m_size = size;
+
+  m_end_it = m_a_values + m_size;
+
+  update(PB_DS_node_begin_imp(), (node_update* )this);
+
+#ifdef PB_DS_OV_TREE_DEBUG_
+  const_iterator dbg_it = m_a_values;
+
+  while (dbg_it != m_end_it)
+    {
+      map_debug_base::insert_new(PB_DS_V2F(*dbg_it));
+
+      dbg_it++;
+    }
+
+  PB_DS_CLASS_C_DEC::assert_valid();
+#endif // #ifdef PB_DS_OV_TREE_DEBUG_
+}
+
+PB_DS_CLASS_T_DEC
+template<typename It>
+void
+PB_DS_CLASS_C_DEC::
+copy_from_ordered_range(It first_it, It last_it, It other_first_it, It other_last_it)
+{
+  clear();
+
+  const size_type size =
+    std::distance(first_it, last_it) +
+    std::distance(other_first_it, other_last_it);
+
+  value_vector a_values = s_value_alloc.allocate(size);
+
+  iterator target_it = a_values;
+  It source_it = first_it;
+  It source_end_it = last_it;
+
+  cond_dtor<size_type> cd(a_values, target_it, size);
+
+  while (source_it != source_end_it)
+    {
+      new (const_cast<void* >(
+			      static_cast<const void* >(target_it)))
+	value_type(*source_it++);
+
+      ++target_it;
+    }
+
+  source_it = other_first_it;
+  source_end_it = other_last_it;
+
+  while (source_it != source_end_it)
+    {
+      new (const_cast<void* >(
+			      static_cast<const void* >(target_it)))
+	value_type(*source_it++);
+
+      ++target_it;
+    }
+
+  reallocate_metadata((node_update* )this, size);
+
+  cd.set_no_action();
+
+  m_a_values = a_values;
+
+  m_size = size;
+
+  m_end_it = m_a_values + m_size;
+
+  update(PB_DS_node_begin_imp(), (node_update* )this);
+
+#ifdef PB_DS_OV_TREE_DEBUG_
+  const_iterator dbg_it = m_a_values;
+
+  while (dbg_it != m_end_it)
+    {
+      map_debug_base::insert_new(PB_DS_V2F(*dbg_it));
+
+      dbg_it++;
+    }
+
+  PB_DS_CLASS_C_DEC::assert_valid();
+#endif // #ifdef PB_DS_OV_TREE_DEBUG_
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+swap(PB_DS_CLASS_C_DEC& other)
+{
+  PB_DS_DBG_ONLY(assert_valid();)
+
+    value_swap(other);
+
+  std::swap((Cmp_Fn& )(*this), (Cmp_Fn& )other);
+
+  PB_DS_DBG_ONLY(assert_valid();)
+    }
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+value_swap(PB_DS_CLASS_C_DEC& other)
+{
+  std::swap(m_a_values, other.m_a_values);
+
+  std::swap(m_a_metadata, other.m_a_metadata);
+
+  std::swap(m_size, other.m_size);
+
+  std::swap(m_end_it, other.m_end_it);
+
+  PB_DS_DBG_ONLY(map_debug_base::swap(other);)
+    }
+
+PB_DS_CLASS_T_DEC
+PB_DS_CLASS_C_DEC::
+~PB_DS_OV_TREE_CLASS_NAME()
+{
+  PB_DS_DBG_ONLY(assert_valid();)
+
+    cond_dtor<size_type> cd(m_a_values, m_end_it, m_size);
+
+  reallocate_metadata((node_update* )this, 0);
+}
+
+PB_DS_CLASS_T_DEC
+inline void
+PB_DS_CLASS_C_DEC::
+update(node_iterator /*it*/, null_node_update_pointer)
+{ }
+
+PB_DS_CLASS_T_DEC
+template<typename Node_Update>
+void
+PB_DS_CLASS_C_DEC::
+update(node_iterator nd_it, Node_Update* p_update)
+{
+  const_node_iterator end_it = PB_DS_node_end_imp();
+
+  if (nd_it == end_it)
+    return;
+
+  update(nd_it.get_l_child(), p_update);
+  update(nd_it.get_r_child(), p_update);
+
+  node_update::operator()(nd_it, end_it);
+}
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/ov_tree_map_/debug_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/ov_tree_map_/debug_fn_imps.hpp
new file mode 100644
index 00000000000..d5e9b5eab5a
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/ov_tree_map_/debug_fn_imps.hpp
@@ -0,0 +1,109 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file debug_fn_imps.hpp
+ * Contains an implementation class for ov_tree_.
+ */
+
+#ifdef PB_DS_OV_TREE_DEBUG_
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+assert_valid() const
+{
+  std::cout << "av1" << std::endl;
+
+  if (m_a_values == NULL || m_end_it == NULL || m_size == 0)
+    PB_DS_DBG_ASSERT(m_a_values == NULL&&  m_end_it == NULL&& 
+		     m_size == 0);
+
+  std::cout << "av2" << std::endl;
+
+  assert_iterators();
+
+  std::cout << "av3" << std::endl;
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+assert_iterators() const
+{
+  map_debug_base::check_size(m_size);
+
+  size_type iterated_num = 0;
+
+  const_iterator prev_it = end();
+
+  PB_DS_DBG_ASSERT( m_end_it == m_a_values + m_size);
+
+  for (const_iterator it = begin(); it != end(); ++it)
+    {
+      ++iterated_num;
+
+      PB_DS_DBG_ONLY(map_debug_base::check_key_exists(
+						      PB_DS_V2F(*it));)
+
+        PB_DS_DBG_ASSERT(lower_bound(
+				     PB_DS_V2F(*it)) == it);
+
+      const_iterator upper_bound_it = upper_bound(
+						  PB_DS_V2F(*it));
+
+      --upper_bound_it;
+
+      PB_DS_DBG_ASSERT(upper_bound_it == it);
+
+      if (prev_it != end())
+	PB_DS_DBG_ASSERT(Cmp_Fn::operator()(
+					    PB_DS_V2F(*prev_it),
+					    PB_DS_V2F(*it)));
+
+      prev_it = it;
+    }
+
+  PB_DS_DBG_ASSERT(iterated_num == m_size);
+}
+
+#endif // #ifdef PB_DS_OV_TREE_DEBUG_
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/ov_tree_map_/erase_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/ov_tree_map_/erase_fn_imps.hpp
new file mode 100644
index 00000000000..5fbf91b171a
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/ov_tree_map_/erase_fn_imps.hpp
@@ -0,0 +1,242 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file erase_fn_imps.hpp
+ * Contains an implementation class for ov_tree_.
+ */
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+clear()
+{
+  PB_DS_DBG_ONLY(assert_valid();)
+
+    if (m_size == 0)
+      {
+        PB_DS_DBG_ONLY(assert_valid();)
+
+	  return;
+      }
+    else
+      {
+        reallocate_metadata((node_update* )this, 0);
+
+        cond_dtor<size_type> cd(m_a_values, m_end_it, m_size);
+      }
+
+  PB_DS_DBG_ONLY(map_debug_base::clear();)
+
+    m_a_values = NULL;
+
+  m_size = 0;
+
+  m_end_it = m_a_values;
+
+  PB_DS_DBG_ONLY(assert_valid();)
+    }
+
+PB_DS_CLASS_T_DEC
+template<typename Pred>
+inline typename PB_DS_CLASS_C_DEC::size_type
+PB_DS_CLASS_C_DEC::
+erase_if(Pred pred)
+{
+  PB_DS_DBG_ONLY(assert_valid();)
+
+#ifdef PB_DS_REGRESSION
+    typename Allocator::group_throw_prob_adjustor adjust(m_size);
+#endif // #ifdef PB_DS_REGRESSION
+
+  size_type new_size = 0;
+
+  size_type num_val_ersd = 0;
+
+  iterator source_it = m_a_values;
+
+  for (source_it = begin(); source_it != m_end_it; ++source_it)
+    if (!pred(*source_it))
+      ++new_size;
+    else
+      ++num_val_ersd;
+
+  if (new_size == 0)
+    {
+      clear();
+
+      return (num_val_ersd);
+    }
+
+  value_vector a_new_values = s_value_alloc.allocate(new_size);
+
+  iterator target_it = a_new_values;
+
+  cond_dtor<size_type> cd(a_new_values, target_it, new_size);
+
+  PB_DS_DBG_ONLY(map_debug_base::clear());
+
+  for (source_it = begin(); source_it != m_end_it; ++source_it)
+    {
+      if (!pred(*source_it))
+        {
+	  new (const_cast<void* >(
+				  static_cast<const void* >(target_it)))
+	    value_type(*source_it);
+
+	  PB_DS_DBG_ONLY(map_debug_base::insert_new(
+						    PB_DS_V2F(*source_it)));
+
+	  ++target_it;
+        }
+    }
+
+  reallocate_metadata((node_update* )this, new_size);
+
+  cd.set_no_action();
+
+  {
+    cond_dtor<size_type> cd1(m_a_values, m_end_it, m_size);
+  }
+
+  m_a_values = a_new_values;
+
+  m_size = new_size;
+
+  m_end_it = target_it;
+
+  update(node_begin(), (node_update* )this);
+
+  PB_DS_DBG_ONLY(assert_valid();)
+
+    return (num_val_ersd);
+}
+
+PB_DS_CLASS_T_DEC
+template<typename It>
+It
+PB_DS_CLASS_C_DEC::
+erase_imp(It it)
+{
+  PB_DS_DBG_ONLY(assert_valid();)
+
+    if (it == end())
+      return end();
+
+  PB_DS_DBG_ONLY(
+		 PB_DS_CLASS_C_DEC::check_key_exists(PB_DS_V2F(*it));)
+
+#ifdef PB_DS_REGRESSION
+    typename Allocator::group_throw_prob_adjustor adjust(m_size);
+#endif // #ifdef PB_DS_REGRESSION
+
+  PB_DS_DBG_ASSERT(m_size > 0);
+
+  value_vector a_values = s_value_alloc.allocate(m_size - 1);
+
+  iterator source_it = begin();
+  iterator source_end_it = end();
+  iterator target_it = a_values;
+  iterator ret_it = end();
+
+  cond_dtor<size_type> cd(a_values, target_it, m_size - 1);
+
+  PB_DS_DBG_ONLY(size_type cnt = 0;)
+
+    while (source_it != source_end_it)
+      {
+        if (source_it != it)
+	  {
+            PB_DS_DBG_ONLY(++cnt;)
+	      PB_DS_DBG_ASSERT(cnt != m_size);
+
+            new (const_cast<void* >(
+				    static_cast<const void* >(target_it)))
+	      value_type(*source_it);
+
+            ++target_it;
+	  }
+        else
+	  ret_it = target_it;
+
+        ++source_it;
+      }
+
+  PB_DS_DBG_ASSERT(m_size > 0);
+
+  reallocate_metadata((node_update* )this, m_size - 1);
+
+  cd.set_no_action();
+
+  PB_DS_DBG_ONLY(
+		 PB_DS_CLASS_C_DEC::erase_existing(PB_DS_V2F(*it));)
+    {
+      cond_dtor<size_type> cd1(m_a_values, m_end_it, m_size);
+    }
+
+  m_a_values = a_values;
+
+  --m_size;
+
+  m_end_it = m_a_values + m_size;
+
+  update(node_begin(), (node_update* )this);
+
+  PB_DS_DBG_ONLY(assert_valid();)
+
+    return (It(ret_it));
+}
+
+PB_DS_CLASS_T_DEC
+bool
+PB_DS_CLASS_C_DEC::
+erase(const_key_reference r_key)
+{
+  point_iterator it = find(r_key);
+
+  if (it == end())
+    return (false);
+
+  erase(it);
+
+  return (true);
+}
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/ov_tree_map_/info_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/ov_tree_map_/info_fn_imps.hpp
new file mode 100644
index 00000000000..27fb02fe74c
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/ov_tree_map_/info_fn_imps.hpp
@@ -0,0 +1,71 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file info_fn_imps.hpp
+ * Contains an implementation class for ov_tree_.
+ */
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::size_type
+PB_DS_CLASS_C_DEC::
+size() const
+{
+  PB_DS_DBG_ONLY(assert_valid();)
+
+    return (m_size);
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::size_type
+PB_DS_CLASS_C_DEC::
+max_size() const
+{
+  return (s_value_alloc.max_size());
+}
+
+PB_DS_CLASS_T_DEC
+inline bool
+PB_DS_CLASS_C_DEC::
+empty() const
+{
+  return (size() == 0);
+}
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/ov_tree_map_/insert_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/ov_tree_map_/insert_fn_imps.hpp
new file mode 100644
index 00000000000..4f0481d58a0
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/ov_tree_map_/insert_fn_imps.hpp
@@ -0,0 +1,71 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file insert_fn_imps.hpp
+ * Contains an implementation class for ov_tree_.
+ */
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+reallocate_metadata(null_node_update_pointer, size_type)
+{ }
+
+PB_DS_CLASS_T_DEC
+template<typename Node_Update_>
+void
+PB_DS_CLASS_C_DEC::
+reallocate_metadata(Node_Update_* , size_type new_size)
+{
+  metadata_pointer a_new_metadata_vec =(new_size == 0)? NULL : s_metadata_alloc.allocate(new_size);
+
+  if (m_a_metadata != NULL)
+    {
+      for (size_type i = 0; i < m_size; ++i)
+	m_a_metadata[i].~metadata_type();
+
+      s_metadata_alloc.deallocate(m_a_metadata, m_size);
+    }
+
+  std::swap(m_a_metadata, a_new_metadata_vec);
+}
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/ov_tree_map_/iterators_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/ov_tree_map_/iterators_fn_imps.hpp
new file mode 100644
index 00000000000..f982c9136b1
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/ov_tree_map_/iterators_fn_imps.hpp
@@ -0,0 +1,130 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file iterators_fn_imps.hpp
+ * Contains an implementation class for ov_tree_.
+ */
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::const_node_iterator
+PB_DS_CLASS_C_DEC::
+node_begin() const
+{
+  return (PB_DS_node_begin_imp());
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::const_node_iterator
+PB_DS_CLASS_C_DEC::
+node_end() const
+{
+  return (PB_DS_node_end_imp());
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::node_iterator
+PB_DS_CLASS_C_DEC::
+node_begin()
+{
+  return (PB_DS_node_begin_imp());
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::node_iterator
+PB_DS_CLASS_C_DEC::
+node_end()
+{
+  return (PB_DS_node_end_imp());
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::const_node_iterator
+PB_DS_CLASS_C_DEC::
+PB_DS_node_begin_imp() const
+{
+  return (const_node_iterator(
+			      const_cast<pointer>(mid_pointer(begin(), end())),
+			      const_cast<pointer>(begin()),
+			      const_cast<pointer>(end()),(m_a_metadata == NULL)?
+			      NULL :
+			      mid_pointer(m_a_metadata, m_a_metadata + m_size)));
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::const_node_iterator
+PB_DS_CLASS_C_DEC::
+PB_DS_node_end_imp() const
+{
+  return (const_node_iterator(
+			      end(),
+			      end(),
+			      end(),(m_a_metadata == NULL)?
+			      NULL :
+			      m_a_metadata + m_size));
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::node_iterator
+PB_DS_CLASS_C_DEC::
+PB_DS_node_begin_imp()
+{
+  return (node_iterator(
+			mid_pointer(begin(), end()),
+			begin(),
+			end(),(m_a_metadata == NULL)?
+			NULL :
+			mid_pointer(m_a_metadata, m_a_metadata + m_size)));
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::node_iterator
+PB_DS_CLASS_C_DEC::
+PB_DS_node_end_imp()
+{
+  return (node_iterator(
+			end(),
+			end(),
+			end(),(m_a_metadata == NULL)?
+			NULL :
+			m_a_metadata + m_size));
+}
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/ov_tree_map_/node_iterators.hpp b/libstdc++-v3/include/ext/pb_ds/detail/ov_tree_map_/node_iterators.hpp
new file mode 100644
index 00000000000..c9a852a7ed5
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/ov_tree_map_/node_iterators.hpp
@@ -0,0 +1,348 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file node_iterators.hpp
+ * Contains an implementation class for ov_tree_.
+ */
+
+#ifndef PB_DS_OV_TREE_NODE_ITERATORS_HPP
+#define PB_DS_OV_TREE_NODE_ITERATORS_HPP
+
+#ifdef PB_DS_OV_TREE_DEBUG_
+#include <cassert>
+#endif // #ifdef PB_DS_OV_TREE_DEBUG_
+#include <ext/pb_ds/tag_and_trait.hpp>
+#include <ext/pb_ds/detail/type_utils.hpp>
+
+namespace pb_ds
+{
+  namespace detail
+  {
+
+#define PB_DS_STATIC_ASSERT(UNIQUE, E)					\
+    typedef								\
+    static_assert_dumclass<				\
+									sizeof(static_assert<(bool)(E)>)> \
+    UNIQUE##static_assert_type
+
+#ifdef PB_DS_OV_TREE_DEBUG_
+#define PB_DS_DBG_ASSERT(X) assert(X);
+#define PB_DS_DBG_VERIFY(X) PB_DS_DBG_ASSERT(X)
+#define PB_DS_DBG_ONLY(X) X
+#else // #ifdef PB_DS_OV_TREE_DEBUG_
+#define PB_DS_DBG_ASSERT(X) ((void)0)
+#define PB_DS_DBG_VERIFY(X) X
+#define PB_DS_DBG_ONLY(X) ;
+#endif // #ifdef PB_DS_OV_TREE_DEBUG_
+
+#define PB_DS_OV_TREE_CONST_NODE_ITERATOR_C_DEC			\
+    ov_tree_node_const_it_<					\
+						Value_Type,	\
+						Metadata_Type,	\
+						Allocator>
+
+    // Const node reference.
+    template<typename Value_Type, typename Metadata_Type, class Allocator>
+    class ov_tree_node_const_it_
+    {
+
+    protected:
+      typedef
+      typename Allocator::template rebind<
+      Value_Type>::other::pointer
+      pointer;
+
+      typedef
+      typename Allocator::template rebind<
+	Value_Type>::other::const_pointer
+      const_pointer;
+
+      typedef
+      typename Allocator::template rebind<
+	Metadata_Type>::other::const_pointer
+      const_metadata_pointer;
+
+      typedef PB_DS_OV_TREE_CONST_NODE_ITERATOR_C_DEC this_type;
+
+    protected:
+
+      template<typename Ptr>
+      inline static Ptr
+      mid_pointer(Ptr p_begin, Ptr p_end)
+      {
+	PB_DS_DBG_ASSERT(p_end >= p_begin);
+
+	return (p_begin + (p_end - p_begin) / 2);
+      }
+
+    public:
+
+      typedef trivial_iterator_tag iterator_category;
+
+      typedef trivial_iterator_difference_type difference_type;
+
+      typedef
+      typename Allocator::template rebind<
+	Value_Type>::other::const_pointer
+      value_type;
+
+      typedef
+      typename Allocator::template rebind<
+	typename remove_const<
+	Value_Type>::type>::other::const_pointer
+      reference;
+
+      typedef
+      typename Allocator::template rebind<
+	typename remove_const<
+	Value_Type>::type>::other::const_pointer
+      const_reference;
+
+      typedef Metadata_Type metadata_type;
+
+      typedef
+      typename Allocator::template rebind<
+	metadata_type>::other::const_reference
+      const_metadata_reference;
+
+    public:
+      inline
+      ov_tree_node_const_it_(const_pointer p_nd = NULL,  const_pointer p_begin_nd = NULL,  const_pointer p_end_nd = NULL,  const_metadata_pointer p_metadata = NULL) : m_p_value(const_cast<pointer>(p_nd)),
+																				       m_p_begin_value(const_cast<pointer>(p_begin_nd)),
+																				       m_p_end_value(const_cast<pointer>(p_end_nd)),
+																				       m_p_metadata(p_metadata)
+      { }
+
+      inline const_reference
+      operator*() const
+      {
+	return (m_p_value);
+      }
+
+      inline const_metadata_reference
+      get_metadata() const
+      {
+	enum
+	  {
+	    has_metadata =
+	    !is_same<
+	    Metadata_Type,
+	    null_node_metadata>::value
+	  };
+
+	PB_DS_STATIC_ASSERT(should_have_metadata, has_metadata);
+
+	PB_DS_DBG_ASSERT(m_p_metadata != NULL);
+
+	return (*m_p_metadata);
+      }
+
+      inline this_type
+      get_l_child() const
+      {
+	if (m_p_begin_value == m_p_value)
+	  return (this_type(                m_p_begin_value,  m_p_begin_value,  m_p_begin_value));
+
+	const_metadata_pointer p_begin_metadata =
+	  m_p_metadata - (m_p_value - m_p_begin_value);
+
+	return (this_type(
+			  mid_pointer(m_p_begin_value, m_p_value),
+			  m_p_begin_value,
+			  m_p_value,
+			  mid_pointer(p_begin_metadata, m_p_metadata)));
+      }
+
+      inline this_type
+      get_r_child() const
+      {
+	if (m_p_value == m_p_end_value)
+	  return (this_type(                m_p_end_value,  m_p_end_value,  m_p_end_value));
+
+	const_metadata_pointer p_end_metadata =
+	  m_p_metadata + (m_p_end_value - m_p_value);
+
+	return (this_type(
+			  mid_pointer(m_p_value + 1, m_p_end_value),
+			  m_p_value + 1,
+			  m_p_end_value,(m_p_metadata == NULL)?
+			  NULL : mid_pointer(m_p_metadata + 1, p_end_metadata)));
+      }
+
+      inline bool
+      operator==(const this_type& other) const
+      {
+	const bool is_end = m_p_begin_value == m_p_end_value;
+	const bool is_other_end = other.m_p_begin_value == other.m_p_end_value;
+
+	if (is_end)
+	  return (is_other_end);
+
+	if (is_other_end)
+	  return (is_end);
+
+	return (m_p_value == other.m_p_value);
+      }
+
+      inline bool
+      operator!=(const this_type& other) const
+      {
+	return (!operator==(other));
+      }
+
+    public:
+      pointer m_p_value;
+      pointer m_p_begin_value;
+      pointer m_p_end_value;
+
+      const_metadata_pointer m_p_metadata;
+    };
+
+#define PB_DS_OV_TREE_NODE_ITERATOR_C_DEC			\
+    ov_tree_node_it_<						\
+						Value_Type,	\
+						Metadata_Type,	\
+						Allocator>
+
+    // Node reference.
+    template<typename Value_Type, typename Metadata_Type, class Allocator>
+    class ov_tree_node_it_ : public PB_DS_OV_TREE_CONST_NODE_ITERATOR_C_DEC
+    {
+
+    private:
+      typedef PB_DS_OV_TREE_NODE_ITERATOR_C_DEC this_type;
+
+      typedef PB_DS_OV_TREE_CONST_NODE_ITERATOR_C_DEC base_type;
+
+      typedef typename base_type::pointer pointer;
+
+      typedef typename base_type::const_pointer const_pointer;
+
+      typedef
+      typename base_type::const_metadata_pointer
+      const_metadata_pointer;
+
+    public:
+
+      typedef trivial_iterator_tag iterator_category;
+
+      typedef trivial_iterator_difference_type difference_type;
+
+      typedef
+      typename Allocator::template rebind<
+	Value_Type>::other::pointer
+      value_type;
+
+      typedef
+      typename Allocator::template rebind<
+	typename remove_const<
+	Value_Type>::type>::other::pointer
+      reference;
+
+      typedef
+      typename Allocator::template rebind<
+	typename remove_const<
+	Value_Type>::type>::other::pointer
+      const_reference;
+
+    public:
+      inline
+      ov_tree_node_it_(const_pointer p_nd = NULL,  const_pointer p_begin_nd = NULL,  const_pointer p_end_nd = NULL,  const_metadata_pointer p_metadata = NULL) : base_type(                p_nd,  p_begin_nd,  p_end_nd,  p_metadata)
+      { }
+
+      // Access.
+      inline reference
+      operator*() const
+      {
+	return (reference(base_type::m_p_value));
+      }
+
+      // Returns the node reference associated with the left node.
+      inline ov_tree_node_it_
+      get_l_child() const
+      {
+	if (base_type::m_p_begin_value == base_type::m_p_value)
+	  return (this_type(                base_type::m_p_begin_value,  base_type::m_p_begin_value,  base_type::m_p_begin_value));
+
+	const_metadata_pointer p_begin_metadata =
+	  base_type::m_p_metadata - (base_type::m_p_value - base_type::m_p_begin_value);
+
+	return (this_type(
+			  base_type::mid_pointer(base_type::m_p_begin_value, base_type::m_p_value),
+			  base_type::m_p_begin_value,
+			  base_type::m_p_value,
+			  base_type::mid_pointer(p_begin_metadata, base_type::m_p_metadata)));
+      }
+
+      // Returns the node reference associated with the right node.
+      inline ov_tree_node_it_
+      get_r_child() const
+      {
+	if (base_type::m_p_value == base_type::m_p_end_value)
+	  return (this_type(                base_type::m_p_end_value,  base_type::m_p_end_value,  base_type::m_p_end_value));
+
+	const_metadata_pointer p_end_metadata =
+	  base_type::m_p_metadata + (base_type::m_p_end_value - base_type::m_p_value);
+
+	return (this_type(
+			  base_type::mid_pointer(base_type::m_p_value + 1, base_type::m_p_end_value),
+			  base_type::m_p_value + 1,
+			  base_type::m_p_end_value,(base_type::m_p_metadata == NULL)?
+			  NULL : base_type::mid_pointer(base_type::m_p_metadata + 1, p_end_metadata)));
+      }
+
+    };
+
+#undef PB_DS_OV_TREE_NODE_ITERATOR_C_DEC
+
+#undef PB_DS_OV_TREE_CONST_NODE_ITERATOR_C_DEC
+
+#undef PB_DS_STATIC_ASSERT
+
+#undef PB_DS_DBG_ASSERT
+#undef PB_DS_DBG_VERIFY
+#undef PB_DS_DBG_ONLY
+
+  } // namespace detail
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_OV_TREE_NODE_ITERATORS_HPP
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/ov_tree_map_/ov_tree_map_.hpp b/libstdc++-v3/include/ext/pb_ds/detail/ov_tree_map_/ov_tree_map_.hpp
new file mode 100644
index 00000000000..e338abf7529
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/ov_tree_map_/ov_tree_map_.hpp
@@ -0,0 +1,696 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file ov_tree_map_.hpp
+ * Contains an implementation class for ov_tree_.
+ */
+
+#include <map>
+#include <set>
+#include <ext/pb_ds/tree_policy.hpp>
+#include <ext/pb_ds/detail/eq_fn/eq_by_less.hpp>
+#include <ext/pb_ds/detail/types_traits.hpp>
+#include <ext/pb_ds/detail/map_debug_base.hpp>
+#include <ext/pb_ds/detail/type_utils.hpp>
+#include <ext/pb_ds/exception.hpp>
+#include <ext/pb_ds/detail/tree_trace_base.hpp>
+#include <utility>
+#include <functional>
+#include <algorithm>
+#include <vector>
+#include <assert.h>
+
+namespace pb_ds
+{
+  namespace detail
+  {
+
+#ifdef PB_DS_OV_TREE_DEBUG_
+#define PB_DS_DBG_ASSERT(X) assert(X);
+#define PB_DS_DBG_VERIFY(X) PB_DS_DBG_ASSERT(X)
+#define PB_DS_DBG_ONLY(X) X
+#else // #ifdef PB_DS_OV_TREE_DEBUG_
+#define PB_DS_DBG_ASSERT(X) ((void)0)
+#define PB_DS_DBG_VERIFY(X) X
+#define PB_DS_DBG_ONLY(X) ;
+#endif // #ifdef PB_DS_OV_TREE_DEBUG_
+
+#define PB_DS_CLASS_T_DEC						\
+    template<								\
+						typename Key,		\
+						typename Mapped,	\
+						class Cmp_Fn,		\
+						class Node_And_It_Traits, \
+						class Allocator>
+
+#ifdef PB_DS_DATA_TRUE_INDICATOR
+#define PB_DS_OV_TREE_CLASS_NAME		\
+    ov_tree_data_
+#endif // #ifdef PB_DS_DATA_TRUE_INDICATOR
+
+#ifdef PB_DS_DATA_FALSE_INDICATOR
+#define PB_DS_OV_TREE_CLASS_NAME		\
+    ov_tree_no_data_
+#endif // #ifdef PB_DS_DATA_FALSE_INDICATOR
+
+#ifdef PB_DS_DATA_TRUE_INDICATOR
+#define PB_DS_CONST_NODE_ITERATOR_NAME ov_tree_const_node_iterator_data_
+#else // #ifdef PB_DS_DATA_TRUE_INDICATOR
+#define PB_DS_CONST_NODE_ITERATOR_NAME ov_tree_const_node_iterator_no_data_
+#endif // #ifdef PB_DS_DATA_TRUE_INDICATOR
+
+#define PB_DS_CLASS_C_DEC						\
+    PB_DS_OV_TREE_CLASS_NAME<						\
+							Key,		\
+							Mapped,		\
+							Cmp_Fn,		\
+							Node_And_It_Traits, \
+							Allocator>
+
+#define PB_DS_TYPES_TRAITS_C_DEC				\
+    types_traits<						\
+						Key,		\
+						Mapped,		\
+						Allocator,	\
+						false>
+
+#ifdef PB_DS_USE_MAP_DEBUG_BASE
+#define PB_DS_MAP_DEBUG_BASE_C_DEC					\
+    map_debug_base<					\
+									Key, \
+									eq_by_less<Key, Cmp_Fn>, \
+									typename Allocator::template rebind< \
+													     Key>::other::const_reference>
+#endif // #ifdef PB_DS_USE_MAP_DEBUG_BASE
+
+#ifdef PB_DS_DATA_TRUE_INDICATOR
+#define PB_DS_V2F(X) (X).first
+#define PB_DS_V2S(X) (X).second
+#define PB_DS_EP2VP(X)& ((X)->m_value)
+#endif // #ifdef PB_DS_DATA_TRUE_INDICATOR
+
+#ifdef PB_DS_DATA_FALSE_INDICATOR
+#define PB_DS_V2F(X) (X)
+#define PB_DS_V2S(X) Mapped_Data()
+#define PB_DS_EP2VP(X)& ((X)->m_value.first)
+#endif // #ifdef PB_DS_DATA_FALSE_INDICATOR
+
+#ifdef PB_DS_TREE_TRACE
+#define PB_DS_TREE_TRACE_BASE_C_DEC					\
+    tree_trace_base<							\
+									typename Node_And_It_Traits::const_node_iterator, \
+									typename Node_And_It_Traits::node_iterator, \
+									Cmp_Fn,	\
+									false, \
+									Allocator>
+#endif // #ifdef PB_DS_TREE_TRACE
+
+    // Ordered-vector tree associative-container.
+    template<typename Key,
+	     typename Mapped,
+	     class Cmp_Fn,
+	     class Node_And_It_Traits,
+	     class Allocator>
+    class PB_DS_OV_TREE_CLASS_NAME :
+#ifdef PB_DS_OV_TREE_DEBUG_
+      protected PB_DS_MAP_DEBUG_BASE_C_DEC,
+#endif // #ifdef PB_DS_OV_TREE_DEBUG_
+#ifdef PB_DS_TREE_TRACE
+      public PB_DS_TREE_TRACE_BASE_C_DEC,
+#endif // #ifdef PB_DS_TREE_TRACE
+      public Cmp_Fn,
+      public Node_And_It_Traits::node_update,
+      public PB_DS_TYPES_TRAITS_C_DEC
+    {
+
+    private:
+      typedef
+      typename remove_const<
+      typename PB_DS_TYPES_TRAITS_C_DEC::value_type>::type
+      non_const_value_type;
+
+      typedef
+      typename Allocator::template rebind<
+	non_const_value_type>::other
+      value_allocator;
+
+      typedef typename value_allocator::pointer value_vector;
+
+      typedef PB_DS_TYPES_TRAITS_C_DEC traits_base;
+
+      typedef Cmp_Fn cmp_fn_base;
+
+#ifdef PB_DS_USE_MAP_DEBUG_BASE
+      typedef PB_DS_MAP_DEBUG_BASE_C_DEC map_debug_base;
+#endif // #ifdef PB_DS_USE_MAP_DEBUG_BASE
+
+      typedef typename PB_DS_TYPES_TRAITS_C_DEC::pointer mapped_pointer_;
+
+      typedef
+      typename PB_DS_TYPES_TRAITS_C_DEC::const_pointer
+      const_mapped_pointer_;
+
+      typedef typename Node_And_It_Traits::metadata_type metadata_type;
+
+      typedef
+      typename Allocator::template rebind<
+	metadata_type>::other
+      metadata_allocator;
+
+      typedef typename metadata_allocator::pointer metadata_pointer;
+
+      typedef
+      typename metadata_allocator::const_reference
+      const_metadata_reference;
+
+      typedef typename metadata_allocator::reference metadata_reference;
+
+      typedef
+      typename Node_And_It_Traits::null_node_update_pointer
+      null_node_update_pointer;
+
+    public:
+
+      typedef typename Allocator::size_type size_type;
+
+      typedef typename Allocator::difference_type difference_type;
+
+      typedef Cmp_Fn cmp_fn;
+
+      typedef typename Node_And_It_Traits::node_update node_update;
+
+      typedef Allocator allocator;
+
+      typedef typename PB_DS_TYPES_TRAITS_C_DEC::key_type key_type;
+
+      typedef typename PB_DS_TYPES_TRAITS_C_DEC::key_pointer key_pointer;
+
+      typedef
+      typename PB_DS_TYPES_TRAITS_C_DEC::const_key_pointer
+      const_key_pointer;
+
+      typedef typename PB_DS_TYPES_TRAITS_C_DEC::key_reference key_reference;
+
+      typedef
+      typename PB_DS_TYPES_TRAITS_C_DEC::const_key_reference
+      const_key_reference;
+
+      typedef typename PB_DS_TYPES_TRAITS_C_DEC::mapped_type mapped_type;
+
+      typedef
+      typename PB_DS_TYPES_TRAITS_C_DEC::mapped_pointer
+      mapped_pointer;
+
+      typedef
+      typename PB_DS_TYPES_TRAITS_C_DEC::const_mapped_pointer
+      const_mapped_pointer;
+
+      typedef
+      typename PB_DS_TYPES_TRAITS_C_DEC::mapped_reference
+      mapped_reference;
+
+      typedef
+      typename PB_DS_TYPES_TRAITS_C_DEC::const_mapped_reference
+      const_mapped_reference;
+
+      typedef typename PB_DS_TYPES_TRAITS_C_DEC::value_type value_type;
+
+      typedef typename PB_DS_TYPES_TRAITS_C_DEC::pointer pointer;
+
+      typedef typename PB_DS_TYPES_TRAITS_C_DEC::const_pointer const_pointer;
+
+      typedef typename PB_DS_TYPES_TRAITS_C_DEC::reference reference;
+
+      typedef
+      typename PB_DS_TYPES_TRAITS_C_DEC::const_reference
+      const_reference;
+
+      typedef const_pointer const_point_iterator;
+
+#ifdef PB_DS_DATA_TRUE_INDICATOR
+      typedef pointer point_iterator;
+#else // #ifdef PB_DS_DATA_TRUE_INDICATOR
+      typedef const_point_iterator point_iterator;
+#endif // #ifdef PB_DS_DATA_TRUE_INDICATOR
+
+      typedef const_point_iterator const_iterator;
+
+      typedef point_iterator iterator;
+
+#include <ext/pb_ds/detail/ov_tree_map_/cond_dtor.hpp>
+
+      typedef
+      typename Node_And_It_Traits::const_node_iterator
+      const_node_iterator;
+
+      typedef typename Node_And_It_Traits::node_iterator node_iterator;
+
+    public:
+
+      PB_DS_OV_TREE_CLASS_NAME();
+
+      PB_DS_OV_TREE_CLASS_NAME(const Cmp_Fn& r_cmp_fn);
+
+      PB_DS_OV_TREE_CLASS_NAME(const Cmp_Fn& r_cmp_fn, const node_update& r_node_update);
+
+      PB_DS_OV_TREE_CLASS_NAME(const PB_DS_CLASS_C_DEC& other);
+
+      ~PB_DS_OV_TREE_CLASS_NAME();
+
+      void
+      swap(PB_DS_CLASS_C_DEC& other);
+
+      template<typename It>
+      void
+      copy_from_range(It first_it, It last_it);
+
+      inline size_type
+      max_size() const;
+
+      inline bool
+      empty() const;
+
+      inline size_type
+      size() const;
+
+      Cmp_Fn& 
+      get_cmp_fn();
+
+      const Cmp_Fn& 
+      get_cmp_fn() const;
+
+      inline mapped_reference
+      operator[](const_key_reference r_key)
+      {
+#ifdef PB_DS_DATA_TRUE_INDICATOR
+	PB_DS_DBG_ONLY(assert_valid();)
+
+	  point_iterator it = lower_bound(r_key);
+
+	if (it != end()&&  !Cmp_Fn::operator()(
+					       r_key,
+					       PB_DS_V2F(*it)))
+	  {
+	    PB_DS_DBG_ONLY(map_debug_base::check_key_exists(r_key));
+
+	    PB_DS_DBG_ONLY(assert_valid();)
+
+	      return (it->second);
+	  }
+
+	PB_DS_DBG_ONLY(assert_valid();)
+
+	  return (insert_new_val(it,
+				 std::make_pair(
+						r_key,
+						mapped_type()))->second);
+#else // #ifdef PB_DS_DATA_TRUE_INDICATOR
+	insert(r_key);
+
+	return (traits_base::s_null_mapped);
+#endif // #ifdef PB_DS_DATA_TRUE_INDICATOR
+      }
+
+      inline std::pair<point_iterator, bool>
+      insert(const_reference r_value)
+      {
+	PB_DS_DBG_ONLY(assert_valid();)
+
+	  const_key_reference r_key = PB_DS_V2F(r_value);
+
+	point_iterator it = lower_bound(r_key);
+
+	if (it != end()&&  !Cmp_Fn::operator()(
+					       r_key,
+					       PB_DS_V2F(*it)))
+	  {
+	    PB_DS_DBG_ONLY(assert_valid();)
+
+	      PB_DS_DBG_ONLY(map_debug_base::check_key_exists(r_key));
+
+	    return (std::make_pair(it, false));
+	  }
+
+	PB_DS_DBG_ONLY(assert_valid();)
+
+	  return (std::make_pair(insert_new_val(it, r_value), true));
+      }
+
+      inline point_iterator
+      lower_bound(const_key_reference r_key)
+      {
+	pointer it = m_a_values;
+
+	pointer e_it = m_a_values + m_size;
+
+	while (it != e_it)
+	  {
+	    pointer mid_it = it + ((e_it - it) >> 1);
+
+	    if (cmp_fn_base::operator()(
+					PB_DS_V2F(*mid_it),
+					r_key))
+	      it = ++mid_it;
+	    else
+	      e_it = mid_it;
+	  }
+
+	return (it);
+      }
+
+      inline const_point_iterator
+      lower_bound(const_key_reference r_key) const
+      {
+	return (const_cast<PB_DS_CLASS_C_DEC& >(*this).lower_bound(r_key));
+      }
+
+      inline point_iterator
+      upper_bound(const_key_reference r_key)
+      {
+	iterator pot_it = lower_bound(r_key);
+
+	if (pot_it != end()&&  !Cmp_Fn::operator()(
+						   r_key,
+						   PB_DS_V2F(*pot_it)))
+	  {
+	    PB_DS_DBG_ONLY(map_debug_base::check_key_exists(r_key));
+
+	    return (++pot_it);
+	  }
+
+	PB_DS_DBG_ONLY(map_debug_base::check_key_does_not_exist(r_key));
+
+	return (pot_it);
+      }
+
+      inline const_point_iterator
+      upper_bound(const_key_reference r_key) const
+      {
+	return (const_cast<PB_DS_CLASS_C_DEC& >(*this).upper_bound(r_key));
+      }
+
+      inline point_iterator
+      find(const_key_reference r_key)
+      {
+	PB_DS_DBG_ONLY(assert_valid();)
+
+	  iterator pot_it = lower_bound(r_key);
+
+	if (pot_it != end()&&  !Cmp_Fn::operator()(
+						   r_key,
+						   PB_DS_V2F(*pot_it)))
+	  {
+	    PB_DS_DBG_ONLY(map_debug_base::check_key_exists(r_key));
+
+	    return (pot_it);
+	  }
+
+	PB_DS_DBG_ONLY(map_debug_base::check_key_does_not_exist(r_key));
+
+	return (end());
+      }
+
+      inline const_point_iterator
+      find(const_key_reference r_key) const
+      {
+	return (const_cast<PB_DS_CLASS_C_DEC& >(*this).find(r_key));
+      }
+
+      bool
+      erase(const_key_reference r_key);
+
+      template<typename Pred>
+      inline size_type
+      erase_if(Pred pred);
+
+      inline iterator
+      erase(iterator it)
+      {
+	return (erase_imp<iterator>(it));
+      }
+
+      void
+      clear();
+
+      void
+      join(PB_DS_CLASS_C_DEC& other);
+
+      void
+      split(const_key_reference r_key, PB_DS_CLASS_C_DEC& other);
+
+      inline iterator
+      begin()
+      {
+	return (m_a_values);
+      }
+
+      inline const_iterator
+      begin() const
+      {
+	return (m_a_values);
+      }
+
+      inline iterator
+      end()
+      {
+	return (m_end_it);
+      }
+
+      inline const_iterator
+      end() const
+      {
+	return (m_end_it);
+      }
+
+      inline const_node_iterator
+      node_begin() const;
+
+      inline const_node_iterator
+      node_end() const;
+
+      inline node_iterator
+      node_begin();
+
+      inline node_iterator
+      node_end();
+
+    private:
+
+      inline void
+      update(node_iterator /*it*/, null_node_update_pointer);
+
+      template<typename Node_Update>
+      void
+      update(node_iterator it, Node_Update* p_update);
+
+      void
+      reallocate_metadata(null_node_update_pointer, size_type);
+
+      template<typename Node_Update_>
+      void
+      reallocate_metadata(Node_Update_* p_update, size_type new_size);
+
+      template<typename It>
+      void
+      copy_from_ordered_range(It first_it, It last_it);
+
+      void
+      value_swap(PB_DS_CLASS_C_DEC& other);
+
+      template<typename It>
+      void
+      copy_from_ordered_range(It first_it, It last_it, It other_first_it, It other_last_it);
+
+      template<typename Ptr>
+      inline static Ptr
+      mid_pointer(Ptr p_begin, Ptr p_end)
+      {
+	PB_DS_DBG_ASSERT(p_end >= p_begin);
+
+	return (p_begin + (p_end - p_begin) / 2);
+      }
+
+      inline iterator
+      insert_new_val(iterator it, const_reference r_value)
+      {
+	PB_DS_DBG_ONLY(assert_valid();)
+
+#ifdef PB_DS_REGRESSION
+	  typename Allocator::group_throw_prob_adjustor adjust(m_size);
+#endif // #ifdef PB_DS_REGRESSION
+
+	PB_DS_DBG_ONLY(map_debug_base::check_key_does_not_exist(
+								PB_DS_V2F(r_value)));
+
+	value_vector a_values = s_value_alloc.allocate(m_size + 1);
+
+	iterator source_it = begin();
+	iterator source_end_it = end();
+	iterator target_it = a_values;
+	iterator ret_it;
+
+	cond_dtor<size_type> cd(a_values, target_it, m_size + 1);
+
+	while (source_it != it)
+	  {
+	    new (const_cast<void* >(
+				    static_cast<const void* >(target_it)))
+	      value_type(*source_it++);
+
+	    ++target_it;
+	  }
+
+	new (const_cast<void* >(
+				static_cast<const void* >(ret_it = target_it)))
+	  value_type(r_value);
+
+	++target_it;
+
+	while (source_it != source_end_it)
+	  {
+	    new (const_cast<void* >(
+				    static_cast<const void* >(target_it)))
+	      value_type(*source_it++);
+
+	    ++target_it;
+	  }
+
+	reallocate_metadata((node_update* )this, m_size + 1);
+
+	cd.set_no_action();
+
+	if (m_size != 0)
+	  {
+	    cond_dtor<size_type> cd1(m_a_values, m_end_it, m_size);
+	  }
+
+	++m_size;
+
+	m_a_values = a_values;
+
+	m_end_it = m_a_values + m_size;
+
+	PB_DS_DBG_ONLY(map_debug_base::insert_new(
+						  PB_DS_V2F(r_value)));
+
+	update(node_begin(), (node_update* )this);
+
+	PB_DS_DBG_ONLY(PB_DS_CLASS_C_DEC::assert_valid();)
+
+	  return (ret_it);
+      }
+
+#ifdef PB_DS_OV_TREE_DEBUG_
+
+      void
+      assert_valid() const;
+
+      void
+      assert_iterators() const;
+
+#endif // #ifdef PB_DS_OV_TREE_DEBUG_
+
+      template<typename It>
+      It
+      erase_imp(It it);
+
+      inline const_node_iterator
+      PB_DS_node_begin_imp() const;
+
+      inline const_node_iterator
+      PB_DS_node_end_imp() const;
+
+      inline node_iterator
+      PB_DS_node_begin_imp();
+
+      inline node_iterator
+      PB_DS_node_end_imp();
+
+    private:
+      value_vector m_a_values;
+
+      static value_allocator s_value_alloc;
+
+      metadata_pointer m_a_metadata;
+
+      static metadata_allocator s_metadata_alloc;
+
+      iterator m_end_it;
+
+      size_type m_size;
+    };
+
+#include <ext/pb_ds/detail/ov_tree_map_/constructors_destructor_fn_imps.hpp>
+#include <ext/pb_ds/detail/ov_tree_map_/iterators_fn_imps.hpp>
+#include <ext/pb_ds/detail/ov_tree_map_/debug_fn_imps.hpp>
+#include <ext/pb_ds/detail/ov_tree_map_/erase_fn_imps.hpp>
+#include <ext/pb_ds/detail/ov_tree_map_/insert_fn_imps.hpp>
+#include <ext/pb_ds/detail/ov_tree_map_/info_fn_imps.hpp>
+#include <ext/pb_ds/detail/ov_tree_map_/split_join_fn_imps.hpp>
+#include <ext/pb_ds/detail/bin_search_tree_/policy_access_fn_imps.hpp>
+
+#undef PB_DS_CLASS_C_DEC
+
+#undef PB_DS_CLASS_T_DEC
+
+#undef PB_DS_OV_TREE_CLASS_NAME
+
+#undef PB_DS_TYPES_TRAITS_C_DEC
+
+#undef PB_DS_MAP_DEBUG_BASE_C_DEC
+
+#ifdef PB_DS_TREE_TRACE
+#undef PB_DS_TREE_TRACE_BASE_C_DEC
+#endif // #ifdef PB_DS_TREE_TRACE
+
+#undef PB_DS_V2F
+#undef PB_DS_EP2VP
+#undef PB_DS_V2S
+
+#undef PB_DS_DBG_ASSERT
+#undef PB_DS_DBG_VERIFY
+#undef PB_DS_DBG_ONLY
+
+#undef PB_DS_CONST_NODE_ITERATOR_NAME
+
+  } // namespace detail
+} // namespace pb_ds
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/ov_tree_map_/policy_access_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/ov_tree_map_/policy_access_fn_imps.hpp
new file mode 100644
index 00000000000..adb08a8922f
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/ov_tree_map_/policy_access_fn_imps.hpp
@@ -0,0 +1,61 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file policy_access_fn_imps.hpp
+ * Contains an implementation class for bin_search_tree_.
+ */
+
+PB_DS_CLASS_T_DEC
+Cmp_Fn& 
+PB_DS_CLASS_C_DEC::
+get_cmp_fn()
+{
+  return (*this);
+}
+
+PB_DS_CLASS_T_DEC
+const Cmp_Fn& 
+PB_DS_CLASS_C_DEC::
+get_cmp_fn() const
+{
+  return (*this);
+}
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/ov_tree_map_/split_join_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/ov_tree_map_/split_join_fn_imps.hpp
new file mode 100644
index 00000000000..193241f09b0
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/ov_tree_map_/split_join_fn_imps.hpp
@@ -0,0 +1,179 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file split_join_fn_imps.hpp
+ * Contains an implementation class for ov_tree_.
+ */
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+split(const_key_reference r_key, PB_DS_CLASS_C_DEC& other)
+{
+  PB_DS_DBG_ONLY(assert_valid();)
+    PB_DS_DBG_ONLY(other.assert_valid();)
+
+    if (m_size == 0)
+      {
+        other.clear();
+
+        PB_DS_DBG_ONLY(assert_valid();)
+	  PB_DS_DBG_ONLY(other.assert_valid();)
+
+	  return;
+      }
+
+  if (Cmp_Fn::operator()(r_key, PB_DS_V2F(*begin())))
+    {
+      value_swap(other);
+
+      PB_DS_DBG_ONLY(assert_valid();)
+        PB_DS_DBG_ONLY(other.assert_valid();)
+
+        return;
+    }
+
+  if (!Cmp_Fn::operator()(
+			  r_key,
+			  PB_DS_V2F(*(end() - 1))))
+    {
+      PB_DS_DBG_ONLY(assert_valid();)
+        PB_DS_DBG_ONLY(other.assert_valid();)
+
+        return;
+    }
+
+  if (m_size == 1)
+    {
+      value_swap(other);
+
+      PB_DS_DBG_ONLY(assert_valid();)
+        PB_DS_DBG_ONLY(other.assert_valid();)
+
+        return;
+    }
+
+  PB_DS_DBG_ONLY(map_debug_base::join(other);)
+
+    iterator it = upper_bound(r_key);
+
+  PB_DS_CLASS_C_DEC new_other(other, other);
+
+  new_other.copy_from_ordered_range(it, end());
+
+  PB_DS_CLASS_C_DEC new_this(*this, * this);
+
+  new_this.copy_from_ordered_range(begin(), it);
+
+  // No exceptions from this point.
+
+  PB_DS_DBG_ONLY(map_debug_base::split(
+				       r_key,(Cmp_Fn& )(*this),
+				       other);)
+
+    other.update(other.node_begin(), (node_update* )(&other));
+
+  update(node_begin(), (node_update* )this);
+
+  other.value_swap(new_other);
+
+  value_swap(new_this);
+
+  PB_DS_DBG_ONLY(assert_valid();)
+    PB_DS_DBG_ONLY(other.assert_valid();)
+    }
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+join(PB_DS_CLASS_C_DEC& other)
+{
+  PB_DS_DBG_ONLY(assert_valid();)
+    PB_DS_DBG_ONLY(other.assert_valid();)
+
+    if (other.m_size == 0)
+      return;
+
+  if (m_size == 0)
+    {
+      value_swap(other);
+
+      return;
+    }
+
+  const bool greater = Cmp_Fn::operator()(
+					  PB_DS_V2F(*(end() - 1)),
+					  PB_DS_V2F(*other.begin()));
+
+  const bool lesser = Cmp_Fn::operator()(
+					 PB_DS_V2F(*(other.end() - 1)),
+					 PB_DS_V2F(*begin()));
+
+  if (!greater&&  !lesser)
+    throw join_error();
+
+  PB_DS_CLASS_C_DEC new_this(*this, * this);
+
+  if (greater)
+    new_this.copy_from_ordered_range(
+				     begin(),
+				     end(),
+				     other.begin(),
+				     other.end());
+  else
+    new_this.copy_from_ordered_range(
+				     other.begin(),
+				     other.end(),
+				     begin(),
+				     end());
+
+  // No exceptions from this point.
+
+  PB_DS_DBG_ONLY(map_debug_base::join(other);)
+
+    value_swap(new_this);
+
+  other.clear();
+
+  PB_DS_DBG_ONLY(assert_valid();)
+    PB_DS_DBG_ONLY(other.assert_valid();)
+    }
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/ov_tree_map_/traits.hpp b/libstdc++-v3/include/ext/pb_ds/detail/ov_tree_map_/traits.hpp
new file mode 100644
index 00000000000..182c0c8d393
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/ov_tree_map_/traits.hpp
@@ -0,0 +1,189 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file traits.hpp
+ * Contains an implementation class for ov_tree_.
+ */
+
+#ifndef PB_DS_OV_TREE_NODE_AND_IT_TRAITS_HPP
+#define PB_DS_OV_TREE_NODE_AND_IT_TRAITS_HPP
+
+#include <ext/pb_ds/detail/ov_tree_map_/node_iterators.hpp>
+
+namespace pb_ds
+{
+  namespace detail
+  {
+
+    template<typename Key,
+	     typename Mapped,
+	     class Cmp_Fn,
+	     template<typename Const_Node_Iterator,
+		      class Node_Iterator,
+		      class Cmp_Fn_,
+		      class Allocator_>
+    class Node_Update,
+	     class Allocator>
+    struct tree_traits<
+      Key,
+      Mapped,
+      Cmp_Fn,
+      Node_Update,
+      ov_tree_tag,
+      Allocator>
+    {
+    private:
+      typedef
+      typename types_traits<
+      Key,
+      Mapped,
+      Allocator,
+      false>::value_type
+      value_type;
+
+    public:
+      typedef
+      typename tree_node_metadata_selector<
+      Key,
+      Mapped,
+      Cmp_Fn,
+      Node_Update,
+      Allocator>::type
+      metadata_type;
+
+      typedef
+      ov_tree_node_const_it_<
+	value_type,
+	metadata_type,
+	Allocator>
+      const_node_iterator;
+
+      typedef
+      ov_tree_node_it_<
+	value_type,
+	metadata_type,
+	Allocator>
+      node_iterator;
+
+      typedef
+      Node_Update<
+	const_node_iterator,
+	node_iterator,
+	Cmp_Fn,
+	Allocator>
+      node_update;
+
+      typedef
+      pb_ds::null_tree_node_update<
+	const_node_iterator,
+	node_iterator,
+	Cmp_Fn,
+	Allocator>* 
+      null_node_update_pointer;
+    };
+
+    template<typename Key,
+	     class Cmp_Fn,
+	     template<typename Const_Node_Iterator,
+		      class Node_Iterator,
+		      class Cmp_Fn_,
+		      class Allocator_>
+    class Node_Update,
+	     class Allocator>
+    struct tree_traits<
+      Key,
+      null_mapped_type,
+      Cmp_Fn,
+      Node_Update,
+      ov_tree_tag,
+      Allocator>
+    {
+    private:
+      typedef
+      typename types_traits<
+      Key,
+      null_mapped_type,
+      Allocator,
+      false>::value_type
+      value_type;
+
+    public:
+      typedef
+      typename tree_node_metadata_selector<
+      Key,
+      null_mapped_type,
+      Cmp_Fn,
+      Node_Update,
+      Allocator>::type
+      metadata_type;
+
+      typedef
+      ov_tree_node_const_it_<
+	value_type,
+	metadata_type,
+	Allocator>
+      const_node_iterator;
+
+      typedef const_node_iterator node_iterator;
+
+      typedef
+      Node_Update<
+	const_node_iterator,
+	const_node_iterator,
+	Cmp_Fn,
+	Allocator>
+      node_update;
+
+      typedef
+      pb_ds::null_tree_node_update<
+	const_node_iterator,
+	node_iterator,
+	Cmp_Fn,
+	Allocator>* 
+      null_node_update_pointer;
+    };
+
+  } // namespace detail
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_OV_TREE_NODE_AND_IT_TRAITS_HPP
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/pairing_heap_/constructors_destructor_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/pairing_heap_/constructors_destructor_fn_imps.hpp
new file mode 100644
index 00000000000..280d10f191c
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/pairing_heap_/constructors_destructor_fn_imps.hpp
@@ -0,0 +1,97 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file constructors_destructor_fn_imps.hpp
+ * Contains an implementation class for a pairing heap.
+ */
+
+PB_DS_CLASS_T_DEC
+template<typename It>
+void
+PB_DS_CLASS_C_DEC::
+copy_from_range(It first_it, It last_it)
+{
+  while (first_it != last_it)
+    push(*(first_it++));
+
+  PB_DS_DBG_ONLY(assert_valid();)
+    }
+
+PB_DS_CLASS_T_DEC
+PB_DS_CLASS_C_DEC::
+pairing_heap_()
+{
+  PB_DS_DBG_ONLY(assert_valid();)
+    }
+
+PB_DS_CLASS_T_DEC
+PB_DS_CLASS_C_DEC::
+pairing_heap_(const Cmp_Fn& r_cmp_fn) :
+  PB_DS_BASE_C_DEC(r_cmp_fn)
+{
+  PB_DS_DBG_ONLY(assert_valid();)
+    }
+
+PB_DS_CLASS_T_DEC
+PB_DS_CLASS_C_DEC::
+pairing_heap_(const PB_DS_CLASS_C_DEC& other) :
+  PB_DS_BASE_C_DEC(other)
+{
+  PB_DS_DBG_ONLY(assert_valid();)
+    }
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+swap(PB_DS_CLASS_C_DEC& other)
+{
+  PB_DS_DBG_ONLY(assert_valid();)
+
+    PB_DS_BASE_C_DEC::swap(other);
+
+  PB_DS_DBG_ONLY(assert_valid();)
+    }
+
+PB_DS_CLASS_T_DEC
+PB_DS_CLASS_C_DEC::
+~pairing_heap_()
+{ }
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/pairing_heap_/debug_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/pairing_heap_/debug_fn_imps.hpp
new file mode 100644
index 00000000000..115b48cf225
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/pairing_heap_/debug_fn_imps.hpp
@@ -0,0 +1,60 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file debug_fn_imps.hpp
+ * Contains an implementation class for a pairing heap.
+ */
+
+#ifdef PB_DS_PAIRING_HEAP_DEBUG_
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+assert_valid() const
+{
+  PB_DS_DBG_ASSERT(base_type::m_p_root == NULL ||
+		   base_type::m_p_root->m_p_next_sibling == NULL);
+
+  base_type::assert_valid();
+}
+
+#endif // #ifdef PB_DS_PAIRING_HEAP_DEBUG_
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/pairing_heap_/erase_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/pairing_heap_/erase_fn_imps.hpp
new file mode 100644
index 00000000000..4d33eaccba0
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/pairing_heap_/erase_fn_imps.hpp
@@ -0,0 +1,302 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file erase_fn_imps.hpp
+ * Contains an implementation class for a pairing heap.
+ */
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+pop()
+{
+  PB_DS_DBG_ONLY(assert_valid();)
+    PB_DS_DBG_ASSERT(!base_type::empty());
+
+  node_pointer p_new_root = join_node_children(base_type::m_p_root);
+  PB_DS_DBG_ONLY(assert_node_consistent(p_new_root, false);)
+
+    if (p_new_root != NULL)
+      p_new_root->m_p_prev_or_parent = NULL;
+
+  base_type::actual_erase_node(base_type::m_p_root);
+
+  base_type::m_p_root = p_new_root;
+
+  PB_DS_DBG_ONLY(assert_valid();)
+    }
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+erase(point_iterator it)
+{
+  PB_DS_DBG_ONLY(assert_valid();)
+    PB_DS_DBG_ASSERT(!base_type::empty());
+
+  remove_node(it.m_p_nd);
+
+  base_type::actual_erase_node(it.m_p_nd);
+
+  PB_DS_DBG_ONLY(assert_valid();)
+    }
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+remove_node(node_pointer p_nd)
+{
+  PB_DS_DBG_ONLY(assert_valid();)
+    PB_DS_DBG_ASSERT(!base_type::empty());
+
+  node_pointer p_new_child = join_node_children(p_nd);
+
+#ifdef PB_DS_PAIRING_HEAP_DEBUG_
+  if (p_new_child != NULL)
+    base_type::assert_node_consistent(p_new_child, false);
+#endif // #ifdef PB_DS_PAIRING_HEAP_DEBUG_
+
+  if (p_nd == base_type::m_p_root)
+    {
+      if (p_new_child != NULL)
+	p_new_child->m_p_prev_or_parent = NULL;
+
+      base_type::m_p_root = p_new_child;
+
+      PB_DS_DBG_ONLY(base_type::assert_node_consistent(base_type::m_p_root, false);)
+
+        return;
+    }
+
+  PB_DS_DBG_ASSERT(p_nd->m_p_prev_or_parent != NULL);
+
+  if (p_nd->m_p_prev_or_parent->m_p_l_child == p_nd)
+    {
+      if (p_new_child != NULL)
+        {
+	  p_new_child->m_p_prev_or_parent = p_nd->m_p_prev_or_parent;
+
+	  p_new_child->m_p_next_sibling = p_nd->m_p_next_sibling;
+
+	  if (p_new_child->m_p_next_sibling != NULL)
+	    p_new_child->m_p_next_sibling->m_p_prev_or_parent = p_new_child;
+
+	  p_nd->m_p_prev_or_parent->m_p_l_child = p_new_child;
+
+	  PB_DS_DBG_ONLY(base_type::assert_node_consistent(p_nd->m_p_prev_or_parent, false);)
+
+            return;
+        }
+
+      p_nd->m_p_prev_or_parent->m_p_l_child = p_nd->m_p_next_sibling;
+
+      if (p_nd->m_p_next_sibling != NULL)
+	p_nd->m_p_next_sibling->m_p_prev_or_parent = p_nd->m_p_prev_or_parent;
+
+      PB_DS_DBG_ONLY(base_type::assert_node_consistent(p_nd->m_p_prev_or_parent, false);)
+
+        return;
+    }
+
+  if (p_new_child != NULL)
+    {
+      p_new_child->m_p_prev_or_parent = p_nd->m_p_prev_or_parent;
+
+      p_new_child->m_p_next_sibling = p_nd->m_p_next_sibling;
+
+      if (p_new_child->m_p_next_sibling != NULL)
+	p_new_child->m_p_next_sibling->m_p_prev_or_parent = p_new_child;
+
+      p_new_child->m_p_prev_or_parent->m_p_next_sibling = p_new_child;
+
+      PB_DS_DBG_ONLY(base_type::assert_node_consistent(p_nd->m_p_prev_or_parent, false);)
+
+        return;
+    }
+
+  p_nd->m_p_prev_or_parent->m_p_next_sibling = p_nd->m_p_next_sibling;
+
+  if (p_nd->m_p_next_sibling != NULL)
+    p_nd->m_p_next_sibling->m_p_prev_or_parent = p_nd->m_p_prev_or_parent;
+
+  PB_DS_DBG_ONLY(base_type::assert_node_consistent(p_nd->m_p_prev_or_parent, false);)
+    }
+
+PB_DS_CLASS_T_DEC
+typename PB_DS_CLASS_C_DEC::node_pointer
+PB_DS_CLASS_C_DEC::
+join_node_children(node_pointer p_nd)
+{
+  PB_DS_DBG_ASSERT(p_nd != NULL);
+
+  node_pointer p_ret = p_nd->m_p_l_child;
+
+  if (p_ret == NULL)
+    return NULL;
+
+  while (p_ret->m_p_next_sibling != NULL)
+    p_ret = forward_join(p_ret, p_ret->m_p_next_sibling);
+
+  while (p_ret->m_p_prev_or_parent != p_nd)
+    p_ret = back_join(p_ret->m_p_prev_or_parent, p_ret);
+
+  PB_DS_DBG_ONLY(assert_node_consistent(p_ret, false);)
+
+    return p_ret;
+}
+
+PB_DS_CLASS_T_DEC
+typename PB_DS_CLASS_C_DEC::node_pointer
+PB_DS_CLASS_C_DEC::
+forward_join(node_pointer p_nd, node_pointer p_next)
+{
+  PB_DS_DBG_ASSERT(p_nd != NULL);
+  PB_DS_DBG_ASSERT(p_nd->m_p_next_sibling == p_next);
+
+  if (Cmp_Fn::operator()(p_nd->m_value, p_next->m_value))
+    {
+      p_next->m_p_prev_or_parent = p_nd->m_p_prev_or_parent;
+
+      base_type::make_child_of(p_nd, p_next);
+
+      return p_next->m_p_next_sibling == NULL?
+	p_next :
+	p_next->m_p_next_sibling;
+    }
+
+  if (p_next->m_p_next_sibling != NULL)
+    {
+      p_next->m_p_next_sibling->m_p_prev_or_parent = p_nd;
+
+      p_nd->m_p_next_sibling = p_next->m_p_next_sibling;
+
+      base_type::make_child_of(p_next, p_nd);
+
+      return p_nd->m_p_next_sibling;
+    }
+
+  p_nd->m_p_next_sibling = NULL;
+
+  base_type::make_child_of(p_next, p_nd);
+  PB_DS_DBG_ONLY(base_type::assert_node_consistent(p_nd, false));
+
+  return p_nd;
+}
+
+PB_DS_CLASS_T_DEC
+typename PB_DS_CLASS_C_DEC::node_pointer
+PB_DS_CLASS_C_DEC::
+back_join(node_pointer p_nd, node_pointer p_next)
+{
+  PB_DS_DBG_ASSERT(p_nd != NULL);
+  PB_DS_DBG_ASSERT(p_next->m_p_next_sibling == NULL);
+
+  if (Cmp_Fn::operator()(p_nd->m_value, p_next->m_value))
+    {
+      p_next->m_p_prev_or_parent = p_nd->m_p_prev_or_parent;
+
+      base_type::make_child_of(p_nd, p_next);
+      PB_DS_DBG_ONLY(base_type::assert_node_consistent(p_next, false));
+
+      return p_next;
+    }
+
+  p_nd->m_p_next_sibling = NULL;
+
+  base_type::make_child_of(p_next, p_nd);
+  PB_DS_DBG_ONLY(base_type::assert_node_consistent(p_nd, false));
+
+  return p_nd;
+}
+
+PB_DS_CLASS_T_DEC
+template<typename Pred>
+typename PB_DS_CLASS_C_DEC::size_type
+PB_DS_CLASS_C_DEC::
+erase_if(Pred pred)
+{
+  PB_DS_DBG_ONLY(assert_valid();)
+
+    if (base_type::empty())
+      {
+        PB_DS_DBG_ONLY(assert_valid();)
+
+	  return 0;
+      }
+
+  base_type::to_linked_list();
+
+  node_pointer p_out = base_type::prune(pred);
+
+  size_type ersd = 0;
+
+  while (p_out != NULL)
+    {
+      ++ersd;
+
+      node_pointer p_next = p_out->m_p_next_sibling;
+
+      base_type::actual_erase_node(p_out);
+
+      p_out = p_next;
+    }
+
+  node_pointer p_cur = base_type::m_p_root;
+
+  base_type::m_p_root = NULL;
+
+  while (p_cur != NULL)
+    {
+      node_pointer p_next = p_cur->m_p_next_sibling;
+
+      p_cur->m_p_l_child = p_cur->m_p_next_sibling = p_cur->m_p_prev_or_parent = NULL;
+
+      push_imp(p_cur);
+
+      p_cur = p_next;
+    }
+
+  PB_DS_DBG_ONLY(assert_valid();)
+
+    return ersd;
+}
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/pairing_heap_/find_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/pairing_heap_/find_fn_imps.hpp
new file mode 100644
index 00000000000..6e6093f7347
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/pairing_heap_/find_fn_imps.hpp
@@ -0,0 +1,56 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file find_fn_imps.hpp
+ * Contains an implementation class for a pairing heap.
+ */
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::const_reference
+PB_DS_CLASS_C_DEC::
+top() const
+{
+  PB_DS_DBG_ONLY(assert_valid();)
+    PB_DS_DBG_ASSERT(!base_type::empty());
+
+  return base_type::m_p_root->m_value;
+}
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/pairing_heap_/insert_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/pairing_heap_/insert_fn_imps.hpp
new file mode 100644
index 00000000000..d3ebfbd453e
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/pairing_heap_/insert_fn_imps.hpp
@@ -0,0 +1,107 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file insert_fn_imps.hpp
+ * Contains an implementation class for a pairing heap.
+ */
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::point_iterator
+PB_DS_CLASS_C_DEC::
+push(const_reference r_val)
+{
+  PB_DS_DBG_ONLY(assert_valid();)
+
+    node_pointer p_new_nd = base_type::get_new_node_for_insert(r_val);
+
+  push_imp(p_new_nd);
+
+  PB_DS_DBG_ONLY(assert_valid();)
+
+    return point_iterator(p_new_nd);
+}
+
+PB_DS_CLASS_T_DEC
+inline void
+PB_DS_CLASS_C_DEC::
+push_imp(node_pointer p_nd)
+{
+  p_nd->m_p_l_child = NULL;
+
+  if (base_type::m_p_root == NULL)
+    {
+      p_nd->m_p_next_sibling = p_nd->m_p_prev_or_parent = NULL;
+
+      base_type::m_p_root = p_nd;
+    }
+  else if (Cmp_Fn::operator()(base_type::m_p_root->m_value, p_nd->m_value))
+    {
+      p_nd->m_p_next_sibling = p_nd->m_p_prev_or_parent = NULL;
+
+      base_type::make_child_of(base_type::m_p_root, p_nd);
+      PB_DS_DBG_ONLY(base_type::assert_node_consistent(p_nd, false));
+
+      base_type::m_p_root = p_nd;
+    }
+  else
+    {
+      base_type::make_child_of(p_nd, base_type::m_p_root);
+      PB_DS_DBG_ONLY(base_type::assert_node_consistent(base_type::m_p_root, false));
+    }
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+modify(point_iterator it, const_reference r_new_val)
+{
+  PB_DS_DBG_ONLY(assert_valid();)
+
+    remove_node(it.m_p_nd);
+
+  it.m_p_nd->m_value = r_new_val;
+
+  push_imp(it.m_p_nd);
+
+  PB_DS_DBG_ONLY(assert_valid();)
+    }
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/pairing_heap_/pairing_heap_.hpp b/libstdc++-v3/include/ext/pb_ds/detail/pairing_heap_/pairing_heap_.hpp
new file mode 100644
index 00000000000..e43ef4e0e42
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/pairing_heap_/pairing_heap_.hpp
@@ -0,0 +1,237 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file pairing_heap_.hpp
+ * Contains an implementation class for a pairing heap.
+ */
+
+/*
+ * Pairing heap:
+ * Michael L. Fredman, Robert Sedgewick, Daniel Dominic Sleator,
+ *    and Robert Endre Tarjan, The Pairing Heap:
+ *    A New Form of Self-Adjusting Heap, Algorithmica, 1(1):111-129, 1986.
+ */
+
+#include <ext/pb_ds/detail/cond_dealtor.hpp>
+#include <ext/pb_ds/detail/type_utils.hpp>
+#include <ext/pb_ds/detail/left_child_next_sibling_heap_/left_child_next_sibling_heap_.hpp>
+#include <ext/pb_ds/detail/left_child_next_sibling_heap_/null_metadata.hpp>
+
+namespace pb_ds
+{
+  namespace detail
+  {
+
+#ifdef PB_DS_PAIRING_HEAP_DEBUG_
+#define PB_DS_DBG_ASSERT(X) assert(X)
+#define PB_DS_DBG_VERIFY(X) assert(X)
+#define PB_DS_DBG_ONLY(X) X
+#else // #ifdef PB_DS_PAIRING_HEAP_DEBUG_
+#define PB_DS_DBG_ASSERT(X)
+#define PB_DS_DBG_VERIFY(X) {if((X)==0);}
+#define PB_DS_DBG_ONLY(X) ;
+#endif // #ifdef PB_DS_PAIRING_HEAP_DEBUG_
+
+#define PB_DS_CLASS_T_DEC						\
+    template<typename Value_Type, class Cmp_Fn, class Allocator>
+
+#define PB_DS_CLASS_C_DEC					\
+    pairing_heap_<						\
+						Value_Type,	\
+						Cmp_Fn,		\
+						Allocator>
+
+#ifdef PB_DS_LC_NS_HEAP_DEBUG_
+#define PB_DS_BASE_C_DEC						\
+    left_child_next_sibling_heap_<			\
+									Value_Type, \
+									Cmp_Fn,	\
+									null_left_child_next_sibling_heap_node_metadata, \
+									Allocator, \
+									false>
+#else // #ifdef PB_DS_LC_NS_HEAP_DEBUG_
+#define PB_DS_BASE_C_DEC						\
+    left_child_next_sibling_heap_<			\
+									Value_Type, \
+									Cmp_Fn,	\
+									null_left_child_next_sibling_heap_node_metadata, \
+									Allocator>
+#endif // #ifdef PB_DS_LC_NS_HEAP_DEBUG_
+
+    /**
+     * class description = "P4ri|\|g h3ap$">
+     **/
+    template<typename Value_Type, class Cmp_Fn, class Allocator>
+    class pairing_heap_ : public PB_DS_BASE_C_DEC
+    {
+
+    private:
+      typedef PB_DS_BASE_C_DEC base_type;
+
+      typedef typename base_type::node_pointer node_pointer;
+
+    public:
+
+      typedef typename Allocator::size_type size_type;
+
+      typedef typename Allocator::difference_type difference_type;
+
+      typedef Value_Type value_type;
+
+      typedef
+      typename Allocator::template rebind<
+	value_type>::other::pointer
+      pointer;
+
+      typedef
+      typename Allocator::template rebind<
+	value_type>::other::const_pointer
+      const_pointer;
+
+      typedef
+      typename Allocator::template rebind<
+	value_type>::other::reference
+      reference;
+
+      typedef
+      typename Allocator::template rebind<
+	value_type>::other::const_reference
+      const_reference;
+
+      typedef
+      typename PB_DS_BASE_C_DEC::const_point_iterator
+      const_point_iterator;
+
+      typedef typename PB_DS_BASE_C_DEC::point_iterator point_iterator;
+
+      typedef typename PB_DS_BASE_C_DEC::const_iterator const_iterator;
+
+      typedef typename PB_DS_BASE_C_DEC::iterator iterator;
+
+      typedef Cmp_Fn cmp_fn;
+
+      typedef Allocator allocator;
+
+
+      pairing_heap_();
+
+      pairing_heap_(const Cmp_Fn& r_cmp_fn);
+
+      pairing_heap_(const PB_DS_CLASS_C_DEC& other);
+
+      void
+      swap(PB_DS_CLASS_C_DEC& other);
+
+      ~pairing_heap_();
+
+      inline point_iterator
+      push(const_reference r_val);
+
+      void
+      modify(point_iterator it, const_reference r_new_val);
+
+      inline const_reference
+      top() const;
+
+      void
+      pop();
+
+      void
+      erase(point_iterator it);
+
+      template<typename Pred>
+      size_type
+      erase_if(Pred pred);
+
+      template<typename Pred>
+      void
+      split(Pred pred, PB_DS_CLASS_C_DEC& other);
+
+      void
+      join(PB_DS_CLASS_C_DEC& other);
+
+    protected:
+
+      template<typename It>
+      void
+      copy_from_range(It first_it, It last_it);
+
+#ifdef PB_DS_PAIRING_HEAP_DEBUG_
+      void
+      assert_valid() const;
+#endif
+
+    private:
+
+      inline void
+      push_imp(node_pointer p_nd);
+
+      node_pointer
+      join_node_children(node_pointer p_nd);
+
+      node_pointer
+      forward_join(node_pointer p_nd, node_pointer p_next);
+
+      node_pointer
+      back_join(node_pointer p_nd, node_pointer p_next);
+
+      void
+      remove_node(node_pointer p_nd);
+
+    };
+
+#include <ext/pb_ds/detail/pairing_heap_/constructors_destructor_fn_imps.hpp>
+#include <ext/pb_ds/detail/pairing_heap_/debug_fn_imps.hpp>
+#include <ext/pb_ds/detail/pairing_heap_/find_fn_imps.hpp>
+#include <ext/pb_ds/detail/pairing_heap_/insert_fn_imps.hpp>
+#include <ext/pb_ds/detail/pairing_heap_/erase_fn_imps.hpp>
+#include <ext/pb_ds/detail/pairing_heap_/split_join_fn_imps.hpp>
+
+#undef PB_DS_CLASS_C_DEC
+#undef PB_DS_CLASS_T_DEC
+#undef PB_DS_BASE_C_DEC
+#undef PB_DS_DBG_ASSERT
+#undef PB_DS_DBG_VERIFY
+#undef PB_DS_DBG_ONLY
+
+  } // namespace detail
+} // namespace pb_ds
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/pairing_heap_/split_join_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/pairing_heap_/split_join_fn_imps.hpp
new file mode 100644
index 00000000000..1d23cc1359d
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/pairing_heap_/split_join_fn_imps.hpp
@@ -0,0 +1,146 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file split_join_fn_imps.hpp
+ * Contains an implementation class for a pairing heap.
+ */
+
+PB_DS_CLASS_T_DEC
+template<typename Pred>
+void
+PB_DS_CLASS_C_DEC::
+split(Pred pred, PB_DS_CLASS_C_DEC& other)
+{
+  PB_DS_DBG_ONLY(assert_valid();)
+    PB_DS_DBG_ONLY(other.assert_valid();)
+
+    other.clear();
+
+  if (base_type::empty())
+    {
+      PB_DS_DBG_ONLY(assert_valid();)
+        PB_DS_DBG_ONLY(other.assert_valid();)
+
+        return;
+    }
+
+  base_type::to_linked_list();
+
+  node_pointer p_out = base_type::prune(pred);
+
+  while (p_out != NULL)
+    {
+      PB_DS_DBG_ASSERT(base_type::m_size > 0);
+      --base_type::m_size;
+
+      ++other.m_size;
+
+      node_pointer p_next = p_out->m_p_next_sibling;
+
+      p_out->m_p_l_child = p_out->m_p_next_sibling = p_out->m_p_prev_or_parent = NULL;
+
+      other.push_imp(p_out);
+
+      p_out = p_next;
+    }
+
+  PB_DS_DBG_ONLY(other.assert_valid();)
+
+    node_pointer p_cur = base_type::m_p_root;
+
+  base_type::m_p_root = NULL;
+
+  while (p_cur != NULL)
+    {
+      node_pointer p_next = p_cur->m_p_next_sibling;
+
+      p_cur->m_p_l_child = p_cur->m_p_next_sibling = p_cur->m_p_prev_or_parent = NULL;
+
+      push_imp(p_cur);
+
+      p_cur = p_next;
+    }
+
+  PB_DS_DBG_ONLY(assert_valid();)
+    PB_DS_DBG_ONLY(other.assert_valid();)
+    }
+
+PB_DS_CLASS_T_DEC
+inline void
+PB_DS_CLASS_C_DEC::
+join(PB_DS_CLASS_C_DEC& other)
+{
+  PB_DS_DBG_ONLY(assert_valid();)
+    PB_DS_DBG_ONLY(other.assert_valid();)
+
+    if (other.m_p_root == NULL)
+      {
+        PB_DS_DBG_ONLY(assert_valid();)
+	  PB_DS_DBG_ONLY(other.assert_valid();)
+
+	  return;
+      }
+
+  if (base_type::m_p_root == NULL)
+    base_type::m_p_root = other.m_p_root;
+  else if (Cmp_Fn::operator()(base_type::m_p_root->m_value, other.m_p_root->m_value))
+    {
+      base_type::make_child_of(base_type::m_p_root, other.m_p_root);
+      PB_DS_DBG_ONLY(base_type::assert_node_consistent(other.m_p_root, false));
+
+      base_type::m_p_root = other.m_p_root;
+    }
+  else
+    {
+      base_type::make_child_of(other.m_p_root, base_type::m_p_root);
+      PB_DS_DBG_ONLY(base_type::assert_node_consistent(base_type::m_p_root, false));
+    }
+
+  base_type::m_size += other.m_size;
+
+  other.m_p_root = NULL;
+  other.m_size = 0;
+
+  PB_DS_DBG_ONLY(assert_valid();)
+    PB_DS_DBG_ONLY(other.assert_valid();)
+    }
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/child_iterator.hpp b/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/child_iterator.hpp
new file mode 100644
index 00000000000..4f6d921c77d
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/child_iterator.hpp
@@ -0,0 +1,111 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file child_iterator.hpp
+ * Contains a iterator for a patricia tree.
+ */
+
+struct iterator : public const_iterator
+{
+public:
+  typedef std::forward_iterator_tag iterator_category;
+
+  typedef typename Allocator::difference_type difference_type;
+
+  typedef node_pointer value_type;
+
+  typedef node_pointer_pointer pointer;
+
+  typedef node_pointer_reference reference;
+
+public:
+  inline
+  iterator(node_pointer_pointer p_p_cur = NULL,  node_pointer_pointer p_p_end = NULL) : const_iterator(p_p_cur, p_p_end)
+  { }
+
+  inline bool
+  operator==(const iterator& other) const
+  {
+    return (const_iterator::m_p_p_cur == other.m_p_p_cur);
+  }
+
+  inline bool
+  operator!=(const iterator& other) const
+  {
+    return (const_iterator::m_p_p_cur != other.m_p_p_cur);
+  }
+
+  inline iterator& 
+  operator++()
+  {
+    const_iterator::operator++();
+
+    return (*this);
+  }
+
+  inline iterator
+  operator++(int)
+  {
+    iterator ret_it(*this);
+
+    operator++();
+
+    return (ret_it);
+  }
+
+  node_pointer_pointer
+  operator->()
+  {
+    PB_DS_DBG_ONLY(const_iterator::assert_referencible();)
+
+      return (const_iterator::m_p_p_cur);
+  }
+
+  node_pointer
+  operator*()
+  {
+    PB_DS_DBG_ONLY(const_iterator::assert_referencible();)
+
+      return (*const_iterator::m_p_p_cur);
+  }
+};
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/cond_dtor_entry_dealtor.hpp b/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/cond_dtor_entry_dealtor.hpp
new file mode 100644
index 00000000000..17de4e0f180
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/cond_dtor_entry_dealtor.hpp
@@ -0,0 +1,87 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file cond_dtor_entry_dealtor.hpp
+ * Contains a binary tree container conditional deallocator
+ */
+
+class cond_dealtor
+{
+public:
+  inline
+  cond_dealtor(leaf_pointer p_nd) : m_p_nd(p_nd),
+				    m_no_action_dtor(false),
+				    m_call_destructor(false)
+  { }
+
+  inline void
+  set_no_action_dtor()
+  {
+    m_no_action_dtor = true;
+  }
+
+  inline void
+  set_call_destructor()
+  {
+    m_call_destructor = true;
+  }
+
+  inline
+  ~cond_dealtor()
+  {
+    if (m_no_action_dtor)
+      return;
+
+    if (m_call_destructor)
+      m_p_nd->~leaf();
+
+    s_leaf_allocator.deallocate(m_p_nd, 1);
+  }
+
+protected:
+  leaf_pointer m_p_nd;
+
+  bool m_no_action_dtor;
+
+  bool m_call_destructor;
+};
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/const_child_iterator.hpp b/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/const_child_iterator.hpp
new file mode 100644
index 00000000000..d0e1ce98ce8
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/const_child_iterator.hpp
@@ -0,0 +1,128 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file const_child_iterator.hpp
+ * Contains a const_iterator for a patricia tree.
+ */
+
+struct const_iterator
+{
+public:
+  typedef std::forward_iterator_tag iterator_category;
+
+  typedef typename Allocator::difference_type difference_type;
+
+  typedef node_pointer value_type;
+
+  typedef node_pointer_pointer pointer;
+
+  typedef node_pointer_reference reference;
+
+public:
+  inline
+  const_iterator(node_pointer_pointer p_p_cur = NULL,  node_pointer_pointer p_p_end = NULL) : m_p_p_cur(p_p_cur),
+											      m_p_p_end(p_p_end)
+  { }
+
+  inline bool
+  operator==(const const_iterator& other) const
+  {
+    return (m_p_p_cur == other.m_p_p_cur);
+  }
+
+  inline bool
+  operator!=(const const_iterator& other) const
+  {
+    return (m_p_p_cur != other.m_p_p_cur);
+  }
+
+  inline const_iterator& 
+  operator++()
+  {
+    do
+      ++m_p_p_cur;
+    while (m_p_p_cur != m_p_p_end&& * m_p_p_cur == NULL);
+
+    return (*this);
+  }
+
+  inline const_iterator
+  operator++(int)
+  {
+    const_iterator ret_it(*this);
+
+    operator++();
+
+    return (ret_it);
+  }
+
+  const node_pointer_pointer
+  operator->() const
+  {
+    PB_DS_DBG_ONLY(assert_referencible();)
+
+      return (m_p_p_cur);
+  }
+
+  const_node_pointer
+  operator*() const
+  {
+    PB_DS_DBG_ONLY(assert_referencible();)
+
+      return (*m_p_p_cur);
+  }
+
+protected:
+#ifdef PB_DS_PAT_TRIE_DEBUG_
+  void
+  assert_referencible() const
+  {
+    PB_DS_DBG_ASSERT(m_p_p_cur != m_p_p_end&& * m_p_p_cur != NULL);
+  }
+#endif // #ifdef PB_DS_PAT_TRIE_DEBUG_
+
+public:
+  node_pointer_pointer m_p_p_cur;
+
+  node_pointer_pointer m_p_p_end;
+};
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/constructors_destructor_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/constructors_destructor_fn_imps.hpp
new file mode 100644
index 00000000000..6e39599f0e9
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/constructors_destructor_fn_imps.hpp
@@ -0,0 +1,262 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file constructors_destructor_fn_imps.hpp
+ * Contains an implementation class for bin_search_tree_.
+ */
+
+PB_DS_CLASS_T_DEC
+typename PB_DS_CLASS_C_DEC::head_allocator
+PB_DS_CLASS_C_DEC::s_head_allocator;
+
+PB_DS_CLASS_T_DEC
+typename PB_DS_CLASS_C_DEC::internal_node_allocator
+PB_DS_CLASS_C_DEC::s_internal_node_allocator;
+
+PB_DS_CLASS_T_DEC
+typename PB_DS_CLASS_C_DEC::leaf_allocator
+PB_DS_CLASS_C_DEC::s_leaf_allocator;
+
+PB_DS_CLASS_T_DEC
+PB_DS_CLASS_C_DEC::
+PB_DS_CLASS_NAME() :
+  m_p_head(s_head_allocator.allocate(1)),
+  m_size(0)
+{
+  initialize();
+
+  PB_DS_DBG_ONLY(assert_valid();)
+    }
+
+PB_DS_CLASS_T_DEC
+PB_DS_CLASS_C_DEC::
+PB_DS_CLASS_NAME(const e_access_traits& r_e_access_traits) :
+  synth_e_access_traits(r_e_access_traits),
+  m_p_head(s_head_allocator.allocate(1)),
+  m_size(0)
+{
+  initialize();
+
+  PB_DS_DBG_ONLY(assert_valid();)
+    }
+
+PB_DS_CLASS_T_DEC
+PB_DS_CLASS_C_DEC::
+PB_DS_CLASS_NAME(const PB_DS_CLASS_C_DEC& other) :
+#ifdef PB_DS_PAT_TRIE_DEBUG_
+  map_debug_base(other),
+#endif // #ifdef PB_DS_PAT_TRIE_DEBUG_
+  synth_e_access_traits(other),
+  node_update(other),
+  m_p_head(s_head_allocator.allocate(1)),
+  m_size(0)
+{
+  initialize();
+
+  m_size = other.m_size;
+
+  PB_DS_DBG_ONLY(other.assert_valid();)
+
+    if (other.m_p_head->m_p_parent == NULL)
+      {
+        PB_DS_DBG_ONLY(assert_valid();)
+
+	  return;
+      }
+
+  try
+    {
+      m_p_head->m_p_parent =
+	recursive_copy_node(other.m_p_head->m_p_parent);
+    }
+  catch(...)
+    {
+      s_head_allocator.deallocate(m_p_head, 1);
+
+      throw;
+    }
+
+  m_p_head->m_p_min = leftmost_descendant(m_p_head->m_p_parent);
+  m_p_head->m_p_max = rightmost_descendant(m_p_head->m_p_parent);
+
+  m_p_head->m_p_parent->m_p_parent = m_p_head;
+
+  PB_DS_DBG_ONLY(assert_valid();)
+    }
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+swap(PB_DS_CLASS_C_DEC& other)
+{
+  PB_DS_DBG_ONLY(assert_valid();)
+    PB_DS_DBG_ONLY(other.assert_valid();)
+
+    value_swap(other);
+
+  std::swap((e_access_traits& )(*this), (e_access_traits& )other);
+
+  PB_DS_DBG_ONLY(assert_valid();)
+    PB_DS_DBG_ONLY(other.assert_valid();)
+    }
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+value_swap(PB_DS_CLASS_C_DEC& other)
+{
+  PB_DS_DBG_ONLY(map_debug_base::swap(other);)
+
+    std::swap(m_p_head, other.m_p_head);
+
+  std::swap(m_size, other.m_size);
+}
+
+PB_DS_CLASS_T_DEC
+PB_DS_CLASS_C_DEC::
+~PB_DS_CLASS_NAME()
+{
+  clear();
+
+  s_head_allocator.deallocate(m_p_head, 1);
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+initialize()
+{
+  new (m_p_head) head();
+
+  m_p_head->m_p_parent = NULL;
+
+  m_p_head->m_p_min = m_p_head;
+  m_p_head->m_p_max = m_p_head;
+
+  m_size = 0;
+}
+
+PB_DS_CLASS_T_DEC
+template<typename It>
+void
+PB_DS_CLASS_C_DEC::
+copy_from_range(It first_it, It last_it)
+{
+  while (first_it != last_it)
+    insert(*(first_it++));
+}
+
+PB_DS_CLASS_T_DEC
+typename PB_DS_CLASS_C_DEC::node_pointer
+PB_DS_CLASS_C_DEC::
+recursive_copy_node(const_node_pointer p_other_nd)
+{
+  PB_DS_DBG_ASSERT(p_other_nd != NULL);
+
+  if (p_other_nd->m_type == pat_trie_leaf_node_type)
+    {
+      const_leaf_pointer p_other_leaf =
+	static_cast<const_leaf_pointer>(p_other_nd);
+
+      leaf_pointer p_new_lf = s_leaf_allocator.allocate(1);
+
+      cond_dealtor cond(p_new_lf);
+
+      new (p_new_lf) leaf(p_other_leaf->value());
+
+      apply_update(p_new_lf, (node_update* )this);
+
+      cond.set_no_action_dtor();
+
+      return (p_new_lf);
+    }
+
+  PB_DS_DBG_ASSERT(p_other_nd->m_type ==
+		   pat_trie_internal_node_type);
+
+  node_pointer a_p_children[internal_node::arr_size];
+
+  size_type child_i = 0;
+
+  const_internal_node_pointer p_other_internal_nd =
+    static_cast<const_internal_node_pointer>(p_other_nd);
+
+  typename internal_node::const_iterator child_it =
+    p_other_internal_nd->begin();
+
+  internal_node_pointer p_ret;
+
+  try
+    {
+      while (child_it != p_other_internal_nd->end())
+	a_p_children[child_i++] = recursive_copy_node(*(child_it++));
+
+      p_ret = s_internal_node_allocator.allocate(1);
+    }
+  catch(...)
+    {
+      while (child_i-- > 0)
+	clear_imp(a_p_children[child_i]);
+
+      throw;
+    }
+
+  new (p_ret) internal_node(
+			    p_other_internal_nd->get_e_ind(),
+			    pref_begin(a_p_children[0]));
+
+  --child_i;
+
+  PB_DS_DBG_ASSERT(child_i > 1);
+
+  do
+    p_ret->add_child(
+		     a_p_children[child_i],
+		     pref_begin(a_p_children[child_i]),
+		     pref_end(a_p_children[child_i]),
+		     this);
+  while (child_i-- > 0);
+
+  apply_update(p_ret, (node_update* )this);
+
+  return (p_ret);
+}
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/debug_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/debug_fn_imps.hpp
new file mode 100644
index 00000000000..1345913a5ae
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/debug_fn_imps.hpp
@@ -0,0 +1,144 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file debug_fn_imps.hpp
+ * Contains an implementation class for pat_trie_.
+ */
+
+#ifdef PB_DS_PAT_TRIE_DEBUG_
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+assert_valid() const
+{
+  if (m_p_head->m_p_parent != NULL)
+    m_p_head->m_p_parent->assert_valid(this);
+
+  assert_iterators();
+
+  assert_reverse_iterators();
+
+  if (m_p_head->m_p_parent == NULL)
+    {
+      PB_DS_DBG_ASSERT(m_p_head->m_p_min == m_p_head);
+      PB_DS_DBG_ASSERT(m_p_head->m_p_max == m_p_head);
+
+      PB_DS_DBG_ASSERT(empty());
+
+      return;
+    }
+
+  PB_DS_DBG_ASSERT(m_p_head->m_p_min->m_type == pat_trie_leaf_node_type);
+  PB_DS_DBG_ASSERT(m_p_head->m_p_max->m_type == pat_trie_leaf_node_type);
+
+  PB_DS_DBG_ASSERT(!empty());
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+assert_iterators() const
+{
+  size_type calc_size = 0;
+
+  for (const_iterator it = begin(); it != end(); ++it)
+    {
+      ++calc_size;
+
+      map_debug_base::check_key_exists(PB_DS_V2F(*it));
+
+      PB_DS_DBG_ASSERT(lower_bound(PB_DS_V2F(*it)) == it);
+
+      PB_DS_DBG_ASSERT(--upper_bound(PB_DS_V2F(*it)) == it);
+    }
+
+  PB_DS_DBG_ASSERT(calc_size == m_size);
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+assert_reverse_iterators() const
+{
+  size_type calc_size = 0;
+
+  for (const_reverse_iterator it = rbegin(); it != rend(); ++it)
+    {
+      ++calc_size;
+
+      const_node_pointer p_nd =
+	const_cast<PB_DS_CLASS_C_DEC* >(this)->find_imp(
+							PB_DS_V2F(*it));
+
+      PB_DS_DBG_ASSERT(p_nd == it.m_p_nd);
+    }
+
+  PB_DS_DBG_ASSERT(calc_size == m_size);
+}
+
+PB_DS_CLASS_T_DEC
+typename PB_DS_CLASS_C_DEC::size_type
+PB_DS_CLASS_C_DEC::
+recursive_count_leafs(const_node_pointer p_nd)
+{
+  if (p_nd == NULL)
+    return (0);
+
+  if (p_nd->m_type == pat_trie_leaf_node_type)
+    return (1);
+
+  PB_DS_DBG_ASSERT(p_nd->m_type == pat_trie_internal_node_type);
+
+  size_type ret = 0;
+
+  for (typename internal_node::const_iterator it =
+	 static_cast<const_internal_node_pointer>(p_nd)->begin();
+       it != static_cast<const_internal_node_pointer>(p_nd)->end();
+       ++it)
+    ret += recursive_count_leafs(*it);
+
+  return (ret);
+}
+
+#endif // #ifdef PB_DS_PAT_TRIE_DEBUG_
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/erase_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/erase_fn_imps.hpp
new file mode 100644
index 00000000000..1fc7b26f865
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/erase_fn_imps.hpp
@@ -0,0 +1,401 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file erase_fn_imps.hpp
+ * Contains an implementation class for bin_search_tree_.
+ */
+
+PB_DS_CLASS_T_DEC
+inline bool
+PB_DS_CLASS_C_DEC::
+erase(const_key_reference r_key)
+{
+  node_pointer p_nd = find_imp(r_key);
+
+  if (p_nd == NULL || p_nd->m_type == pat_trie_internal_node_type)
+    {
+      PB_DS_DBG_ONLY(map_debug_base::check_key_does_not_exist(
+							      r_key));
+
+      return (false);
+    }
+
+  PB_DS_DBG_ASSERT(p_nd->m_type == pat_trie_leaf_node_type);
+
+  if (!synth_e_access_traits::equal_keys(
+					 PB_DS_V2F(reinterpret_cast<leaf_pointer>(p_nd)->value()),
+					 r_key))
+    {
+      PB_DS_DBG_ONLY(map_debug_base::check_key_does_not_exist(
+							      r_key));
+
+      return (false);
+    }
+
+  PB_DS_DBG_ONLY(map_debug_base::check_key_exists(r_key));
+
+  erase_leaf(static_cast<leaf_pointer>(p_nd));
+
+  PB_DS_DBG_ONLY(assert_valid();)
+
+    return (true);
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+erase_fixup(internal_node_pointer p_nd)
+{
+  PB_DS_DBG_ASSERT(std::distance(p_nd->begin(), p_nd->end()) >= 1);
+
+  if (std::distance(p_nd->begin(), p_nd->end()) == 1)
+    {
+      node_pointer p_parent = p_nd->m_p_parent;
+
+      if (p_parent == m_p_head)
+	m_p_head->m_p_parent =* p_nd->begin();
+      else
+        {
+	  PB_DS_DBG_ASSERT(p_parent->m_type == pat_trie_internal_node_type);
+
+	  node_pointer p_new_child =* p_nd->begin();
+
+	  static_cast<internal_node_pointer>(p_parent)->replace_child(
+								      p_new_child,
+								      pref_begin(p_new_child),
+								      pref_end(p_new_child),
+								      this);
+        }
+      (*p_nd->begin())->m_p_parent = p_nd->m_p_parent;
+
+      p_nd->~internal_node();
+
+      s_internal_node_allocator.deallocate(p_nd, 1);
+
+      if (p_parent == m_p_head)
+	return;
+
+      PB_DS_DBG_ASSERT(p_parent->m_type == pat_trie_internal_node_type);
+
+      p_nd = static_cast<internal_node_pointer>(p_parent);
+    }
+
+  while (true)
+    {
+      PB_DS_DBG_ASSERT(std::distance(p_nd->begin(), p_nd->end()) > 1);
+
+      p_nd->update_prefixes(this);
+
+      apply_update(p_nd, (node_update* )this);
+
+      PB_DS_DBG_ONLY(p_nd->assert_valid(this);)
+
+        if (p_nd->m_p_parent->m_type == pat_trie_head_node_type)
+	  return;
+
+      PB_DS_DBG_ASSERT(p_nd->m_p_parent->m_type ==
+		       pat_trie_internal_node_type);
+
+      p_nd = static_cast<internal_node_pointer>(p_nd->m_p_parent);
+    }
+}
+
+PB_DS_CLASS_T_DEC
+inline void
+PB_DS_CLASS_C_DEC::
+actual_erase_leaf(leaf_pointer p_l)
+{
+  PB_DS_DBG_ASSERT(m_size > 0);
+  --m_size;
+
+  PB_DS_DBG_ONLY(erase_existing(PB_DS_V2F(p_l->value())));
+
+  p_l->~leaf();
+
+  s_leaf_allocator.deallocate(p_l, 1);
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+clear()
+{
+  PB_DS_DBG_ONLY(assert_valid();)
+
+    if (empty())
+      return;
+
+  clear_imp(m_p_head->m_p_parent);
+
+  m_size = 0;
+
+  initialize();
+
+  PB_DS_DBG_ONLY(map_debug_base::clear();)
+
+    PB_DS_DBG_ONLY(assert_valid();)
+    }
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+clear_imp(node_pointer p_nd)
+{
+  if (p_nd->m_type == pat_trie_internal_node_type)
+    {
+      PB_DS_DBG_ASSERT(p_nd->m_type == pat_trie_internal_node_type);
+
+      for (typename internal_node::iterator it =
+	     static_cast<internal_node_pointer>(p_nd)->begin();
+	   it != static_cast<internal_node_pointer>(p_nd)->end();
+	   ++it)
+        {
+	  node_pointer p_child =* it;
+
+	  clear_imp(p_child);
+        }
+
+      s_internal_node_allocator.deallocate(
+					   static_cast<internal_node_pointer>(p_nd), 1);
+
+      return;
+    }
+
+  PB_DS_DBG_ASSERT(p_nd->m_type == pat_trie_leaf_node_type);
+
+  static_cast<leaf_pointer>(p_nd)->~leaf();
+
+  s_leaf_allocator.deallocate(
+			      static_cast<leaf_pointer>(p_nd), 1);
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::const_iterator
+PB_DS_CLASS_C_DEC::
+erase(const_iterator it)
+{
+  PB_DS_DBG_ONLY(assert_valid());
+
+  if (it == end())
+    return (it);
+
+  const_iterator ret_it = it;
+
+  ++ret_it;
+
+  PB_DS_DBG_ASSERT(it.m_p_nd->m_type == pat_trie_leaf_node_type);
+
+  erase_leaf(static_cast<leaf_pointer>(it.m_p_nd));
+
+  PB_DS_DBG_ONLY(assert_valid());
+
+  return (ret_it);
+}
+
+#ifdef PB_DS_DATA_TRUE_INDICATOR
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::iterator
+PB_DS_CLASS_C_DEC::
+erase(iterator it)
+{
+  PB_DS_DBG_ONLY(assert_valid());
+
+  if (it == end())
+    return (it);
+
+  iterator ret_it = it;
+
+  ++ret_it;
+
+  PB_DS_DBG_ASSERT(it.m_p_nd->m_type == pat_trie_leaf_node_type);
+
+  erase_leaf(static_cast<leaf_pointer>(it.m_p_nd));
+
+  PB_DS_DBG_ONLY(assert_valid());
+
+  return (ret_it);
+}
+#endif // #ifdef PB_DS_DATA_TRUE_INDICATOR
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::const_reverse_iterator
+PB_DS_CLASS_C_DEC::
+erase(const_reverse_iterator it)
+{
+  PB_DS_DBG_ONLY(assert_valid());
+
+  if (it.m_p_nd == m_p_head)
+    return (it);
+
+  const_reverse_iterator ret_it = it;
+
+  ++ret_it;
+
+  PB_DS_DBG_ASSERT(it.m_p_nd->m_type == pat_trie_leaf_node_type);
+
+  erase_leaf(static_cast<leaf_pointer>(it.m_p_nd));
+
+  PB_DS_DBG_ONLY(assert_valid());
+
+  return (ret_it);
+}
+
+#ifdef PB_DS_DATA_TRUE_INDICATOR
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::reverse_iterator
+PB_DS_CLASS_C_DEC::
+erase(reverse_iterator it)
+{
+  PB_DS_DBG_ONLY(assert_valid());
+
+  if (it.m_p_nd == m_p_head)
+    return (it);
+
+  reverse_iterator ret_it = it;
+
+  ++ret_it;
+
+  PB_DS_DBG_ASSERT(it.m_p_nd->m_type == pat_trie_leaf_node_type);
+
+  erase_leaf(static_cast<leaf_pointer>(it.m_p_nd));
+
+  PB_DS_DBG_ONLY(assert_valid());
+
+  return (ret_it);
+}
+#endif // #ifdef PB_DS_DATA_TRUE_INDICATOR
+
+PB_DS_CLASS_T_DEC
+template<typename Pred>
+inline typename PB_DS_CLASS_C_DEC::size_type
+PB_DS_CLASS_C_DEC::
+erase_if(Pred pred)
+{
+  size_type num_ersd = 0;
+
+  PB_DS_DBG_ONLY(assert_valid();)
+
+    iterator it = begin();
+
+  while (it != end())
+    {
+      PB_DS_DBG_ONLY(assert_valid();)
+
+        if (pred(*it))
+	  {
+            ++num_ersd;
+
+            it = erase(it);
+	  }
+        else
+	  ++it;
+    }
+
+  PB_DS_DBG_ONLY(assert_valid();)
+
+    return (num_ersd);
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+erase_leaf(leaf_pointer p_l)
+{
+  update_min_max_for_erased_leaf(p_l);
+
+  if (p_l->m_p_parent->m_type == pat_trie_head_node_type)
+    {
+      PB_DS_DBG_ASSERT(size() == 1);
+
+      clear();
+
+      return;
+    }
+
+  PB_DS_DBG_ASSERT(size() > 1);
+
+  PB_DS_DBG_ASSERT(p_l->m_p_parent->m_type ==
+		   pat_trie_internal_node_type);
+
+  internal_node_pointer p_parent =
+    static_cast<internal_node_pointer>(p_l->m_p_parent);
+
+  p_parent->remove_child(p_l);
+
+  erase_fixup(p_parent);
+
+  actual_erase_leaf(p_l);
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+update_min_max_for_erased_leaf(leaf_pointer p_l)
+{
+  if (m_size == 1)
+    {
+      m_p_head->m_p_min = m_p_head;
+      m_p_head->m_p_max = m_p_head;
+
+      return;
+    }
+
+  if (p_l == static_cast<const_leaf_pointer>(m_p_head->m_p_min))
+    {
+      iterator it(p_l);
+
+      ++it;
+
+      m_p_head->m_p_min = it.m_p_nd;
+
+      return;
+    }
+
+  if (p_l == static_cast<const_leaf_pointer>(m_p_head->m_p_max))
+    {
+      iterator it(p_l);
+
+      --it;
+
+      m_p_head->m_p_max = it.m_p_nd;
+    }
+}
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/find_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/find_fn_imps.hpp
new file mode 100644
index 00000000000..3462019dc60
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/find_fn_imps.hpp
@@ -0,0 +1,318 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file find_fn_imps.hpp
+ * Contains an implementation class for bin_search_tree_.
+ */
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::point_iterator
+PB_DS_CLASS_C_DEC::
+find(const_key_reference r_key)
+{
+  PB_DS_DBG_ONLY(assert_valid();)
+
+    node_pointer p_nd = find_imp(r_key);
+
+  if (p_nd == NULL || p_nd->m_type != pat_trie_leaf_node_type)
+    {
+      PB_DS_DBG_ONLY(map_debug_base::check_key_does_not_exist(r_key);)
+
+        return (end());
+    }
+
+  if (synth_e_access_traits::equal_keys(
+					PB_DS_V2F(static_cast<leaf_pointer>(p_nd)->value()),
+					r_key))
+    {
+      PB_DS_DBG_ONLY(map_debug_base::check_key_exists(r_key));
+
+      return (iterator(p_nd));
+    }
+
+  PB_DS_DBG_ONLY(map_debug_base::check_key_does_not_exist(r_key);)
+
+    return (end());
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::const_point_iterator
+PB_DS_CLASS_C_DEC::
+find(const_key_reference r_key) const
+{
+  PB_DS_DBG_ONLY(assert_valid();)
+
+    const_node_pointer p_nd =
+    const_cast<PB_DS_CLASS_C_DEC* >(this)->find_imp(r_key);
+
+  if (p_nd == NULL || p_nd->m_type != pat_trie_leaf_node_type)
+    {
+      PB_DS_DBG_ONLY(map_debug_base::check_key_does_not_exist(r_key);)
+
+        return (end());
+    }
+
+  if (synth_e_access_traits::equal_keys(
+					PB_DS_V2F(static_cast<const_leaf_pointer>(p_nd)->value()),
+					r_key))
+    {
+      PB_DS_DBG_ONLY(map_debug_base::check_key_exists(
+						      r_key));
+
+      return (const_iterator(const_cast<node_pointer>(p_nd)));
+    }
+
+  PB_DS_DBG_ONLY(map_debug_base::check_key_does_not_exist(r_key);)
+
+    return (end());
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::node_pointer
+PB_DS_CLASS_C_DEC::
+find_imp(const_key_reference r_key)
+{
+  if (empty())
+    return (NULL);
+
+  typename synth_e_access_traits::const_iterator b_it =
+    synth_e_access_traits::begin(r_key);
+  typename synth_e_access_traits::const_iterator e_it =
+    synth_e_access_traits::end(r_key);
+
+  node_pointer p_nd = m_p_head->m_p_parent;
+  PB_DS_DBG_ASSERT(p_nd != NULL);
+
+  while (p_nd->m_type != pat_trie_leaf_node_type)
+    {
+      PB_DS_DBG_ASSERT(p_nd->m_type == pat_trie_internal_node_type);
+
+      node_pointer p_next_nd =
+	static_cast<internal_node_pointer>(p_nd)->get_child_node(                b_it,  e_it,  this);
+
+      if (p_next_nd == NULL)
+	return (p_nd);
+
+      p_nd = p_next_nd;
+    }
+
+  return (p_nd);
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::node_pointer
+PB_DS_CLASS_C_DEC::
+lower_bound_imp(const_key_reference r_key)
+{
+  if (empty())
+    return (m_p_head);
+
+  node_pointer p_nd = m_p_head->m_p_parent;
+  PB_DS_DBG_ASSERT(p_nd != NULL);
+
+  typename PB_DS_CLASS_C_DEC::const_e_iterator b_it =
+    synth_e_access_traits::begin(r_key);
+
+  typename PB_DS_CLASS_C_DEC::const_e_iterator e_it =
+    synth_e_access_traits::end(r_key);
+
+  size_type checked_ind = 0;
+
+  while (true)
+    {
+      if (p_nd->m_type == pat_trie_leaf_node_type)
+        {
+	  if (!synth_e_access_traits::cmp_keys(
+					       PB_DS_V2F(static_cast<const_leaf_pointer>(p_nd)->value()),
+					       r_key))
+	    return (p_nd);
+
+	  iterator it(p_nd);
+
+	  ++it;
+
+	  return (it.m_p_nd);
+        }
+
+      PB_DS_DBG_ASSERT(p_nd->m_type == pat_trie_internal_node_type);
+
+      const size_type new_checked_ind =
+	static_cast<internal_node_pointer>(p_nd)->get_e_ind();
+
+      p_nd =
+	static_cast<internal_node_pointer>(p_nd)->get_lower_bound_child_node(                b_it, e_it, checked_ind, this);
+
+      checked_ind = new_checked_ind;
+    }
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::point_iterator
+PB_DS_CLASS_C_DEC::
+lower_bound(const_key_reference r_key)
+{
+  return (point_iterator(lower_bound_imp(r_key)));
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::const_point_iterator
+PB_DS_CLASS_C_DEC::
+lower_bound(const_key_reference r_key) const
+{
+  return (const_point_iterator(
+			       const_cast<PB_DS_CLASS_C_DEC* >(this)->lower_bound_imp(r_key)));
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::point_iterator
+PB_DS_CLASS_C_DEC::
+upper_bound(const_key_reference r_key)
+{
+  point_iterator l_bound_it = lower_bound(r_key);
+
+  PB_DS_DBG_ASSERT(l_bound_it == end() ||
+		   !synth_e_access_traits::cmp_keys(
+						    PB_DS_V2F(*l_bound_it),
+						    r_key));
+
+  if (l_bound_it == end() ||
+      synth_e_access_traits::cmp_keys(
+				      r_key,
+				      PB_DS_V2F(*l_bound_it)))
+    return (l_bound_it);
+
+  return (++l_bound_it);
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::const_point_iterator
+PB_DS_CLASS_C_DEC::
+upper_bound(const_key_reference r_key) const
+{
+  const_point_iterator l_bound_it = lower_bound(r_key);
+
+  PB_DS_DBG_ASSERT(l_bound_it == end() ||
+		   !synth_e_access_traits::cmp_keys(
+						    PB_DS_V2F(*l_bound_it),
+						    r_key));
+
+  if (l_bound_it == end() ||
+      synth_e_access_traits::cmp_keys(
+				      r_key,
+				      PB_DS_V2F(*l_bound_it)))
+    return (l_bound_it);
+
+  return (++l_bound_it);
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::const_e_iterator
+PB_DS_CLASS_C_DEC::
+pref_begin(const_node_pointer p_nd)
+{
+  if (p_nd->m_type == pat_trie_leaf_node_type)
+    return (synth_e_access_traits::begin(
+					 PB_DS_V2F(static_cast<const_leaf_pointer>(p_nd)->value())));
+
+  PB_DS_DBG_ASSERT(p_nd->m_type == pat_trie_internal_node_type);
+
+  return (static_cast<const_internal_node_pointer>(p_nd)->pref_b_it());
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::const_e_iterator
+PB_DS_CLASS_C_DEC::
+pref_end(const_node_pointer p_nd)
+{
+  if (p_nd->m_type == pat_trie_leaf_node_type)
+    return (synth_e_access_traits::end(
+				       PB_DS_V2F(static_cast<const_leaf_pointer>(p_nd)->value())));
+
+  PB_DS_DBG_ASSERT(p_nd->m_type == pat_trie_internal_node_type);
+
+  return (static_cast<const_internal_node_pointer>(p_nd)->pref_e_it());
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::const_leaf_pointer
+PB_DS_CLASS_C_DEC::
+leftmost_descendant(const_node_pointer p_nd)
+{
+  if (p_nd->m_type == pat_trie_leaf_node_type)
+    return (static_cast<const_leaf_pointer>(p_nd));
+
+  return (static_cast<const_internal_node_pointer>(p_nd)->leftmost_descendant());
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::leaf_pointer
+PB_DS_CLASS_C_DEC::
+leftmost_descendant(node_pointer p_nd)
+{
+  if (p_nd->m_type == pat_trie_leaf_node_type)
+    return (static_cast<leaf_pointer>(p_nd));
+
+  return (static_cast<internal_node_pointer>(p_nd)->leftmost_descendant());
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::const_leaf_pointer
+PB_DS_CLASS_C_DEC::
+rightmost_descendant(const_node_pointer p_nd)
+{
+  if (p_nd->m_type == pat_trie_leaf_node_type)
+    return (static_cast<const_leaf_pointer>(p_nd));
+
+  return (static_cast<const_internal_node_pointer>(p_nd)->rightmost_descendant());
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::leaf_pointer
+PB_DS_CLASS_C_DEC::
+rightmost_descendant(node_pointer p_nd)
+{
+  if (p_nd->m_type == pat_trie_leaf_node_type)
+    return (static_cast<leaf_pointer>(p_nd));
+
+  return (static_cast<internal_node_pointer>(p_nd)->rightmost_descendant());
+}
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/head.hpp b/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/head.hpp
new file mode 100644
index 00000000000..db6864bba68
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/head.hpp
@@ -0,0 +1,162 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file head.hpp
+ * Contains a leaf for a patricia tree.
+ */
+
+#ifndef PB_DS_PAT_TRIE_IHEAD_HPP
+#define PB_DS_PAT_TRIE_IHEAD_HPP
+
+#ifdef PB_DS_PAT_TRIE_DEBUG_
+#include <cassert>
+#endif // #ifdef PB_DS_PAT_TRIE_DEBUG_
+#include <ext/pb_ds/detail/pat_trie_/node_base.hpp>
+
+namespace pb_ds
+{
+  namespace detail
+  {
+
+#define PB_DS_CLASS_T_DEC						\
+    template<								\
+						class Type_Traits,	\
+						class E_Access_Traits,	\
+						class Metadata,		\
+						class Allocator>
+
+#define PB_DS_CLASS_C_DEC						\
+    pat_trie_head<							\
+						Type_Traits,		\
+						E_Access_Traits,	\
+						Metadata,		\
+						Allocator>
+
+#define PB_DS_BASE_C_DEC					\
+    pat_trie_node_base<						\
+					Type_Traits,		\
+					E_Access_Traits,	\
+					Metadata,		\
+					Allocator>
+
+#ifdef PB_DS_PAT_TRIE_DEBUG_
+#define PB_DS_DBG_ASSERT(X) assert(X)
+#define PB_DS_DBG_VERIFY(X) assert(X)
+#define PB_DS_DBG_ONLY(X) X
+#else // #ifdef PB_DS_PAT_TRIE_DEBUG_
+#define PB_DS_DBG_ASSERT(X)
+#define PB_DS_DBG_VERIFY(X) {if((X)==0);}
+#define PB_DS_DBG_ONLY(X) ;
+#endif // #ifdef PB_DS_PAT_TRIE_DEBUG_
+
+    template<typename Type_Traits,
+	     class E_Access_Traits,
+	     class Metadata,
+	     class Allocator>
+    struct pat_trie_head : public PB_DS_BASE_C_DEC
+    {
+    private:
+      typedef E_Access_Traits e_access_traits;
+
+      typedef
+      typename Allocator::template rebind<
+	e_access_traits>::other::const_pointer
+      const_e_access_traits_pointer;
+
+      typedef
+      typename Allocator::template rebind<
+	PB_DS_BASE_C_DEC>::other::pointer
+      node_pointer;
+
+#ifdef PB_DS_PAT_TRIE_DEBUG_
+      typedef
+      typename PB_DS_BASE_C_DEC::subtree_debug_info
+      subtree_debug_info;
+#endif // #ifdef PB_DS_PAT_TRIE_DEBUG_
+
+    public:
+      pat_trie_head();
+
+#ifdef PB_DS_PAT_TRIE_DEBUG_
+      virtual subtree_debug_info
+      assert_valid_imp(const_e_access_traits_pointer p_traits) const;
+#endif // #ifdef PB_DS_PAT_TRIE_DEBUG_
+
+    public:
+      node_pointer m_p_min;
+
+      node_pointer m_p_max;
+    };
+
+    PB_DS_CLASS_T_DEC
+    PB_DS_CLASS_C_DEC::
+    pat_trie_head() :
+      PB_DS_BASE_C_DEC(pat_trie_head_node_type)
+    { }
+
+#ifdef PB_DS_PAT_TRIE_DEBUG_
+    PB_DS_CLASS_T_DEC
+    typename PB_DS_CLASS_C_DEC::subtree_debug_info
+    PB_DS_CLASS_C_DEC::
+    assert_valid_imp(const_e_access_traits_pointer /*p_traits*/) const
+    {
+      PB_DS_DBG_ASSERT(false);
+
+      return (subtree_debug_info());
+    }
+#endif // #ifdef PB_DS_PAT_TRIE_DEBUG_
+
+#undef PB_DS_CLASS_T_DEC
+
+#undef PB_DS_CLASS_C_DEC
+
+#undef PB_DS_BASE_C_DEC
+
+#undef PB_DS_DBG_ASSERT
+#undef PB_DS_DBG_VERIFY
+#undef PB_DS_DBG_ONLY
+
+  } // namespace detail
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_PAT_TRIE_HEAD_HPP
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/info_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/info_fn_imps.hpp
new file mode 100644
index 00000000000..dcaf1bf4f11
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/info_fn_imps.hpp
@@ -0,0 +1,70 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file info_fn_imps.hpp
+ * Contains an implementation class for bin_search_tree_.
+ */
+
+PB_DS_CLASS_T_DEC
+inline bool
+PB_DS_CLASS_C_DEC::
+empty() const
+{
+  return (m_size == 0);
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::size_type
+PB_DS_CLASS_C_DEC::
+size() const
+{
+  return (m_size);
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::size_type
+PB_DS_CLASS_C_DEC::
+max_size() const
+{
+  return (s_internal_node_allocator.max_size());
+}
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/insert_join_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/insert_join_fn_imps.hpp
new file mode 100644
index 00000000000..39b798311b6
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/insert_join_fn_imps.hpp
@@ -0,0 +1,665 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file insert_join_fn_imps.hpp
+ * Contains an implementation class for bin_search_tree_.
+ */
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+join(PB_DS_CLASS_C_DEC& other)
+{
+  PB_DS_DBG_ONLY(assert_valid(););
+  PB_DS_DBG_ONLY(other.assert_valid(););
+
+  split_join_branch_bag bag;
+
+  if (!join_prep(other, bag))
+    {
+      PB_DS_DBG_ONLY(assert_valid(););
+      PB_DS_DBG_ONLY(other.assert_valid(););
+
+      return;
+    }
+
+  m_p_head->m_p_parent = rec_join(m_p_head->m_p_parent, other.m_p_head->m_p_parent, 0, bag);
+
+  m_p_head->m_p_parent->m_p_parent = m_p_head;
+
+  m_size += other.m_size;
+
+  other.initialize();
+
+  PB_DS_DBG_ONLY(other.assert_valid(););
+
+  m_p_head->m_p_min = leftmost_descendant(m_p_head->m_p_parent);
+  m_p_head->m_p_max = rightmost_descendant(m_p_head->m_p_parent);
+
+  PB_DS_DBG_ONLY(assert_valid(););
+}
+
+PB_DS_CLASS_T_DEC
+bool
+PB_DS_CLASS_C_DEC::
+join_prep(PB_DS_CLASS_C_DEC& other, split_join_branch_bag& r_bag)
+{
+  PB_DS_DBG_ONLY(assert_valid();)
+    PB_DS_DBG_ONLY(other.assert_valid();)
+
+    if (other.m_size == 0)
+      return (false);
+
+  if (m_size == 0)
+    {
+      value_swap(other);
+
+      return (false);
+    }
+
+  const bool greater = synth_e_access_traits::cmp_keys(
+						       PB_DS_V2F(static_cast<const_leaf_pointer>(
+												 m_p_head->m_p_max)->value()),
+						       PB_DS_V2F(static_cast<const_leaf_pointer>(
+												 other.m_p_head->m_p_min)->value()));
+
+  const bool lesser = synth_e_access_traits::cmp_keys(
+						      PB_DS_V2F(static_cast<const_leaf_pointer>(
+												other.m_p_head->m_p_max)->value()),
+						      PB_DS_V2F(static_cast<const_leaf_pointer>(
+												m_p_head->m_p_min)->value()));
+
+  if (!greater&&  !lesser)
+    throw join_error();
+
+  rec_join_prep(m_p_head->m_p_parent, other.m_p_head->m_p_parent, r_bag);
+
+  PB_DS_DBG_ONLY(map_debug_base::join(other);)
+
+    return (true);
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+rec_join_prep(const_node_pointer p_l, const_node_pointer p_r, split_join_branch_bag& r_bag)
+{
+  if (p_l->m_type == pat_trie_leaf_node_type)
+    {
+      if (p_r->m_type == pat_trie_leaf_node_type)
+        {
+	  rec_join_prep(
+			static_cast<const_leaf_pointer>(p_l),
+			static_cast<const_leaf_pointer>(p_r),
+			r_bag);
+
+	  return;
+        }
+
+      PB_DS_DBG_ASSERT(p_r->m_type == pat_trie_internal_node_type);
+
+      rec_join_prep(
+		    static_cast<const_leaf_pointer>(p_l),
+		    static_cast<const_internal_node_pointer>(p_r),
+		    r_bag);
+
+      return;
+    }
+
+  PB_DS_DBG_ASSERT(p_l->m_type == pat_trie_internal_node_type);
+
+  if (p_r->m_type == pat_trie_leaf_node_type)
+    {
+      rec_join_prep(
+		    static_cast<const_internal_node_pointer>(p_l),
+		    static_cast<const_leaf_pointer>(p_r),
+		    r_bag);
+
+      return;
+    }
+
+  PB_DS_DBG_ASSERT(p_r->m_type == pat_trie_internal_node_type);
+
+  rec_join_prep(
+		static_cast<const_internal_node_pointer>(p_l),
+		static_cast<const_internal_node_pointer>(p_r),
+		r_bag);
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+rec_join_prep(const_leaf_pointer /*p_l*/, const_leaf_pointer /*p_r*/, split_join_branch_bag& r_bag)
+{
+  r_bag.add_branch();
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+rec_join_prep(const_leaf_pointer /*p_l*/, const_internal_node_pointer /*p_r*/, split_join_branch_bag& r_bag)
+{
+  r_bag.add_branch();
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+rec_join_prep(const_internal_node_pointer /*p_l*/, const_leaf_pointer /*p_r*/, split_join_branch_bag& r_bag)
+{
+  r_bag.add_branch();
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+rec_join_prep(const_internal_node_pointer p_l, const_internal_node_pointer p_r, split_join_branch_bag& r_bag)
+{
+  if (p_l->get_e_ind() == p_r->get_e_ind()&& 
+      synth_e_access_traits::equal_prefixes(
+					    p_l->pref_b_it(),
+					    p_l->pref_e_it(),
+					    p_r->pref_b_it(),
+					    p_r->pref_e_it()))
+    {
+      for (typename internal_node::const_iterator it = p_r->begin();
+	   it != p_r->end(); ++ it)
+        {
+	  const_node_pointer p_l_join_child =
+	    p_l->get_join_child(*it, this);
+
+	  if (p_l_join_child != NULL)
+	    rec_join_prep(p_l_join_child, * it, r_bag);
+        }
+
+      return;
+    }
+
+  if (p_r->get_e_ind() < p_l->get_e_ind()&& 
+      p_r->should_be_mine(
+			  p_l->pref_b_it(),
+			  p_l->pref_e_it(),
+			  0,
+			  this))
+    {
+      const_node_pointer p_r_join_child =
+	p_r->get_join_child(p_l, this);
+
+      if (p_r_join_child != NULL)
+	rec_join_prep(p_r_join_child, p_l, r_bag);
+
+      return;
+    }
+
+  if (p_r->get_e_ind() < p_l->get_e_ind()&& 
+      p_r->should_be_mine(
+			  p_l->pref_b_it(),
+			  p_l->pref_e_it(),
+			  0,
+			  this))
+    {
+      const_node_pointer p_r_join_child =
+	p_r->get_join_child(p_l, this);
+
+      if (p_r_join_child != NULL)
+	rec_join_prep(p_r_join_child, p_l, r_bag);
+
+      return;
+    }
+
+  r_bag.add_branch();
+}
+
+PB_DS_CLASS_T_DEC
+typename PB_DS_CLASS_C_DEC::node_pointer
+PB_DS_CLASS_C_DEC::
+rec_join(node_pointer p_l, node_pointer p_r, size_type checked_ind, split_join_branch_bag& r_bag)
+{
+  PB_DS_DBG_ASSERT(p_r != NULL);
+
+  if (p_l == NULL)
+    {
+      apply_update(p_r, (node_update* )this);
+
+      return (p_r);
+    }
+
+  if (p_l->m_type == pat_trie_leaf_node_type)
+    {
+      if (p_r->m_type == pat_trie_leaf_node_type)
+        {
+	  node_pointer p_ret = rec_join(
+					static_cast<leaf_pointer>(p_l),
+					static_cast<leaf_pointer>(p_r),
+					r_bag);
+
+	  apply_update(p_ret, (node_update* )this);
+
+	  return (p_ret);
+        }
+
+      PB_DS_DBG_ASSERT(p_r->m_type == pat_trie_internal_node_type);
+
+      node_pointer p_ret = rec_join(
+				    static_cast<leaf_pointer>(p_l),
+				    static_cast<internal_node_pointer>(p_r),
+				    checked_ind,
+				    r_bag);
+
+      apply_update(p_ret, (node_update* )this);
+
+      return (p_ret);
+    }
+
+  PB_DS_DBG_ASSERT(p_l->m_type == pat_trie_internal_node_type);
+
+  if (p_r->m_type == pat_trie_leaf_node_type)
+    {
+      node_pointer p_ret = rec_join(
+				    static_cast<internal_node_pointer>(p_l),
+				    static_cast<leaf_pointer>(p_r),
+				    checked_ind,
+				    r_bag);
+
+      apply_update(p_ret, (node_update* )this);
+
+      return (p_ret);
+    }
+
+  PB_DS_DBG_ASSERT(p_r->m_type == pat_trie_internal_node_type);
+
+  node_pointer p_ret = rec_join(
+				static_cast<internal_node_pointer>(p_l),
+				static_cast<internal_node_pointer>(p_r),
+				r_bag);
+
+  apply_update(p_ret, (node_update* )this);
+
+  return (p_ret);
+}
+
+PB_DS_CLASS_T_DEC
+typename PB_DS_CLASS_C_DEC::node_pointer
+PB_DS_CLASS_C_DEC::
+rec_join(leaf_pointer p_l, leaf_pointer p_r, split_join_branch_bag& r_bag)
+{
+  PB_DS_DBG_ASSERT(p_r != NULL);
+
+  if (p_l == NULL)
+    return (p_r);
+
+  node_pointer p_ret = insert_branch(p_l, p_r, r_bag);
+
+  PB_DS_DBG_ASSERT(recursive_count_leafs(p_ret) == 2);
+
+  return (p_ret);
+}
+
+PB_DS_CLASS_T_DEC
+typename PB_DS_CLASS_C_DEC::node_pointer
+PB_DS_CLASS_C_DEC::
+rec_join(leaf_pointer p_l, internal_node_pointer p_r, size_type checked_ind, split_join_branch_bag& r_bag)
+{
+#ifdef PB_DS_PAT_TRIE_DEBUG_
+  const size_type lhs_leafs = recursive_count_leafs(p_l);
+
+  const size_type rhs_leafs = recursive_count_leafs(p_r);
+#endif // #ifdef PB_DS_PAT_TRIE_DEBUG_
+
+  PB_DS_DBG_ASSERT(p_r != NULL);
+
+  node_pointer p_ret = rec_join(p_r, p_l, checked_ind, r_bag);
+
+  PB_DS_DBG_ASSERT(recursive_count_leafs(p_ret) ==
+		   lhs_leafs + rhs_leafs);
+
+  return (p_ret);
+}
+
+PB_DS_CLASS_T_DEC
+typename PB_DS_CLASS_C_DEC::node_pointer
+PB_DS_CLASS_C_DEC::
+rec_join(internal_node_pointer p_l, leaf_pointer p_r, size_type checked_ind, split_join_branch_bag& r_bag)
+{
+  PB_DS_DBG_ASSERT(p_l != NULL);
+  PB_DS_DBG_ASSERT(p_r != NULL);
+
+#ifdef PB_DS_PAT_TRIE_DEBUG_
+  const size_type lhs_leafs = recursive_count_leafs(p_l);
+
+  const size_type rhs_leafs = recursive_count_leafs(p_r);
+#endif // #ifdef PB_DS_PAT_TRIE_DEBUG_
+
+  if (!p_l->should_be_mine(
+			   pref_begin(p_r),
+			   pref_end(p_r),
+			   checked_ind,
+			   this))
+    {
+      node_pointer p_ret = insert_branch(p_l, p_r, r_bag);
+
+      PB_DS_DBG_ONLY(p_ret->assert_valid(this);)
+
+        PB_DS_DBG_ASSERT(recursive_count_leafs(p_ret) ==
+			 lhs_leafs + rhs_leafs);
+
+      return (p_ret);
+    }
+
+  node_pointer p_pot_child = p_l->add_child(
+					    p_r,
+					    pref_begin(p_r),
+					    pref_end(p_r),
+					    this);
+
+  if (p_pot_child != p_r)
+    {
+      node_pointer p_new_child = rec_join(
+					  p_pot_child,
+					  p_r,
+					  p_l->get_e_ind(),
+					  r_bag);
+
+      p_l->replace_child(
+			 p_new_child,
+			 pref_begin(p_new_child),
+			 pref_end(p_new_child),
+			 this);
+    }
+
+  PB_DS_DBG_ONLY(p_l->assert_valid(this));
+
+  PB_DS_DBG_ASSERT(recursive_count_leafs(p_l) ==
+		   lhs_leafs + rhs_leafs);
+
+  return (p_l);
+}
+
+PB_DS_CLASS_T_DEC
+typename PB_DS_CLASS_C_DEC::node_pointer
+PB_DS_CLASS_C_DEC::
+rec_join(internal_node_pointer p_l, internal_node_pointer p_r, split_join_branch_bag& r_bag)
+{
+  PB_DS_DBG_ASSERT(p_l != NULL);
+  PB_DS_DBG_ASSERT(p_r != NULL);
+
+#ifdef PB_DS_PAT_TRIE_DEBUG_
+  const size_type lhs_leafs = recursive_count_leafs(p_l);
+
+  const size_type rhs_leafs = recursive_count_leafs(p_r);
+#endif // #ifdef PB_DS_PAT_TRIE_DEBUG_
+
+  if (p_l->get_e_ind() == p_r->get_e_ind()&& 
+      synth_e_access_traits::equal_prefixes(
+					    p_l->pref_b_it(),
+					    p_l->pref_e_it(),
+					    p_r->pref_b_it(),
+					    p_r->pref_e_it()))
+    {
+      for (typename internal_node::iterator it = p_r->begin();
+	   it != p_r->end(); ++ it)
+        {
+	  node_pointer p_new_child = rec_join(
+					      p_l->get_join_child(*it, this),
+					      * it,
+					      0,
+					      r_bag);
+
+	  p_l->replace_child(
+			     p_new_child,
+			     pref_begin(p_new_child),
+			     pref_end(p_new_child),
+			     this);
+        }
+
+      p_r->~internal_node();
+
+      s_internal_node_allocator.deallocate(p_r, 1);
+
+      PB_DS_DBG_ONLY(p_l->assert_valid(this);)
+
+        PB_DS_DBG_ASSERT(recursive_count_leafs(p_l) ==
+			 lhs_leafs + rhs_leafs);
+
+      return (p_l);
+    }
+
+  if (p_l->get_e_ind() < p_r->get_e_ind()&& 
+      p_l->should_be_mine(
+			  p_r->pref_b_it(),
+			  p_r->pref_e_it(),
+			  0,
+			  this))
+    {
+      node_pointer p_new_child = rec_join(
+					  p_l->get_join_child(p_r, this),
+					  p_r,
+					  0,
+					  r_bag);
+
+      p_l->replace_child(
+			 p_new_child,
+			 pref_begin(p_new_child),
+			 pref_end(p_new_child),
+			 this);
+
+      PB_DS_DBG_ONLY(p_l->assert_valid(this);)
+
+        return (p_l);
+    }
+
+  if (p_r->get_e_ind() < p_l->get_e_ind()&& 
+      p_r->should_be_mine(
+			  p_l->pref_b_it(),
+			  p_l->pref_e_it(),
+			  0,
+			  this))
+    {
+      node_pointer p_new_child = rec_join(
+					  p_r->get_join_child(p_l, this),
+					  p_l,
+					  0,
+					  r_bag);
+
+      p_r->replace_child(
+			 p_new_child,
+			 pref_begin(p_new_child),
+			 pref_end(p_new_child),
+			 this);
+
+      PB_DS_DBG_ONLY(p_r->assert_valid(this);)
+
+        PB_DS_DBG_ASSERT(recursive_count_leafs(p_r) ==
+			 lhs_leafs + rhs_leafs);
+
+      return (p_r);
+    }
+
+  node_pointer p_ret = insert_branch(p_l, p_r, r_bag);
+
+  PB_DS_DBG_ONLY(p_ret->assert_valid(this);)
+
+    PB_DS_DBG_ASSERT(recursive_count_leafs(p_ret) ==
+		     lhs_leafs + rhs_leafs);
+
+  return (p_ret);
+}
+
+PB_DS_CLASS_T_DEC
+inline std::pair<
+  typename PB_DS_CLASS_C_DEC::iterator,
+  bool>
+PB_DS_CLASS_C_DEC::
+insert(const_reference r_val)
+{
+  node_pointer p_lf = find_imp(PB_DS_V2F(r_val));
+
+  if (p_lf != NULL&&  p_lf->m_type == pat_trie_leaf_node_type&& 
+      synth_e_access_traits::equal_keys(
+					PB_DS_V2F(static_cast<leaf_pointer>(p_lf)->value()),
+					PB_DS_V2F(r_val)))
+    {
+      PB_DS_DBG_ONLY(map_debug_base::check_key_exists(
+						      PB_DS_V2F(r_val)));
+
+      PB_DS_DBG_ONLY(assert_valid();)
+
+        return (std::make_pair(
+			       iterator(p_lf),
+			       false));
+    }
+
+  PB_DS_DBG_ONLY(map_debug_base::check_key_does_not_exist(
+							  PB_DS_V2F(r_val)));
+
+  leaf_pointer p_new_lf = s_leaf_allocator.allocate(1);
+
+  cond_dealtor cond(p_new_lf);
+
+  new (p_new_lf) leaf(r_val);
+
+  apply_update(p_new_lf, (node_update* )this);
+
+  cond.set_call_destructor();
+
+  split_join_branch_bag bag;
+
+  bag.add_branch();
+
+  m_p_head->m_p_parent =
+    rec_join(m_p_head->m_p_parent, p_new_lf, 0, bag);
+
+  m_p_head->m_p_parent->m_p_parent = m_p_head;
+
+  cond.set_no_action_dtor();
+
+  ++m_size;
+
+  update_min_max_for_inserted_leaf(p_new_lf);
+
+  PB_DS_DBG_ONLY(map_debug_base::insert_new(
+					    PB_DS_V2F(r_val));)
+
+    PB_DS_DBG_ONLY(assert_valid();)
+
+    return (std::make_pair(
+			   point_iterator(p_new_lf),
+			   true));
+}
+
+PB_DS_CLASS_T_DEC
+typename PB_DS_CLASS_C_DEC::size_type
+PB_DS_CLASS_C_DEC::
+keys_diff_ind(typename e_access_traits::const_iterator b_l, typename e_access_traits::const_iterator e_l, typename e_access_traits::const_iterator b_r, typename e_access_traits::const_iterator e_r)
+{
+  size_type diff_pos = 0;
+
+  while (b_l != e_l)
+    {
+      if (b_r == e_r)
+	return (diff_pos);
+
+      if (e_access_traits::e_pos(*b_l) != e_access_traits::e_pos(*b_r))
+	return (diff_pos);
+
+      ++b_l;
+      ++b_r;
+
+      ++diff_pos;
+    }
+
+  PB_DS_DBG_ASSERT(b_r != e_r);
+
+  return (diff_pos);
+}
+
+PB_DS_CLASS_T_DEC
+typename PB_DS_CLASS_C_DEC::internal_node_pointer
+PB_DS_CLASS_C_DEC::
+insert_branch(node_pointer p_l, node_pointer p_r, split_join_branch_bag& r_bag)
+{
+  typename synth_e_access_traits::const_iterator left_b_it =
+    pref_begin(p_l);
+  typename synth_e_access_traits::const_iterator left_e_it =
+    pref_end(p_l);
+
+  typename synth_e_access_traits::const_iterator right_b_it =
+    pref_begin(p_r);
+  typename synth_e_access_traits::const_iterator right_e_it =
+    pref_end(p_r);
+
+  const size_type diff_ind =
+    keys_diff_ind(left_b_it, left_e_it, right_b_it, right_e_it);
+
+  internal_node_pointer p_new_nd = r_bag.get_branch();
+
+  new (p_new_nd) internal_node(diff_ind, left_b_it);
+
+  p_new_nd->add_child(        p_l, left_b_it, left_e_it, this);
+
+  p_new_nd->add_child(        p_r, right_b_it, right_e_it, this);
+
+  p_l->m_p_parent = p_new_nd;
+  p_r->m_p_parent = p_new_nd;
+
+  PB_DS_DBG_ONLY(p_new_nd->assert_valid(this);)
+
+    return (p_new_nd);
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+update_min_max_for_inserted_leaf(leaf_pointer p_new_lf)
+{
+  if (m_p_head->m_p_min == m_p_head ||
+      synth_e_access_traits::cmp_keys(
+				      PB_DS_V2F(p_new_lf->value()),
+				      PB_DS_V2F(static_cast<const_leaf_pointer>(m_p_head->m_p_min)->value())))
+    m_p_head->m_p_min = p_new_lf;
+
+  if (m_p_head->m_p_max == m_p_head ||
+      synth_e_access_traits::cmp_keys(
+				      PB_DS_V2F(static_cast<const_leaf_pointer>(m_p_head->m_p_max)->value()),
+				      PB_DS_V2F(p_new_lf->value())))
+    m_p_head->m_p_max = p_new_lf;
+}
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/internal_node.hpp b/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/internal_node.hpp
new file mode 100644
index 00000000000..f3918373fd9
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/internal_node.hpp
@@ -0,0 +1,754 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file internal_node.hpp
+ * Contains an internal PB_DS_BASE_C_DEC for a patricia tree.
+ */
+
+#ifndef PB_DS_PAT_TRIE_INTERNAL_NODE_HPP
+#define PB_DS_PAT_TRIE_INTERNAL_NODE_HPP
+
+#ifdef PB_DS_PAT_TRIE_DEBUG_
+#include <cassert>
+#endif // #ifdef PB_DS_PAT_TRIE_DEBUG_
+
+namespace pb_ds
+{
+  namespace detail
+  {
+
+#define PB_DS_CLASS_T_DEC						\
+    template<								\
+						class Type_Traits,	\
+						class E_Access_Traits,	\
+						class Metadata,		\
+						class Allocator>
+
+#define PB_DS_CLASS_C_DEC						\
+    pat_trie_internal_node<						\
+						Type_Traits,		\
+						E_Access_Traits,	\
+						Metadata,		\
+						Allocator>
+
+#define PB_DS_BASE_C_DEC					\
+    pat_trie_node_base<						\
+					Type_Traits,		\
+					E_Access_Traits,	\
+					Metadata,		\
+					Allocator>
+
+#define PB_DS_LEAF_C_DEC						\
+    pat_trie_leaf<							\
+						Type_Traits,		\
+						E_Access_Traits,	\
+						Metadata,		\
+						Allocator>
+
+#define PB_DS_STATIC_ASSERT(UNIQUE, E)					\
+    typedef								\
+    static_assert_dumclass<				\
+									sizeof(static_assert<(bool)(E)>)> \
+    UNIQUE##static_assert_type
+
+#ifdef PB_DS_PAT_TRIE_DEBUG_
+#define PB_DS_DBG_ASSERT(X) assert(X)
+#define PB_DS_DBG_VERIFY(X) assert(X)
+#define PB_DS_DBG_ONLY(X) X
+#else // #ifdef PB_DS_PAT_TRIE_DEBUG_
+#define PB_DS_DBG_ASSERT(X)
+#define PB_DS_DBG_VERIFY(X) {if((X)==0);}
+#define PB_DS_DBG_ONLY(X) ;
+#endif // #ifdef PB_DS_PAT_TRIE_DEBUG_
+
+    template<typename Type_Traits,
+	     class E_Access_Traits,
+	     class Metadata,
+	     class Allocator>
+    struct pat_trie_internal_node : public PB_DS_BASE_C_DEC
+    {
+    public:
+      enum
+	{
+	  arr_size =
+	  E_Access_Traits::max_size + 1
+	};
+
+    private:
+      typedef typename Allocator::size_type size_type;
+
+      typedef E_Access_Traits e_access_traits;
+
+      typedef
+      typename Allocator::template rebind<
+	e_access_traits>::other::const_pointer
+      const_e_access_traits_pointer;
+
+      typedef typename e_access_traits::const_iterator const_e_iterator;
+
+      typedef
+      typename Allocator::template rebind<
+	PB_DS_BASE_C_DEC >::other::pointer
+      node_pointer;
+
+      typedef
+      typename Allocator::template rebind<
+	PB_DS_BASE_C_DEC >::other::const_pointer
+      const_node_pointer;
+
+      typedef PB_DS_LEAF_C_DEC leaf;
+
+      typedef
+      typename Allocator::template rebind<
+	leaf>::other
+      leaf_allocator;
+
+      typedef typename leaf_allocator::pointer leaf_pointer;
+
+      typedef typename leaf_allocator::const_pointer const_leaf_pointer;
+
+      typedef
+      typename Allocator::template rebind<
+	PB_DS_CLASS_C_DEC>::other
+      internal_node_allocator;
+
+      typedef
+      typename Allocator::template rebind<
+	PB_DS_CLASS_C_DEC>::other::const_pointer
+      const_internal_node_pointer;
+
+      typedef
+      typename Allocator::template rebind<
+	PB_DS_CLASS_C_DEC>::other::pointer
+      internal_node_pointer;
+
+      PB_DS_STATIC_ASSERT(min_arr_size, arr_size >= 2);
+
+      typedef typename Type_Traits::value_type value_type;
+
+#ifdef PB_DS_PAT_TRIE_DEBUG_
+      typedef
+      typename PB_DS_BASE_C_DEC::subtree_debug_info
+      subtree_debug_info;
+#endif // #ifdef PB_DS_PAT_TRIE_DEBUG_
+
+      typedef PB_DS_BASE_C_DEC base_type;
+
+    private:
+      inline size_type
+      get_pref_pos(const_e_iterator b_it, const_e_iterator e_it, const_e_access_traits_pointer p_traits) const;
+
+#ifdef PB_DS_PAT_TRIE_DEBUG_
+      virtual subtree_debug_info
+      assert_valid_imp(const_e_access_traits_pointer p_traits) const;
+#endif // #ifdef PB_DS_PAT_TRIE_DEBUG_
+
+    public:
+      typedef
+      typename Allocator::template rebind<
+      node_pointer>::other::pointer
+      node_pointer_pointer;
+
+      typedef
+      typename Allocator::template rebind<
+	node_pointer>::other::reference
+      node_pointer_reference;
+
+#include <ext/pb_ds/detail/pat_trie_/const_child_iterator.hpp>
+#include <ext/pb_ds/detail/pat_trie_/child_iterator.hpp>
+
+    public:
+      pat_trie_internal_node(size_type e_ind, const const_e_iterator pref_b_it);
+
+      void
+      update_prefixes(const_e_access_traits_pointer p_traits);
+
+      const_iterator
+      begin() const;
+
+      iterator
+      begin();
+
+      const_iterator
+      end() const;
+
+      iterator
+      end();
+
+      inline node_pointer
+      get_child_node(const_e_iterator b_it, const_e_iterator e_it, const_e_access_traits_pointer p_traits);
+
+      inline const_node_pointer
+      get_child_node(const_e_iterator b_it, const_e_iterator e_it, const_e_access_traits_pointer p_traits) const;
+
+      inline iterator
+      get_child_it(const_e_iterator b_it, const_e_iterator e_it, const_e_access_traits_pointer p_traits);
+
+      inline node_pointer
+      get_lower_bound_child_node(const_e_iterator b_it, const_e_iterator e_it, size_type checked_ind, const_e_access_traits_pointer p_traits);
+
+      inline node_pointer
+      add_child(node_pointer p_nd, const_e_iterator b_it, const_e_iterator e_it, const_e_access_traits_pointer p_traits);
+
+      inline const_node_pointer
+      get_join_child(const_node_pointer p_nd, const_e_access_traits_pointer p_traits) const;
+
+      inline node_pointer
+      get_join_child(node_pointer p_nd, const_e_access_traits_pointer p_traits);
+
+      void
+      remove_child(node_pointer p_nd);
+
+      iterator
+      remove_child(iterator it);
+
+      void
+      replace_child(node_pointer p_nd, const_e_iterator b_it, const_e_iterator e_it, const_e_access_traits_pointer p_traits);
+
+      inline const_e_iterator
+      pref_b_it() const;
+
+      inline const_e_iterator
+      pref_e_it() const;
+
+      inline size_type
+      get_e_ind() const;
+
+      bool
+      should_be_mine(const_e_iterator b_it, const_e_iterator e_it, size_type checked_ind, const_e_access_traits_pointer p_traits) const;
+
+      leaf_pointer
+      leftmost_descendant();
+
+      const_leaf_pointer
+      leftmost_descendant() const;
+
+      leaf_pointer
+      rightmost_descendant();
+
+      const_leaf_pointer
+      rightmost_descendant() const;
+
+#ifdef PB_DS_PAT_TRIE_DEBUG_
+      size_type
+      e_ind() const;
+#endif // #ifdef PB_DS_PAT_TRIE_DEBUG_
+
+    private:
+      pat_trie_internal_node(const PB_DS_CLASS_C_DEC& other);
+
+      size_type
+      get_begin_pos() const;
+
+    private:
+      const size_type m_e_ind;
+
+      const_e_iterator m_pref_b_it;
+      const_e_iterator m_pref_e_it;
+
+      node_pointer m_a_p_children[arr_size];
+
+      static leaf_allocator s_leaf_alloc;
+
+      static internal_node_allocator s_internal_node_alloc;
+    };
+
+    PB_DS_CLASS_T_DEC
+    typename PB_DS_CLASS_C_DEC::leaf_allocator
+    PB_DS_CLASS_C_DEC::s_leaf_alloc;
+
+    PB_DS_CLASS_T_DEC
+    typename PB_DS_CLASS_C_DEC::internal_node_allocator
+    PB_DS_CLASS_C_DEC::s_internal_node_alloc;
+
+    PB_DS_CLASS_T_DEC
+    inline typename PB_DS_CLASS_C_DEC::size_type
+    PB_DS_CLASS_C_DEC::
+    get_pref_pos(const_e_iterator b_it, const_e_iterator e_it, const_e_access_traits_pointer p_traits) const
+    {
+      if (static_cast<size_t>(std::distance(b_it, e_it)) <= m_e_ind)
+	return (0);
+
+      std::advance(b_it, m_e_ind);
+
+      return (1 + p_traits->e_pos(*b_it));
+    }
+
+    PB_DS_CLASS_T_DEC
+    PB_DS_CLASS_C_DEC::
+    pat_trie_internal_node(size_type e_ind, const const_e_iterator pref_b_it) :
+      PB_DS_BASE_C_DEC(pat_trie_internal_node_type),
+      m_e_ind(e_ind),
+      m_pref_b_it(pref_b_it),
+      m_pref_e_it(pref_b_it)
+    {
+      std::advance(m_pref_e_it, m_e_ind);
+
+      std::fill(m_a_p_children, m_a_p_children + arr_size,
+		static_cast<node_pointer>(NULL));
+    }
+
+    PB_DS_CLASS_T_DEC
+    void
+    PB_DS_CLASS_C_DEC::
+    update_prefixes(const_e_access_traits_pointer p_traits)
+    {
+      node_pointer p_first =* begin();
+
+      if (p_first->m_type == pat_trie_leaf_node_type)
+	m_pref_b_it =
+	  p_traits->begin(
+			  E_Access_Traits::extract_key(
+						       static_cast<const_leaf_pointer>(p_first)->value()));
+      else
+	{
+	  PB_DS_DBG_ASSERT(p_first->m_type == pat_trie_internal_node_type);
+
+	  m_pref_b_it = static_cast<internal_node_pointer>(p_first)->pref_b_it();
+	}
+
+      m_pref_e_it = m_pref_b_it;
+
+      std::advance(m_pref_e_it, m_e_ind);
+    }
+
+    PB_DS_CLASS_T_DEC
+    typename PB_DS_CLASS_C_DEC::const_iterator
+    PB_DS_CLASS_C_DEC::
+    begin() const
+    {
+      return (const_iterator(
+			     const_cast<node_pointer_pointer>(m_a_p_children) + get_begin_pos(),
+			     const_cast<node_pointer_pointer>(m_a_p_children) + arr_size));
+    }
+
+    PB_DS_CLASS_T_DEC
+    typename PB_DS_CLASS_C_DEC::iterator
+    PB_DS_CLASS_C_DEC::
+    begin()
+    {
+      return (iterator(
+		       m_a_p_children + get_begin_pos(),
+		       m_a_p_children + arr_size));
+    }
+
+    PB_DS_CLASS_T_DEC
+    typename PB_DS_CLASS_C_DEC::const_iterator
+    PB_DS_CLASS_C_DEC::
+    end() const
+    {
+      return (const_iterator(
+			     const_cast<node_pointer_pointer>(m_a_p_children) + arr_size,
+			     const_cast<node_pointer_pointer>(m_a_p_children) + arr_size));
+    }
+
+    PB_DS_CLASS_T_DEC
+    typename PB_DS_CLASS_C_DEC::iterator
+    PB_DS_CLASS_C_DEC::
+    end()
+    {
+      return (iterator(        m_a_p_children + arr_size, m_a_p_children + arr_size));
+    }
+
+    PB_DS_CLASS_T_DEC
+    inline typename PB_DS_CLASS_C_DEC::node_pointer
+    PB_DS_CLASS_C_DEC::
+    get_child_node(const_e_iterator b_it, const_e_iterator e_it, const_e_access_traits_pointer p_traits)
+    {
+      const size_type i = get_pref_pos(        b_it, e_it, p_traits);
+
+      PB_DS_DBG_ASSERT(i < arr_size);
+
+      return (m_a_p_children[i]);
+    }
+
+    PB_DS_CLASS_T_DEC
+    inline typename PB_DS_CLASS_C_DEC::iterator
+    PB_DS_CLASS_C_DEC::
+    get_child_it(const_e_iterator b_it, const_e_iterator e_it, const_e_access_traits_pointer p_traits)
+    {
+      const size_type i = get_pref_pos(        b_it, e_it, p_traits);
+
+      PB_DS_DBG_ASSERT(i < arr_size);
+
+      PB_DS_DBG_ASSERT(m_a_p_children[i] != NULL);
+
+      return (iterator(m_a_p_children + i, m_a_p_children + i));
+    }
+
+    PB_DS_CLASS_T_DEC
+    inline typename PB_DS_CLASS_C_DEC::const_node_pointer
+    PB_DS_CLASS_C_DEC::
+    get_child_node(const_e_iterator b_it, const_e_iterator e_it, const_e_access_traits_pointer p_traits) const
+    {
+      return (const_cast<node_pointer>(get_child_node(b_it, e_it, p_traits)));
+    }
+
+    PB_DS_CLASS_T_DEC
+    typename PB_DS_CLASS_C_DEC::node_pointer
+    PB_DS_CLASS_C_DEC::
+    get_lower_bound_child_node(const_e_iterator b_it, const_e_iterator e_it, size_type checked_ind, const_e_access_traits_pointer p_traits)
+    {
+      if (!should_be_mine(b_it, e_it, checked_ind, p_traits))
+	{
+	  if (p_traits->cmp_prefixes(b_it, e_it, m_pref_b_it, m_pref_e_it, true))
+	    return (leftmost_descendant());
+
+	  return (rightmost_descendant());
+	}
+
+      size_type i = get_pref_pos(        b_it, e_it, p_traits);
+
+      PB_DS_DBG_ASSERT(i < arr_size);
+
+      if (m_a_p_children[i] != NULL)
+	return (m_a_p_children[i]);
+
+      while (++i < arr_size)
+	if (m_a_p_children[i] != NULL)
+	  {
+	    if (m_a_p_children[i]->m_type == pat_trie_leaf_node_type)
+	      return (m_a_p_children[i]);
+
+	    PB_DS_DBG_ASSERT(m_a_p_children[i]->m_type ==
+			     pat_trie_internal_node_type);
+
+	    return (static_cast<internal_node_pointer>(
+						       m_a_p_children[i])->leftmost_descendant());
+	  }
+
+      return (rightmost_descendant());
+    }
+
+    PB_DS_CLASS_T_DEC
+    inline typename PB_DS_CLASS_C_DEC::node_pointer
+    PB_DS_CLASS_C_DEC::
+    add_child(node_pointer p_nd, const_e_iterator b_it, const_e_iterator e_it, const_e_access_traits_pointer p_traits)
+    {
+      const size_type i = get_pref_pos(        b_it, e_it, p_traits);
+
+      PB_DS_DBG_ASSERT(i < arr_size);
+
+      if (m_a_p_children[i] == NULL)
+	{
+	  m_a_p_children[i] = p_nd;
+
+	  p_nd->m_p_parent = this;
+
+	  return (p_nd);
+	}
+
+      return (m_a_p_children[i]);
+    }
+
+    PB_DS_CLASS_T_DEC
+    typename PB_DS_CLASS_C_DEC::const_node_pointer
+    PB_DS_CLASS_C_DEC::
+    get_join_child(const_node_pointer p_nd, const_e_access_traits_pointer p_traits) const
+    {
+      return (const_cast<internal_node_pointer>(this)->get_join_child(
+								      const_cast<node_pointer>(p_nd),
+								      p_traits));
+    }
+
+    PB_DS_CLASS_T_DEC
+    typename PB_DS_CLASS_C_DEC::node_pointer
+    PB_DS_CLASS_C_DEC::
+    get_join_child(node_pointer p_nd, const_e_access_traits_pointer p_traits)
+    {
+      size_type i;
+
+      const_e_iterator b_it;
+      const_e_iterator e_it;
+
+      if (p_nd->m_type == pat_trie_leaf_node_type)
+	{
+	  typename Type_Traits::const_key_reference r_key =
+	    e_access_traits::extract_key(
+					 static_cast<const_leaf_pointer>(p_nd)->value());
+
+	  b_it = p_traits->begin(r_key);
+	  e_it = p_traits->end(r_key);
+	}
+      else
+	{
+	  b_it = static_cast<internal_node_pointer>(p_nd)->pref_b_it();
+	  e_it = static_cast<internal_node_pointer>(p_nd)->pref_e_it();
+	}
+
+      i = get_pref_pos(b_it, e_it, p_traits);
+
+      PB_DS_DBG_ASSERT(i < arr_size);
+
+      return (m_a_p_children[i]);
+    }
+
+    PB_DS_CLASS_T_DEC
+    void
+    PB_DS_CLASS_C_DEC::
+    remove_child(node_pointer p_nd)
+    {
+      size_type i = 0;
+
+      for (; i < arr_size; ++i)
+	if (m_a_p_children[i] == p_nd)
+	  {
+	    m_a_p_children[i] = NULL;
+
+	    return;
+	  }
+
+      PB_DS_DBG_ASSERT(i != arr_size);
+    }
+
+    PB_DS_CLASS_T_DEC
+    typename PB_DS_CLASS_C_DEC::iterator
+    PB_DS_CLASS_C_DEC::
+    remove_child(iterator it)
+    {
+      iterator ret = it;
+
+      ++ret;
+
+      * it.m_p_p_cur = NULL;
+
+      return (ret);
+    }
+
+    PB_DS_CLASS_T_DEC
+    void
+    PB_DS_CLASS_C_DEC::
+    replace_child(node_pointer p_nd, const_e_iterator b_it, const_e_iterator e_it, const_e_access_traits_pointer p_traits)
+    {
+      const size_type i = get_pref_pos(        b_it, e_it, p_traits);
+
+      PB_DS_DBG_ASSERT(i < arr_size);
+
+      m_a_p_children[i] = p_nd;
+
+      p_nd->m_p_parent = this;
+    }
+
+    PB_DS_CLASS_T_DEC
+    inline typename PB_DS_CLASS_C_DEC::const_e_iterator
+    PB_DS_CLASS_C_DEC::
+    pref_b_it() const
+    {
+      return (m_pref_b_it);
+    }
+
+    PB_DS_CLASS_T_DEC
+    inline typename PB_DS_CLASS_C_DEC::const_e_iterator
+    PB_DS_CLASS_C_DEC::
+    pref_e_it() const
+    {
+      return (m_pref_e_it);
+    }
+
+    PB_DS_CLASS_T_DEC
+    inline typename PB_DS_CLASS_C_DEC::size_type
+    PB_DS_CLASS_C_DEC::
+    get_e_ind() const
+    {
+      return (m_e_ind);
+    }
+
+    PB_DS_CLASS_T_DEC
+    bool
+    PB_DS_CLASS_C_DEC::
+    should_be_mine(const_e_iterator b_it, const_e_iterator e_it, size_type checked_ind, const_e_access_traits_pointer p_traits) const
+    {
+      if (m_e_ind == 0)
+	return (true);
+
+      const size_type num_es = std::distance(b_it, e_it);
+
+      if (num_es < m_e_ind)
+	return (false);
+
+      const_e_iterator key_b_it = b_it;
+      std::advance(key_b_it, checked_ind);
+      const_e_iterator key_e_it = b_it;
+      std::advance(key_e_it, m_e_ind);
+
+      const_e_iterator value_b_it = m_pref_b_it;
+      std::advance(value_b_it, checked_ind);
+      const_e_iterator value_e_it = m_pref_b_it;
+      std::advance(value_e_it, m_e_ind);
+
+      return (p_traits->equal_prefixes(            key_b_it, key_e_it, value_b_it, value_e_it));
+    }
+
+    PB_DS_CLASS_T_DEC
+    typename PB_DS_CLASS_C_DEC::leaf_pointer
+    PB_DS_CLASS_C_DEC::
+    leftmost_descendant()
+    {
+      node_pointer p_pot =* begin();
+
+      if (p_pot->m_type == pat_trie_leaf_node_type)
+	return (static_cast<leaf_pointer>(p_pot));
+
+      PB_DS_DBG_ASSERT(p_pot->m_type == pat_trie_internal_node_type);
+
+      return (static_cast<internal_node_pointer>(p_pot)->leftmost_descendant());
+    }
+
+    PB_DS_CLASS_T_DEC
+    typename PB_DS_CLASS_C_DEC::const_leaf_pointer
+    PB_DS_CLASS_C_DEC::
+    leftmost_descendant() const
+    {
+      return (const_cast<internal_node_pointer>(this)->leftmost_descendant());
+    }
+
+    PB_DS_CLASS_T_DEC
+    typename PB_DS_CLASS_C_DEC::leaf_pointer
+    PB_DS_CLASS_C_DEC::
+    rightmost_descendant()
+    {
+      const size_type num_children = std::distance(begin(), end());
+
+      PB_DS_DBG_ASSERT(num_children >= 2);
+
+      iterator it = begin();
+      std::advance(it, num_children - 1);
+
+      node_pointer p_pot =* it;
+
+      if (p_pot->m_type == pat_trie_leaf_node_type)
+	return (static_cast<leaf_pointer>(p_pot));
+
+      PB_DS_DBG_ASSERT(p_pot->m_type == pat_trie_internal_node_type);
+
+      return (static_cast<internal_node_pointer>(p_pot)->rightmost_descendant());
+    }
+
+    PB_DS_CLASS_T_DEC
+    typename PB_DS_CLASS_C_DEC::const_leaf_pointer
+    PB_DS_CLASS_C_DEC::
+    rightmost_descendant() const
+    {
+      return (const_cast<internal_node_pointer>(this)->rightmost_descendant());
+    }
+
+#ifdef PB_DS_PAT_TRIE_DEBUG_
+    PB_DS_CLASS_T_DEC
+    typename PB_DS_CLASS_C_DEC::size_type
+    PB_DS_CLASS_C_DEC::
+    e_ind() const
+    {
+      return (m_e_ind);
+    }
+#endif // #ifdef PB_DS_PAT_TRIE_DEBUG_
+
+    PB_DS_CLASS_T_DEC
+    typename PB_DS_CLASS_C_DEC::size_type
+    PB_DS_CLASS_C_DEC::
+    get_begin_pos() const
+    {
+      size_type i;
+
+      for (i = 0; i < arr_size&&  m_a_p_children[i] == NULL; ++i)
+	;
+
+      return (i);
+    }
+
+#ifdef PB_DS_PAT_TRIE_DEBUG_
+    PB_DS_CLASS_T_DEC
+    typename PB_DS_CLASS_C_DEC::subtree_debug_info
+    PB_DS_CLASS_C_DEC::
+    assert_valid_imp(const_e_access_traits_pointer p_traits) const
+    {
+      PB_DS_DBG_ASSERT(base_type::m_type == pat_trie_internal_node_type);
+
+      PB_DS_DBG_ASSERT(
+		       static_cast<size_type>(std::distance(pref_b_it(), pref_e_it())) ==
+		       m_e_ind);
+
+      PB_DS_DBG_ASSERT(
+		       std::distance(begin(), end()) >= 2);
+
+      for (typename pat_trie_internal_node::const_iterator it = begin();
+	   it != end(); ++it)
+	{
+	  const_node_pointer p_nd =* it;
+
+	  PB_DS_DBG_ASSERT(p_nd->m_p_parent == this);
+
+	  subtree_debug_info child_ret = p_nd->assert_valid_imp(p_traits);
+
+	  PB_DS_DBG_ASSERT(
+			   static_cast<size_type>(std::distance(child_ret.first, child_ret.second)) >=
+			   m_e_ind);
+
+	  PB_DS_DBG_ASSERT(should_be_mine(child_ret.first, child_ret.second, 0, p_traits));
+
+	  PB_DS_DBG_ASSERT(
+			   get_pref_pos(child_ret.first, child_ret.second, p_traits) ==
+			   static_cast<size_type>(it.m_p_p_cur - m_a_p_children));
+	}
+
+      return (std::make_pair(pref_b_it(), pref_e_it()));
+    }
+#endif // #ifdef PB_DS_PAT_TRIE_DEBUG_
+
+#undef PB_DS_CLASS_T_DEC
+
+#undef PB_DS_CLASS_C_DEC
+
+#undef PB_DS_BASE_C_DEC
+
+#undef PB_DS_LEAF_C_DEC
+
+#undef PB_DS_STATIC_ASSERT
+
+#undef PB_DS_DBG_ASSERT
+#undef PB_DS_DBG_VERIFY
+#undef PB_DS_DBG_ONLY
+
+  } // namespace detail
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_PAT_TRIE_NODE_BASE_HPP
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/iterators_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/iterators_fn_imps.hpp
new file mode 100644
index 00000000000..0f3658561ae
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/iterators_fn_imps.hpp
@@ -0,0 +1,148 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file iterators_fn_imps.hpp
+ * Contains an implementation class for bin_search_tree_.
+ */
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::iterator
+PB_DS_CLASS_C_DEC::
+begin()
+{
+  return (iterator(m_p_head->m_p_min));
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::const_iterator
+PB_DS_CLASS_C_DEC::
+begin() const
+{
+  return (const_iterator(m_p_head->m_p_min));
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::iterator
+PB_DS_CLASS_C_DEC::
+end()
+{
+  return (iterator(m_p_head));
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::const_iterator
+PB_DS_CLASS_C_DEC::
+end() const
+{
+  return (const_iterator(m_p_head));
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::const_reverse_iterator
+PB_DS_CLASS_C_DEC::
+rbegin() const
+{
+  if (empty())
+    return (rend());
+
+  return (--end());
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::reverse_iterator
+PB_DS_CLASS_C_DEC::
+rbegin()
+{
+  if (empty())
+    return (rend());
+
+  return (--end());
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::reverse_iterator
+PB_DS_CLASS_C_DEC::
+rend()
+{
+  return (reverse_iterator(m_p_head));
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::const_reverse_iterator
+PB_DS_CLASS_C_DEC::
+rend() const
+{
+  return (const_reverse_iterator(m_p_head));
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::const_node_iterator
+PB_DS_CLASS_C_DEC::
+node_begin() const
+{
+  return (const_node_iterator(m_p_head->m_p_parent, this));
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::node_iterator
+PB_DS_CLASS_C_DEC::
+node_begin()
+{
+  return (node_iterator(m_p_head->m_p_parent, this));
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::const_node_iterator
+PB_DS_CLASS_C_DEC::
+node_end() const
+{
+  return (const_node_iterator(NULL, this));
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::node_iterator
+PB_DS_CLASS_C_DEC::
+node_end()
+{
+  return (node_iterator(NULL, this));
+}
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/leaf.hpp b/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/leaf.hpp
new file mode 100644
index 00000000000..e2eae3d4e48
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/leaf.hpp
@@ -0,0 +1,207 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file leaf.hpp
+ * Contains a pat_trie_leaf for a patricia tree.
+ */
+
+#ifndef PB_DS_PAT_TRIE_LEAF_HPP
+#define PB_DS_PAT_TRIE_LEAF_HPP
+
+namespace pb_ds
+{
+  namespace detail
+  {
+
+#define PB_DS_CLASS_T_DEC						\
+    template<								\
+						class Type_Traits,	\
+						class E_Access_Traits,	\
+						class Metadata,		\
+						class Allocator>
+
+#define PB_DS_CLASS_C_DEC						\
+    pat_trie_leaf<							\
+						Type_Traits,		\
+						E_Access_Traits,	\
+						Metadata,		\
+						Allocator>
+
+#define PB_DS_BASE_C_DEC					\
+    pat_trie_node_base<						\
+					Type_Traits,		\
+					E_Access_Traits,	\
+					Metadata,		\
+					Allocator>
+
+#define PB_DS_PAT_TRIE_SUBTREE_DEBUG_INFO_C_DEC				\
+    pat_trie_subtree_debug_info<					\
+							Type_Traits,	\
+							E_Access_Traits, \
+							Allocator>
+
+#ifdef PB_DS_PAT_TRIE_DEBUG_
+#define PB_DS_DBG_ASSERT(X) assert(X)
+#define PB_DS_DBG_VERIFY(X) assert(X)
+#define PB_DS_DBG_ONLY(X) X
+#else // #ifdef PB_DS_PAT_TRIE_DEBUG_
+#define PB_DS_DBG_ASSERT(X)
+#define PB_DS_DBG_VERIFY(X) {if((X)==0);}
+#define PB_DS_DBG_ONLY(X) ;
+#endif // #ifdef PB_DS_PAT_TRIE_DEBUG_
+
+    template<typename Type_Traits,
+	     class E_Access_Traits,
+	     class Metadata,
+	     class Allocator>
+    struct pat_trie_leaf : public PB_DS_BASE_C_DEC
+    {
+    private:
+      typedef typename Type_Traits::value_type value_type;
+
+      typedef typename Type_Traits::const_reference const_reference;
+
+      typedef typename Type_Traits::reference reference;
+
+      typedef
+      typename Allocator::template rebind<
+	E_Access_Traits>::other::const_pointer
+      const_e_access_traits_pointer;
+
+#ifdef PB_DS_PAT_TRIE_DEBUG_
+      typedef
+      typename PB_DS_BASE_C_DEC::subtree_debug_info
+      subtree_debug_info;
+#endif // #ifdef PB_DS_PAT_TRIE_DEBUG_
+
+      typedef PB_DS_BASE_C_DEC base_type;
+
+    public:
+      pat_trie_leaf(const_reference r_val);
+
+      inline reference
+      value();
+
+      inline const_reference
+      value() const;
+
+#ifdef PB_DS_PAT_TRIE_DEBUG_
+      virtual subtree_debug_info
+      assert_valid_imp(const_e_access_traits_pointer p_traits) const;
+#endif // #ifdef PB_DS_PAT_TRIE_DEBUG_
+
+#ifdef PB_DS_PAT_TRIE_DEBUG_
+      virtual
+      ~pat_trie_leaf();
+#endif // #ifdef PB_DS_PAT_TRIE_DEBUG_
+
+    private:
+      pat_trie_leaf(const PB_DS_CLASS_C_DEC& other);
+
+    private:
+      value_type m_value;
+    };
+
+    PB_DS_CLASS_T_DEC
+    PB_DS_CLASS_C_DEC::
+    pat_trie_leaf(const_reference r_val) :
+      PB_DS_BASE_C_DEC(pat_trie_leaf_node_type),
+      m_value(r_val)
+    { }
+
+    PB_DS_CLASS_T_DEC
+    inline typename PB_DS_CLASS_C_DEC::reference
+    PB_DS_CLASS_C_DEC::
+    value()
+    {
+      return (m_value);
+    }
+
+    PB_DS_CLASS_T_DEC
+    inline typename PB_DS_CLASS_C_DEC::const_reference
+    PB_DS_CLASS_C_DEC::
+    value() const
+    {
+      return (m_value);
+    }
+
+#ifdef PB_DS_PAT_TRIE_DEBUG_
+    PB_DS_CLASS_T_DEC
+    typename PB_DS_CLASS_C_DEC::subtree_debug_info
+    PB_DS_CLASS_C_DEC::
+    assert_valid_imp(const_e_access_traits_pointer p_traits) const
+    {
+      PB_DS_DBG_ASSERT(base_type::m_type == pat_trie_leaf_node_type);
+
+      subtree_debug_info ret;
+
+      const_reference r_val = value();
+
+      return (std::make_pair(
+			     p_traits->begin(p_traits->extract_key(r_val)),
+			     p_traits->end(p_traits->extract_key(r_val))));
+    }
+#endif // #ifdef PB_DS_PAT_TRIE_DEBUG_
+
+#ifdef PB_DS_PAT_TRIE_DEBUG_
+    PB_DS_CLASS_T_DEC
+    PB_DS_CLASS_C_DEC::
+    ~pat_trie_leaf()
+    { }
+#endif // #ifdef PB_DS_PAT_TRIE_DEBUG_
+
+#undef PB_DS_CLASS_T_DEC
+
+#undef PB_DS_CLASS_C_DEC
+
+#undef PB_DS_BASE_C_DEC
+
+#undef PB_DS_PAT_TRIE_SUBTREE_DEBUG_INFO_C_DEC
+
+#undef PB_DS_DBG_ASSERT
+#undef PB_DS_DBG_VERIFY
+#undef PB_DS_DBG_ONLY
+
+  } // namespace detail
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_PAT_TRIE_NODE_BASE_HPP
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/node_base.hpp b/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/node_base.hpp
new file mode 100644
index 00000000000..eeafb51d6b3
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/node_base.hpp
@@ -0,0 +1,155 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file node_base.hpp
+ * Contains a pat_trie_node_base base for a patricia tree.
+ */
+
+#ifndef PB_DS_PAT_TRIE_NODE_BASE_HPP
+#define PB_DS_PAT_TRIE_NODE_BASE_HPP
+
+#include <ext/pb_ds/detail/pat_trie_/node_metadata_base.hpp>
+
+namespace pb_ds
+{
+  namespace detail
+  {
+
+#define PB_DS_CLASS_T_DEC						\
+    template<								\
+						class Type_Traits,	\
+						class E_Access_Traits,	\
+						class Metadata,		\
+						class Allocator>
+
+#define PB_DS_CLASS_C_DEC					\
+    pat_trie_node_base<						\
+					Type_Traits,		\
+					E_Access_Traits,	\
+					Metadata,		\
+					Allocator>
+
+#define PB_DS_PAT_TRIE_SUBTREE_DEBUG_INFO_C_DEC				\
+    pat_trie_subtree_debug_info<					\
+							Type_Traits,	\
+							E_Access_Traits, \
+							Allocator>
+
+    enum pat_trie_node_type
+      {
+	pat_trie_internal_node_type,
+	pat_trie_leaf_node_type,
+	pat_trie_head_node_type
+      };
+
+    template<typename Type_Traits,
+	     class E_Access_Traits,
+	     class Metadata,
+	     class Allocator>
+    struct pat_trie_node_base : public pat_trie_node_metadata_base<
+      Metadata,
+      Allocator>
+    {
+    public:
+      typedef
+      typename Allocator::template rebind<
+      pat_trie_node_base>::other::pointer
+      node_pointer;
+
+      typedef
+      typename Allocator::template rebind<
+	E_Access_Traits>::other::const_pointer
+      const_e_access_traits_pointer;
+
+#ifdef PB_DS_PAT_TRIE_DEBUG_
+      typedef
+      std::pair<
+	typename E_Access_Traits::const_iterator,
+	typename E_Access_Traits::const_iterator>
+      subtree_debug_info;
+#endif // #ifdef PB_DS_PAT_TRIE_DEBUG_
+
+    public:
+      pat_trie_node_base(pat_trie_node_type type);
+
+#ifdef PB_DS_PAT_TRIE_DEBUG_
+      void
+      assert_valid(const_e_access_traits_pointer p_traits) const;
+#endif // #ifdef PB_DS_PAT_TRIE_DEBUG_
+
+#ifdef PB_DS_PAT_TRIE_DEBUG_
+      virtual subtree_debug_info
+      assert_valid_imp(const_e_access_traits_pointer p_traits) const = 0;
+#endif // #ifdef PB_DS_PAT_TRIE_DEBUG_
+
+    public:
+      node_pointer m_p_parent;
+
+      const pat_trie_node_type m_type;
+    };
+
+    PB_DS_CLASS_T_DEC
+    PB_DS_CLASS_C_DEC::
+    pat_trie_node_base(pat_trie_node_type type) :
+      m_type(type)
+    { }
+
+#ifdef PB_DS_PAT_TRIE_DEBUG_
+    PB_DS_CLASS_T_DEC
+    void
+    PB_DS_CLASS_C_DEC::
+    assert_valid(const_e_access_traits_pointer p_traits) const
+    {
+      assert_valid_imp(p_traits);
+    }
+#endif // #ifdef PB_DS_PAT_TRIE_DEBUG_
+
+#undef PB_DS_CLASS_T_DEC
+
+#undef PB_DS_CLASS_C_DEC
+
+#undef PB_DS_PAT_TRIE_SUBTREE_DEBUG_INFO_C_DEC
+
+  } // namespace detail
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_PAT_TRIE_NODE_BASE_HPP
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/node_iterators.hpp b/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/node_iterators.hpp
new file mode 100644
index 00000000000..24d9d51cb26
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/node_iterators.hpp
@@ -0,0 +1,383 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file node_iterators.hpp
+ * Contains an implementation class for pat_trie_.
+ */
+
+#ifndef PB_DS_PAT_TRIE_NODE_ITERATORS_HPP
+#define PB_DS_PAT_TRIE_NODE_ITERATORS_HPP
+
+namespace pb_ds
+{
+  namespace detail
+  {
+
+#ifdef PB_DS_PAT_TRIE_DEBUG_
+#define PB_DS_DBG_ASSERT(X) assert(X)
+#define PB_DS_DBG_VERIFY(X) assert(X)
+#define PB_DS_DBG_ONLY(X) X
+#else // #ifdef PB_DS_PAT_TRIE_DEBUG_
+#define PB_DS_DBG_ASSERT(X)
+#define PB_DS_DBG_VERIFY(X) {if((X)==0);}
+#define PB_DS_DBG_ONLY(X) ;
+#endif // #ifdef PB_DS_PAT_TRIE_DEBUG_
+
+#define PB_DS_PAT_TRIE_CONST_NODE_ITERATOR_C_DEC			\
+    pat_trie_const_node_it_<						\
+							Node,		\
+							Leaf,		\
+							Head,		\
+							Internal_Node,	\
+							Const_Iterator,	\
+							Iterator,	\
+							E_Access_Traits, \
+							Allocator>
+
+#define PB_DS_PAT_TRIE_NODE_ITERATOR_C_DEC			\
+    pat_trie_node_it_<						\
+					Node,			\
+					Leaf,			\
+					Head,			\
+					Internal_Node,		\
+					Const_Iterator,		\
+					Iterator,		\
+					E_Access_Traits,	\
+					Allocator>
+
+    // Const node iterator.
+    template<typename Node,
+	     class Leaf,
+	     class Head,
+	     class Internal_Node,
+	     class Const_Iterator,
+	     class Iterator,
+	     class E_Access_Traits,
+	     class Allocator>
+    class pat_trie_const_node_it_
+    {
+
+    protected:
+      typedef
+      typename Allocator::template rebind<
+      Node>::other::pointer
+      node_pointer;
+
+      typedef
+      typename Allocator::template rebind<
+	Leaf>::other::const_pointer
+      const_leaf_pointer;
+
+      typedef
+      typename Allocator::template rebind<
+	Leaf>::other::pointer
+      leaf_pointer;
+
+      typedef
+      typename Allocator::template rebind<
+	Internal_Node>::other::pointer
+      internal_node_pointer;
+
+      typedef
+      typename Allocator::template rebind<
+	Internal_Node>::other::const_pointer
+      const_internal_node_pointer;
+
+      typedef
+      typename Allocator::template rebind<
+	E_Access_Traits>::other::const_pointer
+      const_e_access_traits_pointer;
+
+    private:
+      inline typename E_Access_Traits::const_iterator
+      pref_begin() const
+      {
+	if (m_p_nd->m_type == pat_trie_leaf_node_type)
+	  return (m_p_traits->begin(
+				    m_p_traits->extract_key(
+							    static_cast<const_leaf_pointer>(m_p_nd)->value())));
+
+	PB_DS_DBG_ASSERT(m_p_nd->m_type == pat_trie_internal_node_type);
+
+	return (static_cast<const_internal_node_pointer>(m_p_nd)->pref_b_it());
+      }
+
+      inline typename E_Access_Traits::const_iterator
+      pref_end() const
+      {
+	if (m_p_nd->m_type == pat_trie_leaf_node_type)
+	  return (m_p_traits->end(
+				  m_p_traits->extract_key(
+							  static_cast<const_leaf_pointer>(m_p_nd)->value())));
+
+	PB_DS_DBG_ASSERT(m_p_nd->m_type == pat_trie_internal_node_type);
+
+	return (static_cast<const_internal_node_pointer>(m_p_nd)->pref_e_it());
+      }
+
+    public:
+
+      // Size type.
+      typedef typename Allocator::size_type size_type;
+
+      // Category.
+      typedef trivial_iterator_tag iterator_category;
+
+      // Difference type.
+      typedef trivial_iterator_difference_type difference_type;
+
+      // __Iterator's value type.
+      typedef Const_Iterator value_type;
+
+      // __Iterator's reference type.
+      typedef value_type reference;
+
+      // __Iterator's __const reference type.
+      typedef value_type const_reference;
+
+      // Element access traits.
+      typedef E_Access_Traits e_access_traits;
+
+      // A key's element __const iterator.
+      typedef typename e_access_traits::const_iterator const_e_iterator;
+
+      // Metadata type.
+      typedef typename Node::metadata_type metadata_type;
+
+      // Const metadata reference type.
+      typedef
+      typename Allocator::template rebind<
+	metadata_type>::other::const_reference
+      const_metadata_reference;
+
+    public:
+
+      // Default constructor.
+      /*
+	inline
+	pat_trie_const_node_it_()
+      */
+
+      inline
+      pat_trie_const_node_it_(node_pointer p_nd = NULL,  const_e_access_traits_pointer p_traits = NULL) : m_p_nd(const_cast<node_pointer>(p_nd)),
+													  m_p_traits(p_traits)
+      { }
+
+      // Subtree valid prefix.
+      inline std::pair<
+	const_e_iterator,
+	const_e_iterator>
+      valid_prefix() const
+      {
+	return (std::make_pair(
+			       pref_begin(),
+			       pref_end()));
+      }
+
+      // Const access; returns the __const iterator*  associated with the current leaf.
+      inline const_reference
+      operator*() const
+      {
+	PB_DS_DBG_ASSERT(num_children() == 0);
+
+	return (Const_Iterator(m_p_nd));
+      }
+
+      // Metadata access.
+      inline const_metadata_reference
+      get_metadata() const
+      {
+	return (m_p_nd->get_metadata());
+      }
+
+      // Returns the number of children in the corresponding node.
+      inline size_type
+      num_children() const
+      {
+	if (m_p_nd->m_type == pat_trie_leaf_node_type)
+	  return (0);
+
+	PB_DS_DBG_ASSERT(m_p_nd->m_type == pat_trie_internal_node_type);
+
+	return (std::distance(
+			      static_cast<internal_node_pointer>(m_p_nd)->begin(),
+			      static_cast<internal_node_pointer>(m_p_nd)->end()));
+      }
+
+      // Returns a __const node __iterator to the corresponding node's i-th child.
+      PB_DS_PAT_TRIE_CONST_NODE_ITERATOR_C_DEC
+      get_child(size_type i) const
+      {
+	PB_DS_DBG_ASSERT(m_p_nd->m_type == pat_trie_internal_node_type);
+
+	typename Internal_Node::iterator it =
+	  static_cast<internal_node_pointer>(m_p_nd)->begin();
+
+	std::advance(it, i);
+
+	return (PB_DS_PAT_TRIE_CONST_NODE_ITERATOR_C_DEC(*it, m_p_traits));
+      }
+
+      // Compares content to a different iterator object.
+      inline bool
+      operator==(const PB_DS_PAT_TRIE_CONST_NODE_ITERATOR_C_DEC& other) const
+      {
+	return (m_p_nd == other.m_p_nd);
+      }
+
+      // Compares content (negatively) to a different iterator object.
+      inline bool
+      operator!=(const PB_DS_PAT_TRIE_CONST_NODE_ITERATOR_C_DEC& other) const
+      {
+	return (m_p_nd != other.m_p_nd);
+      }
+
+    private:
+
+      friend class PB_DS_CLASS_C_DEC;
+
+    public:
+      node_pointer m_p_nd;
+
+      const_e_access_traits_pointer m_p_traits;
+    };
+
+    // Node iterator.
+    template<typename Node,
+	     class Leaf,
+	     class Head,
+	     class Internal_Node,
+	     class Const_Iterator,
+	     class Iterator,
+	     class E_Access_Traits,
+	     class Allocator>
+    class pat_trie_node_it_ : 
+      public PB_DS_PAT_TRIE_CONST_NODE_ITERATOR_C_DEC
+
+    {
+
+    private:
+      typedef
+      typename Allocator::template rebind<
+      Node>::other::pointer
+      node_pointer;
+
+      typedef Iterator iterator;
+
+      typedef PB_DS_PAT_TRIE_CONST_NODE_ITERATOR_C_DEC base_type;
+
+      typedef
+      typename base_type::const_e_access_traits_pointer
+      const_e_access_traits_pointer;
+
+      typedef typename base_type::internal_node_pointer internal_node_pointer;
+
+    public:
+
+      // Size type.
+      typedef
+      typename PB_DS_PAT_TRIE_CONST_NODE_ITERATOR_C_DEC::size_type
+      size_type;
+
+      // __Iterator's value type.
+      typedef Iterator value_type;
+
+      // __Iterator's reference type.
+      typedef value_type reference;
+
+      // __Iterator's __const reference type.
+      typedef value_type const_reference;
+
+    public:
+
+      // Default constructor.
+      /*
+	inline
+	pat_trie_node_it_() ;
+      */
+
+      inline
+      pat_trie_node_it_(node_pointer p_nd = NULL,  const_e_access_traits_pointer p_traits = NULL) : base_type(p_nd, p_traits)
+      { }
+
+      // Access; returns the iterator*  associated with the current leaf.
+      inline reference
+      operator*() const
+      {
+	PB_DS_DBG_ASSERT(base_type::num_children() == 0);
+
+	return (Iterator(base_type::m_p_nd));
+
+      }
+
+      // Returns a node __iterator to the corresponding node's i-th child.
+      PB_DS_PAT_TRIE_NODE_ITERATOR_C_DEC
+      get_child(size_type i) const
+      {
+	PB_DS_DBG_ASSERT(base_type::m_p_nd->m_type ==
+			 pat_trie_internal_node_type);
+
+	typename Internal_Node::iterator it =
+	  static_cast<internal_node_pointer>(base_type::m_p_nd)->begin();
+
+	std::advance(it, i);
+
+	return (PB_DS_PAT_TRIE_NODE_ITERATOR_C_DEC(*it, base_type::m_p_traits));
+      }
+
+    private:
+      friend class PB_DS_CLASS_C_DEC;
+    };
+
+#undef PB_DS_PAT_TRIE_CONST_NODE_ITERATOR_C_DEC
+
+#undef PB_DS_PAT_TRIE_NODE_ITERATOR_C_DEC
+
+#undef PB_DS_DBG_ASSERT
+#undef PB_DS_DBG_VERIFY
+#undef PB_DS_DBG_ONLY
+
+  } // namespace detail
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_PAT_TRIE_NODE_ITERATORS_HPP
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/node_metadata_base.hpp b/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/node_metadata_base.hpp
new file mode 100644
index 00000000000..5434ff9d408
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/node_metadata_base.hpp
@@ -0,0 +1,92 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file node_metadata_base.hpp
+ * Contains an internal PB_DS_BASE_C_DEC for a patricia tree.
+ */
+
+#ifndef PB_DS_PAT_TRIE_NODE_METADATA_BASE_HPP
+#define PB_DS_PAT_TRIE_NODE_METADATA_BASE_HPP
+
+#include <ext/pb_ds/detail/basic_tree_policy/null_node_metadata.hpp>
+
+namespace pb_ds
+{
+  namespace detail
+  {
+
+    template<typename Metadata, class Allocator>
+    struct pat_trie_node_metadata_base
+    {
+    public:
+      typedef Metadata metadata_type;
+
+      typedef
+      typename Allocator::template rebind<
+	metadata_type>::other::const_reference
+      const_metadata_reference;
+
+    public:
+      inline const_metadata_reference
+      get_metadata() const
+      {
+	return (m_metadata);
+      }
+
+    public:
+      metadata_type m_metadata;
+    };
+
+    template<typename Allocator>
+    struct pat_trie_node_metadata_base<
+      null_node_metadata,
+      Allocator>
+    {
+    public:
+      typedef null_node_metadata metadata_type;
+    };
+
+  } // namespace detail
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_PAT_TRIE_NODE_BASE_HPP
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/pat_trie_.hpp b/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/pat_trie_.hpp
new file mode 100644
index 00000000000..25093e7e434
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/pat_trie_.hpp
@@ -0,0 +1,658 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file pat_trie_.hpp
+ * Contains an implementation class for a patricia tree.
+ */
+
+/**
+ * This implementation loosely borrows ideas from:
+ * 1) "Fast Mergeable Integer Maps", Okasaki, Gill 1998
+ * 2) "Ptset: Sets of integers implemented as Patricia trees",
+ *    Jean-Christophe Filliatr, 2000
+ **/
+
+#include <ext/pb_ds/detail/pat_trie_/synth_e_access_traits.hpp>
+#include <ext/pb_ds/detail/pat_trie_/node_base.hpp>
+#include <ext/pb_ds/exception.hpp>
+#include <ext/pb_ds/tag_and_trait.hpp>
+#include <ext/pb_ds/detail/eq_fn/eq_by_less.hpp>
+#include <ext/pb_ds/detail/types_traits.hpp>
+#include <ext/pb_ds/tree_policy.hpp>
+#include <ext/pb_ds/detail/cond_dealtor.hpp>
+#include <ext/pb_ds/detail/type_utils.hpp>
+#include <iterator>
+#include <utility>
+#include <algorithm>
+#include <functional>
+#include <assert.h>
+#include <list>
+#ifdef PB_DS_USE_MAP_DEBUG_BASE
+#include <ext/pb_ds/detail/map_debug_base.hpp>
+#endif // #ifdef PB_DS_USE_MAP_DEBUG_BASE
+
+namespace pb_ds
+{
+  namespace detail
+  {
+
+#ifdef PB_DS_PAT_TRIE_DEBUG_
+#define PB_DS_DBG_ASSERT(X) assert(X)
+#define PB_DS_DBG_VERIFY(X) assert(X)
+#define PB_DS_DBG_ONLY(X) X
+#else // #ifdef PB_DS_PAT_TRIE_DEBUG_
+#define PB_DS_DBG_ASSERT(X)
+#define PB_DS_DBG_VERIFY(X) {if((X)==0);}
+#define PB_DS_DBG_ONLY(X) ;
+#endif // #ifdef PB_DS_PAT_TRIE_DEBUG_
+
+#define PB_DS_CLASS_T_DEC						\
+    template<								\
+						typename Key,		\
+						typename Mapped,	\
+						class Node_And_It_Traits, \
+						class Allocator>
+
+#ifdef PB_DS_DATA_TRUE_INDICATOR
+#define PB_DS_CLASS_NAME			\
+    pat_trie_data_
+#endif // #ifdef PB_DS_DATA_TRUE_INDICATOR
+
+#ifdef PB_DS_DATA_FALSE_INDICATOR
+#define PB_DS_CLASS_NAME			\
+    pat_trie_no_data_
+#endif // #ifdef PB_DS_DATA_FALSE_INDICATOR
+
+#define PB_DS_CLASS_C_DEC						\
+    PB_DS_CLASS_NAME<							\
+						Key,			\
+						Mapped,			\
+						Node_And_It_Traits,	\
+						Allocator>
+
+#define PB_DS_TYPES_TRAITS_C_DEC				\
+    types_traits<				\
+						Key,		\
+						Mapped,		\
+						Allocator,	\
+						false>
+
+#ifdef PB_DS_USE_MAP_DEBUG_BASE
+#define PB_DS_MAP_DEBUG_BASE_C_DEC					\
+    map_debug_base<					\
+								Key,	\
+								eq_by_less< \
+												Key, \
+												std::less< \
+														Key> >, \
+								typename Allocator::template rebind< \
+												     Key>::other::const_reference>
+#endif // #ifdef PB_DS_USE_MAP_DEBUG_BASE
+
+#ifdef PB_DS_DATA_TRUE_INDICATOR
+#define PB_DS_V2F(X) (X).first
+#define PB_DS_V2S(X) (X).second
+#define PB_DS_EP2VP(X)& ((X)->m_value)
+#endif // #ifdef PB_DS_DATA_TRUE_INDICATOR
+
+#ifdef PB_DS_DATA_FALSE_INDICATOR
+#define PB_DS_V2F(X) (X)
+#define PB_DS_V2S(X) Mapped_Data()
+#define PB_DS_EP2VP(X)& ((X)->m_value.first)
+#endif // #ifdef PB_DS_DATA_FALSE_INDICATOR
+
+#define PB_DS_STATIC_ASSERT(UNIQUE, E)					\
+    typedef								\
+    static_assert_dumclass<				\
+									sizeof(static_assert<(bool)(E)>)> \
+    UNIQUE##static_assert_type
+
+    /**
+     * class description = PATRICIA trie implementation.">
+     **/
+    template<typename Key,
+	     typename Mapped,
+	     class Node_And_It_Traits,
+	     class Allocator>
+    class PB_DS_CLASS_NAME :
+#ifdef PB_DS_PAT_TRIE_DEBUG_
+      public PB_DS_MAP_DEBUG_BASE_C_DEC,
+#endif // #ifdef PB_DS_PAT_TRIE_DEBUG_
+      public Node_And_It_Traits::synth_e_access_traits,
+      public Node_And_It_Traits::node_update,
+      public PB_DS_TYPES_TRAITS_C_DEC
+    {
+
+    private:
+
+      typedef
+      typename Node_And_It_Traits::synth_e_access_traits
+      synth_e_access_traits;
+
+      typedef
+      typename Allocator::template rebind<
+	synth_e_access_traits>::other::const_pointer
+      const_e_access_traits_pointer;
+
+      typedef
+      typename synth_e_access_traits::const_iterator
+      const_e_iterator;
+
+      typedef typename Node_And_It_Traits::node node;
+
+      typedef
+      typename Allocator::template rebind<
+	node>::other::const_pointer
+      const_node_pointer;
+
+      typedef
+      typename Allocator::template rebind<
+	node>::other::pointer
+      node_pointer;
+
+      typedef typename Node_And_It_Traits::head head;
+
+      typedef
+      typename Allocator::template rebind<
+	head>::other
+      head_allocator;
+
+      typedef typename head_allocator::pointer head_pointer;
+
+      typedef typename Node_And_It_Traits::leaf leaf;
+
+      typedef
+      typename Allocator::template rebind<
+	leaf>::other
+      leaf_allocator;
+
+      typedef typename leaf_allocator::const_pointer const_leaf_pointer;
+
+      typedef typename leaf_allocator::pointer leaf_pointer;
+
+      typedef typename Node_And_It_Traits::internal_node internal_node;
+
+      typedef
+      typename Allocator::template rebind<
+	internal_node>::other
+      internal_node_allocator;
+
+      typedef
+      typename internal_node_allocator::const_pointer
+      const_internal_node_pointer;
+
+      typedef
+      typename internal_node_allocator::pointer
+      internal_node_pointer;
+
+      typedef PB_DS_TYPES_TRAITS_C_DEC traits_base;
+
+#include <ext/pb_ds/detail/pat_trie_/cond_dtor_entry_dealtor.hpp>
+
+#ifdef PB_DS_PAT_TRIE_DEBUG_
+      typedef PB_DS_MAP_DEBUG_BASE_C_DEC map_debug_base;
+#endif // #ifdef PB_DS_PAT_TRIE_DEBUG_
+
+#include <ext/pb_ds/detail/pat_trie_/split_join_branch_bag.hpp>
+
+      typedef
+      typename Node_And_It_Traits::null_node_update_pointer
+      null_node_update_pointer;
+
+    public:
+      typedef pat_trie_tag container_category;
+
+      typedef typename Allocator::size_type size_type;
+
+      typedef typename Allocator::difference_type difference_type;
+
+      typedef typename PB_DS_TYPES_TRAITS_C_DEC::key_type key_type;
+
+      typedef typename PB_DS_TYPES_TRAITS_C_DEC::key_pointer key_pointer;
+
+      typedef
+      typename PB_DS_TYPES_TRAITS_C_DEC::const_key_pointer
+      const_key_pointer;
+
+      typedef typename PB_DS_TYPES_TRAITS_C_DEC::key_reference key_reference;
+
+      typedef
+      typename PB_DS_TYPES_TRAITS_C_DEC::const_key_reference
+      const_key_reference;
+
+      typedef typename PB_DS_TYPES_TRAITS_C_DEC::mapped_type mapped_type;
+
+      typedef
+      typename PB_DS_TYPES_TRAITS_C_DEC::mapped_pointer
+      mapped_pointer;
+
+      typedef
+      typename PB_DS_TYPES_TRAITS_C_DEC::const_mapped_pointer
+      const_mapped_pointer;
+
+      typedef
+      typename PB_DS_TYPES_TRAITS_C_DEC::mapped_reference
+      mapped_reference;
+
+      typedef
+      typename PB_DS_TYPES_TRAITS_C_DEC::const_mapped_reference
+      const_mapped_reference;
+
+      typedef typename PB_DS_TYPES_TRAITS_C_DEC::value_type value_type;
+
+      typedef typename PB_DS_TYPES_TRAITS_C_DEC::pointer pointer;
+
+      typedef typename PB_DS_TYPES_TRAITS_C_DEC::const_pointer const_pointer;
+
+      typedef typename PB_DS_TYPES_TRAITS_C_DEC::reference reference;
+
+      typedef
+      typename PB_DS_TYPES_TRAITS_C_DEC::const_reference
+      const_reference;
+
+      typedef
+      typename Node_And_It_Traits::const_iterator
+      const_point_iterator;
+
+      typedef typename Node_And_It_Traits::iterator point_iterator;
+
+      typedef const_point_iterator const_iterator;
+
+      typedef point_iterator iterator;
+
+      typedef
+      typename Node_And_It_Traits::const_reverse_iterator
+      const_reverse_iterator;
+
+      typedef typename Node_And_It_Traits::reverse_iterator reverse_iterator;
+
+      typedef
+      typename Node_And_It_Traits::const_node_iterator
+      const_node_iterator;
+
+      typedef typename Node_And_It_Traits::node_iterator node_iterator;
+
+      typedef typename Node_And_It_Traits::e_access_traits e_access_traits;
+
+      typedef typename Node_And_It_Traits::node_update node_update;
+
+      typedef Allocator allocator;
+
+    public:
+
+      PB_DS_CLASS_NAME();
+
+      PB_DS_CLASS_NAME(const e_access_traits& r_e_access_traits);
+
+      PB_DS_CLASS_NAME(const PB_DS_CLASS_C_DEC& other);
+
+      void
+      swap(PB_DS_CLASS_C_DEC& other);
+
+      ~PB_DS_CLASS_NAME();
+
+      inline bool
+      empty() const;
+
+      inline size_type
+      size() const;
+
+      inline size_type
+      max_size() const;
+
+      e_access_traits& 
+      get_e_access_traits();
+
+      const e_access_traits& 
+      get_e_access_traits() const;
+
+      node_update& 
+      get_node_update();
+
+      const node_update& 
+      get_node_update() const;
+
+      inline std::pair<
+	point_iterator,
+	bool>
+      insert(const_reference r_val);
+
+      inline mapped_reference
+      operator[](const_key_reference r_key)
+      {
+#ifdef PB_DS_DATA_TRUE_INDICATOR
+	return (insert(std::make_pair(
+				      r_key,
+				      mapped_type())).first->second);
+#else // #ifdef PB_DS_DATA_TRUE_INDICATOR
+	insert(r_key);
+
+	return (traits_base::s_null_mapped);
+#endif // #ifdef PB_DS_DATA_TRUE
+      }
+
+      inline point_iterator
+      find(const_key_reference r_key);
+
+      inline const_point_iterator
+      find(const_key_reference r_key) const;
+
+      inline point_iterator
+      lower_bound(const_key_reference r_key);
+
+      inline const_point_iterator
+      lower_bound(const_key_reference r_key) const;
+
+      inline point_iterator
+      upper_bound(const_key_reference r_key);
+
+      inline const_point_iterator
+      upper_bound(const_key_reference r_key) const;
+
+      void
+      clear();
+
+      inline bool
+      erase(const_key_reference r_key);
+
+      inline const_iterator
+      erase(const_iterator it);
+
+#ifdef PB_DS_DATA_TRUE_INDICATOR
+      inline iterator
+      erase(iterator it);
+#endif // #ifdef PB_DS_DATA_TRUE_INDICATOR
+
+      inline const_reverse_iterator
+      erase(const_reverse_iterator it);
+
+#ifdef PB_DS_DATA_TRUE_INDICATOR
+      inline reverse_iterator
+      erase(reverse_iterator it);
+#endif // #ifdef PB_DS_DATA_TRUE_INDICATOR
+
+      template<typename Pred>
+      inline size_type
+      erase_if(Pred pred);
+
+      void
+      join(PB_DS_CLASS_C_DEC& other);
+
+      void
+      split(const_key_reference r_key, PB_DS_CLASS_C_DEC& other);
+
+      inline iterator
+      begin();
+
+      inline const_iterator
+      begin() const;
+
+      inline iterator
+      end();
+
+      inline const_iterator
+      end() const;
+
+      inline reverse_iterator
+      rbegin();
+
+      inline const_reverse_iterator
+      rbegin() const;
+
+      inline reverse_iterator
+      rend();
+
+      inline const_reverse_iterator
+      rend() const;
+
+      inline const_node_iterator
+      node_begin() const;
+
+      inline node_iterator
+      node_begin();
+
+      inline const_node_iterator
+      node_end() const;
+
+      inline node_iterator
+      node_end();
+
+#ifdef PB_DS_PAT_TRIE_TRACE_
+
+      void
+      trace() const;
+
+#endif // #ifdef PB_DS_PAT_TRIE_TRACE_
+
+    protected:
+
+      template<typename It>
+      void
+      copy_from_range(It first_it, It last_it);
+
+      void
+      value_swap(PB_DS_CLASS_C_DEC& other);
+
+      node_pointer
+      recursive_copy_node(const_node_pointer p_other_nd);
+
+    private:
+
+      void
+      initialize();
+
+      inline void
+      apply_update(node_pointer p_nd, null_node_update_pointer);
+
+      template<typename Node_Update_>
+      inline void
+      apply_update(node_pointer p_nd, Node_Update_* p_update);
+
+      bool
+      join_prep(PB_DS_CLASS_C_DEC& other, split_join_branch_bag& r_bag);
+
+      void
+      rec_join_prep(const_node_pointer p_l, const_node_pointer p_r, split_join_branch_bag& r_bag);
+
+      void
+      rec_join_prep(const_leaf_pointer p_l, const_leaf_pointer p_r, split_join_branch_bag& r_bag);
+
+      void
+      rec_join_prep(const_leaf_pointer p_l, const_internal_node_pointer p_r, split_join_branch_bag& r_bag);
+
+      void
+      rec_join_prep(const_internal_node_pointer p_l, const_leaf_pointer p_r, split_join_branch_bag& r_bag);
+
+      void
+      rec_join_prep(const_internal_node_pointer p_l, const_internal_node_pointer p_r, split_join_branch_bag& r_bag);
+
+      node_pointer
+      rec_join(node_pointer p_l, node_pointer p_r, size_type checked_ind, split_join_branch_bag& r_bag);
+
+      node_pointer
+      rec_join(leaf_pointer p_l, leaf_pointer p_r, split_join_branch_bag& r_bag);
+
+      node_pointer
+      rec_join(leaf_pointer p_l, internal_node_pointer p_r, size_type checked_ind, split_join_branch_bag& r_bag);
+
+      node_pointer
+      rec_join(internal_node_pointer p_l, leaf_pointer p_r, size_type checked_ind, split_join_branch_bag& r_bag);
+
+      node_pointer
+      rec_join(internal_node_pointer p_l, internal_node_pointer p_r, split_join_branch_bag& r_bag);
+
+      size_type
+      keys_diff_ind(typename e_access_traits::const_iterator b_l, typename e_access_traits::const_iterator e_l, typename e_access_traits::const_iterator b_r, typename e_access_traits::const_iterator e_r);
+
+      internal_node_pointer
+      insert_branch(node_pointer p_left_nd, node_pointer p_right_nd, split_join_branch_bag& r_bag);
+
+      void
+      update_min_max_for_inserted_leaf(leaf_pointer p_l);
+
+      void
+      erase_leaf(leaf_pointer p_l);
+
+      inline void
+      actual_erase_leaf(leaf_pointer p_lf);
+
+      void
+      clear_imp(node_pointer p_nd);
+
+      void
+      erase_fixup(internal_node_pointer p_nd);
+
+      void
+      update_min_max_for_erased_leaf(leaf_pointer p_l);
+
+      static inline const_e_iterator
+      pref_begin(const_node_pointer p_nd);
+
+      static inline const_e_iterator
+      pref_end(const_node_pointer p_nd);
+
+      inline node_pointer
+      find_imp(const_key_reference r_key);
+
+      inline node_pointer
+      lower_bound_imp(const_key_reference r_key);
+
+      inline node_pointer
+      upper_bound_imp(const_key_reference r_key);
+
+      inline static const_leaf_pointer
+      leftmost_descendant(const_node_pointer p_nd);
+
+      inline static leaf_pointer
+      leftmost_descendant(node_pointer p_nd);
+
+      inline static const_leaf_pointer
+      rightmost_descendant(const_node_pointer p_nd);
+
+      inline static leaf_pointer
+      rightmost_descendant(node_pointer p_nd);
+
+#ifdef PB_DS_PAT_TRIE_DEBUG_
+
+      void
+      assert_valid() const;
+
+      void
+      assert_iterators() const;
+
+      void
+      assert_reverse_iterators() const;
+
+      static size_type
+      recursive_count_leafs(const_node_pointer p_nd);
+
+#endif // #ifdef PB_DS_PAT_TRIE_DEBUG_
+
+#ifdef PB_DS_PAT_TRIE_TRACE_
+
+      static void
+      trace_node(const_node_pointer p_nd, size_type level);
+
+      template<typename Metadata_>
+      static void
+      trace_node_metadata(const_node_pointer p_nd, type_to_type<Metadata_>);
+
+      static void
+      trace_node_metadata(const_node_pointer, type_to_type<null_node_metadata>);
+
+#endif // #ifdef PB_DS_PAT_TRIE_TRACE_
+
+      leaf_pointer
+      split_prep(const_key_reference r_key, PB_DS_CLASS_C_DEC& other, split_join_branch_bag& r_bag);
+
+      node_pointer
+      rec_split(node_pointer p_nd, const_e_iterator b_it, const_e_iterator e_it, PB_DS_CLASS_C_DEC& other, split_join_branch_bag& r_bag);
+
+      void
+      split_insert_branch(size_type e_ind, const_e_iterator b_it, typename internal_node::iterator child_b_it, size_type num_children, split_join_branch_bag& r_bag);
+
+    private:
+      static head_allocator s_head_allocator;
+
+      static internal_node_allocator s_internal_node_allocator;
+
+      static leaf_allocator s_leaf_allocator;
+
+      head_pointer m_p_head;
+
+      size_type m_size;
+    };
+
+#include <ext/pb_ds/detail/pat_trie_/constructors_destructor_fn_imps.hpp>
+#include <ext/pb_ds/detail/pat_trie_/iterators_fn_imps.hpp>
+#include <ext/pb_ds/detail/pat_trie_/insert_join_fn_imps.hpp>
+#include <ext/pb_ds/detail/pat_trie_/erase_fn_imps.hpp>
+#include <ext/pb_ds/detail/pat_trie_/find_fn_imps.hpp>
+#include <ext/pb_ds/detail/pat_trie_/info_fn_imps.hpp>
+#include <ext/pb_ds/detail/pat_trie_/policy_access_fn_imps.hpp>
+#include <ext/pb_ds/detail/pat_trie_/split_fn_imps.hpp>
+#include <ext/pb_ds/detail/pat_trie_/debug_fn_imps.hpp>
+#include <ext/pb_ds/detail/pat_trie_/trace_fn_imps.hpp>
+#include <ext/pb_ds/detail/pat_trie_/update_fn_imps.hpp>
+
+#undef PB_DS_CLASS_C_DEC
+
+#undef PB_DS_CLASS_T_DEC
+
+#undef PB_DS_CLASS_NAME
+
+#undef PB_DS_TYPES_TRAITS_C_DEC
+
+#undef PB_DS_MAP_DEBUG_BASE_C_DEC
+
+#undef PB_DS_V2F
+#undef PB_DS_EP2VP
+#undef PB_DS_V2S
+
+#undef PB_DS_DBG_ASSERT
+#undef PB_DS_DBG_VERIFY
+#undef PB_DS_DBG_ONLY
+
+#undef PB_DS_STATIC_ASSERT
+
+  } // namespace detail
+} // namespace pb_ds
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/point_iterators.hpp b/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/point_iterators.hpp
new file mode 100644
index 00000000000..2e159d76818
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/point_iterators.hpp
@@ -0,0 +1,574 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file point_iterators.hpp
+ * Contains an implementation class for bin_search_tree_.
+ */
+
+#ifndef PB_DS_PAT_TRIE_FIND_ITERATORS_HPP
+#define PB_DS_PAT_TRIE_FIND_ITERATORS_HPP
+
+#ifdef PB_DS_PAT_TRIE_DEBUG_
+#include <cassert>
+#endif // #ifdef PB_DS_PAT_TRIE_DEBUG_
+
+namespace pb_ds
+{
+  namespace detail
+  {
+
+#define PB_DS_CONST_IT_C_DEC					\
+    pat_trie_const_it_<						\
+					Type_Traits,		\
+					Node,			\
+					Leaf,			\
+					Head,			\
+					Internal_Node,		\
+					Is_Forward_Iterator,	\
+					Allocator>
+
+#define PB_DS_CONST_ODIR_IT_C_DEC				\
+    pat_trie_const_it_<						\
+					Type_Traits,		\
+					Node,			\
+					Leaf,			\
+					Head,			\
+					Internal_Node,		\
+					!Is_Forward_Iterator,	\
+					Allocator>
+
+#define PB_DS_IT_C_DEC							\
+    pat_trie_it_<							\
+						Type_Traits,		\
+						Node,			\
+						Leaf,			\
+						Head,			\
+						Internal_Node,		\
+						Is_Forward_Iterator,	\
+						Allocator>
+
+#define PB_DS_ODIR_IT_C_DEC						\
+    pat_trie_it_<							\
+						Type_Traits,		\
+						Node,			\
+						Leaf,			\
+						Head,			\
+						Internal_Node,		\
+						!Is_Forward_Iterator,	\
+						Allocator>
+
+#ifdef PB_DS_PAT_TRIE_DEBUG_
+#define PB_DS_DBG_ASSERT(X) assert(X)
+#define PB_DS_DBG_VERIFY(X) assert(X)
+#define PB_DS_DBG_ONLY(X) X
+#else // #ifdef PB_DS_PAT_TRIE_DEBUG_
+#define PB_DS_DBG_ASSERT(X)
+#define PB_DS_DBG_VERIFY(X) {if((X)==0);}
+#define PB_DS_DBG_ONLY(X) ;
+#endif // #ifdef PB_DS_PAT_TRIE_DEBUG_
+
+    // Const iterator.
+    template<typename Type_Traits,
+	     class Node,
+	     class Leaf,
+	     class Head,
+	     class Internal_Node,
+	     bool Is_Forward_Iterator,
+	     class Allocator>
+    class pat_trie_const_it_
+    {
+
+    private:
+      typedef
+      typename Allocator::template rebind<
+      Node>::other::pointer
+      node_pointer;
+
+      typedef
+      typename Allocator::template rebind<
+	Leaf>::other::const_pointer
+      const_leaf_pointer;
+
+      typedef
+      typename Allocator::template rebind<
+	Leaf>::other::pointer
+      leaf_pointer;
+
+      typedef
+      typename Allocator::template rebind<
+	Head>::other::pointer
+      head_pointer;
+
+      typedef
+      typename Allocator::template rebind<
+	Internal_Node>::other::pointer
+      internal_node_pointer;
+
+    public:
+
+      typedef std::bidirectional_iterator_tag iterator_category;
+
+      typedef typename Allocator::difference_type difference_type;
+
+      typedef typename Type_Traits::value_type value_type;
+
+      typedef typename Type_Traits::pointer pointer;
+
+      typedef typename Type_Traits::const_pointer const_pointer;
+
+      typedef typename Type_Traits::reference reference;
+
+      typedef typename Type_Traits::const_reference const_reference;
+
+    public:
+
+      inline
+      pat_trie_const_it_(node_pointer p_nd = NULL) : m_p_nd(p_nd)
+      { }
+
+      inline
+      pat_trie_const_it_(const PB_DS_CONST_ODIR_IT_C_DEC& 
+			 other) : m_p_nd(other.m_p_nd)
+      { }
+
+      inline
+      PB_DS_CONST_IT_C_DEC& 
+      operator=(const PB_DS_CONST_IT_C_DEC& 
+		other)
+      {
+	m_p_nd = other.m_p_nd;
+
+	return (*this);
+      }
+
+      inline
+      PB_DS_CONST_IT_C_DEC& 
+      operator=(const PB_DS_CONST_ODIR_IT_C_DEC& 
+		other)
+      {
+	m_p_nd = other.m_p_nd;
+
+	return (*this);
+      }
+
+      inline const_pointer
+      operator->() const
+      {
+	PB_DS_DBG_ASSERT(m_p_nd->m_type == pat_trie_leaf_node_type);
+
+	return (&static_cast<leaf_pointer>(m_p_nd)->value());
+      }
+
+      inline const_reference
+      operator*() const
+      {
+	PB_DS_DBG_ASSERT(m_p_nd->m_type == pat_trie_leaf_node_type);
+
+	return (static_cast<leaf_pointer>(m_p_nd)->value());
+      }
+
+      inline bool
+      operator==(const PB_DS_CONST_IT_C_DEC
+		 & other) const
+      {
+	return (m_p_nd == other.m_p_nd);
+      }
+
+      inline bool
+      operator==(const PB_DS_CONST_ODIR_IT_C_DEC
+		 & other) const
+      {
+	return (m_p_nd == other.m_p_nd);
+      }
+
+      inline bool
+      operator!=(const PB_DS_CONST_IT_C_DEC& 
+		 other) const
+      {
+	return (m_p_nd != other.m_p_nd);
+      }
+
+      inline bool
+      operator!=(const PB_DS_CONST_ODIR_IT_C_DEC& 
+		 other) const
+      {
+	return (m_p_nd != other.m_p_nd);
+      }
+
+      inline PB_DS_CONST_IT_C_DEC& 
+      operator++()
+      {
+	inc(integral_constant<int,Is_Forward_Iterator>());
+
+	return (*this);
+      }
+
+      inline PB_DS_CONST_IT_C_DEC
+      operator++(int)
+      {
+	PB_DS_CONST_IT_C_DEC
+	  ret_it(m_p_nd);
+
+	operator++();
+
+	return (ret_it);
+      }
+
+      inline PB_DS_CONST_IT_C_DEC& 
+      operator--()
+      {
+	dec(integral_constant<int,Is_Forward_Iterator>());
+
+	return (*this);
+      }
+
+      inline PB_DS_CONST_IT_C_DEC
+      operator--(int)
+      {
+	PB_DS_CONST_IT_C_DEC
+	  ret_it(m_p_nd);
+
+	operator--();
+
+	return (ret_it);
+      }
+
+    protected:
+      inline void
+      inc(false_type)
+      {
+	dec(true_type());
+      }
+
+      void
+      inc(true_type)
+      {
+	if (m_p_nd->m_type == pat_trie_head_node_type)
+	  {
+	    m_p_nd = static_cast<head_pointer>(m_p_nd)->m_p_min;
+
+	    return;
+	  }
+
+	node_pointer p_y = m_p_nd->m_p_parent;
+
+	while (p_y->m_type != pat_trie_head_node_type&& 
+	       get_larger_sibling(m_p_nd) == NULL)
+	  {
+	    m_p_nd = p_y;
+
+	    p_y = p_y->m_p_parent;
+	  }
+
+	if (p_y->m_type == pat_trie_head_node_type)
+	  {
+	    m_p_nd = p_y;
+
+	    return;
+	  }
+
+	m_p_nd = leftmost_descendant(get_larger_sibling(m_p_nd));
+      }
+
+      inline void
+      dec(false_type)
+      {
+	inc(true_type());
+      }
+
+      void
+      dec(true_type)
+      {
+	if (m_p_nd->m_type == pat_trie_head_node_type)
+	  {
+	    m_p_nd = static_cast<head_pointer>(m_p_nd)->m_p_max;
+
+	    return;
+	  }
+
+	node_pointer p_y = m_p_nd->m_p_parent;
+
+	while (p_y->m_type != pat_trie_head_node_type&& 
+	       get_smaller_sibling(m_p_nd) == NULL)
+	  {
+	    m_p_nd = p_y;
+
+	    p_y = p_y->m_p_parent;
+	  }
+
+	if (p_y->m_type == pat_trie_head_node_type)
+	  {
+	    m_p_nd = p_y;
+
+	    return;
+	  }
+
+	m_p_nd = rightmost_descendant(get_smaller_sibling(m_p_nd));
+      }
+
+      inline static node_pointer
+      get_larger_sibling(node_pointer p_nd)
+      {
+	internal_node_pointer p_parent =
+	  static_cast<internal_node_pointer>(p_nd->m_p_parent);
+
+	typename Internal_Node::iterator it = p_parent->begin();
+
+	while (*it != p_nd)
+	  ++it;
+
+	typename Internal_Node::iterator next_it = it;
+	++next_it;
+
+	return ((next_it == p_parent->end())? NULL :* next_it);
+      }
+
+      inline static node_pointer
+      get_smaller_sibling(node_pointer p_nd)
+      {
+	internal_node_pointer p_parent =
+	  static_cast<internal_node_pointer>(p_nd->m_p_parent);
+
+	typename Internal_Node::iterator it = p_parent->begin();
+
+	if (*it == p_nd)
+	  return (NULL);
+
+	typename Internal_Node::iterator prev_it;
+
+	do
+	  {
+	    prev_it = it;
+
+	    ++it;
+
+	    if (*it == p_nd)
+	      return (*prev_it);
+	  }
+	while (true);
+
+	PB_DS_DBG_ASSERT(false);
+
+	return (NULL);
+      }
+
+      inline static leaf_pointer
+      leftmost_descendant(node_pointer p_nd)
+      {
+	if (p_nd->m_type == pat_trie_leaf_node_type)
+	  return (static_cast<leaf_pointer>(p_nd));
+
+	return (static_cast<internal_node_pointer>(p_nd)->leftmost_descendant());
+      }
+
+      inline static leaf_pointer
+      rightmost_descendant(node_pointer p_nd)
+      {
+	if (p_nd->m_type == pat_trie_leaf_node_type)
+	  return (static_cast<leaf_pointer>(p_nd));
+
+	return (static_cast<internal_node_pointer>(p_nd)->rightmost_descendant());
+      }
+
+    public:
+      node_pointer m_p_nd;
+    };
+
+    // Iterator.
+    template<typename Type_Traits,
+	     class Node,
+	     class Leaf,
+	     class Head,
+	     class Internal_Node,
+	     bool Is_Forward_Iterator,
+	     class Allocator>
+    class pat_trie_it_ : 
+      public PB_DS_CONST_IT_C_DEC
+
+    {
+
+    private:
+      typedef
+      typename Allocator::template rebind<
+      Node>::other::pointer
+      node_pointer;
+
+      typedef
+      typename Allocator::template rebind<
+	Leaf>::other::const_pointer
+      const_leaf_pointer;
+
+      typedef
+      typename Allocator::template rebind<
+	Leaf>::other::pointer
+      leaf_pointer;
+
+      typedef
+      typename Allocator::template rebind<
+	Head>::other::pointer
+      head_pointer;
+
+      typedef
+      typename Allocator::template rebind<
+	Internal_Node>::other::pointer
+      internal_node_pointer;
+
+    public:
+      typedef typename Type_Traits::value_type value_type;
+
+      typedef typename Type_Traits::const_pointer const_pointer;
+
+      typedef typename Type_Traits::pointer pointer;
+
+      typedef typename Type_Traits::const_reference const_reference;
+
+      typedef typename Type_Traits::reference reference;
+
+    public:
+
+      inline
+      pat_trie_it_(node_pointer p_nd = NULL) : PB_DS_CONST_IT_C_DEC((node_pointer)p_nd)
+      { }
+
+      inline
+      pat_trie_it_(const PB_DS_ODIR_IT_C_DEC& other) : PB_DS_CONST_IT_C_DEC(other.m_p_nd)
+      { }
+
+      inline
+      PB_DS_IT_C_DEC& 
+      operator=(const PB_DS_IT_C_DEC& other)
+      {
+	base_it_type::m_p_nd = other.m_p_nd;
+
+	return (*this);
+      }
+
+      inline
+      PB_DS_IT_C_DEC& 
+      operator=(const PB_DS_ODIR_IT_C_DEC& other)
+      {
+	base_it_type::m_p_nd = other.m_p_nd;
+
+	return (*this);
+      }
+
+      inline pointer
+      operator->() const
+      {
+	PB_DS_DBG_ASSERT(base_it_type::m_p_nd->m_type ==
+			 pat_trie_leaf_node_type);
+
+	return (&static_cast<leaf_pointer>(base_it_type::m_p_nd)->value());
+      }
+
+      inline reference
+      operator*() const
+      {
+	PB_DS_DBG_ASSERT(base_it_type::m_p_nd->m_type ==
+			 pat_trie_leaf_node_type);
+
+	return (static_cast<leaf_pointer>(base_it_type::m_p_nd)->value());
+      }
+
+      inline PB_DS_IT_C_DEC& 
+      operator++()
+      {
+	PB_DS_CONST_IT_C_DEC::
+	  operator++();
+
+	return (*this);
+      }
+
+      inline PB_DS_IT_C_DEC
+      operator++(int)
+      {
+	PB_DS_IT_C_DEC
+	  ret_it(base_it_type::m_p_nd);
+
+	operator++();
+
+	return (ret_it);
+      }
+
+      inline PB_DS_IT_C_DEC& 
+      operator--()
+      {
+	PB_DS_CONST_IT_C_DEC::
+	  operator--();
+
+	return (*this);
+      }
+
+      inline PB_DS_IT_C_DEC
+      operator--(int)
+      {
+	PB_DS_IT_C_DEC
+	  ret_it(base_it_type::m_p_nd);
+
+	operator--();
+
+	return (ret_it);
+      }
+
+    protected:
+      typedef PB_DS_CONST_IT_C_DEC base_it_type;
+
+      friend class PB_DS_CLASS_C_DEC;
+    };
+
+#undef PB_DS_CONST_IT_C_DEC
+
+#undef PB_DS_CONST_ODIR_IT_C_DEC
+
+#undef PB_DS_IT_C_DEC
+
+#undef PB_DS_ODIR_IT_C_DEC
+
+#undef PB_DS_DBG_ASSERT
+#undef PB_DS_DBG_VERIFY
+#undef PB_DS_DBG_ONLY
+
+  } // namespace detail
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_PAT_TRIE_FIND_ITERATORS_HPP
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/policy_access_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/policy_access_fn_imps.hpp
new file mode 100644
index 00000000000..a054e279f26
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/policy_access_fn_imps.hpp
@@ -0,0 +1,77 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file policy_access_fn_imps.hpp
+ * Contains an implementation class for bin_search_tree_.
+ */
+
+PB_DS_CLASS_T_DEC
+typename PB_DS_CLASS_C_DEC::e_access_traits& 
+PB_DS_CLASS_C_DEC::
+get_e_access_traits()
+{
+  return (*this);
+}
+
+PB_DS_CLASS_T_DEC
+const typename PB_DS_CLASS_C_DEC::e_access_traits& 
+PB_DS_CLASS_C_DEC::
+get_e_access_traits() const
+{
+  return (*this);
+}
+
+PB_DS_CLASS_T_DEC
+typename PB_DS_CLASS_C_DEC::node_update& 
+PB_DS_CLASS_C_DEC::
+get_node_update()
+{
+  return (*this);
+}
+
+PB_DS_CLASS_T_DEC
+const typename PB_DS_CLASS_C_DEC::node_update& 
+PB_DS_CLASS_C_DEC::
+get_node_update() const
+{
+  return (*this);
+}
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/r_erase_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/r_erase_fn_imps.hpp
new file mode 100644
index 00000000000..91ce90a4eab
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/r_erase_fn_imps.hpp
@@ -0,0 +1,126 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file r_erase_fn_imps.hpp
+ * Contains an implementation class for bin_search_tree_.
+ */
+
+PB_DS_CLASS_T_DEC
+inline void
+PB_DS_CLASS_C_DEC::
+actual_erase_node(node_pointer p_z)
+{
+  PB_DS_DBG_ASSERT(m_size > 0);
+  --m_size;
+
+  PB_DS_DBG_ONLY(erase_existing(PB_DS_V2F(p_z->m_value)));
+
+  p_z->~node();
+
+  s_node_allocator.deallocate(p_z, 1);
+}
+
+PB_DS_CLASS_T_DEC
+inline void
+PB_DS_CLASS_C_DEC::
+update_min_max_for_erased_node(node_pointer p_z)
+{
+  if (m_size == 1)
+    {
+      m_p_head->m_p_left = m_p_head->m_p_right = m_p_head;
+
+      return;
+    }
+
+  if (m_p_head->m_p_left == p_z)
+    {
+      iterator it(p_z);
+
+      ++it;
+
+      m_p_head->m_p_left = it.m_p_nd;
+    }
+  else if (m_p_head->m_p_right == p_z)
+    {
+      iterator it(p_z);
+
+      --it;
+
+      m_p_head->m_p_right = it.m_p_nd;
+    }
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+clear()
+{
+  PB_DS_DBG_ONLY(assert_valid(true, true);)
+
+    clear_imp(m_p_head->m_p_parent);
+
+  m_size = 0;
+
+  initialize();
+
+  PB_DS_DBG_ONLY(map_debug_base::clear();)
+
+    PB_DS_DBG_ONLY(assert_valid(true, true);)
+    }
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+clear_imp(node_pointer p_nd)
+{
+  if (p_nd == NULL)
+    return;
+
+  clear_imp(p_nd->m_p_left);
+
+  clear_imp(p_nd->m_p_right);
+
+  p_nd->~Node();
+
+  s_node_allocator.deallocate(p_nd, 1);
+}
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/rotate_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/rotate_fn_imps.hpp
new file mode 100644
index 00000000000..a88ba0fad8b
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/rotate_fn_imps.hpp
@@ -0,0 +1,165 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file rotate_fn_imps.hpp
+ * Contains imps for rotating nodes.
+ */
+
+PB_DS_CLASS_T_DEC
+inline void
+PB_DS_CLASS_C_DEC::
+rotate_left(node_pointer p_x)
+{
+  node_pointer p_y = p_x->m_p_right;
+
+  p_x->m_p_right = p_y->m_p_left;
+
+  if (p_y->m_p_left != NULL)
+    p_y->m_p_left->m_p_parent = p_x;
+
+  p_y->m_p_parent = p_x->m_p_parent;
+
+  if (p_x == m_p_head->m_p_parent)
+    m_p_head->m_p_parent = p_y;
+  else if (p_x == p_x->m_p_parent->m_p_left)
+    p_x->m_p_parent->m_p_left = p_y;
+  else
+    p_x->m_p_parent->m_p_right = p_y;
+
+  p_y->m_p_left = p_x;
+  p_x->m_p_parent = p_y;
+
+  PB_DS_DBG_ONLY(assert_node_consistent(p_x);)
+    PB_DS_DBG_ONLY(assert_node_consistent(p_y);)
+
+    apply_update(p_x, (Node_Update* )this);
+  apply_update(p_x->m_p_parent, (Node_Update* )this);
+}
+
+PB_DS_CLASS_T_DEC
+inline void
+PB_DS_CLASS_C_DEC::
+rotate_right(node_pointer p_x)
+{
+  node_pointer p_y = p_x->m_p_left;
+
+  p_x->m_p_left = p_y->m_p_right;
+
+  if (p_y->m_p_right != NULL)
+    p_y->m_p_right->m_p_parent = p_x;
+
+  p_y->m_p_parent = p_x->m_p_parent;
+
+  if (p_x == m_p_head->m_p_parent)
+    m_p_head->m_p_parent = p_y;
+  else if (p_x == p_x->m_p_parent->m_p_right)
+    p_x->m_p_parent->m_p_right = p_y;
+  else
+    p_x->m_p_parent->m_p_left = p_y;
+
+  p_y->m_p_right = p_x;
+  p_x->m_p_parent = p_y;
+
+  PB_DS_DBG_ONLY(assert_node_consistent(p_x);)
+    PB_DS_DBG_ONLY(assert_node_consistent(p_y);)
+
+    apply_update(p_x, (Node_Update* )this);
+  apply_update(p_x->m_p_parent, (Node_Update* )this);
+}
+
+PB_DS_CLASS_T_DEC
+inline void
+PB_DS_CLASS_C_DEC::
+rotate_parent(node_pointer p_nd)
+{
+  node_pointer p_parent = p_nd->m_p_parent;
+
+  if (p_nd == p_parent->m_p_left)
+    rotate_right(p_parent);
+  else
+    rotate_left(p_parent);
+
+  PB_DS_DBG_ASSERT(p_parent->m_p_parent = p_nd);
+  PB_DS_DBG_ASSERT(p_nd->m_p_left == p_parent ||
+		   p_nd->m_p_right == p_parent);
+}
+
+PB_DS_CLASS_T_DEC
+inline void
+PB_DS_CLASS_C_DEC::
+apply_update(node_pointer /*p_nd*/, pb_ds::null_node_update*  /*p_update*/)
+{ }
+
+PB_DS_CLASS_T_DEC
+template<typename Node_Update_>
+inline void
+PB_DS_CLASS_C_DEC::
+apply_update(node_pointer p_nd, Node_Update_* p_update)
+{
+  p_update->operator()(
+			& PB_DS_V2F(p_nd->m_value),(p_nd->m_p_left == NULL)?
+			NULL :
+			& PB_DS_V2F(p_nd->m_p_left->m_value),(p_nd->m_p_right == NULL)?
+			NULL :
+			& PB_DS_V2F(p_nd->m_p_right->m_value));
+}
+
+PB_DS_CLASS_T_DEC
+template<typename Node_Update_>
+inline void
+PB_DS_CLASS_C_DEC::
+update_to_top(node_pointer p_nd, Node_Update_* p_update)
+{
+  while (p_nd != m_p_head)
+    {
+      apply_update(p_nd, p_update);
+
+      p_nd = p_nd->m_p_parent;
+    }
+}
+
+PB_DS_CLASS_T_DEC
+inline void
+PB_DS_CLASS_C_DEC::
+update_to_top(node_pointer /*p_nd*/, pb_ds::null_node_update*  /*p_update*/)
+{ }
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/split_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/split_fn_imps.hpp
new file mode 100644
index 00000000000..12d27b3b174
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/split_fn_imps.hpp
@@ -0,0 +1,336 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file split_fn_imps.hpp
+ * Contains an implementation class for bin_search_tree_.
+ */
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+split(const_key_reference r_key, PB_DS_CLASS_C_DEC& other)
+{
+  PB_DS_DBG_ONLY(assert_valid(););
+  PB_DS_DBG_ONLY(other.assert_valid(););
+
+  split_join_branch_bag bag;
+
+  leaf_pointer p_split_lf = split_prep(r_key, other, bag);
+
+  if (p_split_lf == NULL)
+    {
+      PB_DS_DBG_ASSERT(bag.empty());
+
+      PB_DS_DBG_ONLY(assert_valid();)
+        PB_DS_DBG_ONLY(other.assert_valid();)
+
+        return;
+    }
+
+  PB_DS_DBG_ASSERT(!bag.empty());
+
+  other.clear();
+
+  m_p_head->m_p_parent = rec_split(
+				   m_p_head->m_p_parent,
+				   pref_begin(p_split_lf),
+				   pref_end(p_split_lf),
+				   other,
+				   bag);
+
+  m_p_head->m_p_parent->m_p_parent = m_p_head;
+
+  other.m_p_head->m_p_max = m_p_head->m_p_max;
+  m_p_head->m_p_max = rightmost_descendant(m_p_head->m_p_parent);
+  other.m_p_head->m_p_min =
+    other.leftmost_descendant(other.m_p_head->m_p_parent);
+
+  other.m_size = std::distance(
+			       other.PB_DS_CLASS_C_DEC::begin(),
+			       other.PB_DS_CLASS_C_DEC::end());
+  m_size -= other.m_size;
+
+  PB_DS_DBG_ONLY(assert_valid(););
+  PB_DS_DBG_ONLY(other.assert_valid(););
+}
+
+PB_DS_CLASS_T_DEC
+typename PB_DS_CLASS_C_DEC::leaf_pointer
+PB_DS_CLASS_C_DEC::
+split_prep(const_key_reference r_key, PB_DS_CLASS_C_DEC& other, split_join_branch_bag& r_bag)
+{
+  PB_DS_DBG_ASSERT(r_bag.empty());
+
+  if (m_size == 0)
+    {
+      other.clear();
+
+      PB_DS_DBG_ONLY(assert_valid(););
+      PB_DS_DBG_ONLY(other.assert_valid(););
+
+      return (NULL);
+    }
+
+  if (synth_e_access_traits::cmp_keys(
+				      r_key,
+				      PB_DS_V2F(static_cast<const_leaf_pointer>(m_p_head->m_p_min)->value())))
+    {
+      other.clear();
+
+      value_swap(other);
+
+      PB_DS_DBG_ONLY(assert_valid(););
+      PB_DS_DBG_ONLY(other.assert_valid(););
+
+      return (NULL);
+    }
+
+  if (!synth_e_access_traits::cmp_keys(
+				       r_key,
+				       PB_DS_V2F(static_cast<const_leaf_pointer>(m_p_head->m_p_max)->value())))
+    {
+      PB_DS_DBG_ONLY(assert_valid(););
+      PB_DS_DBG_ONLY(other.assert_valid(););
+
+      return (NULL);
+    }
+
+  iterator it = lower_bound(r_key);
+
+  if (!synth_e_access_traits::equal_keys(
+					 PB_DS_V2F(*it),
+					 r_key))
+    --it;
+
+  node_pointer p_nd = it.m_p_nd;
+
+  PB_DS_DBG_ASSERT(p_nd->m_type == pat_trie_leaf_node_type);
+
+  leaf_pointer p_ret_l = static_cast<leaf_pointer>(p_nd);
+
+  while (p_nd->m_type != pat_trie_head_node_type)
+    {
+      r_bag.add_branch();
+
+      p_nd = p_nd->m_p_parent;
+    }
+
+  PB_DS_DBG_ONLY(map_debug_base::split(
+				       r_key,(synth_e_access_traits& )(*this),
+				       other);)
+
+    return (p_ret_l);
+}
+
+PB_DS_CLASS_T_DEC
+typename PB_DS_CLASS_C_DEC::node_pointer
+PB_DS_CLASS_C_DEC::
+rec_split(node_pointer p_nd, const_e_iterator b_it, const_e_iterator e_it, PB_DS_CLASS_C_DEC& other, split_join_branch_bag& r_bag)
+{
+  if (p_nd->m_type == pat_trie_leaf_node_type)
+    {
+      PB_DS_DBG_ASSERT(other.m_p_head->m_p_parent == NULL);
+
+      return (p_nd);
+    }
+
+  PB_DS_DBG_ASSERT(p_nd->m_type == pat_trie_internal_node_type);
+
+  internal_node_pointer p_internal_nd =
+    static_cast<internal_node_pointer>(p_nd);
+
+  node_pointer p_child_ret = rec_split(
+				       p_internal_nd->get_child_node(b_it, e_it, this),
+				       b_it,
+				       e_it,
+				       other,
+				       r_bag);
+
+  PB_DS_DBG_ONLY(p_child_ret->assert_valid(this);)
+
+    p_internal_nd->replace_child(        p_child_ret, b_it, e_it, this);
+
+  apply_update(p_internal_nd, (node_update* )this);
+
+  typename internal_node::iterator child_it    =
+    p_internal_nd->get_child_it(b_it, e_it, this);
+
+  const size_type lhs_num_children =
+    std::distance(p_internal_nd->begin(), child_it) + 1;
+
+  PB_DS_DBG_ASSERT(lhs_num_children > 0);
+
+  size_type rhs_num_children =
+    std::distance(p_internal_nd->begin(), p_internal_nd->end()) -
+    lhs_num_children;
+
+  if (rhs_num_children == 0)
+    {
+      apply_update(p_internal_nd, (node_update* )this);
+
+      return (p_internal_nd);
+    }
+
+  ++child_it;
+
+  other.split_insert_branch(p_internal_nd->get_e_ind(),
+			    b_it,
+			    child_it,
+			    rhs_num_children,
+			    r_bag);
+
+  child_it    =
+    p_internal_nd->get_child_it(b_it, e_it, this);
+
+  ++child_it;
+
+  while (rhs_num_children != 0)
+    {
+      child_it = p_internal_nd->remove_child(child_it);
+
+      --rhs_num_children;
+    }
+
+  apply_update(p_internal_nd, (node_update* )this);
+
+  PB_DS_DBG_ASSERT(std::distance(
+				 p_internal_nd->begin(),
+				 p_internal_nd->end()) >= 1);
+
+  if (std::distance(p_internal_nd->begin(), p_internal_nd->end()) > 1)
+    {
+      p_internal_nd->update_prefixes(this);
+
+      PB_DS_DBG_ONLY(p_internal_nd->assert_valid(this);)
+
+        apply_update(p_internal_nd, (node_update* )this);
+
+      return (p_internal_nd);
+    }
+
+  node_pointer p_ret =* p_internal_nd->begin();
+
+  p_internal_nd->~internal_node();
+
+  s_internal_node_allocator.deallocate(p_internal_nd, 1);
+
+  apply_update(p_ret, (node_update* )this);
+
+  return (p_ret);
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+split_insert_branch(size_type e_ind, const_e_iterator b_it, typename internal_node::iterator child_b_it, size_type num_children, split_join_branch_bag& r_bag)
+{
+#ifdef PB_DS_PAT_TRIE_DEBUG_
+  if (m_p_head->m_p_parent != NULL)
+    m_p_head->m_p_parent->assert_valid(this);
+#endif // #ifdef PB_DS_PAT_TRIE_DEBUG_
+
+  const size_type total_num_children =((m_p_head->m_p_parent == NULL)? 0 : 1) + num_children;
+
+  if (total_num_children == 0)
+    {
+      PB_DS_DBG_ASSERT(m_p_head->m_p_parent == NULL);
+
+      return;
+    }
+
+  if (total_num_children == 1)
+    {
+      if (m_p_head->m_p_parent != NULL)
+        {
+	  PB_DS_DBG_ONLY(m_p_head->m_p_parent->assert_valid(this);)
+
+            return;
+        }
+
+      PB_DS_DBG_ASSERT(m_p_head->m_p_parent == NULL);
+      m_p_head->m_p_parent =* child_b_it;
+
+      m_p_head->m_p_parent->m_p_parent = m_p_head;
+
+      apply_update(m_p_head->m_p_parent, (node_update* )this);
+
+      PB_DS_DBG_ONLY(m_p_head->m_p_parent->assert_valid(this);)
+
+        return;
+    }
+
+  PB_DS_DBG_ASSERT(total_num_children > 1);
+
+  internal_node_pointer p_new_root = r_bag.get_branch();
+
+  new (p_new_root) internal_node(e_ind, b_it);
+
+  size_type num_inserted = 0;
+
+  while (num_inserted++ < num_children)
+    {
+      PB_DS_DBG_ONLY((*child_b_it)->assert_valid(this);)
+
+        p_new_root->add_child(
+			      * child_b_it,
+			      pref_begin(*child_b_it),
+			      pref_end(*child_b_it),
+			      this);
+
+      ++child_b_it;
+    }
+
+  if (m_p_head->m_p_parent != NULL)
+    p_new_root->add_child(
+			  m_p_head->m_p_parent,
+			  pref_begin(m_p_head->m_p_parent),
+			  pref_end(m_p_head->m_p_parent),
+			  this);
+
+  m_p_head->m_p_parent = p_new_root;
+
+  p_new_root->m_p_parent = m_p_head;
+
+  apply_update(m_p_head->m_p_parent, (node_update* )this);
+
+  PB_DS_DBG_ONLY(m_p_head->m_p_parent->assert_valid(this);)
+    }
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/split_join_branch_bag.hpp b/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/split_join_branch_bag.hpp
new file mode 100644
index 00000000000..3448de10e8f
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/split_join_branch_bag.hpp
@@ -0,0 +1,108 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file split_join_branch_bag.hpp
+ * Contains an implementation class for pat_trie_.
+ */
+
+class split_join_branch_bag
+{
+private:
+  typedef
+  std::list<
+  internal_node_pointer,
+  typename Allocator::template rebind<
+  internal_node_pointer>::other>
+  bag_t;
+
+public:
+
+  void
+  add_branch()
+  {
+    internal_node_pointer p_nd = s_internal_node_allocator.allocate(1);
+
+    try
+      {
+	m_bag.push_back(p_nd);
+      }
+    catch(...)
+      {
+	s_internal_node_allocator.deallocate(p_nd, 1);
+
+	throw;
+      }
+  }
+
+  internal_node_pointer
+  get_branch()
+  {
+    PB_DS_DBG_ASSERT(!m_bag.empty());
+
+    internal_node_pointer p_nd =* m_bag.begin();
+
+    m_bag.pop_front();
+
+    return (p_nd);
+  }
+
+  ~split_join_branch_bag()
+  {
+    while (!m_bag.empty())
+      {
+	internal_node_pointer p_nd =* m_bag.begin();
+
+	s_internal_node_allocator.deallocate(p_nd, 1);
+
+	m_bag.pop_front();
+      }
+  }
+
+  inline bool
+  empty() const
+  {
+    return (m_bag.empty());
+  }
+
+private:
+  bag_t m_bag;
+};
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/synth_e_access_traits.hpp b/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/synth_e_access_traits.hpp
new file mode 100644
index 00000000000..68f3473e6d4
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/synth_e_access_traits.hpp
@@ -0,0 +1,243 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file synth_e_access_traits.hpp
+ * Contains an implementation class for a patricia tree.
+ */
+
+#ifndef PB_DS_SYNTH_E_ACCESS_TRAITS_HPP
+#define PB_DS_SYNTH_E_ACCESS_TRAITS_HPP
+
+#include <ext/pb_ds/detail/type_utils.hpp>
+
+namespace pb_ds
+{
+  namespace detail
+  {
+
+#define PB_DS_SYNTH_E_ACCESS_TRAITS_T_DEC				\
+    template<typename Type_Traits, bool Set, class E_Access_Traits>
+
+#define PB_DS_SYNTH_E_ACCESS_TRAITS_C_DEC				\
+    synth_e_access_traits<						\
+						Type_Traits,		\
+						Set,			\
+						E_Access_Traits>
+
+    template<typename Type_Traits, bool Set, class E_Access_Traits>
+    struct synth_e_access_traits : public E_Access_Traits
+    {
+
+    private:
+      typedef E_Access_Traits base_type;
+
+      typedef Type_Traits type_traits;
+
+      typedef typename type_traits::const_key_reference const_key_reference;
+
+      typedef typename type_traits::const_reference const_reference;
+
+    public:
+      synth_e_access_traits();
+
+      synth_e_access_traits(const E_Access_Traits& r_traits);
+
+      inline bool
+      equal_prefixes(typename base_type::const_iterator b_l, typename base_type::const_iterator e_l, typename base_type::const_iterator b_r, typename base_type::const_iterator e_r, bool compare_after = true) const;
+
+      bool
+      equal_keys(const_key_reference r_lhs_key, const_key_reference r_rhs_key) const;
+
+      bool
+      cmp_prefixes(typename base_type::const_iterator b_l, typename base_type::const_iterator e_l, typename base_type::const_iterator b_r, typename base_type::const_iterator e_r, bool compare_after = false) const;
+
+      bool
+      cmp_keys(const_key_reference r_lhs_key, const_key_reference r_rhs_key) const;
+
+      inline static const_key_reference
+      extract_key(const_reference r_val);
+
+#ifdef PB_DS_PAT_TRIE_DEBUG_
+      bool
+      operator()(const_key_reference r_lhs, const_key_reference r_rhs);
+#endif // #ifdef PB_DS_PAT_TRIE_DEBUG_
+
+    private:
+      inline static const_key_reference
+      extract_key(const_reference r_val, true_type);
+
+      inline static const_key_reference
+      extract_key(const_reference r_val, false_type);
+
+    private:
+      static integral_constant<int,Set> s_set_ind;
+    };
+
+    PB_DS_SYNTH_E_ACCESS_TRAITS_T_DEC
+    integral_constant<int,Set>
+    PB_DS_SYNTH_E_ACCESS_TRAITS_C_DEC::s_set_ind;
+
+    PB_DS_SYNTH_E_ACCESS_TRAITS_T_DEC
+    PB_DS_SYNTH_E_ACCESS_TRAITS_C_DEC::
+    synth_e_access_traits()
+    { }
+
+    PB_DS_SYNTH_E_ACCESS_TRAITS_T_DEC
+    PB_DS_SYNTH_E_ACCESS_TRAITS_C_DEC::
+    synth_e_access_traits(const E_Access_Traits& r_traits) :
+      E_Access_Traits(r_traits)
+    { }
+
+    PB_DS_SYNTH_E_ACCESS_TRAITS_T_DEC
+    inline bool
+    PB_DS_SYNTH_E_ACCESS_TRAITS_C_DEC::
+    equal_prefixes(typename base_type::const_iterator b_l, typename base_type::const_iterator e_l, typename base_type::const_iterator b_r, typename base_type::const_iterator e_r, bool compare_after /*= false */) const
+    {
+      while (b_l != e_l)
+	{
+	  if (b_r == e_r)
+	    return (false);
+
+	  if (base_type::e_pos(*b_l) != base_type::e_pos(*b_r))
+	    return (false);
+
+	  ++b_l;
+	  ++b_r;
+	}
+
+      return (!compare_after || b_r == e_r);
+    }
+
+    PB_DS_SYNTH_E_ACCESS_TRAITS_T_DEC
+    bool
+    PB_DS_SYNTH_E_ACCESS_TRAITS_C_DEC::
+    equal_keys(const_key_reference r_lhs_key, const_key_reference r_rhs_key) const
+    {
+      return (equal_prefixes(base_type::begin(r_lhs_key),
+			     base_type::end(r_lhs_key),
+			     base_type::begin(r_rhs_key),
+			     base_type::end(r_rhs_key),
+			     true));
+    }
+
+    PB_DS_SYNTH_E_ACCESS_TRAITS_T_DEC
+    bool
+    PB_DS_SYNTH_E_ACCESS_TRAITS_C_DEC::
+    cmp_prefixes(typename base_type::const_iterator b_l, typename base_type::const_iterator e_l, typename base_type::const_iterator b_r, typename base_type::const_iterator e_r, bool compare_after /* = false*/) const
+    {
+      while (b_l != e_l)
+	{
+	  if (b_r == e_r)
+	    return (false);
+
+	  const typename base_type::size_type l_pos =
+	    base_type::e_pos(*b_l);
+	  const typename base_type::size_type r_pos =
+	    base_type::e_pos(*b_r);
+
+	  if (l_pos != r_pos)
+	    return (l_pos < r_pos);
+
+	  ++b_l;
+	  ++b_r;
+	}
+
+      if (!compare_after)
+	return (false);
+
+      return (b_r != e_r);
+    }
+
+    PB_DS_SYNTH_E_ACCESS_TRAITS_T_DEC
+    bool
+    PB_DS_SYNTH_E_ACCESS_TRAITS_C_DEC::
+    cmp_keys(const_key_reference r_lhs_key, const_key_reference r_rhs_key) const
+    {
+      return (cmp_prefixes(base_type::begin(r_lhs_key),
+			   base_type::end(r_lhs_key),
+			   base_type::begin(r_rhs_key),
+			   base_type::end(r_rhs_key),
+			   true));
+    }
+
+    PB_DS_SYNTH_E_ACCESS_TRAITS_T_DEC
+    inline typename PB_DS_SYNTH_E_ACCESS_TRAITS_C_DEC::const_key_reference
+    PB_DS_SYNTH_E_ACCESS_TRAITS_C_DEC::
+    extract_key(const_reference r_val)
+    {
+      return (extract_key(r_val, s_set_ind));
+    }
+
+    PB_DS_SYNTH_E_ACCESS_TRAITS_T_DEC
+    inline typename PB_DS_SYNTH_E_ACCESS_TRAITS_C_DEC::const_key_reference
+    PB_DS_SYNTH_E_ACCESS_TRAITS_C_DEC::
+    extract_key(const_reference r_val, true_type)
+    {
+      return (r_val);
+    }
+
+    PB_DS_SYNTH_E_ACCESS_TRAITS_T_DEC
+    inline typename PB_DS_SYNTH_E_ACCESS_TRAITS_C_DEC::const_key_reference
+    PB_DS_SYNTH_E_ACCESS_TRAITS_C_DEC::
+    extract_key(const_reference r_val, false_type)
+    {
+      return (r_val.first);
+    }
+
+#ifdef PB_DS_PAT_TRIE_DEBUG_
+    PB_DS_SYNTH_E_ACCESS_TRAITS_T_DEC
+    bool
+    PB_DS_SYNTH_E_ACCESS_TRAITS_C_DEC::
+    operator()(const_key_reference r_lhs, const_key_reference r_rhs)
+    {
+      return (cmp_keys(r_lhs, r_rhs));
+    }
+#endif // #ifdef PB_DS_PAT_TRIE_DEBUG_
+
+#undef PB_DS_SYNTH_E_ACCESS_TRAITS_T_DEC
+
+#undef PB_DS_SYNTH_E_ACCESS_TRAITS_C_DEC
+
+  } // namespace detail
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_SYNTH_E_ACCESS_TRAITS_HPP
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/trace_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/trace_fn_imps.hpp
new file mode 100644
index 00000000000..7623a88253f
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/trace_fn_imps.hpp
@@ -0,0 +1,134 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file trace_fn_imps.hpp
+ * Contains an implementation class for pat_trie_.
+ */
+
+#ifdef PB_DS_PAT_TRIE_TRACE_
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+trace() const
+{
+  std::cerr << std::endl;
+
+  if (m_p_head->m_p_parent == NULL)
+    return;
+
+  trace_node(m_p_head->m_p_parent, 0);
+
+  std::cerr << std::endl;
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+trace_node(const_node_pointer p_nd, size_type level)
+{
+  for (size_type i = 0; i < level; ++i)
+    std::cerr << ' ';
+
+  std::cerr << p_nd << " ";
+
+  std::cerr << ((p_nd->m_type == pat_trie_leaf_node_type)?
+		"l " :
+		"i ");
+
+  trace_node_metadata(p_nd, type_to_type<typename node::metadata_type>());
+
+  typename e_access_traits::const_iterator el_it =
+    pref_begin(p_nd);
+
+  while (el_it != pref_end(p_nd))
+    {
+      std::cerr <<* el_it;
+
+      ++el_it;
+    }
+
+  if (p_nd->m_type == pat_trie_leaf_node_type)
+    {
+      std::cerr << std::endl;
+
+      return;
+    }
+
+  const_internal_node_pointer p_internal =
+    static_cast<const_internal_node_pointer>(p_nd);
+
+  std::cerr << " " <<
+    static_cast<unsigned long>(p_internal->get_e_ind()) << std::endl;
+
+  const size_type num_children = std::distance(
+					       p_internal->begin(),
+					       p_internal->end());
+
+  for (size_type child_i = 0; child_i < num_children; ++child_i)
+    {
+      typename internal_node::const_iterator child_it =
+	p_internal->begin();
+      std::advance(child_it, num_children - child_i - 1);
+
+      trace_node(*child_it, level + 1);
+    }
+}
+
+PB_DS_CLASS_T_DEC
+template<typename Metadata_>
+void
+PB_DS_CLASS_C_DEC::
+trace_node_metadata(const_node_pointer p_nd, type_to_type<Metadata_>)
+{
+  std::cerr << "(" <<
+    static_cast<unsigned long>(p_nd->get_metadata()) << ") ";
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+trace_node_metadata(const_node_pointer, type_to_type<null_node_metadata>)
+{ }
+
+#endif // #ifdef PB_DS_PAT_TRIE_TRACE_
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/traits.hpp b/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/traits.hpp
new file mode 100644
index 00000000000..b10380937bc
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/traits.hpp
@@ -0,0 +1,356 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file traits.hpp
+ * Contains an implementation class for pat_trie_.
+ */
+
+#ifndef PB_DS_PAT_TRIE_NODE_AND_IT_TRAITS_HPP
+#define PB_DS_PAT_TRIE_NODE_AND_IT_TRAITS_HPP
+
+#include <ext/pb_ds/detail/pat_trie_/node_base.hpp>
+#include <ext/pb_ds/detail/pat_trie_/head.hpp>
+#include <ext/pb_ds/detail/pat_trie_/leaf.hpp>
+#include <ext/pb_ds/detail/pat_trie_/internal_node.hpp>
+#include <ext/pb_ds/detail/pat_trie_/point_iterators.hpp>
+#include <ext/pb_ds/detail/pat_trie_/node_iterators.hpp>
+#include <ext/pb_ds/detail/pat_trie_/synth_e_access_traits.hpp>
+
+namespace pb_ds
+{
+  namespace detail
+  {
+
+    template<typename Key,
+	     typename Mapped,
+	     class E_Access_Traits,
+	     template<typename Const_Node_Iterator,
+		      class Node_Iterator,
+		      class Cmp_Fn_,
+		      class Allocator_>
+    class Node_Update,
+	     class Allocator>
+    struct trie_traits<
+      Key,
+      Mapped,
+      E_Access_Traits,
+      Node_Update,
+      pat_trie_tag,
+      Allocator>
+    {
+    private:
+      typedef types_traits< Key, Mapped, Allocator, false> type_traits;
+
+    public:
+      typedef
+      typename trie_node_metadata_selector<
+      Key,
+      Mapped,
+      E_Access_Traits,
+      Node_Update,
+      Allocator>::type
+      metadata_type;
+
+      typedef E_Access_Traits e_access_traits;
+
+      typedef
+      synth_e_access_traits<
+	type_traits,
+	false,
+	e_access_traits>
+      synth_e_access_traits;
+
+      typedef
+      pat_trie_node_base<
+	type_traits,
+	synth_e_access_traits,
+	metadata_type,
+	Allocator>
+      node;
+
+      typedef
+      pat_trie_leaf<
+	type_traits,
+	synth_e_access_traits,
+	metadata_type,
+	Allocator>
+      leaf;
+
+      typedef
+      pat_trie_head<
+	type_traits,
+	synth_e_access_traits,
+	metadata_type,
+	Allocator>
+      head;
+
+      typedef
+      pat_trie_internal_node<
+	type_traits,
+	synth_e_access_traits,
+	metadata_type,
+	Allocator>
+      internal_node;
+
+      typedef
+      pat_trie_const_it_<
+	type_traits,
+	node,
+	leaf,
+	head,
+	internal_node,
+	true,
+	Allocator>
+      const_iterator;
+
+      typedef
+      pat_trie_it_<
+	type_traits,
+	node,
+	leaf,
+	head,
+	internal_node,
+	true,
+	Allocator>
+      iterator;
+
+      typedef
+      pat_trie_const_it_<
+	type_traits,
+	node,
+	leaf,
+	head,
+	internal_node,
+	false,
+	Allocator>
+      const_reverse_iterator;
+
+      typedef
+      pat_trie_it_<
+	type_traits,
+	node,
+	leaf,
+	head,
+	internal_node,
+	false,
+	Allocator>
+      reverse_iterator;
+
+      typedef
+      pat_trie_const_node_it_<
+	node,
+	leaf,
+	head,
+	internal_node,
+	const_iterator,
+	iterator,
+	synth_e_access_traits,
+	Allocator>
+      const_node_iterator;
+
+      typedef
+      pat_trie_node_it_<
+	node,
+	leaf,
+	head,
+	internal_node,
+	const_iterator,
+	iterator,
+	synth_e_access_traits,
+	Allocator>
+      node_iterator;
+
+      typedef
+      Node_Update<
+	const_node_iterator,
+	node_iterator,
+	E_Access_Traits,
+	Allocator>
+      node_update;
+
+      typedef
+      pb_ds::null_trie_node_update<
+	const_node_iterator,
+	node_iterator,
+	E_Access_Traits,
+	Allocator>* 
+      null_node_update_pointer;
+    };
+
+    template<typename Key,
+	     class E_Access_Traits,
+	     template<typename Const_Node_Iterator,
+		      class Node_Iterator,
+		      class Cmp_Fn_,
+		      class Allocator_>
+    class Node_Update,
+	     class Allocator>
+    struct trie_traits<
+      Key,
+      null_mapped_type,
+      E_Access_Traits,
+      Node_Update,
+      pat_trie_tag,
+      Allocator>
+    {
+    private:
+      typedef
+      types_traits<
+      Key,
+      null_mapped_type,
+      Allocator,
+      false>
+      type_traits;
+
+    public:
+      typedef
+      typename trie_node_metadata_selector<
+      Key,
+      null_mapped_type,
+      E_Access_Traits,
+      Node_Update,
+      Allocator>::type
+      metadata_type;
+
+      typedef E_Access_Traits e_access_traits;
+
+      typedef
+      synth_e_access_traits<
+	type_traits,
+	true,
+	e_access_traits>
+      synth_e_access_traits;
+
+      typedef
+      pat_trie_node_base<
+	type_traits,
+	synth_e_access_traits,
+	metadata_type,
+	Allocator>
+      node;
+
+      typedef
+      pat_trie_leaf<
+	type_traits,
+	synth_e_access_traits,
+	metadata_type,
+	Allocator>
+      leaf;
+
+      typedef
+      pat_trie_head<
+	type_traits,
+	synth_e_access_traits,
+	metadata_type,
+	Allocator>
+      head;
+
+      typedef
+      pat_trie_internal_node<
+	type_traits,
+	synth_e_access_traits,
+	metadata_type,
+	Allocator>
+      internal_node;
+
+      typedef
+      pat_trie_const_it_<
+	type_traits,
+	node,
+	leaf,
+	head,
+	internal_node,
+	true,
+	Allocator>
+      const_iterator;
+
+      typedef const_iterator iterator;
+
+      typedef
+      pat_trie_const_it_<
+	type_traits,
+	node,
+	leaf,
+	head,
+	internal_node,
+	false,
+	Allocator>
+      const_reverse_iterator;
+
+      typedef const_reverse_iterator reverse_iterator;
+
+      typedef
+      pat_trie_const_node_it_<
+	node,
+	leaf,
+	head,
+	internal_node,
+	const_iterator,
+	iterator,
+	synth_e_access_traits,
+	Allocator>
+      const_node_iterator;
+
+      typedef const_node_iterator node_iterator;
+
+      typedef
+      Node_Update<
+	const_node_iterator,
+	node_iterator,
+	E_Access_Traits,
+	Allocator>
+      node_update;
+
+      typedef
+      pb_ds::null_trie_node_update<
+	const_node_iterator,
+	const_node_iterator,
+	E_Access_Traits,
+	Allocator>* 
+      null_node_update_pointer;
+    };
+
+  } // namespace detail
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_PAT_TRIE_NODE_AND_IT_TRAITS_HPP
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/update_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/update_fn_imps.hpp
new file mode 100644
index 00000000000..d27acf91e9d
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/update_fn_imps.hpp
@@ -0,0 +1,62 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file update_fn_imps.hpp
+ * Contains an implementation class for pat_trie_.
+ */
+
+PB_DS_CLASS_T_DEC
+inline void
+PB_DS_CLASS_C_DEC::
+apply_update(node_pointer /*p_nd*/, null_node_update_pointer)
+{ }
+
+PB_DS_CLASS_T_DEC
+template<typename Node_Update_>
+inline void
+PB_DS_CLASS_C_DEC::
+apply_update(node_pointer p_nd, Node_Update_*  /*p_update*/)
+{
+  Node_Update_::operator()(
+			    node_iterator(p_nd, this),
+			    const_node_iterator(NULL, this));
+}
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/priority_queue_base_dispatch.hpp b/libstdc++-v3/include/ext/pb_ds/detail/priority_queue_base_dispatch.hpp
new file mode 100644
index 00000000000..67a705213d5
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/priority_queue_base_dispatch.hpp
@@ -0,0 +1,97 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file priority_queue_base_dispatch.hpp
+ * Contains an pqiative container dispatching base.
+ */
+
+#ifndef PB_DS_PRIORITY_QUEUE_BASE_DS_DISPATCHER_HPP
+#define PB_DS_PRIORITY_QUEUE_BASE_DS_DISPATCHER_HPP
+
+#include <ext/pb_ds/detail/pairing_heap_/pairing_heap_.hpp>
+#include <ext/pb_ds/detail/binomial_heap_/binomial_heap_.hpp>
+#include <ext/pb_ds/detail/rc_binomial_heap_/rc_binomial_heap_.hpp>
+#include <ext/pb_ds/detail/binary_heap_/binary_heap_.hpp>
+#include <ext/pb_ds/detail/thin_heap_/thin_heap_.hpp>
+
+namespace pb_ds
+{
+    namespace detail
+    {
+
+      template<typename Value_Type, typename Cmp_Fn, typename Tag, typename Allocator>
+      struct priority_queue_base_dispatch;
+
+      template<typename Value_Type, typename Cmp_Fn, typename Allocator>
+      struct priority_queue_base_dispatch<Value_Type, Cmp_Fn, pairing_heap_tag, Allocator>
+      {
+	typedef pairing_heap_< Value_Type, Cmp_Fn, Allocator> type;
+      };
+
+      template<typename Value_Type, typename Cmp_Fn, typename Allocator>
+      struct priority_queue_base_dispatch<Value_Type, Cmp_Fn, binomial_heap_tag, Allocator>
+      {
+	typedef binomial_heap_< Value_Type, Cmp_Fn, Allocator> type;
+      };
+
+      template<typename Value_Type, typename Cmp_Fn, typename Allocator>
+      struct priority_queue_base_dispatch<Value_Type, Cmp_Fn, rc_binomial_heap_tag, Allocator>
+      {
+	typedef rc_binomial_heap_< Value_Type, Cmp_Fn, Allocator> type;
+      };
+
+      template<typename Value_Type, typename Cmp_Fn, typename Allocator>
+      struct priority_queue_base_dispatch<Value_Type, Cmp_Fn, binary_heap_tag, Allocator>
+      {
+	typedef binary_heap_< Value_Type, Cmp_Fn, Allocator> type;
+      };
+
+      template<typename Value_Type, typename Cmp_Fn, typename Allocator>
+      struct priority_queue_base_dispatch<Value_Type, Cmp_Fn, thin_heap_tag, Allocator>
+      {
+	typedef thin_heap_< Value_Type, Cmp_Fn, Allocator> type;
+      };
+
+    } // namespace detail
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_PRIORITY_QUEUE_BASE_DS_DISPATCHER_HPP
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/rb_tree_map_/constructors_destructor_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/rb_tree_map_/constructors_destructor_fn_imps.hpp
new file mode 100644
index 00000000000..58290bfd160
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/rb_tree_map_/constructors_destructor_fn_imps.hpp
@@ -0,0 +1,114 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file constructors_destructor_fn_imps.hpp
+ * Contains an implementation for rb_tree_.
+ */
+
+PB_DS_CLASS_T_DEC
+template<typename It>
+void
+PB_DS_CLASS_C_DEC::
+copy_from_range(It first_it, It last_it)
+{
+  while (first_it != last_it)
+    insert(*(first_it++));
+}
+
+PB_DS_CLASS_T_DEC
+PB_DS_CLASS_C_DEC::
+PB_DS_CLASS_NAME()
+{
+  initialize();
+
+  PB_DS_DBG_ONLY(assert_valid();)
+    }
+
+PB_DS_CLASS_T_DEC
+PB_DS_CLASS_C_DEC::
+PB_DS_CLASS_NAME(const Cmp_Fn& r_cmp_fn) :
+  PB_DS_BASE_C_DEC(r_cmp_fn)
+{
+  initialize();
+
+  PB_DS_DBG_ONLY(assert_valid();)
+    }
+
+PB_DS_CLASS_T_DEC
+PB_DS_CLASS_C_DEC::
+PB_DS_CLASS_NAME(const Cmp_Fn& r_cmp_fn, const node_update& r_node_update) :
+  PB_DS_BASE_C_DEC(r_cmp_fn, r_node_update)
+{
+  initialize();
+
+  PB_DS_DBG_ONLY(assert_valid();)
+    }
+
+PB_DS_CLASS_T_DEC
+PB_DS_CLASS_C_DEC::
+PB_DS_CLASS_NAME(const PB_DS_CLASS_C_DEC& other) :
+  PB_DS_BASE_C_DEC(other)
+{
+  initialize();
+
+  PB_DS_DBG_ONLY(assert_valid();)
+    }
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+swap(PB_DS_CLASS_C_DEC& other)
+{
+  PB_DS_DBG_ONLY(assert_valid();)
+
+    PB_DS_BASE_C_DEC::swap(other);
+
+  PB_DS_DBG_ONLY(assert_valid();)
+    }
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+initialize()
+{
+  PB_DS_BASE_C_DEC::m_p_head->m_red = true;
+}
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/rb_tree_map_/debug_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/rb_tree_map_/debug_fn_imps.hpp
new file mode 100644
index 00000000000..13e93cae75a
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/rb_tree_map_/debug_fn_imps.hpp
@@ -0,0 +1,92 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file debug_fn_imps.hpp
+ * Contains an implementation for rb_tree_.
+ */
+
+#ifdef PB_DS_RB_TREE_DEBUG_
+
+PB_DS_CLASS_T_DEC
+typename PB_DS_CLASS_C_DEC::size_type
+PB_DS_CLASS_C_DEC::
+assert_node_consistent(const node_pointer p_nd) const
+{
+  if (p_nd == NULL)
+    return (1);
+
+  const size_type l_height = assert_node_consistent(p_nd->m_p_left);
+  const size_type r_height = assert_node_consistent(p_nd->m_p_right);
+
+  if (p_nd->m_red)
+    {
+      PB_DS_DBG_ASSERT(is_effectively_black(p_nd->m_p_left));
+
+      PB_DS_DBG_ASSERT(is_effectively_black(p_nd->m_p_right));
+    }
+
+  PB_DS_DBG_ASSERT(l_height == r_height);
+
+  return ((p_nd->m_red? 0 : 1) + l_height);
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+assert_valid() const
+{
+  PB_DS_BASE_C_DEC::assert_valid();
+
+  const node_pointer p_head = PB_DS_BASE_C_DEC::m_p_head;
+
+  PB_DS_DBG_ASSERT(p_head->m_red);
+
+  if (p_head->m_p_parent != NULL)
+    {
+      PB_DS_DBG_ASSERT(!p_head->m_p_parent->m_red);
+
+      assert_node_consistent(p_head->m_p_parent);
+    }
+}
+
+#endif // #ifdef PB_DS_RB_TREE_DEBUG_
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/rb_tree_map_/erase_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/rb_tree_map_/erase_fn_imps.hpp
new file mode 100644
index 00000000000..e3aadc5515d
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/rb_tree_map_/erase_fn_imps.hpp
@@ -0,0 +1,354 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file erase_fn_imps.hpp
+ * Contains an implementation for rb_tree_.
+ */
+
+PB_DS_CLASS_T_DEC
+inline bool
+PB_DS_CLASS_C_DEC::
+erase(const_key_reference r_key)
+{
+  point_iterator it = find(r_key);
+
+  if (it == PB_DS_BASE_C_DEC::end())
+    return (false);
+
+  erase(it);
+
+  return (true);
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::iterator
+PB_DS_CLASS_C_DEC::
+erase(iterator it)
+{
+  PB_DS_DBG_ONLY(assert_valid());
+
+  if (it == PB_DS_BASE_C_DEC::end())
+    return (it);
+
+  iterator ret_it = it;
+
+  ++ret_it;
+
+  erase_node(it.m_p_nd);
+
+  PB_DS_DBG_ONLY(assert_valid());
+
+  return (ret_it);
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::reverse_iterator
+PB_DS_CLASS_C_DEC::
+erase(reverse_iterator it)
+{
+  PB_DS_DBG_ONLY(assert_valid());
+
+  if (it.m_p_nd == PB_DS_BASE_C_DEC::m_p_head)
+    return (it);
+
+  reverse_iterator ret_it = it;
+
+  ++ret_it;
+
+  erase_node(it.m_p_nd);
+
+  PB_DS_DBG_ONLY(assert_valid());
+
+  return (ret_it);
+}
+
+PB_DS_CLASS_T_DEC
+template<typename Pred>
+inline typename PB_DS_CLASS_C_DEC::size_type
+PB_DS_CLASS_C_DEC::
+erase_if(Pred pred)
+{
+  PB_DS_DBG_ONLY(assert_valid();)
+
+    size_type num_ersd = 0;
+
+  iterator it = PB_DS_BASE_C_DEC::begin();
+
+  while (it != PB_DS_BASE_C_DEC::end())
+    {
+      if (pred(*it))
+        {
+	  ++num_ersd;
+
+	  it = erase(it);
+        }
+      else
+	++it;
+    }
+
+  PB_DS_DBG_ONLY(assert_valid();)
+
+    return (num_ersd);
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+erase_node(node_pointer p_nd)
+{
+  remove_node(p_nd);
+
+  PB_DS_BASE_C_DEC::actual_erase_node(p_nd);
+
+  PB_DS_DBG_ONLY(assert_valid());
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+remove_node(node_pointer p_z)
+{
+  update_min_max_for_erased_node(p_z);
+
+  node_pointer p_y = p_z;
+
+  node_pointer p_x = NULL;
+
+  node_pointer p_new_x_parent = NULL;
+
+  if (p_y->m_p_left == NULL)
+    p_x = p_y->m_p_right;
+  else if (p_y->m_p_right == NULL)
+    p_x = p_y->m_p_left;
+  else
+    {
+      p_y = p_y->m_p_right;
+
+      while (p_y->m_p_left != NULL)
+	p_y = p_y->m_p_left;
+
+      p_x = p_y->m_p_right;
+    }
+
+  if (p_y == p_z)
+    {
+      p_new_x_parent = p_y->m_p_parent;
+
+      if (p_x != NULL)
+	p_x->m_p_parent = p_y->m_p_parent;
+
+      if (PB_DS_BASE_C_DEC::m_p_head->m_p_parent == p_z)
+	PB_DS_BASE_C_DEC::m_p_head->m_p_parent = p_x;
+      else if (p_z->m_p_parent->m_p_left == p_z)
+        {
+	  p_y->m_p_left = p_z->m_p_parent;
+
+	  p_z->m_p_parent->m_p_left = p_x;
+        }
+      else
+        {
+	  p_y->m_p_left = NULL;
+
+	  p_z->m_p_parent->m_p_right = p_x;
+        }
+    }
+  else
+    {
+      p_z->m_p_left->m_p_parent = p_y;
+
+      p_y->m_p_left = p_z->m_p_left;
+
+      if (p_y != p_z->m_p_right)
+        {
+	  p_new_x_parent = p_y->m_p_parent;
+
+	  if (p_x != NULL)
+	    p_x->m_p_parent = p_y->m_p_parent;
+
+	  p_y->m_p_parent->m_p_left = p_x;
+
+	  p_y->m_p_right = p_z->m_p_right;
+
+	  p_z->m_p_right->m_p_parent = p_y;
+        }
+      else
+	p_new_x_parent = p_y;
+
+      if (PB_DS_BASE_C_DEC::m_p_head->m_p_parent == p_z)
+	PB_DS_BASE_C_DEC::m_p_head->m_p_parent = p_y;
+      else if (p_z->m_p_parent->m_p_left == p_z)
+	p_z->m_p_parent->m_p_left = p_y;
+      else
+	p_z->m_p_parent->m_p_right = p_y;
+
+      p_y->m_p_parent = p_z->m_p_parent;
+
+      std::swap(p_y->m_red, p_z->m_red);
+
+      p_y = p_z;
+    }
+
+  update_to_top(p_new_x_parent, (node_update* )this);
+
+  if (p_y->m_red)
+    return;
+
+  remove_fixup(p_x, p_new_x_parent);
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+remove_fixup(node_pointer p_x, node_pointer p_new_x_parent)
+{
+  PB_DS_DBG_ASSERT(p_x == NULL || p_x->m_p_parent == p_new_x_parent);
+
+  while (p_x != PB_DS_BASE_C_DEC::m_p_head->m_p_parent&& 
+	 is_effectively_black(p_x))
+    if (p_x == p_new_x_parent->m_p_left)
+      {
+	node_pointer p_w = p_new_x_parent->m_p_right;
+
+	if (p_w->m_red)
+	  {
+	    p_w->m_red = false;
+
+	    p_new_x_parent->m_red = true;
+
+	    PB_DS_BASE_C_DEC::rotate_left(p_new_x_parent);
+
+	    p_w = p_new_x_parent->m_p_right;
+	  }
+
+	if (is_effectively_black(p_w->m_p_left)&& 
+	    is_effectively_black(p_w->m_p_right))
+	  {
+	    p_w->m_red = true;
+
+	    p_x = p_new_x_parent;
+
+	    p_new_x_parent = p_new_x_parent->m_p_parent;
+	  }
+	else
+	  {
+	    if (is_effectively_black(p_w->m_p_right))
+	      {
+		if (p_w->m_p_left != NULL)
+		  p_w->m_p_left->m_red = false;
+
+		p_w->m_red = true;
+
+		PB_DS_BASE_C_DEC::rotate_right(p_w);
+
+		p_w = p_new_x_parent->m_p_right;
+	      }
+
+	    p_w->m_red = p_new_x_parent->m_red;
+
+	    p_new_x_parent->m_red = false;
+
+	    if (p_w->m_p_right != NULL)
+	      p_w->m_p_right->m_red = false;
+
+	    PB_DS_BASE_C_DEC::rotate_left(p_new_x_parent);
+
+	    update_to_top(p_new_x_parent, (node_update* )this);
+
+	    break;
+	  }
+      }
+    else
+      {
+	node_pointer p_w = p_new_x_parent->m_p_left;
+
+	if (p_w->m_red == true)
+	  {
+	    p_w->m_red = false;
+
+	    p_new_x_parent->m_red = true;
+
+	    PB_DS_BASE_C_DEC::rotate_right(p_new_x_parent);
+
+	    p_w = p_new_x_parent->m_p_left;
+	  }
+
+	if (is_effectively_black(p_w->m_p_right)&& 
+	    is_effectively_black(p_w->m_p_left))
+	  {
+	    p_w->m_red = true;
+
+	    p_x = p_new_x_parent;
+
+	    p_new_x_parent = p_new_x_parent->m_p_parent;
+	  }
+	else
+	  {
+	    if (is_effectively_black(p_w->m_p_left))
+	      {
+		if (p_w->m_p_right != NULL)
+		  p_w->m_p_right->m_red = false;
+
+		p_w->m_red = true;
+
+		PB_DS_BASE_C_DEC::rotate_left(p_w);
+
+		p_w = p_new_x_parent->m_p_left;
+	      }
+
+	    p_w->m_red = p_new_x_parent->m_red;
+
+	    p_new_x_parent->m_red = false;
+
+	    if (p_w->m_p_left != NULL)
+	      p_w->m_p_left->m_red = false;
+
+	    PB_DS_BASE_C_DEC::rotate_right(p_new_x_parent);
+
+	    update_to_top(p_new_x_parent, (node_update* )this);
+
+	    break;
+	  }
+      }
+
+  if (p_x != NULL)
+    p_x->m_red = false;
+}
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/rb_tree_map_/find_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/rb_tree_map_/find_fn_imps.hpp
new file mode 100644
index 00000000000..25938ae47a8
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/rb_tree_map_/find_fn_imps.hpp
@@ -0,0 +1,45 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file find_fn_imps.hpp
+ * Contains an implementation for rb_tree_.
+ */
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/rb_tree_map_/info_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/rb_tree_map_/info_fn_imps.hpp
new file mode 100644
index 00000000000..ca00830db90
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/rb_tree_map_/info_fn_imps.hpp
@@ -0,0 +1,54 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file info_fn_imps.hpp
+ * Contains an implementation for rb_tree_.
+ */
+
+PB_DS_CLASS_T_DEC
+inline bool
+PB_DS_CLASS_C_DEC::
+is_effectively_black(const node_pointer p_nd)
+{
+  return (p_nd == NULL || !p_nd->m_red);
+}
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/rb_tree_map_/insert_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/rb_tree_map_/insert_fn_imps.hpp
new file mode 100644
index 00000000000..891c43b6332
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/rb_tree_map_/insert_fn_imps.hpp
@@ -0,0 +1,148 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file insert_fn_imps.hpp
+ * Contains an implementation for rb_tree_.
+ */
+
+PB_DS_CLASS_T_DEC
+inline std::pair<typename PB_DS_CLASS_C_DEC::point_iterator, bool>
+PB_DS_CLASS_C_DEC::
+insert(const_reference r_value)
+{
+  PB_DS_DBG_ONLY(assert_valid();)
+
+    std::pair<point_iterator, bool> ins_pair =
+    PB_DS_BASE_C_DEC::insert_leaf(r_value);
+
+  if (ins_pair.second == true)
+    {
+      ins_pair.first.m_p_nd->m_red = true;
+
+      PB_DS_DBG_ONLY(this->structure_only_assert_valid();)
+
+        insert_fixup(ins_pair.first.m_p_nd);
+    }
+
+  PB_DS_DBG_ONLY(assert_valid();)
+
+    return (ins_pair);
+}
+
+PB_DS_CLASS_T_DEC
+inline void
+PB_DS_CLASS_C_DEC::
+insert_fixup(node_pointer p_nd)
+{
+  PB_DS_DBG_ASSERT(p_nd->m_red == true);
+
+  while (p_nd != PB_DS_BASE_C_DEC::m_p_head->m_p_parent&& 
+	 p_nd->m_p_parent->m_red)
+    {
+      if (p_nd->m_p_parent == p_nd->m_p_parent->m_p_parent->m_p_left)
+        {
+	  node_pointer p_y = p_nd->m_p_parent->m_p_parent->m_p_right;
+
+	  if (p_y != NULL&&  p_y->m_red)
+            {
+	      p_nd->m_p_parent->m_red = false;
+
+	      p_y->m_red = false;
+
+	      p_nd->m_p_parent->m_p_parent->m_red = true;
+
+	      p_nd = p_nd->m_p_parent->m_p_parent;
+            }
+	  else
+            {
+	      if (p_nd == p_nd->m_p_parent->m_p_right)
+                {
+		  p_nd = p_nd->m_p_parent;
+
+		  PB_DS_BASE_C_DEC::rotate_left(p_nd);
+                }
+
+	      p_nd->m_p_parent->m_red = false;
+
+	      p_nd->m_p_parent->m_p_parent->m_red = true;
+
+	      PB_DS_BASE_C_DEC::rotate_right(
+					     p_nd->m_p_parent->m_p_parent);
+            }
+        }
+      else
+        {
+	  node_pointer p_y = p_nd->m_p_parent->m_p_parent->m_p_left;
+
+	  if (p_y != NULL&&  p_y->m_red)
+            {
+	      p_nd->m_p_parent->m_red = false;
+
+	      p_y->m_red = false;
+
+	      p_nd->m_p_parent->m_p_parent->m_red = true;
+
+	      p_nd = p_nd->m_p_parent->m_p_parent;
+            }
+	  else
+            {
+	      if (p_nd == p_nd->m_p_parent->m_p_left)
+                {
+		  p_nd = p_nd->m_p_parent;
+
+		  PB_DS_BASE_C_DEC::rotate_right(p_nd);
+                }
+
+	      p_nd->m_p_parent->m_red = false;
+
+	      p_nd->m_p_parent->m_p_parent->m_red = true;
+
+	      PB_DS_BASE_C_DEC::rotate_left(
+					    p_nd->m_p_parent->m_p_parent);
+            }
+        }
+    }
+
+  PB_DS_BASE_C_DEC::update_to_top(p_nd, (node_update* )this);
+
+  PB_DS_BASE_C_DEC::m_p_head->m_p_parent->m_red = false;
+}
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/rb_tree_map_/node.hpp b/libstdc++-v3/include/ext/pb_ds/detail/rb_tree_map_/node.hpp
new file mode 100644
index 00000000000..179e80e6c3d
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/rb_tree_map_/node.hpp
@@ -0,0 +1,174 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file node.hpp
+ * Contains an implementation for rb_tree_.
+ */
+
+#ifndef PB_DS_RB_TREE_NODE_HPP
+#define PB_DS_RB_TREE_NODE_HPP
+
+#include <ext/pb_ds/detail/basic_tree_policy/null_node_metadata.hpp>
+
+namespace pb_ds
+{
+  namespace detail
+  {
+
+    template<typename Value_Type, class Metadata, class Allocator>
+    struct rb_tree_node_
+    {
+    public:
+      typedef
+      typename Allocator::template rebind<
+      rb_tree_node_<
+      Value_Type,
+      Metadata,
+      Allocator> >::other::pointer
+      node_pointer;
+
+      typedef Value_Type value_type;
+
+      typedef Metadata metadata_type;
+
+      typedef
+      typename Allocator::template rebind<
+	metadata_type>::other::reference
+      metadata_reference;
+
+      typedef
+      typename Allocator::template rebind<
+	metadata_type>::other::const_reference
+      const_metadata_reference;
+
+    public:
+      inline bool
+      special() const
+      {
+	return (m_red);
+      }
+
+      inline const_metadata_reference
+      get_metadata() const
+      {
+	return (m_metadata);
+      }
+
+      inline metadata_reference
+      get_metadata()
+      {
+	return (m_metadata);
+      }
+
+#ifdef PB_DS_BIN_SEARCH_TREE_TRACE_
+      void
+      trace() const
+      {
+	std::cout << PB_DS_V2F(m_value) <<(m_red? " <r> " : " <b> ") <<
+	  "(" << m_metadata << ")";
+
+      }
+#endif // #ifdef PB_DS_BIN_SEARCH_TREE_TRACE_
+
+    public:
+      node_pointer m_p_left;
+      node_pointer m_p_right;
+
+      node_pointer m_p_parent;
+
+      value_type m_value;
+
+      bool m_red;
+
+      metadata_type m_metadata;
+    };
+
+    template<typename Value_Type, class Allocator>
+    struct rb_tree_node_<
+      Value_Type,
+      null_node_metadata,
+      Allocator>
+    {
+    public:
+      typedef
+      typename Allocator::template rebind<
+      rb_tree_node_<
+      Value_Type,
+      null_node_metadata,
+      Allocator> >::other::pointer
+      node_pointer;
+
+      typedef Value_Type value_type;
+
+      typedef null_node_metadata metadata_type;
+
+    public:
+      inline bool
+      special() const
+      {
+	return (m_red);
+      }
+
+#ifdef PB_DS_BIN_SEARCH_TREE_TRACE_
+      void
+      trace() const
+      {
+	std::cout << PB_DS_V2F(m_value) <<(m_red? " <r> " : " <b> ");
+
+      }
+#endif // #ifdef PB_DS_BIN_SEARCH_TREE_TRACE_
+
+    public:
+      node_pointer m_p_left;
+      node_pointer m_p_right;
+
+      node_pointer m_p_parent;
+
+      value_type m_value;
+
+      bool m_red;
+    };
+
+  } // namespace detail
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_RB_TREE_NODE_HPP
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/rb_tree_map_/rb_tree_.hpp b/libstdc++-v3/include/ext/pb_ds/detail/rb_tree_map_/rb_tree_.hpp
new file mode 100644
index 00000000000..c4cc743cfa5
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/rb_tree_map_/rb_tree_.hpp
@@ -0,0 +1,372 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file rb_tree_.hpp
+ * Contains an implementation for rb_tree_.
+ */
+/*
+ * This implementation uses an idea from the SGI STL (using a "header" node
+ *    which is needed for efficient iteration).
+ */
+
+#ifdef PB_DS_DATA_TRUE_INDICATOR
+#ifndef PB_DS_BIN_SEARCH_TREE_HPP__DATA_TRUE_INDICATOR
+#define PB_DS_BIN_SEARCH_TREE_HPP__DATA_TRUE_INDICATOR
+#include <ext/pb_ds/detail/bin_search_tree_/bin_search_tree_.hpp>
+#endif // #ifndef PB_DS_BIN_SEARCH_TREE_HPP__DATA_TRUE_INDICATOR
+#endif // #ifdef PB_DS_DATA_TRUE_INDICATOR
+
+#ifdef PB_DS_DATA_FALSE_INDICATOR
+#ifndef PB_DS_BIN_SEARCH_TREE_HPP__DATA_FALSE_INDICATOR
+#define PB_DS_BIN_SEARCH_TREE_HPP__DATA_FALSE_INDICATOR
+#include <ext/pb_ds/detail/bin_search_tree_/bin_search_tree_.hpp>
+#endif // #ifndef PB_DS_BIN_SEARCH_TREE_HPP__DATA_FALSE_INDICATOR
+#endif // #ifdef PB_DS_DATA_FALSE_INDICATOR
+
+#include <ext/pb_ds/detail/standard_policies.hpp>
+#include <ext/pb_ds/detail/basic_types.hpp>
+#include <utility>
+#include <vector>
+#include <assert.h>
+
+namespace pb_ds
+{
+  namespace detail
+  {
+
+#ifdef PB_DS_RB_TREE_DEBUG_
+#define PB_DS_DBG_ASSERT(X) assert(X)
+#define PB_DS_DBG_VERIFY(X) assert(X)
+#define PB_DS_DBG_ONLY(X) X
+#else // #ifdef PB_DS_RB_TREE_DEBUG_
+#define PB_DS_DBG_ASSERT(X)
+#define PB_DS_DBG_VERIFY(X) {if((X)==0);}
+#define PB_DS_DBG_ONLY(X) ;
+#endif // #ifdef PB_DS_RB_TREE_DEBUG_
+
+#define PB_DS_CLASS_T_DEC						\
+    template<								\
+						typename Key,		\
+						typename Mapped,	\
+						class Cmp_Fn,		\
+						class Node_And_It_Traits, \
+						class Allocator>
+
+#ifdef PB_DS_DATA_TRUE_INDICATOR
+#define PB_DS_CLASS_NAME			\
+    rb_tree_data_
+#endif // #ifdef PB_DS_DATA_TRUE_INDICATOR
+
+#ifdef PB_DS_DATA_FALSE_INDICATOR
+#define PB_DS_CLASS_NAME			\
+    rb_tree_no_data_
+#endif // #ifdef PB_DS_DATA_FALSE_INDICATOR
+
+#ifdef PB_DS_DATA_TRUE_INDICATOR
+#define PB_DS_BASE_CLASS_NAME			\
+    bin_search_tree_data_
+#endif // #ifdef PB_DS_DATA_TRUE_INDICATOR
+
+#ifdef PB_DS_DATA_FALSE_INDICATOR
+#define PB_DS_BASE_CLASS_NAME			\
+    bin_search_tree_no_data_
+#endif // #ifdef PB_DS_DATA_FALSE_INDICATOR
+
+#define PB_DS_CLASS_C_DEC						\
+    PB_DS_CLASS_NAME<							\
+						Key,			\
+						Mapped,			\
+						Cmp_Fn,			\
+						Node_And_It_Traits,	\
+						Allocator>
+
+#define PB_DS_BASE_C_DEC						\
+    PB_DS_BASE_CLASS_NAME<						\
+							Key,		\
+							Mapped,		\
+							Cmp_Fn,		\
+							Node_And_It_Traits, \
+							Allocator>
+
+#ifdef PB_DS_DATA_TRUE_INDICATOR
+#define PB_DS_V2F(X) (X).first
+#define PB_DS_V2S(X) (X).second
+#define PB_DS_EP2VP(X)& ((X)->m_value)
+#endif // #ifdef PB_DS_DATA_TRUE_INDICATOR
+
+#ifdef PB_DS_DATA_FALSE_INDICATOR
+#define PB_DS_V2F(X) (X)
+#define PB_DS_V2S(X) Mapped_Data()
+#define PB_DS_EP2VP(X)& ((X)->m_value.first)
+#endif // #ifdef PB_DS_DATA_FALSE_INDICATOR
+
+    template<typename Key,
+	     typename Mapped,
+	     class Cmp_Fn,
+	     class Node_And_It_Traits,
+	     class Allocator>
+    class PB_DS_CLASS_NAME : public PB_DS_BASE_C_DEC
+    {
+
+    private:
+      typedef typename PB_DS_BASE_C_DEC::node_pointer node_pointer;
+
+    public:
+
+      typedef typename Allocator::size_type size_type;
+
+      typedef typename Allocator::difference_type difference_type;
+
+      typedef typename PB_DS_BASE_C_DEC::key_type key_type;
+
+      typedef typename PB_DS_BASE_C_DEC::key_pointer key_pointer;
+
+      typedef typename PB_DS_BASE_C_DEC::const_key_pointer const_key_pointer;
+
+      typedef typename PB_DS_BASE_C_DEC::key_reference key_reference;
+
+      typedef
+      typename PB_DS_BASE_C_DEC::const_key_reference
+      const_key_reference;
+
+      typedef typename PB_DS_BASE_C_DEC::mapped_type mapped_type;
+
+      typedef typename PB_DS_BASE_C_DEC::mapped_pointer mapped_pointer;
+
+      typedef
+      typename PB_DS_BASE_C_DEC::const_mapped_pointer
+      const_mapped_pointer;
+
+      typedef typename PB_DS_BASE_C_DEC::mapped_reference mapped_reference;
+
+      typedef
+      typename PB_DS_BASE_C_DEC::const_mapped_reference
+      const_mapped_reference;
+
+      typedef typename PB_DS_BASE_C_DEC::value_type value_type;
+
+      typedef typename PB_DS_BASE_C_DEC::pointer pointer;
+
+      typedef typename PB_DS_BASE_C_DEC::const_pointer const_pointer;
+
+      typedef typename PB_DS_BASE_C_DEC::reference reference;
+
+      typedef typename PB_DS_BASE_C_DEC::const_reference const_reference;
+
+      typedef typename PB_DS_BASE_C_DEC::point_iterator point_iterator;
+
+      typedef typename PB_DS_BASE_C_DEC::const_iterator const_point_iterator;
+
+      typedef typename PB_DS_BASE_C_DEC::iterator iterator;
+
+      typedef typename PB_DS_BASE_C_DEC::const_iterator const_iterator;
+
+      typedef typename PB_DS_BASE_C_DEC::reverse_iterator reverse_iterator;
+
+      typedef
+      typename PB_DS_BASE_C_DEC::const_reverse_iterator
+      const_reverse_iterator;
+
+      typedef Cmp_Fn cmp_fn;
+
+      typedef Allocator allocator;
+
+      typedef typename PB_DS_BASE_C_DEC::node_update node_update;
+
+    public:
+
+      PB_DS_CLASS_NAME();
+
+      PB_DS_CLASS_NAME(const Cmp_Fn& r_cmp_fn);
+
+      PB_DS_CLASS_NAME(const Cmp_Fn& r_cmp_fn, const node_update& r_node_update);
+
+      PB_DS_CLASS_NAME(const PB_DS_CLASS_C_DEC& other);
+
+      void
+      swap(PB_DS_CLASS_C_DEC& other);
+
+      template<typename It>
+      void
+      copy_from_range(It first_it, It last_it);
+
+      inline std::pair<
+	point_iterator,
+	bool>
+      insert(const_reference r_value);
+
+      inline mapped_reference
+      operator[](const_key_reference r_key)
+      {
+#ifdef PB_DS_DATA_TRUE_INDICATOR
+	PB_DS_DBG_ONLY(assert_valid();)
+
+	  std::pair<point_iterator, bool> ins_pair =
+	  PB_DS_BASE_C_DEC::insert_leaf(
+					value_type(
+						   r_key,
+						   mapped_type()));
+
+	if (ins_pair.second == true)
+	  {
+	    ins_pair.first.m_p_nd->m_red = true;
+
+	    PB_DS_DBG_ONLY(this->structure_only_assert_valid();)
+
+	      insert_fixup(ins_pair.first.m_p_nd);
+	  }
+
+	PB_DS_DBG_ONLY(assert_valid();)
+
+	  return (ins_pair.first.m_p_nd->m_value.second);
+#else // #ifdef PB_DS_DATA_TRUE_INDICATOR
+	insert(r_key);
+
+	return (PB_DS_BASE_C_DEC::s_null_mapped);
+#endif // #ifdef PB_DS_DATA_TRUE
+      }
+
+      inline bool
+      erase(const_key_reference r_key);
+
+      inline iterator
+      erase(iterator it);
+
+      inline reverse_iterator
+      erase(reverse_iterator it);
+
+      template<typename Pred>
+      inline size_type
+      erase_if(Pred pred);
+
+      void
+      join(PB_DS_CLASS_C_DEC& other);
+
+      void
+      split(const_key_reference r_key, PB_DS_CLASS_C_DEC& other);
+
+    protected:
+
+    private:
+
+#ifdef PB_DS_RB_TREE_DEBUG_
+
+      void
+      assert_valid() const;
+
+      size_type
+      assert_node_consistent(const node_pointer p_nd) const;
+
+#endif // #ifdef PB_DS_RB_TREE_DEBUG_
+
+      inline static bool
+      is_effectively_black(const node_pointer p_nd);
+
+      void
+      initialize();
+
+      void
+      insert_fixup(node_pointer p_nd);
+
+      void
+      erase_node(node_pointer p_nd);
+
+      void
+      remove_node(node_pointer p_nd);
+
+      void
+      remove_fixup(node_pointer p_x, node_pointer p_new_x_parent);
+
+      void
+      split_imp(node_pointer p_nd, PB_DS_CLASS_C_DEC& other);
+
+      inline node_pointer
+      split_min();
+
+      std::pair<node_pointer, node_pointer>
+      split_min_imp();
+
+      void
+      join_imp(node_pointer p_x, node_pointer p_r);
+
+      std::pair<node_pointer, node_pointer>
+      find_join_pos_right(node_pointer p_l, size_type h_l, size_type h_r);
+
+      std::pair<node_pointer, node_pointer>
+      find_join_pos_left(node_pointer p_r, size_type h_l, size_type h_r);
+
+      inline size_type
+      black_height(node_pointer p_nd);
+
+      void
+      split_at_node(node_pointer p_nd, PB_DS_CLASS_C_DEC& other);
+
+    };
+
+#include <ext/pb_ds/detail/rb_tree_map_/constructors_destructor_fn_imps.hpp>
+#include <ext/pb_ds/detail/rb_tree_map_/insert_fn_imps.hpp>
+#include <ext/pb_ds/detail/rb_tree_map_/erase_fn_imps.hpp>
+#include <ext/pb_ds/detail/rb_tree_map_/debug_fn_imps.hpp>
+#include <ext/pb_ds/detail/rb_tree_map_/split_join_fn_imps.hpp>
+#include <ext/pb_ds/detail/rb_tree_map_/info_fn_imps.hpp>
+
+#undef PB_DS_CLASS_T_DEC
+
+#undef PB_DS_CLASS_C_DEC
+
+#undef PB_DS_CLASS_NAME
+
+#undef PB_DS_BASE_CLASS_NAME
+
+#undef PB_DS_BASE_C_DEC
+
+#undef PB_DS_DBG_ASSERT
+#undef PB_DS_DBG_VERIFY
+#undef PB_DS_DBG_ONLY
+
+#undef PB_DS_V2F
+#undef PB_DS_EP2VP
+#undef PB_DS_V2S
+
+  } // namespace detail
+} // namespace pb_ds
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/rb_tree_map_/split_join_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/rb_tree_map_/split_join_fn_imps.hpp
new file mode 100644
index 00000000000..633f027a7ba
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/rb_tree_map_/split_join_fn_imps.hpp
@@ -0,0 +1,374 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file split_join_fn_imps.hpp
+ * Contains an implementation for rb_tree_.
+ */
+
+PB_DS_CLASS_T_DEC
+inline void
+PB_DS_CLASS_C_DEC::
+join(PB_DS_CLASS_C_DEC& other)
+{
+  PB_DS_DBG_ONLY(assert_valid();)
+
+    PB_DS_DBG_ONLY(other.assert_valid();)
+    PB_DS_DBG_ONLY(other.PB_DS_BASE_C_DEC::assert_valid();)
+
+    if (PB_DS_BASE_C_DEC::join_prep(other) == false)
+      {
+        PB_DS_DBG_ONLY(assert_valid();)
+	  PB_DS_DBG_ONLY(other.assert_valid();)
+
+	  return;
+      }
+
+  const node_pointer p_x = other.split_min();
+
+  join_imp(p_x, other.m_p_head->m_p_parent);
+
+  PB_DS_BASE_C_DEC::join_finish(other);
+
+  PB_DS_DBG_ONLY(assert_valid();)
+    PB_DS_DBG_ONLY(PB_DS_BASE_C_DEC::assert_valid();)
+
+    PB_DS_DBG_ONLY(other.assert_valid();)
+    PB_DS_DBG_ONLY(other.PB_DS_BASE_C_DEC::assert_valid();)
+    }
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+join_imp(node_pointer p_x, node_pointer p_r)
+{
+  PB_DS_DBG_ASSERT(p_x != NULL);
+
+  if (p_r != NULL)
+    p_r->m_red = false;
+
+  const size_type h =
+    black_height(PB_DS_BASE_C_DEC::m_p_head->m_p_parent);
+  const size_type other_h = black_height(p_r);
+
+  node_pointer p_x_l;
+  node_pointer p_x_r;
+
+  std::pair<node_pointer, node_pointer> join_pos;
+
+  const bool right_join = h >= other_h;
+
+  if (right_join)
+    {
+      join_pos = find_join_pos_right(            PB_DS_BASE_C_DEC::m_p_head->m_p_parent, h, other_h);
+
+      p_x_l = join_pos.first;
+      p_x_r = p_r;
+    }
+  else
+    {
+      p_x_l = PB_DS_BASE_C_DEC::m_p_head->m_p_parent;
+
+      PB_DS_BASE_C_DEC::m_p_head->m_p_parent = p_r;
+      if (p_r != NULL)
+	p_r->m_p_parent = PB_DS_BASE_C_DEC::m_p_head;
+
+      join_pos = find_join_pos_left(            PB_DS_BASE_C_DEC::m_p_head->m_p_parent, h, other_h);
+
+      p_x_r = join_pos.first;
+    }
+
+  node_pointer p_parent = join_pos.second;
+
+  if (p_parent == PB_DS_BASE_C_DEC::m_p_head)
+    {
+      PB_DS_BASE_C_DEC::m_p_head->m_p_parent = p_x;
+
+      p_x->m_p_parent = PB_DS_BASE_C_DEC::m_p_head;
+    }
+  else
+    {
+      p_x->m_p_parent = p_parent;
+
+      if (right_join)
+	p_x->m_p_parent->m_p_right = p_x;
+      else
+	p_x->m_p_parent->m_p_left = p_x;
+    }
+
+  p_x->m_p_left = p_x_l;
+  if (p_x_l != NULL)
+    p_x_l->m_p_parent = p_x;
+
+  p_x->m_p_right = p_x_r;
+  if (p_x_r != NULL)
+    p_x_r->m_p_parent = p_x;
+
+  p_x->m_red = true;
+
+  PB_DS_BASE_C_DEC::initialize_min_max();
+
+  PB_DS_DBG_ONLY(PB_DS_BASE_C_DEC::structure_only_assert_valid();)
+
+    PB_DS_BASE_C_DEC::update_to_top(p_x, (node_update* )this);
+
+  insert_fixup(p_x);
+
+  PB_DS_DBG_ONLY(PB_DS_BASE_C_DEC::structure_only_assert_valid());
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::node_pointer
+PB_DS_CLASS_C_DEC::
+split_min()
+{
+  node_pointer p_min = PB_DS_BASE_C_DEC::m_p_head->m_p_left;
+
+#ifdef PB_DS_RB_TREE_DEBUG_
+  const node_pointer p_head = PB_DS_BASE_C_DEC::m_p_head;
+
+  PB_DS_DBG_ASSERT(p_min != p_head);
+#endif // #ifdef PB_DS_RB_TREE_DEBUG_
+
+  remove_node(p_min);
+
+  return (p_min);
+}
+
+PB_DS_CLASS_T_DEC
+std::pair<
+  typename PB_DS_CLASS_C_DEC::node_pointer,
+  typename PB_DS_CLASS_C_DEC::node_pointer>
+PB_DS_CLASS_C_DEC::
+find_join_pos_right(node_pointer p_l, size_type h_l, size_type h_r)
+{
+  PB_DS_DBG_ASSERT(h_l >= h_r);
+
+  if (PB_DS_BASE_C_DEC::m_p_head->m_p_parent == NULL)
+    return (std::make_pair((node_pointer)NULL,
+			   PB_DS_BASE_C_DEC::m_p_head));
+
+  node_pointer p_l_parent = PB_DS_BASE_C_DEC::m_p_head;
+
+  while (h_l > h_r)
+    {
+      if (p_l->m_red == false)
+        {
+	  PB_DS_DBG_ASSERT(h_l > 0);
+
+	  --h_l;
+        }
+
+      p_l_parent = p_l;
+
+      p_l = p_l->m_p_right;
+    }
+
+  if (!is_effectively_black(p_l))
+    {
+      p_l_parent = p_l;
+
+      p_l = p_l->m_p_right;
+    }
+
+  PB_DS_DBG_ASSERT(is_effectively_black(p_l));
+  PB_DS_DBG_ASSERT(black_height(p_l) == h_r);
+  PB_DS_DBG_ASSERT(p_l == NULL || p_l->m_p_parent == p_l_parent);
+
+  return (std::make_pair(p_l, p_l_parent));
+}
+
+PB_DS_CLASS_T_DEC
+std::pair<
+  typename PB_DS_CLASS_C_DEC::node_pointer,
+  typename PB_DS_CLASS_C_DEC::node_pointer>
+PB_DS_CLASS_C_DEC::
+find_join_pos_left(node_pointer p_r, size_type h_l, size_type h_r)
+{
+  PB_DS_DBG_ASSERT(h_r > h_l);
+
+  if (PB_DS_BASE_C_DEC::m_p_head->m_p_parent == NULL)
+    return (std::make_pair((node_pointer)NULL,
+			   PB_DS_BASE_C_DEC::m_p_head));
+
+  node_pointer p_r_parent = PB_DS_BASE_C_DEC::m_p_head;
+
+  while (h_r > h_l)
+    {
+      if (p_r->m_red == false)
+        {
+	  PB_DS_DBG_ASSERT(h_r > 0);
+
+	  --h_r;
+        }
+
+      p_r_parent = p_r;
+
+      p_r = p_r->m_p_left;
+    }
+
+  if (!is_effectively_black(p_r))
+    {
+      p_r_parent = p_r;
+
+      p_r = p_r->m_p_left;
+    }
+
+  PB_DS_DBG_ASSERT(is_effectively_black(p_r));
+  PB_DS_DBG_ASSERT(black_height(p_r) == h_l);
+  PB_DS_DBG_ASSERT(p_r == NULL || p_r->m_p_parent == p_r_parent);
+
+  return (std::make_pair(p_r, p_r_parent));
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::size_type
+PB_DS_CLASS_C_DEC::
+black_height(node_pointer p_nd)
+{
+  size_type h = 1;
+
+  while (p_nd != NULL)
+    {
+      if (p_nd->m_red == false)
+	++h;
+
+      p_nd = p_nd->m_p_left;
+    }
+
+  return (h);
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+split(const_key_reference r_key, PB_DS_CLASS_C_DEC& other)
+{
+  PB_DS_DBG_ONLY(assert_valid());
+  PB_DS_DBG_ONLY(PB_DS_BASE_C_DEC::assert_valid();)
+
+    PB_DS_DBG_ONLY(other.assert_valid());
+  PB_DS_DBG_ONLY(other.PB_DS_BASE_C_DEC::assert_valid();)
+
+    if (PB_DS_BASE_C_DEC::split_prep(r_key, other) == false)
+      {
+        PB_DS_DBG_ONLY(assert_valid());
+        PB_DS_DBG_ONLY(other.assert_valid());
+
+        return;
+      }
+
+  PB_DS_DBG_ONLY(PB_DS_BASE_C_DEC::structure_only_assert_valid();)
+
+    PB_DS_DBG_ONLY(other.PB_DS_BASE_C_DEC::structure_only_assert_valid();)
+
+    node_pointer p_nd = upper_bound(r_key).m_p_nd;
+
+  do
+    {
+      node_pointer p_next_nd = p_nd->m_p_parent;
+
+      if (Cmp_Fn::operator()(
+			     r_key,
+			     PB_DS_V2F(p_nd->m_value)))
+	split_at_node(p_nd, other);
+
+      PB_DS_DBG_ONLY(PB_DS_BASE_C_DEC::structure_only_assert_valid();)
+        PB_DS_DBG_ONLY(other.PB_DS_BASE_C_DEC::structure_only_assert_valid();)
+
+        p_nd = p_next_nd;
+    }
+  while (p_nd != PB_DS_BASE_C_DEC::m_p_head);
+
+  PB_DS_BASE_C_DEC::split_finish(other);
+
+  PB_DS_DBG_ONLY(assert_valid();)
+    PB_DS_DBG_ONLY(assert_valid();)
+    }
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+split_at_node(node_pointer p_nd, PB_DS_CLASS_C_DEC& other)
+{
+  PB_DS_DBG_ASSERT(p_nd != NULL);
+
+  node_pointer p_l = p_nd->m_p_left;
+  node_pointer p_r = p_nd->m_p_right;
+
+  node_pointer p_parent = p_nd->m_p_parent;
+
+  if (p_parent == PB_DS_BASE_C_DEC::m_p_head)
+    {
+      PB_DS_BASE_C_DEC::m_p_head->m_p_parent = p_l;
+
+      if (p_l != NULL)
+        {
+	  p_l->m_p_parent = PB_DS_BASE_C_DEC::m_p_head;
+
+	  p_l->m_red = false;
+        }
+    }
+  else
+    {
+      if (p_parent->m_p_left == p_nd)
+	p_parent->m_p_left = p_l;
+      else
+	p_parent->m_p_right = p_l;
+
+      if (p_l != NULL)
+	p_l->m_p_parent = p_parent;
+
+      update_to_top(p_parent, (node_update* )this);
+
+      if (!p_nd->m_red)
+	remove_fixup(p_l, p_parent);
+    }
+
+  PB_DS_BASE_C_DEC::initialize_min_max();
+
+  other.join_imp(p_nd, p_r);
+
+  PB_DS_DBG_ONLY(PB_DS_BASE_C_DEC::structure_only_assert_valid());
+
+  PB_DS_DBG_ONLY(other.PB_DS_BASE_C_DEC::structure_only_assert_valid());
+}
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/rb_tree_map_/traits.hpp b/libstdc++-v3/include/ext/pb_ds/detail/rb_tree_map_/traits.hpp
new file mode 100644
index 00000000000..77db8ddab04
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/rb_tree_map_/traits.hpp
@@ -0,0 +1,131 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file traits.hpp
+ * Contains an implementation for rb_tree_.
+ */
+
+#ifndef PB_DS_RB_TREE_NODE_AND_IT_TRAITS_HPP
+#define PB_DS_RB_TREE_NODE_AND_IT_TRAITS_HPP
+
+#include <ext/pb_ds/detail/rb_tree_map_/node.hpp>
+
+namespace pb_ds
+{
+  namespace detail
+  {
+
+    template<typename Key,
+	     typename Mapped,
+	     class Cmp_Fn,
+	     template<typename Const_Node_Iterator,
+		      class Node_Iterator,
+		      class Cmp_Fn_,
+		      class Allocator_>
+    class Node_Update,
+	     class Allocator>
+    struct tree_traits<
+      Key,
+      Mapped,
+      Cmp_Fn,
+      Node_Update,
+      rb_tree_tag,
+      Allocator> : public bin_search_tree_traits<
+      Key,
+      Mapped,
+      Cmp_Fn,
+      Node_Update,
+      rb_tree_node_<
+      typename types_traits<
+      Key,
+      Mapped,
+      Allocator,
+      false>::value_type,
+      typename tree_node_metadata_selector<
+      Key,
+      Mapped,
+      Cmp_Fn,
+      Node_Update,
+      Allocator>::type,
+      Allocator>,
+      Allocator>
+    { };
+
+    template<typename Key,
+	     class Cmp_Fn,
+	     template<typename Const_Node_Iterator,
+		      class Node_Iterator,
+		      class Cmp_Fn_,
+		      class Allocator_>
+    class Node_Update,
+	     class Allocator>
+    struct tree_traits<
+      Key,
+      null_mapped_type,
+      Cmp_Fn,
+      Node_Update,
+      rb_tree_tag,
+      Allocator> : public bin_search_tree_traits<
+      Key,
+      null_mapped_type,
+      Cmp_Fn,
+      Node_Update,
+      rb_tree_node_<
+      typename types_traits<
+      Key,
+      null_mapped_type,
+      Allocator,
+      false>::value_type,
+      typename tree_node_metadata_selector<
+      Key,
+      null_mapped_type,
+      Cmp_Fn,
+      Node_Update,
+      Allocator>::type,
+      Allocator>,
+      Allocator>
+    { };
+
+  } // namespace detail
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_RB_TREE_NODE_AND_IT_TRAITS_HPP
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/rc_binomial_heap_/constructors_destructor_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/rc_binomial_heap_/constructors_destructor_fn_imps.hpp
new file mode 100644
index 00000000000..5b3b1b16fd1
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/rc_binomial_heap_/constructors_destructor_fn_imps.hpp
@@ -0,0 +1,94 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file constructors_destructor_fn_imps.hpp
+ * Contains an implementation for rc_binomial_heap_.
+ */
+
+PB_DS_CLASS_T_DEC
+PB_DS_CLASS_C_DEC::
+rc_binomial_heap_()
+{
+  PB_DS_DBG_ONLY(assert_valid();)
+    }
+
+PB_DS_CLASS_T_DEC
+PB_DS_CLASS_C_DEC::
+rc_binomial_heap_(const Cmp_Fn& r_cmp_fn) :
+  PB_DS_BASE_C_DEC(r_cmp_fn)
+{
+  PB_DS_DBG_ONLY(assert_valid();)
+    }
+
+PB_DS_CLASS_T_DEC
+PB_DS_CLASS_C_DEC::
+rc_binomial_heap_(const PB_DS_CLASS_C_DEC& other) :
+  PB_DS_BASE_C_DEC(other)
+{
+  make_binomial_heap();
+
+  base_type::find_max();
+
+  PB_DS_DBG_ONLY(assert_valid();)
+    }
+
+PB_DS_CLASS_T_DEC
+PB_DS_CLASS_C_DEC::
+~rc_binomial_heap_()
+{ }
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+swap(PB_DS_CLASS_C_DEC& other)
+{
+  PB_DS_DBG_ONLY(assert_valid();)
+    PB_DS_DBG_ONLY(other.assert_valid();)
+
+    base_type::swap(other);
+
+  m_rc.swap(other.m_rc);
+
+  PB_DS_DBG_ONLY(assert_valid();)
+    PB_DS_DBG_ONLY(other.assert_valid();)
+    }
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/rc_binomial_heap_/debug_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/rc_binomial_heap_/debug_fn_imps.hpp
new file mode 100644
index 00000000000..ffeb9bba4eb
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/rc_binomial_heap_/debug_fn_imps.hpp
@@ -0,0 +1,138 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file debug_fn_imps.hpp
+ * Contains an implementation for rc_binomial_heap_.
+ */
+
+#ifdef PB_DS_RC_BINOMIAL_HEAP_DEBUG_
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+assert_valid() const
+{
+  base_type::assert_valid(false);
+
+  if (!base_type::empty())
+    {
+      PB_DS_DBG_ASSERT(base_type::m_p_max != NULL);
+
+      base_type::assert_max();
+    }
+
+  m_rc.assert_valid();
+
+  if (m_rc.empty())
+    {
+      base_type::assert_valid(true);
+
+      PB_DS_DBG_ASSERT(next_2_pointer(base_type::m_p_root) == NULL);
+
+      return;
+    }
+
+  const_node_pointer p_nd = next_2_pointer(base_type::m_p_root);
+
+  typename rc_t::const_iterator it = m_rc.end();
+  --it;
+
+  while (p_nd != NULL)
+    {
+      PB_DS_DBG_ASSERT(*it == p_nd);
+
+      const_node_pointer p_next = p_nd->m_p_next_sibling;
+
+      PB_DS_DBG_ASSERT(p_next != NULL);
+
+      PB_DS_DBG_ASSERT(p_nd->m_metadata == p_next->m_metadata);
+
+      PB_DS_DBG_ASSERT(p_next->m_p_next_sibling == NULL ||
+		       p_next->m_metadata < p_next->m_p_next_sibling->m_metadata);
+
+      --it;
+
+      p_nd = next_2_pointer(next_after_0_pointer(p_nd));
+    }
+
+  PB_DS_DBG_ASSERT(it + 1 == m_rc.begin());
+}
+
+PB_DS_CLASS_T_DEC
+typename PB_DS_CLASS_C_DEC::const_node_pointer
+PB_DS_CLASS_C_DEC::
+next_2_pointer(const_node_pointer p_nd)
+{
+  if (p_nd == NULL)
+    return NULL;
+
+  node_pointer p_next = p_nd->m_p_next_sibling;
+
+  if (p_next == NULL)
+    return NULL;
+
+  if (p_nd->m_metadata == p_next->m_metadata)
+    return p_nd;
+
+  return next_2_pointer(p_next);
+}
+
+PB_DS_CLASS_T_DEC
+typename PB_DS_CLASS_C_DEC::const_node_pointer
+PB_DS_CLASS_C_DEC::
+next_after_0_pointer(const_node_pointer p_nd)
+{
+  if (p_nd == NULL)
+    return NULL;
+
+  node_pointer p_next = p_nd->m_p_next_sibling;
+
+  if (p_next == NULL)
+    return NULL;
+
+  if (p_nd->m_metadata < p_next->m_metadata)
+    return p_next;
+
+  return next_after_0_pointer(p_next);
+}
+
+#endif // #ifdef PB_DS_RC_BINOMIAL_HEAP__DEBUG_
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/rc_binomial_heap_/erase_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/rc_binomial_heap_/erase_fn_imps.hpp
new file mode 100644
index 00000000000..2e6bc3dd91f
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/rc_binomial_heap_/erase_fn_imps.hpp
@@ -0,0 +1,125 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file erase_fn_imps.hpp
+ * Contains an implementation for rc_binomial_heap_.
+ */
+
+PB_DS_CLASS_T_DEC
+inline void
+PB_DS_CLASS_C_DEC::
+pop()
+{
+  make_binomial_heap();
+
+  PB_DS_DBG_ASSERT(!base_type::empty());
+
+  base_type::pop();
+
+  base_type::find_max();
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+clear()
+{
+  base_type::clear();
+
+  m_rc.clear();
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+make_binomial_heap()
+{
+  node_pointer p_nd = base_type::m_p_root;
+
+  while (p_nd != NULL)
+    {
+      node_pointer p_next = p_nd->m_p_next_sibling;
+
+      if (p_next == NULL)
+	p_nd = p_next;
+      else if (p_nd->m_metadata == p_next->m_metadata)
+	p_nd = link_with_next_sibling(p_nd);
+      else if (p_nd->m_metadata < p_next->m_metadata)
+	p_nd = p_next;
+#ifdef PB_DS_RC_BINOMIAL_HEAP__DEBUG_
+      else
+	PB_DS_DBG_ASSERT(0);
+#endif // #ifdef PB_DS_RC_BINOMIAL_HEAP__DEBUG_
+    }
+
+  m_rc.clear();
+}
+
+PB_DS_CLASS_T_DEC
+template<typename Pred>
+typename PB_DS_CLASS_C_DEC::size_type
+PB_DS_CLASS_C_DEC::
+erase_if(Pred pred)
+{
+  make_binomial_heap();
+
+  const size_type ersd = base_type::erase_if(pred);
+
+  base_type::find_max();
+
+  PB_DS_DBG_ONLY(assert_valid();)
+
+    return ersd;
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+erase(point_iterator it)
+{
+  make_binomial_heap();
+
+  base_type::erase(it);
+
+  base_type::find_max();
+}
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/rc_binomial_heap_/insert_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/rc_binomial_heap_/insert_fn_imps.hpp
new file mode 100644
index 00000000000..5a9ae2f1fdc
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/rc_binomial_heap_/insert_fn_imps.hpp
@@ -0,0 +1,160 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file insert_fn_imps.hpp
+ * Contains an implementation for rc_binomial_heap_.
+ */
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::point_iterator
+PB_DS_CLASS_C_DEC::
+push(const_reference r_val)
+{
+  PB_DS_DBG_ONLY(assert_valid();)
+
+    make_0_exposed();
+
+  PB_DS_DBG_ONLY(assert_valid();)
+
+    node_pointer p_nd = base_type::get_new_node_for_insert(r_val);
+
+  p_nd->m_p_l_child = p_nd->m_p_prev_or_parent = NULL;
+  p_nd->m_metadata = 0;
+
+  if (base_type::m_p_max == NULL || Cmp_Fn::operator()(base_type::m_p_max->m_value, r_val))
+    base_type::m_p_max = p_nd;
+
+  p_nd->m_p_next_sibling = base_type::m_p_root;
+
+  if (base_type::m_p_root != NULL)
+    base_type::m_p_root->m_p_prev_or_parent = p_nd;
+
+  base_type::m_p_root = p_nd;
+
+  if (p_nd->m_p_next_sibling != NULL&&  p_nd->m_p_next_sibling->m_metadata == 0)
+    m_rc.push(p_nd);
+
+  PB_DS_DBG_ONLY(assert_valid();)
+
+    return point_iterator(p_nd);
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+modify(point_iterator it, const_reference r_new_val)
+{
+  PB_DS_DBG_ONLY(assert_valid();)
+
+    make_binomial_heap();
+
+  base_type::modify(it, r_new_val);
+
+  base_type::find_max();
+
+  PB_DS_DBG_ONLY(assert_valid();)
+    }
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::node_pointer
+PB_DS_CLASS_C_DEC::
+link_with_next_sibling(node_pointer p_nd)
+{
+  node_pointer p_next = p_nd->m_p_next_sibling;
+
+  PB_DS_DBG_ASSERT(p_next != NULL);
+  PB_DS_DBG_ASSERT(p_next->m_p_prev_or_parent == p_nd);
+
+  if (Cmp_Fn::operator()(p_nd->m_value, p_next->m_value))
+    {
+      p_next->m_p_prev_or_parent = p_nd->m_p_prev_or_parent;
+
+      if (p_next->m_p_prev_or_parent == NULL)
+	base_type::m_p_root = p_next;
+      else
+	p_next->m_p_prev_or_parent->m_p_next_sibling = p_next;
+
+      if (base_type::m_p_max == p_nd)
+	base_type::m_p_max = p_next;
+
+      base_type::make_child_of(p_nd, p_next);
+
+      ++p_next->m_metadata;
+
+      return p_next;
+    }
+
+  p_nd->m_p_next_sibling = p_next->m_p_next_sibling;
+
+  if (p_nd->m_p_next_sibling != NULL)
+    p_nd->m_p_next_sibling->m_p_prev_or_parent = p_nd;
+
+  if (base_type::m_p_max == p_next)
+    base_type::m_p_max = p_nd;
+
+  base_type::make_child_of(p_next, p_nd);
+
+  ++p_nd->m_metadata;
+
+  return p_nd;
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+make_0_exposed()
+{
+  if (m_rc.empty())
+    return;
+
+  node_pointer p_nd = m_rc.top();
+
+  m_rc.pop();
+
+  PB_DS_DBG_ASSERT(p_nd->m_p_next_sibling != NULL);
+  PB_DS_DBG_ASSERT(p_nd->m_metadata == p_nd->m_p_next_sibling->m_metadata);
+
+  node_pointer p_res = link_with_next_sibling(p_nd);
+
+  if (p_res->m_p_next_sibling != NULL&&  p_res->m_metadata == p_res->m_p_next_sibling->m_metadata)
+    m_rc.push(p_res);
+}
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/rc_binomial_heap_/rc.hpp b/libstdc++-v3/include/ext/pb_ds/detail/rc_binomial_heap_/rc.hpp
new file mode 100644
index 00000000000..437e5224c16
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/rc_binomial_heap_/rc.hpp
@@ -0,0 +1,313 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file rc.hpp
+ * Contains a redundant (binary counter).
+ */
+
+#ifndef PB_DS_RC_HPP
+#define PB_DS_RC_HPP
+
+namespace pb_ds
+{
+  namespace detail
+  {
+
+#ifdef PB_DS_RC_BINOMIAL_HEAP_DEBUG_
+#define PB_DS_DBG_ASSERT(X) assert(X)
+#define PB_DS_DBG_VERIFY(X) assert(X)
+#define PB_DS_DBG_ONLY(X) X
+#else // #ifdef PB_DS_RC_BINOMIAL_HEAP_DEBUG_
+#define PB_DS_DBG_ASSERT(X)
+#define PB_DS_DBG_VERIFY(X) {if((X)==0);}
+#define PB_DS_DBG_ONLY(X) ;
+#endif // #ifdef PB_DS_RC_BINOMIAL_HEAP_DEBUG_
+
+#define PB_DS_CLASS_T_DEC			\
+    template<typename Node, class Allocator>
+
+#define PB_DS_CLASS_C_DEC				\
+    rc<							\
+					Node,		\
+					Allocator>
+
+    template<typename Node, class Allocator>
+    class rc
+    {
+    private:
+      typedef Allocator allocator;
+
+      typedef typename allocator::size_type size_type;
+
+      typedef Node node;
+
+      typedef
+      typename allocator::template rebind<
+	node>::other::pointer
+      node_pointer;
+
+      typedef
+      typename allocator::template rebind<
+	node_pointer>::other::pointer
+      entry_pointer;
+
+      typedef
+      typename allocator::template rebind<
+	node_pointer>::other::const_pointer
+      const_entry_pointer;
+
+      enum
+	{
+	  max_entries = sizeof(size_type) << 3
+	};
+
+    public:
+      typedef node_pointer entry;
+
+      typedef const_entry_pointer const_iterator;
+
+    public:
+      rc();
+
+      rc(const PB_DS_CLASS_C_DEC& other);
+
+      inline void
+      swap(PB_DS_CLASS_C_DEC& other);
+
+      inline void
+      push(entry p_nd);
+
+      inline node_pointer
+      top() const;
+
+      inline void
+      pop();
+
+      inline bool
+      empty() const;
+
+      inline size_type
+      size() const;
+
+      void
+      clear();
+
+      const const_iterator
+      begin() const;
+
+      const const_iterator
+      end() const;
+
+#ifdef PB_DS_RC_BINOMIAL_HEAP_DEBUG_
+      void
+      assert_valid() const;
+#endif // #ifdef PB_DS_RC_BINOMIAL_HEAP_DEBUG_
+
+#ifdef PB_DS_RC_BINOMIAL_HEAP_TRACE_
+
+      void
+      trace() const;
+
+#endif // #ifdef PB_DS_RC_BINOMIAL_HEAP_TRACE_
+
+    private:
+      node_pointer m_a_entries[max_entries];
+
+      size_type m_over_top;
+    };
+
+    PB_DS_CLASS_T_DEC
+    PB_DS_CLASS_C_DEC::
+    rc() :
+      m_over_top(0)
+    {
+      PB_DS_DBG_ONLY(assert_valid();)
+	}
+
+    PB_DS_CLASS_T_DEC
+    PB_DS_CLASS_C_DEC::
+    rc(const PB_DS_CLASS_C_DEC& other) :
+      m_over_top(0)
+    {
+      PB_DS_DBG_ONLY(assert_valid();)
+	}
+
+    PB_DS_CLASS_T_DEC
+    inline void
+    PB_DS_CLASS_C_DEC::
+    swap(PB_DS_CLASS_C_DEC& other)
+    {
+      PB_DS_DBG_ONLY(assert_valid();)
+	PB_DS_DBG_ONLY(other.assert_valid();)
+
+	const size_type over_top =
+	std::max(m_over_top, other.m_over_top);
+
+      for (size_type i = 0; i < over_top; ++i)
+	std::swap(m_a_entries[i], other.m_a_entries[i]);
+
+      std::swap(m_over_top, other.m_over_top);
+
+      PB_DS_DBG_ONLY(assert_valid();)
+	PB_DS_DBG_ONLY(other.assert_valid();)
+	}
+
+    PB_DS_CLASS_T_DEC
+    inline void
+    PB_DS_CLASS_C_DEC::
+    push(entry p_nd)
+    {
+      PB_DS_DBG_ONLY(assert_valid();)
+	PB_DS_DBG_ASSERT(m_over_top < max_entries);
+
+      m_a_entries[m_over_top++] = p_nd;
+
+      PB_DS_DBG_ONLY(assert_valid();)
+	}
+
+    PB_DS_CLASS_T_DEC
+    inline void
+    PB_DS_CLASS_C_DEC::
+    pop()
+    {
+      PB_DS_DBG_ONLY(assert_valid();)
+	PB_DS_DBG_ASSERT(!empty());
+
+      --m_over_top;
+
+      PB_DS_DBG_ONLY(assert_valid();)
+	}
+
+    PB_DS_CLASS_T_DEC
+    inline typename PB_DS_CLASS_C_DEC::node_pointer
+    PB_DS_CLASS_C_DEC::
+    top() const
+    {
+      PB_DS_DBG_ONLY(assert_valid();)
+	PB_DS_DBG_ASSERT(!empty());
+
+      return* (m_a_entries + m_over_top - 1);
+    }
+
+    PB_DS_CLASS_T_DEC
+    inline bool
+    PB_DS_CLASS_C_DEC::
+    empty() const
+    {
+      PB_DS_DBG_ONLY(assert_valid();)
+
+	return m_over_top == 0;
+    }
+
+    PB_DS_CLASS_T_DEC
+    inline typename PB_DS_CLASS_C_DEC::size_type
+    PB_DS_CLASS_C_DEC::
+    size() const
+    {
+      return m_over_top;
+    }
+
+    PB_DS_CLASS_T_DEC
+    void
+    PB_DS_CLASS_C_DEC::
+    clear()
+    {
+      PB_DS_DBG_ONLY(assert_valid();)
+
+	m_over_top = 0;
+
+      PB_DS_DBG_ONLY(assert_valid();)
+	}
+
+    PB_DS_CLASS_T_DEC
+    const typename PB_DS_CLASS_C_DEC::const_iterator
+    PB_DS_CLASS_C_DEC::
+    begin() const
+    {
+      return& m_a_entries[0];
+    }
+
+    PB_DS_CLASS_T_DEC
+    const typename PB_DS_CLASS_C_DEC::const_iterator
+    PB_DS_CLASS_C_DEC::
+    end() const
+    {
+      return& m_a_entries[m_over_top];
+    }
+
+#ifdef PB_DS_RC_BINOMIAL_HEAP_DEBUG_
+    PB_DS_CLASS_T_DEC
+    void
+    PB_DS_CLASS_C_DEC::
+    assert_valid() const
+    {
+      PB_DS_DBG_ASSERT(m_over_top < max_entries);
+    }
+#endif // #ifdef PB_DS_RC_BINOMIAL_HEAP_DEBUG_
+
+#ifdef PB_DS_RC_BINOMIAL_HEAP_TRACE_
+    PB_DS_CLASS_T_DEC
+    void
+    PB_DS_CLASS_C_DEC::
+    trace() const
+    {
+      std::cout << "rc" << std::endl;
+
+      for (size_type i = 0; i < m_over_top; ++i)
+	std::cerr << m_a_entries[i] << std::endl;
+
+      std::cout << std::endl;
+    }
+#endif // #ifdef PB_DS_RC_BINOMIAL_HEAP_TRACE_
+
+#undef PB_DS_CLASS_T_DEC
+
+#undef PB_DS_CLASS_C_DEC
+
+#undef PB_DS_DBG_ASSERT
+#undef PB_DS_DBG_VERIFY
+#undef PB_DS_DBG_ONLY
+
+  } // namespace detail
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_RC_HPP
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/rc_binomial_heap_/rc_binomial_heap_.hpp b/libstdc++-v3/include/ext/pb_ds/detail/rc_binomial_heap_/rc_binomial_heap_.hpp
new file mode 100644
index 00000000000..dbab1e98e2d
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/rc_binomial_heap_/rc_binomial_heap_.hpp
@@ -0,0 +1,236 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file rc_binomial_heap_.hpp
+ * Contains an implementation for rc_binomial_heap_.
+ */
+
+/*
+ * Redundant-counter binomial heap.
+ */
+
+#ifdef PB_DS_RC_BINOMIAL_HEAP_DEBUG_
+#include <cassert>
+#endif // #ifdef PB_DS_RC_BINOMIAL_HEAP_DEBUG_
+#include <ext/pb_ds/detail/cond_dealtor.hpp>
+#include <ext/pb_ds/detail/type_utils.hpp>
+#include <ext/pb_ds/detail/binomial_heap_base_/binomial_heap_base_.hpp>
+#include <ext/pb_ds/detail/rc_binomial_heap_/rc.hpp>
+
+namespace pb_ds
+{
+  namespace detail
+  {
+
+#ifdef PB_DS_RC_BINOMIAL_HEAP_DEBUG_
+#define PB_DS_DBG_ASSERT(X) assert(X)
+#define PB_DS_DBG_VERIFY(X) assert(X)
+#define PB_DS_DBG_ONLY(X) X
+#else // #ifdef PB_DS_RC_BINOMIAL_HEAP_DEBUG_
+#define PB_DS_DBG_ASSERT(X)
+#define PB_DS_DBG_VERIFY(X) {if((X)==0);}
+#define PB_DS_DBG_ONLY(X) ;
+#endif // #ifdef PB_DS_RC_BINOMIAL_HEAP_DEBUG_
+
+#define PB_DS_CLASS_T_DEC						\
+    template<typename Value_Type, class Cmp_Fn, class Allocator>
+
+#define PB_DS_CLASS_C_DEC				\
+    rc_binomial_heap_<					\
+					Value_Type,	\
+					Cmp_Fn,		\
+					Allocator>
+
+#define PB_DS_BASE_C_DEC						\
+    binomial_heap_base_<					\
+							Value_Type,	\
+							Cmp_Fn,		\
+							Allocator>
+
+#define PB_DS_RC_C_DEC							\
+    rc<							\
+							typename PB_DS_BASE_C_DEC::node, \
+							Allocator>
+
+    /**
+     * class description = "8y|\|0|\/|i41 h34p 74813">
+     **/
+    template<typename Value_Type, class Cmp_Fn, class Allocator>
+    class rc_binomial_heap_ : public PB_DS_BASE_C_DEC
+    {
+
+    private:
+      typedef PB_DS_BASE_C_DEC base_type;
+
+      typedef typename base_type::node_pointer node_pointer;
+
+      typedef typename base_type::const_node_pointer const_node_pointer;
+
+      typedef PB_DS_RC_C_DEC rc_t;
+
+    public:
+
+      typedef typename Allocator::size_type size_type;
+
+      typedef typename Allocator::difference_type difference_type;
+
+      typedef Value_Type value_type;
+
+      typedef typename base_type::pointer pointer;
+
+      typedef typename base_type::const_pointer const_pointer;
+
+      typedef typename base_type::reference reference;
+
+      typedef typename base_type::const_reference const_reference;
+
+      typedef typename base_type::const_point_iterator const_point_iterator;
+
+      typedef typename base_type::point_iterator point_iterator;
+
+      typedef typename base_type::const_iterator const_iterator;
+
+      typedef typename base_type::iterator iterator;
+
+      typedef typename base_type::cmp_fn cmp_fn;
+
+      typedef typename base_type::allocator allocator;
+
+    public:
+
+      rc_binomial_heap_();
+
+      rc_binomial_heap_(const Cmp_Fn& r_cmp_fn);
+
+      rc_binomial_heap_(const PB_DS_CLASS_C_DEC& other);
+
+      ~rc_binomial_heap_();
+
+      void
+      swap(PB_DS_CLASS_C_DEC& other);
+
+      inline point_iterator
+      push(const_reference r_val);
+
+      void
+      modify(point_iterator it, const_reference r_new_val);
+
+      inline void
+      pop();
+
+      void
+      erase(point_iterator it);
+
+      inline void
+      clear();
+
+      template<typename Pred>
+      size_type
+      erase_if(Pred pred);
+
+      template<typename Pred>
+      void
+      split(Pred pred, PB_DS_CLASS_C_DEC& other);
+
+      void
+      join(PB_DS_CLASS_C_DEC& other);
+
+#ifdef PB_DS_RC_BINOMIAL_HEAP_DEBUG_
+
+      void
+      assert_valid() const;
+
+#endif // #ifdef PB_DS_RC_BINOMIAL_HEAP_DEBUG_
+
+#ifdef PB_DS_RC_BINOMIAL_HEAP_TRACE_
+
+      void
+      trace() const;
+
+#endif // #ifdef PB_DS_RC_BINOMIAL_HEAP_TRACE_
+
+    private:
+
+      inline node_pointer
+      link_with_next_sibling(node_pointer p_nd);
+
+      void
+      make_0_exposed();
+
+      void
+      make_binomial_heap();
+
+#ifdef PB_DS_RC_BINOMIAL_HEAP_DEBUG_
+
+      static const_node_pointer
+      next_2_pointer(const_node_pointer p_nd);
+
+      static const_node_pointer
+      next_after_0_pointer(const_node_pointer p_nd);
+
+#endif // #ifdef PB_DS_RC_BINOMIAL_HEAP_DEBUG_
+
+    private:
+      rc_t m_rc;
+    };
+
+#include <ext/pb_ds/detail/rc_binomial_heap_/constructors_destructor_fn_imps.hpp>
+#include <ext/pb_ds/detail/rc_binomial_heap_/debug_fn_imps.hpp>
+#include <ext/pb_ds/detail/rc_binomial_heap_/erase_fn_imps.hpp>
+#include <ext/pb_ds/detail/rc_binomial_heap_/trace_fn_imps.hpp>
+#include <ext/pb_ds/detail/rc_binomial_heap_/insert_fn_imps.hpp>
+#include <ext/pb_ds/detail/rc_binomial_heap_/split_join_fn_imps.hpp>
+
+#undef PB_DS_CLASS_C_DEC
+
+#undef PB_DS_CLASS_T_DEC
+
+#undef PB_DS_BASE_C_DEC
+
+#undef PB_DS_RC_C_DEC
+
+#undef PB_DS_DBG_ASSERT
+#undef PB_DS_DBG_VERIFY
+#undef PB_DS_DBG_ONLY
+
+  } // namespace detail
+} // namespace pb_ds
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/rc_binomial_heap_/split_join_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/rc_binomial_heap_/split_join_fn_imps.hpp
new file mode 100644
index 00000000000..d83b322a022
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/rc_binomial_heap_/split_join_fn_imps.hpp
@@ -0,0 +1,87 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file split_join_fn_imps.hpp
+ * Contains an implementation for rc_binomial_heap_.
+ */
+
+PB_DS_CLASS_T_DEC
+template<typename Pred>
+void
+PB_DS_CLASS_C_DEC::
+split(Pred pred, PB_DS_CLASS_C_DEC& other)
+{
+  PB_DS_DBG_ONLY(assert_valid();)
+    PB_DS_DBG_ONLY(other.assert_valid();)
+
+    make_binomial_heap();
+  other.make_binomial_heap();
+
+  base_type::split(pred, other);
+
+  base_type::find_max();
+  other.find_max();
+
+  PB_DS_DBG_ONLY(assert_valid();)
+    PB_DS_DBG_ONLY(other.assert_valid();)
+    }
+
+PB_DS_CLASS_T_DEC
+inline void
+PB_DS_CLASS_C_DEC::
+join(PB_DS_CLASS_C_DEC& other)
+{
+  PB_DS_DBG_ONLY(assert_valid();)
+    PB_DS_DBG_ONLY(other.assert_valid();)
+
+    make_binomial_heap();
+  other.make_binomial_heap();
+
+  base_type::join(other);
+
+  base_type::find_max();
+  other.find_max();
+
+  PB_DS_DBG_ONLY(assert_valid();)
+    PB_DS_DBG_ONLY(other.assert_valid();)
+    }
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/rc_binomial_heap_/trace_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/rc_binomial_heap_/trace_fn_imps.hpp
new file mode 100644
index 00000000000..48c2e526c4b
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/rc_binomial_heap_/trace_fn_imps.hpp
@@ -0,0 +1,59 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file trace_fn_imps.hpp
+ * Contains an implementation for rc_binomial_heap_.
+ */
+
+#ifdef PB_DS_RC_BINOMIAL_HEAP_TRACE_
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+trace() const
+{
+  base_type::trace();
+
+  m_rc.trace();
+}
+
+#endif // #ifdef PB_DS_RC_BINOMIAL_HEAP_TRACE_
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/resize_policy/cc_hash_max_collision_check_resize_trigger_imp.hpp b/libstdc++-v3/include/ext/pb_ds/detail/resize_policy/cc_hash_max_collision_check_resize_trigger_imp.hpp
new file mode 100644
index 00000000000..63656723f7b
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/resize_policy/cc_hash_max_collision_check_resize_trigger_imp.hpp
@@ -0,0 +1,253 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file cc_hash_max_collision_check_resize_trigger_imp.hpp
+ * Contains a resize trigger implementation.
+ */
+
+#define PB_DS_STATIC_ASSERT(UNIQUE, E)					\
+  typedef detail::static_assert_dumclass<sizeof(detail::static_assert<(bool)(E)>)> \
+  UNIQUE##static_assert_type
+
+PB_DS_CLASS_T_DEC
+PB_DS_CLASS_C_DEC::
+cc_hash_max_collision_check_resize_trigger(float load) :
+  m_load(load),
+  m_size(0),
+  m_num_col(0),
+  m_max_col(0),
+  m_resize_needed(false)
+{ }
+
+PB_DS_CLASS_T_DEC
+inline void
+PB_DS_CLASS_C_DEC::
+notify_find_search_start()
+{ }
+
+PB_DS_CLASS_T_DEC
+inline void
+PB_DS_CLASS_C_DEC::
+notify_find_search_collision()
+{ }
+
+PB_DS_CLASS_T_DEC
+inline void
+PB_DS_CLASS_C_DEC::
+notify_find_search_end()
+{ }
+
+PB_DS_CLASS_T_DEC
+inline void
+PB_DS_CLASS_C_DEC::
+notify_insert_search_start()
+{
+  m_num_col = 0;
+}
+
+PB_DS_CLASS_T_DEC
+inline void
+PB_DS_CLASS_C_DEC::
+notify_insert_search_collision()
+{
+  ++m_num_col;
+}
+
+PB_DS_CLASS_T_DEC
+inline void
+PB_DS_CLASS_C_DEC::
+notify_insert_search_end()
+{
+  calc_resize_needed();
+}
+
+PB_DS_CLASS_T_DEC
+inline void
+PB_DS_CLASS_C_DEC::
+notify_erase_search_start()
+{ }
+
+PB_DS_CLASS_T_DEC
+inline void
+PB_DS_CLASS_C_DEC::
+notify_erase_search_collision()
+{ }
+
+PB_DS_CLASS_T_DEC
+inline void
+PB_DS_CLASS_C_DEC::
+notify_erase_search_end()
+{ }
+
+PB_DS_CLASS_T_DEC
+inline void
+PB_DS_CLASS_C_DEC::
+notify_inserted(size_type /*num_e*/)
+{ }
+
+PB_DS_CLASS_T_DEC
+inline void
+PB_DS_CLASS_C_DEC::
+notify_erased(size_type /*num_e*/)
+{
+  m_resize_needed = true;
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+notify_cleared()
+{
+  m_resize_needed = false;
+}
+
+PB_DS_CLASS_T_DEC
+inline bool
+PB_DS_CLASS_C_DEC::
+is_resize_needed() const
+{
+  return (m_resize_needed);
+}
+
+PB_DS_CLASS_T_DEC
+inline bool
+PB_DS_CLASS_C_DEC::
+is_grow_needed(size_type /*size*/, size_type /*num_used_e*/) const
+{
+  return (m_num_col >= m_max_col);
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+notify_resized(size_type new_size)
+{
+  m_size = new_size;
+
+#ifdef PB_DS_HT_MAP_RESIZE_TRACE_
+  std::cerr << "chmccrt::notify_resized " <<
+    static_cast<unsigned long>(new_size) << std::endl;
+#endif // #ifdef PB_DS_HT_MAP_RESIZE_TRACE_
+
+  calc_max_num_coll();
+
+  calc_resize_needed();
+
+  m_num_col = 0;
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+calc_max_num_coll()
+{
+  // max_col <-- \sqrt{2 load \ln( 2 m \ln( m ) ) }
+
+  const double ln_arg = 2*  m_size*  ::log( (double)m_size);
+
+  m_max_col =(size_type)::ceil(    ::sqrt(2*     m_load*  ::log(ln_arg) ) );
+
+#ifdef PB_DS_HT_MAP_RESIZE_TRACE_
+  std::cerr << "chmccrt::calc_max_num_coll " <<
+    static_cast<unsigned long>(m_size) <<    "    " <<
+    static_cast<unsigned long>(m_max_col) << std::endl;
+#endif // #ifdef PB_DS_HT_MAP_RESIZE_TRACE_
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+notify_externally_resized(size_type new_size)
+{
+  notify_resized(new_size);
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+swap(PB_DS_CLASS_C_DEC& other)
+{
+  std::swap(m_load, other.m_load);
+
+  std::swap(m_size, other.m_size);
+
+  std::swap(m_num_col, other.m_num_col);
+
+  std::swap(m_max_col, other.m_max_col);
+
+  std::swap(m_resize_needed, other.m_resize_needed);
+}
+
+PB_DS_CLASS_T_DEC
+inline float
+PB_DS_CLASS_C_DEC::
+get_load() const
+{
+  PB_DS_STATIC_ASSERT(access, external_load_access);
+
+  return (m_load);
+}
+
+PB_DS_CLASS_T_DEC
+inline void
+PB_DS_CLASS_C_DEC::
+calc_resize_needed()
+{
+  m_resize_needed =
+    m_resize_needed || m_num_col >= m_max_col;
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+set_load(float load)
+{
+  PB_DS_STATIC_ASSERT(access, external_load_access);
+
+  m_load = load;
+
+  calc_max_num_coll();
+
+  calc_resize_needed();
+}
+
+#undef PB_DS_STATIC_ASSERT
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/resize_policy/hash_exponential_size_policy_imp.hpp b/libstdc++-v3/include/ext/pb_ds/detail/resize_policy/hash_exponential_size_policy_imp.hpp
new file mode 100644
index 00000000000..ca98d9b5086
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/resize_policy/hash_exponential_size_policy_imp.hpp
@@ -0,0 +1,106 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file hash_exponential_size_policy_imp.hpp
+ * Contains a resize size policy implementation.
+ */
+
+PB_DS_CLASS_T_DEC
+PB_DS_CLASS_C_DEC::
+hash_exponential_size_policy(size_type start_size, size_type grow_factor) :
+  m_start_size(start_size),
+  m_grow_factor(grow_factor)
+{ }
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+swap(PB_DS_CLASS_C_DEC& other)
+{
+  std::swap(m_start_size, other.m_start_size);
+
+  std::swap(m_grow_factor, other.m_grow_factor);
+}
+
+PB_DS_CLASS_T_DEC
+typename PB_DS_CLASS_C_DEC::size_type
+PB_DS_CLASS_C_DEC::
+get_nearest_larger_size(size_type size) const
+{
+  size_type ret = m_start_size;
+
+  while (ret <= size)
+    {
+      const size_type next_ret = ret*  m_grow_factor;
+
+      if (next_ret < ret)
+	throw insert_error();
+
+      ret = next_ret;
+    }
+
+  return (ret);
+}
+
+PB_DS_CLASS_T_DEC
+typename PB_DS_CLASS_C_DEC::size_type
+PB_DS_CLASS_C_DEC::
+get_nearest_smaller_size(size_type size) const
+{
+  size_type ret = m_start_size;
+
+  while (true)
+    {
+      const size_type next_ret = ret*  m_grow_factor;
+
+      if (next_ret < ret)
+	throw resize_error();
+
+      if (next_ret >= size)
+	return (ret);
+
+      ret = next_ret;
+    }
+
+  return (ret);
+}
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/resize_policy/hash_load_check_resize_trigger_imp.hpp b/libstdc++-v3/include/ext/pb_ds/detail/resize_policy/hash_load_check_resize_trigger_imp.hpp
new file mode 100644
index 00000000000..2b05dd1d176
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/resize_policy/hash_load_check_resize_trigger_imp.hpp
@@ -0,0 +1,359 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file hash_load_check_resize_trigger_imp.hpp
+ * Contains a resize trigger implementation.
+ */
+
+#define PB_DS_STATIC_ASSERT(UNIQUE, E)					\
+  typedef detail::static_assert_dumclass<sizeof(detail::static_assert<(bool)(E)>)> \
+  UNIQUE##static_assert_type
+
+PB_DS_CLASS_T_DEC
+PB_DS_CLASS_C_DEC::
+hash_load_check_resize_trigger(float load_min, float load_max) :
+  m_load_min(load_min),
+  m_load_max(load_max),
+  m_next_shrink_size(0),
+  m_next_grow_size(0),
+  m_resize_needed(false)
+{
+  PB_DS_DBG_ONLY(assert_valid();)
+    }
+
+PB_DS_CLASS_T_DEC
+inline void
+PB_DS_CLASS_C_DEC::
+notify_find_search_start()
+{
+  PB_DS_DBG_ONLY(assert_valid();)
+    }
+
+PB_DS_CLASS_T_DEC
+inline void
+PB_DS_CLASS_C_DEC::
+notify_find_search_collision()
+{
+  PB_DS_DBG_ONLY(assert_valid();)
+    }
+
+PB_DS_CLASS_T_DEC
+inline void
+PB_DS_CLASS_C_DEC::
+notify_find_search_end()
+{
+  PB_DS_DBG_ONLY(assert_valid();)
+    }
+
+PB_DS_CLASS_T_DEC
+inline void
+PB_DS_CLASS_C_DEC::
+notify_insert_search_start()
+{
+  PB_DS_DBG_ONLY(assert_valid();)
+    }
+
+PB_DS_CLASS_T_DEC
+inline void
+PB_DS_CLASS_C_DEC::
+notify_insert_search_collision()
+{
+  PB_DS_DBG_ONLY(assert_valid();)
+    }
+
+PB_DS_CLASS_T_DEC
+inline void
+PB_DS_CLASS_C_DEC::
+notify_insert_search_end()
+{
+  PB_DS_DBG_ONLY(assert_valid();)
+    }
+
+PB_DS_CLASS_T_DEC
+inline void
+PB_DS_CLASS_C_DEC::
+notify_erase_search_start()
+{
+  PB_DS_DBG_ONLY(assert_valid();)
+    }
+
+PB_DS_CLASS_T_DEC
+inline void
+PB_DS_CLASS_C_DEC::
+notify_erase_search_collision()
+{
+  PB_DS_DBG_ONLY(assert_valid();)
+    }
+
+PB_DS_CLASS_T_DEC
+inline void
+PB_DS_CLASS_C_DEC::
+notify_erase_search_end()
+{
+  PB_DS_DBG_ONLY(assert_valid();)
+    }
+
+PB_DS_CLASS_T_DEC
+inline void
+PB_DS_CLASS_C_DEC::
+notify_inserted(size_type num_entries)
+{
+  m_resize_needed = (num_entries >= m_next_grow_size);
+
+  size_base::set_size(num_entries);
+
+  PB_DS_DBG_ONLY(assert_valid();)
+    }
+
+PB_DS_CLASS_T_DEC
+inline void
+PB_DS_CLASS_C_DEC::
+notify_erased(size_type num_entries)
+{
+  size_base::set_size(num_entries);
+
+  m_resize_needed =
+    num_entries <= m_next_shrink_size;
+
+  PB_DS_DBG_ONLY(assert_valid();)
+    }
+
+PB_DS_CLASS_T_DEC
+inline bool
+PB_DS_CLASS_C_DEC::
+is_resize_needed() const
+{
+  PB_DS_DBG_ONLY(assert_valid();)
+
+    return (m_resize_needed);
+}
+
+PB_DS_CLASS_T_DEC
+inline bool
+PB_DS_CLASS_C_DEC::
+is_grow_needed(size_type /*size*/, size_type num_entries) const
+{
+  PB_DS_DBG_ASSERT(m_resize_needed);
+
+  return (num_entries >= m_next_grow_size);
+}
+
+PB_DS_CLASS_T_DEC
+PB_DS_CLASS_C_DEC::
+~hash_load_check_resize_trigger()
+{ }
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+notify_resized(size_type new_size)
+{
+  m_resize_needed = false;
+
+  m_next_grow_size =
+    size_type(m_load_max*  new_size - 1);
+
+  m_next_shrink_size =
+    size_type(m_load_min*  new_size);
+
+#ifdef PB_DS_HT_MAP_RESIZE_TRACE_
+  std::cerr << "hlcrt::notify_resized " <<
+    static_cast<unsigned long>(new_size) <<    "    " <<
+    static_cast<unsigned long>(m_load_min) <<    "    " <<
+    static_cast<unsigned long>(m_load_max) <<    "    " <<
+    static_cast<unsigned long>(m_next_shrink_size) << " " <<
+    static_cast<unsigned long>(m_next_grow_size) <<    "    " << std::endl;
+#endif // #ifdef PB_DS_HT_MAP_RESIZE_TRACE_
+
+  PB_DS_DBG_ONLY(assert_valid();)
+    }
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+notify_externally_resized(size_type new_size)
+{
+  m_resize_needed = false;
+
+  size_type new_grow_size =
+    size_type(m_load_max*  new_size - 1);
+
+  size_type new_shrink_size =
+    size_type(m_load_min*  new_size );
+
+  if (new_grow_size >= m_next_grow_size)
+    {
+      PB_DS_DBG_ASSERT(new_shrink_size > m_next_shrink_size);
+
+      m_next_grow_size = new_grow_size;
+
+      PB_DS_DBG_ONLY(assert_valid();)
+
+#ifdef PB_DS_HT_MAP_RESIZE_TRACE_
+	std::cerr << "hlcrt::notify_externally_resized1 " <<
+        static_cast<unsigned long>(new_size) <<    "    " <<
+        static_cast<unsigned long>(m_load_min) <<    "    " <<
+        static_cast<unsigned long>(m_load_max) <<    "    " <<
+        static_cast<unsigned long>(m_next_shrink_size) << " " <<
+        static_cast<unsigned long>(m_next_grow_size) <<    "    " << std::endl;
+#endif // #ifdef PB_DS_HT_MAP_RESIZE_TRACE_
+
+      return;
+    }
+
+  PB_DS_DBG_ASSERT(new_shrink_size <= m_next_shrink_size);
+
+  m_next_shrink_size = new_shrink_size;
+
+#ifdef PB_DS_HT_MAP_RESIZE_TRACE_
+  std::cerr << "hlcrt::notify_externally_resized2 " <<
+    static_cast<unsigned long>(new_size) <<    "    " <<
+    static_cast<unsigned long>(m_load_min) <<    "    " <<
+    static_cast<unsigned long>(m_load_max) <<    "    " <<
+    static_cast<unsigned long>(m_next_shrink_size) << " " <<
+    static_cast<unsigned long>(m_next_grow_size) <<    "    " << std::endl;
+#endif // #ifdef PB_DS_HT_MAP_RESIZE_TRACE_
+
+  PB_DS_DBG_ONLY(assert_valid();)
+    }
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+notify_cleared()
+{
+  PB_DS_DBG_ONLY(assert_valid();)
+
+    size_base::set_size(0);
+
+  m_resize_needed = (0 < m_next_shrink_size);
+
+  PB_DS_DBG_ONLY(assert_valid();)
+    }
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+swap(PB_DS_CLASS_C_DEC& other)
+{
+  PB_DS_DBG_ONLY(assert_valid();)
+    PB_DS_DBG_ONLY(other.assert_valid();)
+
+    size_base::swap(other);
+
+  std::swap(m_load_min, other.m_load_min);
+  std::swap(m_load_max, other.m_load_max);
+
+  std::swap(m_resize_needed, other.m_resize_needed);
+
+  std::swap(m_next_grow_size, other.m_next_grow_size);
+  std::swap(m_next_shrink_size, other.m_next_shrink_size);
+
+  PB_DS_DBG_ONLY(assert_valid();)
+    PB_DS_DBG_ONLY(other.assert_valid();)
+    }
+
+PB_DS_CLASS_T_DEC
+inline std::pair<float, float>
+PB_DS_CLASS_C_DEC::
+get_loads() const
+{
+  PB_DS_STATIC_ASSERT(access, external_load_access);
+
+  return (std::make_pair(m_load_min, m_load_max));
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+set_loads(std::pair<float, float> load_pair)
+{
+  PB_DS_STATIC_ASSERT(access, external_load_access);
+
+  const float old_load_min = m_load_min;
+  const float old_load_max = m_load_max;
+  const size_type old_next_shrink_size = m_next_shrink_size;
+  const size_type old_next_grow_size = m_next_grow_size;
+  const bool old_resize_needed = m_resize_needed;
+
+  try
+    {
+      m_load_min = load_pair.first;
+      m_load_max = load_pair.second;
+
+      do_resize(static_cast<size_type>(
+				       size_base::get_size() / ((m_load_min + m_load_max) / 2)));
+    }
+  catch(...)
+    {
+      m_load_min = old_load_min;
+      m_load_max = old_load_max;
+      m_next_shrink_size = old_next_shrink_size;
+      m_next_grow_size = old_next_grow_size;
+      m_resize_needed = old_resize_needed;
+
+      throw;
+    }
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+do_resize(size_type /*new_size*/)
+{
+  abort();
+}
+
+#ifdef PB_DS_HASH_POLICY_DEBUG
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+assert_valid() const
+{
+  PB_DS_DBG_ASSERT(m_load_max > m_load_min);
+
+  PB_DS_DBG_ASSERT(m_next_grow_size >= m_next_shrink_size);
+}
+#endif // #ifdef PB_DS_HASH_POLICY_DEBUG
+
+#undef PB_DS_STATIC_ASSERT
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/resize_policy/hash_load_check_resize_trigger_size_base.hpp b/libstdc++-v3/include/ext/pb_ds/detail/resize_policy/hash_load_check_resize_trigger_size_base.hpp
new file mode 100644
index 00000000000..488f4c521e6
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/resize_policy/hash_load_check_resize_trigger_size_base.hpp
@@ -0,0 +1,172 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file hash_load_check_resize_trigger_size_base.hpp
+ * Contains an base holding size for some resize policies.
+ */
+
+#ifndef PB_DS_HASH_LOAD_CHECK_RESIZE_TRIGGER_SIZE_BASE_HPP
+#define PB_DS_HASH_LOAD_CHECK_RESIZE_TRIGGER_SIZE_BASE_HPP
+
+namespace pb_ds
+{
+
+  namespace detail
+  {
+
+    template<typename Size_Type, bool Hold_Size>
+    class hash_load_check_resize_trigger_size_base;
+
+#define PB_DS_CLASS_T_DEC			\
+    template<typename Size_Type>
+
+#define PB_DS_CLASS_C_DEC						\
+    hash_load_check_resize_trigger_size_base<				\
+								Size_Type, \
+								true>
+
+    template<typename Size_Type>
+    class hash_load_check_resize_trigger_size_base<
+      Size_Type,
+      true>
+    {
+    protected:
+      typedef Size_Type size_type;
+
+    protected:
+      inline
+      hash_load_check_resize_trigger_size_base();
+
+      inline void
+      swap(PB_DS_CLASS_C_DEC& other);
+
+      inline void
+      set_size(size_type size);
+
+      inline size_type
+      get_size() const;
+
+    private:
+      size_type m_size;
+    };
+
+    PB_DS_CLASS_T_DEC
+    PB_DS_CLASS_C_DEC::
+    hash_load_check_resize_trigger_size_base() :
+      m_size(0)
+    { }
+
+    PB_DS_CLASS_T_DEC
+    inline void
+    PB_DS_CLASS_C_DEC::
+    set_size(size_type size)
+    {
+      m_size = size;
+    }
+
+    PB_DS_CLASS_T_DEC
+    inline typename PB_DS_CLASS_C_DEC::size_type
+    PB_DS_CLASS_C_DEC::
+    get_size() const
+    {
+      return (m_size);
+    }
+
+    PB_DS_CLASS_T_DEC
+    inline void
+    PB_DS_CLASS_C_DEC::
+    swap(PB_DS_CLASS_C_DEC& other)
+    {
+      std::swap(m_size, other.m_size);
+    }
+
+#undef PB_DS_CLASS_T_DEC
+
+#undef PB_DS_CLASS_C_DEC
+
+#define PB_DS_CLASS_T_DEC			\
+    template<typename Size_Type>
+
+#define PB_DS_CLASS_C_DEC						\
+    hash_load_check_resize_trigger_size_base<				\
+								Size_Type, \
+								false>
+
+    template<typename Size_Type>
+    class hash_load_check_resize_trigger_size_base<
+      Size_Type,
+      false>
+    {
+    protected:
+      typedef Size_Type size_type;
+
+    protected:
+      inline void
+      swap(PB_DS_CLASS_C_DEC& other);
+
+      inline void
+      set_size(size_type size);
+    };
+
+    PB_DS_CLASS_T_DEC
+    inline void
+    PB_DS_CLASS_C_DEC::
+    swap(PB_DS_CLASS_C_DEC& /*other*/)
+    { }
+
+    PB_DS_CLASS_T_DEC
+    inline void
+    PB_DS_CLASS_C_DEC::
+    set_size(size_type /*size*/)
+    {
+      // Do nothing
+    }
+
+#undef PB_DS_CLASS_T_DEC
+
+#undef PB_DS_CLASS_C_DEC
+
+  } // namespace detail
+
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_HASH_LOAD_CHECK_RESIZE_TRIGGER_SIZE_BASE_HPP
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/resize_policy/hash_prime_size_policy_imp.hpp b/libstdc++-v3/include/ext/pb_ds/detail/resize_policy/hash_prime_size_policy_imp.hpp
new file mode 100644
index 00000000000..3d262ad6730
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/resize_policy/hash_prime_size_policy_imp.hpp
@@ -0,0 +1,142 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file hash_prime_size_policy_imp.hpp
+ * Contains a resize size policy implementation.
+ */
+
+namespace detail
+{
+
+  enum
+    {
+      num_distinct_sizes = 31
+    };
+
+  // Taken from the SGI implementation; acknowledged in the docs.
+
+  static const std::size_t g_a_sizes[num_distinct_sizes] =
+    {
+      /* Dealing cards... */
+      /* 0    */ 5ul,
+      /* 1    */ 11ul,
+      /* 2    */ 23ul,
+      /* 3    */ 53ul,
+      /* 4    */ 97ul,
+      /* 5    */ 193ul,
+      /* 6    */ 389ul,
+      /* 7    */ 769ul,
+      /* 8    */ 1543ul,
+      /* 9    */ 3079ul,
+      /* 10    */ 6151ul,
+      /* 11     */ 12289ul,
+      /* 12     */ 24593ul,
+      /* 13    */ 49157ul,
+      /* 14    */ 98317ul,
+      /* 15    */ 196613ul,
+      /* 16    */ 393241ul,
+      /* 17    */ 786433ul,
+      /* 18    */ 1572869ul,
+      /* 19    */ 3145739ul,
+      /* 20    */ 6291469ul,
+      /* 21    */ 12582917ul,
+      /* 22    */ 25165843ul,
+      /* 23    */ 50331653ul,
+      /* 24    */ 100663319ul,
+      /* 25    */ 201326611ul,
+      /* 26    */ 402653189ul,
+      /* 27    */ 805306457ul,
+      /* 28    */ 1610612741,
+      /* 29    */ 3221225473ul,
+      /* 30    */ 4294967291ul
+      /* Pot's good, let's play */
+    };
+
+} // namespace detail
+
+PB_DS_CLASS_T_DEC
+inline
+PB_DS_CLASS_C_DEC::
+hash_prime_size_policy(size_type start_size) :
+  m_start_size(start_size)
+{
+  m_start_size =
+    get_nearest_larger_size(start_size);
+}
+
+PB_DS_CLASS_T_DEC
+inline void
+PB_DS_CLASS_C_DEC::
+swap(PB_DS_CLASS_C_DEC& other)
+{
+  std::swap(m_start_size, other.m_start_size);
+}
+
+PB_DS_CLASS_T_DEC
+inline PB_DS_CLASS_C_DEC::size_type
+PB_DS_CLASS_C_DEC::
+get_nearest_larger_size(size_type size) const
+{
+  const std::size_t* const p_upper =
+    std::upper_bound(            detail::g_a_sizes, detail::g_a_sizes + detail::num_distinct_sizes, size);
+
+  if (p_upper == detail::g_a_sizes + detail::num_distinct_sizes)
+    throw resize_error();
+
+  return (*p_upper);
+}
+
+PB_DS_CLASS_T_DEC
+inline PB_DS_CLASS_C_DEC::size_type
+PB_DS_CLASS_C_DEC::
+get_nearest_smaller_size(size_type size) const
+{
+  const size_t* p_lower = std::lower_bound(        detail::g_a_sizes, detail::g_a_sizes + detail::num_distinct_sizes, size);
+
+  if (*p_lower >= size&&  p_lower != detail::g_a_sizes)
+    --p_lower;
+
+  if (*p_lower < m_start_size)
+    return (m_start_size);
+
+  return (*p_lower);
+}
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/resize_policy/hash_standard_resize_policy_imp.hpp b/libstdc++-v3/include/ext/pb_ds/detail/resize_policy/hash_standard_resize_policy_imp.hpp
new file mode 100644
index 00000000000..460528a0dc1
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/resize_policy/hash_standard_resize_policy_imp.hpp
@@ -0,0 +1,314 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file hash_standard_resize_policy_imp.hpp
+ * Contains a resize policy implementation.
+ */
+
+#define PB_DS_STATIC_ASSERT(UNIQUE, E)					\
+  typedef detail::static_assert_dumclass<sizeof(detail::static_assert<(bool)(E)>)> \
+  UNIQUE##static_assert_type
+
+PB_DS_CLASS_T_DEC
+PB_DS_CLASS_C_DEC::
+hash_standard_resize_policy() :
+  m_size(Size_Policy::get_nearest_larger_size(1))
+{
+  trigger_policy_base::notify_externally_resized(m_size);
+}
+
+PB_DS_CLASS_T_DEC
+PB_DS_CLASS_C_DEC::
+hash_standard_resize_policy(const Size_Policy& r_size_policy) :
+  Size_Policy(r_size_policy),
+  m_size(Size_Policy::get_nearest_larger_size(1))
+{
+  trigger_policy_base::notify_externally_resized(m_size);
+}
+
+PB_DS_CLASS_T_DEC
+PB_DS_CLASS_C_DEC::
+hash_standard_resize_policy(const Size_Policy& r_size_policy, const Trigger_Policy& r_trigger_policy) :
+  Size_Policy(r_size_policy),
+  Trigger_Policy(r_trigger_policy),
+  m_size(Size_Policy::get_nearest_larger_size(1))
+{
+  trigger_policy_base::notify_externally_resized(m_size);
+}
+
+PB_DS_CLASS_T_DEC
+PB_DS_CLASS_C_DEC::
+~hash_standard_resize_policy()
+{ }
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+swap(PB_DS_CLASS_C_DEC& other)
+{
+  trigger_policy_base::swap(other);
+
+  size_policy_base::swap(other);
+
+  std::swap(m_size, other.m_size);
+}
+
+PB_DS_CLASS_T_DEC
+inline void
+PB_DS_CLASS_C_DEC::
+notify_find_search_start()
+{
+  trigger_policy_base::notify_find_search_start();
+}
+
+PB_DS_CLASS_T_DEC
+inline void
+PB_DS_CLASS_C_DEC::
+notify_find_search_collision()
+{
+  trigger_policy_base::notify_find_search_collision();
+}
+
+PB_DS_CLASS_T_DEC
+inline void
+PB_DS_CLASS_C_DEC::
+notify_find_search_end()
+{
+  trigger_policy_base::notify_find_search_end();
+}
+
+PB_DS_CLASS_T_DEC
+inline void
+PB_DS_CLASS_C_DEC::
+notify_insert_search_start()
+{
+  trigger_policy_base::notify_insert_search_start();
+}
+
+PB_DS_CLASS_T_DEC
+inline void
+PB_DS_CLASS_C_DEC::
+notify_insert_search_collision()
+{
+  trigger_policy_base::notify_insert_search_collision();
+}
+
+PB_DS_CLASS_T_DEC
+inline void
+PB_DS_CLASS_C_DEC::
+notify_insert_search_end()
+{
+  trigger_policy_base::notify_insert_search_end();
+}
+
+PB_DS_CLASS_T_DEC
+inline void
+PB_DS_CLASS_C_DEC::
+notify_erase_search_start()
+{
+  trigger_policy_base::notify_erase_search_start();
+}
+
+PB_DS_CLASS_T_DEC
+inline void
+PB_DS_CLASS_C_DEC::
+notify_erase_search_collision()
+{
+  trigger_policy_base::notify_erase_search_collision();
+}
+
+PB_DS_CLASS_T_DEC
+inline void
+PB_DS_CLASS_C_DEC::
+notify_erase_search_end()
+{
+  trigger_policy_base::notify_erase_search_end();
+}
+
+PB_DS_CLASS_T_DEC
+inline void
+PB_DS_CLASS_C_DEC::
+notify_inserted(size_type num_e)
+{
+  trigger_policy_base::notify_inserted(num_e);
+}
+
+PB_DS_CLASS_T_DEC
+inline void
+PB_DS_CLASS_C_DEC::
+notify_erased(size_type num_e)
+{
+  trigger_policy_base::notify_erased(num_e);
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+notify_cleared()
+{
+  trigger_policy_base::notify_cleared();
+}
+
+PB_DS_CLASS_T_DEC
+inline bool
+PB_DS_CLASS_C_DEC::
+is_resize_needed() const
+{
+  return (trigger_policy_base::is_resize_needed());
+}
+
+PB_DS_CLASS_T_DEC
+typename PB_DS_CLASS_C_DEC::size_type
+PB_DS_CLASS_C_DEC::
+get_new_size(size_type size, size_type num_used_e) const
+{
+  if (trigger_policy_base::
+      is_grow_needed(size, num_used_e))
+    return (size_policy_base::get_nearest_larger_size(size));
+
+  return (size_policy_base::get_nearest_smaller_size(size));
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+notify_resized(size_type new_size)
+{
+  trigger_policy_base::notify_resized(new_size);
+
+  m_size = new_size;
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::size_type
+PB_DS_CLASS_C_DEC::
+get_actual_size() const
+{
+  PB_DS_STATIC_ASSERT(access, external_size_access);
+
+  return (m_size);
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+resize(size_type new_size)
+{
+  PB_DS_STATIC_ASSERT(access, external_size_access);
+
+  size_type actual_new_size = size_policy_base::get_nearest_larger_size(1);
+  while (actual_new_size < new_size)
+    {
+      const size_type pot =
+	size_policy_base::get_nearest_larger_size(actual_new_size);
+
+      if (pot == actual_new_size&&  pot < new_size)
+	throw resize_error();
+
+      actual_new_size = pot;
+    }
+
+  if (actual_new_size > 0)
+    --actual_new_size;
+
+  const size_type old_size = m_size;
+
+  try
+    {
+      do_resize(actual_new_size - 1);
+    }
+  catch(insert_error& )
+    {
+      m_size = old_size;
+
+      throw resize_error();
+    }
+  catch(...)
+    {
+      m_size = old_size;
+
+      throw;
+    }
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+do_resize(size_type /*new_size*/)
+{
+  // Do nothing
+}
+
+PB_DS_CLASS_T_DEC
+Trigger_Policy& 
+PB_DS_CLASS_C_DEC::
+get_trigger_policy()
+{
+  return (*this);
+}
+
+PB_DS_CLASS_T_DEC
+const Trigger_Policy& 
+PB_DS_CLASS_C_DEC::
+get_trigger_policy() const
+{
+  return (*this);
+}
+
+PB_DS_CLASS_T_DEC
+Size_Policy& 
+PB_DS_CLASS_C_DEC::
+get_size_policy()
+{
+  return (*this);
+}
+
+PB_DS_CLASS_T_DEC
+const Size_Policy& 
+PB_DS_CLASS_C_DEC::
+get_size_policy() const
+{
+  return (*this);
+}
+
+#undef PB_DS_STATIC_ASSERT
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/resize_policy/sample_resize_policy.hpp b/libstdc++-v3/include/ext/pb_ds/detail/resize_policy/sample_resize_policy.hpp
new file mode 100644
index 00000000000..371ce31975b
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/resize_policy/sample_resize_policy.hpp
@@ -0,0 +1,135 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file sample_resize_policy.hpp
+ * Contains a sample resize policy for hash tables.
+ */
+
+#ifndef PB_DS_SAMPLE_RESIZE_POLICY_HPP
+#define PB_DS_SAMPLE_RESIZE_POLICY_HPP
+
+// A sample resize policy.
+class sample_resize_policy
+{
+
+public:
+
+  // Size type.
+  typedef size_t size_type;
+
+public:
+
+  // Default constructor.
+  sample_resize_policy();
+
+  // Copy constructor.
+  sample_range_hashing(const sample_resize_policy& other);
+
+  // Swaps content.
+  inline void
+  swap(sample_resize_policy& other);
+
+protected:
+
+  // Notifies a search started.
+  inline void
+  notify_insert_search_start();
+
+  // Notifies a search encountered a collision.
+  inline void
+  notify_insert_search_collision();
+
+  // Notifies a search ended.
+  inline void
+  notify_insert_search_end();
+
+  // Notifies a search started.
+  inline void
+  notify_find_search_start();
+
+  // Notifies a search encountered a collision.
+  inline void
+  notify_find_search_collision();
+
+  // Notifies a search ended.
+  inline void
+  notify_find_search_end();
+
+  // Notifies a search started.
+  inline void
+  notify_erase_search_start();
+
+  // Notifies a search encountered a collision.
+  inline void
+  notify_erase_search_collision();
+
+  // Notifies a search ended.
+  inline void
+  notify_erase_search_end();
+
+  // Notifies an element was inserted.
+  inline void
+  notify_inserted(size_type num_e);
+
+  // Notifies an element was erased.
+  inline void
+  notify_erased(size_type num_e);
+
+  // Notifies the table was cleared.
+  void
+  notify_cleared();
+
+  // Notifies the table was resized to new_size.
+  void
+  notify_resized(size_type new_size);
+
+  // Queries whether a resize is needed.
+  inline bool
+  is_resize_needed() const;
+
+  // Queries what the new size should be.
+  size_type
+  get_new_size(size_type size, size_type num_used_e) const;
+
+};
+
+#endif // #ifndef PB_DS_SAMPLE_RESIZE_POLICY_HPP
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/resize_policy/sample_resize_trigger.hpp b/libstdc++-v3/include/ext/pb_ds/detail/resize_policy/sample_resize_trigger.hpp
new file mode 100644
index 00000000000..f85fe231f3e
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/resize_policy/sample_resize_trigger.hpp
@@ -0,0 +1,147 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file sample_resize_trigger.hpp
+ * Contains a sample resize trigger policy class.
+ */
+
+#ifndef PB_DS_SAMPLE_RESIZE_TRIGGER_HPP
+#define PB_DS_SAMPLE_RESIZE_TRIGGER_HPP
+
+// A sample resize trigger policy.
+class sample_resize_trigger
+{
+
+public:
+
+  // Size type.
+  typedef size_t size_type;
+
+public:
+
+  // Default constructor.
+  sample_resize_trigger();
+
+  // Copy constructor.
+  sample_range_hashing(const sample_resize_trigger& other);
+
+  // Swaps content.
+  inline void
+  swap(sample_resize_trigger& other);
+
+protected:
+
+  // Notifies a search started.
+  inline void
+  notify_insert_search_start();
+
+  // Notifies a search encountered a collision.
+  inline void
+  notify_insert_search_collision();
+
+  // Notifies a search ended.
+  inline void
+  notify_insert_search_end();
+
+  // Notifies a search started.
+  inline void
+  notify_find_search_start();
+
+  // Notifies a search encountered a collision.
+  inline void
+  notify_find_search_collision();
+
+  // Notifies a search ended.
+  inline void
+  notify_find_search_end();
+
+  // Notifies a search started.
+  inline void
+  notify_erase_search_start();
+
+  // Notifies a search encountered a collision.
+  inline void
+  notify_erase_search_collision();
+
+  // Notifies a search ended.
+  inline void
+  notify_erase_search_end();
+
+  // Notifies an element was inserted. the total number of entries in the table is num_entries.
+  inline void
+  notify_inserted(size_type num_entries);
+
+  // Notifies an element was erased.
+  inline void
+  notify_erased(size_type num_entries);
+
+  // Notifies the table was cleared.
+  void
+  notify_cleared();
+
+  // Notifies the table was resized as a result of this object's signifying that a resize is needed.
+  void
+  notify_resized(size_type new_size);
+
+  // Notifies the table was resized externally.
+  void
+  notify_externally_resized(size_type new_size);
+
+  // Queries whether a resize is needed.
+  inline bool
+  is_resize_needed() const;
+
+  // Queries whether a grow is needed.
+  inline bool
+  is_grow_needed(size_type size, size_type num_entries) const;
+
+private:
+
+  // Resizes to new_size.
+  virtual void
+  do_resize(size_type new_size);
+
+};
+
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_SAMPLE_RESIZE_TRIGGER_HPP
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/resize_policy/sample_size_policy.hpp b/libstdc++-v3/include/ext/pb_ds/detail/resize_policy/sample_size_policy.hpp
new file mode 100644
index 00000000000..9681c872e0d
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/resize_policy/sample_size_policy.hpp
@@ -0,0 +1,83 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file sample_size_policy.hpp
+ * Contains a sample size resize-policy.
+ */
+
+#ifndef PB_DS_SAMPLE_SIZE_POLICY_HPP
+#define PB_DS_SAMPLE_SIZE_POLICY_HPP
+
+// A sample size policy.
+class sample_size_policy
+{
+
+public:
+
+  // Size type.
+  typedef size_t size_type;
+
+public:
+
+  // Default constructor.
+  sample_size_policy();
+
+  // Copy constructor.
+  sample_range_hashing(const sample_size_policy& other);
+
+  // Swaps content.
+  inline void
+  swap(sample_size_policy& other);
+
+protected:
+
+  // Given a __size size, returns a __size that is larger.
+  inline size_type
+  get_nearest_larger_size(size_type size) const;
+
+  // Given a __size size, returns a __size that is smaller.
+  inline size_type
+  get_nearest_smaller_size(size_type size) const;
+
+};
+
+#endif // #ifndef PB_DS_SAMPLE_SIZE_POLICY_HPP
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/splay_tree_/constructors_destructor_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/splay_tree_/constructors_destructor_fn_imps.hpp
new file mode 100644
index 00000000000..07ba7cf3ca2
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/splay_tree_/constructors_destructor_fn_imps.hpp
@@ -0,0 +1,116 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file constructors_destructor_fn_imps.hpp
+ * Contains an implementation class for splay_tree_.
+ */
+
+PB_DS_CLASS_T_DEC
+template<typename It>
+void
+PB_DS_CLASS_C_DEC::
+copy_from_range(It first_it, It last_it)
+{
+  while (first_it != last_it)
+    insert(*(first_it++));
+}
+
+PB_DS_CLASS_T_DEC
+PB_DS_CLASS_C_DEC::
+PB_DS_CLASS_NAME()
+{
+  initialize();
+
+  PB_DS_DBG_ONLY(assert_valid();)
+    }
+
+PB_DS_CLASS_T_DEC
+PB_DS_CLASS_C_DEC::
+PB_DS_CLASS_NAME(const Cmp_Fn& r_cmp_fn) :
+  PB_DS_BASE_C_DEC(r_cmp_fn)
+{
+  initialize();
+
+  PB_DS_DBG_ONLY(assert_valid();)
+    }
+
+PB_DS_CLASS_T_DEC
+PB_DS_CLASS_C_DEC::
+PB_DS_CLASS_NAME(const Cmp_Fn& r_cmp_fn, const node_update& r_node_update) :
+  PB_DS_BASE_C_DEC(r_cmp_fn, r_node_update)
+{
+  initialize();
+
+  PB_DS_DBG_ONLY(assert_valid();)
+    }
+
+PB_DS_CLASS_T_DEC
+PB_DS_CLASS_C_DEC::
+PB_DS_CLASS_NAME(const PB_DS_CLASS_C_DEC& other) :
+  PB_DS_BASE_C_DEC(other)
+{
+  initialize();
+
+  PB_DS_DBG_ONLY(assert_valid();)
+    }
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+swap(PB_DS_CLASS_C_DEC& other)
+{
+  PB_DS_DBG_ONLY(assert_valid();)
+    PB_DS_DBG_ONLY(other.assert_valid();)
+
+    PB_DS_BASE_C_DEC::swap(other);
+
+  PB_DS_DBG_ONLY(assert_valid();)
+    PB_DS_DBG_ONLY(other.assert_valid();)
+    }
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+initialize()
+{
+  PB_DS_BASE_C_DEC::m_p_head->m_special = true;
+}
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/splay_tree_/debug_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/splay_tree_/debug_fn_imps.hpp
new file mode 100644
index 00000000000..dc5bb05f430
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/splay_tree_/debug_fn_imps.hpp
@@ -0,0 +1,86 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file debug_fn_imps.hpp
+ * Contains an implementation class for splay_tree_.
+ */
+
+#ifdef PB_DS_SPLAY_TREE_DEBUG_
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+assert_valid() const
+{
+  PB_DS_BASE_C_DEC::assert_valid();
+
+  const node_pointer p_head = PB_DS_BASE_C_DEC::m_p_head;
+
+  assert_special_imp(p_head);
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+assert_special_imp(const node_pointer p_nd) const
+{
+  if (p_nd == NULL)
+    return;
+
+  if (p_nd == PB_DS_BASE_C_DEC::m_p_head)
+    {
+      PB_DS_DBG_ASSERT(p_nd->m_special);
+
+      assert_special_imp(p_nd->m_p_parent);
+
+      return;
+    }
+
+  PB_DS_DBG_ASSERT(!p_nd->m_special);
+
+  assert_special_imp(p_nd->m_p_left);
+
+  assert_special_imp(p_nd->m_p_right);
+}
+
+#endif // #ifdef PB_DS_SPLAY_TREE_DEBUG_
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/splay_tree_/erase_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/splay_tree_/erase_fn_imps.hpp
new file mode 100644
index 00000000000..015eb783c4c
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/splay_tree_/erase_fn_imps.hpp
@@ -0,0 +1,202 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file erase_fn_imps.hpp
+ * Contains an implementation class for splay_tree_.
+ */
+
+PB_DS_CLASS_T_DEC
+inline bool
+PB_DS_CLASS_C_DEC::
+erase(const_key_reference r_key)
+{
+  point_iterator it = find(r_key);
+
+  if (it == PB_DS_BASE_C_DEC::end())
+    return (false);
+
+  erase(it);
+
+  return (true);
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::iterator
+PB_DS_CLASS_C_DEC::
+erase(iterator it)
+{
+  PB_DS_DBG_ONLY(assert_valid());
+
+  if (it == PB_DS_BASE_C_DEC::end())
+    return (it);
+
+  iterator ret_it = it;
+
+  ++ret_it;
+
+  erase_node(it.m_p_nd);
+
+  PB_DS_DBG_ONLY(assert_valid());
+
+  return (ret_it);
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::reverse_iterator
+PB_DS_CLASS_C_DEC::
+erase(reverse_iterator it)
+{
+  PB_DS_DBG_ONLY(assert_valid());
+
+  if (it.m_p_nd == PB_DS_BASE_C_DEC::m_p_head)
+    return (it);
+
+  reverse_iterator ret_it = it;
+
+  ++ret_it;
+
+  erase_node(it.m_p_nd);
+
+  PB_DS_DBG_ONLY(assert_valid());
+
+  return (ret_it);
+}
+
+PB_DS_CLASS_T_DEC
+template<typename Pred>
+inline typename PB_DS_CLASS_C_DEC::size_type
+PB_DS_CLASS_C_DEC::
+erase_if(Pred pred)
+{
+  PB_DS_DBG_ONLY(assert_valid();)
+
+    size_type num_ersd = 0;
+
+  iterator it = PB_DS_BASE_C_DEC::begin();
+
+  while (it != PB_DS_BASE_C_DEC::end())
+    {
+      if (pred(*it))
+        {
+	  ++num_ersd;
+
+	  it = erase(it);
+        }
+      else
+	++it;
+    }
+
+  PB_DS_DBG_ONLY(assert_valid();)
+
+    return (num_ersd);
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+erase_node(node_pointer p_nd)
+{
+  PB_DS_DBG_ASSERT(p_nd != NULL);
+
+  splay(p_nd);
+
+  PB_DS_DBG_ONLY(assert_valid();)
+    PB_DS_DBG_ASSERT(p_nd == this->m_p_head->m_p_parent);
+
+  node_pointer p_l = p_nd->m_p_left;
+  node_pointer p_r = p_nd->m_p_right;
+
+  PB_DS_BASE_C_DEC::update_min_max_for_erased_node(p_nd);
+
+  PB_DS_BASE_C_DEC::actual_erase_node(p_nd);
+
+  if (p_r == NULL)
+    {
+      PB_DS_BASE_C_DEC::m_p_head->m_p_parent = p_l;
+
+      if (p_l != NULL)
+	p_l->m_p_parent = PB_DS_BASE_C_DEC::m_p_head;
+
+      PB_DS_DBG_ONLY(assert_valid();)
+
+        return;
+    }
+
+  node_pointer p_target_r = leftmost(p_r);
+
+  PB_DS_DBG_ASSERT(p_target_r != NULL);
+
+  p_r->m_p_parent = PB_DS_BASE_C_DEC::m_p_head;
+
+  PB_DS_BASE_C_DEC::m_p_head->m_p_parent = p_r;
+
+  splay(p_target_r);
+
+  PB_DS_DBG_ONLY(p_target_r->m_p_left = NULL);
+
+  PB_DS_DBG_ASSERT(p_target_r->m_p_parent == this->m_p_head);
+
+  PB_DS_DBG_ASSERT(this->m_p_head->m_p_parent ==
+		   p_target_r);
+
+  p_target_r->m_p_left = p_l;
+
+  if (p_l != NULL)
+    p_l->m_p_parent = p_target_r;
+
+  PB_DS_DBG_ONLY(assert_valid();)
+
+    apply_update(p_target_r, (node_update* )this);
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::node_pointer
+PB_DS_CLASS_C_DEC::
+leftmost(node_pointer p_nd)
+{
+  PB_DS_DBG_ASSERT(p_nd != NULL);
+
+  while (p_nd->m_p_left != NULL)
+    p_nd = p_nd->m_p_left;
+
+  return (p_nd);
+}
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/splay_tree_/find_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/splay_tree_/find_fn_imps.hpp
new file mode 100644
index 00000000000..a0f9cc1cb68
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/splay_tree_/find_fn_imps.hpp
@@ -0,0 +1,117 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file find_fn_imps.hpp
+ * Contains an implementation class for splay_tree_.
+ */
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::point_iterator
+PB_DS_CLASS_C_DEC::
+find(const_key_reference r_key)
+{
+  node_pointer p_found = find_imp(r_key);
+
+  if (p_found != PB_DS_BASE_C_DEC::m_p_head)
+    splay(p_found);
+
+  return (point_iterator(p_found));
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::const_point_iterator
+PB_DS_CLASS_C_DEC::
+find(const_key_reference r_key) const
+{
+  const node_pointer p_found = find_imp(r_key);
+
+  if (p_found != PB_DS_BASE_C_DEC::m_p_head)
+    const_cast<PB_DS_CLASS_C_DEC* >(this)->splay(p_found);
+
+  return (point_iterator(p_found));
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::node_pointer
+PB_DS_CLASS_C_DEC::
+find_imp(const_key_reference r_key)
+{
+  PB_DS_DBG_ONLY(PB_DS_BASE_C_DEC::structure_only_assert_valid();)
+
+    node_pointer p_nd = PB_DS_BASE_C_DEC::m_p_head->m_p_parent;
+
+  while (p_nd != NULL)
+    if (!Cmp_Fn::operator()(PB_DS_V2F(p_nd->m_value), r_key))
+      {
+	if (!Cmp_Fn::operator()(r_key, PB_DS_V2F(p_nd->m_value)))
+	  return (p_nd);
+
+	p_nd = p_nd->m_p_left;
+      }
+    else
+      p_nd = p_nd->m_p_right;
+
+  return PB_DS_BASE_C_DEC::m_p_head;
+}
+
+PB_DS_CLASS_T_DEC
+inline const typename PB_DS_CLASS_C_DEC::node_pointer
+PB_DS_CLASS_C_DEC::
+find_imp(const_key_reference r_key) const
+{
+  PB_DS_DBG_ONLY(assert_valid();)
+
+    node_pointer p_nd = PB_DS_BASE_C_DEC::m_p_head->m_p_parent;
+
+  while (p_nd != NULL)
+    if (!Cmp_Fn::operator()(PB_DS_V2F(p_nd->m_value), r_key))
+      {
+	if (!Cmp_Fn::operator()(r_key, PB_DS_V2F(p_nd->m_value)))
+	  return (p_nd);
+
+	p_nd = p_nd->m_p_left;
+      }
+    else
+      p_nd = p_nd->m_p_right;
+
+  return PB_DS_BASE_C_DEC::m_p_head;
+}
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/splay_tree_/info_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/splay_tree_/info_fn_imps.hpp
new file mode 100644
index 00000000000..0d0736298dc
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/splay_tree_/info_fn_imps.hpp
@@ -0,0 +1,45 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file info_fn_imps.hpp
+ * Contains an implementation.
+ */
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/splay_tree_/insert_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/splay_tree_/insert_fn_imps.hpp
new file mode 100644
index 00000000000..a9af7ddb16f
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/splay_tree_/insert_fn_imps.hpp
@@ -0,0 +1,124 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file insert_fn_imps.hpp
+ * Contains an implementation class for splay_tree_.
+ */
+
+PB_DS_CLASS_T_DEC
+inline std::pair<typename PB_DS_CLASS_C_DEC::point_iterator, bool>
+PB_DS_CLASS_C_DEC::
+insert(const_reference r_value)
+{
+  PB_DS_DBG_ONLY(assert_valid();)
+
+    std::pair<point_iterator, bool> ins_pair =
+    insert_leaf_imp(r_value);
+
+  ins_pair.first.m_p_nd->m_special = false;
+
+  PB_DS_DBG_ONLY(assert_valid());
+
+  splay(ins_pair.first.m_p_nd);
+
+  PB_DS_DBG_ONLY(assert_valid());
+
+  return (ins_pair);
+}
+
+PB_DS_CLASS_T_DEC
+inline std::pair<typename PB_DS_CLASS_C_DEC::point_iterator, bool>
+PB_DS_CLASS_C_DEC::
+insert_leaf_imp(const_reference r_value)
+{
+  PB_DS_DBG_ONLY(PB_DS_BASE_C_DEC::structure_only_assert_valid();)
+
+    if (PB_DS_BASE_C_DEC::m_size == 0)
+      return (std::make_pair(
+			     PB_DS_BASE_C_DEC::insert_imp_empty(r_value),
+			     true));
+
+  node_pointer p_nd = PB_DS_BASE_C_DEC::m_p_head->m_p_parent;
+  node_pointer p_pot = PB_DS_BASE_C_DEC::m_p_head;
+
+  while (p_nd != NULL)
+    if (!Cmp_Fn::operator()(
+			    PB_DS_V2F(p_nd->m_value),
+			    PB_DS_V2F(r_value)))
+      {
+	if (!Cmp_Fn::operator()(
+				PB_DS_V2F(r_value),
+				PB_DS_V2F(p_nd->m_value)))
+	  {
+	    return std::make_pair(
+				  point_iterator(p_nd),
+				  false);
+	  }
+
+	p_pot = p_nd;
+
+	p_nd = p_nd->m_p_left;
+      }
+    else
+      p_nd = p_nd->m_p_right;
+
+  if (p_pot == PB_DS_BASE_C_DEC::m_p_head)
+    return (std::make_pair(
+			   PB_DS_BASE_C_DEC::insert_leaf_new(r_value,  PB_DS_BASE_C_DEC::m_p_head->m_p_right, false),
+			   true));
+
+  PB_DS_DBG_ONLY(PB_DS_BASE_C_DEC::check_key_does_not_exist(
+							    PB_DS_V2F(r_value)));
+
+  p_nd = p_pot->m_p_left;
+  if (p_nd == NULL)
+    return (std::make_pair(
+			   PB_DS_BASE_C_DEC::insert_leaf_new(                r_value, p_pot, true),
+			   true));
+
+  while (p_nd->m_p_right != NULL)
+    p_nd = p_nd->m_p_right;
+
+  return (std::make_pair(
+			 insert_leaf_new(r_value, p_nd, false),
+			 true));
+}
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/splay_tree_/node.hpp b/libstdc++-v3/include/ext/pb_ds/detail/splay_tree_/node.hpp
new file mode 100644
index 00000000000..2e3bb304784
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/splay_tree_/node.hpp
@@ -0,0 +1,171 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file node.hpp
+ * Contains an implementation struct for splay_tree_'s node.
+ */
+
+#ifndef PB_DS_SPLAY_TREE_NODE_HPP
+#define PB_DS_SPLAY_TREE_NODE_HPP
+
+namespace pb_ds
+{
+  namespace detail
+  {
+
+    template<typename Value_Type, class Metadata, class Allocator>
+    struct splay_tree_node_
+    {
+    public:
+      typedef
+      typename Allocator::template rebind<
+      splay_tree_node_<
+      Value_Type,
+      Metadata,
+      Allocator> >::other::pointer
+      node_pointer;
+
+      typedef Metadata metadata_type;
+
+      typedef
+      typename Allocator::template rebind<
+	metadata_type>::other::reference
+      metadata_reference;
+
+      typedef
+      typename Allocator::template rebind<
+	metadata_type>::other::const_reference
+      const_metadata_reference;
+
+#ifdef PB_DS_BIN_SEARCH_TREE_TRACE_
+      void
+      trace() const
+      {
+	std::cout << PB_DS_V2F(m_value) <<
+	  "(" << m_metadata << ")";
+      }
+#endif // #ifdef PB_DS_BIN_SEARCH_TREE_TRACE_
+
+    public:
+      inline bool
+      special() const
+      {
+	return (m_special);
+      }
+
+      inline const_metadata_reference
+      get_metadata() const
+      {
+	return (m_metadata);
+      }
+
+      inline metadata_reference
+      get_metadata()
+      {
+	return (m_metadata);
+      }
+
+    public:
+      typedef Value_Type value_type;
+
+      value_type m_value;
+
+      bool m_special;
+
+      node_pointer m_p_left;
+      node_pointer m_p_right;
+
+      node_pointer m_p_parent;
+
+      metadata_type m_metadata;
+    };
+
+    template<typename Value_Type, class Allocator>
+    struct splay_tree_node_<
+      Value_Type,
+      null_node_metadata,
+      Allocator>
+    {
+    public:
+      typedef
+      typename Allocator::template rebind<
+      splay_tree_node_<
+      Value_Type,
+      null_node_metadata,
+      Allocator> >::other::pointer
+      node_pointer;
+
+      typedef Value_Type value_type;
+
+      typedef null_node_metadata metadata_type;
+
+    public:
+      inline bool
+      special() const
+      {
+	return (m_special);
+      }
+
+#ifdef PB_DS_BIN_SEARCH_TREE_TRACE_
+      void
+      trace() const
+      {
+	std::cout << PB_DS_V2F(m_value);
+
+      }
+#endif // #ifdef PB_DS_BIN_SEARCH_TREE_TRACE_
+
+    public:
+      node_pointer m_p_left;
+      node_pointer m_p_right;
+
+      node_pointer m_p_parent;
+
+      value_type m_value;
+
+      bool m_special;
+    };
+
+  } // namespace detail
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_SPLAY_TREE_NODE_HPP
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/splay_tree_/splay_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/splay_tree_/splay_fn_imps.hpp
new file mode 100644
index 00000000000..4006159b06a
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/splay_tree_/splay_fn_imps.hpp
@@ -0,0 +1,297 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file splay_fn_imps.hpp
+ * Contains an implementation class for splay_tree_.
+ */
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+splay(node_pointer p_nd)
+{
+  while (p_nd->m_p_parent != PB_DS_BASE_C_DEC::m_p_head)
+    {
+#ifdef PB_DS_SPLAY_TREE_DEBUG_
+      {
+	node_pointer p_head = PB_DS_BASE_C_DEC::m_p_head;
+
+	assert_special_imp(p_head);
+      }
+#endif // #ifdef PB_DS_SPLAY_TREE_DEBUG_
+
+      PB_DS_DBG_ONLY(PB_DS_BASE_C_DEC::assert_node_consistent(p_nd);)
+
+        if (p_nd->m_p_parent->m_p_parent ==
+            PB_DS_BASE_C_DEC::m_p_head)
+	  {
+            PB_DS_BASE_C_DEC::rotate_parent(p_nd);
+
+            PB_DS_DBG_ASSERT(p_nd == this->m_p_head->m_p_parent);
+	  }
+        else
+	  {
+            const node_pointer p_parent = p_nd->m_p_parent;
+            const node_pointer p_grandparent = p_parent->m_p_parent;
+
+#ifdef PB_DS_SPLAY_TREE_DEBUG_
+            const size_type total =
+	      PB_DS_BASE_C_DEC::recursive_count(p_grandparent);
+
+            PB_DS_DBG_ASSERT(total >= 3);
+#endif // #ifdef PB_DS_SPLAY_TREE_DEBUG_
+
+            if (p_parent->m_p_left == p_nd&& 
+		p_grandparent->m_p_right == p_parent)
+	      splay_zig_zag_left(p_nd, p_parent, p_grandparent);
+            else if (p_parent->m_p_right == p_nd&& 
+		     p_grandparent->m_p_left == p_parent)
+	      splay_zig_zag_right(p_nd, p_parent, p_grandparent);
+            else if (p_parent->m_p_left == p_nd&& 
+		     p_grandparent->m_p_left == p_parent)
+	      splay_zig_zig_left(p_nd, p_parent, p_grandparent);
+            else
+	      splay_zig_zig_right(p_nd, p_parent, p_grandparent);
+
+            PB_DS_DBG_ASSERT(total ==this->recursive_count(p_nd));
+	  }
+
+      PB_DS_DBG_ONLY(PB_DS_BASE_C_DEC::assert_node_consistent(p_nd);)
+	}
+}
+
+PB_DS_CLASS_T_DEC
+inline void
+PB_DS_CLASS_C_DEC::
+splay_zig_zag_left(node_pointer p_nd, node_pointer p_parent, node_pointer p_grandparent)
+{
+  PB_DS_DBG_ASSERT(p_parent == p_nd->m_p_parent);
+  PB_DS_DBG_ASSERT(p_grandparent == p_parent->m_p_parent);
+
+  PB_DS_DBG_ONLY(PB_DS_BASE_C_DEC::assert_node_consistent(p_grandparent);)
+
+    PB_DS_DBG_ASSERT(p_parent->m_p_left == p_nd&& 
+		     p_grandparent->m_p_right == p_parent);
+
+  splay_zz_start(p_nd, p_parent, p_grandparent);
+
+  node_pointer p_b = p_nd->m_p_right;
+  node_pointer p_c = p_nd->m_p_left;
+
+  p_nd->m_p_right = p_parent;
+  p_parent->m_p_parent = p_nd;
+
+  p_nd->m_p_left = p_grandparent;
+  p_grandparent->m_p_parent = p_nd;
+
+  p_parent->m_p_left = p_b;
+  if (p_b != NULL)
+    p_b->m_p_parent = p_parent;
+
+  p_grandparent->m_p_right = p_c;
+  if (p_c != NULL)
+    p_c->m_p_parent = p_grandparent;
+
+  splay_zz_end(p_nd, p_parent, p_grandparent);
+}
+
+PB_DS_CLASS_T_DEC
+inline void
+PB_DS_CLASS_C_DEC::
+splay_zig_zag_right(node_pointer p_nd, node_pointer p_parent, node_pointer p_grandparent)
+{
+  PB_DS_DBG_ASSERT(p_parent == p_nd->m_p_parent);
+  PB_DS_DBG_ASSERT(p_grandparent == p_parent->m_p_parent);
+
+  PB_DS_DBG_ONLY(PB_DS_BASE_C_DEC::assert_node_consistent(p_grandparent);)
+
+    PB_DS_DBG_ASSERT(p_parent->m_p_right == p_nd&& 
+		     p_grandparent->m_p_left == p_parent);
+
+  splay_zz_start(p_nd, p_parent, p_grandparent);
+
+  node_pointer p_b = p_nd->m_p_left;
+  node_pointer p_c = p_nd->m_p_right;
+
+  p_nd->m_p_left = p_parent;
+  p_parent->m_p_parent = p_nd;
+
+  p_nd->m_p_right = p_grandparent;
+  p_grandparent->m_p_parent = p_nd;
+
+  p_parent->m_p_right = p_b;
+  if (p_b != NULL)
+    p_b->m_p_parent = p_parent;
+
+  p_grandparent->m_p_left = p_c;
+  if (p_c != NULL)
+    p_c->m_p_parent = p_grandparent;
+
+  splay_zz_end(p_nd, p_parent, p_grandparent);
+}
+
+PB_DS_CLASS_T_DEC
+inline void
+PB_DS_CLASS_C_DEC::
+splay_zig_zig_left(node_pointer p_nd, node_pointer p_parent, node_pointer p_grandparent)
+{
+  PB_DS_DBG_ASSERT(p_parent == p_nd->m_p_parent);
+  PB_DS_DBG_ASSERT(p_grandparent == p_parent->m_p_parent);
+
+  PB_DS_DBG_ONLY(PB_DS_BASE_C_DEC::assert_node_consistent(p_grandparent);)
+
+    PB_DS_DBG_ASSERT(p_parent->m_p_left == p_nd&& 
+		     p_nd->m_p_parent->m_p_parent->m_p_left == p_nd->m_p_parent);
+
+  splay_zz_start(p_nd, p_parent, p_grandparent);
+
+  node_pointer p_b = p_nd->m_p_right;
+  node_pointer p_c = p_parent->m_p_right;
+
+  p_nd->m_p_right = p_parent;
+  p_parent->m_p_parent = p_nd;
+
+  p_parent->m_p_right = p_grandparent;
+  p_grandparent->m_p_parent = p_parent;
+
+  p_parent->m_p_left = p_b;
+  if (p_b != NULL)
+    p_b->m_p_parent = p_parent;
+
+  p_grandparent->m_p_left = p_c;
+  if (p_c != NULL)
+    p_c->m_p_parent = p_grandparent;
+
+  splay_zz_end(p_nd, p_parent, p_grandparent);
+}
+
+PB_DS_CLASS_T_DEC
+inline void
+PB_DS_CLASS_C_DEC::
+splay_zig_zig_right(node_pointer p_nd, node_pointer p_parent, node_pointer p_grandparent)
+{
+  PB_DS_DBG_ASSERT(p_parent == p_nd->m_p_parent);
+  PB_DS_DBG_ASSERT(p_grandparent == p_parent->m_p_parent);
+
+  PB_DS_DBG_ONLY(PB_DS_BASE_C_DEC::assert_node_consistent(p_grandparent);)
+
+    PB_DS_DBG_ASSERT(p_parent->m_p_right == p_nd&& 
+		     p_nd->m_p_parent->m_p_parent->m_p_right == p_nd->m_p_parent);
+
+  splay_zz_start(p_nd, p_parent, p_grandparent);
+
+  node_pointer p_b = p_nd->m_p_left;
+  node_pointer p_c = p_parent->m_p_left;
+
+  p_nd->m_p_left = p_parent;
+  p_parent->m_p_parent = p_nd;
+
+  p_parent->m_p_left = p_grandparent;
+  p_grandparent->m_p_parent = p_parent;
+
+  p_parent->m_p_right = p_b;
+  if (p_b != NULL)
+    p_b->m_p_parent = p_parent;
+
+  p_grandparent->m_p_right = p_c;
+  if (p_c != NULL)
+    p_c->m_p_parent = p_grandparent;
+
+  PB_DS_BASE_C_DEC::update_to_top(
+				  p_grandparent, (node_update* )this);
+
+  splay_zz_end(p_nd, p_parent, p_grandparent);
+}
+
+PB_DS_CLASS_T_DEC
+inline void
+PB_DS_CLASS_C_DEC::
+splay_zz_start(node_pointer p_nd,
+#ifdef PB_DS_SPLAY_TREE_DEBUG_
+	       node_pointer p_parent,
+#else // #ifdef PB_DS_SPLAY_TREE_DEBUG_
+	       node_pointer /*p_parent*/,
+#endif // #ifdef PB_DS_SPLAY_TREE_DEBUG_
+	       node_pointer p_grandparent)
+{
+  PB_DS_DBG_ASSERT(p_nd != NULL);
+  PB_DS_DBG_ASSERT(p_parent != NULL);
+  PB_DS_DBG_ASSERT(p_grandparent != NULL);
+
+  const bool grandparent_head =
+    p_grandparent->m_p_parent == PB_DS_BASE_C_DEC::m_p_head;
+
+  if (grandparent_head)
+    {
+      PB_DS_BASE_C_DEC::m_p_head->m_p_parent =
+	PB_DS_BASE_C_DEC::m_p_head->m_p_parent;
+
+      p_nd->m_p_parent = PB_DS_BASE_C_DEC::m_p_head;
+
+      return;
+    }
+
+  node_pointer p_greatgrandparent = p_grandparent->m_p_parent;
+
+  p_nd->m_p_parent = p_greatgrandparent;
+
+  if (p_grandparent == p_greatgrandparent->m_p_left)
+    p_greatgrandparent->m_p_left = p_nd;
+  else
+    p_greatgrandparent->m_p_right = p_nd;
+}
+
+PB_DS_CLASS_T_DEC
+inline void
+PB_DS_CLASS_C_DEC::
+splay_zz_end(node_pointer p_nd, node_pointer p_parent, node_pointer p_grandparent)
+{
+  if (p_nd->m_p_parent == PB_DS_BASE_C_DEC::m_p_head)
+    PB_DS_BASE_C_DEC::m_p_head->m_p_parent = p_nd;
+
+  apply_update(p_grandparent, (node_update* )this);
+  apply_update(p_parent, (node_update* )this);
+  apply_update(p_nd, (node_update* )this);
+
+  PB_DS_DBG_ONLY(PB_DS_BASE_C_DEC::assert_node_consistent(p_nd);)
+    }
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/splay_tree_/splay_tree_.hpp b/libstdc++-v3/include/ext/pb_ds/detail/splay_tree_/splay_tree_.hpp
new file mode 100644
index 00000000000..9a36582ade0
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/splay_tree_/splay_tree_.hpp
@@ -0,0 +1,396 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file splay_tree_.hpp
+ * Contains an implementation class for splay_tree_.
+ */
+/*
+ * This implementation uses an idea from the SGI STL (using a "header" node
+ *    which is needed for efficient iteration). Following is the SGI STL
+ *    copyright.
+ *
+ * Copyright (c) 1996,1997
+ * Silicon Graphics Computer Systems, Inc.
+ *
+ * Permission to use, copy, modify, distribute and sell this software
+ * and its documentation for any purpose is hereby granted without fee,
+ * provided that the above copyright notice appear in all copies and
+ * that both that copyright notice and this permission notice appear
+ * in supporting documentation.    Silicon Graphics makes no
+ * representations about the suitability of this software for any
+ * purpose.    It is provided "as is" without express or implied warranty.
+ *
+ *
+ * Copyright (c) 1994
+ * Hewlett-Packard Company
+ *
+ * Permission to use, copy, modify, distribute and sell this software
+ * and its documentation for any purpose is hereby granted without fee,
+ * provided that the above copyright notice appear in all copies and
+ * that both that copyright notice and this permission notice appear
+ * in supporting documentation.    Hewlett-Packard Company makes no
+ * representations about the suitability of this software for any
+ * purpose.    It is provided "as is" without express or implied warranty.
+ *
+ *
+ */
+
+#ifdef PB_DS_DATA_TRUE_INDICATOR
+#ifndef PB_DS_BIN_SEARCH_TREE_HPP__DATA_TRUE_INDICATOR
+#define PB_DS_BIN_SEARCH_TREE_HPP__DATA_TRUE_INDICATOR
+#include <ext/pb_ds/detail/bin_search_tree_/bin_search_tree_.hpp>
+#endif // #ifndef BIN_SEARCH_TREE_HPP__DATA_TRUE_INDICATOR
+#endif // #ifdef PB_DS_DATA_TRUE_INDICATOR
+
+#ifdef PB_DS_DATA_FALSE_INDICATOR
+#ifndef PB_DS_BIN_SEARCH_TREE_HPP__DATA_FALSE_INDICATOR
+#define PB_DS_BIN_SEARCH_TREE_HPP__DATA_FALSE_INDICATOR
+#include <ext/pb_ds/detail/bin_search_tree_/bin_search_tree_.hpp>
+#endif // #ifndef BIN_SEARCH_TREE_HPP__DATA_FALSE_INDICATOR
+#endif // #ifdef PB_DS_DATA_FALSE_INDICATOR
+
+#include <utility>
+#include <vector>
+#include <assert.h>
+
+namespace pb_ds
+{
+  namespace detail
+  {
+
+#ifdef PB_DS_SPLAY_TREE_DEBUG_
+#define PB_DS_DBG_ASSERT(X) assert(X)
+#define PB_DS_DBG_VERIFY(X) assert(X)
+#define PB_DS_DBG_ONLY(X) X
+#else // #ifdef PB_DS_SPLAY_TREE_DEBUG_
+#define PB_DS_DBG_ASSERT(X)
+#define PB_DS_DBG_VERIFY(X) {if((X)==0);}
+#define PB_DS_DBG_ONLY(X) ;
+#endif // #ifdef PB_DS_SPLAY_TREE_DEBUG_
+
+#define PB_DS_CLASS_T_DEC						\
+    template<								\
+						typename Key,		\
+						typename Mapped,	\
+						class Cmp_Fn,		\
+						class Node_And_It_Traits, \
+						class Allocator>
+
+#ifdef PB_DS_DATA_TRUE_INDICATOR
+#define PB_DS_CLASS_NAME			\
+    splay_tree_data_
+#endif // #ifdef PB_DS_DATA_TRUE_INDICATOR
+
+#ifdef PB_DS_DATA_FALSE_INDICATOR
+#define PB_DS_CLASS_NAME			\
+    splay_tree_no_data_
+#endif // #ifdef PB_DS_DATA_FALSE_INDICATOR
+
+#ifdef PB_DS_DATA_TRUE_INDICATOR
+#define PB_DS_BASE_CLASS_NAME			\
+    bin_search_tree_data_
+#endif // #ifdef PB_DS_DATA_TRUE_INDICATOR
+
+#ifdef PB_DS_DATA_FALSE_INDICATOR
+#define PB_DS_BASE_CLASS_NAME			\
+    bin_search_tree_no_data_
+#endif // #ifdef PB_DS_DATA_FALSE_INDICATOR
+
+#define PB_DS_CLASS_C_DEC						\
+    PB_DS_CLASS_NAME<							\
+						Key,			\
+						Mapped,			\
+						Cmp_Fn,			\
+						Node_And_It_Traits,	\
+						Allocator>
+
+#define PB_DS_BASE_C_DEC						\
+    PB_DS_BASE_CLASS_NAME<						\
+							Key,		\
+							Mapped,		\
+							Cmp_Fn,		\
+							Node_And_It_Traits, \
+							Allocator>
+
+#ifdef PB_DS_DATA_TRUE_INDICATOR
+#define PB_DS_V2F(X) (X).first
+#define PB_DS_V2S(X) (X).second
+#define PB_DS_EP2VP(X)& ((X)->m_value)
+#endif // #ifdef PB_DS_DATA_TRUE_INDICATOR
+
+#ifdef PB_DS_DATA_FALSE_INDICATOR
+#define PB_DS_V2F(X) (X)
+#define PB_DS_V2S(X) Mapped_Data()
+#define PB_DS_EP2VP(X)& ((X)->m_value.first)
+#endif // #ifdef PB_DS_DATA_FALSE_INDICATOR
+
+    // $p14y 7r33 7481.
+    template<typename Key,
+	     typename Mapped,
+	     class Cmp_Fn,
+	     class Node_And_It_Traits,
+	     class Allocator>
+    class PB_DS_CLASS_NAME : public PB_DS_BASE_C_DEC
+    {
+
+    private:
+      typedef typename PB_DS_BASE_C_DEC::node_pointer node_pointer;
+
+    public:
+
+      typedef typename Allocator::size_type size_type;
+
+      typedef typename Allocator::difference_type difference_type;
+
+      typedef typename PB_DS_BASE_C_DEC::key_type key_type;
+
+      typedef typename PB_DS_BASE_C_DEC::key_pointer key_pointer;
+
+      typedef typename PB_DS_BASE_C_DEC::const_key_pointer const_key_pointer;
+
+      typedef typename PB_DS_BASE_C_DEC::key_reference key_reference;
+
+      typedef
+      typename PB_DS_BASE_C_DEC::const_key_reference
+      const_key_reference;
+
+      typedef typename PB_DS_BASE_C_DEC::mapped_type mapped_type;
+
+      typedef typename PB_DS_BASE_C_DEC::mapped_pointer mapped_pointer;
+
+      typedef
+      typename PB_DS_BASE_C_DEC::const_mapped_pointer
+      const_mapped_pointer;
+
+      typedef typename PB_DS_BASE_C_DEC::mapped_reference mapped_reference;
+
+      typedef
+      typename PB_DS_BASE_C_DEC::const_mapped_reference
+      const_mapped_reference;
+
+      typedef typename PB_DS_BASE_C_DEC::value_type value_type;
+
+      typedef typename PB_DS_BASE_C_DEC::pointer pointer;
+
+      typedef typename PB_DS_BASE_C_DEC::const_pointer const_pointer;
+
+      typedef typename PB_DS_BASE_C_DEC::reference reference;
+
+      typedef typename PB_DS_BASE_C_DEC::const_reference const_reference;
+
+      typedef typename PB_DS_BASE_C_DEC::point_iterator point_iterator;
+
+      typedef typename PB_DS_BASE_C_DEC::const_iterator const_point_iterator;
+
+      typedef typename PB_DS_BASE_C_DEC::iterator iterator;
+
+      typedef typename PB_DS_BASE_C_DEC::const_iterator const_iterator;
+
+      typedef typename PB_DS_BASE_C_DEC::reverse_iterator reverse_iterator;
+
+      typedef
+      typename PB_DS_BASE_C_DEC::const_reverse_iterator
+      const_reverse_iterator;
+
+      typedef Cmp_Fn cmp_fn;
+
+      typedef Allocator allocator;
+
+      typedef typename PB_DS_BASE_C_DEC::node_update node_update;
+
+    public:
+
+      PB_DS_CLASS_NAME();
+
+      PB_DS_CLASS_NAME(const Cmp_Fn& r_cmp_fn);
+
+      PB_DS_CLASS_NAME(const Cmp_Fn& r_cmp_fn, const node_update& r_node_update);
+
+      PB_DS_CLASS_NAME(const PB_DS_CLASS_C_DEC& other);
+
+      void
+      swap(PB_DS_CLASS_C_DEC& other);
+
+      template<typename It>
+      void
+      copy_from_range(It first_it, It last_it);
+
+      void
+      initialize();
+
+      inline std::pair<
+	point_iterator,
+	bool>
+      insert(const_reference r_value);
+
+      inline mapped_reference
+      operator[](const_key_reference r_key)
+      {
+#ifdef PB_DS_DATA_TRUE_INDICATOR
+	PB_DS_DBG_ONLY(PB_DS_CLASS_C_DEC::assert_valid();)
+
+	  std::pair<point_iterator, bool> ins_pair =
+	  insert_leaf_imp(
+			  value_type(
+				     r_key,
+				     mapped_type()));
+
+	ins_pair.first.m_p_nd->m_special = false;
+
+	PB_DS_DBG_ONLY(PB_DS_BASE_C_DEC::assert_valid());
+
+	splay(ins_pair.first.m_p_nd);
+
+	PB_DS_DBG_ONLY(PB_DS_CLASS_C_DEC::assert_valid();)
+
+	  return (ins_pair.first.m_p_nd->m_value.second);
+#else // #ifdef PB_DS_DATA_TRUE_INDICATOR
+	insert(r_key);
+
+	return (PB_DS_BASE_C_DEC::s_null_mapped);
+#endif // #ifdef PB_DS_DATA_TRUE
+      }
+
+      inline point_iterator
+      find(const_key_reference r_key);
+
+      inline const_point_iterator
+      find(const_key_reference r_key) const;
+
+      inline bool
+      erase(const_key_reference r_key);
+
+      inline iterator
+      erase(iterator it);
+
+      inline reverse_iterator
+      erase(reverse_iterator it);
+
+      template<typename Pred>
+      inline size_type
+      erase_if(Pred pred);
+
+      void
+      join(PB_DS_CLASS_C_DEC& other);
+
+      void
+      split(const_key_reference r_key, PB_DS_CLASS_C_DEC& other);
+
+    private:
+
+      inline std::pair<point_iterator, bool>
+      insert_leaf_imp(const_reference r_mapped_value);
+
+      inline node_pointer
+      find_imp(const_key_reference r_key);
+
+      inline const node_pointer
+      find_imp(const_key_reference r_key) const;
+
+#ifdef PB_DS_SPLAY_TREE_DEBUG_
+
+      void
+      assert_valid() const;
+
+      void
+      assert_special_imp(const node_pointer p_nd) const;
+
+#endif // #ifdef PB_DS_SPLAY_TREE_DEBUG_
+
+      void
+      splay(node_pointer p_nd);
+
+      inline void
+      splay_zig_zag_left(node_pointer p_nd, node_pointer p_parent, node_pointer p_grandparent);
+
+      inline void
+      splay_zig_zag_right(node_pointer p_nd, node_pointer p_parent, node_pointer p_grandparent);
+
+      inline void
+      splay_zig_zig_left(node_pointer p_nd, node_pointer p_parent, node_pointer p_grandparent);
+
+      inline void
+      splay_zig_zig_right(node_pointer p_nd, node_pointer p_parent, node_pointer p_grandparent);
+
+      inline void
+      splay_zz_start(node_pointer p_nd, node_pointer p_parent, node_pointer p_grandparent);
+
+      inline void
+      splay_zz_end(node_pointer p_nd, node_pointer p_parent, node_pointer p_grandparent);
+
+      inline node_pointer
+      leftmost(node_pointer p_nd);
+
+      void
+      erase_node(node_pointer p_nd);
+
+    };
+
+#include <ext/pb_ds/detail/splay_tree_/constructors_destructor_fn_imps.hpp>
+#include <ext/pb_ds/detail/splay_tree_/insert_fn_imps.hpp>
+#include <ext/pb_ds/detail/splay_tree_/splay_fn_imps.hpp>
+#include <ext/pb_ds/detail/splay_tree_/erase_fn_imps.hpp>
+#include <ext/pb_ds/detail/splay_tree_/find_fn_imps.hpp>
+#include <ext/pb_ds/detail/splay_tree_/debug_fn_imps.hpp>
+#include <ext/pb_ds/detail/splay_tree_/split_join_fn_imps.hpp>
+
+#undef PB_DS_CLASS_T_DEC
+
+#undef PB_DS_CLASS_C_DEC
+
+#undef PB_DS_CLASS_NAME
+
+#undef PB_DS_BASE_CLASS_NAME
+
+#undef PB_DS_BASE_C_DEC
+
+#undef PB_DS_V2F
+#undef PB_DS_EP2VP
+#undef PB_DS_V2S
+
+#undef PB_DS_DBG_ASSERT
+#undef PB_DS_DBG_VERIFY
+#undef PB_DS_DBG_ONLY
+
+  } // namespace detail
+} // namespace pb_ds
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/splay_tree_/split_join_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/splay_tree_/split_join_fn_imps.hpp
new file mode 100644
index 00000000000..78606a8aafc
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/splay_tree_/split_join_fn_imps.hpp
@@ -0,0 +1,127 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file split_join_fn_imps.hpp
+ * Contains an implementation class for splay_tree_.
+ */
+
+PB_DS_CLASS_T_DEC
+inline void
+PB_DS_CLASS_C_DEC::
+join(PB_DS_CLASS_C_DEC& other)
+{
+  PB_DS_DBG_ONLY(assert_valid();)
+    PB_DS_DBG_ONLY(other.assert_valid();)
+
+    if (PB_DS_BASE_C_DEC::join_prep(other) == false)
+      {
+        PB_DS_DBG_ONLY(assert_valid();)
+	  PB_DS_DBG_ONLY(other.assert_valid();)
+
+	  return;
+      }
+
+  node_pointer p_target_r = other.leftmost(other.m_p_head);
+
+  PB_DS_DBG_ASSERT(p_target_r != NULL);
+
+  other.splay(p_target_r);
+
+  PB_DS_DBG_ASSERT(p_target_r == other.m_p_head->m_p_parent);
+  PB_DS_DBG_ASSERT(p_target_r->m_p_left == NULL);
+
+  p_target_r->m_p_left = PB_DS_BASE_C_DEC::m_p_head->m_p_parent;
+
+  PB_DS_DBG_ASSERT(p_target_r->m_p_left != NULL);
+  p_target_r->m_p_left->m_p_parent = p_target_r;
+
+  PB_DS_BASE_C_DEC::m_p_head->m_p_parent = p_target_r;
+  p_target_r->m_p_parent = PB_DS_BASE_C_DEC::m_p_head;
+
+  apply_update(p_target_r, (node_update* )this);
+
+  PB_DS_BASE_C_DEC::join_finish(other);
+
+  PB_DS_DBG_ONLY(assert_valid();)
+    PB_DS_DBG_ONLY(other.assert_valid();)
+    }
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+split(const_key_reference r_key, PB_DS_CLASS_C_DEC& other)
+{
+  PB_DS_DBG_ONLY(assert_valid());
+  PB_DS_DBG_ONLY(other.assert_valid());
+
+  if (PB_DS_BASE_C_DEC::split_prep(r_key, other) == false)
+    {
+      PB_DS_DBG_ONLY(assert_valid());
+      PB_DS_DBG_ONLY(other.assert_valid());
+
+      return;
+    }
+
+  node_pointer p_upper_bound = upper_bound(r_key).m_p_nd;
+  PB_DS_DBG_ASSERT(p_upper_bound != NULL);
+
+  splay(p_upper_bound);
+  PB_DS_DBG_ASSERT(p_upper_bound->m_p_parent == this->m_p_head);
+
+  node_pointer p_new_root = p_upper_bound->m_p_left;
+  PB_DS_DBG_ASSERT(p_new_root != NULL);
+
+  PB_DS_BASE_C_DEC::m_p_head->m_p_parent = p_new_root;
+  p_new_root->m_p_parent = PB_DS_BASE_C_DEC::m_p_head;
+
+  other.m_p_head->m_p_parent = p_upper_bound;
+  p_upper_bound->m_p_parent = other.m_p_head;
+  p_upper_bound->m_p_left = NULL;
+
+  apply_update(p_upper_bound, (node_update* )this);
+
+  PB_DS_BASE_C_DEC::split_finish(other);
+
+  PB_DS_DBG_ONLY(assert_valid());
+  PB_DS_DBG_ONLY(other.assert_valid());
+}
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/splay_tree_/traits.hpp b/libstdc++-v3/include/ext/pb_ds/detail/splay_tree_/traits.hpp
new file mode 100644
index 00000000000..2cdb733fd63
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/splay_tree_/traits.hpp
@@ -0,0 +1,131 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file traits.hpp
+ * Contains an implementation for splay_tree_.
+ */
+
+#ifndef PB_DS_SPLAY_TREE_NODE_AND_IT_TRAITS_HPP
+#define PB_DS_SPLAY_TREE_NODE_AND_IT_TRAITS_HPP
+
+#include <ext/pb_ds/detail/splay_tree_/node.hpp>
+
+namespace pb_ds
+{
+  namespace detail
+  {
+
+    template<typename Key,
+	     typename Mapped,
+	     class Cmp_Fn,
+	     template<typename Const_Node_Iterator,
+		      class Node_Iterator,
+		      class Cmp_Fn_,
+		      class Allocator_>
+    class Node_Update,
+	     class Allocator>
+    struct tree_traits<
+      Key,
+      Mapped,
+      Cmp_Fn,
+      Node_Update,
+      splay_tree_tag,
+      Allocator> : public bin_search_tree_traits<
+      Key,
+      Mapped,
+      Cmp_Fn,
+      Node_Update,
+      splay_tree_node_<
+      typename types_traits<
+      Key,
+      Mapped,
+      Allocator,
+      false>::value_type,
+      typename tree_node_metadata_selector<
+      Key,
+      Mapped,
+      Cmp_Fn,
+      Node_Update,
+      Allocator>::type,
+      Allocator>,
+      Allocator>
+    { };
+
+    template<typename Key,
+	     class Cmp_Fn,
+	     template<typename Const_Node_Iterator,
+		      class Node_Iterator,
+		      class Cmp_Fn_,
+		      class Allocator_>
+    class Node_Update,
+	     class Allocator>
+    struct tree_traits<
+      Key,
+      null_mapped_type,
+      Cmp_Fn,
+      Node_Update,
+      splay_tree_tag,
+      Allocator> : public bin_search_tree_traits<
+      Key,
+      null_mapped_type,
+      Cmp_Fn,
+      Node_Update,
+      splay_tree_node_<
+      typename types_traits<
+      Key,
+      null_mapped_type,
+      Allocator,
+      false>::value_type,
+      typename tree_node_metadata_selector<
+      Key,
+      null_mapped_type,
+      Cmp_Fn,
+      Node_Update,
+      Allocator>::type,
+      Allocator>,
+      Allocator>
+    { };
+
+  } // namespace detail
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_SPLAY_TREE_NODE_AND_IT_TRAITS_HPP
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/standard_policies.hpp b/libstdc++-v3/include/ext/pb_ds/detail/standard_policies.hpp
new file mode 100644
index 00000000000..3371388a561
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/standard_policies.hpp
@@ -0,0 +1,163 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file standard_policies.hpp
+ * Contains standard policies for containers.
+ */
+
+#ifndef PB_DS_STANDARD_POLICIES_HPP
+#define PB_DS_STANDARD_POLICIES_HPP
+
+#include <memory>
+#include <ext/pb_ds/hash_policy.hpp>
+#include <ext/pb_ds/list_update_policy.hpp>
+#include <ext/pb_ds/tree_policy.hpp>
+#include <ext/pb_ds/detail/basic_tree_policy/null_node_metadata.hpp>
+#include <ext/pb_ds/trie_policy.hpp>
+#include <ext/pb_ds/tag_and_trait.hpp>
+#include <ext/hash_map>
+
+namespace pb_ds
+{
+  namespace detail
+  {
+    template<typename Key>
+    struct default_hash_fn
+    {
+      typedef __gnu_cxx::hash< Key> type;
+    };
+
+    template<typename Key>
+    struct default_eq_fn
+    {
+      typedef std::equal_to< Key> type;
+    };
+
+    enum
+      {
+	default_store_hash = false
+      };
+
+    struct default_comb_hash_fn
+    {
+      typedef pb_ds::direct_mask_range_hashing<> type;
+    };
+
+    template<typename Comb_Hash_Fn>
+    struct default_resize_policy
+    {
+    private:
+      typedef typename Comb_Hash_Fn::size_type size_type;
+
+      typedef
+      typename conditional_type<
+	is_same<
+	pb_ds::direct_mask_range_hashing<
+	size_type>,
+	Comb_Hash_Fn>::value,
+	pb_ds::hash_exponential_size_policy<
+	size_type>,
+	pb_ds::hash_prime_size_policy>::type
+      size_policy_type;
+
+    public:
+      typedef
+      pb_ds::hash_standard_resize_policy<
+      size_policy_type,
+      pb_ds::hash_load_check_resize_trigger<
+      false,
+      size_type>,
+      false,
+      size_type>
+      type;
+    };
+
+    struct default_update_policy
+    {
+      typedef pb_ds::move_to_front_lu_policy<> type;
+    };
+
+    template<typename Comb_Probe_Fn>
+    struct default_probe_fn
+    {
+    private:
+      typedef typename Comb_Probe_Fn::size_type size_type;
+
+    public:
+      typedef
+      typename conditional_type<
+      is_same<
+      pb_ds::direct_mask_range_hashing<size_t>,
+      Comb_Probe_Fn>::value,
+      pb_ds::linear_probe_fn<
+      size_type>,
+      pb_ds::quadratic_probe_fn<
+      size_type> >::type
+      type;
+    };
+
+    template<typename Key>
+    struct default_trie_e_access_traits;
+
+    template<typename Char, class Char_Traits>
+    struct default_trie_e_access_traits<
+      std::basic_string<
+      Char,
+      Char_Traits,
+      std::allocator<
+      char> > >
+    {
+      typedef
+      pb_ds::string_trie_e_access_traits<
+	std::basic_string<
+	Char,
+	Char_Traits,
+	std::allocator<
+	char> > >
+      type;
+    };
+
+  } // namespace detail
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_STANDARD_POLICIES_HPP
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/thin_heap_/constructors_destructor_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/thin_heap_/constructors_destructor_fn_imps.hpp
new file mode 100644
index 00000000000..783711269d9
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/thin_heap_/constructors_destructor_fn_imps.hpp
@@ -0,0 +1,122 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file constructors_destructor_fn_imps.hpp
+ * Contains an implementation for thin_heap_.
+ */
+
+PB_DS_CLASS_T_DEC
+template<typename It>
+void
+PB_DS_CLASS_C_DEC::
+copy_from_range(It first_it, It last_it)
+{
+  while (first_it != last_it)
+    push(*(first_it++));
+
+  PB_DS_DBG_ONLY(assert_valid();)
+    }
+
+PB_DS_CLASS_T_DEC
+PB_DS_CLASS_C_DEC::
+thin_heap_() :
+  m_p_max(NULL)
+{
+  initialize();
+
+  PB_DS_DBG_ONLY(assert_valid();)
+    }
+
+PB_DS_CLASS_T_DEC
+PB_DS_CLASS_C_DEC::
+thin_heap_(const Cmp_Fn& r_cmp_fn) :
+  PB_DS_BASE_C_DEC(r_cmp_fn),
+  m_p_max(NULL)
+{
+  initialize();
+
+  PB_DS_DBG_ONLY(assert_valid();)
+    }
+
+PB_DS_CLASS_T_DEC
+PB_DS_CLASS_C_DEC::
+thin_heap_(const PB_DS_CLASS_C_DEC& other) :
+  PB_DS_BASE_C_DEC(other)
+{
+  initialize();
+
+  m_p_max = base_type::m_p_root;
+
+  for (node_pointer p_nd = base_type::m_p_root; p_nd != NULL; p_nd = p_nd->m_p_next_sibling)
+    if (Cmp_Fn::operator()(m_p_max->m_value, p_nd->m_value))
+      m_p_max = p_nd;
+
+  PB_DS_DBG_ONLY(assert_valid();)
+    }
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+swap(PB_DS_CLASS_C_DEC& other)
+{
+  PB_DS_DBG_ONLY(assert_valid();)
+
+    base_type::swap(other);
+
+  std::swap(m_p_max, other.m_p_max);
+
+  PB_DS_DBG_ONLY(assert_valid();)
+    }
+
+PB_DS_CLASS_T_DEC
+PB_DS_CLASS_C_DEC::
+~thin_heap_()
+{ }
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+initialize()
+{
+  std::fill(m_a_aux, m_a_aux + max_rank, static_cast<node_pointer>(NULL));
+}
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/thin_heap_/debug_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/thin_heap_/debug_fn_imps.hpp
new file mode 100644
index 00000000000..e6d89db3683
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/thin_heap_/debug_fn_imps.hpp
@@ -0,0 +1,127 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file debug_fn_imps.hpp
+ * Contains an implementation for thin_heap_.
+ */
+
+#ifdef PB_DS_THIN_HEAP_DEBUG_
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+assert_valid() const
+{
+  base_type::assert_valid();
+
+  assert_node_consistent(base_type::m_p_root, true);
+
+  assert_max();
+
+  assert_aux_null();
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+assert_aux_null() const
+{
+  for (size_type i = 0; i < max_rank; ++i)
+    PB_DS_DBG_ASSERT(m_a_aux[i] == NULL);
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+assert_max() const
+{
+  if (m_p_max == NULL)
+    {
+      PB_DS_DBG_ASSERT(base_type::empty());
+
+      return;
+    }
+
+  PB_DS_DBG_ASSERT(!base_type::empty());
+
+  PB_DS_DBG_ASSERT(base_type::parent(m_p_max) == NULL);
+  PB_DS_DBG_ASSERT(m_p_max->m_p_prev_or_parent == NULL);
+
+  for (const_iterator it = base_type::begin(); it != base_type::end(); ++it)
+    PB_DS_DBG_ASSERT(!Cmp_Fn::operator()(m_p_max->m_value, it.m_p_nd->m_value));
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+assert_node_consistent(const_node_pointer p_nd, bool root) const
+{
+  base_type::assert_node_consistent(p_nd, root);
+
+  if (p_nd == NULL)
+    return;
+
+  assert_node_consistent(p_nd->m_p_next_sibling, root);
+  assert_node_consistent(p_nd->m_p_l_child, false);
+
+  if (!root)
+    {
+      if (p_nd->m_metadata == 0)
+	PB_DS_DBG_ASSERT(p_nd->m_p_next_sibling == NULL);
+      else
+	PB_DS_DBG_ASSERT(p_nd->m_metadata == p_nd->m_p_next_sibling->m_metadata + 1);
+    }
+
+  if (p_nd->m_p_l_child != NULL)
+    PB_DS_DBG_ASSERT(p_nd->m_p_l_child->m_metadata + 1 == base_type::degree(p_nd));
+
+  const bool unmarked_valid =(p_nd->m_p_l_child == NULL&&  p_nd->m_metadata == 0) ||(p_nd->m_p_l_child != NULL&&  p_nd->m_metadata == p_nd->m_p_l_child->m_metadata + 1);
+
+  const bool marked_valid =(p_nd->m_p_l_child == NULL&&  p_nd->m_metadata == 1) ||(p_nd->m_p_l_child != NULL&&  p_nd->m_metadata == p_nd->m_p_l_child->m_metadata + 2);
+
+  PB_DS_DBG_ASSERT(unmarked_valid || marked_valid);
+
+  if (root)
+    PB_DS_DBG_ASSERT(unmarked_valid);
+}
+
+#endif // #ifdef PB_DS_THIN_HEAP_DEBUG_
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/thin_heap_/erase_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/thin_heap_/erase_fn_imps.hpp
new file mode 100644
index 00000000000..9fd81f75d03
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/thin_heap_/erase_fn_imps.hpp
@@ -0,0 +1,302 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file erase_fn_imps.hpp
+ * Contains an implementation for thin_heap_.
+ */
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+pop()
+{
+  PB_DS_DBG_ONLY(assert_valid();)
+    PB_DS_DBG_ASSERT(!base_type::empty());
+
+  PB_DS_DBG_ASSERT(m_p_max != NULL);
+
+  node_pointer p_nd = m_p_max;
+
+  remove_max_node();
+
+  base_type::actual_erase_node(p_nd);
+
+  PB_DS_DBG_ONLY(assert_valid();)
+    }
+
+PB_DS_CLASS_T_DEC
+inline void
+PB_DS_CLASS_C_DEC::
+remove_max_node()
+{
+  to_aux_except_max();
+
+  make_from_aux();
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+to_aux_except_max()
+{
+  node_pointer p_add = base_type::m_p_root;
+
+  while (p_add != m_p_max)
+    {
+      node_pointer p_next_add = p_add->m_p_next_sibling;
+
+      add_to_aux(p_add);
+
+      p_add = p_next_add;
+    }
+
+  p_add = m_p_max->m_p_l_child;
+
+  while (p_add != NULL)
+    {
+      node_pointer p_next_add = p_add->m_p_next_sibling;
+
+      p_add->m_metadata = p_add->m_p_l_child == NULL?
+	0 :
+	p_add->m_p_l_child->m_metadata + 1;
+
+      add_to_aux(p_add);
+
+      p_add = p_next_add;
+    }
+
+  p_add = m_p_max->m_p_next_sibling;
+
+  while (p_add != NULL)
+    {
+      node_pointer p_next_add = p_add->m_p_next_sibling;
+
+      add_to_aux(p_add);
+
+      p_add = p_next_add;
+    }
+}
+
+PB_DS_CLASS_T_DEC
+inline void
+PB_DS_CLASS_C_DEC::
+add_to_aux(node_pointer p_nd)
+{
+  size_type r = p_nd->m_metadata;
+
+  while (m_a_aux[r] != NULL)
+    {
+      PB_DS_DBG_ASSERT(p_nd->m_metadata < rank_bound());
+
+      if (Cmp_Fn::operator()(m_a_aux[r]->m_value, p_nd->m_value))
+	make_child_of(m_a_aux[r], p_nd);
+      else
+        {
+	  make_child_of(p_nd, m_a_aux[r]);
+
+	  p_nd = m_a_aux[r];
+        }
+
+      m_a_aux[r] = NULL;
+
+      ++r;
+    }
+
+  PB_DS_DBG_ASSERT(p_nd->m_metadata < rank_bound());
+
+  m_a_aux[r] = p_nd;
+}
+
+PB_DS_CLASS_T_DEC
+inline void
+PB_DS_CLASS_C_DEC::
+make_child_of(node_pointer p_nd, node_pointer p_new_parent)
+{
+  PB_DS_DBG_ASSERT(p_nd->m_metadata == p_new_parent->m_metadata);
+  PB_DS_DBG_ASSERT(m_a_aux[p_nd->m_metadata] == p_nd ||
+		   m_a_aux[p_nd->m_metadata] == p_new_parent);
+
+  ++p_new_parent->m_metadata;
+
+  base_type::make_child_of(p_nd, p_new_parent);
+}
+
+PB_DS_CLASS_T_DEC
+inline void
+PB_DS_CLASS_C_DEC::
+make_from_aux()
+{
+  base_type::m_p_root = m_p_max = NULL;
+
+  const size_type rnk_bnd = rank_bound();
+
+  size_type i = 0;
+
+  while (i < rnk_bnd)
+    {
+      if (m_a_aux[i] != NULL)
+        {
+	  make_root_and_link(m_a_aux[i]);
+
+	  m_a_aux[i] = NULL;
+        }
+
+      ++i;
+    }
+
+  PB_DS_DBG_ONLY(assert_aux_null();)
+    }
+
+PB_DS_CLASS_T_DEC
+inline void
+PB_DS_CLASS_C_DEC::
+remove_node(node_pointer p_nd)
+{
+  node_pointer p_parent = p_nd;
+  while (base_type::parent(p_parent) != NULL)
+    p_parent = base_type::parent(p_parent);
+
+  base_type::bubble_to_top(p_nd);
+
+  m_p_max = p_nd;
+
+  node_pointer p_fix = base_type::m_p_root;
+  while (p_fix != NULL&&  p_fix->m_p_next_sibling != p_parent)
+    p_fix = p_fix->m_p_next_sibling;
+
+  if (p_fix != NULL)
+    p_fix->m_p_next_sibling = p_nd;
+
+  remove_max_node();
+}
+
+PB_DS_CLASS_T_DEC
+inline void
+PB_DS_CLASS_C_DEC::
+clear()
+{
+  base_type::clear();
+
+  m_p_max = NULL;
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+erase(point_iterator it)
+{
+  PB_DS_DBG_ONLY(assert_valid();)
+    PB_DS_DBG_ASSERT(!base_type::empty());
+
+  node_pointer p_nd = it.m_p_nd;
+
+  remove_node(p_nd);
+
+  base_type::actual_erase_node(p_nd);
+
+  PB_DS_DBG_ONLY(assert_valid();)
+    }
+
+PB_DS_CLASS_T_DEC
+template<typename Pred>
+typename PB_DS_CLASS_C_DEC::size_type
+PB_DS_CLASS_C_DEC::
+erase_if(Pred pred)
+{
+  PB_DS_DBG_ONLY(assert_valid();)
+
+    if (base_type::empty())
+      {
+        PB_DS_DBG_ONLY(assert_valid();)
+
+	  return 0;
+      }
+
+  base_type::to_linked_list();
+
+  node_pointer p_out = base_type::prune(pred);
+
+  size_type ersd = 0;
+
+  while (p_out != NULL)
+    {
+      ++ersd;
+
+      node_pointer p_next = p_out->m_p_next_sibling;
+
+      base_type::actual_erase_node(p_out);
+
+      p_out = p_next;
+    }
+
+  node_pointer p_cur = base_type::m_p_root;
+
+  m_p_max = base_type::m_p_root = NULL;
+
+  while (p_cur != NULL)
+    {
+      node_pointer p_next = p_cur->m_p_next_sibling;
+
+      make_root_and_link(p_cur);
+
+      p_cur = p_next;
+    }
+
+  PB_DS_DBG_ONLY(assert_valid();)
+
+    return ersd;
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::size_type
+PB_DS_CLASS_C_DEC::
+rank_bound()
+{
+  const std::size_t* const p_upper =
+    std::upper_bound(            g_a_rank_bounds, g_a_rank_bounds + num_distinct_rank_bounds, base_type::m_size);
+
+  if (p_upper == g_a_rank_bounds + num_distinct_rank_bounds)
+    return max_rank;
+
+  return (p_upper - g_a_rank_bounds);
+}
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/thin_heap_/find_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/thin_heap_/find_fn_imps.hpp
new file mode 100644
index 00000000000..9a3fb87be15
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/thin_heap_/find_fn_imps.hpp
@@ -0,0 +1,57 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file find_fn_imps.hpp
+ * Contains an implementation for thin_heap_.
+ */
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::const_reference
+PB_DS_CLASS_C_DEC::
+top() const
+{
+  PB_DS_DBG_ONLY(assert_valid();)
+    PB_DS_DBG_ASSERT(!base_type::empty());
+
+  PB_DS_DBG_ASSERT(m_p_max != NULL);
+  return m_p_max->m_value;
+}
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/thin_heap_/insert_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/thin_heap_/insert_fn_imps.hpp
new file mode 100644
index 00000000000..3eacd78e7b0
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/thin_heap_/insert_fn_imps.hpp
@@ -0,0 +1,332 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file insert_fn_imps.hpp
+ * Contains an implementation for thin_heap_.
+ */
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::point_iterator
+PB_DS_CLASS_C_DEC::
+push(const_reference r_val)
+{
+  PB_DS_DBG_ONLY(assert_valid();)
+
+    node_pointer p_nd = base_type::get_new_node_for_insert(r_val);
+
+  p_nd->m_metadata = 0;
+
+  p_nd->m_p_prev_or_parent = p_nd->m_p_l_child = NULL;
+
+  if (base_type::m_p_root == NULL)
+    {
+      p_nd->m_p_next_sibling = NULL;
+
+      m_p_max = base_type::m_p_root = p_nd;
+
+      PB_DS_DBG_ONLY(assert_valid();)
+
+        return point_iterator(p_nd);
+    }
+
+  p_nd->m_p_next_sibling = base_type::m_p_root;
+
+  base_type::m_p_root->m_p_prev_or_parent = NULL;
+
+  base_type::m_p_root = p_nd;
+
+  update_max(p_nd);
+
+  PB_DS_DBG_ONLY(assert_valid();)
+
+    return point_iterator(p_nd);
+}
+
+PB_DS_CLASS_T_DEC
+inline void
+PB_DS_CLASS_C_DEC::
+make_root(node_pointer p_nd)
+{
+  p_nd->m_metadata =
+    p_nd->m_p_l_child == NULL?
+    0 :
+    1 + p_nd->m_p_l_child->m_metadata;
+}
+
+PB_DS_CLASS_T_DEC
+inline void
+PB_DS_CLASS_C_DEC::
+make_root_and_link(node_pointer p_nd)
+{
+  make_root(p_nd);
+
+  p_nd->m_p_prev_or_parent = NULL;
+
+  p_nd->m_p_next_sibling = base_type::m_p_root;
+
+  if (base_type::m_p_root != NULL)
+    base_type::m_p_root->m_p_prev_or_parent = NULL;
+
+  base_type::m_p_root = p_nd;
+
+  update_max(p_nd);
+}
+
+PB_DS_CLASS_T_DEC
+inline void
+PB_DS_CLASS_C_DEC::
+fix(node_pointer p_y)
+{
+  while (true)
+    {
+      if (p_y->m_p_prev_or_parent == NULL)
+        {
+	  fix_root(p_y);
+
+	  return;
+        }
+      else if (p_y->m_metadata == 1&&  p_y->m_p_next_sibling == NULL)
+        {
+	  if (p_y->m_p_l_child != NULL)
+            {
+	      fix_sibling_rank_1_unmarked(p_y);
+
+	      return;
+            }
+
+	  fix_sibling_rank_1_marked(p_y);
+
+	  p_y = p_y->m_p_prev_or_parent;
+        }
+      else if (p_y->m_metadata > p_y->m_p_next_sibling->m_metadata + 1)
+        {
+	  PB_DS_DBG_ASSERT(p_y->m_p_l_child != NULL);
+
+	  if (p_y->m_metadata != p_y->m_p_l_child->m_metadata + 2)
+            {
+	      fix_sibling_general_unmarked(p_y);
+
+	      return;
+            }
+
+	  fix_sibling_general_marked(p_y);
+
+	  p_y = p_y->m_p_prev_or_parent;
+        }
+      else if ((p_y->m_p_l_child == NULL&& 
+                p_y->m_metadata == 2) ||(p_y->m_p_l_child != NULL&& 
+					 p_y->m_metadata == p_y->m_p_l_child->m_metadata + 3))
+        {
+	  node_pointer p_z = p_y->m_p_prev_or_parent;
+
+	  fix_child(p_y);
+
+	  p_y = p_z;
+        }
+      else
+	return;
+    }
+}
+
+PB_DS_CLASS_T_DEC
+inline void
+PB_DS_CLASS_C_DEC::
+fix_root(node_pointer p_y)
+{
+  PB_DS_DBG_ASSERT(p_y->m_p_prev_or_parent == NULL);
+
+  make_root(p_y);
+
+  PB_DS_DBG_ONLY(assert_node_consistent(p_y, true);)
+    }
+
+PB_DS_CLASS_T_DEC
+inline void
+PB_DS_CLASS_C_DEC::
+fix_sibling_rank_1_unmarked(node_pointer p_y)
+{
+  PB_DS_DBG_ASSERT(p_y->m_p_prev_or_parent != NULL);
+
+  PB_DS_DBG_ONLY(node_pointer p_w = p_y->m_p_l_child;)
+    PB_DS_DBG_ASSERT(p_w != NULL);
+  PB_DS_DBG_ASSERT(p_w->m_p_next_sibling == NULL);
+  PB_DS_DBG_ASSERT(p_y->m_p_next_sibling == NULL);
+
+  p_y->m_p_next_sibling = p_y->m_p_l_child;
+
+  p_y->m_p_next_sibling->m_p_prev_or_parent = p_y;
+
+  p_y->m_p_l_child = NULL;
+
+  PB_DS_DBG_ONLY(assert_node_consistent(p_y, false);)
+    }
+
+PB_DS_CLASS_T_DEC
+inline void
+PB_DS_CLASS_C_DEC::
+fix_sibling_rank_1_marked(node_pointer p_y)
+{
+  PB_DS_DBG_ASSERT(p_y->m_p_prev_or_parent != NULL);
+  PB_DS_DBG_ASSERT(p_y->m_p_l_child == NULL);
+
+  p_y->m_metadata = 0;
+
+  PB_DS_DBG_ONLY(assert_node_consistent(p_y, false);)
+    }
+
+PB_DS_CLASS_T_DEC
+inline void
+PB_DS_CLASS_C_DEC::
+fix_sibling_general_unmarked(node_pointer p_y)
+{
+  PB_DS_DBG_ASSERT(p_y->m_p_prev_or_parent != NULL);
+
+  node_pointer p_w = p_y->m_p_l_child;
+  PB_DS_DBG_ASSERT(p_w != NULL);
+  PB_DS_DBG_ASSERT(p_w->m_p_next_sibling != NULL);
+
+  p_y->m_p_l_child = p_w->m_p_next_sibling;
+  p_w->m_p_next_sibling->m_p_prev_or_parent = p_y;
+
+  p_w->m_p_next_sibling = p_y->m_p_next_sibling;
+  PB_DS_DBG_ASSERT(p_w->m_p_next_sibling != NULL);
+  p_w->m_p_next_sibling->m_p_prev_or_parent = p_w;
+
+  p_y->m_p_next_sibling = p_w;
+  p_w->m_p_prev_or_parent = p_y;
+
+  PB_DS_DBG_ONLY(assert_node_consistent(p_y, false);)
+    }
+
+PB_DS_CLASS_T_DEC
+inline void
+PB_DS_CLASS_C_DEC::
+fix_sibling_general_marked(node_pointer p_y)
+{
+  PB_DS_DBG_ASSERT(p_y->m_p_prev_or_parent != NULL);
+
+  --p_y->m_metadata;
+
+  PB_DS_DBG_ONLY(assert_node_consistent(p_y, false);)
+    }
+
+PB_DS_CLASS_T_DEC
+inline void
+PB_DS_CLASS_C_DEC::
+fix_child(node_pointer p_y)
+{
+  PB_DS_DBG_ASSERT(p_y->m_p_prev_or_parent != NULL);
+
+  if (p_y->m_p_next_sibling != NULL)
+    p_y->m_p_next_sibling->m_p_prev_or_parent = p_y->m_p_prev_or_parent;
+
+  if (p_y->m_p_prev_or_parent->m_p_l_child == p_y)
+    p_y->m_p_prev_or_parent->m_p_l_child = p_y->m_p_next_sibling;
+  else
+    p_y->m_p_prev_or_parent->m_p_next_sibling = p_y->m_p_next_sibling;
+
+  make_root_and_link(p_y);
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+modify(point_iterator it, const_reference r_new_val)
+{
+  PB_DS_DBG_ONLY(assert_valid();)
+    node_pointer p_nd = it.m_p_nd;
+
+  PB_DS_DBG_ASSERT(p_nd != NULL);
+
+  const bool smaller = Cmp_Fn::operator()(r_new_val, p_nd->m_value);
+
+  p_nd->m_value = r_new_val;
+
+  if (smaller)
+    {
+      remove_node(p_nd);
+
+      p_nd->m_p_l_child = NULL;
+
+      make_root_and_link(p_nd);
+
+      PB_DS_DBG_ONLY(assert_valid();)
+
+        return;
+    }
+
+  if (p_nd->m_p_prev_or_parent == NULL)
+    {
+      update_max(p_nd);
+
+      PB_DS_DBG_ONLY(assert_valid();)
+
+        return;
+    }
+
+  node_pointer p_y = p_nd->m_p_prev_or_parent;
+  PB_DS_DBG_ASSERT(p_y != NULL);
+
+  if (p_nd->m_p_next_sibling != NULL)
+    p_nd->m_p_next_sibling->m_p_prev_or_parent = p_y;
+
+  if (p_y->m_p_l_child == p_nd)
+    p_y->m_p_l_child = p_nd->m_p_next_sibling;
+  else
+    p_y->m_p_next_sibling = p_nd->m_p_next_sibling;
+
+  fix(p_y);
+
+  make_root_and_link(p_nd);
+
+  PB_DS_DBG_ONLY(assert_valid();)
+    }
+
+PB_DS_CLASS_T_DEC
+inline void
+PB_DS_CLASS_C_DEC::
+update_max(node_pointer p_nd)
+{
+  if (m_p_max == NULL || Cmp_Fn::operator()(m_p_max->m_value, p_nd->m_value))
+    m_p_max = p_nd;
+}
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/thin_heap_/split_join_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/thin_heap_/split_join_fn_imps.hpp
new file mode 100644
index 00000000000..58c7e18ad58
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/thin_heap_/split_join_fn_imps.hpp
@@ -0,0 +1,132 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file split_join_fn_imps.hpp
+ * Contains an implementation for thin_heap_.
+ */
+
+PB_DS_CLASS_T_DEC
+template<typename Pred>
+void
+PB_DS_CLASS_C_DEC::
+split(Pred pred, PB_DS_CLASS_C_DEC& other)
+{
+  PB_DS_DBG_ONLY(assert_valid();)
+    PB_DS_DBG_ONLY(other.assert_valid();)
+
+    other.clear();
+
+  if (base_type::empty())
+    {
+      PB_DS_DBG_ONLY(assert_valid();)
+        PB_DS_DBG_ONLY(other.assert_valid();)
+
+        return;
+    }
+
+  base_type::to_linked_list();
+
+  node_pointer p_out = base_type::prune(pred);
+
+  while (p_out != NULL)
+    {
+      PB_DS_DBG_ASSERT(base_type::m_size > 0);
+      --base_type::m_size;
+
+      ++other.m_size;
+
+      node_pointer p_next = p_out->m_p_next_sibling;
+
+      other.make_root_and_link(p_out);
+
+      p_out = p_next;
+    }
+
+  PB_DS_DBG_ONLY(other.assert_valid();)
+
+    node_pointer p_cur = base_type::m_p_root;
+
+  m_p_max = NULL;
+
+  base_type::m_p_root = NULL;
+
+  while (p_cur != NULL)
+    {
+      node_pointer p_next = p_cur->m_p_next_sibling;
+
+      make_root_and_link(p_cur);
+
+      p_cur = p_next;
+    }
+
+  PB_DS_DBG_ONLY(assert_valid();)
+    PB_DS_DBG_ONLY(other.assert_valid();)
+    }
+
+PB_DS_CLASS_T_DEC
+inline void
+PB_DS_CLASS_C_DEC::
+join(PB_DS_CLASS_C_DEC& other)
+{
+  PB_DS_DBG_ONLY(assert_valid();)
+    PB_DS_DBG_ONLY(other.assert_valid();)
+
+    node_pointer p_other = other.m_p_root;
+
+  while (p_other != NULL)
+    {
+      node_pointer p_next = p_other->m_p_next_sibling;
+
+      make_root_and_link(p_other);
+
+      p_other = p_next;
+    }
+
+  base_type::m_size += other.m_size;
+
+  other.m_p_root = NULL;
+  other.m_size = 0;
+  other.m_p_max = NULL;
+
+  PB_DS_DBG_ONLY(assert_valid();)
+    PB_DS_DBG_ONLY(other.assert_valid();)
+    }
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/thin_heap_/thin_heap_.hpp b/libstdc++-v3/include/ext/pb_ds/detail/thin_heap_/thin_heap_.hpp
new file mode 100644
index 00000000000..4c4f423584d
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/thin_heap_/thin_heap_.hpp
@@ -0,0 +1,392 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file thin_heap_.hpp
+ * Contains an implementation class for a thin heap.
+ */
+
+#ifndef PB_DS_THIN_HEAP_HPP
+#define PB_DS_THIN_HEAP_HPP
+
+/*
+ * Thin heaps.
+ * Tarjan and Kaplan.
+ */
+
+#ifdef PB_DS_THIN_HEAP_DEBUG_
+#include <cassert>
+#endif // #ifdef PB_DS_THIN_HEAP_DEBUG_
+#include <algorithm>
+#include <ext/pb_ds/detail/cond_dealtor.hpp>
+#include <ext/pb_ds/detail/type_utils.hpp>
+#include <ext/pb_ds/detail/left_child_next_sibling_heap_/left_child_next_sibling_heap_.hpp>
+#include <ext/pb_ds/detail/left_child_next_sibling_heap_/null_metadata.hpp>
+
+namespace pb_ds
+{
+  namespace detail
+  {
+
+#ifdef PB_DS_THIN_HEAP_DEBUG_
+#define PB_DS_DBG_ASSERT(X) assert(X)
+#define PB_DS_DBG_VERIFY(X) assert(X)
+#define PB_DS_DBG_ONLY(X) X
+#else // #ifdef PB_DS_THIN_HEAP_DEBUG_
+#define PB_DS_DBG_ASSERT(X)
+#define PB_DS_DBG_VERIFY(X) {if((X)==0);}
+#define PB_DS_DBG_ONLY(X) ;
+#endif // #ifdef PB_DS_THIN_HEAP_DEBUG_
+
+#define PB_DS_CLASS_T_DEC						\
+    template<typename Value_Type, class Cmp_Fn, class Allocator>
+
+#define PB_DS_CLASS_C_DEC				\
+    thin_heap_<						\
+					Value_Type,	\
+					Cmp_Fn,		\
+					Allocator>
+
+#ifdef PB_DS_LC_NS_HEAP_DEBUG_
+#define PB_DS_BASE_C_DEC						\
+    left_child_next_sibling_heap_<			\
+									Value_Type, \
+									Cmp_Fn,	\
+									typename Allocator::size_type, \
+									Allocator, \
+									true>
+#else // #ifdef PB_DS_LC_NS_HEAP_DEBUG_
+#define PB_DS_BASE_C_DEC						\
+    left_child_next_sibling_heap_<			\
+									Value_Type, \
+									Cmp_Fn,	\
+									typename Allocator::size_type, \
+									Allocator>
+#endif // #ifdef PB_DS_LC_NS_HEAP_DEBUG_
+
+    /**
+     * class description = "t|-|i|\| h34p">
+     **/
+    template<typename Value_Type, class Cmp_Fn, class Allocator>
+    class thin_heap_ : public PB_DS_BASE_C_DEC
+    {
+
+    private:
+      typedef PB_DS_BASE_C_DEC base_type;
+
+    protected:
+      typedef typename base_type::node node;
+
+      typedef typename base_type::node_pointer node_pointer;
+
+      typedef typename base_type::const_node_pointer const_node_pointer;
+
+    public:
+
+      typedef typename Allocator::size_type size_type;
+
+      typedef typename Allocator::difference_type difference_type;
+
+      typedef Value_Type value_type;
+
+      typedef
+      typename Allocator::template rebind<
+	value_type>::other::pointer
+      pointer;
+
+      typedef
+      typename Allocator::template rebind<
+	value_type>::other::const_pointer
+      const_pointer;
+
+      typedef
+      typename Allocator::template rebind<
+	value_type>::other::reference
+      reference;
+
+      typedef
+      typename Allocator::template rebind<
+	value_type>::other::const_reference
+      const_reference;
+
+      typedef
+      typename PB_DS_BASE_C_DEC::const_point_iterator
+      const_point_iterator;
+
+      typedef typename PB_DS_BASE_C_DEC::point_iterator point_iterator;
+
+      typedef typename PB_DS_BASE_C_DEC::const_iterator const_iterator;
+
+      typedef typename PB_DS_BASE_C_DEC::iterator iterator;
+
+      typedef Cmp_Fn cmp_fn;
+
+      typedef Allocator allocator;
+
+    public:
+
+      inline point_iterator
+      push(const_reference r_val);
+
+      void
+      modify(point_iterator it, const_reference r_new_val);
+
+      inline const_reference
+      top() const;
+
+      void
+      pop();
+
+      void
+      erase(point_iterator it);
+
+      inline void
+      clear();
+
+      template<typename Pred>
+      size_type
+      erase_if(Pred pred);
+
+      template<typename Pred>
+      void
+      split(Pred pred, PB_DS_CLASS_C_DEC& other);
+
+      void
+      join(PB_DS_CLASS_C_DEC& other);
+
+    protected:
+
+      thin_heap_();
+
+      thin_heap_(const Cmp_Fn& r_cmp_fn);
+
+      thin_heap_(const PB_DS_CLASS_C_DEC& other);
+
+      void
+      swap(PB_DS_CLASS_C_DEC& other);
+
+      ~thin_heap_();
+
+      template<typename It>
+      void
+      copy_from_range(It first_it, It last_it);
+
+#ifdef PB_DS_THIN_HEAP_DEBUG_
+
+      void
+      assert_valid() const;
+
+      void
+      assert_max() const;
+
+#endif // #ifdef PB_DS_THIN_HEAP_DEBUG_
+
+#ifdef PB_DS_THIN_HEAP_TRACE_
+
+      void
+      trace() const;
+
+#endif // #ifdef PB_DS_THIN_HEAP_TRACE_
+
+    private:
+      enum
+	{
+	  max_rank = (sizeof(size_type) << 4) + 2
+	};
+
+    private:
+
+      void
+      initialize();
+
+      inline void
+      update_max(node_pointer p_nd);
+
+      inline void
+      fix(node_pointer p_nd);
+
+      inline void
+      fix_root(node_pointer p_y);
+
+      inline void
+      fix_sibling_rank_1_unmarked(node_pointer p_y);
+
+      inline void
+      fix_sibling_rank_1_marked(node_pointer p_y);
+
+      inline void
+      fix_sibling_general_unmarked(node_pointer p_y);
+
+      inline void
+      fix_sibling_general_marked(node_pointer p_y);
+
+      inline void
+      fix_child(node_pointer p_y);
+
+      inline static void
+      make_root(node_pointer p_nd);
+
+      inline void
+      make_root_and_link(node_pointer p_nd);
+
+      inline void
+      remove_max_node();
+
+      void
+      to_aux_except_max();
+
+      inline void
+      add_to_aux(node_pointer p_nd);
+
+      inline void
+      make_from_aux();
+
+      inline size_type
+      rank_bound();
+
+      inline void
+      make_child_of(node_pointer p_nd, node_pointer p_new_parent);
+
+      inline void
+      remove_node(node_pointer p_nd);
+
+      inline node_pointer
+      join(node_pointer p_lhs, node_pointer p_rhs) const;
+
+#ifdef PB_DS_THIN_HEAP_DEBUG_
+
+      void
+      assert_node_consistent(const_node_pointer p_nd, bool root) const;
+
+      void
+      assert_aux_null() const;
+
+#endif // #ifdef PB_DS_THIN_HEAP_DEBUG_
+
+    private:
+      node_pointer m_p_max;
+
+      node_pointer m_a_aux[max_rank];
+    };
+
+    enum
+      {
+	num_distinct_rank_bounds = 48
+      };
+
+    // Taken from the SGI implementation; acknowledged in the docs.
+
+    static const std::size_t g_a_rank_bounds[num_distinct_rank_bounds] =
+      {
+	/* Dealing cards... */
+	/* 0     */ 0ul,
+	/* 1     */ 1ul,
+	/* 2     */ 1ul,
+	/* 3     */ 2ul,
+	/* 4     */ 4ul,
+	/* 5     */ 6ul,
+	/* 6     */ 11ul,
+	/* 7     */ 17ul,
+	/* 8     */ 29ul,
+	/* 9     */ 46ul,
+	/* 10    */ 76ul,
+	/* 11    */ 122ul,
+	/* 12    */ 199ul,
+	/* 13    */ 321ul,
+	/* 14    */ 521ul,
+	/* 15    */ 842ul,
+	/* 16    */ 1364ul,
+	/* 17    */ 2206ul,
+	/* 18    */ 3571ul,
+	/* 19    */ 5777ul,
+	/* 20    */ 9349ul,
+	/* 21    */ 15126ul,
+	/* 22    */ 24476ul,
+	/* 23    */ 39602ul,
+	/* 24    */ 64079ul,
+	/* 25    */ 103681ul,
+	/* 26    */ 167761ul,
+	/* 27    */ 271442ul,
+	/* 28    */ 439204ul,
+	/* 29    */ 710646ul,
+	/* 30    */ 1149851ul,
+	/* 31    */ 1860497ul,
+	/* 32    */ 3010349ul,
+	/* 33    */ 4870846ul,
+	/* 34    */ 7881196ul,
+	/* 35    */ 12752042ul,
+	/* 36    */ 20633239ul,
+	/* 37    */ 33385282ul,
+	/* 38    */ 54018521ul,
+	/* 39    */ 87403803ul,
+	/* 40    */ 141422324ul,
+	/* 41    */ 228826127ul,
+	/* 42    */ 370248451ul,
+	/* 43    */ 599074578ul,
+	/* 44    */ 969323029ul,
+	/* 45    */ 1568397607ul,
+	/* 46    */ 2537720636ul,
+	/* 47    */ 4106118243ul
+	/* Pot's good, let's play */
+      };
+
+#include <ext/pb_ds/detail/thin_heap_/constructors_destructor_fn_imps.hpp>
+#include <ext/pb_ds/detail/thin_heap_/debug_fn_imps.hpp>
+#include <ext/pb_ds/detail/thin_heap_/trace_fn_imps.hpp>
+#include <ext/pb_ds/detail/thin_heap_/find_fn_imps.hpp>
+#include <ext/pb_ds/detail/thin_heap_/insert_fn_imps.hpp>
+#include <ext/pb_ds/detail/thin_heap_/erase_fn_imps.hpp>
+#include <ext/pb_ds/detail/thin_heap_/split_join_fn_imps.hpp>
+
+#undef PB_DS_CLASS_C_DEC
+
+#undef PB_DS_CLASS_T_DEC
+
+#undef PB_DS_BASE_C_DEC
+
+#undef PB_DS_DBG_ASSERT
+#undef PB_DS_DBG_VERIFY
+#undef PB_DS_DBG_ONLY
+
+  } // namespace detail
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_THIN_HEAP_HPP
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/thin_heap_/trace_fn_imps.hpp b/libstdc++-v3/include/ext/pb_ds/detail/thin_heap_/trace_fn_imps.hpp
new file mode 100644
index 00000000000..a4f9c8784ff
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/thin_heap_/trace_fn_imps.hpp
@@ -0,0 +1,61 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file trace_fn_imps.hpp
+ * Contains an implementation class for left_child_next_sibling_heap_.
+ */
+
+#ifdef PB_DS_THIN_HEAP_TRACE_
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+trace() const
+{
+  std::cerr << std::endl;
+
+  std::cerr << "m_p_max " << m_p_max << std::endl;
+
+  base_type::trace();
+}
+
+#endif // #ifdef PB_DS_THIN_HEAP_TRACE_
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/tree_policy/node_metadata_selector.hpp b/libstdc++-v3/include/ext/pb_ds/detail/tree_policy/node_metadata_selector.hpp
new file mode 100644
index 00000000000..3fd7dc9ac88
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/tree_policy/node_metadata_selector.hpp
@@ -0,0 +1,122 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file node_metadata_selector.hpp
+ * Contains an implementation class for trees.
+ */
+
+#ifndef PB_DS_TREE_NODE_METADATA_SELECTOR_HPP
+#define PB_DS_TREE_NODE_METADATA_SELECTOR_HPP
+
+#include <ext/pb_ds/detail/basic_tree_policy/null_node_metadata.hpp>
+#include <ext/pb_ds/detail/types_traits.hpp>
+
+namespace pb_ds
+{
+  namespace detail
+  {
+
+    template<typename Node_Update, bool Null>
+    struct tree_metadata_helper
+    {
+      typedef typename Node_Update::metadata_type type;
+    };
+
+    template<typename Node_Update>
+    struct tree_metadata_helper<
+      Node_Update,
+      true>
+    {
+      typedef null_node_metadata type;
+    };
+
+    template<typename Key,
+	     typename Data,
+	     class Cmp_Fn,
+	     template<typename Const_Node_Iterator,
+		      class Const_Iterator,
+		      class Cmp_Fn_,
+		      class Allocator_>
+    class Node_Update,
+	     class Allocator>
+    struct tree_node_metadata_selector
+    {
+    private:
+      typedef
+      dumconst_node_iterator<
+      Key,
+      Data,
+      Allocator>
+      dumconst_node_it;
+
+      enum
+	{
+	  null_update =
+	  is_same<
+	  Node_Update<
+	  dumconst_node_it,
+	  dumconst_node_it,
+	  Cmp_Fn,
+	  Allocator>,
+	  null_tree_node_update<
+	  dumconst_node_it,
+	  dumconst_node_it,
+	  Cmp_Fn,
+	  Allocator> >::value
+	};
+
+    public:
+      typedef
+      typename tree_metadata_helper<
+      Node_Update<
+      dumconst_node_it,
+      dumconst_node_it,
+      Cmp_Fn,
+      Allocator>,
+      null_update>::type
+      type;
+    };
+
+  } // namespace detail
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_TREE_NODE_METADATA_SELECTOR_HPP
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/tree_policy/null_node_update_imp.hpp b/libstdc++-v3/include/ext/pb_ds/detail/tree_policy/null_node_update_imp.hpp
new file mode 100644
index 00000000000..d9c596798c1
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/tree_policy/null_node_update_imp.hpp
@@ -0,0 +1,56 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file null_node_update_imp.hpp
+ * Contains an implementation of null_node_update.
+ */
+
+PB_DS_CLASS_T_DEC
+template<typename Const_Node_Iterator_,
+	 typename Node_Iterator_,
+	 class    Cmp_Fn_,
+	 typename Allocator_>
+inline void
+PB_DS_CLASS_C_DEC::
+swap(null_tree_node_update<            Const_Node_Iterator_, Node_Iterator_, Cmp_Fn_, Allocator_>& /*other*/)
+{ }
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/tree_policy/order_statistics_imp.hpp b/libstdc++-v3/include/ext/pb_ds/detail/tree_policy/order_statistics_imp.hpp
new file mode 100644
index 00000000000..85f4d166a56
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/tree_policy/order_statistics_imp.hpp
@@ -0,0 +1,147 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file order_statistics_imp.hpp
+ * Contains forward declarations for order_statistics_key
+ */
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::iterator
+PB_DS_CLASS_C_DEC::
+find_by_order(size_type order)
+{
+  node_iterator it = node_begin();
+
+  node_iterator end_it = node_end();
+
+  while (it != end_it)
+    {
+      node_iterator l_it = it.get_l_child();
+
+      const size_type o = (l_it == end_it)?
+	0 :
+	l_it.get_metadata();
+
+      if (order == o)
+	return (*it);
+      else if (order < o)
+	it = l_it;
+      else
+        {
+	  order -= o + 1;
+
+	  it = it.get_r_child();
+        }
+    }
+
+  return (PB_DS_BASE_C_DEC::end_iterator());
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::const_iterator
+PB_DS_CLASS_C_DEC::
+find_by_order(size_type order) const
+{
+  return (const_cast<PB_DS_CLASS_C_DEC* >(this)->find_by_order(order));
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::size_type
+PB_DS_CLASS_C_DEC::
+order_of_key(const_key_reference r_key) const
+{
+  const_node_iterator it = node_begin();
+
+  const_node_iterator end_it = node_end();
+
+  const cmp_fn& r_cmp_fn =
+    const_cast<PB_DS_CLASS_C_DEC* >(this)->get_cmp_fn();
+
+  size_type ord = 0;
+
+  while (it != end_it)
+    {
+      const_node_iterator l_it = it.get_l_child();
+
+      if (r_cmp_fn(r_key, extract_key(*(*it))))
+	it = l_it;
+      else if (r_cmp_fn(extract_key(*(*it)), r_key))
+        {
+
+	  ord += (l_it == end_it)?
+	    1 :
+	    1 + l_it.get_metadata();
+
+	  it = it.get_r_child();
+        }
+      else
+        {
+	  ord += (l_it == end_it)?
+	    0 :
+	    l_it.get_metadata();
+
+	  it = end_it;
+        }
+    }
+
+  return (ord);
+}
+
+PB_DS_CLASS_T_DEC
+inline void
+PB_DS_CLASS_C_DEC::
+operator()(node_iterator node_it, const_node_iterator end_nd_it) const
+{
+  node_iterator l_child_it = node_it.get_l_child();
+  const size_type l_rank =(l_child_it == end_nd_it)? 0 : l_child_it.get_metadata();
+
+  node_iterator r_child_it = node_it.get_r_child();
+  const size_type r_rank =(r_child_it == end_nd_it)? 0 : r_child_it.get_metadata();
+
+  const_cast<metadata_reference>(node_it.get_metadata())=
+    1 + l_rank + r_rank;
+}
+
+PB_DS_CLASS_T_DEC
+PB_DS_CLASS_C_DEC::
+~tree_order_statistics_node_update()
+{ }
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/tree_policy/sample_tree_node_update.hpp b/libstdc++-v3/include/ext/pb_ds/detail/tree_policy/sample_tree_node_update.hpp
new file mode 100644
index 00000000000..5b7d7c51aac
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/tree_policy/sample_tree_node_update.hpp
@@ -0,0 +1,78 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file sample_tree_node_update.hpp
+ * Contains a samle node update functor.
+ */
+
+#ifndef PB_DS_SAMPLE_TREE_NODE_UPDATOR_HPP
+#define PB_DS_SAMPLE_TREE_NODE_UPDATOR_HPP
+
+// A sample node updator.
+template<typename Const_Node_Iterator,
+
+	 class Node_Iterator,
+
+	 class Cmp_Fn,
+
+	 class Allocator
+	 >
+class sample_tree_node_update
+{
+
+public:
+
+  // Metadata type.
+  typedef size_t metadata_type;
+
+protected:
+
+  // Default constructor.
+  sample_tree_node_update();
+
+  // Updates the rank of a node through a node_iterator node_it; end_nd_it is the end node iterator.
+  inline void
+  operator()(node_iterator node_it, const_node_iterator end_nd_it) const;
+
+};
+
+#endif // #ifndef PB_DS_SAMPLE_TREE_NODE_UPDATOR_HPP
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/tree_trace_base.hpp b/libstdc++-v3/include/ext/pb_ds/detail/tree_trace_base.hpp
new file mode 100644
index 00000000000..791f2fc6f2d
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/tree_trace_base.hpp
@@ -0,0 +1,215 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file tree_trace_base.hpp
+ * Contains tree-related policies.
+ */
+
+#ifndef PB_DS_TREE_TRACE_BASE_HPP
+#define PB_DS_TREE_TRACE_BASE_HPP
+
+#ifdef PB_DS_TREE_TRACE
+
+#include <ext/pb_ds/detail/basic_tree_policy/basic_tree_policy_base.hpp>
+#include <ext/pb_ds/detail/basic_tree_policy/null_node_metadata.hpp>
+
+namespace pb_ds
+{
+
+  namespace detail
+  {
+
+#ifdef PB_DS_TREE_TRACE
+
+#define PB_DS_CLASS_T_DEC						\
+    template<								\
+						class Const_Node_Iterator, \
+						class Node_Iterator,	\
+						class Cmp_Fn,		\
+						bool Node_Based,	\
+						class Allocator>
+
+#define PB_DS_CLASS_C_DEC						\
+    tree_trace_base<							\
+						Const_Node_Iterator,	\
+						Node_Iterator,		\
+						Cmp_Fn,			\
+						Node_Based,		\
+						Allocator>
+
+#define PB_DS_BASE_C_DEC						\
+    basic_tree_policy_base<				\
+								Const_Node_Iterator, \
+								Node_Iterator, \
+								Allocator>
+
+    template<typename Const_Node_Iterator,
+	     class Node_Iterator,
+	     class Cmp_Fn,
+	     bool Node_Based,
+	     class Allocator>
+    class tree_trace_base : private PB_DS_BASE_C_DEC
+    {
+    public:
+      void
+      trace() const;
+
+    private:
+      typedef PB_DS_BASE_C_DEC base_type;
+
+      typedef Const_Node_Iterator const_node_iterator;
+
+      typedef typename Allocator::size_type size_type;
+
+    private:
+      void
+      trace_node(const_node_iterator nd_it, size_type level) const;
+
+      virtual bool
+      empty() const = 0;
+
+      virtual const_node_iterator
+      node_begin() const = 0;
+
+      virtual const_node_iterator
+      node_end() const = 0;
+
+      static void
+      print_node_pointer(Const_Node_Iterator nd_it, integral_constant<int,true>);
+
+      static void
+      print_node_pointer(Const_Node_Iterator nd_it, integral_constant<int,false>);
+
+      template<typename Metadata_>
+      static void
+      trace_it_metadata(Const_Node_Iterator nd_it, type_to_type<Metadata_>);
+
+      static void
+      trace_it_metadata(Const_Node_Iterator, type_to_type<null_node_metadata>);
+    };
+
+    PB_DS_CLASS_T_DEC
+    void
+    PB_DS_CLASS_C_DEC::
+    trace() const
+    {
+      if (empty())
+        return;
+
+      trace_node(node_begin(), 0);
+    }
+
+    PB_DS_CLASS_T_DEC
+    void
+    PB_DS_CLASS_C_DEC::
+    trace_node(const_node_iterator nd_it, size_type level) const
+    {
+      if (nd_it.get_r_child() != node_end())
+        trace_node(nd_it.get_r_child(), level + 1);
+
+      for (size_type i = 0; i < level; ++i)
+        std::cerr << ' ';
+
+      print_node_pointer(nd_it, integral_constant<int,Node_Based>());
+      std::cerr << base_type::extract_key(*(*nd_it));
+
+      typedef
+        type_to_type<
+	typename const_node_iterator::metadata_type>
+        m_type_ind_t;
+
+      trace_it_metadata(nd_it, m_type_ind_t());
+
+      std::cerr << std::endl;
+
+      if (nd_it.get_l_child() != node_end())
+        trace_node(nd_it.get_l_child(), level + 1);
+    }
+
+    PB_DS_CLASS_T_DEC
+    template<typename Metadata_>
+    void
+    PB_DS_CLASS_C_DEC::
+    trace_it_metadata(Const_Node_Iterator nd_it, type_to_type<Metadata_>)
+    {
+      std::cerr << " (" <<
+        static_cast<unsigned long>(nd_it.get_metadata()) << ") ";
+    }
+
+    PB_DS_CLASS_T_DEC
+    void
+    PB_DS_CLASS_C_DEC::
+    trace_it_metadata(Const_Node_Iterator, type_to_type<null_node_metadata>)
+    { }
+
+    PB_DS_CLASS_T_DEC
+    void
+    PB_DS_CLASS_C_DEC::
+    print_node_pointer(Const_Node_Iterator nd_it, integral_constant<int,true>)
+    {
+      std::cerr << nd_it.m_p_nd << " ";
+    }
+
+    PB_DS_CLASS_T_DEC
+    void
+    PB_DS_CLASS_C_DEC::
+    print_node_pointer(Const_Node_Iterator nd_it, integral_constant<int,false>)
+    {
+      std::cerr <<* nd_it << " ";
+    }
+
+#undef PB_DS_CLASS_T_DEC
+
+#undef PB_DS_CLASS_C_DEC
+
+#undef PB_DS_BASE_C_DEC
+
+#endif // #ifdef    PB_DS_TREE_TRACE
+
+  } // namespace detail
+
+} // namespace pb_ds
+
+#endif // #ifdef PB_DS_TREE_TRACE
+
+#endif // #ifndef PB_DS_TREE_TRACE_BASE_HPP
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/trie_policy/node_metadata_selector.hpp b/libstdc++-v3/include/ext/pb_ds/detail/trie_policy/node_metadata_selector.hpp
new file mode 100644
index 00000000000..ed9e1aac6e0
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/trie_policy/node_metadata_selector.hpp
@@ -0,0 +1,122 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file node_metadata_selector.hpp
+ * Contains an implementation class for tries.
+ */
+
+#ifndef PB_DS_TRIE_NODE_METADATA_SELECTOR_HPP
+#define PB_DS_TRIE_NODE_METADATA_SELECTOR_HPP
+
+#include <ext/pb_ds/detail/basic_tree_policy/null_node_metadata.hpp>
+#include <ext/pb_ds/detail/types_traits.hpp>
+
+namespace pb_ds
+{
+  namespace detail
+  {
+
+    template<typename Node_Update, bool Null>
+    struct trie_metadata_helper
+    {
+      typedef typename Node_Update::metadata_type type;
+    };
+
+    template<typename Node_Update>
+    struct trie_metadata_helper<
+      Node_Update,
+      true>
+    {
+      typedef null_node_metadata type;
+    };
+
+    template<typename Key,
+	     typename Data,
+	     class Cmp_Fn,
+	     template<typename Const_Node_Iterator,
+		      class Const_Iterator,
+		      class Cmp_Fn_,
+		      class Allocator_>
+    class Node_Update,
+	     class Allocator>
+    struct trie_node_metadata_selector
+    {
+    private:
+      typedef
+      dumconst_node_iterator<
+      Key,
+      Data,
+      Allocator>
+      dumconst_node_it;
+
+      enum
+	{
+	  null_update =
+	  is_same<
+	  Node_Update<
+	  dumconst_node_it,
+	  dumconst_node_it,
+	  Cmp_Fn,
+	  Allocator>,
+	  null_trie_node_update<
+	  dumconst_node_it,
+	  dumconst_node_it,
+	  Cmp_Fn,
+	  Allocator> >::value
+	};
+
+    public:
+      typedef
+      typename trie_metadata_helper<
+      Node_Update<
+      dumconst_node_it,
+      dumconst_node_it,
+      Cmp_Fn,
+      Allocator>,
+      null_update>::type
+      type;
+    };
+
+  } // namespace detail
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_TRIE_NODE_METADATA_SELECTOR_HPP
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/trie_policy/null_node_update_imp.hpp b/libstdc++-v3/include/ext/pb_ds/detail/trie_policy/null_node_update_imp.hpp
new file mode 100644
index 00000000000..cb0b57fa760
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/trie_policy/null_node_update_imp.hpp
@@ -0,0 +1,56 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file null_node_update_imp.hpp
+ * Contains an implementation of null_node_update.
+ */
+
+PB_DS_CLASS_T_DEC
+template<typename Const_Node_Iterator_,
+	 typename Node_Iterator_,
+	 class    E_Access_Traits_,
+	 typename Allocator_>
+inline void
+PB_DS_CLASS_C_DEC::
+swap(null_trie_node_update<            Const_Node_Iterator_, Node_Iterator_, E_Access_Traits_, Allocator_>& /*other*/)
+{ }
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/trie_policy/order_statistics_imp.hpp b/libstdc++-v3/include/ext/pb_ds/detail/trie_policy/order_statistics_imp.hpp
new file mode 100644
index 00000000000..9351217ed1d
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/trie_policy/order_statistics_imp.hpp
@@ -0,0 +1,189 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file order_statistics_imp.hpp
+ * Contains forward declarations for order_statistics_key
+ */
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::iterator
+PB_DS_CLASS_C_DEC::
+find_by_order(size_type order)
+{
+  if (empty())
+    return (end());
+
+  ++order;
+
+  node_iterator nd_it = node_begin();
+
+  node_iterator end_nd_it = node_end();
+
+  while (true)
+    {
+      if (order > nd_it.get_metadata())
+	return (++base_type::rightmost_it(nd_it));
+
+      const size_type num_children = nd_it.num_children();
+
+      if (num_children == 0)
+	return (*nd_it);
+
+      for (size_type i = 0; i < num_children; ++i)
+        {
+	  node_iterator child_nd_it = nd_it.get_child(i);
+
+	  if (order <= child_nd_it.get_metadata())
+            {
+	      i = num_children;
+
+	      nd_it = child_nd_it;
+            }
+	  else
+	    order -= child_nd_it.get_metadata();
+        }
+    }
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::const_iterator
+PB_DS_CLASS_C_DEC::
+find_by_order(size_type order) const
+{
+  return (const_cast<PB_DS_CLASS_C_DEC* >(this)->find_by_order(order));
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::size_type
+PB_DS_CLASS_C_DEC::
+order_of_key(const_key_reference r_key) const
+{
+  const E_Access_Traits& r_traits =
+    const_cast<PB_DS_CLASS_C_DEC* >(this)->get_e_access_traits();
+
+  return (order_of_prefix(
+			  r_traits.begin(r_key),
+			  r_traits.end(r_key)));
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::size_type
+PB_DS_CLASS_C_DEC::
+order_of_prefix(typename e_access_traits::const_iterator b, typename e_access_traits::const_iterator e) const
+{
+  if (empty())
+    return (0);
+
+  const E_Access_Traits& r_traits =
+    const_cast<PB_DS_CLASS_C_DEC* >(this)->get_e_access_traits();
+
+  const_node_iterator nd_it = node_begin();
+
+  const_node_iterator end_nd_it = node_end();
+
+  size_type ord = 0;
+
+  while (true)
+    {
+      const size_type num_children = nd_it.num_children();
+
+      if (num_children == 0)
+        {
+	  const_key_reference r_key =
+	    base_type::extract_key(*(*nd_it));
+
+	  typename e_access_traits::const_iterator key_b =
+	    r_traits.begin(r_key);
+
+	  typename e_access_traits::const_iterator key_e =
+	    r_traits.end(r_key);
+
+	  return ((base_type::less(                    key_b, key_e,  b, e,  r_traits))?
+		  ord + 1 :
+		  ord);
+        }
+
+      const_node_iterator next_nd_it = end_nd_it;
+
+      size_type i = num_children - 1;
+
+      do
+        {
+	  const_node_iterator child_nd_it = nd_it.get_child(i);
+
+	  if (next_nd_it != end_nd_it)
+	    ord += child_nd_it.get_metadata();
+	  else if (!base_type::less(
+				    b, e,
+				    child_nd_it.valid_prefix().first,
+				    child_nd_it.valid_prefix().second,
+				    r_traits))
+	    next_nd_it = child_nd_it;
+        }
+      while (i-- > 0);
+
+      if (next_nd_it == end_nd_it)
+	return (ord);
+
+      nd_it = next_nd_it;
+    }
+}
+
+PB_DS_CLASS_T_DEC
+inline void
+PB_DS_CLASS_C_DEC::
+operator()(node_iterator nd_it, const_node_iterator /*end_nd_it*/) const
+{
+  const size_type num_children = nd_it.num_children();
+
+  size_type children_rank = 0;
+
+  for (size_type i = 0; i < num_children; ++i)
+    children_rank += nd_it.get_child(i).get_metadata();
+
+  const_cast<size_type& >(nd_it.get_metadata()) =(num_children == 0)? 1 : children_rank;
+}
+
+PB_DS_CLASS_T_DEC
+PB_DS_CLASS_C_DEC::
+~trie_order_statistics_node_update()
+{ }
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/trie_policy/prefix_search_node_update_imp.hpp b/libstdc++-v3/include/ext/pb_ds/detail/trie_policy/prefix_search_node_update_imp.hpp
new file mode 100644
index 00000000000..c74290ebf04
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/trie_policy/prefix_search_node_update_imp.hpp
@@ -0,0 +1,157 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file prefix_search_node_update_imp.hpp
+ * Contains an implementation of prefix_search_node_update.
+ */
+
+PB_DS_CLASS_T_DEC
+std::pair<
+  typename PB_DS_CLASS_C_DEC::const_iterator,
+  typename PB_DS_CLASS_C_DEC::const_iterator>
+PB_DS_CLASS_C_DEC::
+prefix_range(const_key_reference r_key) const
+{
+  const e_access_traits& r_traits = get_e_access_traits();
+
+  return (prefix_range(
+		       r_traits.begin(r_key),
+		       r_traits.end(r_key)));
+}
+
+PB_DS_CLASS_T_DEC
+std::pair<
+  typename PB_DS_CLASS_C_DEC::iterator,
+  typename PB_DS_CLASS_C_DEC::iterator>
+PB_DS_CLASS_C_DEC::
+prefix_range(const_key_reference r_key)
+{
+  return (prefix_range(
+		       get_e_access_traits().begin(r_key),
+		       get_e_access_traits().end(r_key)));
+}
+
+PB_DS_CLASS_T_DEC
+std::pair<
+  typename PB_DS_CLASS_C_DEC::const_iterator,
+  typename PB_DS_CLASS_C_DEC::const_iterator>
+PB_DS_CLASS_C_DEC::
+prefix_range(typename e_access_traits::const_iterator b, typename e_access_traits::const_iterator e) const
+{
+  const std::pair<iterator, iterator> non_const_ret =
+    const_cast<PB_DS_CLASS_C_DEC* >(this)->prefix_range(b, e);
+
+  return (std::make_pair(
+			 const_iterator(non_const_ret.first),
+			 const_iterator(non_const_ret.second)));
+}
+
+PB_DS_CLASS_T_DEC
+std::pair<
+  typename PB_DS_CLASS_C_DEC::iterator,
+  typename PB_DS_CLASS_C_DEC::iterator>
+PB_DS_CLASS_C_DEC::
+prefix_range(typename e_access_traits::const_iterator b, typename e_access_traits::const_iterator e)
+{
+  Node_Iterator nd_it = node_begin();
+  Node_Iterator end_nd_it = node_end();
+
+  const e_access_traits& r_traits =
+    get_e_access_traits();
+
+  const size_type given_range_length = std::distance(b, e);
+
+  while (true)
+    {
+      if (nd_it == end_nd_it)
+	return (std::make_pair(end(), end()));
+
+      const size_type common_range_length =
+	PB_DS_BASE_C_DEC::common_prefix_len(nd_it, b, e, r_traits);
+
+      if (common_range_length >= given_range_length)
+        {
+	  iterator ret_b = leftmost_it(nd_it);
+
+	  iterator ret_e = rightmost_it(nd_it);
+
+	  return (std::make_pair(ret_b, ++ret_e));
+        }
+
+      nd_it = next_child(nd_it, b, e, end_nd_it, r_traits);
+    }
+}
+
+PB_DS_CLASS_T_DEC
+typename PB_DS_CLASS_C_DEC::node_iterator
+PB_DS_CLASS_C_DEC::
+next_child(node_iterator nd_it, typename e_access_traits::const_iterator b, typename e_access_traits::const_iterator e, node_iterator end_nd_it, const e_access_traits& r_traits)
+{
+  const size_type num_children = nd_it.num_children();
+
+  node_iterator ret = end_nd_it;
+
+  size_type max_length = 0;
+
+  for (size_type i = 0; i < num_children; ++i)
+    {
+      node_iterator pot = nd_it.get_child(i);
+
+      const size_type common_range_length =
+	PB_DS_BASE_C_DEC::common_prefix_len(            pot, b, e, r_traits);
+
+      if (common_range_length > max_length)
+        {
+	  ret = pot;
+
+	  max_length = common_range_length;
+        }
+    }
+
+  return (ret);
+}
+
+PB_DS_CLASS_T_DEC
+inline void
+PB_DS_CLASS_C_DEC::
+operator()(node_iterator /*nd_it*/, const_node_iterator /*end_nd_it*/) const
+{ }
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/trie_policy/sample_trie_e_access_traits.hpp b/libstdc++-v3/include/ext/pb_ds/detail/trie_policy/sample_trie_e_access_traits.hpp
new file mode 100644
index 00000000000..954f47995c5
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/trie_policy/sample_trie_e_access_traits.hpp
@@ -0,0 +1,95 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file sample_trie_e_access_traits.hpp
+ * Contains a sample probe policy.
+ */
+
+#ifndef PB_DS_SAMPLE_TRIE_E_ACCESS_TRAITS_HPP
+#define PB_DS_SAMPLE_TRIE_E_ACCESS_TRAITS_HPP
+
+// A sample trie element-access traits.
+class sample_trie_e_access_traits
+{
+
+public:
+
+  // Size type.
+  typedef size_t size_type;
+
+  // Key type.
+  typedef std::string key_type;
+
+  // Const key reference type.
+  typedef
+  typename Allocator::template rebind<
+    key_type>::other::const_reference
+  const_key_reference;
+
+  // Element const iterator type.
+  typedef std::string::const_iterator const_iterator;
+
+  // Element type.
+  typedef char e_type;
+
+  enum
+    {
+      max_size = 4
+    };
+
+public:
+
+  // Returns a const_iterator to the first element of r_key.
+  inline static const_iterator
+  begin(const_key_reference r_key);
+
+  // Returns a const_iterator to the after-last element of r_key.
+  inline static const_iterator
+  end(const_key_reference r_key);
+
+  // Maps an element to a position.
+  inline static size_type
+  e_pos(e_type e);
+
+};
+
+#endif // #ifndef PB_DS_SAMPLE_TRIE_E_ACCESS_TRAITS_HPP
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/trie_policy/sample_trie_node_update.hpp b/libstdc++-v3/include/ext/pb_ds/detail/trie_policy/sample_trie_node_update.hpp
new file mode 100644
index 00000000000..8a884c410b5
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/trie_policy/sample_trie_node_update.hpp
@@ -0,0 +1,78 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file sample_trie_node_update.hpp
+ * Contains a samle node update functor.
+ */
+
+#ifndef PB_DS_SAMPLE_TRIE_NODE_UPDATOR_HPP
+#define PB_DS_SAMPLE_TRIE_NODE_UPDATOR_HPP
+
+// A sample node updator.
+template<typename Const_Node_Iterator,
+
+	 class Node_Iterator,
+
+	 class E_Access_Traits,
+
+	 class Allocator
+	 >
+class sample_trie_node_update
+{
+
+public:
+
+  // Metadata type.
+  typedef size_t metadata_type;
+
+protected:
+
+  // Default constructor.
+  sample_trie_node_update();
+
+  // Updates the rank of a node through a node_iterator node_it; end_nd_it is the end node iterator.
+  inline void
+  operator()(node_iterator node_it, const_node_iterator end_nd_it) const;
+
+};
+
+#endif // #ifndef PB_DS_SAMPLE_TRIE_NODE_UPDATOR_HPP
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/trie_policy/string_trie_e_access_traits_imp.hpp b/libstdc++-v3/include/ext/pb_ds/detail/trie_policy/string_trie_e_access_traits_imp.hpp
new file mode 100644
index 00000000000..c2fe1c6ca43
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/trie_policy/string_trie_e_access_traits_imp.hpp
@@ -0,0 +1,105 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file string_trie_e_access_traits_imp.hpp
+ * Contains a policy for extracting character positions from
+ *    a string for a vector-based PATRICIA tree
+ */
+
+PB_DS_CLASS_T_DEC
+detail::integral_constant<int, Reverse> PB_DS_CLASS_C_DEC::s_rev_ind;
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::size_type
+PB_DS_CLASS_C_DEC::
+e_pos(e_type e)
+{
+  return (static_cast<size_type>(e - min_e_val));
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::const_iterator
+PB_DS_CLASS_C_DEC::
+begin(const_key_reference r_key)
+{
+  return (begin_imp(r_key, s_rev_ind));
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::const_iterator
+PB_DS_CLASS_C_DEC::
+end(const_key_reference r_key)
+{
+  return (end_imp(r_key, s_rev_ind));
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::const_iterator
+PB_DS_CLASS_C_DEC::
+begin_imp(const_key_reference r_key, detail::false_type)
+{
+  return (r_key.begin());
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::const_iterator
+PB_DS_CLASS_C_DEC::
+begin_imp(const_key_reference r_key, detail::true_type)
+{
+  return (r_key.rbegin());
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::const_iterator
+PB_DS_CLASS_C_DEC::
+end_imp(const_key_reference r_key, detail::false_type)
+{
+  return (r_key.end());
+}
+
+PB_DS_CLASS_T_DEC
+inline typename PB_DS_CLASS_C_DEC::const_iterator
+PB_DS_CLASS_C_DEC::
+end_imp(const_key_reference r_key, detail::true_type)
+{
+  return (r_key.rend());
+}
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/trie_policy/trie_policy_base.hpp b/libstdc++-v3/include/ext/pb_ds/detail/trie_policy/trie_policy_base.hpp
new file mode 100644
index 00000000000..a8506ce6815
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/trie_policy/trie_policy_base.hpp
@@ -0,0 +1,255 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file trie_policy_base.hpp
+ * Contains an implementation of trie_policy_base.
+ */
+
+#ifndef PB_DS_TRIE_POLICY_BASE_HPP
+#define PB_DS_TRIE_POLICY_BASE_HPP
+
+#include <ext/pb_ds/detail/basic_tree_policy/basic_tree_policy_base.hpp>
+
+namespace pb_ds
+{
+  namespace detail
+  {
+
+#define PB_DS_CLASS_T_DEC						\
+    template<								\
+						class Const_Node_Iterator, \
+						class Node_Iterator,	\
+						class E_Access_Traits,	\
+						typename Allocator>
+
+#define PB_DS_CLASS_C_DEC						\
+    trie_policy_base<							\
+						Const_Node_Iterator,	\
+						Node_Iterator,		\
+						E_Access_Traits,	\
+						Allocator>
+
+#define PB_DS_BASE_C_DEC						\
+    basic_tree_policy_base<				\
+								Const_Node_Iterator, \
+								Node_Iterator, \
+								Allocator>
+
+    template<typename Const_Node_Iterator,
+	     class Node_Iterator,
+	     class E_Access_Traits,
+	     class Allocator>
+    class trie_policy_base : public PB_DS_BASE_C_DEC
+    {
+
+    public:
+
+      typedef E_Access_Traits e_access_traits;
+
+      typedef Allocator allocator;
+
+      typedef typename allocator::size_type size_type;
+
+      typedef null_node_metadata metadata_type;
+
+      typedef Const_Node_Iterator const_node_iterator;
+
+      typedef Node_Iterator node_iterator;
+
+      typedef typename const_node_iterator::value_type const_iterator;
+
+      typedef typename node_iterator::value_type iterator;
+
+    public:
+
+      typedef typename PB_DS_BASE_C_DEC::key_type key_type;
+
+      typedef
+      typename PB_DS_BASE_C_DEC::const_key_reference
+      const_key_reference;
+
+    protected:
+
+      virtual const_iterator
+      end() const = 0;
+
+      virtual iterator
+      end() = 0;
+
+      virtual const_node_iterator
+      node_begin() const = 0;
+
+      virtual node_iterator
+      node_begin() = 0;
+
+      virtual const_node_iterator
+      node_end() const = 0;
+
+      virtual node_iterator
+      node_end() = 0;
+
+      virtual const e_access_traits& 
+      get_e_access_traits() const = 0;
+
+    private:
+      typedef
+      std::pair<
+      typename e_access_traits::const_iterator,
+      typename e_access_traits::const_iterator>
+      prefix_range_t;
+
+      typedef PB_DS_BASE_C_DEC base_type;
+
+    protected:
+      static size_type
+      common_prefix_len(node_iterator nd_it, typename e_access_traits::const_iterator b_r, typename e_access_traits::const_iterator e_r, const e_access_traits& r_traits);
+
+      static iterator
+      leftmost_it(node_iterator nd_it);
+
+      static iterator
+      rightmost_it(node_iterator nd_it);
+
+      static bool
+      less(typename e_access_traits::const_iterator b_l, typename e_access_traits::const_iterator e_l, typename e_access_traits::const_iterator b_r, typename e_access_traits::const_iterator e_r, const e_access_traits& r_traits);
+    };
+
+    PB_DS_CLASS_T_DEC
+    typename PB_DS_CLASS_C_DEC::size_type
+    PB_DS_CLASS_C_DEC::
+    common_prefix_len(node_iterator nd_it, typename e_access_traits::const_iterator b_r, typename e_access_traits::const_iterator e_r, const e_access_traits& r_traits)
+    {
+      prefix_range_t pref_range = nd_it.valid_prefix();
+
+      typename e_access_traits::const_iterator b_l = pref_range.first;
+      typename e_access_traits::const_iterator e_l = pref_range.second;
+
+      const size_type range_length_l =
+	std::distance(b_l, e_l);
+
+      const size_type range_length_r =
+	std::distance(b_r, e_r);
+
+      if (range_length_r < range_length_l)
+	{
+	  std::swap(b_l, b_r);
+
+	  std::swap(e_l, e_r);
+	}
+
+      size_type ret = 0;
+
+      while (b_l != e_l)
+	{
+	  if (r_traits.e_pos(*b_l) != r_traits.e_pos(*b_r))
+	    return (ret);
+
+	  ++ret;
+
+	  ++b_l;
+
+	  ++b_r;
+	}
+
+      return (ret);
+    }
+
+    PB_DS_CLASS_T_DEC
+    typename PB_DS_CLASS_C_DEC::iterator
+    PB_DS_CLASS_C_DEC::
+    leftmost_it(node_iterator nd_it)
+    {
+      if (nd_it.num_children() == 0)
+	return (*nd_it);
+
+      return (leftmost_it(nd_it.get_child(0)));
+    }
+
+    PB_DS_CLASS_T_DEC
+    typename PB_DS_CLASS_C_DEC::iterator
+    PB_DS_CLASS_C_DEC::
+    rightmost_it(node_iterator nd_it)
+    {
+      const size_type num_children = nd_it.num_children();
+
+      if (num_children == 0)
+	return (*nd_it);
+
+      return (rightmost_it(nd_it.get_child(num_children - 1)));
+    }
+
+    PB_DS_CLASS_T_DEC
+    bool
+    PB_DS_CLASS_C_DEC::
+    less(typename e_access_traits::const_iterator b_l, typename e_access_traits::const_iterator e_l, typename e_access_traits::const_iterator b_r, typename e_access_traits::const_iterator e_r, const e_access_traits& r_traits)
+    {
+      while (b_l != e_l)
+	{
+	  if (b_r == e_r)
+	    return (false);
+
+	  size_type l_pos =
+	    r_traits.e_pos(*b_l);
+	  size_type r_pos =
+	    r_traits.e_pos(*b_r);
+
+	  if (l_pos != r_pos)
+	    return (l_pos < r_pos);
+
+	  ++b_l;
+	  ++b_r;
+	}
+
+      return (b_r != e_r);
+    }
+
+#undef PB_DS_CLASS_T_DEC
+
+#undef PB_DS_CLASS_C_DEC
+
+#undef PB_DS_BASE_C_DEC
+
+  } // namespace detail
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_TRIE_POLICY_BASE_HPP
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/type_utils.hpp b/libstdc++-v3/include/ext/pb_ds/detail/type_utils.hpp
new file mode 100644
index 00000000000..3316c4dd44c
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/type_utils.hpp
@@ -0,0 +1,177 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file type_utils.hpp
+ * Contains utilities for handnling types. All of these classes are based on
+ *    "Modern C++" by Andrei Alxandrescu.
+ */
+
+#ifndef PB_DS_TYPE_UTILS_HPP
+#define PB_DS_TYPE_UTILS_HPP
+
+#include <cstddef>
+#include <utility>
+#include <tr1/type_traits>
+
+namespace pb_ds
+{
+  namespace detail
+  {
+    using std::tr1::is_same;
+    using std::tr1::is_const;
+    using std::tr1::is_pointer;
+    using std::tr1::is_reference;
+    using std::tr1::is_fundamental;
+    using std::tr1::is_member_object_pointer;
+    using std::tr1::is_member_pointer;
+    using std::tr1::is_base_of;
+    using std::tr1::remove_const;
+    using std::tr1::remove_reference;
+
+    // Need integral_const<bool, true> <-> integral_const<int, 1>, so
+    // because of this use the following typedefs instead of importing
+    // std::tr1's.
+    using std::tr1::integral_constant;
+    typedef std::tr1::integral_constant<int, 1> true_type;
+    typedef std::tr1::integral_constant<int, 0> false_type;
+
+    template<typename T>
+    struct is_const_pointer
+    {
+      enum
+	{
+	  value = is_const<T>::value && is_pointer<T>::value
+	};
+    };
+
+    template<typename T>
+    struct is_const_reference
+    {
+      enum
+	{
+	  value = is_const<T>::value && is_reference<T>::value
+	};
+    };
+
+    template<typename T>
+    struct is_simple
+    {
+      enum
+	{
+	  value = is_fundamental<typename remove_const<T>::type>::value 
+	  || is_pointer<typename remove_const<T>::type>::value 
+	  || is_member_pointer<T>::value 
+	};
+    };
+
+    template<typename T>
+    class is_pair
+    {
+    private:
+      template<typename U>
+      struct is_pair_imp
+      {
+	enum
+	  {
+	    value = 0
+	  };
+      };
+
+      template<typename U, typename V>
+      struct is_pair_imp<std::pair<U,V> >
+      {
+	enum
+	  {
+	    value = 1
+	  };
+      };
+
+    public:
+      enum
+	{
+	  value = is_pair_imp<T>::value
+	};
+    };
+
+
+    template<bool>
+    struct static_assert;
+
+    template<>
+    struct static_assert<true>
+    { };
+
+    template<int>
+    struct static_assert_dumclass
+    {
+      enum
+	{
+	  v = 1
+	};
+    };
+
+
+    template<typename Type>
+    struct type_to_type
+    {
+      typedef Type type;
+    };
+
+
+    template<bool Cond, class A, class B>
+    struct conditional_type;
+
+    template<typename A, class B>
+    struct conditional_type<true, A, B>
+    {
+      typedef A type;
+    };
+
+    template<typename A, class B>
+    struct conditional_type<false, A, B>
+    {
+      typedef B type;
+    };
+  } // namespace detail
+} // namespace pb_ds
+
+#endif 
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/typelist.hpp b/libstdc++-v3/include/ext/pb_ds/detail/typelist.hpp
new file mode 100644
index 00000000000..267db809153
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/typelist.hpp
@@ -0,0 +1,296 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file typelist.hpp
+ * Contains typelist_chain definitions.
+ * Typelists are an idea by Andrei Alexandrescu.
+ */
+
+#ifndef PB_DS_TYPELIST_HPP
+#define PB_DS_TYPELIST_HPP
+
+#include <ext/pb_ds/detail/type_utils.hpp>
+
+namespace pb_ds
+{
+  namespace detail
+  {
+    struct null_type
+    { };
+
+    template<typename Hd, typename Tl>
+    struct typelist_chain
+    {
+      typedef Hd head;
+      typedef Tl tail;
+    };
+
+    template<typename Root>
+    struct typelist
+    {
+      typedef Root root;
+    };
+
+#define PB_DS_TYPELIST_CHAIN1(X0) typelist_chain<X0, null_type>
+#define PB_DS_TYPELIST_CHAIN2(X0, X1) typelist_chain<X0, PB_DS_TYPELIST_CHAIN1(X1) >
+#define PB_DS_TYPELIST_CHAIN3(X0, X1, X2) typelist_chain<X0, PB_DS_TYPELIST_CHAIN2(X1, X2) >
+#define PB_DS_TYPELIST_CHAIN4(X0, X1, X2, X3) typelist_chain<X0, PB_DS_TYPELIST_CHAIN3(X1, X2, X3) >
+#define PB_DS_TYPELIST_CHAIN5(X0, X1, X2, X3, X4) typelist_chain<X0, PB_DS_TYPELIST_CHAIN4(X1, X2, X3, X4) >
+#define PB_DS_TYPELIST_CHAIN6(X0, X1, X2, X3, X4, X5) typelist_chain<X0, PB_DS_TYPELIST_CHAIN5(X1, X2, X3, X4, X5) >
+#define PB_DS_TYPELIST_CHAIN7(X0, X1, X2, X3, X4, X5, X6) typelist_chain<X0, PB_DS_TYPELIST_CHAIN6(X1, X2, X3, X4, X5, X6) >
+#define PB_DS_TYPELIST_CHAIN8(X0, X1, X2, X3, X4, X5, X6, X7) typelist_chain<X0, PB_DS_TYPELIST_CHAIN7(X1, X2, X3, X4, X5, X6, X7) >
+#define PB_DS_TYPELIST_CHAIN9(X0, X1, X2, X3, X4, X5, X6, X7, X8) typelist_chain<X0, PB_DS_TYPELIST_CHAIN8(X1, X2, X3, X4, X5, X6, X7, X8) >
+#define PB_DS_TYPELIST_CHAIN10(X0, X1, X2, X3, X4, X5, X6, X7, X8, X9) typelist_chain<X0, PB_DS_TYPELIST_CHAIN9(X1, X2, X3, X4, X5, X6, X7, X8, X9) >
+#define PB_DS_TYPELIST_CHAIN11(X0, X1, X2, X3, X4, X5, X6, X7, X8, X9, X10) typelist_chain<X0, PB_DS_TYPELIST_CHAIN10(X1, X2, X3, X4, X5, X6, X7, X8, X9, X10) >
+#define PB_DS_TYPELIST_CHAIN12(X0, X1, X2, X3, X4, X5, X6, X7, X8, X9, X10, X11) typelist_chain<X0, PB_DS_TYPELIST_CHAIN11(X1, X2, X3, X4, X5, X6, X7, X8, X9, X10, X11) >
+#define PB_DS_TYPELIST_CHAIN13(X0, X1, X2, X3, X4, X5, X6, X7, X8, X9, X10, X11, X12) typelist_chain<X0, PB_DS_TYPELIST_CHAIN12(X1, X2, X3, X4, X5, X6, X7, X8, X9, X10, X11, X12) >
+#define PB_DS_TYPELIST_CHAIN14(X0, X1, X2, X3, X4, X5, X6, X7, X8, X9, X10, X11, X12, X13) typelist_chain<X0, PB_DS_TYPELIST_CHAIN13(X1, X2, X3, X4, X5, X6, X7, X8, X9, X10, X11, X12, X13) >
+#define PB_DS_TYPELIST_CHAIN15(X0, X1, X2, X3, X4, X5, X6, X7, X8, X9, X10, X11, X12, X13, X14) typelist_chain<X0, PB_DS_TYPELIST_CHAIN14(X1, X2, X3, X4, X5, X6, X7, X8, X9, X10, X11, X12, X13, X14) >
+
+#include <ext/pb_ds/detail/typelist/typelist_apply.hpp>
+
+    template<typename Fn, class Typelist>
+    void
+    typelist_apply(Fn& r_fn, Typelist)
+    {
+      detail::apply_<Fn, typename Typelist::root> a;
+      a(r_fn);
+    }
+
+#include <ext/pb_ds/detail/typelist/typelist_append.hpp>
+
+    template<typename Typelist0, class Typelist1>
+    struct typelist_append
+    {
+    private:
+      typedef
+      typename detail::typelist_append_<
+      typename Typelist0::root,
+      typename Typelist1::root>::type
+      res_hd;
+
+    public:
+      typedef typelist< res_hd> type;
+    };
+
+#include <ext/pb_ds/detail/typelist/typelist_typelist_append.hpp>
+
+    template<typename Typelist_Typelist>
+    struct typelist_typelist_append
+    {
+    private:
+      typedef
+      typename detail::typelist_typelist_append_<
+      typename Typelist_Typelist::root>::type
+      res_hd;
+
+    public:
+      typedef typelist< res_hd> type;
+    };
+
+#include <ext/pb_ds/detail/typelist/typelist_contains.hpp>
+
+    template<typename Typelist, typename T>
+    struct typelist_contains
+    {
+      enum
+	{
+	  value =
+	  detail::typelist_contains_<
+	  typename Typelist::root,
+	  T>::value
+	};
+    };
+
+#include <ext/pb_ds/detail/typelist/typelist_filter.hpp>
+
+    template<typename Typelist, template<typename T>
+    class Pred>
+    struct typelist_filter
+    {
+    private:
+      typedef
+      typename detail::typelist_chain_filter_<
+      typename Typelist::root,
+      Pred>::type
+      root_type;
+
+    public:
+      typedef typelist< root_type> type;
+    };
+
+#include <ext/pb_ds/detail/typelist/typelist_at_index.hpp>
+
+    template<typename Typelist, int i>
+    struct typelist_at_index
+    {
+      typedef
+      typename detail::typelist_chain_at_index_<
+	typename Typelist::root,
+	i>::type
+      type;
+    };
+
+#include <ext/pb_ds/detail/typelist/typelist_transform.hpp>
+
+    template<typename Typelist, template<typename T>
+    class Transform>
+    struct typelist_transform
+    {
+    private:
+      typedef
+      typename detail::typelist_chain_transform_<
+      typename Typelist::root,
+      Transform>::type
+      root_type;
+
+    public:
+      typedef typelist< root_type> type;
+    };
+
+#include <ext/pb_ds/detail/typelist/typelist_flatten.hpp>
+
+    template<typename Typelist_Typelist>
+    struct typelist_flatten
+    {
+    private:
+      typedef
+      typename detail::typelist_chain_flatten_<
+      typename Typelist_Typelist::root>::type
+      root_type;
+
+    public:
+      typedef typelist< root_type> type;
+    };
+
+    template<typename Typelist>
+    struct typelist_from_first
+    {
+    private:
+      typedef typename typelist_at_index< Typelist, 0>::type first_type;
+
+    public:
+      typedef typelist< typelist_chain< first_type, null_type> > type;
+    };
+
+    template<typename T0>
+    struct typelist1
+    {
+      typedef typelist< PB_DS_TYPELIST_CHAIN1( T0)> type;
+    };
+
+    template<typename T0, typename T1>
+    struct typelist2
+    {
+      typedef
+      typelist<
+	PB_DS_TYPELIST_CHAIN2(                T0,  T1)>
+      type;
+    };
+
+    template<typename T0, typename T1, typename T2>
+    struct typelist3
+    {
+      typedef
+      typelist<
+	PB_DS_TYPELIST_CHAIN3(                T0,  T1,  T2)>
+      type;
+    };
+
+    template<typename T0, typename T1, typename T2, typename T3>
+    struct typelist4
+    {
+      typedef
+      typelist<
+	PB_DS_TYPELIST_CHAIN4(                T0,  T1,  T2,  T3)>
+      type;
+    };
+
+    template<typename T0,
+	     typename T1,
+	     typename T2,
+	     typename T3,
+	     typename T4>
+    struct typelist5
+    {
+      typedef
+      typelist<
+	PB_DS_TYPELIST_CHAIN5(                T0,  T1,  T2,  T3,  T4)>
+      type;
+    };
+
+    template<typename T0,
+	     typename T1,
+	     typename T2,
+	     typename T3,
+	     typename T4,
+	     typename T5>
+    struct typelist6
+    {
+      typedef
+      typelist<
+	PB_DS_TYPELIST_CHAIN6(                T0,  T1,  T2,  T3,  T4,  T5)>
+      type;
+    };
+
+#undef PB_DS_TYPELIST_CHAIN1
+#undef PB_DS_TYPELIST_CHAIN2
+#undef PB_DS_TYPELIST_CHAIN3
+#undef PB_DS_TYPELIST_CHAIN4
+#undef PB_DS_TYPELIST_CHAIN5
+#undef PB_DS_TYPELIST_CHAIN6
+#undef PB_DS_TYPELIST_CHAIN7
+#undef PB_DS_TYPELIST_CHAIN8
+#undef PB_DS_TYPELIST_CHAIN9
+#undef PB_DS_TYPELIST_CHAIN10
+#undef PB_DS_TYPELIST_CHAIN11
+#undef PB_DS_TYPELIST_CHAIN12
+#undef PB_DS_TYPELIST_CHAIN13
+#undef PB_DS_TYPELIST_CHAIN14
+#undef PB_DS_TYPELIST_CHAIN15
+
+  } // namespace detail
+
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_TYPELIST_HPP
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/typelist/typelist_append.hpp b/libstdc++-v3/include/ext/pb_ds/detail/typelist/typelist_append.hpp
new file mode 100644
index 00000000000..2498628bd59
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/typelist/typelist_append.hpp
@@ -0,0 +1,84 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file typelist_append.hpp
+ * Contains typelist_chain utilities.
+ * Typelists are an idea by Andrei Alexandrescu.
+ */
+
+#ifndef PB_DS_TYPELIST_APPEND_HPP
+#define PB_DS_TYPELIST_APPEND_HPP
+
+#include <ext/pb_ds/detail/type_utils.hpp>
+
+namespace detail
+{
+  template<typename Typelist_Chain0, class Typelist_Chain1>
+  struct typelist_append_;
+
+  template<typename Hd, typename Tl, class Typelist_Chain1>
+  struct typelist_append_<typelist_chain<Hd, Tl>, Typelist_Chain1>
+  {
+    typedef typelist_chain<Hd, typename typelist_append_<Tl, Typelist_Chain1>::type> type;
+  };
+
+  template<typename Typelist_Chain1>
+  struct typelist_append_< null_type, Typelist_Chain1>
+  {
+    typedef Typelist_Chain1 type;
+  };
+
+  template<typename Typelist_Chain0>
+  struct typelist_append_<Typelist_Chain0, null_type>
+  {
+    typedef Typelist_Chain0 type;
+  };
+
+  template<>
+  struct typelist_append_<null_type, null_type>
+  {
+    typedef null_type type;
+  };
+} // namespace detail
+
+#endif // #ifndef PB_DS_TYPELIST_APPEND_HPP
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/typelist/typelist_apply.hpp b/libstdc++-v3/include/ext/pb_ds/detail/typelist/typelist_apply.hpp
new file mode 100644
index 00000000000..311301c94d6
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/typelist/typelist_apply.hpp
@@ -0,0 +1,79 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file typelist_apply.hpp
+ * Contains typelist utilities.
+ * Typelists are an idea by Andrei Alexandrescu.
+ */
+
+#ifndef PB_DS_TYPELIST_APPLY_HPP
+#define PB_DS_TYPELIST_APPLY_HPP
+
+#include <ext/pb_ds/detail/type_utils.hpp>
+
+namespace detail
+{
+  template<typename Fn, class Typelist_Chain>
+  struct apply_;
+
+  template<typename Fn, class Hd, class Tl>
+  struct apply_<Fn, typelist_chain<Hd, Tl> >
+  {
+    void
+    operator()(Fn& r_fn)
+    {
+      r_fn(type_to_type<Hd>());
+      apply_<Fn, Tl> next;
+      next(r_fn);
+    }
+  };
+
+  template<typename Fn>
+  struct apply_<Fn, null_type>
+  {
+    void
+    operator()(Fn&) { }
+  };
+} // namespace detail
+
+#endif // #ifndef PB_DS_TYPELIST_APPLY_HPP
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/typelist/typelist_assoc_container_find.hpp b/libstdc++-v3/include/ext/pb_ds/detail/typelist/typelist_assoc_container_find.hpp
new file mode 100644
index 00000000000..68b7e8b8d35
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/typelist/typelist_assoc_container_find.hpp
@@ -0,0 +1,74 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file typelist_assoc_container_find.hpp
+ * Contains typelist utilities.
+ * Typelists are an idea by Andrei Alexandrescu.
+ */
+
+#ifndef PB_DS_TYPELIST_ASSOC_CNTNR_FIND_HPP
+#define PB_DS_TYPELIST_ASSOC_CNTNR_FIND_HPP
+
+#include <ext/pb_ds/detail/type_utils.hpp>
+
+namespace detail
+{
+  template<typename Tl, typename Key>
+  struct typelist_assoc_container_find_;
+
+  template<typename Now_Key, typename Now_Data, typename Rest_Tl, typename Key>
+  struct typelist_assoc_container_find_<
+    typelist_chain<std::pair<Now_Key, Now_Data>, Rest_Tl>, Key>
+  {
+    typedef typename typelist_assoc_container_find_< Rest_Tl, Key>::type type;
+  };
+
+  template<typename Now_Key, typename Now_Data, typename Rest_Tl>
+  struct typelist_assoc_container_find_<
+    typelist_chain<std::pair<Now_Key, Now_Data>, Rest_Tl>, Now_Key>
+  {
+    typedef Now_Data type;
+  };
+} // namespace detail
+
+#endif // #ifndef PB_DS_TYPELIST_ASSOC_CNTNR_FIND_HPP
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/typelist/typelist_at_index.hpp b/libstdc++-v3/include/ext/pb_ds/detail/typelist/typelist_at_index.hpp
new file mode 100644
index 00000000000..a392d12edf1
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/typelist/typelist_at_index.hpp
@@ -0,0 +1,72 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file typelist_at_index.hpp
+ * Contains typelist utilities.
+ * Typelists are an idea by Andrei Alexandrescu.
+ */
+
+#ifndef PB_DS_TYPELIST_AT_INDEX_HPP
+#define PB_DS_TYPELIST_AT_INDEX_HPP
+
+#include <ext/pb_ds/detail/type_utils.hpp>
+
+namespace detail
+{
+  template<typename Typelist_Chain, int i>
+  struct typelist_chain_at_index_;
+
+  template<typename Hd, class Tl>
+  struct typelist_chain_at_index_<typelist_chain<Hd, Tl>, 0>
+  {
+    typedef Hd type;
+  };
+
+  template<typename Hd, class Tl, int i>
+  struct typelist_chain_at_index_<typelist_chain<Hd, Tl>, i>
+  {
+    typedef typename typelist_chain_at_index_< Tl, i - 1>::type type;
+  };
+} // namespace detail
+
+#endif // #ifndef PB_DS_TYPELIST_AT_INDEX_HPP
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/typelist/typelist_contains.hpp b/libstdc++-v3/include/ext/pb_ds/detail/typelist/typelist_contains.hpp
new file mode 100644
index 00000000000..dc8a347afa5
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/typelist/typelist_contains.hpp
@@ -0,0 +1,87 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file typelist_contains.hpp
+ * Contains typelist utilities.
+ * Typelists are an idea by Andrei Alexandrescu.
+ */
+
+#ifndef PB_DS_TYPELIST_CONTAINS_HPP
+#define PB_DS_TYPELIST_CONTAINS_HPP
+
+#include <ext/pb_ds/detail/type_utils.hpp>
+
+namespace detail
+{
+  template<typename Typelist_Chain, class T>
+  struct typelist_contains_;
+
+  template<typename T>
+  struct typelist_contains_<null_type, T>
+  {
+    enum
+      {
+        value = false
+      };
+  };
+
+  template<typename Hd, class Tl, class T>
+  struct typelist_contains_<typelist_chain<Hd, Tl>, T>
+  {
+    enum
+      {
+        value = typelist_contains_<Tl, T>::value
+      };
+  };
+
+  template<typename Tl, class T>
+  struct typelist_contains_<typelist_chain<T, Tl>, T>
+  {
+    enum
+      {
+        value = true
+      };
+  };
+} // namespace detail
+
+#endif // #ifndef PB_DS_TYPELIST_CONTAINS_HPP
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/typelist/typelist_filter.hpp b/libstdc++-v3/include/ext/pb_ds/detail/typelist/typelist_filter.hpp
new file mode 100644
index 00000000000..43e21530752
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/typelist/typelist_filter.hpp
@@ -0,0 +1,80 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file typelist_filter.hpp
+ * Contains typelist utilities.
+ * Typelists are an idea by Andrei Alexandrescu.
+ */
+
+#ifndef PB_DS_TYPELIST_FILTER_HPP
+#define PB_DS_TYPELIST_FILTER_HPP
+
+#include <ext/pb_ds/detail/type_utils.hpp>
+
+namespace detail
+{
+  template<typename Typelist_Chain, template<typename T> class Pred>
+  struct typelist_chain_filter_;
+
+  template<template<typename T>
+  class Pred>
+  struct typelist_chain_filter_<null_type, Pred>
+  {
+    typedef null_type type;
+  };
+
+  template<typename Hd, class Tl, template<typename T> class Pred>
+  struct typelist_chain_filter_< typelist_chain<Hd, Tl>, Pred>
+  {
+    typedef typename typelist_chain_filter_< Tl, Pred>::type rest;
+
+    enum
+      {
+        include_hd = Pred<Hd>::value
+      };
+
+    typedef typename conditional_type<include_hd, typelist_chain<Hd, rest>, rest>::type type;
+  };
+} // namespace detail
+
+#endif // #ifndef PB_DS_TYPELIST_FILTER_HPP
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/typelist/typelist_flatten.hpp b/libstdc++-v3/include/ext/pb_ds/detail/typelist/typelist_flatten.hpp
new file mode 100644
index 00000000000..5d8e4989913
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/typelist/typelist_flatten.hpp
@@ -0,0 +1,73 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file typelist_flatten.hpp
+ * Contains typelist utilities.
+ * Typelists are an idea by Andrei Alexandrescu.
+ */
+
+#ifndef PB_DS_TYPELIST_FLATTEN_HPP
+#define PB_DS_TYPELIST_FLATTEN_HPP
+
+#include <ext/pb_ds/detail/type_utils.hpp>
+
+namespace detail
+{
+  template<typename Typelist_Typelist_Chain>
+  struct typelist_chain_flatten_;
+
+  template<typename Hd_Tl>
+  struct typelist_chain_flatten_<typelist_chain<Hd_Tl, null_type> >
+  {
+    typedef typename Hd_Tl::root type;
+  };
+
+  template<typename Hd_Typelist, class Tl_Typelist>
+  struct typelist_chain_flatten_<typelist_chain<Hd_Typelist, Tl_Typelist> >
+  {
+    typedef typename typelist_chain_flatten_< Tl_Typelist>::type rest;
+    typedef typename typelist_append<Hd_Typelist, typelist<rest> >::type::root type;
+  };
+} // namespace detail
+
+#endif // #ifndef PB_DS_TYPELIST_FLATTEN_HPP
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/typelist/typelist_transform.hpp b/libstdc++-v3/include/ext/pb_ds/detail/typelist/typelist_transform.hpp
new file mode 100644
index 00000000000..e62de8d6e44
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/typelist/typelist_transform.hpp
@@ -0,0 +1,75 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file typelist_transform.hpp
+ * Contains typelist utilities.
+ * Typelists are an idea by Andrei Alexandrescu.
+ */
+
+#ifndef PB_DS_TYPELIST_TRANSFORM_HPP
+#define PB_DS_TYPELIST_TRANSFORM_HPP
+
+#include <ext/pb_ds/detail/type_utils.hpp>
+
+namespace detail
+{
+  template<typename Typelist_Chain, template<typename T> class Transform>
+  struct typelist_chain_transform_;
+
+  template<template<typename T> class Transform>
+  struct typelist_chain_transform_<null_type, Transform>
+  {
+    typedef null_type type;
+  };
+
+  template<typename Hd, class Tl, template<typename T> class Transform>
+  struct typelist_chain_transform_<typelist_chain<Hd, Tl>, Transform>
+  {
+    typedef typename typelist_chain_transform_< Tl, Transform>::type rest;
+    typedef typename Transform<Hd>::type transform_type;
+    typedef typelist_chain<transform_type, rest> type;
+  };
+
+} // namespace detail
+
+#endif // #ifndef PB_DS_TYPELIST_TRANSFORM_HPP
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/typelist/typelist_typelist_append.hpp b/libstdc++-v3/include/ext/pb_ds/detail/typelist/typelist_typelist_append.hpp
new file mode 100644
index 00000000000..92ede86e9d5
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/typelist/typelist_typelist_append.hpp
@@ -0,0 +1,87 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file typelist_typelist_append.hpp
+ * Contains typelist_chain utilities.
+ * Typelists are an idea by Andrei Alexandrescu.
+ */
+
+#ifndef PB_DS_TYPELIST_TYPELIST_APPEND_HPP
+#define PB_DS_TYPELIST_TYPELIST_APPEND_HPP
+
+#include <ext/pb_ds/detail/type_utils.hpp>
+
+namespace detail
+{
+
+  template<typename Typelist_Typelist_Chain>
+  struct typelist_typelist_append_;
+
+  template<typename Hd>
+  struct typelist_typelist_append_<
+    typelist_chain<Hd, null_type> >
+  {
+    typedef typelist_chain< Hd, null_type> type;
+  };
+
+  template<typename Hd, class Tl>
+  struct typelist_typelist_append_<
+    typelist_chain<
+    Hd,
+    Tl> >
+  {
+  private:
+    typedef typename typelist_typelist_append_< Tl>::type rest;
+
+  public:
+    typedef
+    typename typelist_append<
+    Hd,
+    typelist<
+    rest> >::type::root
+    type;
+  };
+
+} // namespace detail
+
+#endif // #ifndef PB_DS_TYPELIST_TYPELIST_APPEND_HPP
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/typelist_assoc_container.hpp b/libstdc++-v3/include/ext/pb_ds/detail/typelist_assoc_container.hpp
new file mode 100644
index 00000000000..19c703f9cb7
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/typelist_assoc_container.hpp
@@ -0,0 +1,91 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file typelist_assoc_container.hpp
+ * Contains an associative container based on typelists.
+ * Typelists are an idea by Andrei Alexandrescu.
+ */
+
+#ifndef PB_DS_TYPELIST_CHAIN_HPP
+#define PB_DS_TYPELIST_CHAIN_HPP
+
+#include <utility>
+#include <ext/pb_ds/detail/typelist.hpp>
+
+namespace pb_ds
+{
+  namespace detail
+  {
+    template<typename Typelist = typelist<null_type> >
+    struct typelist_assoc_container
+    {
+      typedef Typelist tl;
+    };
+
+    template<typename Typelist_Assoc_Cntnr, typename Key, typename Data>
+    struct typelist_assoc_container_insert
+    {
+    private:
+      typedef typename Typelist_Assoc_Cntnr::tl already_tl;
+
+      typedef typelist<typelist_chain<std::pair<Key, Data>, null_type> > new_tl;
+
+      typedef typename typelist_append< new_tl, already_tl>::type so_happy_together;
+
+    public:
+      typedef typelist_assoc_container< so_happy_together> type;
+    };
+
+#include <ext/pb_ds/detail/typelist/typelist_assoc_container_find.hpp>
+
+    template<typename Typelist_Assoc_Cntnr, typename Key>
+    struct typelist_assoc_container_find
+    {
+    private:
+      typedef typename Typelist_Assoc_Cntnr::tl already;
+      typedef typename already::root already_root;
+    };
+  } // namespace detail
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_TYPELIST_CHAIN_HPP
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/types_traits.hpp b/libstdc++-v3/include/ext/pb_ds/detail/types_traits.hpp
new file mode 100644
index 00000000000..58522c1c402
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/types_traits.hpp
@@ -0,0 +1,113 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file types_traits.hpp
+ * Contains a traits class of types used by containers.
+ */
+
+#ifndef PB_DS_TYPES_TRAITS_HPP
+#define PB_DS_TYPES_TRAITS_HPP
+
+#include <ext/pb_ds/detail/basic_types.hpp>
+#include <ext/pb_ds/detail/type_utils.hpp>
+#include <utility>
+
+namespace pb_ds
+{
+  namespace detail
+  {
+
+    template<typename Key,
+	     typename Mapped,
+	     class Allocator,
+	     bool Store_Extra>
+    struct vt_base_selector
+    {
+      typedef value_type_base< Key, Mapped, Allocator, Store_Extra> type;
+    };
+
+    template<typename Key,
+	     typename Mapped,
+	     class Allocator,
+	     bool Store_Extra>
+    struct types_traits : public vt_base_selector<
+      Key,
+      Mapped,
+      Allocator,
+      Store_Extra>::type
+    {
+
+      typedef typename Allocator::template rebind< Key>::other key_allocator;
+
+      typedef typename key_allocator::value_type key_type;
+
+      typedef typename key_allocator::pointer key_pointer;
+
+      typedef typename key_allocator::const_pointer const_key_pointer;
+
+      typedef typename key_allocator::reference key_reference;
+
+      typedef typename key_allocator::const_reference const_key_reference;
+
+      typedef typename Allocator::size_type size_type;
+
+      typedef false_type store_extra_false_type;
+
+      typedef true_type store_extra_true_type;
+
+      integral_constant<int,Store_Extra> m_store_extra_indicator;
+
+      typedef false_type no_throw_copies_false_type;
+
+      typedef true_type no_throw_copies_true_type;
+
+      typename no_throw_copies<Key, Mapped>::indicator
+      m_no_throw_copies_indicator;
+
+      // Extra value (used when the extra value is stored with each value).
+      typedef typename comp_hash_< size_type>::comp_hash comp_hash;
+    };
+
+  } // namespace detail
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_TYPES_TRAITS_HPP
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/unordered_iterator/const_iterator.hpp b/libstdc++-v3/include/ext/pb_ds/detail/unordered_iterator/const_iterator.hpp
new file mode 100644
index 00000000000..84419e59a5e
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/unordered_iterator/const_iterator.hpp
@@ -0,0 +1,135 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file const_iterator.hpp
+ * Contains an iterator class used for const ranging over the elements of the
+ *     table.
+ */
+
+// Const range-type iterator.
+class const_iterator_ : 
+  public const_point_iterator_
+
+{
+
+public:
+
+  // Category.
+  typedef std::forward_iterator_tag iterator_category;
+
+  // Difference type.
+  typedef typename Allocator::difference_type difference_type;
+
+  // Iterator's value type.
+  typedef value_type_ value_type;
+
+  // Iterator's pointer type.
+  typedef pointer_ pointer;
+
+  // Iterator's const pointer type.
+  typedef const_pointer_ const_pointer;
+
+  // Iterator's reference type.
+  typedef reference_ reference;
+
+  // Iterator's const reference type.
+  typedef const_reference_ const_reference;
+
+public:
+
+  // Default constructor.
+  inline
+  const_iterator_()
+
+    : m_p_tbl(NULL)
+  { }
+
+  // Increments.
+  inline const_iterator_& 
+  operator++()
+  {
+    m_p_tbl->inc_it_state(base_type::m_p_value, m_pos);
+
+    return (*this);
+  }
+
+  // Increments.
+  inline const_iterator_
+  operator++(int)
+  {
+    const_iterator_ ret =* this;
+
+    m_p_tbl->inc_it_state(base_type::m_p_value, m_pos);
+
+    return (ret);
+  }
+
+protected:
+
+  typedef const_point_iterator_ base_type;
+
+protected:
+
+  /**
+   *  Constructor used by the table to initiate the generalized
+   *      pointer and position (e.g., this is called from within a find()
+   *      of a table.
+   * */
+  inline
+  const_iterator_(const_pointer_ p_value,  PB_DS_GEN_POS pos,  const PB_DS_CLASS_C_DEC* p_tbl) : const_point_iterator_(p_value),
+												 m_p_tbl(p_tbl),
+												 m_pos(pos)
+  { }
+
+protected:
+
+  /**
+   *  Pointer to the table object which created the iterator (used for
+   *      incrementing its position.
+   * */
+  const PB_DS_CLASS_C_DEC* m_p_tbl;
+
+  PB_DS_GEN_POS m_pos;
+
+  friend class PB_DS_CLASS_C_DEC;
+};
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/unordered_iterator/const_point_iterator.hpp b/libstdc++-v3/include/ext/pb_ds/detail/unordered_iterator/const_point_iterator.hpp
new file mode 100644
index 00000000000..180cd409587
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/unordered_iterator/const_point_iterator.hpp
@@ -0,0 +1,157 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file const_point_iterator.hpp
+ * Contains an iterator class returned by the tables' const find and insert
+ *     methods.
+ */
+
+class point_iterator_;
+
+// Const point-type iterator.
+class const_point_iterator_
+{
+
+public:
+
+  // Category.
+  typedef trivial_iterator_tag iterator_category;
+
+  // Difference type.
+  typedef trivial_iterator_difference_type difference_type;
+
+  // Iterator's value type.
+  typedef value_type_ value_type;
+
+  // Iterator's pointer type.
+  typedef pointer_ pointer;
+
+  // Iterator's const pointer type.
+  typedef const_pointer_ const_pointer;
+
+  // Iterator's reference type.
+  typedef reference_ reference;
+
+  // Iterator's const reference type.
+  typedef const_reference_ const_reference;
+
+public:
+
+  inline
+  const_point_iterator_(const_pointer p_value) : m_p_value(p_value)
+  { }
+
+  // Default constructor.
+  inline
+  const_point_iterator_()
+
+    : m_p_value(NULL)
+  { }
+
+  // Copy constructor.
+  inline
+  const_point_iterator_(const const_point_iterator_& other)
+
+    : m_p_value(other.m_p_value)
+  { }
+
+  // Copy constructor.
+  inline
+  const_point_iterator_(const point_iterator_& other)
+
+    : m_p_value(other.m_p_value)
+  { }
+
+  // Access.
+  inline const_pointer
+  operator->() const
+  {
+    PB_DS_DBG_ASSERT(m_p_value != NULL);
+
+    return (m_p_value);
+  }
+
+  // Access.
+  inline const_reference
+  operator*() const
+  {
+    PB_DS_DBG_ASSERT(m_p_value != NULL);
+
+    return (*m_p_value);
+  }
+
+  // Compares content to a different iterator object.
+  inline bool
+  operator==(const point_iterator_& other) const
+  {
+    return (m_p_value == other.m_p_value);
+  }
+
+  // Compares content to a different iterator object.
+  inline bool
+  operator==(const const_point_iterator_& other) const
+  {
+    return (m_p_value == other.m_p_value);
+  }
+
+  // Compares content (negatively) to a different iterator object.
+  inline bool
+  operator!=(const point_iterator_& other) const
+  {
+    return (m_p_value != other.m_p_value);
+  }
+
+  // Compares content (negatively) to a different iterator object.
+  inline bool
+  operator!=(const const_point_iterator_& other) const
+  {
+    return (m_p_value != other.m_p_value);
+  }
+
+protected:
+  const_pointer m_p_value;
+
+  friend class point_iterator_;
+
+  friend class PB_DS_CLASS_C_DEC;
+};
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/unordered_iterator/iterator.hpp b/libstdc++-v3/include/ext/pb_ds/detail/unordered_iterator/iterator.hpp
new file mode 100644
index 00000000000..da13bde5f9c
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/unordered_iterator/iterator.hpp
@@ -0,0 +1,156 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file iterator.hpp
+ * Contains an iterator_ class used for ranging over the elements of the
+ *    table.
+ */
+
+// Range-type iterator.
+class iterator_ : 
+  public const_iterator_
+
+{
+
+public:
+
+  // Category.
+  typedef std::forward_iterator_tag iterator_category;
+
+  // Difference type.
+  typedef typename Allocator::difference_type difference_type;
+
+  // Iterator's value type.
+  typedef value_type_ value_type;
+
+  // Iterator's pointer type.
+  typedef pointer_ pointer;
+
+  // Iterator's const pointer type.
+  typedef const_pointer_ const_pointer;
+
+  // Iterator's reference type.
+  typedef reference_ reference;
+
+  // Iterator's const reference type.
+  typedef const_reference_ const_reference;
+
+public:
+
+  // Default constructor.
+  inline
+  iterator_()
+
+    : const_iterator_(NULL, PB_DS_GEN_POS(), NULL)
+  { }
+
+  // Conversion to a point-type iterator.
+  inline
+  operator point_iterator_()
+  {
+    return (point_iterator_(
+			    const_cast<pointer>(const_iterator_::m_p_value)));
+  }
+
+  // Conversion to a point-type iterator.
+  inline
+  operator const point_iterator_() const
+  {
+    return (point_iterator_(
+			    const_cast<pointer>(const_iterator_::m_p_value)));
+  }
+
+  // Access.
+  inline pointer
+  operator->() const
+  {
+    PB_DS_DBG_ASSERT(base_type::m_p_value != NULL);
+
+    return (const_cast<pointer>(base_type::m_p_value));
+  }
+
+  // Access.
+  inline reference
+  operator*() const
+  {
+    PB_DS_DBG_ASSERT(base_type::m_p_value != NULL);
+
+    return (const_cast<reference>(*base_type::m_p_value));
+  }
+
+  // Increments.
+  inline iterator_& 
+  operator++()
+  {
+    base_type::m_p_tbl->inc_it_state(base_type::m_p_value, base_type::m_pos);
+
+    return (*this);
+  }
+
+  // Increments.
+  inline iterator_
+  operator++(int)
+  {
+    iterator_ ret =* this;
+
+    base_type::m_p_tbl->inc_it_state(base_type::m_p_value, base_type::m_pos);
+
+    return (ret);
+  }
+
+protected:
+  typedef const_iterator_ base_type;
+
+protected:
+
+  /**
+   *  Constructor used by the table to initiate the generalized
+   *      pointer and position (e.g., this is called from within a find()
+   *      of a table.
+   * */
+  inline
+  iterator_(pointer p_value, PB_DS_GEN_POS pos, PB_DS_CLASS_C_DEC* p_tbl) : const_iterator_(p_value, pos, p_tbl)
+  { }
+
+  friend class PB_DS_CLASS_C_DEC;
+};
+
diff --git a/libstdc++-v3/include/ext/pb_ds/detail/unordered_iterator/point_iterator.hpp b/libstdc++-v3/include/ext/pb_ds/detail/unordered_iterator/point_iterator.hpp
new file mode 100644
index 00000000000..5ef1c9e8966
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/detail/unordered_iterator/point_iterator.hpp
@@ -0,0 +1,149 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file point_iterator.hpp
+ * Contains an iterator class returned by the tables' find and insert
+ *     methods.
+ */
+
+// Find type iterator.
+class point_iterator_
+{
+
+public:
+
+  // Category.
+  typedef trivial_iterator_tag iterator_category;
+
+  // Difference type.
+  typedef trivial_iterator_difference_type difference_type;
+
+  // Iterator's value type.
+  typedef value_type_ value_type;
+
+  // Iterator's pointer type.
+  typedef pointer_ pointer;
+
+  // Iterator's const pointer type.
+  typedef const_pointer_ const_pointer;
+
+  // Iterator's reference type.
+  typedef reference_ reference;
+
+  // Iterator's const reference type.
+  typedef const_reference_ const_reference;
+
+public:
+
+  // Default constructor.
+  inline
+  point_iterator_()
+
+    : m_p_value(NULL)
+  { }
+
+  // Copy constructor.
+  inline
+  point_iterator_(const point_iterator_& other)
+
+    : m_p_value(other.m_p_value)
+  { }
+
+  // Access.
+  inline pointer
+  operator->() const
+  {
+    PB_DS_DBG_ASSERT(m_p_value != NULL);
+
+    return (m_p_value);
+  }
+
+  // Access.
+  inline reference
+  operator*() const
+  {
+    PB_DS_DBG_ASSERT(m_p_value != NULL);
+
+    return (*m_p_value);
+  }
+
+  // Compares content to a different iterator object.
+  inline bool
+  operator==(const point_iterator_& other) const
+  {
+    return (m_p_value == other.m_p_value);
+  }
+
+  // Compares content to a different iterator object.
+  inline bool
+  operator==(const const_point_iterator_& other) const
+  {
+    return (m_p_value == other.m_p_value);
+  }
+
+  // Compares content to a different iterator object.
+  inline bool
+  operator!=(const point_iterator_& other) const
+  {
+    return (m_p_value != other.m_p_value);
+  }
+
+  // Compares content (negatively) to a different iterator object.
+  inline bool
+  operator!=(const const_point_iterator_& other) const
+  {
+    return (m_p_value != other.m_p_value);
+  }
+
+  inline
+  point_iterator_(pointer p_value) : m_p_value(p_value)
+  { }
+
+protected:
+  friend class const_point_iterator_;
+
+  friend class PB_DS_CLASS_C_DEC;
+
+protected:
+  pointer m_p_value;
+};
+
diff --git a/libstdc++-v3/include/ext/pb_ds/exception.hpp b/libstdc++-v3/include/ext/pb_ds/exception.hpp
new file mode 100644
index 00000000000..be61d21a55f
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/exception.hpp
@@ -0,0 +1,73 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file exception.hpp
+ * Contains exception classes.
+ */
+
+#ifndef PB_DS_EXCEPTION_HPP
+#define PB_DS_EXCEPTION_HPP
+
+#include <stdexcept>
+
+namespace pb_ds
+{
+  // Base class for exceptions.
+  struct container_error : public std::logic_error
+  {
+    container_error() : std::logic_error("data structure exception") { }
+  };
+
+  // An entry cannot be inserted into a container object for logical
+  // reasons (not, e.g., if memory is unabvailable, in which case
+  // the allocator's exception will be thrown).
+  struct insert_error : public container_error { };
+
+  // A join cannot be performed logical reasons (i.e., the ranges of
+  // the two container objects being joined overlaps.
+  struct join_error : public container_error { };
+
+  // A container cannot be resized.
+  struct resize_error : public container_error { };
+} // namespace pb_ds
+
+#endif
diff --git a/libstdc++-v3/include/ext/pb_ds/hash_policy.hpp b/libstdc++-v3/include/ext/pb_ds/hash_policy.hpp
new file mode 100644
index 00000000000..1451fa8c847
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/hash_policy.hpp
@@ -0,0 +1,624 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file hash_policy.hpp
+ * Contains hash-related policies.
+ */
+
+#ifndef PB_DS_HASH_POLICY_HPP
+#define PB_DS_HASH_POLICY_HPP
+
+#ifdef PB_DS_HASH_POLICY_DEBUG
+# include <cassert>
+# define PB_DS_DBG_ASSERT(X) assert(X)
+# define PB_DS_DBG_VERIFY(X) assert(X)
+# define PB_DS_DBG_ONLY(X) X
+#else 
+# define PB_DS_DBG_ASSERT(X)
+# define PB_DS_DBG_VERIFY(X) {if((X)==0);}
+# define PB_DS_DBG_ONLY(X) ;
+#endif 
+
+#include <algorithm>
+#include <vector>
+#include <cmath>
+#include <ext/pb_ds/exception.hpp>
+#include <ext/pb_ds/detail/hash_fn/mask_based_range_hashing.hpp>
+#include <ext/pb_ds/detail/hash_fn/mod_based_range_hashing.hpp>
+#include <ext/pb_ds/detail/resize_policy/hash_load_check_resize_trigger_size_base.hpp>
+
+namespace pb_ds
+{
+  // A null hash function, indicating that the combining hash function
+  // is actually a ranged hash function.
+  struct null_hash_fn
+  { };
+
+  // A null probe function, indicating that the combining probe
+  // function is actually a ranged probe function.
+  struct null_probe_fn
+  { };
+
+#define PB_DS_CLASS_T_DEC template<typename Size_Type>
+#define PB_DS_CLASS_C_DEC linear_probe_fn<Size_Type>
+
+  // A probe sequence policy using fixed increments.
+  template<typename Size_Type = size_t>
+  class linear_probe_fn
+  {
+  public:
+    typedef Size_Type size_type;
+
+    void
+    swap(PB_DS_CLASS_C_DEC& other);
+
+  protected:
+    // Returns the i-th offset from the hash value.
+    inline size_type
+    operator()(size_type i) const;
+  };
+
+#include <ext/pb_ds/detail/hash_fn/linear_probe_fn_imp.hpp>
+
+#undef PB_DS_CLASS_T_DEC
+#undef PB_DS_CLASS_C_DEC
+
+#define PB_DS_CLASS_T_DEC template<typename Size_Type>
+#define PB_DS_CLASS_C_DEC quadratic_probe_fn<Size_Type>
+
+  // A probe sequence policy using square increments.
+  template<typename Size_Type = size_t>
+  class quadratic_probe_fn
+  {
+  public:
+    typedef Size_Type size_type;
+
+    void
+    swap(PB_DS_CLASS_C_DEC& other);
+
+  protected:
+    // Returns the i-th offset from the hash value.
+    inline size_type
+    operator()(size_type i) const;
+  };
+
+#include <ext/pb_ds/detail/hash_fn/quadratic_probe_fn_imp.hpp>
+
+#undef PB_DS_CLASS_T_DEC
+#undef PB_DS_CLASS_C_DEC
+
+#define PB_DS_CLASS_T_DEC template<typename Size_Type>
+#define PB_DS_CLASS_C_DEC direct_mask_range_hashing<Size_Type>
+
+  // A mask range-hashing class (uses a bit-mask).
+  template<typename Size_Type = size_t>
+  class direct_mask_range_hashing 
+  : public detail::mask_based_range_hashing<Size_Type>
+  {
+  private:
+    typedef detail::mask_based_range_hashing<Size_Type> mask_based_base;
+
+  public:
+    typedef Size_Type size_type;
+
+    void
+    swap(PB_DS_CLASS_C_DEC& other);
+
+  protected:
+    void
+    notify_resized(size_type size);
+
+    // Transforms the __hash value hash into a ranged-hash value
+    // (using a bit-mask).
+    inline size_type
+    operator()(size_type hash) const;
+  };
+
+#include <ext/pb_ds/detail/hash_fn/direct_mask_range_hashing_imp.hpp>
+
+#undef PB_DS_CLASS_T_DEC
+#undef PB_DS_CLASS_C_DEC
+
+#define PB_DS_CLASS_T_DEC template<typename Size_Type>
+#define PB_DS_CLASS_C_DEC direct_mod_range_hashing<Size_Type>
+
+  // A mod range-hashing class (uses the modulo function).
+  template<typename Size_Type = size_t>
+  class direct_mod_range_hashing 
+  : public detail::mod_based_range_hashing<Size_Type>
+  {
+  public:
+    typedef Size_Type size_type;
+      
+    void
+    swap(PB_DS_CLASS_C_DEC& other);
+
+  protected:
+    void
+    notify_resized(size_type size);
+      
+    // Transforms the __hash value hash into a ranged-hash value
+    // (using a modulo operation).
+    inline size_type
+    operator()(size_type hash) const;
+      
+  private:
+    typedef detail::mod_based_range_hashing<size_type> mod_based_base;
+  };
+
+#include <ext/pb_ds/detail/hash_fn/direct_mod_range_hashing_imp.hpp>
+
+#undef PB_DS_CLASS_T_DEC
+#undef PB_DS_CLASS_C_DEC
+
+#define PB_DS_CLASS_T_DEC template<bool External_Load_Access, typename Size_Type>
+#define PB_DS_CLASS_C_DEC hash_load_check_resize_trigger<External_Load_Access, Size_Type>
+#define PB_DS_SIZE_BASE_C_DEC detail::hash_load_check_resize_trigger_size_base<Size_Type, External_Load_Access>
+
+  // A resize trigger policy based on a load check. It keeps the
+  // load factor between some load factors load_min and load_max.
+  template<bool External_Load_Access = false, typename Size_Type = size_t>
+  class hash_load_check_resize_trigger : private PB_DS_SIZE_BASE_C_DEC
+  {
+  public:
+    typedef Size_Type size_type;
+
+    enum
+      {
+	external_load_access = External_Load_Access
+      };
+
+    // Default constructor, or constructor taking load_min and
+    // load_max load factors between which this policy will keep the
+    // actual load.
+    hash_load_check_resize_trigger(float load_min = 0.125,
+				   float load_max = 0.5);
+
+    void
+    swap(hash_load_check_resize_trigger& other);
+
+    virtual
+    ~hash_load_check_resize_trigger();
+
+    // Returns a pair of the minimal and maximal loads, respectively.
+    inline std::pair<float, float>
+    get_loads() const;
+
+    // Sets the loads through a pair of the minimal and maximal
+    // loads, respectively.
+    void
+    set_loads(std::pair<float, float> load_pair);
+
+  protected:
+    inline void
+    notify_insert_search_start();
+
+    inline void
+    notify_insert_search_collision();
+
+    inline void
+    notify_insert_search_end();
+
+    inline void
+    notify_find_search_start();
+
+    inline void
+    notify_find_search_collision();
+
+    inline void
+    notify_find_search_end();
+
+    inline void
+    notify_erase_search_start();
+
+    inline void
+    notify_erase_search_collision();
+
+    inline void
+    notify_erase_search_end();
+
+    // Notifies an element was inserted. The total number of entries
+    // in the table is num_entries.
+    inline void
+    notify_inserted(size_type num_entries);
+
+    inline void
+    notify_erased(size_type num_entries);
+
+    // Notifies the table was cleared.
+    void
+    notify_cleared();
+
+    // Notifies the table was resized as a result of this object's
+    // signifying that a resize is needed.
+    void
+    notify_resized(size_type new_size);
+
+    void
+    notify_externally_resized(size_type new_size);
+
+    inline bool
+    is_resize_needed() const;
+
+    inline bool
+    is_grow_needed(size_type size, size_type num_entries) const;
+
+  private:
+    virtual void
+    do_resize(size_type new_size);
+
+    typedef PB_DS_SIZE_BASE_C_DEC size_base;
+
+#ifdef PB_DS_HASH_POLICY_DEBUG
+    void
+    assert_valid() const;
+#endif 
+
+    float 	m_load_min;
+    float 	m_load_max;
+    size_type 	m_next_shrink_size;
+    size_type 	m_next_grow_size;
+    bool 	m_resize_needed;
+  };
+
+#include <ext/pb_ds/detail/resize_policy/hash_load_check_resize_trigger_imp.hpp>
+
+#undef PB_DS_CLASS_T_DEC
+#undef PB_DS_CLASS_C_DEC
+#undef PB_DS_SIZE_BASE_C_DEC
+
+#define PB_DS_CLASS_T_DEC template<bool External_Load_Access, typename Size_Type>
+#define PB_DS_CLASS_C_DEC cc_hash_max_collision_check_resize_trigger<External_Load_Access, Size_Type>
+
+  // A resize trigger policy based on collision checks. It keeps the
+  // simulated load factor lower than some given load factor.
+  template<bool External_Load_Access = false, typename Size_Type = size_t>
+  class cc_hash_max_collision_check_resize_trigger
+  {
+  public:
+    typedef Size_Type size_type;
+
+    enum
+      {
+	external_load_access = External_Load_Access
+      };
+
+    // Default constructor, or constructor taking load, a __load
+    // factor which it will attempt to maintain.
+    cc_hash_max_collision_check_resize_trigger(float load = 0.5);
+
+    void
+    swap(PB_DS_CLASS_C_DEC& other);
+
+    // Returns the current load.
+    inline float
+    get_load() const;
+
+    // Sets the load; does not resize the container.
+    void
+    set_load(float load);
+
+  protected:
+    inline void
+    notify_insert_search_start();
+
+    inline void
+    notify_insert_search_collision();
+
+    inline void
+    notify_insert_search_end();
+
+    inline void
+    notify_find_search_start();
+
+    inline void
+    notify_find_search_collision();
+
+    inline void
+    notify_find_search_end();
+
+    inline void
+    notify_erase_search_start();
+
+    inline void
+    notify_erase_search_collision();
+
+    inline void
+    notify_erase_search_end();
+
+    inline void
+    notify_inserted(size_type num_entries);
+
+    inline void
+    notify_erased(size_type num_entries);
+
+    void
+    notify_cleared();
+
+    // Notifies the table was resized as a result of this object's
+    // signifying that a resize is needed.
+    void
+    notify_resized(size_type new_size);
+
+    void
+    notify_externally_resized(size_type new_size);
+
+    inline bool
+    is_resize_needed() const;
+
+    inline bool
+    is_grow_needed(size_type size, size_type num_entries) const;
+
+  private:
+    void
+    calc_max_num_coll();
+
+    inline void
+    calc_resize_needed();
+
+    float 	m_load;
+    size_type 	m_size;
+    size_type 	m_num_col;
+    size_type 	m_max_col;
+    bool 	m_resize_needed;
+  };
+
+#include <ext/pb_ds/detail/resize_policy/cc_hash_max_collision_check_resize_trigger_imp.hpp>
+
+#undef PB_DS_CLASS_T_DEC
+#undef PB_DS_CLASS_C_DEC
+
+#define PB_DS_CLASS_T_DEC template<typename Size_Type>
+#define PB_DS_CLASS_C_DEC hash_exponential_size_policy<Size_Type>
+
+  // A size policy whose sequence of sizes form an exponential
+  // sequence (typically powers of 2.
+  template<typename Size_Type = size_t>
+  class hash_exponential_size_policy
+  {
+  public:
+    typedef Size_Type size_type;
+
+    // Default constructor, or onstructor taking a start_size, or
+    // constructor taking a start size and grow_factor. The policy
+    // will use the sequence of sizes start_size, start_size*
+    // grow_factor, start_size* grow_factor^2, ...
+    hash_exponential_size_policy(size_type start_size = 8,
+				 size_type grow_factor = 2);
+
+    void
+    swap(PB_DS_CLASS_C_DEC& other);
+
+  protected:
+    size_type
+    get_nearest_larger_size(size_type size) const;
+
+    size_type
+    get_nearest_smaller_size(size_type size) const;
+
+  private:
+    size_type m_start_size;
+    size_type m_grow_factor;
+  };
+
+#include <ext/pb_ds/detail/resize_policy/hash_exponential_size_policy_imp.hpp>
+
+#undef PB_DS_CLASS_T_DEC
+#undef PB_DS_CLASS_C_DEC
+
+#define PB_DS_CLASS_T_DEC
+#define PB_DS_CLASS_C_DEC hash_prime_size_policy
+
+  // A size policy whose sequence of sizes form a nearly-exponential
+  // sequence of primes.
+  class hash_prime_size_policy
+  {
+  public:
+    // Size type.
+    typedef size_t size_type;
+
+    // Default constructor, or onstructor taking a start_size The
+    // policy will use the sequence of sizes approximately
+    // start_size, start_size* 2, start_size* 2^2, ...
+    hash_prime_size_policy(size_type start_size = 8);
+
+    inline void
+    swap(PB_DS_CLASS_C_DEC& other);
+
+  protected:
+    size_type
+    get_nearest_larger_size(size_type size) const;
+
+    size_type
+    get_nearest_smaller_size(size_type size) const;
+
+  private:
+    size_type m_start_size;
+  };
+
+#include <ext/pb_ds/detail/resize_policy/hash_prime_size_policy_imp.hpp>
+
+#undef PB_DS_CLASS_T_DEC
+#undef PB_DS_CLASS_C_DEC
+
+#define PB_DS_CLASS_T_DEC template<typename Size_Policy, typename Trigger_Policy, bool External_Size_Access, typename Size_Type>
+
+#define PB_DS_CLASS_C_DEC hash_standard_resize_policy<Size_Policy, Trigger_Policy, External_Size_Access, Size_Type>
+
+  // A resize policy which delegates operations to size and trigger policies.
+  template<typename Size_Policy = hash_exponential_size_policy<>,
+	   typename Trigger_Policy = hash_load_check_resize_trigger<>,
+	   bool External_Size_Access = false,
+	   typename Size_Type = size_t>
+  class hash_standard_resize_policy 
+  : public Size_Policy, public Trigger_Policy
+  {
+  public:
+    typedef Size_Type 		size_type;
+    typedef Trigger_Policy 	trigger_policy;
+    typedef Size_Policy 	size_policy;
+
+    enum
+      {
+	external_size_access = External_Size_Access
+      };
+
+    // Default constructor.
+    hash_standard_resize_policy();
+
+    // constructor taking some policies r_size_policy will be copied
+    // by the Size_Policy object of this object.
+    hash_standard_resize_policy(const Size_Policy& r_size_policy);
+
+    // constructor taking some policies. r_size_policy will be
+    // copied by the Size_Policy object of this
+    // object. r_trigger_policy will be copied by the Trigger_Policy
+    // object of this object.
+    hash_standard_resize_policy(const Size_Policy& r_size_policy, 
+				const Trigger_Policy& r_trigger_policy);
+
+    virtual
+    ~hash_standard_resize_policy();
+
+    inline void
+    swap(PB_DS_CLASS_C_DEC& other);
+
+    // Access to the Size_Policy object used.
+    Size_Policy& 
+    get_size_policy();
+
+    // Const access to the Size_Policy object used.
+    const Size_Policy& 
+    get_size_policy() const;
+
+    // Access to the Trigger_Policy object used.
+    Trigger_Policy& 
+    get_trigger_policy();
+
+    // Access to the Trigger_Policy object used.
+    const Trigger_Policy& 
+    get_trigger_policy() const;
+
+    // Returns the actual size of the container.
+    inline size_type
+    get_actual_size() const;
+
+    // Resizes the container to suggested_new_size, a suggested size
+    // (the actual size will be determined by the Size_Policy
+    // object).
+    void
+    resize(size_type suggested_new_size);
+
+  protected:
+    inline void
+    notify_insert_search_start();
+
+    inline void
+    notify_insert_search_collision();
+
+    inline void
+    notify_insert_search_end();
+
+    inline void
+    notify_find_search_start();
+
+    inline void
+    notify_find_search_collision();
+
+    inline void
+    notify_find_search_end();
+
+    inline void
+    notify_erase_search_start();
+
+    inline void
+    notify_erase_search_collision();
+
+    inline void
+    notify_erase_search_end();
+
+    inline void
+    notify_inserted(size_type num_e);
+
+    inline void
+    notify_erased(size_type num_e);
+
+    void
+    notify_cleared();
+
+    void
+    notify_resized(size_type new_size);
+
+    inline bool
+    is_resize_needed() const;
+
+    // Queries what the new size should be, when the container is
+    // resized naturally. The current __size of the container is
+    // size, and the number of used entries within the container is
+    // num_used_e.
+    size_type
+    get_new_size(size_type size, size_type num_used_e) const;
+
+  private:
+    // Resizes to new_size.
+    virtual void
+    do_resize(size_type new_size);
+
+    typedef Trigger_Policy trigger_policy_base;
+
+    typedef Size_Policy size_policy_base;
+
+    size_type m_size;
+  };
+
+#include <ext/pb_ds/detail/resize_policy/hash_standard_resize_policy_imp.hpp>
+
+#undef PB_DS_CLASS_T_DEC
+#undef PB_DS_CLASS_C_DEC
+
+#undef PB_DS_DBG_ASSERT
+#undef PB_DS_DBG_VERIFY
+#undef PB_DS_DBG_ONLY
+
+} // namespace pb_ds
+
+#endif 
diff --git a/libstdc++-v3/include/ext/pb_ds/list_update_policy.hpp b/libstdc++-v3/include/ext/pb_ds/list_update_policy.hpp
new file mode 100644
index 00000000000..0ddd1af71f3
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/list_update_policy.hpp
@@ -0,0 +1,138 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file list_update_policy.hpp
+ * Contains policies for list update containers.
+ */
+
+#ifndef PB_DS_LU_POLICY_HPP
+#define PB_DS_LU_POLICY_HPP
+
+#include <ext/pb_ds/detail/list_update_policy/counter_lu_metadata.hpp>
+
+namespace pb_ds
+{
+  // A null type that means that each link in a list-based container
+  // does not actually need metadata.
+  struct null_lu_metadata
+  { };
+
+#define PB_DS_CLASS_T_DEC template<typename Allocator>
+#define PB_DS_CLASS_C_DEC move_to_front_lu_policy<Allocator>
+
+  // A list-update policy that unconditionally moves elements to the
+  // front of the list.
+  template<typename Allocator = std::allocator<char> >
+  class move_to_front_lu_policy
+  {
+  public:
+    typedef Allocator allocator;
+      
+    // Metadata on which this functor operates.
+    typedef null_lu_metadata metadata_type;
+      
+    // Reference to metadata on which this functor operates.
+    typedef typename allocator::template rebind<metadata_type>::other metadata_rebind;
+    typedef typename metadata_rebind::reference metadata_reference;
+      
+    // Creates a metadata object.
+    metadata_type
+    operator()() const;
+      
+    // Decides whether a metadata object should be moved to the front of the list.
+    inline bool
+    operator()(metadata_reference r_metadata) const;
+      
+  private:
+    static null_lu_metadata s_metadata;
+  };
+  
+#include <ext/pb_ds/detail/list_update_policy/mtf_lu_policy_imp.hpp>
+
+#undef PB_DS_CLASS_T_DEC
+#undef PB_DS_CLASS_C_DEC
+
+#define PB_DS_CLASS_T_DEC template<size_t Max_Count, class Allocator>
+#define PB_DS_CLASS_C_DEC counter_lu_policy<Max_Count, Allocator>
+
+  // A list-update policy that moves elements to the front of the list based on the counter algorithm.
+  template<size_t Max_Count = 5, typename Allocator = std::allocator<char> >
+  class counter_lu_policy 
+  : private detail::counter_lu_policy_base<typename Allocator::size_type>
+  {
+  public:
+    typedef Allocator allocator;
+
+    enum
+      {
+	max_count = Max_Count
+      };
+
+    typedef typename allocator::size_type size_type;
+
+    // Metadata on which this functor operates.
+    typedef detail::counter_lu_metadata<size_type> metadata_type;
+
+    // Reference to metadata on which this functor operates.
+    typedef typename Allocator::template rebind<metadata_type>::other metadata_rebind;
+    typedef typename metadata_rebind::reference metadata_reference;
+
+    // Creates a metadata object.
+    metadata_type
+    operator()() const;
+
+    // Decides whether a metadata object should be moved to the front of the list.
+    bool
+    operator()(metadata_reference r_metadata) const;
+
+  private:
+    typedef detail::counter_lu_policy_base<typename Allocator::size_type> base_type;
+  };
+
+#include <ext/pb_ds/detail/list_update_policy/counter_lu_policy_imp.hpp>
+
+#undef PB_DS_CLASS_T_DEC
+#undef PB_DS_CLASS_C_DEC
+
+} // namespace pb_ds
+
+#endif
diff --git a/libstdc++-v3/include/ext/pb_ds/priority_queue.hpp b/libstdc++-v3/include/ext/pb_ds/priority_queue.hpp
new file mode 100644
index 00000000000..c6373c5d1c9
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/priority_queue.hpp
@@ -0,0 +1,131 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file priority_queue.hpp
+ * Contains priority_queues.
+ */
+
+#ifndef PB_DS_PRIORITY_QUEUE_HPP
+#define PB_DS_PRIORITY_QUEUE_HPP
+
+#include <ext/pb_ds/tag_and_trait.hpp>
+#include <ext/pb_ds/detail/priority_queue_base_dispatch.hpp>
+#include <ext/pb_ds/detail/standard_policies.hpp>
+
+namespace pb_ds
+{
+  // A priority queue.
+  template<typename Value_Type, 
+	   typename Cmp_Fn = std::less<Value_Type>,
+	   typename Tag = pairing_heap_tag,
+	   typename Allocator = std::allocator<char> >
+  class priority_queue 
+    : public detail::priority_queue_base_dispatch<Value_Type,Cmp_Fn,Tag,Allocator>::type
+  {
+  private:
+    typedef typename detail::priority_queue_base_dispatch<Value_Type,Cmp_Fn,Tag,Allocator>::type base_type;
+
+  public:
+    typedef Value_Type 					value_type;
+    typedef Cmp_Fn 					cmp_fn;
+    typedef Tag 					container_category;
+    typedef Allocator 					allocator;
+    typedef typename allocator::size_type 		size_type;
+    typedef typename allocator::difference_type 	difference_type;
+
+    typedef typename allocator::template rebind<value_type>::other value_rebind;
+    typedef typename value_rebind::reference 		reference;
+    typedef typename value_rebind::const_reference 	const_reference;
+    typedef typename value_rebind::pointer 	   	pointer;
+    typedef typename value_rebind::const_pointer 	const_pointer;
+
+    typedef typename base_type::const_point_iterator const_point_iterator;
+    typedef typename base_type::point_iterator 		point_iterator;
+    typedef typename base_type::const_iterator 		const_iterator;
+    typedef typename base_type::iterator 		iterator;
+
+    priority_queue() { }
+
+    // Constructor taking some policy objects. r_cmp_fn will be copied
+    // by the Cmp_Fn object of the container object.
+    priority_queue(const cmp_fn& r_cmp_fn) : base_type(r_cmp_fn) { }
+
+    // Constructor taking __iterators to a range of value_types. The
+    // value_types between first_it and last_it will be inserted into
+    // the container object.
+    template<typename It>
+    priority_queue(It first_it, It last_it)
+    { base_type::copy_from_range(first_it, last_it); }
+
+    // Constructor taking __iterators to a range of value_types and
+    // some policy objects The value_types between first_it and
+    // last_it will be inserted into the container object. r_cmp_fn
+    // will be copied by the cmp_fn object of the container object.
+    template<typename It>
+    priority_queue(It first_it, It last_it, const cmp_fn& r_cmp_fn)
+    : base_type(r_cmp_fn)
+    { base_type::copy_from_range(first_it, last_it); }
+
+    priority_queue(const priority_queue& other)
+    : base_type((const base_type& )other) { }
+
+    virtual
+    ~priority_queue() { }
+
+    priority_queue& 
+    operator=(const priority_queue& other)
+    {
+      if (this !=& other)
+	{
+	  priority_queue tmp(other);
+	  swap(tmp);
+	}
+      return *this;
+    }
+
+    void
+    swap(priority_queue& other)
+    { base_type::swap(other); }
+  };
+} // namespace pb_ds
+
+#endif 
diff --git a/libstdc++-v3/include/ext/pb_ds/tag_and_trait.hpp b/libstdc++-v3/include/ext/pb_ds/tag_and_trait.hpp
new file mode 100644
index 00000000000..94039af0d80
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/tag_and_trait.hpp
@@ -0,0 +1,357 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file tag_and_trait.hpp
+ * Contains tags and traits, e.g., ones describing underlying
+ *    data structures.
+ */
+
+#ifndef PB_DS_TAG_AND_TRAIT_HPP
+#define PB_DS_TAG_AND_TRAIT_HPP
+
+#include <ext/pb_ds/detail/type_utils.hpp>
+
+namespace pb_ds
+{
+  // A trivial iterator tag. Signifies that the iterators has none of
+  // the STL's movement abilities.
+  struct trivial_iterator_tag
+  { };
+
+  // Prohibit moving trivial iterators.
+  typedef void trivial_iterator_difference_type;
+
+
+  // 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.
+  struct basic_invalidation_guarantee
+  { };
+
+  // Signifies an invalidation guarantee that includes all those of
+  // its base, and additionally, that any point-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.
+  struct point_invalidation_guarantee : public basic_invalidation_guarantee
+  { };
+
+  // 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.
+  struct range_invalidation_guarantee : public point_invalidation_guarantee
+  { };
+
+
+  // A mapped-policy indicating that an associative container is a set.
+  // XXX should this be a trait of the form is_set<T> ??
+  struct null_mapped_type { };
+
+
+  // Base data structure tag.
+  struct container_tag
+  { };
+
+  // Basic associative-container.
+  struct associative_container_tag : public container_tag { };
+
+  // Basic hash.
+  struct basic_hash_tag : public associative_container_tag { };
+
+  // Collision-chaining hash.
+  struct cc_hash_tag : public basic_hash_tag { };
+
+  // General-probing hash.
+  struct gp_hash_tag : public basic_hash_tag { };
+
+  // Basic tree.
+  struct basic_tree_tag : public associative_container_tag { };
+
+  // tree.
+  struct tree_tag : public basic_tree_tag { };
+
+  // Red-black tree.
+  struct rb_tree_tag : public tree_tag { };
+
+  // Splay tree.
+  struct splay_tree_tag : public tree_tag { };
+
+  // Ordered-vector tree.
+  struct ov_tree_tag : public tree_tag { };
+
+  // trie.
+  struct trie_tag : public basic_tree_tag { };
+
+  // PATRICIA trie.
+  struct pat_trie_tag : public trie_tag { };
+
+  // List-update.
+  struct list_update_tag : public associative_container_tag { };
+
+  // Basic priority-queue.
+  struct priority_queue_tag : public container_tag { };
+
+  // Pairing-heap.
+  struct pairing_heap_tag : public priority_queue_tag { };
+
+  // Binomial-heap.
+  struct binomial_heap_tag : public priority_queue_tag { };
+
+  // Redundant-counter binomial-heap.
+  struct rc_binomial_heap_tag : public priority_queue_tag { };
+
+  // Binary-heap (array-based).
+  struct binary_heap_tag : public priority_queue_tag { };
+
+  // Thin heap.
+  struct thin_heap_tag : public priority_queue_tag { };
+
+
+  template<typename Tag>
+  struct container_traits_base;
+
+  template<>
+  struct container_traits_base<cc_hash_tag>
+  {
+    typedef cc_hash_tag container_category;
+    typedef point_invalidation_guarantee invalidation_guarantee;
+
+    enum
+      {
+        order_preserving = false,
+        erase_can_throw = false,
+	split_join_can_throw = false,
+	reverse_iteration = false
+      };
+  };
+
+  template<>
+  struct container_traits_base<gp_hash_tag>
+  {
+    typedef gp_hash_tag container_category;
+    typedef basic_invalidation_guarantee invalidation_guarantee;
+
+    enum
+      {
+        order_preserving = false,
+	erase_can_throw = false,
+	split_join_can_throw = false,
+	reverse_iteration = false
+      };
+  };
+
+  template<>
+  struct container_traits_base<rb_tree_tag>
+  {
+    typedef rb_tree_tag container_category;
+    typedef range_invalidation_guarantee invalidation_guarantee;
+
+    enum
+      {
+        order_preserving = true,
+        erase_can_throw = false,
+	split_join_can_throw = false,
+        reverse_iteration = true
+      };
+  };
+
+  template<>
+  struct container_traits_base<splay_tree_tag>
+  {
+    typedef splay_tree_tag container_category;
+    typedef range_invalidation_guarantee invalidation_guarantee;
+
+    enum
+      {
+        order_preserving = true,
+        erase_can_throw = false,
+        split_join_can_throw = false,
+        reverse_iteration = true
+      };
+  };
+
+  template<>
+  struct container_traits_base<ov_tree_tag>
+  {
+    typedef ov_tree_tag container_category;
+    typedef basic_invalidation_guarantee invalidation_guarantee;
+
+    enum
+      {
+        order_preserving = true,
+        erase_can_throw = true,
+        split_join_can_throw = true,
+        reverse_iteration = false
+      };
+  };
+
+  template<>
+  struct container_traits_base<pat_trie_tag>
+  {
+    typedef pat_trie_tag container_category;
+    typedef range_invalidation_guarantee invalidation_guarantee;
+
+    enum
+      {
+        order_preserving = true,
+        erase_can_throw = false,
+        split_join_can_throw = true,
+        reverse_iteration = true
+      };
+  };
+
+  template<>
+  struct container_traits_base<list_update_tag>
+  {
+    typedef list_update_tag container_category;
+    typedef point_invalidation_guarantee invalidation_guarantee;
+
+    enum
+      {
+        order_preserving = false,
+        erase_can_throw = false,
+	split_join_can_throw = false,
+        reverse_iteration = false
+      };
+  };
+
+
+  template<>
+  struct container_traits_base<pairing_heap_tag>
+  {
+    typedef pairing_heap_tag container_category;
+    typedef point_invalidation_guarantee invalidation_guarantee;
+
+    enum
+      {
+        order_preserving = false,
+        erase_can_throw = false,
+	split_join_can_throw = false,
+        reverse_iteration = false
+      };
+  };
+
+  template<>
+  struct container_traits_base<thin_heap_tag>
+  {
+    typedef thin_heap_tag container_category;
+    typedef point_invalidation_guarantee invalidation_guarantee;
+
+    enum
+      {
+        order_preserving = false,
+        erase_can_throw = false,
+	split_join_can_throw = false,
+        reverse_iteration = false
+      };
+  };
+
+  template<>
+  struct container_traits_base<binomial_heap_tag>
+  {
+    typedef binomial_heap_tag container_category;
+    typedef point_invalidation_guarantee invalidation_guarantee;
+
+    enum
+      {
+        order_preserving = false,
+        erase_can_throw = false,
+	split_join_can_throw = false,
+        reverse_iteration = false
+      };
+  };
+
+  template<>
+  struct container_traits_base<rc_binomial_heap_tag>
+  {
+    typedef rc_binomial_heap_tag container_category;
+    typedef point_invalidation_guarantee invalidation_guarantee;
+
+    enum
+      {
+        order_preserving = false,
+        erase_can_throw = false,
+	split_join_can_throw = false,
+        reverse_iteration = false
+      };
+  };
+
+  template<>
+  struct container_traits_base<binary_heap_tag>
+  {
+    typedef binary_heap_tag container_category;
+    typedef basic_invalidation_guarantee invalidation_guarantee;
+
+    enum
+      {
+        order_preserving = false,
+        erase_can_throw = false,
+	split_join_can_throw = true,
+        reverse_iteration = false
+      };
+  };
+
+  
+  // See Matt Austern for the name, S. Meyers MEFC++ #2, others.
+  template<typename Cntnr>
+  struct container_traits 
+  : public container_traits_base<typename Cntnr::container_category>
+  {
+    typedef Cntnr container_type;
+    typedef typename Cntnr::container_category container_category;
+    typedef container_traits_base<container_category> base_type;
+    typedef typename base_type::invalidation_guarantee invalidation_guarantee;
+
+    enum
+      {
+	order_preserving = base_type::order_preserving,
+	erase_can_throw = base_type::erase_can_throw,
+	split_join_can_throw = base_type::split_join_can_throw,
+	reverse_iteration = base_type::reverse_iteration
+      };
+  };
+} // namespace pb_ds
+
+#endif
diff --git a/libstdc++-v3/include/ext/pb_ds/tree_policy.hpp b/libstdc++-v3/include/ext/pb_ds/tree_policy.hpp
new file mode 100644
index 00000000000..3c80fc6986a
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/tree_policy.hpp
@@ -0,0 +1,168 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file tree_policy.hpp
+ * Contains tree-related policies.
+ */
+
+#ifndef PB_DS_TREE_POLICY_HPP
+#define PB_DS_TREE_POLICY_HPP
+
+#include <iterator>
+#include <ext/pb_ds/detail/type_utils.hpp>
+#include <ext/pb_ds/detail/basic_tree_policy/basic_tree_policy_base.hpp>
+
+namespace pb_ds
+{
+  // A null node updator, indicating that no node updates are required.
+  template<typename Const_Node_Iterator,
+	   typename Node_Iterator,
+	   typename Cmp_Fn,
+	   typename Allocator>
+  struct null_tree_node_update
+  { };
+
+#define PB_DS_CLASS_T_DEC \
+  template<typename Const_Node_Iterator, class Node_Iterator, class Cmp_Fn, class Allocator>
+
+#define PB_DS_CLASS_C_DEC \
+  tree_order_statistics_node_update<Const_Node_Iterator, Node_Iterator, Cmp_Fn, Allocator>
+
+#define PB_DS_BASE_C_DEC						\
+  detail::basic_tree_policy_base<Const_Node_Iterator, Node_Iterator, Allocator>
+
+  // Functor updating ranks of entrees.
+  template<typename Const_Node_Iterator, typename Node_Iterator, 
+	   typename Cmp_Fn, typename Allocator>
+  class tree_order_statistics_node_update : private PB_DS_BASE_C_DEC
+  {
+  private:
+    typedef PB_DS_BASE_C_DEC base_type;
+
+  public:
+    typedef Cmp_Fn cmp_fn;
+    typedef Allocator allocator;
+    typedef typename allocator::size_type size_type;
+    typedef typename base_type::key_type key_type;
+    typedef typename base_type::const_key_reference const_key_reference;
+
+    typedef size_type metadata_type;
+    typedef Const_Node_Iterator const_node_iterator;
+    typedef Node_Iterator node_iterator;
+    typedef typename const_node_iterator::value_type const_iterator;
+    typedef typename node_iterator::value_type iterator;
+
+    // Finds an entry by __order. Returns a const_iterator to the
+    // entry with the __order order, or a const_iterator to the
+    // container object's end if order is at least the size of the
+    // container object.
+    inline const_iterator
+    find_by_order(size_type order) const;
+
+    // Finds an entry by __order. Returns an iterator to the entry
+    // with the __order order, or an iterator to the container
+    // object's end if order is at least the size of the container
+    // object.
+    inline iterator
+    find_by_order(size_type order);
+
+    // Returns the order of a key within a sequence. For exapmle, if
+    // r_key is the smallest key, this method will return 0; if r_key
+    // is a key between the smallest and next key, this method will
+    // return 1; if r_key is a key larger than the largest key, this
+    // method will return the size of r_c.
+    inline size_type
+    order_of_key(const_key_reference r_key) const;
+
+  private:
+    // Const reference to the container's value-type.
+    typedef typename base_type::const_reference const_reference;
+
+    // Const pointer to the container's value-type.
+    typedef typename base_type::const_pointer const_pointer;
+
+    typedef typename allocator::template rebind<metadata_type>::other metadata_rebind;
+    // Const metadata reference.
+    typedef typename metadata_rebind::const_reference const_metadata_reference;
+
+    // Metadata reference.
+    typedef typename metadata_rebind::reference metadata_reference;
+
+    // Returns the const_node_iterator associated with the tree's root node.
+    virtual const_node_iterator
+    node_begin() const = 0;
+
+    // Returns the node_iterator associated with the tree's root node.
+    virtual node_iterator
+    node_begin() = 0;
+
+    // Returns the const_node_iterator associated with a just-after leaf node.
+    virtual const_node_iterator
+    node_end() const = 0;
+
+    // Returns the node_iterator associated with a just-after leaf node.
+    virtual node_iterator
+    node_end() = 0;
+
+    // Access to the cmp_fn object.
+    virtual cmp_fn& 
+    get_cmp_fn() = 0;
+
+  protected:
+    // Updates the rank of a node through a node_iterator node_it;
+    // end_nd_it is the end node iterator.
+    inline void
+    operator()(node_iterator node_it, const_node_iterator end_nd_it) const;
+
+    virtual
+    ~tree_order_statistics_node_update();
+  };
+
+#include <ext/pb_ds/detail/tree_policy/order_statistics_imp.hpp>
+
+#undef PB_DS_CLASS_T_DEC
+#undef PB_DS_CLASS_C_DEC
+#undef PB_DS_BASE_C_DEC
+
+} // namespace pb_ds
+
+#endif 
diff --git a/libstdc++-v3/include/ext/pb_ds/trie_policy.hpp b/libstdc++-v3/include/ext/pb_ds/trie_policy.hpp
new file mode 100644
index 00000000000..adba0cb02db
--- /dev/null
+++ b/libstdc++-v3/include/ext/pb_ds/trie_policy.hpp
@@ -0,0 +1,366 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file trie_policy.hpp
+ * Contains trie-related policies.
+ */
+
+#ifndef PB_DS_TRIE_POLICY_HPP
+#define PB_DS_TRIE_POLICY_HPP
+
+#include <string>
+#include <climits>
+#include <ext/pb_ds/detail/type_utils.hpp>
+#include <ext/pb_ds/detail/trie_policy/trie_policy_base.hpp>
+
+namespace pb_ds
+{
+  // A null node updator, indicating that no node updates are required.
+  template<typename Const_Node_Iterator,
+	   typename Node_Iterator,
+	   typename E_Access_Traits,
+	   typename Allocator>
+  struct null_trie_node_update
+  { };
+
+#define PB_DS_STATIC_ASSERT(UNIQUE, E)					\
+  typedef detail::static_assert_dumclass<sizeof(detail::static_assert<(bool)(E)>)> UNIQUE##static_assert_type
+
+#define PB_DS_CLASS_T_DEC						\
+  template<typename String, typename String::value_type Min_E_Val, typename String::value_type Max_E_Val, bool Reverse, typename Allocator>
+
+#define PB_DS_CLASS_C_DEC						\
+  string_trie_e_access_traits<String, Min_E_Val,Max_E_Val,Reverse,Allocator>
+
+  // Element access traits for string types.
+  template<typename String = std::string,
+	   typename String::value_type Min_E_Val = SCHAR_MIN,
+	   typename String::value_type Max_E_Val = SCHAR_MAX,
+	   bool Reverse = false,
+	   typename Allocator = std::allocator<char> >
+  struct string_trie_e_access_traits
+  {
+  public:
+    typedef typename Allocator::size_type size_type;
+    typedef String key_type;
+    typedef typename Allocator::template rebind<key_type>::other key_rebind;
+    typedef typename key_rebind::const_reference const_key_reference;
+
+    enum
+      {
+	reverse = Reverse
+      };
+
+    // Element const iterator type.
+    typedef typename detail::conditional_type<Reverse, typename String::const_reverse_iterator, typename String::const_iterator>::type const_iterator;
+
+    // Element type.
+    typedef typename std::iterator_traits<const_iterator>::value_type e_type;
+
+    enum
+      {
+	min_e_val = Min_E_Val,
+	max_e_val = Max_E_Val,
+	max_size = max_e_val - min_e_val + 1
+      };
+
+    // Returns a const_iterator to the first element of
+    // const_key_reference agumnet.
+    inline static const_iterator
+    begin(const_key_reference);
+
+    // Returns a const_iterator to the after-last element of
+    // const_key_reference argument.
+    inline static const_iterator
+    end(const_key_reference);
+
+    // Maps an element to a position.
+    inline static size_type
+    e_pos(e_type e);
+
+  private:
+    PB_DS_STATIC_ASSERT(min_max_size, max_size >= 2);
+
+    inline static const_iterator
+    begin_imp(const_key_reference, detail::false_type);
+
+    inline static const_iterator
+    begin_imp(const_key_reference, detail::true_type);
+
+    inline static const_iterator
+    end_imp(const_key_reference, detail::false_type);
+
+    inline static const_iterator
+    end_imp(const_key_reference, detail::true_type);
+
+    static detail::integral_constant<int,Reverse> s_rev_ind;
+  };
+
+#include <ext/pb_ds/detail/trie_policy/string_trie_e_access_traits_imp.hpp>
+
+#undef PB_DS_CLASS_T_DEC
+#undef PB_DS_CLASS_C_DEC
+
+#define PB_DS_CLASS_T_DEC \
+  template<typename Const_Node_Iterator,typename Node_Iterator,class E_Access_Traits, typename Allocator>
+
+#define PB_DS_CLASS_C_DEC \
+  trie_prefix_search_node_update<Const_Node_Iterator, Node_Iterator, E_Access_Traits,Allocator>
+
+#define PB_DS_BASE_C_DEC \
+  detail::trie_policy_base<Const_Node_Iterator,Node_Iterator,E_Access_Traits, Allocator>
+
+  // A node updator that allows tries to be searched for the range of
+  // values that match a certain prefix.
+  template<typename Const_Node_Iterator,
+	   typename Node_Iterator,
+	   typename E_Access_Traits,
+	   typename Allocator>
+  class trie_prefix_search_node_update : private PB_DS_BASE_C_DEC
+  {
+  private:
+    typedef PB_DS_BASE_C_DEC base_type;
+
+  public:
+    typedef typename base_type::key_type key_type;
+    typedef typename base_type::const_key_reference const_key_reference;
+
+    // Element access traits.
+    typedef E_Access_Traits e_access_traits;
+
+    // Const element iterator.
+    typedef typename e_access_traits::const_iterator const_e_iterator;
+
+    // Allocator type.
+    typedef Allocator allocator;
+
+    // Size type.
+    typedef typename allocator::size_type size_type;
+    typedef detail::null_node_metadata metadata_type;
+    typedef Const_Node_Iterator const_node_iterator;
+    typedef Node_Iterator node_iterator;
+    typedef typename const_node_iterator::value_type const_iterator;
+    typedef typename node_iterator::value_type iterator;
+
+    // Finds the const iterator range corresponding to all values
+    // whose prefixes match r_key.
+    std::pair<const_iterator, const_iterator>
+    prefix_range(const_key_reference) const;
+
+    // Finds the iterator range corresponding to all values whose
+    // prefixes match r_key.
+    std::pair<iterator, iterator>
+    prefix_range(const_key_reference);
+
+    // Finds the const iterator range corresponding to all values
+    // whose prefixes match [b, e).
+    std::pair<const_iterator, const_iterator>
+    prefix_range(const_e_iterator, const_e_iterator) const;
+
+    // Finds the iterator range corresponding to all values whose
+    // prefixes match [b, e).
+    std::pair<iterator, iterator>
+    prefix_range(const_e_iterator, const_e_iterator);
+
+  protected:
+    // Called to update a node's metadata.
+    inline void
+    operator()(node_iterator node_it, const_node_iterator end_nd_it) const;
+
+  private:
+    // Returns the const iterator associated with the just-after last element.
+    virtual const_iterator
+    end() const = 0;
+
+    // Returns the iterator associated with the just-after last element.
+    virtual iterator
+    end() = 0;
+
+    // Returns the const_node_iterator associated with the trie's root node.
+    virtual const_node_iterator
+    node_begin() const = 0;
+
+    // Returns the node_iterator associated with the trie's root node.
+    virtual node_iterator
+    node_begin() = 0;
+
+    // Returns the const_node_iterator associated with a just-after leaf node.
+    virtual const_node_iterator
+    node_end() const = 0;
+
+    // Returns the node_iterator associated with a just-after leaf node.
+    virtual node_iterator
+    node_end() = 0;
+
+    // Access to the cmp_fn object.
+    virtual const e_access_traits& 
+    get_e_access_traits() const = 0;
+
+    node_iterator
+    next_child(node_iterator, const_e_iterator, const_e_iterator, 
+	       node_iterator, const e_access_traits&);
+  };
+
+#include <ext/pb_ds/detail/trie_policy/prefix_search_node_update_imp.hpp>
+
+#undef PB_DS_CLASS_C_DEC
+
+#define PB_DS_CLASS_C_DEC \
+  trie_order_statistics_node_update<Const_Node_Iterator, Node_Iterator,E_Access_Traits, Allocator>
+
+  // Functor updating ranks of entrees.
+  template<typename Const_Node_Iterator,
+	   typename Node_Iterator,
+	   typename E_Access_Traits,
+	   typename Allocator>
+  class trie_order_statistics_node_update : private PB_DS_BASE_C_DEC
+  {
+  private:
+    typedef PB_DS_BASE_C_DEC base_type;
+
+  public:
+    typedef E_Access_Traits e_access_traits;
+    typedef typename e_access_traits::const_iterator const_e_iterator;
+    typedef Allocator allocator;
+    typedef typename allocator::size_type size_type;
+    typedef typename base_type::key_type key_type;
+    typedef typename base_type::const_key_reference const_key_reference;
+
+    typedef size_type metadata_type;
+    typedef Const_Node_Iterator const_node_iterator;
+    typedef Node_Iterator node_iterator;
+    typedef typename const_node_iterator::value_type const_iterator;
+    typedef typename node_iterator::value_type iterator;
+
+    // Finds an entry by __order. Returns a const_iterator to the
+    // entry with the __order order, or a const_iterator to the
+    // container object's end if order is at least the size of the
+    // container object.
+    inline const_iterator
+    find_by_order(size_type) const;
+
+    // Finds an entry by __order. Returns an iterator to the entry
+    // with the __order order, or an iterator to the container
+    // object's end if order is at least the size of the container
+    // object.
+    inline iterator
+    find_by_order(size_type);
+
+    // Returns the order of a key within a sequence. For exapmle, if
+    // r_key is the smallest key, this method will return 0; if r_key
+    // is a key between the smallest and next key, this method will
+    // return 1; if r_key is a key larger than the largest key, this
+    // method will return the size of r_c.
+    inline size_type
+    order_of_key(const_key_reference) const;
+
+    // Returns the order of a prefix within a sequence. For exapmle,
+    // if [b, e] is the smallest prefix, this method will return 0; if
+    // r_key is a key between the smallest and next key, this method
+    // will return 1; if r_key is a key larger than the largest key,
+    // this method will return the size of r_c.
+    inline size_type
+    order_of_prefix(const_e_iterator, const_e_iterator) const;
+
+  private:
+    typedef typename base_type::const_reference const_reference;
+    typedef typename base_type::const_pointer const_pointer;
+
+    typedef typename Allocator::template rebind<metadata_type>::other metadata_rebind;
+    typedef typename metadata_rebind::const_reference const_metadata_reference;
+    typedef typename metadata_rebind::reference metadata_reference;
+
+    // Returns true if the container is empty.
+    virtual bool
+    empty() const = 0;
+
+    // Returns the iterator associated with the trie's first element.
+    virtual iterator
+    begin() = 0;
+
+    // Returns the iterator associated with the trie's
+    // just-after-last element.
+    virtual iterator
+    end() = 0;
+
+    // Returns the const_node_iterator associated with the trie's root node.
+    virtual const_node_iterator
+    node_begin() const = 0;
+
+    // Returns the node_iterator associated with the trie's root node.
+    virtual node_iterator
+    node_begin() = 0;
+
+    // Returns the const_node_iterator associated with a just-after
+    // leaf node.
+    virtual const_node_iterator
+    node_end() const = 0;
+
+    // Returns the node_iterator associated with a just-after leaf node.
+    virtual node_iterator
+    node_end() = 0;
+
+    // Access to the cmp_fn object.
+    virtual e_access_traits& 
+    get_e_access_traits() = 0;
+
+  protected:
+    // Updates the rank of a node through a node_iterator node_it;
+    // end_nd_it is the end node iterator.
+    inline void
+    operator()(node_iterator, const_node_iterator) const;
+
+    // Destructor.
+    virtual
+    ~trie_order_statistics_node_update();
+  };
+
+#include <ext/pb_ds/detail/trie_policy/order_statistics_imp.hpp>
+
+#undef PB_DS_CLASS_T_DEC
+#undef PB_DS_CLASS_C_DEC
+#undef PB_DS_BASE_C_DEC
+#undef PB_DS_STATIC_ASSERT
+
+} // namespace pb_ds
+
+#endif
diff --git a/libstdc++-v3/scripts/check_performance b/libstdc++-v3/scripts/check_performance
index f5d2351d837..ff5a44ba077 100755
--- a/libstdc++-v3/scripts/check_performance
+++ b/libstdc++-v3/scripts/check_performance
@@ -33,36 +33,36 @@ SH_FLAG="-Wl,--rpath -Wl,$BUILD_DIR/../../gcc \
 ST_FLAG="-static"
 LINK=$SH_FLAG
 CXX="$COMPILER $INCLUDES $PCH_FLAGS $FLAGS $LINK"
+LIBS="./libtestc++.a"
 TESTS_FILE="testsuite_files_performance"
 
 for NAME in `cat $TESTS_FILE`
 do
   RUN=true
+  TESTNAME=$SRC_DIR/testsuite/$NAME
+  FILE_NAME="`basename $NAME`"
+  FILE_NAME="`echo $FILE_NAME | sed 's/.cc//g'`"
 
   # TEST_S == single thread
   # TEST_B == do both single and multi-thread
   # TEST_T == multi-thread
-  for CYCLE in `sed -n 's,.*\(TEST_[SB][0-9]*\)$,\1,p' $SRC_DIR/testsuite/$NAME`
+  for CYCLE in `sed -n 's,.*\(TEST_[SB][0-9]*\)$,\1,p' $TESTNAME`
   do
     RUN=false
     echo $NAME $CYCLE
-    FILE_NAME="`basename $NAME`"
-    FILE_NAME="`echo $FILE_NAME | sed 's/.cc//g'`"
     EXE_NAME="`echo $FILE_NAME-$CYCLE.exe`"
-    $CXX -DNOTHREAD -D$CYCLE $SRC_DIR/testsuite/$NAME -o $EXE_NAME
+    $CXX -DNOTHREAD -D$CYCLE $TESTNAME $LIBS -o $EXE_NAME
     if [ -f $EXE_NAME ]; then
       ./$EXE_NAME
     fi
   done
 
-  for CYCLE in `sed -n 's,.*\(TEST_[TB][0-9]*\)$,\1,p' $SRC_DIR/testsuite/$NAME`
+  for CYCLE in `sed -n 's,.*\(TEST_[TB][0-9]*\)$,\1,p' $TESTNAME`
   do
     RUN=false
     echo $NAME $CYCLE thread
-    FILE_NAME="`basename $NAME`"
-    FILE_NAME="`echo $FILE_NAME | sed 's/.cc//g'`"
     EXE_NAME="`echo $FILE_NAME-$CYCLE.exe`"
-    $CXX $THREAD_FLAG -D$CYCLE $SRC_DIR/testsuite/$NAME -o $EXE_NAME
+    $CXX $THREAD_FLAG -D$CYCLE $TESTNAME $LIBS -o $EXE_NAME
     if [ -f $EXE_NAME ]; then
       ./$EXE_NAME
     fi
@@ -70,11 +70,13 @@ do
 
   if $RUN; then
     echo $NAME
-    FILE_NAME="`basename $NAME`"
-    EXE_NAME="`echo $FILE_NAME | sed 's/cc$/exe/'`"
-    $CXX $SRC_DIR/testsuite/$NAME -o $EXE_NAME
+    EXE_NAME="`echo $FILE_NAME.exe`"
+    $CXX $TESTNAME $LIBS -o $EXE_NAME
     if [ -f $EXE_NAME ]; then
-      ./$EXE_NAME
+	./$EXE_NAME >& tmp.$FILE_NAME
+    fi
+    if [ -s tmp.$FILE_NAME ]; then
+	mv tmp.$FILE_NAME $FILE_NAME.xml
     fi
   fi
 done
diff --git a/libstdc++-v3/scripts/make_graph.py b/libstdc++-v3/scripts/make_graph.py
new file mode 100755
index 00000000000..61e18be4768
--- /dev/null
+++ b/libstdc++-v3/scripts/make_graph.py
@@ -0,0 +1,576 @@
+#!/usr/bin/python
+
+import string
+import sys
+import re
+import os
+import platform
+import commands
+from Numeric import *
+from pychart import *
+from xml.dom import minidom
+
+class exception:
+	pass
+
+
+def comp_platform_info(compiler):
+	ret = '<ul>\n'
+	so = commands.getstatusoutput('cat /proc/cpuinfo | grep \'cpu MHz\'')
+	if so[0] == 0:
+		ret += '<li>CPU speed - %s</li>\n' % so[1]
+	so = commands.getstatusoutput('cat /proc/meminfo | grep \'MemTotal\'')
+	if so[0] == 0:
+		ret += '<li>Memory - %s</li>\n' % so[1]
+	ret += '<li>Platform - %s</li>\n' % platform.platform()
+	so = commands.getstatusoutput(compiler + ' --version')
+	if so[0] == 0:
+		ret += '<li>Compiler - %s</li>\n' % so[1]
+	ret += '</ul>\n'
+	return ret
+
+
+class res:
+	"""
+	A 'structure' representing the results of a test.
+	"""
+	def __init__(self, x_label, y_label, cntnr_list, cntnr_descs, res_sets):
+		self.x_label = x_label
+		self.y_label = y_label
+		self.cntnr_list = cntnr_list
+		self.cntnr_descs = cntnr_descs
+		self.res_sets = res_sets
+
+
+class res_getter:
+	"""
+	This class returns a res object for some test.
+	"""
+	class __sorter:
+		def __accum(self, results):
+			total = 0
+			for result in results:
+				total = total + result[1]
+			return total
+
+		def sort(self, cntnr_list, res_sets):
+			cntnrs_and_totals = []
+			for cntnr in cntnr_list:
+				results = res_sets[cntnr]
+				total = self.__accum(results)
+				cntnrs_and_totals.append((cntnr, total))
+			by_total = lambda x,y: x[1] > y[1] and -1 or 1
+			cntnrs_and_totals.sort(by_total)
+			ret = []
+			for cntnr_and_total in cntnrs_and_totals:
+				cntnr = cntnr_and_total[0]
+				ret.append(cntnr)
+			return ret
+
+	def __init__(self, test_infos_f_name):
+		self.__test_to_container_res_sets = {}
+		self.__test_to_f_names = {}
+		tests_dat = minidom.parse(test_infos_f_name)
+		for test in tests_dat.getElementsByTagName('test'):
+			test_name = test.attributes['name'].value
+			self.__test_to_f_names[test_name] = test.getElementsByTagName('file')[0].attributes['name'].value
+			cntnr_list = []
+			for cntnr in test.getElementsByTagName('cntnr'):
+				cntnr_list.append(cntnr.attributes['name'].value)
+			self.__test_to_container_res_sets[test_name] = cntnr_list
+
+	def __get_label(self, tst_dat, label_name):
+		label = tst_dat.getElementsByTagName(label_name)[0].firstChild.data
+		label = string.strip(label, '\n')
+		label = string.strip(label)
+		return label
+
+	def __parse_res_sets(self, f_name, cntnr_list):	
+		tst_dat = minidom.parse(f_name)
+		x_label = self.__get_label(tst_dat, 'x_name')
+		y_label = self.__get_label(tst_dat, 'y_name')
+		parsed_container_list = tst_dat.getElementsByTagName('cntnr')
+		res_sets = {}
+		cntnr_descs = {}
+		for cntnr in parsed_container_list:
+			cntnr_name = cntnr.attributes["name"].value
+			res_sets[cntnr_name] = []
+		for cntnr in parsed_container_list:
+			cntnr_name = cntnr.attributes["name"].value
+			cntnr_desc = cntnr.getElementsByTagName('desc')
+			if res_sets.has_key(cntnr_name):
+				res_set = []
+				result_list = cntnr.getElementsByTagName('result')
+				for result in result_list:
+					x = string.atol(result.attributes["x"].value)
+					y = string.atof(result.attributes["y"].value)
+					res_set.append((x, y))
+				res_sets[cntnr_name] = res_set
+				cntnr_descs[cntnr_name] = cntnr_desc[0]
+		return (x_label, y_label, cntnr_descs, res_sets)
+
+	def get(self, res_dir, test_name):
+		cntnr_list = self.__test_to_container_res_sets[test_name]
+		f_name = res_dir + '/' + self.__test_to_f_names[test_name]
+		parsed = self.__parse_res_sets(f_name, cntnr_list)
+		x_label = parsed[0]
+		y_label = parsed[1]
+		cntnr_descs = parsed[2]
+		res_sets = parsed[3]
+		cntnr_list = self.__sorter().sort(cntnr_list, res_sets)
+		return res(x_label, y_label, cntnr_list, cntnr_descs, res_sets)
+
+
+class png_maker:
+	"""
+	This class creates a png file from a result set.
+	"""
+	class __style_chooser:
+		def __init__(self):
+			self.native_re = re.compile(r'n_(?:.*?)')
+
+			self.native_tick_mark_0 = tick_mark.Circle(size = 4)
+			self.native_tick_mark_1 = tick_mark.Square(size = 4)
+			self.native_line_style_0 = line_style.T(color = color.black, width=2)
+			self.native_line_style_1 = line_style.T(color = color.black, width=2)
+
+			self.mask_re = re.compile(r'mask(?:.*?)')
+			self.mod_re = re.compile(r'mod(?:.*?)')
+
+			self.rb_tree_mmap_rb_tree_set_re = re.compile(r'rb_tree_mmap_rb_tree_set(?:.*?)')
+			self.rb_tree_mmap_lu_mtf_set_re = re.compile(r'rb_tree_mmap_lu_mtf_set(?:.*?)')
+
+			self.splay_re = re.compile(r'splay(?:.*?)')
+			self.rb_tree_re = re.compile(r'rb_tree(?:.*?)')
+			self.ov_tree_re = re.compile(r'ov_tree(?:.*?)')
+			self.splay_tree_re = re.compile(r'splay_tree(?:.*?)')
+
+			self.pat_trie_re = re.compile(r'pat_trie(?:.*?)')
+
+			self.lc_1div8_1div2_re = re.compile(r'lc_1div8_1div2(?:.*?)')
+			self.lc_1div8_1div1_re = re.compile(r'lc_1div8_1div1(?:.*?)')
+			self.mcolc_1div2_re = re.compile(r'mcolc_1div2(?:.*?)')
+
+		def choose(self, cntnr):
+			if self.native_re.search(cntnr):
+				if cntnr == 'n_pq_vector':
+					return (self.native_tick_mark_1, self.native_line_style_1)
+
+				return (self.native_tick_mark_0, self.native_line_style_0)
+
+			# tick_mark predefined
+			# square, circle3, dia, tri, dtri, star, plus5, x5, gray70dia, blackdtri, blackdia
+			if self.mask_re.search(cntnr):
+				clr = color.navy
+			elif self.mod_re.search(cntnr):
+				clr = color.green4
+			elif self.rb_tree_mmap_rb_tree_set_re.search(cntnr):
+				clr = color.mediumblue
+				tm = tick_mark.square
+			elif self.rb_tree_mmap_lu_mtf_set_re.search(cntnr) or cntnr == 'rc_binomial_heap':
+				clr = color.gray50
+				tm = tick_mark.dia
+			elif self.splay_tree_re.search(cntnr) or cntnr == 'binomial_heap':
+				clr = color.gray58
+				tm = tick_mark.tri
+			elif self.rb_tree_re.search(cntnr) or cntnr == 'binary_heap':
+				clr = color.red3
+				tm = tick_mark.dtri
+			elif self.ov_tree_re.search(cntnr) or cntnr == 'thin_heap':
+				clr = color.orangered1
+				tm = tick_mark.star
+			elif self.pat_trie_re.search(cntnr) or cntnr == 'pairing_heap':
+				clr = color.blueviolet
+				tm = tick_mark.plus5
+			else:
+				sys.stderr.write(cntnr + '\n')
+				raise exception
+
+                        # mask / mod
+                        if cntnr.find('lc_1div8_1div') <> -1:
+				if cntnr.find('mask') <> -1:
+					# mask
+					if self.lc_1div8_1div2_re.search(cntnr):
+						if cntnr.find('nsth') <> -1:
+							tm = tick_mark.x5
+						else:
+							tm = tick_mark.gray70dia
+					if self.lc_1div8_1div1_re.search(cntnr):
+						if cntnr.find('nsth') <> -1:
+							tm = tick_mark.dia
+                                                else:
+							tm = tick_mark.circle3
+                                else:
+                                        # mod
+					if self.lc_1div8_1div2_re.search(cntnr):
+						if cntnr.find('nsth') <> -1:
+							tm = tick_mark.tri
+						else:
+                                                        tm = tick_mark.square
+					if self.lc_1div8_1div1_re.search(cntnr):
+						if cntnr.find('nsth') <> -1:
+                                                        tm = tick_mark.dtri
+                                                else:
+                                                        tm = tick_mark.star
+
+			if self.mcolc_1div2_re.search(cntnr):
+				tm = tick_mark.circle3
+				
+			return (tm, line_style.T(color = clr, width = 2))
+
+
+	def __init__(self):
+		self.__sc = self.__style_chooser()
+		self.__mmap_re = re.compile('mmap_')
+
+	def __container_label_name(self, cntnr):
+		return self.__mmap_re.sub('\nmmap_\n', cntnr)
+
+	def make(self, res, of_name):
+		theme.output_format = 'png'
+		theme.output_file = of_name
+		theme.scale_factor = 2
+#		theme.default_font_size = 5
+		theme.use_color = 1
+		theme.reinitialize()
+		y_tick_interval = self.__get_y_tics(res)
+		xaxis = axis.X(format = '/a90/hL%d',
+			       tic_interval = 200,
+			       label = res.x_label)
+		yaxis = axis.Y(format = '%.2e', 
+			       tic_interval = y_tick_interval,
+			       label = res.y_label)
+		legend_lines = len(res.cntnr_list)
+		legend_vloc = 50 + (legend_lines * 10)
+		ar = area.T(x_axis = xaxis, y_axis = yaxis,
+			    legend = legend.T(loc=(0,-legend_vloc),
+					      frame_line_style=None,
+					      inter_row_sep=2),
+			    size=(240,110))
+		plot_list = []
+		for cntnr in res.cntnr_list:
+			style = self.__sc.choose(cntnr)
+			print cntnr
+			pl = line_plot.T(label = self.__container_label_name(cntnr), 
+				data = res.res_sets[cntnr], 
+				tick_mark = style[0], 
+				line_style = style[1])
+			plot_list.append(pl)
+		for plot in plot_list:
+			ar.add_plot(plot)
+		ar.draw()
+
+
+	def __get_y_tics(self, res):
+		mx = 0
+		for cntnr in res.cntnr_list:
+			m = max(d[1] for d in res.res_sets[cntnr])
+			mx = max(m, mx)
+		return mx / 5 
+
+
+
+def make_tt(s):
+	return '<tt>' + s + '</tt>'
+
+def make_b(s):
+	return '<b>' + s + '</b>'
+
+def make_ttb(s):
+	return '<tt><b>' + s + '</b></tt>'
+
+def make_i(s):
+	return '<i>' + s + '</i>'
+
+def make_pb_ds_class_href(c_name):
+	return '<a href = "' + c_name + '.html">' + make_tt(c_name) + '</a>\n'
+
+def build_value_to_pb_ds_class_href(s_desc):
+	value = s_desc.attributes['value'].value
+	ret = make_pb_ds_class_href(value)
+	return ret
+
+class hash_desc_to_html_builder:
+	def build_specific_comb_hash_fn(self, s_desc):
+		comb_hash_fn_desc = s_desc.getElementsByTagName('Comb_Hash_Fn')[0]
+		ret = make_tt('Comb_Hash_Fn')
+		ret = ret + ' = '
+		ret = ret + build_value_to_pb_ds_class_href(comb_hash_fn_desc)
+		return ret
+
+	def __build_nom_denom(self, s_desc):
+		nom_denom = s_desc.attributes['nom'].value + '/' + s_desc.attributes['denom'].value
+		return make_i(nom_denom)
+
+	def __build_lc_trigger_desc(self, s_desc):
+		ret = build_value_to_pb_ds_class_href(s_desc)
+		ret = ret + ' with ' + make_i('&alpha;<sub>min</sub>')
+		ret = ret + ' = '  + self.__build_nom_denom(s_desc.getElementsByTagName('alpha_min')[0])
+		ret = ret + ' and ' + make_i('&alpha;<sub>max</sub>')
+		ret = ret + ' = '  + self.__build_nom_denom(s_desc.getElementsByTagName('alpha_max')[0])
+		return ret
+
+	def build_specific_resize_policy(self, s_desc):
+		ret = make_tt('Resize_Policy')
+		ret = ret + ' = '
+		resize_policy_desc = s_desc.getElementsByTagName('Resize_Policy')[0]
+		ret = ret + build_value_to_pb_ds_class_href(resize_policy_desc)
+		ret = ret + ' with ' + make_tt('Size_Policy')
+		ret = ret + ' = '
+		size_policy_desc = resize_policy_desc.getElementsByTagName('Size_Policy')[0]
+		ret = ret + build_value_to_pb_ds_class_href(size_policy_desc)
+		ret = ret + ', and ' + make_tt('Trigger_Policy')
+		ret = ret + ' = '
+		trigger_policy_desc = resize_policy_desc.getElementsByTagName('Trigger_Policy')[0]
+		if trigger_policy_desc.attributes['value'].value == 'hash_load_check_resize_trigger':
+			ret = ret + self.__build_lc_trigger_desc(trigger_policy_desc)
+		else:
+			raise exception
+		return ret
+
+
+class cc_hash_desc_to_html_builder:
+	def __init__(self):
+		self.__hash_builder = hash_desc_to_html_builder()			
+
+	def build(self, s_desc):
+		ret = build_value_to_pb_ds_class_href(s_desc)
+		ret = ret + 'with ' + self.__hash_builder.build_specific_comb_hash_fn(s_desc)
+		ret = ret + ', and ' + self.__hash_builder.build_specific_resize_policy(s_desc)
+		return ret
+
+
+class gp_hash_desc_to_html_builder:
+	def __init__(self):
+		self.__hash_builder = hash_desc_to_html_builder()			
+
+	def build(self, s_desc):
+		ret = build_value_to_pb_ds_class_href(s_desc)
+		ret = ret + ' with ' + self.__hash_builder.build_specific_comb_hash_fn(s_desc)
+		ret = ret + ', ' + self.__hash_builder.build_specific_resize_policy(s_desc)
+		ret = ret + ', and ' + make_tt('Probe_Fn')
+		ret = ret + ' = '		
+		probe_fn = s_desc.getElementsByTagName('Probe_Fn')[0].attributes['value'].value
+		ret = ret + make_pb_ds_class_href(probe_fn)
+		return ret
+
+
+class basic_tree_like_desc_to_html_builder:
+	def build_tag(self, s_desc):
+		ret = make_tt('Tag')
+		ret = ret + ' = '
+		tag_desc = s_desc.getElementsByTagName('Tag')[0]
+		ret = ret + build_value_to_pb_ds_class_href(tag_desc)
+		return ret
+
+	def build_node_update(self, s_desc):
+		ret = make_tt('Node_Update')
+		ret = ret + ' = '
+		node_update_desc = s_desc.getElementsByTagName('Node_Update')[0]
+		ret = ret + build_value_to_pb_ds_class_href(node_update_desc)
+		return ret
+
+
+class basic_tree_desc_to_html_builder:
+	def __init__(self):
+		self.__tree_like_builder = basic_tree_like_desc_to_html_builder()
+
+	def build(self, s_desc):
+		ret = build_value_to_pb_ds_class_href(s_desc)
+		ret = ret + ' with ' + self.__tree_like_builder.build_tag(s_desc)
+		ret = ret + ', and ' + self.__tree_like_builder.build_node_update(s_desc)
+		return ret
+
+
+class basic_trie_desc_to_html_builder:
+	def __init__(self):
+		self.__tree_like_builder = basic_tree_like_desc_to_html_builder()
+
+	def build(self, s_desc):
+		ret = build_value_to_pb_ds_class_href(s_desc)
+		ret = ret + ' with ' + self.__tree_like_builder.build_tag(s_desc)
+		ret = ret + ', and ' + self.__tree_like_builder.build_node_update(s_desc)
+		return ret
+
+class lu_desc_to_html_builder:
+	def build(self, s_desc):
+		ret = build_value_to_pb_ds_class_href(s_desc)
+		ret = ret + ' with ' + make_tt('Update_Policy') 
+		ret = ret + ' = ' 
+		update_policy_desc = s_desc.getElementsByTagName('Update_Policy')[0]
+		ret = ret + build_value_to_pb_ds_class_href(update_policy_desc)
+		return ret
+
+
+class std_desc_to_html_builder:
+	def build(self, s_desc):
+		value = s_desc.attributes['value'].value
+		return make_tt(value.replace('std_', 'std::'))
+
+
+class std_tr1_desc_to_html_builder:
+	def build(self, s_desc):
+		value = s_desc.attributes['value'].value
+		ret =  make_tt(value.replace('std_tr1_', 'std::tr1::'))
+		ret = ret + ' with ' + make_tt('cache_hash_code')
+		ret = ret + ' = '
+		cache_hash_code = s_desc.getElementsByTagName('cache_hash_code')[0].attributes['value'].value
+		ret = ret + make_ttb(cache_hash_code)
+		return ret
+
+class gnucxx_desc_to_html_builder:
+	def build(self, s_desc):
+		value = s_desc.attributes['value'].value
+		return make_tt(value.replace('__gnucxx_', '__gnucxx::'))
+
+class stdext_desc_to_html_builder:
+	def build(self, s_desc):
+		value = s_desc.attributes['value'].value
+		return make_tt(value.replace('stdext_', 'stdext::'))
+
+class npq_desc_to_html_builder:
+	def build(self, vector):
+		if vector:
+			under = make_tt('std::vector')
+		else:
+			under = make_tt('std::deque')
+
+		return make_tt('std::priority_queue') + ' adapting ' + under
+
+class binary_heap_desc_to_html_builder:
+	def build(self, s_desc):
+		ret = make_pb_ds_class_href('priority_queue')
+		ret = ret + ' with ' + make_tt('Tag')
+		ret = ret + ' = ' + make_pb_ds_class_href('binary_heap_tag')
+		return ret
+
+class thin_heap_desc_to_html_builder:
+	def build(self, s_desc):
+		ret = make_pb_ds_class_href('priority_queue')
+		ret = ret + ' with ' + make_tt('Tag')
+		ret = ret + ' = ' + make_pb_ds_class_href('thin_heap_tag')
+		return ret
+
+class binomial_heap_desc_to_html_builder:
+	def build(self, s_desc):
+		ret = make_pb_ds_class_href('priority_queue')
+		ret = ret + ' with ' + make_tt('Tag')
+		ret = ret + ' = ' + make_pb_ds_class_href('binomial_heap_tag')
+		return ret
+
+class rc_binomial_heap_desc_to_html_builder:
+	def build(self, s_desc):
+		ret = make_pb_ds_class_href('priority_queue')
+		ret = ret + ' with ' + make_tt('Tag')
+		ret = ret + ' = ' + make_pb_ds_class_href('rc_binomial_heap_tag')
+		return ret
+
+class pairing_heap_desc_to_html_builder:
+	def build(self, s_desc):
+		ret = make_pb_ds_class_href('priority_queue')
+		ret = ret + ' with ' + make_tt('Tag')
+		ret = ret + ' = ' + make_pb_ds_class_href('pairing_heap_tag')
+		return ret
+
+class legend_desc_builder:
+	"""
+	Returns a string corresponding to a specific container type.
+	"""
+	def __init__(self):
+		self.__cc_hash_builder = cc_hash_desc_to_html_builder()
+		self.__gp_hash_builder = gp_hash_desc_to_html_builder()	       
+		self.__basic_tree_builder = basic_tree_desc_to_html_builder()
+		self.__basic_trie_builder = basic_trie_desc_to_html_builder()
+		self.__lu_builder = lu_desc_to_html_builder()
+		self.__std_builder = std_desc_to_html_builder()
+		self.__std_tr1_builder = std_tr1_desc_to_html_builder()
+		self.__gnucxx_builder = gnucxx_desc_to_html_builder()
+		self.__stdext_builder = stdext_desc_to_html_builder()
+		self.__npq_builder = npq_desc_to_html_builder()
+		self.__thin_heap_builder = thin_heap_desc_to_html_builder()
+		self.__thin_heap_builder = thin_heap_desc_to_html_builder()
+		self.__binary_heap_builder = binary_heap_desc_to_html_builder()
+		self.__binomial_heap_builder = binomial_heap_desc_to_html_builder()
+		self.__rc_binomial_heap_builder = rc_binomial_heap_desc_to_html_builder()
+		self.__pairing_heap_builder = pairing_heap_desc_to_html_builder()
+
+	def __build_specific(self, s_desc):
+		type = s_desc.attributes['value'].value
+
+		if type == 'thin_heap':
+			return self.__thin_heap_builder.build(s_desc)
+		if type == 'binary_heap':
+			return self.__binary_heap_builder.build(s_desc)
+		if type == 'binomial_heap':
+			return self.__binomial_heap_builder.build(s_desc)
+		if type == 'rc_binomial_heap':
+			return self.__rc_binomial_heap_builder.build(s_desc)
+		if type == 'pairing_heap':
+			return self.__pairing_heap_builder.build(s_desc)
+		if type == 'cc_hash_table':
+			ret = self.__cc_hash_builder.build(s_desc)
+		elif type == 'gp_hash_table':
+			ret = self.__gp_hash_builder.build(s_desc)
+		elif type == 'tree':
+			ret = self.__basic_tree_builder.build(s_desc)
+		elif type == 'trie':
+			ret = self.__basic_trie_builder.build(s_desc)
+		elif type == 'list_update':
+			ret = self.__lu_builder.build(s_desc)
+		elif type == 'std::priority_queue_vector':
+			return self.__npq_builder.build(True)
+		elif type == 'std::priority_queue_deque':
+			return self.__npq_builder.build(False)
+		elif type == 'std_set' or type == 'std_map' or type == 'std_multimap':
+			return self.__std_builder.build(s_desc)
+		elif type == 'std_tr1_unordered_set' or type == 'std_tr1_unordered_map':
+			return self.__std_tr1_builder.build(s_desc)
+		elif type == 'stdext_hash_set' or type == 'stdext_hash_map' or type == 'stdext_hash_multimap':
+			return self.__stdext_builder.build(s_desc)
+		elif type == '__gnucxx_hash_set' or type == '__gnucxx_hash_map' or type == '__gnucxx_hash_multimap':
+			return self.__gnucxx_builder.build(s_desc)
+		else:
+			sys.stderr.write('cannot recognize %s\n' % type)
+			raise exception
+		return ret
+
+
+	def build(self, desc):
+		s_descs = desc.getElementsByTagName('type')
+		if s_descs.length == 0:
+			print desc.toxml()
+			raise exception
+		ret = ''
+		count = 0
+		for s_desc in s_descs:
+			if count > 0:
+				ret = ret + ', mapping each key to '
+			ret = ret + self.__build_specific(s_desc)
+			count = count + 1
+		return ret
+
+
+def main(doc_dir, res_dir, test_infos_f_name, test_name, build_name):
+	res_gtr = res_getter(test_infos_f_name)
+	res = res_gtr.get(res_dir, test_name)
+	png_mkr = png_maker()
+	png_of_name = doc_dir + '/' + test_name + '_' + build_name + '.png'
+	print png_of_name
+	png_mkr.make(res, png_of_name)
+
+
+if __name__ == "__main__":
+	"""
+	This module takes 6 parameters from the command line:
+	Docs directory
+	Results directory
+	Tests info XML file name
+	Test name
+	Build name
+	Compiler name
+	"""
+	usg = "make_graph.py <doc_dir> <res_dir> <test_info_file> <test_name> <build_name>\n"
+	if len(sys.argv) != 6:
+		sys.stderr.write(usg)
+		raise exception
+	main(sys.argv[1], sys.argv[2], sys.argv[3], sys.argv[4], sys.argv[5])
diff --git a/libstdc++-v3/scripts/make_graphs.py b/libstdc++-v3/scripts/make_graphs.py
new file mode 100755
index 00000000000..0b5daf24360
--- /dev/null
+++ b/libstdc++-v3/scripts/make_graphs.py
@@ -0,0 +1,160 @@
+#!/usr/bin/python
+
+import sys
+import commands
+import re
+from xml.dom import minidom
+from BeautifulSoup import BeautifulSoup
+import make_graph
+
+class exception:
+	pass
+ 
+res_div_re = re.compile('(.*?)_res_div')
+settings_div_re = re.compile('(.*?)_settings_div')	
+
+
+gray_border_div_str = '<div style = "border-style: dotted; border-width: 1px; border-color: lightgray">'
+space_div_str = '<div style = "width: 100%; height: 20px">'
+
+
+
+def logical_build_from_build(build):
+	if build == 'gcc':
+		return 'g++'
+	if build == 'msvc':
+		return 'msvc++'
+	if build == 'local':
+		return 'local'
+	sys.stderr.write(build)
+	raise exception
+ 
+ 
+def img_title_from_origs(label, title, base_build_ref, build_name, logical_build_name):
+	title = title.replace('_tt_', '<tt>')
+	title = title.replace('_455tt_', '</tt>')
+	title = title.replace('_b_', '<b>')
+	title = title.replace('_455b_', '</b>')
+	title = title.replace('_456', ',')
+	title = title.replace('_457', '[]')
+	title = title.replace('_', ' ')
+	return '%s: %s - <a href = "%s_performance_tests.html#%s">%s</a>' % (
+		label, 
+		title, 
+		base_build_ref, 
+		build_name,
+		logical_build_name)
+
+
+def make_png(src_dir, doc_dir, res_dir, tests_info_xml_f_name, build_name, test_name):
+	cmd_str = '%s/scripts/make_graph.py %s %s %s %s %s' % (
+		src_dir, doc_dir,
+		res_dir, 
+		tests_info_xml_f_name, 
+		test_name, 
+		build_name)
+	# Must start a new process for pychart - otherwise pngs overlap.
+	so = commands.getstatusoutput(cmd_str)	
+	if(so[0] != 0):
+		sys.stderr.write(cmd_str + '\n')		
+		sys.stderr.write(so[1] + '\n')		
+		sys.exit(-1)	
+
+
+def make_png_str(label, test_name, build):
+	ret = '<h6 class="c1">'
+	ret += '<a name="%s" id= "%s">' % (label, label)
+	ret += '<img src="%s" ' % (test_name + '_' + build + '.png')
+	ret += 'alt="no image" />' 
+	ret += '</a></h6>'	
+	return ret
+
+def process_html(html_f_name, src_dir, build_dir, htmls_xml_f_name, tests_info_xml_f_name, build_name, compiler_name):
+	doc_dir = src_dir + "/docs/html/ext/pb_ds"
+	res_dir = build_dir 
+	html_f = open(doc_dir + '/' + html_f_name)	
+	soup = BeautifulSoup(html_f.read())			
+	html_f.close()	
+	platform_comp_re = re.compile('platform_comp_%s' % build_name)					
+	for d in soup('div'):
+		try:
+			settings_m = settings_div_re.match(d['id']) 
+			res_m = res_div_re.match(d['id']) 
+		except:
+			settings_m = None
+			res_m = None
+			
+		if settings_m:
+			build = settings_m.groups()[0]			
+			if build == build_name:
+				logical_build_name = logical_build_from_build(build)
+				info = gray_border_div_str
+				info += '<h3><a name = "%s"><u>%s</u></a></h3>' % (build, logical_build_name)
+				info += make_graph.comp_platform_info(compiler_name)
+				info += '</div>%s</div>' % space_div_str
+				d.contents = info
+		elif res_m:
+			label = res_m.groups()[0]
+			d = d.divTag
+			
+			build = d['id'].replace('%s_' % label, '')
+			
+			if build == build_name:
+				logical_build_name = logical_build_from_build(build)
+				d = d.divTag
+				test_name = d['id'].replace('%s_' % label, '')
+				d = d.divTag
+				base_build_ref = d['id'].replace('%s_' % label, '')
+				d = d.divTag
+				title = d['id'].replace('%s_' % label, '')
+				img_title = img_title_from_origs(label, title, base_build_ref, build, logical_build_name)
+					
+				make_png(src_dir, doc_dir, res_dir, tests_info_xml_f_name, build_name, test_name)
+				png_str = make_png_str(label, test_name, build)
+				content = gray_border_div_str
+				content += png_str
+				content += img_title
+#				content += make_graph.legend(doc_dir, res_dir, tests_info_xml_f_name, test_name, build_name)
+				content += '</div>%s</div>' % space_div_str
+				d.contents = content
+								
+	return soup
+			
+ 
+  
+if __name__ == "__main__":
+	"""
+	Doc dir
+	This module takes 6 parameters from the command line:
+	Source directory
+	Build directory
+	HTMLs XML file name
+	Tests info XML file name
+	Build name
+	Compiler name
+	"""
+	
+	usg = "make_graph.py <src_dir> <build_dir> <htmls_xml_f_name> <tests_info_xml_f_name> <build_name> <compiler_name>\n"
+		
+	if len(sys.argv) != 7:
+		sys.stderr.write(usg)
+		raise exception
+	
+	src_dir = sys.argv[1]
+	build_dir = sys.argv[2]
+	htmls_xml_f_name = sys.argv[3]
+	tests_info_xml_f_name = sys.argv[4]
+	build_name = sys.argv[5]
+	compiler_name = sys.argv[6]
+	doc_dir = src_dir + "/docs/html/ext/pb_ds"
+	htmls_dat = minidom.parse(htmls_xml_f_name)
+	for html in htmls_dat.getElementsByTagName('html'):
+		html_f_name = html.attributes['name'].value
+		
+		new_soup = process_html(html_f_name, src_dir, build_dir, htmls_xml_f_name, tests_info_xml_f_name, build_name, compiler_name)
+		
+		html_f = open(doc_dir + '/' + html_f_name, 'w')
+		html_f.write(str(new_soup))
+		html_f.close()
+		
+		
diff --git a/libstdc++-v3/scripts/testsuite_flags.in b/libstdc++-v3/scripts/testsuite_flags.in
index aa4466a5326..83e10f7d6cc 100755
--- a/libstdc++-v3/scripts/testsuite_flags.in
+++ b/libstdc++-v3/scripts/testsuite_flags.in
@@ -30,7 +30,7 @@ query=$1
 
 case ${query} in
     --install-includes)
-      INCLUDES="-I${SRC_DIR}/testsuite"
+      INCLUDES="-I${SRC_DIR}/testsuite/util"
       echo ${INCLUDES}
       ;;
     --build-includes)
diff --git a/libstdc++-v3/testsuite/Makefile.am b/libstdc++-v3/testsuite/Makefile.am
index 0fc66e5ab9f..a881b9f1a2a 100644
--- a/libstdc++-v3/testsuite/Makefile.am
+++ b/libstdc++-v3/testsuite/Makefile.am
@@ -91,7 +91,7 @@ new-abi-baseline:
 
 # Use 'new-abi-baseline' to create an initial symbol file.  Then run
 # 'check-abi' to test for changes against that file.
-check-abi: baseline_symbols site.exp
+check-abi: site.exp baseline_symbols 
 	-@runtest --tool libstdc++ abi.exp
 
 # Runs the testsuite, but in compile only mode.
@@ -108,10 +108,20 @@ check-compile: testsuite_files ${compile_script}
 # Some of these tests create large (~75MB) files, allocate huge
 # ammounts of memory, or otherwise tie up machine resources. Thus,
 # running this is off by default.
-performance_script=${glibcxx_srcdir}/scripts/check_performance
+# XXX Need to add dependency on libtestc++.a
+check_performance_script=${glibcxx_srcdir}/scripts/check_performance
 check-performance: testsuite_files_performance ${performance_script}
-	-@(chmod + ${performance_script}; \
-	  ${performance_script} ${glibcxx_srcdir} ${glibcxx_builddir})
+	-@(chmod + ${check_performance_script}; \
+	  ${check_performance_script} ${glibcxx_srcdir} ${glibcxx_builddir})
+
+# Generates the plots and graphs for performance testing.
+doc_performance_script=${glibcxx_srcdir}/scripts/make_graphs.py
+doc-performance:
+	-@(chmod + ${doc_performance_script}; \
+	${doc_performance_script} ${glibcxx_srcdir} \
+	${glibcxx_builddir}/testsuite \
+	${glibcxx_srcdir}/testsuite/data/make_graph_htmls.xml \
+	${glibcxx_srcdir}/testsuite/data/make_graph_test_infos.xml local g++)
 
 
 .PHONY: baseline_symbols new-abi-baseline \
@@ -120,4 +130,4 @@ check-performance: testsuite_files_performance ${performance_script}
 # By adding these files here, automake will remove them for 'make clean'
 CLEANFILES = *.txt *.tst *.exe core* filebuf_* tmp* ostream_* *.log *.sum \
 	     testsuite_* site.exp abi_check baseline_symbols *TEST* *.dat \
-	     *.o *.cc
+	     *.o *.cc *.a *.so *.xml
diff --git a/libstdc++-v3/testsuite/Makefile.in b/libstdc++-v3/testsuite/Makefile.in
index 92c8a027639..5b5994febbc 100644
--- a/libstdc++-v3/testsuite/Makefile.in
+++ b/libstdc++-v3/testsuite/Makefile.in
@@ -272,12 +272,16 @@ compile_script = ${glibcxx_srcdir}/scripts/check_compile
 # Some of these tests create large (~75MB) files, allocate huge
 # ammounts of memory, or otherwise tie up machine resources. Thus,
 # running this is off by default.
-performance_script = ${glibcxx_srcdir}/scripts/check_performance
+# XXX Need to add dependency on libtestc++.a
+check_performance_script = ${glibcxx_srcdir}/scripts/check_performance
+
+# Generates the plots and graphs for performance testing.
+doc_performance_script = ${glibcxx_srcdir}/scripts/make_graphs.py
 
 # By adding these files here, automake will remove them for 'make clean'
 CLEANFILES = *.txt *.tst *.exe core* filebuf_* tmp* ostream_* *.log *.sum \
 	     testsuite_* site.exp abi_check baseline_symbols *TEST* *.dat \
-	     *.o *.cc
+	     *.o *.cc *.a *.so *.xml
 
 all: all-am
 
@@ -513,14 +517,20 @@ new-abi-baseline:
 
 # Use 'new-abi-baseline' to create an initial symbol file.  Then run
 # 'check-abi' to test for changes against that file.
-check-abi: baseline_symbols site.exp
+check-abi: site.exp baseline_symbols 
 	-@runtest --tool libstdc++ abi.exp
 check-compile: testsuite_files ${compile_script}
 	-@(chmod + ${compile_script}; \
 	  ${compile_script} ${glibcxx_srcdir} ${glibcxx_builddir})
 check-performance: testsuite_files_performance ${performance_script}
-	-@(chmod + ${performance_script}; \
-	  ${performance_script} ${glibcxx_srcdir} ${glibcxx_builddir})
+	-@(chmod + ${check_performance_script}; \
+	  ${check_performance_script} ${glibcxx_srcdir} ${glibcxx_builddir})
+doc-performance:
+	-@(chmod + ${doc_performance_script}; \
+	${doc_performance_script} ${glibcxx_srcdir} \
+	${glibcxx_builddir}/testsuite \
+	${glibcxx_srcdir}/testsuite/data/make_graph_htmls.xml \
+	${glibcxx_srcdir}/testsuite/data/make_graph_test_infos.xml local g++)
 
 .PHONY: baseline_symbols new-abi-baseline \
 	check-abi check-compile check-performance
diff --git a/libstdc++-v3/testsuite/data/make_graph_htmls.xml b/libstdc++-v3/testsuite/data/make_graph_htmls.xml
new file mode 100644
index 00000000000..1eb87cf2df7
--- /dev/null
+++ b/libstdc++-v3/testsuite/data/make_graph_htmls.xml
@@ -0,0 +1,60 @@
+<?xml version = "1.0"?>
+<htmls>
+	<html name = "tree_random_int_find_find_timing_test.html">
+	</html>
+	<html name = "assoc_performance_tests.html">
+	</html>
+	<html name = "pq_performance_tests.html">
+	</html>
+	<html name = "hash_text_find_find_timing_test.html">
+	</html>
+	<html name = "hash_random_int_find_find_timing_test.html">
+	</html>
+	<html name = "hash_random_int_subscript_find_timing_test.html">
+	</html>
+	<html name = "hash_random_int_subscript_insert_timing_test.html">
+	</html>
+	<html name = "hash_zlob_random_int_find_find_timing_test.html">
+	</html>
+	<html name = "hash_random_int_erase_mem_usage_test.html">
+	</html>
+	<html name = "tree_text_insert_timing_test.html">
+	</html>
+	<html name = "tree_text_find_find_timing_test.html">
+	</html>
+	<html name = "tree_text_lor_find_find_timing_test.html">
+	</html>
+	<html name = "tree_split_join_timing_test.html">
+	</html>
+	<html name = "tree_order_statistics_timing_test.html">
+	</html>
+	<html name = "priority_queue_text_push_timing_test.html">
+	</html>
+	<html name = "priority_queue_text_push_pop_timing_test.html">
+	</html>
+	<html name = "priority_queue_random_int_push_timing_test.html">
+	</html>
+	<html name = "priority_queue_random_int_push_pop_timing_test.html">
+	</html>
+	<html name = "priority_queue_text_pop_mem_usage_test.html">
+	</html>
+	<html name = "priority_queue_text_join_timing_test.html">
+	</html>
+	<html name = "priority_queue_text_modify_up_timing_test.html">
+	</html>
+	<html name = "priority_queue_text_modify_down_timing_test.html">
+	</html>
+	<html name = "multimap_text_insert_mem_usage_test_small.html">
+	</html>
+	<html name = "multimap_text_insert_timing_test_small.html">
+	</html>
+	<html name = "multimap_text_find_timing_test_small.html">
+	</html>
+	<html name = "multimap_text_insert_mem_usage_test_large.html">
+	</html>
+	<html name = "multimap_text_insert_timing_test_large.html">
+	</html>
+	<html name = "multimap_text_find_timing_test_large.html">
+	</html>
+</htmls>
+		
diff --git a/libstdc++-v3/testsuite/data/make_graph_test_infos.xml b/libstdc++-v3/testsuite/data/make_graph_test_infos.xml
new file mode 100644
index 00000000000..cffc3a03937
--- /dev/null
+++ b/libstdc++-v3/testsuite/data/make_graph_test_infos.xml
@@ -0,0 +1,313 @@
+<?xml version = "1.0"?>
+<tests>
+	<test name = "random_int_find_find_timing_test_tree">
+		<file name = "random_int_find_timing.xml"></file>
+		<cntnr name = "n_map"></cntnr>
+		<cntnr name = "splay_tree_map"></cntnr>
+		<cntnr name = "ov_tree_map"></cntnr>
+		<cntnr name = "rb_tree_map"></cntnr>
+	</test>   
+	<test name = "tree_split_join_timing_test">
+		<file name = "tree_split_join_timing.xml"></file>
+		<cntnr name = "n_set"></cntnr>
+		<cntnr name = "splay_tree_set"></cntnr>
+		<cntnr name = "ov_tree_set"></cntnr>
+		<cntnr name = "rb_tree_set"></cntnr>
+	</test>
+	<test name = "tree_order_statistics_timing_test">
+		<file name = "tree_order_statistics_timing.xml"></file>
+		<cntnr name = "n_set"></cntnr>
+		<cntnr name = "splay_tree_ost_set"></cntnr>
+		<cntnr name = "rb_tree_ost_set"></cntnr>
+	</test>
+	<test name = "hash_random_int_erase_mem_usage_test">
+		<file name = "hash_random_int_erase_mem_usage.xml"></file>
+		<cntnr name = "n_hash_set_ncah"></cntnr>
+		<cntnr name = "cc_hash_mod_prime_nea_lc_1div8_1div1_nsth_set"></cntnr>
+		<cntnr name = "cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_set"></cntnr>
+		<cntnr name = "gp_hash_mask_linp_exp_nea_lc_1div8_1div2_nsth_set"></cntnr>
+	</test>
+	<test name = "cc_hash_random_int_subscript_timing_test_insert">
+		<file name = "random_int_subscript_insert_timing.xml"></file>
+		<cntnr name = "cc_hash_mod_prime_nea_lc_1div8_1div1_nsth_map"></cntnr>
+		<cntnr name = "cc_hash_mod_prime_nea_lc_1div8_1div2_nsth_map"></cntnr>
+		<cntnr name = "n_hash_map_ncah"></cntnr>
+		<cntnr name = "cc_hash_mask_exp_nea_lc_1div8_1div1_nsth_map"></cntnr>
+		<cntnr name = "cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_map"></cntnr>
+	</test>
+	<test name = "cc_hash_random_int_subscript_timing_test_find">
+		<file name = "random_int_subscript_find_timing.xml"></file>
+		<cntnr name = "cc_hash_mod_prime_nea_lc_1div8_1div1_nsth_map"></cntnr>
+		<cntnr name = "cc_hash_mod_prime_nea_lc_1div8_1div2_nsth_map"></cntnr>
+		<cntnr name = "n_hash_map_ncah"></cntnr>
+		<cntnr name = "cc_hash_mask_exp_nea_lc_1div8_1div1_nsth_map"></cntnr>
+		<cntnr name = "cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_map"></cntnr>
+	</test>
+	<test name = "gp_hash_random_int_subscript_timing_test_insert">
+		<file name = "random_int_subscript_insert_timing.xml"></file>
+		<cntnr name = "gp_hash_mod_quadp_prime_nea_lc_1div8_1div2_nsth_map"></cntnr>
+		<cntnr name = "n_hash_map_ncah"></cntnr>
+		<cntnr name = "gp_hash_mask_linp_exp_nea_lc_1div8_1div2_nsth_map"></cntnr>
+	</test>
+	<test name = "gp_hash_random_int_subscript_timing_test_find">
+		<file name = "random_int_subscript_find_timing.xml"></file>
+		<cntnr name = "gp_hash_mod_quadp_prime_nea_lc_1div8_1div2_nsth_map"></cntnr>
+		<cntnr name = "n_hash_map_ncah"></cntnr>
+		<cntnr name = "gp_hash_mask_linp_exp_nea_lc_1div8_1div2_nsth_map"></cntnr>
+	</test>
+	<test name = "ccgp_hash_random_int_subscript_timing_test_insert">
+		<file name = "random_int_subscript_insert_timing.xml"></file>
+		<cntnr name = "cc_hash_mod_prime_nea_lc_1div8_1div2_nsth_map"></cntnr>
+		<cntnr name = "cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_map"></cntnr>
+		<cntnr name = "gp_hash_mod_quadp_prime_nea_lc_1div8_1div2_nsth_map"></cntnr>
+		<cntnr name = "gp_hash_mask_linp_exp_nea_lc_1div8_1div2_nsth_map"></cntnr>
+	</test>
+	<test name = "cc_hash_random_int_find_timing_test">
+		<file name = "random_int_find_timing.xml"></file>
+		<cntnr name = "cc_hash_mod_prime_nea_lc_1div8_1div1_nsth_map"></cntnr>
+		<cntnr name = "cc_hash_mod_prime_nea_lc_1div8_1div2_nsth_map"></cntnr>
+		<cntnr name = "n_hash_map_ncah"></cntnr>
+		<cntnr name = "cc_hash_mask_exp_nea_lc_1div8_1div1_nsth_map"></cntnr>
+		<cntnr name = "cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_map"></cntnr>
+	</test>
+	<test name = "gp_hash_random_int_find_timing_test">
+		<file name = "random_int_find_timing.xml"></file>
+		<cntnr name = "gp_hash_mod_quadp_prime_nea_lc_1div8_1div2_nsth_map"></cntnr>
+		<cntnr name = "n_hash_map_ncah"></cntnr>
+		<cntnr name = "gp_hash_mask_linp_exp_nea_lc_1div8_1div2_nsth_map"></cntnr>
+	</test>
+	<test name = "hash_zlob_random_int_find_timing_test">
+		<file name = "hash_zlob_random_int_find_timing.xml"></file>
+		<cntnr name = "n_hash_map_ncah"></cntnr>
+		<cntnr name = "gp_hash_mod_quadp_prime_nea_lc_1div8_1div2_nsth_map"></cntnr>
+		<cntnr name = "cc_hash_mask_exp_nea_lc_1div8_1div1_nsth_map"></cntnr>
+		<cntnr name = "cc_hash_mod_prime_nea_lc_1div8_1div1_nsth_map"></cntnr>
+	</test>
+	<test name = "text_find_timing_test_hash">
+		<file name = "text_find_timing.xml"></file>
+		<cntnr name = "n_hash_map_ncah"></cntnr>
+		<cntnr name = "cc_hash_mask_exp_nea_lc_1div8_1div1_nsth_map"></cntnr>
+		<cntnr name = "cc_hash_mod_prime_nea_lc_1div8_1div1_nsth_map"></cntnr>
+		<cntnr name = "cc_hash_mask_exp_nea_lc_1div8_1div2_sth_map"></cntnr>
+		<cntnr name = "cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_map"></cntnr>
+	</test>
+	<test name = "text_find_timing_test_tree_like">
+		<file name = "text_find_timing.xml"></file>
+		<cntnr name = "n_map"></cntnr>
+		<cntnr name = "rb_tree_map"></cntnr>
+		<cntnr name = "splay_tree_map"></cntnr>
+		<cntnr name = "ov_tree_map"></cntnr>
+		<cntnr name = "pat_trie_map"></cntnr>
+	</test>
+	<test name = "tree_text_insert_timing_test_node_tree">
+		<file name = "tree_text_insert_timing.xml"></file>
+		<cntnr name = "n_map"></cntnr>
+		<cntnr name = "rb_tree_map"></cntnr>
+		<cntnr name = "splay_tree_map"></cntnr>
+	</test>
+	<test name = "tree_text_insert_timing_test_vector_tree">
+		<file name = "tree_text_insert_timing.xml"></file>
+		<cntnr name = "n_map"></cntnr>
+		<cntnr name = "ov_tree_map"></cntnr>
+	</test>
+	<test name = "tree_text_insert_timing_test_pat_trie">
+		<file name = "tree_text_insert_timing.xml"></file>
+		<cntnr name = "n_map"></cntnr>
+		<cntnr name = "pat_trie_map"></cntnr>
+	</test>
+	<test name = "tree_text_lor_find_timing_test">
+		<file name = "tree_text_lor_find_timing.xml"></file>
+		<cntnr name = "n_map"></cntnr>
+		<cntnr name = "rb_tree_map"></cntnr>
+		<cntnr name = "splay_tree_map"></cntnr>
+		<cntnr name = "ov_tree_map"></cntnr>
+	</test>
+	<test name = "priority_queue_random_int_push_timing_test">
+		<file name = "priority_queue_random_int_push_timing.xml"></file>
+		<cntnr name = "thin_heap"></cntnr>
+		<cntnr name = "pairing_heap"></cntnr>
+		<cntnr name = "binomial_heap"></cntnr>
+		<cntnr name = "rc_binomial_heap"></cntnr>
+		<cntnr name = "binary_heap"></cntnr>
+		<cntnr name = "n_pq_vector"></cntnr>
+		<cntnr name = "n_pq_deque"></cntnr>
+	</test>
+	<test name = "binary_priority_queue_random_int_push_timing_test">
+		<file name = "priority_queue_random_int_push_timing.xml"></file>
+		<cntnr name = "binary_heap"></cntnr>
+		<cntnr name = "n_pq_vector"></cntnr>
+		<cntnr name = "n_pq_deque"></cntnr>
+	</test>
+	<test name = "priority_queue_random_int_push_pop_timing_test">
+		<file name = "priority_queue_random_int_push_pop_timing.xml"></file>
+		<cntnr name = "thin_heap"></cntnr>
+		<cntnr name = "pairing_heap"></cntnr>
+		<cntnr name = "binomial_heap"></cntnr>
+		<cntnr name = "rc_binomial_heap"></cntnr>
+		<cntnr name = "binary_heap"></cntnr>
+		<cntnr name = "n_pq_vector"></cntnr>
+		<cntnr name = "n_pq_deque"></cntnr>
+	</test>
+	<test name = "binary_priority_queue_random_int_push_pop_timing_test">
+		<file name = "priority_queue_random_int_push_pop_timing.xml"></file>
+		
+		<cntnr name = "binary_heap"></cntnr>
+		<cntnr name = "n_pq_vector"></cntnr>
+		<cntnr name = "n_pq_deque"></cntnr>
+	</test>
+	<test name = "priority_queue_text_push_timing_test">
+		<file name = "priority_queue_text_push_timing.xml"></file>
+		<cntnr name = "thin_heap"></cntnr>
+		<cntnr name = "pairing_heap"></cntnr>
+		<cntnr name = "binomial_heap"></cntnr>
+		<cntnr name = "rc_binomial_heap"></cntnr>
+		<cntnr name = "binary_heap"></cntnr>
+		<cntnr name = "n_pq_vector"></cntnr>
+		<cntnr name = "n_pq_deque"></cntnr>
+	</test>
+	<test name = "pairing_priority_queue_text_push_timing_test">
+		<file name = "priority_queue_text_push_timing.xml"></file>
+		<cntnr name = "thin_heap"></cntnr>
+		<cntnr name = "pairing_heap"></cntnr>
+		<cntnr name = "n_pq_vector"></cntnr>
+		<cntnr name = "n_pq_deque"></cntnr>
+	</test>
+	<test name = "priority_queue_text_push_pop_timing_test">
+		<file name = "priority_queue_text_push_pop_timing.xml"></file>
+		<cntnr name = "thin_heap"></cntnr>
+		<cntnr name = "pairing_heap"></cntnr>
+		<cntnr name = "binomial_heap"></cntnr>
+		<cntnr name = "rc_binomial_heap"></cntnr>
+		<cntnr name = "binary_heap"></cntnr>
+		<cntnr name = "n_pq_vector"></cntnr>
+		<cntnr name = "n_pq_deque"></cntnr>
+	</test>
+	<test name = "pairing_priority_queue_text_push_pop_timing_test">
+		<file name = "priority_queue_text_push_pop_timing.xml"></file>
+		<cntnr name = "pairing_heap"></cntnr>
+		<cntnr name = "n_pq_vector"></cntnr>
+		<cntnr name = "n_pq_deque"></cntnr>
+	</test>
+	<test name = "priority_queue_text_modify_up_timing_test">
+		<file name = "priority_queue_text_modify_up_timing.xml"></file>
+		<cntnr name = "thin_heap"></cntnr>
+		<cntnr name = "pairing_heap"></cntnr>
+		<cntnr name = "binomial_heap"></cntnr>
+		<cntnr name = "rc_binomial_heap"></cntnr>
+		<cntnr name = "binary_heap"></cntnr>
+		<cntnr name = "n_pq_vector"></cntnr>
+		<cntnr name = "n_pq_deque"></cntnr>
+	</test>
+	<test name = "priority_queue_text_modify_down_timing_test">
+		<file name = "priority_queue_text_modify_down_timing.xml"></file>
+		<cntnr name = "thin_heap"></cntnr>
+		<cntnr name = "pairing_heap"></cntnr>
+		<cntnr name = "binomial_heap"></cntnr>
+		<cntnr name = "rc_binomial_heap"></cntnr>
+		<cntnr name = "binary_heap"></cntnr>
+		<cntnr name = "n_pq_vector"></cntnr>
+		<cntnr name = "n_pq_deque"></cntnr>
+	</test>
+	<test name = "priority_queue_text_modify_up_timing_test_pairing_thin">
+		<file name = "priority_queue_text_modify_up_timing.xml"></file>
+		<cntnr name = "thin_heap"></cntnr>
+		<cntnr name = "pairing_heap"></cntnr>
+	</test>
+	<test name = "priority_queue_text_modify_down_timing_test_pairing_thin">
+		<file name = "priority_queue_text_modify_down_timing.xml"></file>
+		<cntnr name = "thin_heap"></cntnr>
+		<cntnr name = "pairing_heap"></cntnr>
+	</test>
+	<test name = "priority_queue_text_join_timing_test">
+		<file name = "priority_queue_text_join_timing.xml"></file>
+		<cntnr name = "thin_heap"></cntnr>
+		<cntnr name = "pairing_heap"></cntnr>
+		<cntnr name = "binomial_heap"></cntnr>
+		<cntnr name = "rc_binomial_heap"></cntnr>
+		<cntnr name = "binary_heap"></cntnr>
+		<cntnr name = "n_pq_vector"></cntnr>
+		<cntnr name = "n_pq_deque"></cntnr>
+	</test>
+	<test name = "priority_queue_text_pop_mem_usage_test">
+		<file name = "priority_queue_text_pop_mem_usage.xml"></file>
+		<cntnr name = "thin_heap"></cntnr>
+		<cntnr name = "pairing_heap"></cntnr>
+		<cntnr name = "binomial_heap"></cntnr>
+		<cntnr name = "rc_binomial_heap"></cntnr>
+		<cntnr name = "binary_heap"></cntnr>
+		<cntnr name = "n_pq_vector"></cntnr>
+		<cntnr name = "n_pq_deque"></cntnr>
+	</test>
+	<test name = "multimap_text_insert_mem_usage_test_small_s2p_hash">
+		<file name = "multimap_text_insert_mem_usage_small.xml"></file>
+		<cntnr name = "cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_mmap_lu_mtf_set"></cntnr>
+		<cntnr name = "cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_mmap_cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_set"></cntnr>
+		<cntnr name = "n_hash_mmap"></cntnr>
+	</test>
+	<test name = "multimap_text_insert_timing_test_small_s2p_hash">
+		<file name = "multimap_text_insert_timing_small.xml"></file>
+		<cntnr name = "cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_mmap_lu_mtf_set"></cntnr>
+		<cntnr name = "cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_mmap_cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_set"></cntnr>
+		<cntnr name = "n_hash_mmap"></cntnr>
+	</test>
+	<test name = "multimap_text_find_timing_test_small_s2p_hash">
+		<file name = "multimap_text_find_timing_small.xml"></file>
+		<cntnr name = "cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_mmap_lu_mtf_set"></cntnr>
+		<cntnr name = "cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_mmap_cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_set"></cntnr>
+		<cntnr name = "n_hash_mmap"></cntnr>
+	</test>
+	<test name = "multimap_text_insert_mem_usage_test_large_s2p_tree">
+		<file name = "multimap_text_insert_mem_usage_large.xml"></file>
+		<cntnr name = "rb_tree_mmap_lu_mtf_set"></cntnr>
+		<cntnr name = "rb_tree_mmap_cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_set"></cntnr>		
+		<cntnr name = "n_mmap"></cntnr>
+	</test>
+	<test name = "multimap_text_insert_timing_test_large_s2p_tree">
+		<file name = "multimap_text_insert_timing_large.xml"></file>
+		<cntnr name = "rb_tree_mmap_lu_mtf_set"></cntnr>
+		<cntnr name = "rb_tree_mmap_cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_set"></cntnr>		
+		<cntnr name = "n_mmap"></cntnr>
+	</test>
+	<test name = "multimap_text_find_timing_test_large_s2p_tree">
+		<file name = "multimap_text_find_timing_large.xml"></file>
+		<cntnr name = "rb_tree_mmap_lu_mtf_set"></cntnr>
+		<cntnr name = "rb_tree_mmap_cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_set"></cntnr>		
+		<cntnr name = "n_mmap"></cntnr>
+	</test>
+	<test name = "multimap_text_insert_mem_usage_test_large_s2p_hash">
+		<file name = "multimap_text_insert_mem_usage_large.xml"></file>
+		<cntnr name = "cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_mmap_lu_mtf_set"></cntnr>
+		<cntnr name = "cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_mmap_cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_set"></cntnr>
+		<cntnr name = "n_hash_mmap"></cntnr>
+	</test>
+	<test name = "multimap_text_insert_timing_test_large_s2p_hash">
+		<file name = "multimap_text_insert_timing_large.xml"></file>
+		<cntnr name = "cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_mmap_lu_mtf_set"></cntnr>
+		<cntnr name = "cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_mmap_cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_set"></cntnr>
+		<cntnr name = "n_hash_mmap"></cntnr>
+	</test>
+	<test name = "multimap_text_find_timing_test_large_s2p_hash">
+		<file name = "multimap_text_find_timing_large.xml"></file>
+		<cntnr name = "cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_mmap_lu_mtf_set"></cntnr>
+		<cntnr name = "cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_mmap_cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_set"></cntnr>
+		<cntnr name = "n_hash_mmap"></cntnr>
+	</test>	
+	<test name = "multimap_text_insert_mem_usage_test_small_s2p_tree">
+		<file name = "multimap_text_insert_mem_usage_small.xml"></file>
+		<cntnr name = "rb_tree_mmap_lu_mtf_set"></cntnr>
+		<cntnr name = "rb_tree_mmap_cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_set"></cntnr>	
+		<cntnr name = "n_mmap"></cntnr>
+	</test>
+	<test name = "multimap_text_insert_timing_test_small_s2p_tree">
+		<file name = "multimap_text_insert_timing_small.xml"></file>
+		<cntnr name = "rb_tree_mmap_lu_mtf_set"></cntnr>
+		<cntnr name = "rb_tree_mmap_cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_set"></cntnr>
+		<cntnr name = "n_mmap"></cntnr>
+	</test>
+	<test name = "multimap_text_find_timing_test_small_s2p_tree">
+		<file name = "multimap_text_find_timing_small.xml"></file>
+		<cntnr name = "rb_tree_mmap_lu_mtf_set"></cntnr>
+		<cntnr name = "rb_tree_mmap_cc_hash_mask_exp_nea_lc_1div8_1div2_nsth_set"></cntnr>
+		<cntnr name = "n_mmap"></cntnr>
+	</test>
+</tests>
diff --git a/libstdc++-v3/testsuite/data/thirty_years_among_the_dead_preproc.txt b/libstdc++-v3/testsuite/data/thirty_years_among_the_dead_preproc.txt
new file mode 100644
index 00000000000..cec14395852
--- /dev/null
+++ b/libstdc++-v3/testsuite/data/thirty_years_among_the_dead_preproc.txt
@@ -0,0 +1,187586 @@
+Thirty
+Years
+Among
+the
+Dead
+Dr
+Carl
+Wickland
+I
+INTER
+RELATIONSHIP
+OF
+THE
+TWO
+WORLDS
+II
+PSYCHICAL
+RESEARCH
+III
+SUBCONSCIOUS
+MIND
+AND
+AUTO
+SUGGESTION
+HYPOTHESES
+UNTENABLE
+IV
+EARTH
+SPHERE
+CONDITIONS
+AND
+MAGNETIC
+AURA
+V
+TORMENTING
+SPIRITS
+MARRIAGE
+DISTURBANCES
+VI
+SPIRITS
+AND
+CRIME
+VII
+SPIRITS
+AND
+SUICIDE
+VIII
+SPIRITS
+AND
+NARCOTICS
+INEBRIETY
+AMNESIA
+IX
+PSYCHIC
+INVALIDISM
+X
+ORPHANS
+XI
+MATERIALISM
+AND
+INDIFFERENCE
+XII
+SELFISHNESS
+XIII
+ORTHODOXY
+XIV
+CHRISTIAN
+SCIENCE
+XV
+THEOSOPHY
+XVI
+PHILOSOPHY
+XVII
+CONCLUSION
+CHAPTER
+I
+Inter
+Relationship
+of
+the
+Two
+Worlds
+THE
+reality
+of
+an
+invisible
+world
+surrounding
+the
+physical
+world
+is
+for
+many
+difficult
+to
+comprehend
+since
+the
+mind
+sphere
+is
+often
+limited
+to
+the
+visible
+and
+tangible
+however
+it
+requires
+but
+little
+thought
+to
+realize
+the
+constant
+change
+of
+matter
+as
+it
+occurs
+in
+three
+forms
+solid
+liquid
+and
+gaseous
+in
+its
+range
+back
+and
+forth
+between
+the
+visible
+and
+invisible
+Visible
+nature
+is
+but
+the
+invisible
+the
+Real
+made
+manifest
+through
+a
+combination
+of
+its
+elements
+science
+informs
+us
+that
+fully
+ninety
+five
+per
+cent
+of
+vegetation
+is
+derived
+out
+of
+the
+air
+or
+atmosphere
+Is
+not
+mankind
+living
+at
+the
+bottom
+of
+an
+invisible
+ocean
+the
+atmosphere
+which
+is
+even
+more
+important
+to
+physical
+existence
+than
+any
+of
+the
+visible
+physical
+substances
+since
+life
+can
+continue
+but
+a
+few
+moments
+out
+of
+it
+Nitrogen
+gas
+constituting
+the
+greater
+bulk
+of
+the
+atmosphere
+enters
+vitally
+into
+vegetable
+and
+animal
+growth
+and
+existence
+Hydrogen
+and
+oxygen
+gases
+are
+constantly
+changing
+from
+a
+state
+of
+invisible
+vapor
+to
+visible
+and
+solid
+form
+Carbon
+offers
+another
+example
+of
+similar
+transformation
+Sounds
+odors
+the
+thermic
+law
+of
+heat
+and
+cold
+and
+multitudes
+of
+other
+phenomena
+ranging
+from
+the
+infinitesimal
+electron
+to
+the
+energy
+which
+moves
+the
+planets
+and
+suns
+are
+all
+intangible
+invisible
+factors
+All
+activities
+whether
+chemical
+vital
+or
+mental
+operate
+invisibly
+as
+observed
+in
+chemical
+affinity
+in
+energy
+in
+plant
+life
+in
+animal
+life
+in
+intelligence
+and
+mentalization
+So
+in
+every
+department
+of
+our
+manifest
+physical
+nature
+it
+is
+evident
+that
+all
+elements
+have
+their
+root
+and
+permanence
+in
+the
+invisible
+The
+invisible
+is
+the
+source
+of
+the
+visible
+Thus
+when
+we
+realize
+that
+the
+objective
+is
+only
+a
+combination
+of
+invisible
+substances
+and
+forces
+the
+existence
+of
+an
+unseen
+world
+is
+readily
+comprehensible
+Considering
+the
+wonderful
+advancement
+of
+science
+into
+the
+field
+of
+nature
+s
+finer
+forces
+it
+is
+inconceivable
+that
+any
+thinking
+mind
+can
+fail
+to
+recognize
+the
+rationale
+of
+the
+independent
+existence
+of
+the
+human
+spirit
+apart
+for
+the
+physical
+body
+No
+subject
+has
+been
+better
+authenticated
+through
+the
+ages
+and
+in
+all
+literature
+than
+that
+of
+spirit
+existence
+and
+a
+future
+life
+Fiske
+the
+historian
+says
+Among
+all
+races
+of
+men
+as
+far
+as
+can
+now
+be
+determined
+ancestor
+worship
+contact
+with
+the
+spirits
+of
+the
+departed
+was
+the
+earliest
+form
+of
+worship
+prevailing
+in
+Africa
+Asia
+China
+Japan
+among
+the
+Aryans
+of
+Europe
+and
+the
+American
+Indian
+tribes
+Allen
+in
+his
+History
+of
+Civilization
+writes
+Rude
+tribes
+the
+world
+over
+are
+found
+to
+have
+ideas
+of
+a
+human
+soul
+a
+spirit
+world
+and
+generally
+a
+belief
+in
+immortality
+Savages
+consider
+the
+next
+life
+simply
+a
+continuation
+of
+this
+they
+also
+recognize
+an
+other
+self
+which
+has
+mysterious
+powers
+Death
+is
+the
+abandoning
+of
+the
+body
+by
+this
+mysterious
+other
+self
+which
+is
+conceived
+of
+as
+still
+existing
+in
+the
+near
+neighborhood
+The
+loves
+and
+hates
+of
+this
+world
+are
+transferred
+to
+the
+spirit
+world
+Confucius
+said
+Bemoan
+not
+the
+departed
+with
+excessive
+grief
+The
+dead
+are
+devoted
+and
+faithful
+friends
+they
+are
+ever
+associated
+with
+us
+The
+writers
+of
+classic
+times
+Socrates
+Herodotus
+Sophocles
+Euripides
+Plato
+Aristotle
+Horace
+Virgil
+Plutarch
+Josephus
+Maximus
+of
+Tyre
+repeatedly
+refer
+to
+spirit
+existence
+as
+a
+well
+known
+fact
+Cicero
+wrote
+Is
+not
+almost
+all
+heaven
+filled
+with
+the
+human
+Those
+very
+gods
+themselves
+had
+their
+original
+here
+below
+and
+ascended
+from
+hence
+into
+heaven
+That
+early
+Christianity
+recognized
+spirits
+is
+too
+well
+authenticated
+in
+the
+writings
+of
+St
+Anthony
+Tertullian
+Origen
+and
+their
+contemporaries
+to
+require
+emphasis
+The
+Bible
+is
+replete
+with
+references
+to
+spirit
+existence
+We
+also
+are
+compassed
+about
+with
+so
+great
+a
+cloud
+of
+witnesses
+Heb
+Beloved
+believe
+not
+every
+spirit
+but
+try
+the
+spirits
+whether
+they
+are
+of
+God
+John
+The
+spirits
+of
+just
+men
+made
+perfect
+Heb
+There
+is
+a
+natural
+body
+and
+there
+is
+a
+spiritual
+body
+First
+that
+which
+is
+natural
+and
+afterward
+that
+which
+is
+spiritual
+Cor
+Many
+other
+similar
+biblical
+citations
+might
+be
+given
+Swedenborg
+contributed
+volumes
+on
+this
+subject
+Dr
+Samuel
+Johnson
+said
+I
+do
+not
+believe
+in
+spirits
+I
+have
+seen
+too
+many
+of
+them
+John
+Wesley
+wrote
+in
+The
+Invisible
+World
+It
+is
+true
+that
+the
+English
+in
+general
+indeed
+most
+of
+the
+men
+of
+learning
+in
+Europe
+have
+given
+up
+all
+accounts
+of
+witches
+and
+apparitions
+as
+mere
+old
+wives
+fables
+I
+am
+sorry
+for
+it
+and
+I
+willingly
+take
+this
+opportunity
+to
+offer
+my
+solemn
+protest
+against
+this
+violent
+compliment
+which
+so
+many
+that
+believe
+in
+the
+Bible
+pay
+to
+those
+who
+do
+not
+believe
+it
+Such
+belief
+is
+in
+direct
+opposition
+not
+only
+to
+the
+Bible
+but
+to
+the
+suffrage
+of
+the
+wisest
+and
+best
+of
+men
+in
+all
+ages
+and
+nations
+They
+well
+know
+that
+the
+giving
+up
+of
+witchcraft
+is
+in
+effect
+giving
+up
+the
+Bible
+That
+psychic
+phenomena
+occurred
+at
+the
+house
+of
+Mr
+Samuel
+Wesley
+father
+of
+Rev
+John
+Wesley
+at
+Epworth
+and
+continued
+with
+noises
+and
+disturbances
+of
+various
+kinds
+for
+many
+months
+is
+well
+known
+Shakespeare
+Milton
+Wordsworth
+Tennyson
+Longfellow
+and
+many
+other
+poets
+wrote
+with
+profound
+understanding
+of
+the
+continued
+existence
+of
+man
+We
+are
+all
+familiar
+with
+the
+convincing
+results
+of
+the
+psychical
+research
+work
+of
+modern
+scientists
+philosophers
+ministers
+physicians
+psychologists
+and
+other
+investigators
+Prof
+Crookes
+Alfred
+Wallace
+Sir
+Oliver
+Lodge
+Sir
+Arthur
+Conan
+Doyle
+Rev
+R
+J
+Campbell
+Archdeacon
+Colley
+Rev
+Newton
+Rev
+Savage
+W
+T
+Stead
+Camille
+Flammarion
+Dr
+Baraduc
+Dr
+Janet
+Prof
+Richet
+Cesare
+Lombroso
+Dr
+Hodgson
+Dr
+I
+K
+Funk
+Prof
+James
+Prof
+Hyslop
+Dr
+Carrington
+and
+many
+others
+Dr
+Thomas
+J
+Hudson
+author
+of
+The
+Law
+of
+Psychic
+Phenomena
+wrote
+The
+man
+who
+denies
+the
+phenomena
+of
+spiritualism
+today
+is
+not
+entitled
+to
+be
+called
+a
+skeptic
+he
+is
+simply
+ignorant
+The
+Rev
+Dr
+George
+M
+Searle
+Rector
+of
+the
+Catholic
+Church
+of
+St
+Paul
+the
+Apostle
+New
+York
+City
+said
+The
+reality
+of
+the
+existence
+of
+spirits
+in
+modern
+spiritism
+is
+no
+longer
+an
+open
+question
+even
+among
+scientific
+men
+who
+have
+examined
+the
+subject
+Any
+one
+who
+considers
+the
+manifestation
+of
+them
+as
+mere
+humbug
+trickery
+or
+delusion
+is
+simply
+not
+up
+to
+date
+In
+our
+times
+no
+one
+denies
+the
+real
+existence
+of
+spiritualistic
+facts
+except
+a
+few
+who
+live
+with
+their
+feet
+on
+the
+earth
+and
+their
+brains
+in
+the
+moon
+wrote
+G
+G
+Franco
+S
+J
+in
+Civilta
+Cattolica
+Spiritistic
+phenomena
+are
+external
+facts
+which
+fall
+within
+the
+range
+of
+the
+senses
+and
+can
+easily
+be
+observed
+by
+all
+and
+when
+such
+facts
+are
+attested
+by
+so
+many
+well
+informed
+and
+credible
+witnesses
+it
+is
+useless
+as
+well
+as
+foolish
+and
+ridiculous
+to
+fight
+against
+proved
+evidence
+The
+facts
+remain
+assured
+even
+for
+reasonable
+men
+The
+spiritual
+world
+and
+the
+physical
+world
+are
+constantly
+intermingling
+the
+spiritual
+plane
+is
+not
+a
+vague
+intangibility
+but
+is
+real
+and
+natural
+a
+vast
+zone
+of
+refined
+substance
+of
+activity
+and
+progress
+and
+life
+there
+is
+a
+continuation
+of
+life
+in
+the
+physical
+world
+On
+the
+physical
+plane
+of
+expression
+the
+soul
+obtains
+knowledge
+through
+experience
+and
+contact
+with
+objective
+things
+and
+intelligence
+finds
+itself
+by
+manifesting
+through
+physical
+organs
+in
+the
+spiritual
+plane
+progression
+of
+the
+individual
+continues
+the
+mind
+unfolding
+along
+lines
+of
+reason
+through
+spontaneity
+of
+service
+the
+attainment
+and
+appreciation
+of
+high
+ideals
+and
+an
+ever
+broadening
+conception
+of
+life
+s
+purpose
+The
+change
+called
+death
+the
+word
+is
+a
+misnomer
+universally
+regarded
+with
+gloomy
+fear
+occurs
+so
+naturally
+and
+simply
+that
+the
+greater
+number
+after
+passing
+out
+of
+the
+physical
+are
+not
+aware
+that
+the
+transition
+has
+been
+made
+and
+having
+no
+knowledge
+of
+a
+spiritual
+life
+they
+are
+totally
+unconscious
+of
+having
+passed
+into
+another
+state
+of
+being
+Deprived
+of
+their
+physical
+sense
+organs
+they
+are
+shut
+out
+from
+the
+physical
+light
+and
+lacking
+a
+mental
+perception
+of
+the
+high
+purpose
+of
+existence
+these
+individuals
+are
+spiritually
+blind
+and
+find
+themselves
+in
+a
+twilight
+condition
+the
+outer
+darkness
+mentioned
+in
+the
+Bible
+and
+linger
+in
+the
+realm
+known
+as
+the
+Earth
+Sphere
+Death
+does
+not
+make
+a
+saint
+of
+a
+sinner
+nor
+a
+sage
+of
+a
+fool
+The
+mentality
+is
+the
+same
+as
+before
+and
+individuals
+carry
+with
+them
+their
+old
+desires
+habits
+dogmas
+faulty
+teachings
+indifference
+or
+disbelief
+in
+a
+future
+life
+As
+a
+man
+thinketh
+in
+his
+heart
+so
+is
+he
+Prov
+Assuming
+spirit
+forms
+which
+are
+the
+result
+of
+their
+thought
+life
+on
+earth
+millions
+remain
+for
+a
+time
+in
+the
+earth
+sphere
+and
+often
+in
+the
+environment
+of
+their
+earth
+lives
+still
+held
+by
+their
+habits
+or
+interests
+Where
+your
+treasure
+is
+there
+will
+your
+heart
+be
+also
+Matt
+Those
+who
+have
+progressed
+to
+the
+higher
+spirit
+world
+ever
+endeavor
+to
+enlighten
+these
+earthbound
+spirits
+but
+the
+latter
+due
+to
+preconceptions
+concerning
+the
+hereafter
+labor
+under
+the
+delusion
+that
+the
+departed
+are
+dead
+or
+are
+ghosts
+and
+often
+refuse
+to
+recognize
+their
+friends
+or
+to
+realize
+their
+own
+condition
+Many
+are
+in
+a
+state
+of
+heavy
+sleep
+others
+are
+lost
+or
+confused
+troubled
+minds
+may
+be
+haunted
+by
+fear
+of
+the
+strange
+darkness
+those
+conscience
+stricken
+suffer
+in
+anguish
+or
+remorse
+for
+their
+earth
+conduct
+some
+impelled
+by
+selfish
+or
+evil
+inclinations
+seek
+an
+outlet
+for
+their
+tendencies
+remaining
+in
+this
+condition
+until
+these
+destructive
+desires
+are
+outgrown
+when
+the
+soul
+cries
+out
+for
+understanding
+and
+light
+and
+progressed
+spirits
+are
+able
+to
+reach
+them
+and
+aid
+them
+Lacking
+physical
+bodies
+through
+which
+to
+carry
+out
+earthly
+propensities
+many
+discarnated
+intelligences
+are
+attracted
+to
+the
+magnetic
+light
+which
+emanates
+from
+mortals
+and
+consciously
+or
+unconsciously
+attach
+themselves
+to
+these
+magnetic
+auras
+finding
+an
+avenue
+of
+expression
+through
+influencing
+obsessing
+or
+possessing
+human
+beings
+Such
+obtruding
+spirits
+influence
+susceptible
+sensitives
+with
+their
+thoughts
+impart
+their
+own
+emotions
+to
+them
+weaken
+their
+will
+power
+and
+often
+control
+their
+actions
+producing
+great
+distress
+mental
+confusion
+and
+suffering
+These
+earthbound
+spirits
+are
+the
+supposed
+devils
+of
+all
+ages
+devils
+of
+human
+origin
+by
+products
+of
+human
+selfishness
+false
+teachings
+and
+ignorance
+thrust
+blindly
+into
+a
+spirit
+existence
+and
+held
+there
+in
+a
+bondage
+of
+ignorance
+The
+influence
+of
+these
+discarnated
+entities
+is
+the
+cause
+of
+many
+of
+the
+inexplicable
+and
+obscure
+events
+of
+earth
+life
+and
+of
+a
+large
+part
+of
+the
+world
+s
+misery
+Purity
+of
+life
+and
+motive
+or
+high
+intellectuality
+do
+not
+necessarily
+offer
+protection
+from
+obsession
+recognition
+and
+knowledge
+of
+these
+problems
+are
+the
+only
+safeguards
+The
+physical
+conditions
+permitting
+this
+impingement
+are
+varied
+such
+encroachment
+is
+often
+due
+to
+a
+natural
+and
+prediposed
+susceptibility
+a
+depleted
+nervous
+system
+or
+sudden
+shock
+Physical
+derangements
+are
+conducive
+to
+obsession
+for
+when
+the
+vital
+forces
+are
+lowered
+less
+resistance
+is
+offered
+and
+intruding
+spirits
+are
+allowed
+easy
+access
+although
+often
+neither
+mortal
+nor
+spirit
+is
+conscious
+of
+the
+presence
+of
+the
+other
+This
+encroachment
+alters
+the
+characteristics
+of
+the
+sensitive
+resulting
+in
+a
+seemingly
+changed
+personality
+sometimes
+simulating
+multiple
+or
+dissociated
+personalities
+and
+frequently
+causes
+apparent
+insanity
+varying
+in
+degree
+from
+a
+simple
+mental
+aberration
+to
+and
+including
+all
+types
+of
+dementia
+hysteria
+epilepsy
+melancholia
+shell
+shock
+kleptomania
+idiocy
+religious
+and
+suicidal
+mania
+as
+well
+as
+amnesia
+psychic
+invalidism
+dipsomania
+immorality
+functional
+bestiality
+atrocities
+and
+other
+forms
+of
+criminality
+Humanity
+is
+surrounded
+by
+the
+thought
+influence
+of
+millions
+of
+discarnate
+beings
+who
+have
+not
+yet
+arrived
+at
+a
+full
+realization
+of
+life
+s
+higher
+purposes
+A
+recognition
+of
+this
+fact
+accounts
+for
+a
+great
+portion
+of
+unbidden
+thoughts
+emotions
+strange
+forebodings
+gloomy
+moods
+irritabilities
+unreasonable
+impulses
+irrational
+outbursts
+of
+temper
+uncontrollable
+infatuations
+and
+countless
+other
+mental
+vagaries
+The
+records
+of
+spirit
+obsession
+and
+possession
+extend
+from
+remotest
+antiquity
+to
+modern
+times
+Dr
+Tyler
+the
+noted
+English
+Anthropologist
+in
+his
+Primitive
+Culture
+says
+It
+is
+not
+too
+much
+to
+assert
+that
+the
+doctrine
+of
+demoniacal
+possession
+is
+kept
+up
+substantially
+the
+same
+theory
+to
+account
+for
+substantially
+the
+same
+facts
+by
+half
+the
+human
+race
+who
+thus
+stand
+as
+consistent
+representatives
+of
+their
+forefathers
+back
+in
+the
+primitive
+antiquity
+In
+Muller
+s
+Urreligionen
+we
+find
+The
+general
+belief
+of
+the
+barbaric
+world
+today
+is
+that
+such
+attacks
+as
+epilepsy
+hysteria
+delirium
+idiocy
+and
+madness
+are
+caused
+by
+some
+demon
+gaining
+control
+of
+the
+body
+Homer
+referred
+repeatedly
+to
+demons
+and
+said
+A
+sick
+man
+pining
+away
+is
+one
+upon
+whom
+an
+evil
+spirit
+has
+gazed
+Plato
+held
+that
+demons
+obsessed
+mortals
+Socrates
+speaks
+directly
+of
+demons
+influencing
+the
+possessed
+insane
+Plutarch
+wrote
+Certain
+tyrannical
+demons
+require
+for
+their
+enjoyment
+some
+soul
+still
+incarnate
+being
+unable
+to
+satisfy
+their
+passions
+in
+any
+other
+way
+incite
+to
+sedition
+lust
+wars
+of
+conquest
+and
+thus
+get
+what
+they
+lust
+for
+Josephus
+says
+Demons
+are
+the
+spirits
+of
+wicked
+men
+Obsessing
+or
+possessing
+spirits
+are
+frequently
+mentioned
+both
+in
+the
+Old
+and
+New
+Testaments
+In
+I
+Samuel
+we
+read
+David
+took
+an
+harp
+and
+played
+with
+his
+hand
+so
+Saul
+was
+refreshed
+and
+was
+well
+and
+the
+evil
+spirit
+departed
+from
+him
+So
+common
+was
+the
+belief
+in
+spirits
+and
+spirit
+obsession
+in
+the
+time
+of
+the
+apostles
+that
+the
+ability
+to
+cast
+out
+evil
+spirits
+was
+considered
+one
+of
+the
+most
+important
+signs
+of
+genuine
+discipleship
+and
+it
+must
+be
+admitted
+that
+a
+considerable
+portion
+of
+the
+work
+accredited
+to
+Jesus
+was
+the
+casting
+out
+of
+demons
+A
+few
+quotations
+from
+the
+New
+Testament
+will
+suffice
+Jesus
+gave
+his
+twelve
+disciples
+power
+against
+unclean
+spirits
+to
+cast
+them
+out
+Matt
+Jesus
+preached
+and
+cast
+out
+devils
+Mark
+A
+certain
+mad
+which
+had
+devils
+long
+time
+Jesus
+had
+commanded
+the
+unclean
+spirit
+to
+come
+out
+of
+the
+man
+He
+that
+was
+possessed
+of
+the
+devils
+was
+healed
+Luke
+Vexed
+with
+unclean
+spirits
+Luke
+The
+evil
+spirits
+went
+out
+of
+them
+Acts
+Master
+I
+have
+brought
+unto
+thee
+my
+son
+which
+hath
+a
+dumb
+spirit
+And
+he
+asked
+his
+father
+How
+long
+is
+it
+ago
+since
+this
+came
+unto
+him
+And
+he
+said
+Of
+a
+child
+Jesus
+rebuked
+the
+foul
+spirit
+saying
+unto
+him
+Thou
+deaf
+and
+dumb
+spirit
+I
+charge
+thee
+come
+out
+of
+him
+and
+enter
+no
+more
+into
+him
+And
+the
+spirit
+cried
+and
+rent
+him
+sore
+and
+came
+out
+of
+him
+and
+he
+was
+as
+one
+dead
+insomuch
+that
+many
+said
+He
+is
+dead
+But
+Jesus
+took
+him
+by
+the
+hand
+and
+lifted
+him
+up
+and
+he
+arose
+Mark
+Similar
+occurrences
+are
+not
+at
+all
+uncommon
+in
+psycho
+pathological
+research
+Among
+the
+writers
+of
+early
+Christianity
+we
+find
+that
+St
+Anthony
+says
+We
+walk
+in
+the
+midst
+of
+demons
+who
+give
+us
+evil
+thoughts
+and
+also
+in
+the
+midst
+of
+good
+angels
+When
+these
+latter
+are
+especially
+present
+there
+is
+no
+disturbance
+no
+contention
+no
+clamor
+but
+something
+so
+calm
+and
+gentle
+it
+fills
+the
+soul
+with
+gladness
+The
+Lord
+is
+my
+witness
+that
+after
+many
+tears
+and
+fastings
+I
+have
+been
+surrounded
+by
+a
+band
+of
+angels
+and
+joyfully
+joined
+in
+singing
+with
+them
+Tertullian
+with
+authority
+challenged
+the
+heathery
+to
+a
+trial
+of
+superiority
+in
+the
+matter
+of
+casting
+out
+demons
+Minucius
+Felix
+a
+Roman
+advocate
+and
+apologist
+wrote
+in
+Octavius
+There
+are
+some
+insincere
+and
+vagrant
+spirits
+degraded
+from
+their
+heavenly
+vigor
+who
+cease
+not
+now
+that
+they
+are
+ruined
+themselves
+to
+ruin
+others
+Dr
+Godfrey
+Raupert
+of
+London
+who
+several
+years
+ago
+was
+especially
+delegated
+by
+Pope
+Pius
+X
+to
+lecture
+to
+Catholic
+audiences
+in
+America
+on
+Spiritualism
+said
+in
+substance
+It
+is
+no
+longer
+possible
+to
+put
+the
+the
+subject
+of
+psychic
+phenomena
+aside
+The
+scientific
+men
+all
+over
+the
+world
+have
+recognized
+spiritism
+as
+a
+definite
+and
+real
+power
+and
+to
+shelve
+it
+is
+a
+dangerous
+policy
+Consequently
+the
+Pope
+has
+asked
+me
+to
+tell
+Catholics
+the
+attitude
+to
+take
+toward
+the
+subject
+The
+Church
+admits
+the
+reality
+of
+these
+spiritistic
+phenomena
+and
+their
+external
+intelligences
+in
+fact
+it
+has
+always
+admitted
+their
+reality
+The
+problem
+at
+present
+is
+to
+discover
+the
+nature
+of
+the
+intelligence
+We
+are
+now
+on
+the
+borderland
+of
+new
+discoveries
+which
+may
+revolutionize
+the
+world
+It
+is
+not
+the
+time
+yet
+for
+an
+explanation
+of
+all
+the
+phenomena
+We
+must
+suspend
+our
+judgment
+until
+the
+subject
+is
+better
+known
+The
+study
+of
+spiritism
+is
+a
+new
+one
+and
+therefore
+dangerous
+A
+partial
+knowledge
+of
+the
+subject
+may
+cause
+grave
+dangers
+Resulting
+in
+obsession
+or
+possession
+There
+is
+no
+doubt
+about
+the
+fact
+of
+diabolical
+obsessions
+in
+the
+olden
+time
+That
+the
+Church
+Catholic
+recognizes
+the
+possibilities
+is
+evidenced
+by
+the
+rules
+prepared
+for
+exorcising
+is
+the
+quoted
+statement
+of
+Monsignor
+Lavelle
+Rector
+of
+St
+Patrick
+s
+Cathedral
+New
+York
+Julian
+Hawthorne
+wrote
+in
+one
+of
+the
+leading
+newspapers
+Thousands
+of
+evil
+minded
+and
+evil
+acting
+men
+and
+women
+die
+every
+day
+What
+becomes
+of
+their
+souls
+or
+spirits
+They
+want
+to
+get
+back
+here
+the
+increasing
+boldness
+and
+frequency
+with
+which
+they
+take
+advantage
+of
+their
+opportunities
+is
+illustrated
+in
+many
+ways
+Two
+acts
+of
+defense
+are
+open
+to
+us
+We
+may
+stop
+the
+source
+of
+supply
+of
+these
+undesirable
+visitors
+and
+we
+may
+close
+the
+doors
+Dr
+Axel
+Gustafson
+who
+publicly
+acclaimed
+his
+views
+regarding
+the
+fact
+of
+spirit
+obsession
+in
+quoting
+cases
+which
+had
+come
+to
+his
+attention
+said
+The
+spirits
+of
+the
+revengeful
+have
+power
+after
+death
+to
+enter
+into
+and
+possess
+the
+living
+under
+certain
+conditions
+Prof
+Herbert
+L
+Stetson
+of
+Kalamazoo
+College
+Michigan
+stated
+in
+a
+lecture
+at
+the
+University
+of
+Chicago
+Demon
+obsession
+is
+no
+myth
+illness
+is
+often
+due
+to
+demoniacal
+possession
+Belief
+in
+demons
+is
+widespread
+I
+often
+see
+the
+spirits
+who
+cause
+insanity
+is
+the
+statement
+of
+Dr
+E
+N
+Webster
+of
+the
+mental
+section
+of
+the
+American
+Medical
+Association
+At
+times
+I
+even
+hear
+their
+voices
+Insane
+persons
+who
+are
+spoken
+of
+as
+hopelessly
+insane
+are
+frequently
+lost
+under
+the
+overwhelming
+control
+of
+a
+spirit
+or
+crowd
+of
+spirits
+We
+frequently
+find
+by
+post
+mortem
+examination
+that
+no
+physical
+disorder
+exists
+in
+the
+brain
+or
+nervous
+system
+of
+such
+persons
+Prof
+William
+James
+wrote
+in
+Proceedings
+S
+P
+R
+That
+the
+demon
+theory
+will
+have
+its
+innings
+again
+is
+to
+my
+mind
+absolutely
+certain
+One
+has
+to
+be
+scientific
+indeed
+to
+be
+blind
+and
+ignorant
+enough
+to
+suspect
+no
+such
+possibility
+Prof
+James
+H
+Hyslop
+while
+editor
+of
+the
+Journal
+of
+the
+American
+Society
+for
+Psychical
+Research
+wrote
+There
+is
+growing
+evidence
+of
+the
+fact
+of
+obsession
+which
+lies
+at
+the
+basis
+of
+much
+insanity
+and
+can
+be
+cured
+The
+medical
+world
+will
+have
+to
+wake
+up
+and
+give
+attention
+to
+this
+problem
+or
+materia
+medica
+will
+lose
+control
+of
+the
+subject
+In
+one
+of
+Prof
+Hyslop
+s
+latest
+books
+Contact
+with
+the
+Other
+World
+we
+find
+the
+following
+The
+existence
+of
+evil
+spirits
+affecting
+the
+living
+is
+as
+clearly
+taught
+in
+the
+New
+Testament
+and
+implied
+in
+the
+Old
+Testament
+as
+any
+doctrine
+there
+expounded
+The
+term
+obsession
+is
+employed
+by
+psychic
+researchers
+to
+denote
+the
+abnormal
+influence
+of
+spirits
+on
+the
+living
+The
+cures
+effected
+have
+required
+much
+time
+and
+patience
+the
+use
+of
+psychotherapeutics
+of
+an
+unusual
+kind
+and
+the
+employment
+of
+psychics
+to
+get
+into
+contact
+with
+the
+obsessing
+agents
+and
+thus
+to
+release
+the
+hold
+which
+such
+agents
+have
+or
+to
+educate
+them
+to
+voluntary
+abandonment
+of
+their
+persecutions
+Every
+single
+case
+of
+dissociation
+and
+paranoia
+to
+which
+I
+have
+applied
+cross
+reference
+has
+yielded
+to
+the
+method
+and
+proved
+the
+existence
+of
+foreign
+agencies
+complicated
+with
+the
+symptoms
+of
+mental
+or
+physical
+deterioration
+It
+is
+high
+time
+to
+prosecute
+experiments
+on
+a
+large
+scale
+in
+a
+field
+that
+promises
+to
+have
+as
+much
+practical
+value
+as
+any
+application
+of
+the
+scalpel
+and
+the
+microscope
+In
+Modern
+Psychical
+Phenomena
+Dr
+Hereward
+Carrington
+states
+It
+is
+evident
+that
+spiritual
+obsession
+is
+at
+least
+a
+possibility
+which
+modern
+science
+can
+no
+longer
+disregard
+while
+there
+are
+many
+striking
+facts
+in
+its
+support
+This
+being
+so
+its
+study
+becomes
+imperative
+not
+only
+from
+the
+academic
+viewpoint
+but
+also
+because
+of
+the
+fact
+that
+hundreds
+and
+perhaps
+thousands
+of
+individuals
+are
+at
+the
+present
+moment
+suffering
+in
+this
+manner
+and
+their
+relief
+demands
+some
+immediate
+investigation
+and
+cure
+Once
+grant
+the
+theoretical
+possibility
+of
+actual
+obsession
+and
+a
+whole
+vast
+field
+of
+research
+and
+investigations
+is
+opened
+up
+before
+us
+which
+demands
+all
+the
+care
+skill
+and
+patience
+which
+modern
+enlightenment
+and
+psychological
+understanding
+can
+furnish
+Never
+before
+in
+the
+history
+of
+medical
+science
+has
+there
+been
+such
+widespread
+interest
+by
+the
+public
+at
+large
+as
+well
+as
+by
+medical
+men
+and
+public
+officials
+in
+the
+subject
+of
+the
+cause
+treatment
+and
+cure
+of
+nervous
+and
+mental
+diseases
+Statistics
+show
+that
+insanity
+is
+increasing
+with
+alarming
+rapidity
+everywhere
+yet
+medical
+experts
+differ
+widely
+as
+to
+the
+causes
+of
+mental
+deterioration
+and
+science
+is
+not
+yet
+in
+possession
+of
+knowledge
+of
+the
+exact
+etiology
+of
+functional
+insanity
+The
+whole
+world
+will
+go
+mad
+before
+long
+declared
+Dr
+Winslow
+of
+England
+The
+greater
+number
+of
+neurologists
+and
+alienists
+entertain
+the
+belief
+that
+the
+active
+and
+underlying
+cause
+of
+insanity
+has
+its
+origin
+within
+the
+deranged
+nervous
+system
+but
+very
+little
+as
+yet
+is
+actually
+known
+of
+the
+true
+cause
+Dr
+W
+M
+L
+Coplin
+Director
+of
+the
+Bureau
+of
+Health
+and
+Charities
+Philadelphia
+Pennsylvania
+said
+Insanity
+in
+most
+cases
+is
+unaccompanied
+by
+any
+perceptible
+change
+in
+the
+brain
+structure
+The
+brain
+of
+the
+patient
+when
+examined
+under
+a
+microscope
+shows
+absolutely
+nothing
+which
+differs
+in
+any
+way
+from
+the
+appearance
+of
+the
+brain
+of
+the
+perfectly
+sane
+person
+It
+is
+therefore
+evident
+that
+the
+insanity
+might
+be
+due
+to
+toxemia
+the
+effect
+of
+some
+subtle
+organism
+in
+the
+nature
+of
+bacilla
+Something
+causes
+insanity
+but
+what
+it
+is
+we
+do
+not
+yet
+know
+Dr
+Britton
+D
+Evans
+Superintendent
+of
+the
+Morris
+Plains
+New
+Jersey
+Insane
+Asylum
+stated
+Brain
+tumor
+or
+brain
+fever
+may
+not
+affect
+the
+mind
+A
+man
+may
+have
+trouble
+of
+the
+brain
+and
+still
+have
+a
+normal
+mind
+Dr
+Th
+Ziehen
+a
+noted
+German
+alienist
+and
+an
+authority
+on
+hysteria
+wrote
+For
+many
+functional
+neuroses
+there
+is
+as
+yet
+no
+accurate
+limitation
+and
+definition
+As
+pathological
+anatomy
+does
+not
+aid
+us
+no
+uniform
+and
+exclusive
+cause
+for
+hysteria
+can
+be
+demonstrated
+Dr
+William
+Hanna
+Thomson
+physician
+to
+the
+Roosevelt
+Hospital
+and
+Professor
+of
+the
+Practice
+of
+Medicine
+and
+Diseases
+of
+the
+Nervous
+System
+New
+York
+University
+Medical
+College
+in
+referring
+to
+Tuke
+s
+Dictionary
+of
+Psychological
+Medicine
+asserted
+that
+The
+contributors
+to
+this
+great
+encyclopedia
+are
+from
+the
+most
+eminent
+professors
+experts
+and
+superintendents
+of
+insane
+asylums
+in
+Great
+Britain
+the
+United
+States
+France
+Germany
+Hungary
+Belgium
+Denmark
+Switzerland
+and
+Russia
+In
+the
+articles
+by
+the
+writers
+on
+kleptomania
+dipsomania
+chronic
+mania
+etc
+there
+is
+not
+a
+word
+about
+the
+pathological
+anatomy
+because
+none
+can
+be
+found
+Just
+so
+it
+is
+in
+the
+article
+on
+melancholia
+puerperal
+insanity
+katatonia
+circular
+insanity
+homicidal
+insanity
+or
+epileptic
+insanity
+in
+none
+of
+these
+is
+there
+a
+word
+about
+pathological
+anatomy
+for
+the
+sufficient
+reason
+that
+not
+one
+of
+these
+forms
+of
+insanity
+shows
+any
+pathological
+or
+diseased
+condition
+in
+the
+brain
+different
+from
+the
+sound
+brain
+of
+a
+healthy
+man
+killed
+in
+an
+accident
+He
+also
+said
+It
+is
+high
+time
+that
+we
+now
+look
+in
+the
+direction
+of
+toxemia
+or
+blood
+poisoning
+for
+the
+explanation
+of
+the
+insanities
+which
+produce
+no
+changes
+whatever
+in
+the
+brain
+Recent
+announcement
+was
+made
+that
+a
+large
+percentage
+of
+cures
+reported
+by
+the
+New
+Jersey
+State
+Hospital
+for
+the
+Insane
+at
+Trenton
+were
+effected
+by
+the
+removal
+of
+diseased
+teeth
+tonsils
+or
+affected
+organs
+In
+a
+resume
+of
+the
+Trenton
+method
+Dr
+R
+S
+Copeland
+wrote
+The
+hypothesis
+upon
+which
+this
+treatment
+is
+founded
+is
+that
+insanity
+is
+a
+toxemia
+or
+poisoning
+due
+to
+germ
+infection
+in
+some
+part
+of
+the
+body
+If
+this
+is
+true
+it
+follows
+that
+removal
+of
+the
+infected
+tissue
+when
+the
+case
+has
+not
+gone
+too
+far
+will
+be
+followed
+by
+disappearance
+of
+the
+mental
+disturbance
+When
+statistics
+compiled
+by
+the
+United
+States
+Government
+as
+well
+as
+by
+others
+show
+that
+the
+increase
+in
+the
+number
+of
+the
+insane
+is
+proportionately
+greater
+than
+the
+increase
+of
+the
+general
+population
+it
+seems
+incongruous
+to
+credit
+decayed
+teeth
+and
+diseased
+tonsils
+as
+being
+primary
+causes
+of
+mental
+unbalance
+at
+this
+time
+when
+dental
+and
+surgical
+attention
+is
+so
+general
+whereas
+the
+facts
+are
+that
+when
+dentistry
+was
+little
+known
+and
+practised
+and
+people
+went
+about
+with
+all
+conditions
+of
+decayed
+teeth
+insanity
+was
+less
+prevalent
+than
+now
+Without
+attempting
+to
+discredit
+the
+Trenton
+reports
+it
+may
+be
+stated
+that
+our
+experience
+has
+shown
+that
+in
+many
+cases
+of
+mental
+derangement
+although
+the
+patient
+bad
+badly
+decayed
+teeth
+mental
+balance
+was
+fully
+restored
+by
+dislodging
+the
+obsessing
+spirit
+before
+any
+attention
+was
+given
+to
+the
+teeth
+Since
+it
+has
+been
+found
+that
+obsessing
+spirits
+are
+sensitive
+to
+pain
+I
+am
+constrained
+to
+suggest
+that
+such
+cures
+as
+announced
+by
+the
+Trenton
+Hospital
+may
+at
+least
+in
+part
+be
+due
+to
+the
+fact
+that
+intruding
+spirits
+were
+dislodged
+by
+dental
+or
+surgical
+interference
+To
+the
+investigator
+in
+Abnormal
+Psychology
+on
+the
+spiritistic
+hypothesis
+much
+of
+the
+symptomatology
+of
+the
+War
+Neurosis
+or
+shell
+shock
+excepting
+cases
+of
+malingering
+as
+recorded
+by
+Dr
+F
+E
+Williams
+Acting
+Medical
+Director
+National
+Committee
+for
+Mental
+Hygiene
+New
+York
+City
+suggests
+obsession
+or
+possession
+by
+spirits
+of
+dead
+soldiers
+unconscious
+of
+their
+transition
+as
+the
+exciting
+cause
+This
+is
+indicated
+by
+delirium
+hallucinations
+anxiety
+states
+functional
+heart
+disorders
+paralysis
+tremors
+gait
+disturbances
+convulsive
+movements
+pain
+anesthesia
+hyperesthesia
+blindness
+disorders
+of
+speech
+etc
+The
+spirit
+hypothesis
+regarding
+War
+Neurosis
+is
+further
+evidenced
+by
+the
+rapid
+recovery
+of
+patients
+under
+severe
+electrical
+treatment
+driving
+out
+obsessing
+entities
+as
+instituted
+by
+Dr
+Vincent
+who
+Dr
+Williams
+stated
+would
+cure
+in
+a
+few
+hours
+Patients
+that
+had
+been
+in
+the
+care
+of
+other
+psychiatrists
+for
+months
+and
+would
+have
+them
+walking
+about
+and
+climbing
+ladders
+The
+above
+theory
+is
+also
+favored
+by
+Dr
+Williams
+further
+statements
+that
+This
+neurosis
+is
+rare
+among
+prisoners
+who
+have
+been
+exposed
+to
+mechanical
+shock
+as
+well
+as
+among
+See
+Chap
+Patient
+Mrs
+SI
+Page
+Chap
+Patient
+Mrs
+R
+Page
+wounded
+exposed
+to
+mechanical
+shock
+Severe
+injury
+to
+the
+central
+nervous
+system
+and
+brain
+is
+not
+accompanied
+by
+symptoms
+found
+in
+shell
+shock
+Success
+attends
+the
+therapeutic
+measures
+employed
+for
+the
+psychological
+rather
+than
+the
+mechanical
+side
+Diagnosis
+should
+be
+made
+and
+treatment
+begun
+at
+once
+before
+the
+shell
+shock
+obsession
+becomes
+a
+fixed
+psycho
+neurosis
+Newspapers
+recently
+reported
+the
+case
+of
+a
+young
+man
+Frank
+James
+a
+boy
+thug
+of
+New
+York
+City
+who
+after
+a
+fall
+from
+a
+motorcycle
+when
+ten
+years
+old
+changed
+from
+a
+cheerful
+affectionate
+and
+obedient
+child
+into
+a
+surly
+insolent
+boy
+developing
+into
+a
+confirmed
+robber
+and
+criminal
+After
+several
+terms
+in
+the
+reformatory
+and
+five
+years
+in
+Sing
+Sing
+prison
+he
+was
+declared
+hopelessly
+insane
+and
+sent
+to
+the
+State
+Insane
+Asylum
+Frank
+James
+however
+escaped
+and
+when
+pursuers
+attempted
+his
+capture
+was
+hit
+on
+the
+head
+with
+a
+club
+and
+falling
+unconscious
+was
+taken
+to
+a
+hospital
+The
+next
+morning
+the
+boy
+awoke
+extraordinarily
+changed
+he
+was
+gentle
+and
+deferential
+showing
+no
+further
+indications
+of
+an
+unbalanced
+mind
+and
+from
+that
+time
+exhibited
+not
+the
+slightest
+impulse
+to
+commit
+crime
+of
+any
+kind
+The
+article
+concludes
+Just
+what
+happened
+to
+the
+mechanism
+of
+the
+boy
+s
+brain
+is
+not
+entirely
+understood
+by
+medical
+men
+How
+explain
+such
+a
+case
+on
+the
+toxemia
+theory
+Could
+a
+blow
+on
+the
+head
+eradicate
+the
+supposed
+toxemia
+and
+restore
+mental
+balance
+The
+simple
+explanation
+from
+our
+viewpoint
+would
+be
+that
+following
+the
+shock
+of
+the
+boy
+s
+fall
+an
+obsessing
+spirit
+criminal
+had
+taken
+control
+of
+the
+boy
+and
+that
+the
+blow
+from
+the
+club
+on
+the
+man
+s
+head
+with
+its
+accompanying
+pain
+caused
+the
+obsessing
+entity
+to
+become
+dislodged
+The
+success
+credited
+to
+hydrotherapy
+as
+practiced
+in
+institutions
+for
+the
+insane
+especially
+when
+a
+strong
+stream
+of
+water
+or
+a
+continuous
+bath
+is
+used
+can
+also
+be
+accounted
+for
+by
+the
+dislodgment
+of
+obsessing
+entities
+who
+object
+to
+the
+discomforts
+incident
+to
+such
+treatment
+Dr
+Prince
+in
+the
+Journal
+of
+Abnormal
+Psychology
+wrote
+If
+we
+are
+to
+establish
+sound
+principles
+underlying
+the
+mechanism
+of
+the
+mind
+we
+must
+correlate
+the
+findings
+of
+all
+methods
+of
+research
+experimental
+as
+well
+as
+clinical
+and
+give
+due
+consideration
+to
+the
+results
+obtained
+by
+all
+competent
+investigators
+After
+careful
+elimination
+of
+all
+superstitious
+notions
+and
+absurdities
+adherent
+to
+the
+subject
+of
+Normal
+and
+Abnormal
+Psychology
+excluding
+also
+febrile
+and
+idiopathic
+psychoses
+or
+idiosyncrasies
+as
+well
+as
+all
+neuro
+pathogenic
+psychoses
+there
+still
+remains
+a
+residuum
+of
+abnormality
+in
+a
+majority
+of
+cases
+of
+mental
+aberrations
+That
+alienists
+of
+renown
+and
+the
+foremost
+authorities
+widely
+disagree
+as
+to
+the
+cause
+of
+insanity
+is
+sufficient
+reason
+for
+thinking
+men
+to
+investigate
+any
+theory
+which
+promises
+to
+lead
+to
+results
+regardless
+of
+personal
+or
+popular
+prejudice
+The
+situation
+which
+confronts
+us
+is
+a
+serious
+one
+and
+nothing
+but
+the
+broadest
+toleration
+and
+liberality
+can
+cope
+with
+it
+Since
+insanity
+is
+chiefly
+a
+manifestation
+of
+mental
+or
+psychological
+disturbance
+a
+Psychic
+neurosis
+the
+symptomatology
+therefore
+should
+offer
+a
+guidance
+in
+ascertaining
+the
+etiology
+and
+assist
+as
+well
+in
+arriving
+at
+a
+solution
+of
+the
+mental
+pathology
+This
+proposition
+however
+necessitates
+not
+only
+research
+and
+study
+of
+Normal
+and
+Abnormal
+Psychology
+but
+in
+order
+to
+have
+a
+complete
+premise
+also
+implies
+the
+recognition
+of
+the
+duality
+of
+man
+matter
+and
+spirit
+physical
+and
+spiritual
+Insanity
+is
+not
+a
+stigma
+the
+public
+attitude
+toward
+this
+affliction
+should
+be
+one
+not
+of
+aversion
+but
+of
+understanding
+and
+a
+realization
+of
+the
+close
+inter
+relationship
+of
+the
+visible
+and
+invisible
+worlds
+Spirit
+obsession
+is
+a
+fact
+a
+perversion
+of
+a
+natural
+law
+and
+is
+amply
+demonstrable
+This
+has
+been
+proven
+hundreds
+of
+times
+by
+causing
+the
+supposed
+insanity
+or
+aberration
+to
+be
+temporarily
+transferred
+from
+the
+victim
+to
+a
+psychic
+sensitive
+who
+is
+trained
+for
+the
+purpose
+and
+by
+this
+method
+ascertain
+the
+cause
+of
+the
+psychosis
+to
+be
+an
+ignorant
+or
+mischievous
+spirit
+whose
+identity
+may
+frequently
+be
+verified
+By
+this
+method
+and
+without
+detriment
+to
+the
+psychic
+it
+has
+also
+proven
+possible
+to
+relieve
+the
+victim
+as
+well
+as
+release
+the
+entity
+from
+its
+condition
+of
+spiritual
+darkness
+through
+an
+explanation
+of
+the
+laws
+governing
+the
+spirit
+world
+which
+the
+experiences
+to
+follow
+will
+demonstrate
+Inter
+communication
+between
+the
+visible
+and
+invisible
+worlds
+is
+a
+natural
+privilege
+and
+is
+established
+through
+a
+person
+of
+a
+certain
+psychic
+constitution
+capable
+of
+acting
+as
+an
+intermediary
+through
+whom
+discarnate
+intelligences
+can
+readily
+come
+en
+rapport
+with
+the
+physical
+plane
+Of
+the
+various
+phases
+of
+contact
+the
+most
+valuable
+for
+research
+purposes
+is
+that
+of
+unconscious
+trance
+whereby
+direct
+communication
+may
+be
+established
+with
+the
+invisible
+world
+and
+the
+mental
+condition
+of
+discarnate
+intelligences
+either
+advanced
+or
+ignorant
+may
+be
+ascertained
+Ignorant
+psychic
+experimentation
+may
+prove
+injurious
+when
+dabbled
+in
+by
+those
+who
+neglect
+the
+necessary
+precautions
+and
+lack
+understanding
+of
+the
+laws
+which
+govern
+the
+subject
+just
+as
+ignorance
+and
+disregard
+of
+the
+laws
+governing
+everyday
+life
+may
+prove
+dangerous
+The
+misuse
+of
+a
+thing
+is
+no
+argument
+against
+its
+use
+Psychical
+Research
+belongs
+especially
+to
+the
+domain
+of
+science
+common
+sense
+and
+discrimination
+are
+essentials
+in
+all
+such
+experimental
+work
+as
+well
+as
+a
+thorough
+mastery
+of
+the
+laws
+involved
+Under
+these
+conditions
+scientific
+research
+becomes
+an
+invaluable
+factor
+in
+the
+investigation
+of
+Spiritual
+Science
+CHAPTER
+II
+Psychical
+Research
+PSYCHICAL
+Research
+contains
+elements
+of
+the
+greatest
+importance
+to
+humanity
+and
+has
+already
+become
+a
+vital
+factor
+in
+the
+social
+life
+of
+the
+world
+at
+large
+It
+is
+undoubtedly
+true
+however
+that
+the
+various
+branches
+of
+research
+are
+endeavoring
+to
+classify
+their
+findings
+on
+purely
+psychophysiological
+bases
+The
+Psycho
+Analyst
+advances
+the
+theory
+that
+many
+of
+the
+psychoses
+have
+their
+seat
+or
+origin
+in
+some
+psychic
+lesion
+or
+trauma
+either
+concealed
+or
+forgotten
+The
+Analytical
+Pychologist
+by
+mental
+measurements
+and
+intelligence
+tests
+is
+making
+the
+segregation
+and
+classification
+of
+mental
+defectives
+possible
+So
+also
+the
+Neurologist
+and
+Psychiatrist
+are
+diligently
+seeking
+to
+isolate
+the
+etiological
+factors
+in
+the
+various
+neuroses
+mental
+aberrations
+and
+insanities
+and
+to
+ascertain
+the
+best
+methods
+of
+prevention
+and
+treatment
+While
+these
+branches
+of
+research
+are
+loath
+to
+accept
+the
+hypothesis
+of
+discarnate
+intelligences
+as
+contributing
+exciting
+factors
+in
+many
+of
+the
+psychoses
+and
+aberrations
+they
+are
+nevertheless
+rendering
+important
+service
+in
+uncovering
+and
+bringing
+to
+light
+the
+unstable
+qualities
+in
+the
+neurotic
+the
+susceptible
+and
+those
+predisposed
+to
+mental
+unbalance
+Psychical
+Research
+presents
+two
+general
+phases
+for
+investigation
+the
+Normal
+and
+the
+Abnormal
+The
+Normal
+phase
+from
+the
+standpoint
+of
+the
+physician
+as
+well
+as
+the
+minister
+deals
+among
+other
+issues
+with
+the
+question
+What
+becomes
+of
+the
+Dead
+This
+problem
+is
+of
+vital
+interest
+to
+the
+patient
+who
+lingers
+on
+the
+borderland
+of
+transition
+doubtful
+of
+the
+future
+or
+perhaps
+trembling
+in
+fear
+of
+his
+probable
+condition
+after
+the
+tomorrow
+of
+death
+Should
+it
+not
+be
+the
+noblest
+part
+of
+the
+physician
+s
+calling
+in
+such
+situations
+to
+be
+in
+a
+position
+to
+assure
+his
+patient
+from
+actual
+knowledge
+that
+there
+is
+no
+death
+but
+a
+birth
+into
+new
+fields
+of
+activity
+and
+opportunities
+in
+the
+higher
+mental
+spheres
+In
+the
+Abnormal
+phase
+of
+Psychical
+Research
+there
+is
+demand
+for
+broadest
+Possible
+knowledge
+on
+the
+part
+of
+the
+physician
+pertaining
+to
+the
+mysterious
+functioning
+of
+minds
+discarnated
+as
+well
+as
+incarnated
+Research
+in
+Abnormal
+as
+well
+as
+Normal
+psychology
+indubitably
+indicates
+not
+only
+the
+existence
+of
+spirits
+but
+also
+unquestionably
+demonstrates
+that
+such
+entities
+play
+an
+important
+role
+in
+the
+various
+psychoneuroses
+and
+insanities
+The
+physician
+undoubtedly
+comes
+in
+more
+intimate
+touch
+with
+the
+consequences
+of
+promiscuous
+dabbling
+in
+Psychical
+Research
+so
+frequently
+resulting
+in
+mental
+aberrations
+than
+any
+other
+person
+for
+he
+is
+usually
+the
+first
+one
+to
+be
+called
+into
+consultation
+and
+upon
+his
+decision
+depends
+largely
+the
+disposal
+of
+such
+an
+unfortunate
+victim
+For
+this
+reason
+if
+no
+other
+it
+should
+surely
+be
+not
+only
+the
+privilege
+but
+also
+the
+urgent
+duty
+of
+the
+physician
+to
+become
+thoroughly
+acquainted
+with
+the
+various
+phases
+of
+Psychical
+Research
+particularly
+its
+dangers
+in
+the
+hands
+of
+thoughtless
+investigators
+especially
+the
+predisposed
+psycho
+neurotic
+The
+alarming
+results
+often
+occurring
+in
+connection
+with
+Psychical
+Research
+prompted
+me
+to
+follow
+up
+a
+line
+of
+investigation
+to
+ascertain
+the
+underlying
+causes
+thereof
+for
+these
+also
+concern
+the
+physician
+The
+serious
+problem
+of
+alienation
+and
+mental
+derangement
+attending
+ignorant
+psychic
+experiments
+was
+first
+brought
+to
+my
+attention
+by
+the
+cases
+of
+several
+persons
+whose
+seemingly
+harmless
+experiences
+with
+automatic
+writing
+and
+the
+Ouija
+Board
+resulted
+in
+such
+wild
+insanity
+that
+committment
+to
+asylums
+was
+necessitated
+The
+first
+of
+these
+cases
+was
+that
+of
+Mrs
+Bl
+whose
+attempts
+at
+automatic
+writing
+led
+to
+mental
+derangement
+and
+altered
+personality
+Normally
+she
+was
+amiable
+pious
+quiet
+and
+refined
+but
+became
+boisterous
+and
+noisy
+romped
+about
+and
+danced
+used
+vile
+language
+and
+claiming
+she
+was
+an
+actress
+insisted
+upon
+dressing
+for
+the
+stage
+saying
+that
+she
+had
+to
+be
+at
+the
+theatre
+at
+a
+certain
+time
+or
+lose
+her
+position
+Finally
+she
+became
+so
+irresponsible
+that
+she
+was
+placed
+in
+an
+asylum
+Another
+case
+was
+Mrs
+Bn
+who
+through
+the
+practice
+of
+automatic
+writing
+changed
+from
+an
+artist
+and
+a
+lady
+of
+refinement
+to
+an
+altogether
+different
+and
+violent
+personality
+Screaming
+at
+the
+top
+of
+her
+voice
+she
+continually
+rubbed
+her
+temples
+and
+exclaimed
+God
+save
+me
+God
+save
+me
+Rushing
+into
+the
+street
+she
+knelt
+in
+the
+mud
+praying
+and
+refused
+food
+declaring
+that
+if
+she
+should
+eat
+before
+six
+o
+clock
+P
+M
+she
+would
+go
+to
+hell
+Mrs
+Sr
+who
+bad
+followed
+the
+same
+practices
+also
+became
+mentally
+deranged
+and
+violent
+necessitating
+police
+interference
+Rising
+in
+the
+night
+she
+posed
+in
+the
+window
+of
+her
+millinery
+shop
+as
+Napoleon
+whom
+she
+presumed
+herself
+to
+be
+and
+after
+committing
+many
+other
+irresponsible
+acts
+requiring
+restraint
+was
+sent
+to
+the
+Detention
+Hospital
+In
+like
+manner
+Mrs
+Wr
+became
+obsessed
+with
+hallucinations
+that
+God
+was
+constantly
+talking
+to
+her
+and
+condemning
+her
+for
+wrong
+acts
+of
+which
+he
+accused
+her
+after
+attempting
+suicide
+at
+the
+request
+of
+this
+so
+called
+God
+she
+was
+taken
+to
+the
+asylum
+Many
+other
+disastrous
+results
+which
+followed
+the
+use
+of
+the
+supposedly
+innocent
+Ouija
+Board
+came
+to
+my
+notice
+and
+my
+observations
+led
+me
+into
+research
+in
+psychic
+phenomena
+for
+a
+possible
+explanation
+of
+these
+strange
+occurrences
+My
+wife
+proved
+to
+be
+an
+excellent
+psychic
+intermediary
+and
+was
+easily
+controlled
+by
+discarnate
+intelligences
+In
+answer
+to
+her
+doubts
+concerning
+the
+right
+of
+disturbing
+the
+dead
+these
+intelligences
+asserted
+that
+a
+grievously
+wrong
+conception
+existed
+among
+mortals
+regarding
+the
+conditions
+prevailing
+after
+death
+They
+stated
+that
+there
+is
+in
+reality
+no
+death
+but
+a
+natural
+transition
+from
+the
+visible
+to
+the
+invisible
+world
+and
+that
+advanced
+spirits
+are
+ever
+striving
+to
+communicate
+with
+mortals
+to
+enlighten
+them
+concerning
+the
+higher
+possibilities
+which
+await
+the
+progressive
+spirit
+But
+death
+the
+freeing
+of
+the
+spirit
+from
+the
+body
+is
+so
+simple
+and
+natural
+that
+a
+great
+majority
+do
+not
+for
+a
+longer
+or
+shorter
+period
+realize
+the
+change
+and
+owing
+to
+a
+lack
+of
+education
+concerning
+the
+spiritual
+side
+of
+their
+natures
+they
+continue
+to
+remain
+in
+their
+earthly
+haunts
+They
+maintained
+that
+many
+such
+spirits
+were
+attracted
+to
+the
+magnetic
+aura
+of
+mortals
+although
+the
+spirit
+as
+well
+as
+the
+mortal
+might
+be
+unconscious
+of
+the
+intrusion
+and
+thus
+by
+obsessing
+or
+possessing
+their
+victims
+they
+ignorantly
+or
+maliciously
+became
+the
+cause
+of
+untold
+mischief
+often
+producing
+invalidism
+immorality
+crime
+and
+seeming
+insanity
+The
+risk
+of
+interference
+from
+this
+source
+constituted
+they
+said
+the
+gravest
+danger
+to
+the
+unwary
+novice
+in
+psychic
+research
+but
+to
+be
+in
+ignorance
+of
+these
+facts
+was
+an
+even
+greater
+risk
+especially
+in
+the
+case
+of
+the
+susceptible
+neurotic
+These
+intelligences
+also
+stated
+that
+by
+a
+system
+of
+transfer
+that
+is
+by
+attracting
+such
+obsessing
+entities
+from
+the
+victim
+to
+a
+psychic
+intermediary
+the
+correctness
+of
+the
+hypothesis
+could
+be
+demonstrated
+and
+conditions
+could
+be
+shown
+as
+they
+actually
+exist
+After
+this
+transference
+of
+psychoses
+the
+victims
+would
+be
+relieved
+and
+the
+obsessing
+spirits
+could
+then
+be
+reached
+by
+the
+advanced
+spirits
+who
+would
+care
+for
+them
+and
+instruct
+them
+regarding
+the
+higher
+laws
+of
+life
+They
+claimed
+they
+had
+found
+my
+wife
+to
+be
+a
+suitable
+instrument
+for
+such
+experimentation
+and
+proposed
+that
+if
+I
+would
+cooperate
+with
+them
+by
+caring
+for
+and
+instructing
+these
+ignorant
+spirits
+as
+they
+allowed
+them
+to
+take
+temporary
+but
+complete
+possession
+of
+my
+wife
+s
+body
+without
+any
+injury
+to
+her
+they
+would
+prove
+their
+assertions
+were
+correct
+Desirous
+of
+learning
+the
+truth
+or
+falsity
+of
+such
+important
+claims
+which
+if
+true
+would
+have
+a
+great
+bearing
+on
+the
+cause
+of
+much
+that
+is
+otherwise
+baffling
+in
+criminology
+as
+well
+as
+in
+psycho
+pathology
+we
+accepted
+what
+seemed
+a
+hazardous
+undertaking
+In
+order
+to
+carry
+out
+their
+purpose
+the
+Guiding
+Intelligences
+allowed
+many
+manifestations
+to
+take
+place
+often
+very
+unexpectedly
+and
+some
+of
+these
+occurred
+while
+I
+was
+pursuing
+my
+early
+medical
+studies
+One
+day
+I
+left
+home
+without
+any
+intention
+of
+immediately
+beginning
+my
+first
+dissecting
+work
+therefore
+my
+wife
+s
+subconscious
+mind
+could
+not
+possibly
+have
+taken
+any
+part
+in
+what
+transpired
+later
+The
+students
+were
+required
+to
+dissect
+a
+lateral
+half
+of
+a
+body
+the
+first
+subject
+was
+a
+man
+about
+sixty
+years
+of
+age
+and
+that
+afternoon
+I
+began
+dissecting
+on
+a
+lower
+limb
+I
+returned
+home
+at
+about
+five
+o
+clock
+and
+had
+scarcely
+entered
+the
+door
+when
+my
+wife
+was
+apparently
+taken
+with
+a
+sudden
+illness
+and
+complaining
+of
+feeling
+strange
+staggered
+as
+though
+about
+to
+fall
+As
+I
+placed
+my
+hand
+on
+her
+shoulder
+she
+drew
+herself
+up
+and
+became
+entranced
+by
+a
+foreign
+intelligence
+who
+said
+with
+threatening
+gesture
+What
+do
+you
+mean
+by
+cutting
+me
+I
+answered
+that
+I
+was
+not
+aware
+of
+cutting
+any
+one
+but
+the
+spirit
+angrily
+replied
+Of
+course
+you
+are
+You
+are
+cutting
+on
+my
+leg
+Realizing
+that
+the
+spirit
+owner
+of
+the
+body
+on
+which
+I
+had
+been
+operating
+had
+followed
+me
+home
+I
+began
+to
+parley
+with
+him
+first
+placing
+my
+wife
+in
+a
+chair
+To
+this
+the
+spirit
+vigorously
+objected
+saying
+that
+I
+had
+no
+business
+to
+touch
+him
+To
+my
+answer
+that
+I
+had
+a
+right
+to
+touch
+my
+own
+wife
+the
+entity
+retorted
+Your
+wife
+What
+are
+you
+talking
+about
+I
+am
+no
+woman
+I
+m
+a
+man
+I
+explained
+that
+he
+had
+passed
+out
+of
+his
+physical
+body
+and
+was
+controlling
+the
+body
+of
+my
+wife
+and
+that
+his
+spirit
+was
+here
+and
+his
+body
+at
+the
+college
+When
+he
+finally
+seemed
+to
+realize
+this
+I
+said
+Suppose
+I
+were
+now
+cutting
+on
+your
+body
+at
+the
+college
+that
+could
+not
+kill
+you
+since
+you
+yourself
+are
+here
+The
+spirit
+admitted
+that
+this
+seemed
+reasonable
+and
+said
+I
+guess
+I
+must
+be
+what
+they
+call
+dead
+so
+I
+won
+t
+have
+any
+more
+use
+for
+my
+old
+body
+If
+you
+can
+learn
+anything
+by
+cutting
+on
+it
+go
+ahead
+and
+cut
+away
+Then
+he
+added
+suddenly
+Say
+Mister
+give
+me
+a
+chew
+of
+tobacco
+I
+told
+him
+that
+I
+had
+none
+and
+then
+he
+begged
+for
+a
+pipe
+saying
+I
+m
+dying
+for
+a
+smoke
+This
+request
+was
+of
+course
+also
+refused
+The
+fact
+that
+Mrs
+Wickland
+has
+always
+abhorred
+the
+sight
+of
+any
+one
+chewing
+tobacco
+precludes
+the
+possibility
+of
+her
+subconscious
+mind
+playing
+any
+role
+in
+this
+episode
+After
+a
+more
+detailed
+explanation
+of
+the
+fact
+that
+he
+was
+actually
+so
+called
+dead
+the
+spirit
+realized
+his
+true
+condition
+and
+left
+Subsequent
+examination
+of
+the
+teeth
+of
+the
+cadaver
+indicated
+that
+the
+man
+had
+been
+an
+inveterate
+tobacco
+user
+in
+life
+Upon
+another
+occasion
+when
+I
+had
+been
+appointed
+assistant
+demonstrator
+for
+a
+class
+of
+students
+in
+dissecting
+the
+body
+of
+a
+colored
+man
+had
+been
+selected
+as
+a
+subject
+but
+the
+body
+had
+not
+yet
+been
+disturbed
+when
+one
+evening
+Mrs
+Wickland
+became
+entranced
+and
+a
+strange
+spirit
+speaking
+through
+her
+exclaimed
+You
+ain
+t
+goin
+to
+cut
+on
+dis
+colored
+man
+Boss
+I
+told
+him
+that
+the
+world
+called
+him
+dead
+that
+he
+was
+not
+in
+his
+old
+body
+but
+was
+now
+controlling
+a
+woman
+s
+body
+He
+would
+not
+believe
+this
+and
+when
+I
+showed
+him
+my
+wife
+s
+hands
+saying
+they
+were
+not
+colored
+but
+white
+he
+replied
+I
+se
+got
+whitewash
+on
+dem
+whitewashin
+is
+my
+business
+This
+spirit
+proved
+to
+be
+very
+obstinate
+offering
+a
+variety
+of
+excuses
+and
+explanations
+rather
+than
+accept
+the
+truth
+but
+he
+was
+finally
+convinced
+and
+departed
+Another
+incident
+will
+still
+further
+demonstrate
+to
+what
+a
+seemingly
+unbelievable
+degree
+spirits
+may
+cling
+to
+their
+earthly
+bodies
+through
+ignorance
+of
+their
+transition
+or
+so
+called
+death
+In
+the
+dissecting
+room
+was
+the
+body
+of
+a
+woman
+about
+forty
+years
+of
+age
+who
+had
+died
+at
+the
+Cook
+County
+Hospital
+Chicago
+the
+previous
+June
+In
+January
+seven
+months
+after
+her
+death
+a
+number
+of
+students
+myself
+included
+were
+assigned
+this
+subject
+for
+dissection
+I
+could
+not
+be
+present
+the
+first
+evening
+but
+the
+others
+began
+their
+work
+Nothing
+was
+ever
+said
+to
+me
+of
+what
+occurred
+during
+those
+few
+hours
+but
+for
+some
+reason
+unknown
+to
+me
+the
+other
+students
+never
+touched
+that
+subject
+again
+The
+next
+day
+there
+was
+no
+school
+in
+the
+afternoon
+so
+I
+began
+to
+dissect
+alone
+working
+on
+the
+arm
+and
+neck
+The
+dissecting
+room
+was
+in
+the
+rear
+of
+a
+long
+basement
+and
+very
+quiet
+but
+once
+I
+distinctly
+heard
+a
+voice
+say
+Don
+t
+murder
+me
+The
+voice
+sounded
+faintly
+as
+from
+a
+distance
+but
+since
+I
+am
+not
+in
+the
+least
+superstitious
+and
+not
+at
+all
+inclined
+to
+credit
+small
+incidents
+to
+the
+actions
+of
+spirits
+I
+concluded
+that
+it
+probably
+came
+from
+children
+in
+the
+street
+although
+I
+had
+not
+heard
+any
+playing
+nearby
+The
+following
+afternoon
+I
+was
+again
+working
+alone
+when
+I
+was
+rather
+startled
+by
+a
+rustling
+sound
+coming
+from
+a
+crumpled
+newspaper
+lying
+on
+the
+floor
+a
+sound
+something
+like
+that
+produced
+when
+a
+newspaper
+is
+crushed
+but
+I
+paid
+no
+particular
+attention
+to
+it
+and
+did
+not
+mention
+these
+occurrences
+to
+my
+wife
+The
+episodes
+had
+quite
+passed
+out
+of
+my
+mind
+until
+a
+few
+days
+later
+We
+were
+holding
+a
+psychic
+circle
+in
+our
+home
+and
+our
+invisible
+co
+workers
+had
+already
+departed
+when
+I
+noticed
+that
+my
+wife
+still
+remained
+in
+a
+semi
+comatose
+condition
+I
+stepped
+up
+to
+her
+to
+ascertain
+the
+reason
+when
+the
+controlling
+spirit
+rose
+suddenly
+struck
+at
+me
+angrily
+and
+said
+I
+have
+some
+bones
+to
+pick
+with
+you
+After
+a
+period
+of
+struggle
+with
+the
+stranger
+I
+asked
+what
+the
+trouble
+was
+Why
+do
+you
+want
+to
+kill
+me
+the
+entity
+demanded
+I
+am
+not
+killing
+any
+one
+I
+answered
+Yes
+you
+are
+you
+are
+cutting
+on
+my
+arm
+and
+neck
+I
+shouted
+at
+you
+not
+to
+murder
+me
+and
+I
+struck
+that
+paper
+on
+the
+floor
+to
+frighten
+you
+but
+you
+wouldn
+t
+pay
+any
+attention
+Then
+laughing
+boisterously
+the
+spirit
+added
+with
+great
+hilarity
+But
+I
+seared
+the
+other
+fellows
+It
+was
+necessary
+to
+explain
+at
+great
+length
+the
+actual
+situation
+of
+the
+spirit
+who
+said
+her
+name
+was
+Minnie
+Morgan
+but
+finally
+she
+understood
+and
+left
+promising
+to
+seek
+a
+higher
+life
+The
+ease
+with
+which
+spirits
+assume
+control
+of
+the
+psychic
+intermediary
+Mrs
+Wickland
+is
+so
+perfect
+that
+the
+majority
+of
+them
+at
+first
+fail
+to
+comprehend
+the
+fact
+that
+they
+are
+so
+called
+dead
+and
+are
+temporarily
+occupying
+the
+body
+of
+another
+Those
+intelligences
+whose
+reasoning
+faculties
+are
+alert
+can
+See
+Chapter
+Page
+Spirit
+Minnie
+Morgan
+generally
+be
+made
+to
+realize
+that
+their
+situation
+is
+unusual
+when
+attention
+is
+called
+to
+the
+dissimilarity
+between
+their
+own
+former
+bodily
+features
+hands
+and
+feet
+as
+well
+as
+clothes
+and
+those
+of
+the
+psychic
+This
+is
+especially
+so
+when
+the
+spirit
+is
+a
+man
+for
+the
+difference
+will
+then
+be
+more
+readily
+noticed
+Following
+the
+statement
+that
+the
+body
+which
+is
+being
+controlled
+belongs
+to
+my
+wife
+spirits
+usually
+retort
+I
+am
+not
+your
+wife
+and
+a
+great
+deal
+of
+explanation
+is
+required
+before
+they
+can
+be
+brought
+to
+a
+recognition
+of
+the
+fact
+that
+they
+are
+in
+temporary
+possession
+of
+another
+s
+body
+On
+the
+other
+hand
+there
+are
+spirits
+fixed
+and
+rooted
+in
+obstinate
+skepticism
+who
+stubbornly
+refuse
+to
+understand
+that
+they
+have
+made
+the
+transition
+out
+of
+the
+physical
+These
+will
+not
+listen
+to
+reason
+and
+fail
+to
+be
+convinced
+of
+their
+changed
+condition
+even
+when
+a
+mirror
+is
+held
+before
+them
+declaring
+that
+they
+have
+been
+hypnotized
+and
+prove
+so
+obdurate
+that
+they
+must
+be
+forced
+to
+leave
+and
+are
+taken
+in
+charge
+by
+the
+invisible
+co
+workers
+The
+transference
+of
+the
+mental
+aberration
+or
+psychosis
+from
+a
+patient
+to
+the
+psychic
+intermediary
+Mrs
+Wickland
+is
+facilitated
+by
+the
+use
+of
+static
+electricity
+which
+is
+applied
+to
+the
+patient
+frequently
+in
+the
+presence
+of
+the
+psychic
+Although
+this
+electricity
+is
+harmless
+to
+the
+patient
+it
+is
+exceedingly
+effective
+for
+the
+obsessing
+spirit
+cannot
+long
+resist
+such
+electrical
+treatment
+and
+is
+dislodged
+Induced
+by
+our
+invisible
+helpers
+the
+spirit
+may
+then
+entrance
+the
+psychic
+when
+it
+becomes
+possible
+to
+come
+into
+direct
+contact
+with
+the
+entity
+and
+an
+endeavor
+is
+made
+to
+bring
+him
+to
+a
+realization
+of
+his
+true
+condition
+and
+of
+his
+higher
+possibilities
+He
+is
+then
+removed
+and
+cared
+for
+by
+the
+advanced
+spirits
+and
+Mrs
+Wickland
+again
+returns
+to
+her
+normal
+self
+In
+many
+cases
+remarkable
+evidence
+that
+discarnated
+entities
+were
+the
+offending
+cause
+of
+aberration
+has
+been
+obtained
+by
+a
+system
+of
+experimental
+concentration
+in
+a
+psychic
+circle
+Obsessing
+spirits
+have
+been
+dislodged
+from
+victims
+frequently
+residing
+at
+a
+distance
+conveyed
+to
+the
+circle
+by
+the
+co
+operating
+intelligences
+and
+allowed
+to
+control
+the
+psychic
+Such
+spirits
+often
+complain
+of
+having
+been
+driven
+away
+yet
+are
+ignorant
+of
+being
+spirits
+or
+of
+having
+controlled
+or
+influenced
+anyone
+But
+the
+similarity
+between
+the
+actions
+of
+the
+controlling
+spirit
+and
+the
+symptoms
+of
+the
+patient
+as
+well
+as
+the
+relief
+obtained
+by
+the
+latter
+through
+this
+removal
+indubitably
+prove
+the
+spirit
+to
+have
+been
+the
+cause
+of
+the
+disturbance
+In
+many
+cases
+the
+identity
+of
+the
+spirit
+has
+been
+unquestionably
+authenticated
+After
+this
+transfer
+and
+permanent
+dislodgment
+of
+the
+obsessing
+spirit
+the
+patient
+gradually
+recovers
+although
+there
+may
+be
+a
+number
+of
+spirits
+requiring
+removal
+from
+the
+same
+patient
+It
+may
+be
+asked
+why
+advanced
+intelligences
+do
+not
+take
+charge
+of
+earthbound
+spirits
+and
+convert
+them
+without
+having
+them
+first
+control
+a
+psychic
+intermediary
+Many
+of
+these
+ignorant
+spirits
+cannot
+be
+reached
+by
+the
+intelligent
+spirits
+until
+they
+come
+in
+contact
+with
+physical
+conditions
+when
+they
+are
+compelled
+to
+realize
+their
+own
+situation
+and
+are
+then
+started
+on
+the
+road
+to
+progression
+While
+the
+control
+of
+the
+Psychic
+by
+an
+ignorant
+spirit
+in
+a
+circle
+generally
+brings
+the
+spirit
+to
+an
+understanding
+and
+is
+of
+interest
+to
+the
+investigator
+at
+the
+same
+time
+groups
+of
+other
+spirits
+in
+darkness
+are
+brought
+to
+profit
+by
+the
+lesson
+conveyed
+through
+the
+actions
+of
+the
+controlling
+spirit
+Many
+controlling
+spirits
+act
+as
+if
+demented
+and
+are
+difficult
+to
+reason
+with
+this
+condition
+being
+due
+to
+false
+doctrines
+fixed
+ideas
+and
+various
+notions
+imbibed
+in
+physical
+life
+They
+are
+often
+unruly
+and
+boisterous
+when
+it
+is
+necessary
+to
+control
+them
+by
+holding
+the
+hands
+of
+the
+psychic
+to
+keep
+them
+in
+restraint
+Upon
+realizing
+their
+true
+condition
+many
+spirits
+experience
+a
+sensation
+of
+dying
+which
+signifies
+that
+they
+are
+losing
+control
+of
+the
+psychic
+Other
+spirits
+again
+are
+in
+a
+sleepy
+stupor
+wishing
+to
+be
+left
+alone
+and
+severe
+language
+is
+at
+times
+required
+to
+arouse
+them
+as
+will
+be
+observed
+in
+the
+records
+following
+In
+these
+records
+reference
+is
+often
+made
+to
+a
+dungeon
+in
+which
+refractory
+spirits
+may
+be
+placed
+and
+controlling
+spirits
+sometimes
+complain
+of
+having
+been
+kept
+in
+a
+dungeon
+Due
+to
+a
+certain
+psychic
+law
+intelligent
+spirits
+have
+the
+faculty
+of
+placing
+about
+an
+ignorant
+spirit
+a
+condition
+simulating
+a
+prison
+an
+impenetrable
+cell
+like
+room
+from
+which
+there
+is
+no
+escape
+Herein
+stubborn
+spirits
+must
+stay
+seeing
+nothing
+but
+the
+reflection
+of
+their
+own
+personalities
+their
+past
+actions
+appearing
+before
+the
+mind
+s
+eye
+until
+they
+become
+repentant
+and
+show
+a
+willingness
+to
+adapt
+themselves
+to
+the
+new
+condition
+and
+to
+conform
+to
+the
+spiritual
+laws
+of
+progression
+The
+nature
+of
+Mrs
+Wickland
+s
+psychism
+is
+that
+of
+unconscious
+trance
+her
+eyes
+are
+closed
+and
+her
+own
+mentality
+is
+held
+in
+abeyance
+in
+a
+sleep
+state
+for
+the
+time
+being
+She
+herself
+has
+no
+recollection
+of
+anything
+that
+transpires
+during
+this
+period
+Mrs
+Wickland
+is
+not
+subject
+to
+any
+negativism
+between
+these
+experiences
+she
+is
+at
+all
+times
+her
+rational
+self
+clear
+minded
+and
+positive
+and
+after
+thirty
+five
+years
+of
+psychic
+work
+has
+not
+suffered
+impairment
+or
+detriment
+of
+any
+kind
+She
+is
+constantly
+protected
+from
+the
+invisible
+side
+by
+the
+supervision
+of
+a
+group
+of
+strong
+intelligences
+known
+as
+The
+Mercy
+Band
+which
+is
+guiding
+this
+work
+endeavoring
+to
+bring
+humanity
+to
+a
+realization
+of
+the
+simplicity
+of
+the
+transition
+called
+death
+and
+the
+importance
+of
+a
+rational
+understanding
+of
+what
+becomes
+of
+the
+spirits
+The
+purpose
+of
+our
+work
+has
+been
+to
+obtain
+reliable
+and
+incontestable
+evidence
+at
+first
+hand
+regarding
+after
+death
+conditions
+and
+detailed
+reports
+of
+hundreds
+of
+experiences
+have
+been
+stenographically
+made
+in
+order
+to
+record
+the
+exact
+situation
+of
+the
+communicating
+intelligences
+CHAPTER
+III
+Subconscious
+Mind
+and
+Auto
+Suggestion
+Hypotheses
+Untenable
+DURING
+thirty
+years
+of
+indefatigable
+research
+among
+the
+dead
+such
+startling
+conditions
+have
+been
+revealed
+that
+it
+seems
+incredible
+intelligent
+reasoners
+along
+other
+lines
+of
+thought
+could
+have
+so
+long
+ignored
+the
+simple
+facts
+which
+can
+so
+readily
+be
+verified
+There
+is
+utter
+impossibility
+of
+fraud
+in
+these
+experiences
+foreign
+languages
+totally
+unknown
+to
+Mrs
+Wickland
+are
+spoken
+expressions
+never
+heard
+by
+her
+are
+used
+while
+the
+identity
+of
+the
+controlling
+spirits
+has
+again
+and
+again
+been
+verified
+and
+corroborations
+innumerable
+have
+been
+made
+On
+one
+occasion
+I
+conversed
+with
+twenty
+one
+different
+spirits
+who
+spoke
+through
+my
+wife
+the
+majority
+giving
+me
+satisfactory
+evidence
+of
+being
+certain
+friends
+and
+relatives
+known
+to
+me
+while
+they
+were
+incarnated
+In
+all
+they
+spoke
+six
+different
+languages
+while
+my
+wife
+speaks
+only
+Swedish
+and
+English
+From
+one
+patient
+Mrs
+A
+who
+was
+brought
+to
+us
+from
+Chicago
+thirteen
+different
+spirits
+were
+dislodged
+and
+allowed
+to
+control
+Mrs
+Wickland
+and
+of
+these
+seven
+were
+recognized
+by
+the
+patient
+s
+mother
+Mrs
+H
+W
+as
+relatives
+or
+friends
+well
+known
+to
+her
+during
+their
+earth
+lives
+One
+was
+a
+minister
+formerly
+pastor
+of
+the
+Methodist
+church
+of
+which
+Mrs
+H
+W
+was
+a
+member
+who
+had
+been
+killed
+in
+a
+railroad
+accident
+nine
+years
+previous
+but
+was
+still
+unconscious
+of
+the
+fact
+another
+was
+her
+sister
+in
+law
+there
+were
+also
+three
+elderly
+women
+family
+friends
+for
+years
+a
+neighbor
+boy
+and
+the
+mother
+in
+law
+of
+the
+patient
+all
+entirely
+unknown
+to
+Mrs
+Wickland
+Mrs
+H
+W
+conversed
+at
+length
+with
+each
+one
+as
+they
+spoke
+through
+Mrs
+Wickland
+verifying
+innumerable
+statements
+made
+by
+the
+spirits
+and
+assisted
+in
+bringing
+them
+to
+a
+realization
+of
+their
+changed
+condition
+and
+of
+the
+fact
+that
+they
+had
+been
+obsessing
+her
+daughter
+This
+patient
+is
+today
+entirely
+well
+and
+actively
+occupied
+with
+social
+musical
+and
+family
+affairs
+Another
+case
+will
+show
+clearly
+the
+transfer
+of
+psychosis
+from
+patient
+to
+intermediary
+and
+the
+impossibility
+of
+either
+sub
+See
+Chap
+Materialism
+Page
+Spirit
+Frank
+Bergquist
+Patient
+Mrs
+A
+Chap
+Orthodoxy
+Page
+Spirit
+J
+Nelson
+Patient
+Mrs
+A
+conscious
+mind
+or
+multiple
+personalities
+playing
+any
+role
+as
+far
+as
+the
+psychic
+is
+concerned
+One
+summer
+evening
+we
+were
+called
+to
+the
+home
+of
+Mrs
+M
+a
+lady
+of
+culture
+and
+refinement
+she
+was
+a
+musician
+of
+high
+rank
+and
+when
+the
+social
+demands
+made
+upon
+her
+proved
+too
+great
+she
+suffered
+a
+nervous
+breakdown
+She
+had
+become
+intractable
+and
+for
+six
+weeks
+had
+been
+in
+such
+a
+raving
+condition
+that
+her
+physicians
+had
+been
+unable
+to
+relieve
+her
+and
+day
+and
+night
+nurses
+were
+in
+constant
+attendance
+We
+found
+the
+patient
+sitting
+up
+in
+her
+bed
+crying
+one
+minute
+like
+a
+forlorn
+child
+and
+again
+screaming
+in
+fear
+Matilla
+Matilla
+Then
+suddenly
+fighting
+and
+struggling
+she
+would
+talk
+a
+wild
+gibberish
+of
+English
+and
+Spanish
+the
+latter
+a
+language
+of
+which
+she
+had
+no
+knowledge
+Mrs
+Wickland
+immediately
+gave
+her
+psychic
+diagnosis
+saying
+the
+case
+was
+unquestionably
+one
+of
+obsession
+and
+this
+was
+unexpectedly
+confirmed
+when
+Mrs
+Wickland
+who
+was
+standing
+at
+the
+foot
+of
+the
+bed
+with
+wraps
+on
+ready
+to
+leave
+was
+found
+to
+be
+suddenly
+entranced
+We
+placed
+her
+on
+a
+davenport
+in
+the
+music
+room
+where
+for
+two
+hours
+I
+talked
+in
+turn
+with
+several
+spirits
+who
+had
+just
+been
+attracted
+from
+the
+patient
+There
+were
+three
+spirits
+a
+girl
+named
+Mary
+her
+suitor
+an
+American
+and
+his
+Mexican
+rival
+Matilla
+Both
+of
+the
+men
+had
+vehemently
+loved
+the
+girl
+and
+as
+fiercely
+hated
+each
+other
+In
+a
+jealous
+rage
+one
+had
+killed
+the
+girl
+and
+then
+in
+a
+desperate
+fight
+the
+two
+rivals
+had
+killed
+each
+other
+All
+were
+unaware
+of
+being
+dead
+although
+Mary
+said
+weeping
+wretchedly
+I
+thought
+they
+were
+going
+to
+kill
+each
+other
+but
+here
+they
+are
+still
+fighting
+This
+tragedy
+of
+love
+hatred
+and
+jealousy
+had
+not
+ended
+with
+physical
+death
+the
+group
+had
+unconsciously
+been
+drawn
+into
+the
+psychic
+atmosphere
+of
+the
+patient
+and
+the
+violent
+fighting
+had
+continued
+within
+her
+aura
+Since
+her
+nervous
+resistance
+was
+exceedingly
+low
+at
+this
+time
+one
+after
+the
+other
+had
+usurped
+her
+physical
+body
+with
+a
+resulting
+disturbance
+that
+was
+unexplainable
+by
+her
+attendants
+With
+great
+difficulty
+the
+three
+spirits
+were
+convinced
+that
+they
+had
+lost
+their
+physical
+bodies
+but
+at
+last
+they
+recognized
+the
+truth
+and
+were
+taken
+away
+by
+our
+invisible
+co
+workers
+Meanwhile
+the
+patient
+had
+arisen
+and
+speaking
+rationally
+to
+the
+astonished
+nurse
+walked
+quietly
+about
+her
+room
+Presently
+she
+said
+I
+am
+going
+to
+sleep
+well
+tonight
+and
+returning
+to
+bed
+fell
+asleep
+without
+the
+usual
+sedatives
+and
+rested
+quietly
+throughout
+the
+night
+The
+following
+day
+attended
+by
+a
+nurse
+she
+was
+brought
+to
+our
+home
+we
+dismissed
+the
+nurse
+discarded
+her
+medicines
+and
+after
+an
+electrical
+treatment
+the
+patient
+had
+her
+dinner
+in
+the
+general
+dining
+room
+with
+the
+other
+patients
+and
+that
+evening
+attended
+a
+function
+given
+in
+our
+social
+hall
+Another
+spirit
+was
+removed
+from
+her
+the
+next
+day
+this
+was
+a
+little
+girl
+who
+had
+been
+killed
+in
+the
+San
+Francisco
+earthquake
+and
+who
+cried
+constantly
+saying
+she
+was
+lost
+in
+the
+dark
+It
+is
+needless
+to
+add
+that
+she
+was
+comforted
+and
+promptly
+cared
+for
+by
+spirit
+friends
+who
+had
+been
+unable
+to
+reach
+her
+while
+she
+was
+enmeshed
+in
+the
+aura
+of
+a
+psychic
+sensitive
+After
+some
+months
+of
+treatment
+rest
+and
+recuperation
+the
+patient
+returned
+to
+her
+home
+and
+resumed
+her
+normal
+life
+again
+One
+of
+our
+early
+experiences
+in
+Chicago
+occurred
+on
+the
+of
+November
+During
+one
+of
+our
+psychic
+circles
+Mrs
+Wickland
+entranced
+by
+a
+strange
+entity
+fell
+prostrate
+to
+the
+floor
+and
+remained
+in
+a
+comatose
+condition
+for
+some
+time
+The
+spirit
+was
+at
+last
+brought
+to
+the
+front
+and
+acted
+as
+though
+in
+great
+pain
+repeatedly
+saying
+Why
+didn
+t
+I
+take
+more
+carbolic
+acid
+I
+want
+to
+die
+I
+m
+so
+tired
+of
+living
+In
+a
+weak
+voice
+the
+spirit
+complained
+of
+the
+dense
+darkness
+all
+about
+and
+was
+unable
+to
+see
+an
+electric
+light
+shining
+directly
+into
+her
+face
+She
+whispered
+faintly
+My
+poor
+son
+and
+when
+pressed
+for
+information
+said
+that
+her
+name
+was
+Mary
+Rose
+and
+that
+she
+lived
+at
+South
+Green
+Street
+a
+street
+entirely
+unknown
+to
+us
+at
+that
+time
+At
+first
+she
+could
+not
+remember
+any
+date
+but
+when
+asked
+Is
+it
+November
+she
+replied
+No
+that
+is
+next
+week
+Life
+had
+been
+a
+bitter
+disappointment
+to
+her
+she
+had
+suffered
+constantly
+from
+chronic
+abdominal
+ailments
+and
+finally
+resolving
+to
+end
+her
+miserable
+existence
+she
+had
+taken
+poison
+She
+could
+not
+at
+first
+realize
+that
+she
+had
+succeeded
+in
+destroying
+her
+physical
+body
+for
+like
+most
+suicides
+she
+was
+in
+total
+ignorance
+of
+the
+indestructibility
+of
+life
+and
+the
+reality
+of
+the
+hereafter
+When
+the
+real
+purpose
+of
+life
+experience
+and
+suffering
+had
+been
+made
+clearer
+to
+her
+she
+was
+overcome
+with
+repentance
+and
+offered
+a
+sincere
+prayer
+for
+forgiveness
+Then
+her
+spiritual
+sight
+opened
+slightly
+and
+she
+saw
+dimly
+the
+spirit
+figure
+of
+her
+grandmother
+who
+had
+come
+to
+take
+her
+to
+the
+spirit
+world
+Subsequent
+inquiry
+at
+the
+address
+given
+by
+the
+spirit
+proved
+her
+statements
+to
+be
+true
+a
+woman
+by
+the
+name
+given
+had
+lived
+at
+this
+house
+she
+still
+had
+a
+son
+living
+there
+and
+we
+were
+told
+that
+Mrs
+Rose
+had
+been
+taken
+to
+the
+Cook
+County
+Hospital
+and
+had
+died
+there
+the
+week
+before
+Upon
+investigation
+at
+the
+hospital
+we
+found
+further
+verification
+of
+the
+facts
+and
+were
+given
+a
+copy
+of
+the
+record
+of
+the
+case
+Cook
+County
+Hospital
+Chicago
+Ills
+Mary
+Rose
+Admitted
+November
+Died
+November
+Carbolic
+Acid
+poisoning
+No
+Another
+case
+will
+show
+that
+identification
+of
+a
+spirit
+is
+often
+possible
+Mrs
+Fl
+a
+patient
+who
+had
+been
+declared
+incurably
+insane
+by
+several
+physicians
+was
+a
+refined
+lady
+of
+gentle
+disposition
+who
+had
+become
+very
+wild
+and
+unmanageable
+swearing
+constantly
+and
+fighting
+with
+such
+violence
+that
+several
+persons
+were
+required
+to
+restrain
+her
+She
+was
+also
+subject
+to
+coma
+states
+again
+to
+fainting
+spells
+would
+refuse
+food
+announce
+that
+she
+had
+been
+married
+above
+by
+celestial
+powers
+and
+used
+extraordinarily
+vile
+language
+these
+various
+phases
+alternated
+constantly
+but
+no
+full
+proof
+of
+obsession
+was
+evidenced
+until
+one
+day
+when
+Mrs
+Fl
+lost
+all
+power
+of
+speech
+and
+mumbling
+idiotically
+simulated
+perfectly
+a
+deaf
+and
+dumb
+person
+At
+this
+time
+a
+gentleman
+from
+an
+adjoining
+state
+came
+to
+the
+house
+to
+visit
+a
+patient
+and
+shortly
+after
+his
+arrival
+the
+nurse
+who
+attended
+Mrs
+Fl
+reported
+that
+the
+patient
+had
+again
+changed
+and
+was
+talking
+like
+a
+little
+child
+So
+striking
+was
+this
+alteration
+that
+the
+gentleman
+was
+asked
+to
+step
+into
+the
+room
+to
+observe
+the
+patient
+He
+was
+a
+total
+stranger
+to
+her
+but
+as
+he
+entered
+the
+room
+she
+pointed
+to
+him
+and
+said
+in
+a
+high
+childish
+voice
+I
+know
+that
+man
+He
+used
+to
+put
+bows
+on
+my
+shoulders
+Arid
+he
+pulled
+my
+toofies
+He
+took
+me
+to
+a
+gypsy
+camp
+too
+He
+lived
+right
+across
+the
+street
+from
+me
+and
+he
+used
+to
+call
+me
+Rosebud
+I
+m
+four
+years
+old
+The
+astonished
+gentleman
+corroborated
+every
+statement
+saying
+that
+he
+had
+known
+such
+a
+child
+in
+his
+home
+town
+in
+Iowa
+but
+that
+she
+had
+died
+the
+year
+before
+He
+explained
+that
+he
+was
+very
+fond
+of
+children
+and
+had
+on
+several
+occasions
+taken
+the
+child
+to
+a
+gypsy
+camp
+and
+that
+whenever
+he
+bought
+taffy
+on
+a
+stick
+for
+the
+little
+girl
+he
+would
+tug
+at
+the
+stick
+while
+she
+was
+eating
+the
+candy
+and
+playfully
+threaten
+to
+pull
+her
+teeth
+It
+was
+evident
+that
+affection
+had
+attracted
+the
+spirit
+child
+to
+her
+friend
+and
+that
+she
+found
+in
+Mrs
+Fl
+a
+vehicle
+through
+which
+she
+could
+make
+her
+presence
+known
+to
+the
+gentleman
+The
+patient
+was
+relieved
+of
+this
+spirit
+and
+gradually
+of
+other
+obsessing
+influences
+and
+several
+months
+later
+was
+pronounced
+entirely
+competent
+to
+sign
+legal
+papers
+being
+declared
+normal
+and
+sane
+by
+a
+judge
+and
+jury
+Another
+case
+in
+point
+was
+that
+of
+Mrs
+who
+was
+a
+cook
+in
+a
+restaurant
+She
+had
+observed
+a
+waitress
+acting
+queerly
+laboring
+under
+delusions
+and
+hallucinations
+and
+brought
+her
+to
+my
+office
+After
+an
+electrical
+treatment
+the
+patient
+declared
+she
+felt
+greatly
+relieved
+and
+returned
+to
+her
+home
+But
+that
+night
+Mrs
+herself
+became
+disturbed
+by
+an
+unaccountable
+condition
+which
+prevented
+her
+from
+sleeping
+and
+her
+restlessness
+continued
+until
+ten
+o
+clock
+the
+following
+morning
+when
+in
+the
+midst
+of
+her
+preparations
+for
+dinner
+she
+suddenly
+became
+wild
+tore
+her
+hair
+and
+threatened
+to
+harm
+herself
+I
+was
+sent
+for
+and
+arriving
+found
+Mrs
+raving
+in
+a
+demented
+condition
+complaining
+of
+being
+chased
+here
+and
+there
+and
+being
+unable
+to
+find
+a
+resting
+place
+Suspecting
+the
+presence
+of
+an
+invisible
+entity
+I
+placed
+Mrs
+in
+a
+chair
+pinioned
+her
+arms
+to
+prevent
+a
+struggle
+and
+after
+several
+remarks
+the
+entity
+declared
+it
+was
+a
+man
+but
+denied
+being
+dead
+or
+obsessing
+a
+woman
+The
+spirit
+said
+his
+name
+was
+Jack
+that
+he
+was
+an
+uncle
+of
+the
+troubled
+waitress
+and
+that
+he
+had
+been
+a
+vagabond
+in
+life
+After
+reasoning
+with
+the
+intelligence
+he
+began
+to
+realize
+his
+situation
+and
+promising
+to
+cause
+no
+further
+annoyance
+left
+Mrs
+then
+immediately
+became
+her
+normal
+self
+and
+returned
+to
+her
+work
+without
+any
+further
+disturbance
+It
+was
+later
+ascertained
+from
+the
+waitress
+that
+she
+had
+bad
+an
+uncle
+named
+Jack
+who
+had
+been
+a
+vagabond
+and
+that
+he
+was
+dead
+In
+this
+experience
+Mrs
+had
+acted
+as
+the
+psychic
+intermediary
+to
+whom
+the
+spirit
+obsessing
+the
+waitress
+had
+been
+transferred
+A
+number
+of
+years
+ago
+Dr
+Lydston
+wrote
+in
+the
+Chicago
+papers
+of
+a
+patient
+who
+although
+having
+no
+knowledge
+of
+French
+or
+music
+sang
+well
+the
+Marseillaise
+in
+French
+when
+placed
+under
+the
+influence
+of
+an
+anesthetic
+Dr
+Lydston
+denying
+the
+continued
+existence
+of
+the
+ego
+explained
+this
+phenomenon
+as
+one
+of
+subliminal
+consciousness
+or
+unconscious
+memory
+comnparing
+it
+with
+the
+case
+of
+the
+uneducated
+domestic
+who
+in
+delirium
+recited
+classic
+Latin
+as
+perfectly
+as
+her
+former
+employer
+a
+Professor
+of
+Latin
+had
+done
+during
+his
+life
+I
+replied
+in
+a
+newspaper
+article
+that
+such
+phenomena
+were
+frequently
+met
+with
+in
+psychic
+research
+and
+stated
+that
+despite
+the
+classification
+of
+materialistic
+scientists
+these
+cases
+clearly
+proved
+the
+posthumous
+existence
+of
+spirits
+and
+their
+ability
+to
+communicate
+through
+mortals
+I
+added
+that
+if
+the
+truth
+were
+known
+about
+these
+two
+cases
+we
+would
+find
+that
+the
+man
+who
+sang
+French
+was
+a
+psychic
+sensitive
+and
+had
+at
+the
+time
+been
+controlled
+by
+some
+outside
+intelligence
+while
+in
+all
+probability
+the
+domestic
+who
+recited
+Latin
+was
+obsessed
+by
+the
+spirit
+of
+the
+former
+professor
+Shortly
+after
+this
+the
+gentleman
+alluded
+to
+by
+Dr
+Lydston
+called
+on
+me
+having
+read
+my
+article
+and
+said
+I
+don
+t
+know
+anything
+about
+French
+but
+I
+do
+know
+that
+I
+am
+bothered
+to
+death
+by
+spirits
+In
+the
+study
+of
+cases
+of
+Multiple
+Personalities
+Dissociated
+Personalities
+or
+Disintegrated
+States
+of
+Consciousness
+modern
+psychologists
+disclaim
+the
+possibility
+of
+foreign
+intelligences
+on
+the
+ground
+that
+these
+personalities
+give
+neither
+evidence
+of
+supernormal
+knowledge
+nor
+of
+being
+of
+spiritistic
+origin
+Our
+experience
+to
+the
+contrary
+has
+proven
+that
+the
+majority
+of
+these
+intelligences
+are
+oblivious
+of
+their
+transition
+and
+hence
+it
+does
+not
+enter
+their
+minds
+that
+they
+are
+spirits
+and
+they
+are
+loath
+to
+recognize
+the
+fact
+In
+the
+case
+of
+Miss
+Beauchamp
+as
+recorded
+by
+Dr
+Morton
+Prince
+in
+The
+Dissociation
+of
+a
+Personality
+reporting
+four
+alternating
+personalities
+no
+claim
+was
+made
+that
+any
+outside
+intelligences
+were
+responsible
+for
+the
+various
+personalities
+and
+yet
+Sally
+personality
+insisted
+that
+she
+herself
+was
+not
+the
+same
+as
+Miss
+Beauchamp
+Christine
+that
+her
+own
+consciousness
+was
+distinct
+from
+that
+of
+Miss
+Beauchamp
+and
+told
+of
+Miss
+Beauchamp
+s
+learning
+to
+walk
+and
+talk
+When
+she
+was
+a
+very
+little
+girl
+just
+learning
+to
+walk
+I
+remember
+her
+thoughts
+distinctly
+as
+separate
+from
+mine
+Similarly
+in
+the
+case
+of
+Bernice
+Redick
+of
+Ohio
+the
+young
+school
+girl
+who
+constantly
+changed
+from
+her
+normal
+self
+to
+the
+personality
+of
+Polly
+an
+unruly
+child
+every
+indication
+is
+given
+of
+the
+influence
+of
+a
+discarnate
+spirit
+probably
+ignorant
+of
+being
+dead
+controlling
+Miss
+Redick
+That
+such
+personalities
+are
+independent
+entities
+could
+easily
+be
+proven
+under
+proper
+conditions
+by
+transference
+of
+the
+same
+to
+a
+psychic
+intermediary
+as
+similar
+experiments
+have
+so
+abundantly
+demonstrated
+Any
+attempt
+to
+explain
+our
+experiences
+on
+the
+theory
+of
+the
+Subconscious
+Mind
+and
+Auto
+Suggestion
+or
+Multiple
+Personalities
+would
+be
+untenable
+since
+it
+is
+manifestly
+impossible
+that
+Mrs
+Wickland
+should
+have
+a
+thousand
+personalities
+and
+since
+it
+is
+so
+readily
+possible
+to
+cause
+transference
+of
+psychosis
+from
+a
+supposedly
+insane
+person
+to
+Mrs
+Wickland
+relieving
+the
+victim
+and
+in
+this
+way
+discovering
+that
+the
+disturbance
+was
+due
+to
+a
+discarnate
+entity
+whose
+identity
+can
+often
+be
+verified
+Individuals
+who
+are
+clairaudient
+suffer
+greatly
+from
+the
+constant
+annoyance
+of
+hearing
+the
+voices
+of
+obsessing
+entities
+the
+auditory
+hallucinations
+frequently
+observed
+by
+alienists
+and
+when
+such
+a
+person
+is
+present
+in
+a
+psychic
+circle
+where
+the
+spirits
+are
+dislodged
+and
+transferred
+to
+the
+psychic
+intermediary
+interesting
+developments
+occur
+An
+illustration
+is
+the
+case
+of
+Mrs
+Burton
+a
+clairaudient
+patient
+who
+was
+constantly
+combatting
+obsessing
+spirits
+and
+who
+while
+attending
+our
+circle
+was
+relieved
+of
+her
+unwelcome
+companions
+In
+the
+following
+records
+the
+conversation
+of
+the
+spirits
+through
+the
+psychic
+Mrs
+Wickland
+will
+elucidate
+the
+characteristics
+of
+the
+several
+entities
+Spirit
+CARRIE
+HUNTINGTON
+Patient
+MRS
+BURTON
+Doctor
+Tell
+us
+who
+you
+are
+Spirit
+I
+do
+not
+wish
+you
+to
+hold
+my
+hands
+Dr
+You
+must
+sit
+still
+Sp
+Why
+do
+you
+treat
+me
+like
+this
+Dr
+Who
+are
+you
+Sp
+Why
+do
+you
+want
+to
+know
+Dr
+You
+have
+come
+here
+as
+a
+stranger
+and
+we
+would
+like
+to
+know
+who
+you
+are
+Sp
+What
+are
+you
+so
+interested
+for
+Dr
+We
+should
+like
+to
+know
+with
+whom
+we
+are
+associating
+If
+a
+stranger
+came
+to
+your
+home
+would
+you
+not
+like
+to
+know
+his
+name
+Sp
+I
+do
+not
+want
+to
+be
+here
+and
+I
+do
+not
+know
+any
+of
+you
+Somebody
+pushed
+me
+in
+here
+and
+I
+do
+not
+think
+it
+is
+right
+to
+force
+me
+in
+like
+that
+And
+when
+I
+came
+in
+and
+sat
+down
+on
+the
+chair
+you
+grabbed
+my
+hands
+as
+if
+I
+were
+a
+prisoner
+Why
+was
+I
+pushed
+in
+here
+Brought
+in
+control
+of
+psychic
+by
+guiding
+intelligences
+Dr
+You
+were
+probably
+in
+the
+dark
+Sp
+It
+seems
+somebody
+took
+me
+by
+force
+Dr
+Was
+there
+any
+reason
+for
+it
+Sp
+I
+do
+not
+know
+of
+any
+reason
+and
+I
+do
+not
+see
+why
+I
+should
+be
+bothered
+like
+that
+Dr
+Was
+no
+reason
+given
+for
+handling
+you
+in
+this
+manner
+sp
+It
+has
+been
+a
+terrible
+time
+for
+me
+for
+quite
+a
+while
+I
+have
+been
+tormented
+to
+death
+I
+have
+been
+driven
+here
+there
+and
+everywhere
+I
+am
+getting
+so
+provoked
+about
+it
+that
+I
+feel
+like
+giving
+everything
+a
+good
+shaking
+Dr
+What
+have
+they
+done
+to
+you
+Sp
+It
+seems
+so
+terrible
+If
+I
+walk
+around
+I
+am
+so
+very
+miserable
+I
+do
+not
+know
+what
+it
+is
+Sometimes
+it
+seems
+as
+if
+my
+senses
+were
+being
+knocked
+out
+of
+me
+Something
+comes
+on
+me
+like
+thunder
+and
+lightning
+Static
+treatment
+of
+patient
+it
+makes
+such
+a
+noise
+This
+terrible
+noise
+it
+is
+awful
+I
+cannot
+stand
+it
+any
+more
+and
+I
+will
+not
+either
+Dr
+We
+shall
+be
+glad
+if
+you
+will
+not
+stand
+it
+any
+more
+Sp
+Am
+I
+not
+welcome
+And
+if
+I
+am
+not
+I
+do
+not
+care
+Dr
+You
+are
+not
+very
+particular
+Sp
+I
+have
+had
+so
+much
+hardship
+Dr
+How
+long
+have
+you
+been
+dead
+Sp
+Why
+do
+you
+speak
+that
+way
+I
+am
+not
+dead
+I
+am
+as
+alive
+as
+I
+can
+be
+and
+I
+feel
+as
+if
+I
+were
+young
+again
+Dr
+Have
+you
+not
+felt
+at
+times
+as
+if
+you
+were
+somebody
+else
+Sp
+At
+times
+I
+feel
+very
+strange
+especially
+when
+it
+knocks
+me
+me
+senseless
+I
+feel
+very
+bad
+I
+do
+not
+feel
+that
+I
+should
+have
+this
+suffering
+I
+do
+not
+know
+why
+I
+should
+have
+such
+things
+Dr
+Probably
+it
+is
+necessary
+Sp
+I
+feel
+I
+should
+be
+free
+to
+go
+where
+I
+please
+but
+it
+seems
+I
+have
+no
+will
+of
+my
+own
+any
+more
+I
+try
+but
+it
+seems
+somebody
+else
+takes
+possession
+of
+me
+and
+gets
+me
+into
+some
+place
+where
+they
+knock
+me
+nearly
+senseless
+If
+I
+knew
+it
+I
+never
+would
+go
+there
+but
+there
+is
+a
+person
+who
+seems
+to
+have
+the
+right
+to
+take
+me
+everywhere
+but
+I
+feel
+I
+should
+have
+the
+right
+to
+take
+her
+Referring
+to
+patient
+Dr
+What
+business
+have
+you
+with
+her
+Can
+t
+you
+live
+your
+own
+life
+SP
+I
+live
+my
+own
+life
+but
+she
+interferes
+with
+me
+I
+talk
+to
+her
+She
+wants
+to
+chase
+me
+out
+I
+feel
+like
+chasing
+her
+out
+and
+that
+is
+a
+real
+struggle
+I
+cannot
+see
+why
+I
+should
+not
+have
+the
+right
+just
+as
+well
+as
+she
+has
+Dr
+Probably
+you
+are
+interfering
+with
+her
+SP
+She
+wants
+to
+get
+rid
+of
+me
+I
+am
+not
+bothering
+her
+I
+only
+talk
+to
+her
+sometimes
+Dr
+Does
+she
+know
+you
+talk
+to
+her
+Sp
+Sometimes
+she
+does
+and
+then
+she
+chases
+me
+right
+out
+She
+acts
+all
+right
+but
+she
+gets
+so
+provoked
+Then
+when
+she
+gets
+into
+that
+place
+I
+am
+knocked
+senseless
+and
+I
+feel
+terrible
+I
+have
+no
+power
+to
+take
+her
+away
+She
+makes
+me
+get
+out
+Dr
+You
+should
+not
+stay
+around
+her
+Sp
+It
+is
+my
+body
+it
+is
+not
+hers
+She
+has
+no
+right
+there
+I
+do
+not
+see
+why
+she
+interferes
+with
+me
+Dr
+She
+interferes
+with
+your
+selfishness
+Sp
+I
+feel
+I
+have
+some
+right
+in
+life
+I
+think
+so
+Dr
+You
+passed
+out
+of
+your
+body
+without
+understanding
+the
+fact
+and
+have
+been
+bothering
+a
+lady
+You
+should
+go
+to
+the
+spirit
+world
+and
+not
+hover
+around
+here
+Sp
+You
+say
+I
+am
+hovering
+around
+I
+am
+not
+hovering
+around
+and
+I
+am
+not
+one
+to
+interfere
+but
+I
+want
+a
+little
+to
+say
+about
+things
+Dr
+That
+was
+why
+you
+had
+the
+thunder
+and
+the
+knocks
+Sp
+That
+was
+all
+right
+for
+a
+while
+but
+lately
+it
+is
+terrible
+I
+must
+have
+understanding
+Dr
+You
+will
+have
+it
+now
+Sp
+I
+will
+do
+anything
+to
+stop
+that
+terrible
+knocking
+Mrs
+B
+Recognizing
+the
+spirit
+as
+one
+who
+had
+been
+troubling
+her
+I
+am
+mighty
+tired
+of
+you
+Who
+are
+you
+anyway
+Sp
+I
+am
+a
+stranger
+Mrs
+B
+What
+is
+your
+name
+Sp
+My
+name
+Mrs
+B
+Have
+you
+one
+Sp
+My
+name
+is
+Carrie
+Mrs
+B
+Carrie
+what
+Sp
+Carrie
+Huntington
+Mrs
+B
+Where
+do
+you
+live
+Sp
+San
+Antonio
+Texas
+Mrs
+B
+You
+have
+been
+with
+me
+a
+long
+time
+haven
+t
+you
+It
+had
+been
+a
+number
+of
+years
+since
+Mrs
+B
+had
+been
+in
+San
+Antonio
+Sp
+You
+have
+been
+with
+me
+a
+long
+time
+I
+should
+like
+to
+find
+out
+why
+you
+interfere
+with
+me
+I
+recognize
+you
+now
+Mrs
+B
+What
+street
+did
+you
+live
+on
+Sp
+I
+lived
+in
+many
+different
+plates
+there
+Dr
+Do
+you
+realize
+the
+fact
+that
+you
+have
+lost
+your
+own
+mortal
+body
+Can
+you
+remember
+having
+been
+sick
+Sp
+The
+last
+I
+remember
+I
+was
+in
+El
+Paso
+I
+do
+not
+remember
+anything
+after
+that
+I
+went
+there
+and
+I
+do
+not
+seem
+to
+remember
+when
+I
+left
+It
+seems
+that
+I
+should
+be
+there
+now
+I
+got
+very
+sick
+one
+day
+there
+Dr
+Probably
+you
+lost
+your
+body
+then
+Sp
+After
+El
+Paso
+I
+do
+not
+know
+where
+I
+went
+I
+went
+some
+distance
+I
+traveled
+on
+the
+railroad
+and
+it
+was
+just
+like
+I
+was
+nobody
+Nobody
+asked
+me
+anything
+and
+I
+had
+to
+follow
+that
+lady
+Mrs
+B
+as
+if
+I
+were
+her
+servant
+and
+I
+feel
+very
+annoyed
+about
+it
+Mrs
+B
+You
+worried
+me
+to
+death
+because
+you
+sang
+all
+the
+time
+Sp
+I
+had
+to
+do
+something
+to
+attract
+your
+attention
+because
+you
+would
+not
+listen
+to
+me
+any
+other
+way
+You
+traveled
+on
+the
+train
+and
+it
+took
+me
+away
+from
+my
+home
+and
+folks
+and
+I
+feel
+very
+much
+hurt
+about
+it
+Do
+you
+understand
+Mrs
+B
+I
+understand
+you
+far
+better
+than
+you
+do
+me
+Dr
+Can
+t
+you
+realize
+what
+has
+been
+the
+matter
+with
+you
+Sp
+I
+want
+to
+tell
+you
+that
+I
+do
+not
+want
+those
+knockings
+any
+more
+I
+will
+stay
+away
+Dr
+Understand
+your
+condition
+understand
+that
+you
+are
+an
+ignorant
+obessing
+spirit
+and
+that
+you
+have
+no
+physical
+body
+You
+died
+probably
+at
+the
+time
+you
+were
+sick
+Sp
+Could
+you
+talk
+to
+a
+ghost
+Dr
+Such
+things
+certainly
+do
+happen
+Sp
+I
+am
+not
+a
+ghost
+because
+ghosts
+cannot
+talk
+When
+you
+are
+dead
+you
+lie
+there
+Dr
+When
+the
+body
+dies
+it
+lies
+there
+But
+the
+spirit
+does
+not
+Sp
+That
+goes
+to
+God
+who
+gave
+it
+Dr
+Where
+is
+He
+Where
+is
+that
+God
+Sp
+In
+Heaven
+Dr
+Where
+is
+that
+Sp
+It
+is
+where
+you
+go
+to
+find
+Jesus
+Dr
+The
+Bible
+says
+God
+is
+Love
+and
+he
+that
+dwelleth
+in
+Love
+dwelleth
+in
+God
+Where
+will
+you
+find
+that
+God
+Sp
+I
+suppose
+in
+Heaven
+I
+cannot
+tell
+you
+anything
+about
+it
+But
+I
+know
+I
+have
+been
+in
+the
+worst
+hell
+you
+could
+give
+me
+with
+those
+knockings
+I
+do
+not
+see
+that
+they
+have
+done
+me
+any
+good
+I
+do
+not
+like
+them
+at
+all
+Dr
+Then
+you
+must
+stay
+away
+from
+that
+lady
+SP
+I
+see
+her
+well
+now
+and
+I
+can
+have
+a
+real
+conversation
+with
+her
+Dr
+Yes
+but
+this
+will
+be
+the
+last
+time
+SP
+How
+do
+you
+know
+it
+will
+Dr
+When
+you
+leave
+here
+you
+will
+understand
+that
+you
+have
+been
+talking
+through
+another
+person
+s
+body
+That
+person
+is
+my
+wife
+Sp
+What
+nonsense
+I
+thought
+you
+looked
+wiser
+than
+to
+talk
+such
+nonsense
+Dr
+It
+may
+seem
+foolish
+but
+look
+at
+your
+hands
+Do
+you
+recognize
+them
+Sp
+They
+do
+not
+look
+like
+mine
+but
+so
+much
+has
+taken
+place
+lately
+that
+I
+do
+not
+know
+what
+I
+shall
+do
+That
+lady
+over
+there
+Mrs
+B
+has
+been
+acting
+like
+a
+madman
+and
+I
+have
+taken
+it
+as
+it
+came
+so
+I
+shall
+have
+to
+find
+out
+what
+she
+thinks
+of
+doing
+and
+why
+she
+does
+those
+things
+to
+me
+Dr
+She
+will
+be
+very
+happy
+to
+be
+rid
+of
+you
+Mrs
+B
+Carrie
+how
+old
+are
+you
+Sp
+You
+know
+that
+a
+lady
+never
+wants
+to
+tell
+her
+age
+Dr
+Especially
+if
+she
+happens
+to
+be
+a
+spinster
+Sp
+Please
+excuse
+me
+you
+will
+have
+to
+take
+it
+as
+it
+is
+I
+will
+not
+tell
+my
+age
+to
+any
+one
+Dr
+Have
+you
+ever
+been
+married
+Sp
+Yes
+I
+was
+married
+to
+a
+fellow
+but
+I
+did
+not
+care
+for
+him
+Dr
+What
+was
+his
+name
+Sp
+That
+is
+a
+secret
+with
+me
+I
+would
+not
+have
+his
+name
+mentioned
+for
+anything
+and
+I
+do
+not
+want
+to
+carry
+his
+name
+either
+My
+name
+is
+Carrie
+Huntington
+because
+it
+was
+my
+name
+and
+I
+do
+not
+want
+to
+carry
+his
+name
+Dr
+Do
+you
+want
+to
+go
+to
+the
+spirit
+world
+Sp
+What
+foolish
+questions
+you
+put
+to
+me
+Dr
+It
+may
+seem
+foolish
+to
+you
+but
+nevertheless
+there
+is
+a
+spirit
+world
+Spiritual
+things
+often
+seem
+foolish
+to
+the
+mortal
+mind
+You
+have
+lost
+your
+body
+Sp
+I
+have
+not
+lost
+my
+body
+I
+have
+been
+with
+this
+lady
+but
+she
+does
+one
+thing
+I
+do
+not
+like
+very
+well
+She
+eats
+too
+much
+She
+eats
+too
+much
+and
+gets
+too
+strong
+then
+I
+have
+no
+power
+over
+her
+body
+not
+as
+much
+as
+I
+want
+to
+To
+Mrs
+B
+I
+want
+you
+to
+eat
+less
+I
+try
+very
+much
+to
+dictate
+to
+you
+not
+to
+eat
+that
+and
+that
+but
+you
+have
+no
+sense
+You
+do
+not
+even
+listen
+to
+me
+Mrs
+B
+This
+is
+the
+place
+I
+told
+you
+to
+go
+to
+but
+you
+would
+not
+go
+by
+yourself
+Sp
+I
+know
+it
+But
+you
+have
+no
+business
+to
+take
+me
+where
+I
+get
+those
+knockings
+I
+do
+not
+want
+to
+stay
+with
+you
+if
+you
+take
+those
+awful
+knockings
+Dr
+They
+are
+in
+the
+next
+room
+Do
+you
+want
+some
+Sp
+No
+thank
+you
+Not
+for
+me
+any
+more
+Dr
+Listen
+to
+what
+is
+told
+you
+then
+you
+will
+not
+need
+any
+more
+You
+are
+an
+ignorant
+spirit
+I
+mean
+you
+are
+ignorant
+of
+your
+condition
+You
+lost
+your
+body
+evidently
+without
+knowing
+it
+Sp
+How
+do
+you
+know
+Dr
+You
+are
+now
+controlling
+my
+wife
+s
+body
+Sp
+I
+never
+saw
+you
+before
+so
+how
+in
+the
+world
+can
+you
+think
+I
+should
+be
+called
+your
+wife
+No
+never
+Dr
+I
+do
+not
+want
+you
+to
+be
+Sp
+I
+don
+t
+want
+you
+either
+Dr
+I
+don
+t
+want
+you
+to
+control
+my
+wife
+s
+body
+much
+longer
+you
+must
+realize
+that
+you
+have
+lost
+your
+physical
+body
+Do
+you
+recognize
+these
+hands
+Mrs
+Wickland
+s
+hands
+Sp
+I
+have
+changed
+so
+much
+lately
+that
+all
+those
+changes
+make
+me
+crazy
+It
+makes
+me
+tired
+Dr
+Now
+Carrie
+be
+sensible
+Sp
+I
+am
+sensible
+and
+don
+t
+you
+tell
+me
+differently
+else
+you
+will
+have
+some
+one
+to
+tell
+you
+something
+you
+never
+heard
+before
+Dr
+Now
+Carrie
+Sp
+I
+am
+Mrs
+Carrie
+Huntington
+Mrs
+B
+You
+listen
+to
+what
+the
+Doctor
+has
+to
+say
+to
+you
+Sp
+I
+will
+not
+listen
+to
+any
+one
+I
+tell
+you
+once
+for
+all
+I
+have
+been
+from
+one
+to
+another
+and
+I
+do
+not
+care
+what
+becomes
+of
+me
+Dr
+Do
+you
+know
+you
+are
+talking
+through
+my
+wife
+s
+body
+Sp
+Such
+nonsense
+I
+think
+that
+s
+the
+craziest
+thing
+I
+ever
+heard
+in
+my
+life
+Dr
+Now
+you
+will
+have
+to
+be
+sensible
+Sp
+Sensible
+I
+am
+sensible
+Are
+you
+a
+perfect
+man
+Dr
+No
+I
+am
+not
+but
+I
+tell
+you
+that
+you
+are
+an
+ignorant
+selfish
+spirit
+You
+have
+been
+bothering
+that
+lady
+for
+some
+time
+and
+we
+have
+chased
+you
+out
+by
+the
+use
+of
+those
+knocks
+Whether
+you
+understand
+it
+or
+not
+you
+are
+an
+ignorant
+spirit
+You
+will
+have
+to
+behave
+yourself
+or
+else
+I
+will
+take
+you
+into
+the
+office
+and
+give
+you
+some
+more
+of
+those
+knocks
+SP
+I
+don
+t
+want
+those
+knocks
+Dr
+Then
+change
+your
+disposition
+Realize
+that
+there
+is
+no
+death
+when
+people
+lose
+their
+bodies
+they
+merely
+become
+invisible
+to
+mortals
+You
+are
+invisible
+to
+us
+SP
+I
+will
+have
+nothing
+to
+do
+with
+you
+Dr
+We
+want
+to
+help
+you
+and
+make
+you
+understand
+your
+condition
+Sp
+I
+don
+t
+need
+help
+Dr
+If
+you
+don
+t
+behave
+you
+will
+be
+taken
+away
+by
+intelligent
+spirits
+and
+placed
+in
+a
+dungeon
+Sp
+You
+think
+you
+can
+scare
+me
+You
+will
+find
+out
+what
+will
+happen
+to
+you
+Dr
+You
+must
+overcome
+your
+selfish
+disposition
+Look
+around
+you
+may
+see
+some
+one
+who
+will
+make
+you
+care
+You
+may
+see
+some
+one
+who
+will
+make
+you
+cry
+Sp
+I
+don
+t
+want
+to
+cry
+I
+like
+to
+sing
+instead
+of
+cry
+Dr
+Where
+is
+your
+mother
+Sp
+I
+haven
+t
+seen
+her
+for
+a
+long
+time
+My
+mother
+My
+mother
+She
+is
+in
+Heaven
+She
+was
+a
+good
+woman
+and
+is
+with
+God
+and
+the
+Holy
+Ghost
+and
+all
+of
+them
+Dr
+Look
+around
+and
+see
+if
+your
+mother
+is
+not
+here
+Sp
+This
+place
+is
+not
+Heaven
+far
+from
+it
+If
+this
+is
+heaven
+then
+it
+is
+worse
+than
+hell
+Dr
+Look
+for
+your
+mother
+she
+will
+put
+you
+to
+shame
+Sp
+I
+have
+done
+nothing
+to
+be
+ashamed
+of
+What
+business
+have
+you
+to
+give
+me
+those
+knocks
+and
+have
+me
+put
+in
+a
+dungeon
+That
+lady
+and
+I
+made
+a
+bargain
+Dr
+She
+made
+a
+bargain
+to
+come
+here
+and
+get
+rid
+of
+you
+You
+have
+been
+fired
+out
+by
+electricity
+You
+have
+lost
+your
+company
+Sp
+Yes
+for
+a
+while
+they
+all
+left
+me
+I
+can
+t
+find
+them
+Other
+obsessing
+spirits
+Why
+did
+you
+chase
+that
+tall
+fellow
+away
+Dr
+This
+lady
+wants
+her
+body
+herself
+she
+does
+not
+want
+to
+be
+tormented
+by
+earthbound
+spirits
+Would
+you
+like
+them
+around
+you
+Sp
+I
+don
+t
+know
+what
+you
+mean
+Dr
+Can
+t
+you
+realize
+that
+you
+bothered
+that
+lady
+and
+made
+her
+life
+a
+perfect
+hell
+Sp
+To
+Mrs
+B
+I
+have
+not
+bothered
+you
+Mrs
+B
+You
+woke
+me
+up
+at
+three
+o
+clock
+this
+morning
+Sp
+Well
+you
+have
+no
+business
+to
+sleep
+Dr
+You
+must
+live
+your
+own
+life
+Sp
+I
+will
+Dr
+That
+will
+be
+in
+a
+dark
+dungeon
+if
+you
+do
+not
+behave
+yourself
+Sp
+How
+do
+you
+know
+Dr
+You
+cannot
+stay
+here
+You
+had
+better
+be
+humble
+and
+ask
+for
+help
+that
+is
+what
+you
+need
+My
+wife
+and
+I
+have
+been
+following
+this
+work
+for
+many
+years
+and
+she
+allows
+all
+sorts
+of
+spirits
+to
+use
+her
+body
+so
+they
+may
+be
+helped
+Sp
+Sarcastically
+She
+is
+very
+good
+Dr
+You
+ought
+to
+be
+ashamed
+of
+yourself
+Do
+you
+see
+your
+mother
+SP
+I
+don
+t
+want
+to
+see
+her
+I
+don
+t
+want
+to
+call
+her
+away
+from
+Heaven
+Dr
+Since
+Heaven
+is
+a
+condition
+of
+happiness
+she
+could
+not
+be
+in
+any
+Heaven
+with
+a
+daughter
+like
+you
+she
+could
+not
+be
+happy
+Suppose
+you
+were
+in
+Heaven
+and
+had
+a
+daughter
+would
+you
+like
+her
+to
+act
+as
+you
+do
+Sp
+I
+do
+not
+act
+contrary
+What
+is
+the
+situation
+Tell
+me
+that
+Dr
+I
+have
+already
+told
+you
+the
+situation
+You
+are
+controlling
+my
+wife
+s
+body
+Sp
+How
+do
+I
+do
+that
+Dr
+Because
+of
+higher
+laws
+and
+because
+you
+are
+a
+spirit
+Spirit
+and
+mind
+are
+invisible
+You
+are
+so
+selfish
+that
+you
+do
+not
+care
+to
+understand
+Sp
+This
+is
+not
+Heaven
+Dr
+This
+is
+Los
+Angeles
+California
+Sp
+For
+God
+s
+sake
+no
+An
+expression
+never
+used
+by
+Mrs
+Wickland
+How
+did
+I
+come
+here
+Dr
+By
+staying
+around
+that
+lady
+That
+is
+how
+She
+had
+to
+take
+those
+knocks
+to
+get
+you
+out
+Sp
+She
+s
+a
+fool
+to
+do
+it
+Dr
+She
+wants
+to
+get
+rid
+of
+you
+and
+she
+will
+get
+rid
+of
+you
+Sp
+I
+will
+not
+have
+those
+knocks
+any
+more
+Dr
+Higher
+spirits
+will
+show
+you
+something
+you
+do
+not
+like
+if
+you
+do
+not
+behave
+yourself
+Sp
+Shrinking
+from
+some
+vision
+I
+don
+t
+want
+that
+Dr
+It
+is
+not
+what
+you
+want
+it
+is
+what
+you
+get
+Sp
+Is
+that
+so
+As
+nothing
+could
+be
+done
+to
+bring
+the
+spirit
+to
+an
+understanding
+she
+was
+taken
+away
+by
+intelligent
+spirits
+Upon
+a
+later
+occasion
+when
+the
+patient
+Mrs
+Burton
+was
+in
+the
+circle
+another
+spirit
+was
+removed
+from
+her
+and
+controlling
+Mrs
+Wickland
+spoke
+in
+a
+very
+individualistic
+manner
+Spirit
+JIMMIE
+HUNTINGTON
+Patient
+MRS
+BURTON
+The
+spirit
+kicked
+off
+both
+shoes
+and
+seemed
+greatly
+disturbed
+Dr
+What
+seems
+to
+be
+the
+trouble
+Have
+you
+been
+in
+an
+accident
+of
+some
+kind
+Holding
+psychic
+s
+hands
+firmly
+You
+have
+no
+shoes
+on
+SP
+I
+took
+them
+off
+Dr
+Tell
+us
+who
+you
+are
+Sp
+I
+don
+t
+know
+whether
+I
+want
+to
+Dr
+Tell
+us
+where
+you
+came
+from
+Sp
+I
+don
+t
+know
+that
+I
+have
+to
+do
+that
+Dr
+We
+would
+like
+to
+know
+who
+you
+are
+What
+seems
+to
+be
+the
+trouble
+You
+don
+t
+seem
+to
+be
+comfortable
+Sp
+I
+am
+not
+Dr
+What
+have
+you
+been
+doing
+lately
+Sp
+I
+haven
+t
+been
+doing
+anything
+I
+have
+just
+been
+walking
+around
+Dr
+And
+what
+else
+Sp
+Why
+nothing
+in
+particular
+It
+seems
+that
+I
+have
+been
+shut
+up
+somewhere
+In
+patient
+s
+aura
+Dr
+In
+what
+way
+Sp
+I
+don
+t
+know
+how
+it
+is
+but
+I
+couldn
+t
+get
+out
+Dr
+How
+would
+you
+explain
+that
+Sp
+I
+can
+t
+explain
+it
+in
+any
+way
+Dr
+Did
+you
+hear
+any
+talking
+Sp
+Yes
+many
+people
+talked
+Dr
+What
+did
+they
+say
+Sp
+One
+said
+one
+thing
+one
+another
+They
+all
+think
+they
+are
+so
+smart
+Dr
+Did
+you
+ever
+have
+any
+chance
+to
+say
+anything
+Sp
+Yes
+but
+I
+got
+so
+mad
+because
+there
+was
+always
+a
+woman
+there
+she
+knew
+all
+I
+wanted
+to
+say
+I
+felt
+that
+some
+times
+I
+should
+have
+a
+chance
+Whenever
+they
+talked
+that
+woman
+talked
+A
+man
+has
+no
+chance
+to
+say
+anything
+when
+a
+woman
+begins
+to
+talk
+Dr
+You
+must
+have
+been
+a
+married
+man
+Sp
+Why
+yes
+I
+am
+married
+Dr
+Was
+it
+a
+success
+or
+a
+failure
+Sp
+I
+don
+t
+know
+what
+it
+was
+an
+excuse
+anyway
+I
+was
+not
+so
+very
+happy
+Women
+always
+talk
+too
+much
+They
+can
+t
+leave
+a
+fellow
+alone
+a
+minute
+at
+a
+time
+Dr
+What
+did
+they
+talk
+about
+Sp
+It
+s
+that
+woman
+she
+talks
+and
+talks
+and
+talks
+Patient
+Mrs
+Burton
+who
+talked
+constantly
+She
+never
+can
+keep
+still
+very
+long
+at
+a
+time
+I
+felt
+sometimes
+like
+shaking
+her
+good
+We
+just
+had
+some
+new
+company
+come
+in
+They
+talk
+and
+talk
+It
+makes
+me
+sick
+they
+make
+me
+get
+out
+They
+are
+the
+worst
+I
+ever
+saw
+Dr
+Did
+anything
+happen
+at
+all
+Sp
+Lightning
+played
+around
+my
+head
+until
+I
+didn
+t
+know
+where
+I
+was
+Electrical
+treatment
+given
+patient
+I
+thought
+it
+was
+far
+distant
+but
+my
+God
+and
+Stars
+in
+Heaven
+how
+it
+hit
+me
+Dr
+What
+did
+you
+want
+to
+do
+at
+such
+times
+Sp
+I
+wanted
+to
+get
+hold
+of
+that
+lightning
+and
+try
+to
+stop
+it
+hitting
+my
+head
+but
+the
+lightning
+strikes
+every
+time
+it
+never
+misses
+Lightning
+used
+to
+be
+different
+it
+didn
+t
+always
+strike
+but
+now
+it
+never
+misses
+I
+never
+saw
+anything
+like
+it
+There
+are
+stars
+before
+your
+eyes
+and
+it
+feels
+terrible
+but
+even
+while
+the
+lightning
+strikes
+that
+woman
+keeps
+right
+on
+talking
+Patient
+talked
+throughout
+treatment
+Dr
+What
+does
+she
+talk
+about
+Sp
+Nothing
+She
+wants
+to
+be
+boss
+and
+I
+want
+to
+be
+boss
+so
+there
+we
+are
+Dr
+What
+does
+she
+say
+Sp
+You
+know
+how
+it
+is
+with
+women
+they
+talk
+and
+talk
+but
+there
+is
+never
+anything
+to
+it
+Dr
+Does
+the
+lady
+address
+you
+Sp
+She
+torments
+me
+all
+the
+time
+I
+feel
+like
+shaking
+her
+but
+I
+don
+t
+seem
+to
+have
+any
+power
+any
+more
+Then
+there
+is
+another
+woman
+and
+she
+goes
+right
+at
+it
+too
+It
+makes
+me
+sick
+What
+can
+you
+do
+with
+a
+woman
+to
+make
+her
+stop
+talking
+If
+you
+can
+get
+any
+woman
+to
+stop
+talking
+you
+ll
+have
+a
+pretty
+hard
+time
+to
+do
+it
+Dr
+What
+is
+your
+name
+Sp
+It
+s
+a
+long
+time
+since
+I
+heard
+it
+Dr
+Where
+did
+you
+come
+from
+Are
+you
+in
+California
+Sp
+No
+I
+m
+in
+Texas
+Dr
+What
+did
+your
+mother
+call
+you
+when
+you
+were
+a
+boy
+Sp
+James
+was
+my
+name
+but
+they
+always
+called
+me
+Jimmie
+Gosh
+I
+don
+t
+know
+what
+is
+the
+matter
+with
+me
+That
+lightning
+gets
+on
+my
+knees
+and
+feet
+then
+from
+my
+head
+to
+my
+feet
+but
+what
+I
+can
+t
+understand
+is
+it
+never
+misses
+its
+aim
+Dr
+How
+old
+are
+you
+Sp
+I
+will
+say
+that
+I
+am
+a
+man
+about
+fifty
+years
+of
+age
+but
+I
+want
+to
+say
+that
+during
+all
+my
+life
+I
+never
+saw
+such
+lightning
+before
+and
+what
+I
+can
+t
+understand
+is
+that
+nothing
+ever
+catches
+fire
+from
+it
+Gosh
+Yesterday
+I
+got
+into
+a
+regular
+nest
+it
+was
+the
+worst
+I
+ever
+saw
+in
+my
+whole
+life
+I
+think
+every
+one
+was
+a
+devil
+Obsessing
+spirits
+There
+s
+another
+one
+standing
+over
+there
+and
+that
+came
+yesterday
+Dr
+How
+long
+have
+you
+been
+dead
+Jimmie
+Sp
+What
+do
+you
+mean
+Dr
+I
+mean
+how
+long
+is
+it
+since
+you
+lost
+your
+body
+SP
+I
+haven
+t
+lost
+it
+yet
+Dr
+Don
+t
+you
+realize
+that
+you
+are
+in
+a
+strange
+condition
+Sp
+I
+have
+been
+that
+for
+a
+long
+time
+Dr
+Did
+you
+ever
+work
+in
+the
+oil
+business
+in
+Texas
+Sp
+I
+don
+t
+know
+where
+I
+have
+been
+working
+things
+are
+very
+queer
+Dr
+Where
+did
+you
+work
+Sp
+In
+a
+blacksmith
+shop
+Dr
+Do
+you
+know
+what
+year
+it
+is
+Sp
+No
+I
+don
+t
+Dr
+How
+are
+you
+going
+to
+vote
+this
+Fall
+For
+whom
+will
+you
+vote
+for
+President
+Sp
+I
+don
+t
+know
+yet
+Dr
+How
+do
+you
+like
+the
+present
+President
+Sp
+I
+like
+him
+he
+is
+pretty
+good
+Dr
+Do
+you
+know
+anything
+in
+particular
+about
+him
+Sp
+He
+s
+all
+right
+there
+s
+no
+flies
+on
+Roosevelt
+Dr
+Is
+he
+President
+Sp
+Of
+course
+he
+is
+He
+just
+got
+in
+McKinley
+was
+also
+a
+good
+man
+but
+you
+know
+Mark
+Hanna
+had
+an
+awful
+influence
+over
+him
+It
+is
+a
+long
+time
+since
+I
+bothered
+with
+politics
+I
+have
+been
+shut
+up
+a
+long
+time
+but
+my
+God
+and
+Stars
+in
+Heaven
+I
+m
+nearly
+crazy
+from
+that
+woman
+talking
+all
+the
+time
+Dr
+What
+woman
+is
+it
+that
+talks
+so
+much
+Sp
+Can
+t
+you
+see
+her
+Dr
+She
+might
+not
+be
+here
+Sp
+Oh
+yes
+she
+is
+it
+s
+that
+woman
+Indicating
+patient
+Dr
+What
+does
+she
+talk
+about
+Sp
+Nothing
+but
+nonsense
+She
+makes
+me
+sick
+Dr
+What
+does
+she
+say
+in
+particular
+Sp
+Nothing
+she
+has
+not
+sense
+enough
+She
+mocks
+me
+every
+once
+in
+a
+while
+I
+m
+going
+to
+get
+her
+some
+day
+Stars
+in
+Heaven
+she
+s
+terrible
+Dr
+Now
+friend
+I
+want
+you
+to
+understand
+your
+condition
+You
+have
+lost
+your
+physical
+body
+and
+are
+now
+a
+spirit
+Sp
+I
+have
+a
+body
+If
+only
+that
+woman
+would
+keep
+still
+Dr
+This
+is
+not
+your
+body
+Sp
+Stars
+in
+Heaven
+whose
+body
+is
+it
+Dr
+My
+wife
+s
+Sp
+Stars
+in
+Heaven
+and
+the
+Heat
+from
+the
+Sun
+I
+m
+not
+your
+wife
+How
+could
+I
+be
+your
+wife
+when
+I
+m
+a
+man
+That
+s
+funny
+Dr
+You
+are
+an
+invisible
+spirit
+Sp
+Spirit
+Do
+you
+mean
+a
+ghost
+For
+Heaven
+s
+sake
+talk
+United
+States
+Dr
+Ghosts
+and
+spirits
+are
+the
+same
+thing
+Sp
+I
+know
+ghosts
+and
+I
+know
+spirits
+Dr
+They
+both
+mean
+the
+same
+thing
+Taking
+hand
+of
+psychic
+Sp
+Say
+it
+s
+not
+nice
+for
+a
+man
+to
+hold
+another
+man
+s
+hand
+If
+you
+want
+to
+hold
+hands
+get
+hold
+of
+some
+lady
+s
+hand
+and
+hold
+that
+Men
+don
+t
+hold
+each
+other
+s
+hands
+that
+s
+cold
+joy
+Dr
+Tell
+us
+what
+that
+woman
+says
+Sp
+She
+just
+talks
+and
+says
+nothing
+Dr
+Is
+she
+young
+or
+old
+Sp
+She
+s
+not
+so
+very
+young
+I
+get
+so
+mad
+at
+her
+Dr
+I
+am
+telling
+you
+the
+fact
+when
+I
+say
+you
+are
+a
+spirit
+Sp
+When
+did
+I
+die
+then
+Dr
+It
+must
+have
+been
+some
+time
+ago
+Roosevelt
+has
+not
+been
+President
+for
+many
+years
+He
+is
+a
+spirit
+like
+yourself
+Sp
+Just
+like
+I
+am
+Why
+he
+s
+dead
+then
+Dr
+So
+are
+you
+Sp
+When
+I
+am
+here
+and
+listening
+to
+you
+I
+can
+t
+be
+dead
+Dr
+You
+have
+lost
+your
+body
+Sp
+Say
+don
+t
+hold
+my
+hand
+It
+s
+such
+cold
+joy
+Dr
+I
+am
+holding
+my
+wife
+s
+hand
+Sp
+Well
+you
+can
+hold
+her
+hand
+but
+let
+mine
+alone
+Dr
+Do
+you
+recognize
+this
+hand
+as
+yours
+Sp
+That
+isn
+t
+my
+hand
+Dr
+It
+is
+the
+hand
+of
+my
+wife
+Sp
+But
+I
+m
+not
+your
+wife
+Dr
+You
+are
+using
+my
+wife
+s
+body
+only
+temporarily
+You
+lost
+your
+own
+body
+a
+long
+time
+ago
+Sp
+How
+did
+that
+happen
+Dr
+I
+don
+t
+know
+Do
+you
+know
+you
+are
+in
+Los
+Angeles
+California
+Sp
+God
+and
+Stars
+in
+Heaven
+how
+did
+I
+come
+to
+California
+I
+had
+no
+money
+You
+know
+there
+are
+two
+women
+here
+One
+doesn
+t
+talk
+so
+much
+She
+looks
+to
+me
+like
+she
+was
+sick
+Another
+spirit
+obsessing
+patient
+She
+doesn
+t
+say
+much
+but
+I
+suppose
+she
+is
+so
+annoyed
+because
+that
+other
+woman
+talks
+so
+awful
+Please
+don
+t
+hold
+my
+hand
+I
+like
+to
+feel
+free
+If
+I
+were
+alone
+with
+a
+lady
+and
+I
+could
+hold
+her
+hand
+that
+would
+be
+a
+different
+story
+Aren
+t
+you
+satisfied
+to
+hold
+just
+one
+hand
+Dr
+I
+have
+to
+hold
+both
+because
+you
+will
+not
+be
+quiet
+Now
+let
+us
+not
+lose
+any
+more
+time
+SP
+I
+wish
+sometimes
+I
+didn
+t
+have
+so
+much
+time
+on
+my
+hands
+Dr
+We
+will
+give
+you
+something
+to
+do
+Sp
+You
+will
+That
+s
+good
+If
+you
+can
+give
+me
+some
+work
+of
+some
+kind
+I
+shall
+be
+very
+glad
+Do
+you
+want
+me
+to
+fix
+horses
+shoes
+I
+used
+to
+shoe
+horses
+Dr
+In
+what
+state
+Sp
+Texas
+That
+s
+a
+big
+state
+Dr
+Did
+you
+roam
+around
+a
+good
+deal
+Sp
+Yes
+quite
+a
+little
+I
+was
+in
+Galveston
+Dallas
+San
+Antonio
+and
+many
+other
+places
+I
+traveled
+everywhere
+I
+wanted
+to
+go
+I
+went
+to
+Houston
+and
+other
+cities
+Dr
+You
+are
+a
+spirit
+and
+have
+been
+allowed
+to
+control
+my
+wife
+s
+body
+for
+a
+short
+time
+We
+do
+not
+see
+you
+Sp
+Say
+just
+look
+at
+those
+devils
+there
+limping
+around
+like
+a
+bunch
+of
+little
+imps
+Obsessing
+spirits
+They
+are
+all
+around
+that
+woman
+Mrs
+B
+Dr
+You
+take
+them
+all
+with
+you
+when
+you
+leave
+Sp
+Not
+much
+I
+won
+t
+Touching
+necklace
+What
+in
+the
+world
+is
+this
+Dr
+That
+is
+my
+wife
+s
+neck
+ornament
+SP
+Your
+wife
+Dr
+You
+have
+been
+brought
+here
+for
+enlightenment
+You
+were
+fired
+out
+from
+that
+other
+lady
+Sp
+Yes
+with
+lightning
+For
+the
+life
+of
+me
+I
+never
+saw
+anything
+like
+it
+There
+used
+to
+be
+thunder
+and
+lightning
+storms
+in
+Texas
+and
+in
+Arkansas
+but
+lightning
+did
+not
+strike
+every
+time
+as
+it
+did
+on
+me
+Dr
+You
+will
+not
+have
+that
+thunder
+and
+lightning
+any
+more
+Sp
+I
+will
+not
+That
+s
+good
+Dr
+Was
+your
+mother
+living
+in
+Texas
+Sp
+Certainly
+but
+she
+is
+dead
+I
+should
+know
+because
+I
+was
+at
+her
+funeral
+Dr
+You
+were
+at
+the
+funeral
+of
+her
+body
+not
+her
+spirit
+soul
+or
+mind
+Sp
+I
+suppose
+she
+went
+to
+Heaven
+Dr
+Look
+around
+and
+see
+if
+you
+can
+see
+her
+Sp
+Where
+Dr
+She
+might
+be
+here
+Sp
+What
+place
+is
+this
+anyhow
+If
+I
+am
+your
+wife
+I
+have
+never
+seen
+you
+before
+Dr
+You
+are
+not
+my
+wife
+Sp
+You
+called
+me
+your
+wife
+Dr
+I
+did
+not
+say
+you
+are
+my
+wife
+You
+are
+temporarily
+using
+her
+body
+Sp
+For
+God
+s
+sake
+in
+Heaven
+and
+hell
+how
+can
+I
+get
+out
+of
+your
+wife
+Dr
+Be
+sensible
+What
+do
+those
+imps
+say
+Sp
+They
+say
+they
+are
+going
+to
+stay
+but
+I
+say
+and
+say
+it
+strong
+that
+they
+are
+all
+going
+to
+go
+Dr
+Do
+you
+want
+them
+to
+go
+with
+you
+Sp
+I
+should
+say
+I
+do
+Dr
+You
+can
+help
+them
+a
+great
+deal
+by
+reforming
+them
+and
+making
+them
+understand
+their
+condition
+They
+need
+help
+You
+are
+all
+ignorant
+spirits
+and
+have
+been
+bothering
+that
+lady
+I
+am
+the
+one
+who
+gave
+you
+lightning
+and
+chased
+you
+out
+You
+can
+all
+to
+the
+spirit
+world
+and
+learn
+how
+to
+progress
+Sp
+Is
+that
+woman
+going
+too
+There
+is
+a
+whole
+lot
+a
+gang
+but
+I
+haven
+t
+seen
+any
+of
+them
+until
+lately
+Dr
+Can
+you
+see
+anybody
+you
+know
+Just
+sit
+quietly
+for
+a
+moment
+and
+look
+around
+Sp
+Excitedly
+Why
+here
+comes
+Nora
+A
+spirit
+Dr
+Who
+is
+Nora
+Sp
+Nora
+Huntington
+she
+s
+my
+sister
+Dr
+Ask
+her
+if
+your
+name
+is
+Jimmie
+Huntington
+Sp
+She
+says
+it
+is
+and
+that
+she
+hasn
+t
+seen
+me
+for
+such
+a
+long
+time
+Suddenly
+puzzled
+But
+she
+s
+dead
+Dr
+Let
+her
+explain
+the
+situation
+Sp
+She
+says
+Jimmie
+you
+come
+home
+with
+me
+Where
+shall
+I
+come
+Dr
+What
+does
+she
+say
+Sp
+She
+says
+To
+the
+spirit
+world
+but
+I
+don
+t
+believe
+her
+Dr
+Was
+your
+sister
+in
+the
+habit
+of
+lying
+to
+you
+Sp
+No
+Dr
+If
+she
+were
+honest
+before
+would
+she
+lie
+now
+Sp
+She
+says
+she
+has
+been
+hunting
+for
+me
+for
+years
+and
+she
+didn
+t
+know
+where
+I
+was
+Dr
+Where
+has
+she
+been
+Sp
+Why
+she
+s
+dead
+I
+was
+at
+her
+funeral
+and
+I
+know
+well
+that
+she
+was
+not
+buried
+alive
+Dr
+You
+went
+to
+the
+funeral
+of
+her
+body
+not
+her
+spirit
+Sp
+This
+is
+her
+ghost
+then
+Dr
+She
+is
+probably
+an
+intelligent
+spirit
+We
+do
+not
+need
+to
+argue
+about
+that
+any
+more
+Let
+her
+explain
+Sp
+She
+says
+Let
+us
+go
+Jimmie
+and
+take
+the
+gang
+with
+us
+She
+says
+she
+is
+a
+missionary
+and
+helps
+everybody
+she
+can
+she
+says
+she
+helps
+unfortunates
+I
+have
+been
+unfortunate
+too
+Dr
+Tell
+this
+lady
+this
+other
+spirit
+you
+have
+been
+talking
+about
+to
+go
+with
+you
+SP
+She
+says
+if
+she
+leaves
+she
+has
+no
+body
+Dr
+Tell
+her
+she
+has
+a
+spirit
+body
+She
+doesn
+t
+need
+a
+physical
+body
+Tell
+her
+that
+they
+will
+teach
+her
+how
+to
+progress
+You
+take
+the
+imps
+along
+too
+Sp
+I
+can
+t
+carry
+them
+all
+with
+me
+How
+do
+you
+know
+they
+all
+want
+to
+go
+with
+us
+Dr
+They
+will
+go
+if
+you
+can
+show
+them
+anything
+better
+than
+they
+have
+now
+Probably
+they
+never
+had
+any
+chance
+in
+life
+Sp
+I
+never
+thought
+of
+that
+Dr
+We
+cannot
+blame
+them
+altogether
+Show
+them
+the
+better
+way
+and
+they
+will
+follow
+Sp
+Where
+am
+I
+now
+Dr
+In
+California
+Sp
+Where
+in
+California
+Dr
+Los
+Angeles
+Sp
+If
+you
+are
+in
+California
+it
+doesn
+t
+mean
+that
+I
+am
+there
+too
+Dr
+How
+could
+you
+be
+anywhere
+else
+since
+you
+are
+here
+Sp
+Of
+course
+that
+is
+reasonable
+The
+last
+I
+remember
+I
+was
+in
+Dallas
+Texas
+and
+the
+first
+thing
+I
+knew
+I
+was
+struck
+on
+the
+back
+of
+my
+head
+I
+was
+shoeing
+a
+horse
+when
+I
+was
+struck
+Did
+he
+kill
+me
+Dr
+He
+evidently
+chased
+you
+out
+of
+your
+body
+Nobody
+ever
+dies
+If
+you
+don
+t
+go
+soon
+your
+sister
+will
+become
+tired
+of
+waiting
+for
+you
+Sp
+I
+ll
+go
+with
+her
+if
+you
+ll
+let
+me
+but
+I
+ll
+have
+to
+walk
+Dr
+How
+are
+you
+going
+to
+walk
+With
+my
+wife
+s
+body
+You
+will
+have
+to
+learn
+a
+new
+lesson
+Just
+think
+yourself
+with
+your
+sister
+and
+you
+will
+be
+there
+instantly
+You
+will
+have
+to
+travel
+by
+thought
+Sp
+Stars
+in
+Heaven
+that
+s
+a
+new
+wrinkle
+Dr
+Now
+friend
+you
+can
+t
+stay
+any
+longer
+Sp
+That
+s
+a
+nice
+way
+to
+talk
+to
+me
+Dr
+I
+don
+t
+want
+you
+to
+use
+my
+wife
+s
+body
+any
+longer
+Sp
+What
+body
+will
+I
+get
+hold
+of
+when
+I
+get
+out
+from
+here
+Dr
+When
+you
+leave
+this
+body
+you
+will
+have
+your
+spirit
+body
+That
+is
+invisible
+to
+us
+Sp
+Can
+I
+jump
+from
+this
+body
+into
+a
+spirit
+body
+Dr
+Your
+sister
+will
+explain
+Just
+think
+yourself
+with
+your
+sister
+You
+do
+not
+need
+any
+physical
+body
+for
+that
+purpose
+Sp
+I
+am
+commencing
+to
+get
+sleepy
+Dr
+Go
+with
+your
+sister
+and
+follow
+her
+instructions
+you
+will
+learn
+many
+new
+lessons
+in
+the
+spirit
+life
+Take
+all
+the
+gang
+and
+the
+little
+imps
+with
+you
+Sp
+To
+spirits
+Now
+you
+come
+along
+with
+me
+all
+of
+you
+the
+whole
+lot
+of
+you
+Dr
+Will
+they
+all
+go
+with
+you
+Sp
+Now
+we
+are
+going
+Come
+on
+the
+whole
+gang
+of
+you
+Goodbye
+On
+a
+subsequent
+date
+a
+spirit
+Harry
+was
+brought
+to
+the
+circle
+for
+enlightenment
+and
+controlling
+Mrs
+Wickland
+maintained
+an
+interesting
+conversation
+regarding
+another
+spirit
+that
+had
+been
+troubling
+Mrs
+Burton
+Spirit
+HARRY
+Dr
+Where
+have
+you
+come
+from
+Sp
+I
+don
+t
+know
+where
+I
+am
+and
+I
+don
+t
+know
+what
+is
+the
+matter
+with
+me
+Dr
+Would
+you
+care
+to
+know
+what
+is
+the
+matter
+Sp
+I
+don
+t
+know
+what
+is
+the
+matter
+Dr
+Did
+something
+happen
+to
+you
+Sp
+That
+is
+what
+I
+should
+like
+to
+find
+out
+Dr
+What
+have
+you
+been
+doing
+lately
+Sp
+I
+don
+t
+know
+Dr
+Tell
+us
+who
+you
+are
+Do
+you
+know
+Sp
+Well
+I
+should
+say
+well
+I
+think
+I
+do
+Dr
+Where
+do
+you
+think
+you
+are
+Sp
+I
+don
+t
+know
+Dr
+Yes
+you
+do
+Sp
+No
+I
+don
+t
+know
+Everything
+is
+so
+queer
+and
+it
+just
+seems
+to
+me
+I
+don
+t
+know
+what
+s
+the
+matter
+Dr
+Can
+t
+you
+look
+back
+and
+see
+whether
+something
+happened
+to
+you
+Sp
+I
+can
+t
+look
+back
+I
+have
+no
+eyes
+in
+my
+back
+Dr
+I
+mean
+think
+back
+Sp
+Think
+of
+my
+back
+Dr
+No
+think
+of
+your
+past
+Just
+use
+your
+thinking
+faculties
+Sp
+I
+don
+t
+know
+anything
+Dr
+You
+must
+not
+be
+so
+mentally
+lazy
+Sp
+What
+can
+a
+man
+do
+Dr
+This
+is
+a
+woman
+sitting
+here
+Are
+you
+a
+man
+or
+a
+woman
+SP
+I
+am
+a
+man
+that
+fellow
+is
+a
+man
+and
+the
+others
+are
+women
+I
+have
+always
+been
+a
+man
+I
+was
+never
+a
+woman
+and
+never
+will
+be
+You
+know
+I
+am
+a
+man
+Dr
+Look
+at
+your
+hands
+where
+did
+you
+get
+them
+Sp
+Those
+are
+not
+my
+hands
+Dr
+Look
+at
+your
+feet
+Sp
+They
+are
+not
+mine
+either
+I
+never
+was
+a
+woman
+and
+I
+don
+t
+want
+women
+s
+hands
+and
+feet
+and
+I
+don
+t
+want
+to
+borrow
+any
+one
+s
+body
+now
+Dr
+Are
+you
+old
+Sp
+Well
+I
+m
+not
+a
+young
+kid
+Dr
+You
+are
+probably
+old
+in
+years
+but
+not
+in
+knowledge
+Sp
+No
+I
+don
+t
+know
+that
+I
+have
+so
+much
+knowledge
+Dr
+If
+you
+had
+knowledge
+you
+would
+not
+be
+in
+your
+present
+position
+Sp
+That
+has
+nothing
+to
+do
+with
+knowledge
+Dr
+Knowledge
+is
+just
+what
+you
+lack
+Tell
+us
+what
+your
+name
+is
+Is
+it
+Mary
+Sp
+Have
+you
+ever
+heard
+of
+a
+man
+being
+named
+Mary
+That
+s
+ridiculous
+Dr
+Then
+tell
+us
+what
+your
+name
+is
+I
+can
+only
+guess
+Sp
+For
+goodness
+sake
+alive
+man
+it
+is
+a
+man
+s
+name
+not
+a
+woman
+s
+Dr
+Introduce
+yourself
+Sp
+What
+in
+the
+devil
+do
+you
+need
+my
+name
+for
+Dr
+You
+are
+well
+versed
+in
+English
+Did
+you
+have
+white
+hair
+as
+you
+have
+now
+Referring
+to
+hair
+of
+psychic
+Sp
+I
+had
+gray
+hair
+Dr
+Did
+you
+wear
+curls
+as
+you
+are
+doing
+now
+Sp
+No
+I
+don
+t
+like
+them
+Dr
+Did
+you
+wear
+a
+comb
+Sp
+Did
+you
+ever
+know
+of
+a
+man
+wearing
+a
+comb
+Dr
+Where
+did
+you
+get
+that
+wedding
+ring
+Sp
+I
+didn
+t
+steal
+anything
+I
+don
+t
+want
+a
+woman
+s
+hand
+Dr
+John
+where
+did
+you
+come
+from
+Sp
+I
+m
+not
+named
+John
+Dr
+What
+did
+your
+wife
+call
+you
+What
+did
+your
+mother
+call
+you
+Sp
+She
+called
+me
+Harry
+I
+was
+not
+married
+Dr
+What
+is
+your
+other
+name
+Sp
+I
+do
+not
+need
+to
+tell
+my
+name
+to
+a
+lot
+of
+women
+Dr
+There
+are
+some
+gentlemen
+present
+Sp
+How
+in
+the
+world
+did
+I
+get
+into
+this
+crowd
+of
+women
+I
+hate
+women
+Dr
+You
+must
+have
+been
+disappointed
+in
+love
+What
+was
+the
+trouble
+Sp
+I
+d
+be
+a
+big
+fool
+to
+tell
+my
+secrets
+to
+a
+lot
+of
+women
+Dr
+Why
+did
+she
+marry
+the
+other
+man
+Sp
+Who
+Dr
+The
+girl
+who
+jilted
+you
+Sp
+She
+never
+in
+my
+life
+no
+Dr
+Weren
+t
+you
+disappointed
+in
+love
+Sp
+No
+Dr
+Then
+why
+do
+you
+hate
+women
+Sp
+I
+must
+not
+tell
+you
+any
+of
+my
+secrets
+before
+this
+bunch
+of
+women
+so
+they
+can
+sit
+here
+and
+laugh
+at
+me
+I
+should
+like
+to
+know
+why
+all
+these
+women
+are
+staring
+at
+me
+What
+s
+the
+matter
+with
+that
+man
+over
+there
+Spirit
+I
+mean
+the
+one
+behind
+that
+lady
+Mrs
+Burton
+seated
+in
+circle
+Mrs
+B
+I
+m
+a
+man
+hater
+he
+can
+keep
+away
+from
+me
+Sp
+Why
+is
+that
+man
+around
+her
+Is
+he
+her
+husband
+Lady
+what
+does
+he
+hang
+around
+you
+for
+What
+s
+the
+matter
+with
+You
+Do
+you
+like
+him
+so
+well
+that
+you
+want
+him
+to
+stick
+to
+you
+like
+glue
+Dr
+Ask
+him
+how
+long
+he
+has
+been
+dead
+Sp
+He
+sure
+is
+an
+ugly
+thing
+I
+m
+afraid
+of
+him
+He
+looks
+like
+he
+wants
+to
+fight
+Dr
+Ask
+him
+how
+long
+he
+has
+been
+dead
+Sp
+Dead
+He
+sticks
+so
+she
+can
+t
+move
+without
+him
+Whenever
+she
+moves
+he
+moves
+He
+seems
+to
+me
+like
+a
+monkey
+Mrs
+B
+Say
+take
+him
+away
+with
+you
+will
+you
+Sp
+Why
+should
+I
+take
+him
+for
+For
+God
+s
+sake
+I
+don
+t
+know
+the
+fellow
+Do
+you
+like
+him
+lady
+Mrs
+B
+No
+I
+don
+t
+I
+m
+tired
+of
+him
+Sp
+What
+s
+the
+matter
+with
+him
+Is
+he
+your
+husband
+Mrs
+B
+No
+he
+is
+not
+and
+I
+don
+t
+understand
+it
+myself
+Sp
+Do
+you
+like
+him
+Mrs
+B
+No
+I
+want
+him
+to
+get
+away
+from
+me
+Sp
+Where
+am
+I
+anyhow
+Dr
+You
+are
+in
+Los
+Angeles
+California
+Sp
+There
+s
+also
+a
+woman
+around
+her
+and
+she
+sticks
+like
+glue
+Mrs
+B
+Are
+you
+here
+to
+help
+us
+Can
+t
+you
+take
+those
+things
+away
+from
+me
+Sp
+Do
+you
+like
+that
+man
+who
+is
+with
+you
+Mrs
+B
+No
+I
+am
+wild
+to
+get
+rid
+of
+him
+The
+door
+is
+wide
+open
+he
+can
+surely
+go
+Sp
+For
+God
+s
+sake
+shut
+the
+door
+I
+don
+t
+want
+such
+a
+man
+following
+me
+Why
+don
+t
+you
+tell
+the
+police
+Can
+t
+the
+police
+take
+him
+away
+from
+you
+if
+you
+don
+t
+want
+him
+Dr
+They
+are
+all
+spirits
+Sp
+Spirits
+Dr
+Yes
+like
+yourself
+Sp
+Oh
+you
+tell
+me
+that
+man
+is
+a
+ghost
+the
+one
+standing
+behind
+that
+woman
+there
+Dr
+Can
+you
+see
+him
+Sp
+He
+s
+no
+spirit
+he
+s
+a
+man
+He
+stands
+there
+He
+s
+afraid
+she
+will
+get
+away
+from
+him
+and
+he
+can
+t
+follow
+He
+says
+he
+is
+sick
+of
+her
+Dr
+He
+is
+a
+spirit
+but
+does
+not
+understand
+it
+She
+does
+not
+see
+him
+and
+neither
+do
+we
+He
+is
+invisible
+to
+us
+Sp
+What
+kind
+of
+a
+place
+is
+this
+I
+came
+to
+Dr
+We
+cannot
+see
+you
+either
+Sp
+You
+can
+t
+Don
+t
+you
+hear
+me
+Dr
+We
+hear
+you
+but
+we
+can
+t
+see
+you
+Sp
+Is
+this
+a
+crowd
+of
+blind
+people
+I
+can
+see
+them
+all
+and
+lots
+more
+The
+whole
+room
+is
+full
+of
+people
+Dr
+We
+can
+hear
+you
+but
+we
+can
+only
+hear
+you
+talk
+through
+a
+woman
+s
+body
+Sp
+Now
+you
+re
+kidding
+me
+You
+think
+that
+I
+I
+would
+ever
+talk
+through
+a
+woman
+Not
+much
+I
+would
+not
+go
+across
+the
+street
+to
+talk
+through
+a
+woman
+You
+know
+I
+can
+t
+understand
+what
+this
+thing
+is
+I
+don
+t
+know
+why
+I
+should
+be
+here
+I
+don
+t
+know
+what
+s
+the
+matter
+all
+of
+you
+are
+sitting
+around
+looking
+at
+me
+Why
+are
+there
+people
+standing
+around
+each
+one
+here
+There
+are
+others
+standing
+around
+looking
+at
+me
+too
+Could
+they
+have
+conversation
+with
+a
+fellow
+Dr
+If
+I
+explain
+to
+you
+will
+you
+try
+to
+understand
+In
+the
+first
+place
+you
+are
+dead
+as
+people
+would
+say
+Sp
+If
+I
+m
+a
+dead
+one
+that
+s
+a
+good
+thing
+Dr
+You
+yourself
+are
+not
+dead
+Sp
+But
+you
+said
+I
+was
+dead
+Dr
+You
+are
+dead
+to
+your
+own
+people
+and
+friends
+We
+know
+you
+are
+not
+dead
+in
+reality
+you
+only
+lost
+your
+physical
+body
+But
+you
+also
+have
+a
+spirit
+body
+when
+you
+pass
+out
+of
+your
+mortal
+body
+You
+find
+yourself
+alive
+and
+you
+have
+a
+spirit
+body
+but
+you
+cannot
+explain
+it
+Sp
+I
+know
+I
+have
+been
+walking
+a
+very
+great
+deal
+and
+it
+seems
+to
+me
+I
+never
+get
+anywhere
+I
+saw
+a
+lot
+of
+people
+here
+I
+came
+here
+with
+the
+crowd
+and
+before
+I
+knew
+it
+everything
+was
+light
+and
+I
+saw
+you
+all
+sitting
+around
+in
+a
+circle
+singing
+I
+thought
+it
+was
+a
+prayer
+meeting
+so
+I
+stopped
+and
+before
+I
+knew
+anything
+I
+could
+talk
+Before
+then
+I
+thought
+I
+must
+be
+deaf
+and
+dumb
+and
+blind
+because
+I
+could
+not
+see
+anything
+and
+I
+am
+so
+tired
+Dr
+Most
+of
+those
+you
+see
+here
+are
+spirits
+like
+yourself
+Sp
+Why
+are
+we
+here
+Dr
+Many
+have
+been
+brought
+to
+obtain
+understanding
+You
+yourself
+are
+controlling
+my
+wife
+s
+body
+You
+are
+not
+my
+wife
+but
+you
+are
+using
+my
+wife
+s
+body
+It
+does
+not
+make
+any
+difference
+how
+strange
+it
+seems
+to
+you
+it
+is
+a
+fact
+You
+are
+invisible
+to
+us
+and
+you
+are
+speaking
+through
+my
+wife
+s
+organism
+That
+man
+you
+speak
+of
+is
+a
+spirit
+too
+Take
+him
+with
+you
+when
+you
+go
+He
+is
+invisible
+to
+us
+Sp
+I
+should
+like
+to
+fight
+him
+Dr
+Did
+you
+ever
+read
+the
+Bible
+Sp
+Yes
+a
+long
+time
+ago
+I
+have
+not
+seen
+one
+for
+a
+long
+time
+Dr
+You
+remember
+reading
+in
+the
+Bible
+about
+obsessing
+spirits
+that
+Jesus
+cast
+out
+He
+is
+one
+of
+that
+kind
+Sp
+They
+are
+all
+around
+that
+woman
+Mrs
+B
+Mrs
+B
+I
+have
+the
+door
+closed
+now
+Sp
+If
+you
+keep
+the
+door
+closed
+I
+ll
+take
+them
+along
+with
+me
+I
+want
+to
+fight
+with
+that
+fellow
+anyhow
+What
+s
+your
+name
+Dr
+What
+does
+he
+say
+Sp
+He
+says
+his
+name
+is
+Jim
+McDonald
+Don
+t
+you
+know
+him
+lady
+If
+he
+is
+a
+spirit
+for
+goodness
+sake
+why
+does
+be
+hang
+on
+to
+that
+woman
+when
+she
+doesn
+t
+want
+him
+Dr
+Perhaps
+he
+found
+himself
+there
+as
+you
+find
+yourself
+here
+You
+say
+you
+saw
+a
+crowd
+a
+light
+and
+here
+you
+are
+Sp
+That
+man
+says
+he
+was
+walking
+in
+the
+dark
+and
+saw
+that
+lady
+Say
+will
+I
+always
+have
+to
+stay
+here
+too
+Ques
+What
+are
+the
+names
+of
+those
+around
+me
+This
+was
+asked
+by
+another
+patient
+Sp
+There
+are
+two
+They
+fight
+once
+in
+a
+while
+I
+see
+them
+fighting
+Ques
+I
+fight
+them
+too
+Dr
+Do
+not
+fight
+them
+physically
+that
+gives
+them
+strength
+and
+magnetism
+When
+you
+fight
+them
+in
+that
+way
+you
+give
+them
+much
+more
+strength
+You
+hold
+them
+by
+fighting
+them
+as
+you
+do
+Fight
+them
+mentally
+Why
+don
+t
+you
+try
+to
+close
+up
+Sp
+I
+will
+take
+them
+along
+too
+if
+I
+can
+Don
+t
+fist
+fight
+them
+any
+more
+I
+don
+t
+know
+what
+s
+the
+matter
+with
+me
+I
+feel
+strange
+Dr
+Where
+was
+your
+home
+Sp
+It
+was
+in
+Detroit
+Michigan
+Dr
+What
+year
+can
+you
+recall
+Sp
+I
+can
+t
+recall
+any
+Dr
+Who
+is
+President
+Sp
+I
+don
+t
+know
+for
+sure
+but
+I
+think
+Cleveland
+Dr
+He
+was
+President
+a
+long
+time
+ago
+Sp
+I
+have
+been
+walking
+so
+long
+that
+I
+feel
+tired
+Is
+there
+any
+rest
+for
+a
+weary
+person
+Have
+you
+a
+bed
+so
+that
+I
+can
+lie
+down
+and
+rest
+Dr
+If
+you
+look
+around
+you
+will
+see
+intelligent
+spirits
+Sp
+Why
+I
+see
+some
+beautiful
+girls
+No
+girls
+I
+will
+not
+come
+with
+you
+Don
+t
+try
+to
+fool
+me
+I
+m
+not
+going
+with
+you
+not
+much
+Dr
+They
+are
+different
+from
+the
+girls
+you
+have
+known
+They
+are
+not
+mortal
+girls
+they
+are
+spirits
+Sp
+They
+have
+a
+smile
+like
+others
+to
+give
+to
+a
+man
+Dr
+They
+are
+different
+altogether
+They
+help
+spirits
+who
+need
+help
+Sp
+Those
+girls
+seem
+to
+be
+honest
+but
+you
+know
+I
+hate
+women
+Dr
+You
+should
+not
+condemn
+them
+all
+because
+one
+was
+false
+Sp
+You
+see
+I
+want
+to
+take
+all
+those
+folks
+with
+me
+If
+I
+can
+I
+will
+take
+them
+with
+me
+I
+think
+I
+will
+follow
+those
+girls
+anyhow
+Surprised
+Why
+there
+s
+my
+mother
+She
+s
+been
+dead
+and
+gone
+a
+long
+time
+Dr
+She
+s
+not
+dead
+SP
+Don
+t
+you
+think
+she
+s
+in
+Heaven
+Dr
+Ask
+her
+She
+can
+speak
+for
+herself
+Sp
+She
+says
+she
+is
+in
+a
+beautiful
+place
+called
+the
+spirit
+world
+Dr
+The
+spirit
+world
+surrounds
+the
+physical
+Heaven
+is
+a
+condition
+within
+you
+when
+you
+have
+found
+that
+you
+will
+be
+contented
+and
+happy
+That
+is
+what
+Jesus
+taught
+also
+Sp
+I
+should
+like
+to
+go
+with
+my
+mother
+She
+s
+a
+good
+old
+lady
+I
+want
+to
+take
+McDonald
+along
+too
+Come
+here
+McDonald
+I
+don
+t
+want
+to
+stay
+around
+here
+any
+longer
+and
+I
+want
+you
+to
+come
+along
+He
+acts
+as
+if
+he
+is
+trying
+hard
+to
+wake
+up
+Say
+come
+on
+McDonald
+let
+us
+be
+good
+fellows
+and
+go
+with
+those
+girls
+for
+they
+might
+be
+honest
+and
+sincere
+Mother
+you
+come
+along
+too
+I
+will
+go
+now
+Goodby
+Come
+on
+you
+fellows
+Say
+what
+do
+you
+stick
+to
+that
+woman
+for
+anyhow
+I
+should
+be
+ashamed
+of
+myself
+hanging
+around
+her
+I
+m
+going
+Goodbye
+Mrs
+B
+Be
+sure
+and
+take
+them
+along
+with
+you
+Dr
+What
+is
+your
+name
+Sp
+Harry
+That
+is
+all
+I
+can
+remember
+I
+have
+not
+heard
+my
+name
+for
+many
+years
+Dr
+Make
+the
+others
+understand
+the
+folly
+of
+staying
+Sp
+I
+m
+going
+to
+take
+those
+fellows
+along
+Now
+you
+look
+here
+You
+re
+going
+to
+come
+along
+with
+me
+I
+ll
+fight
+every
+damned
+one
+of
+you
+that
+won
+t
+come
+You
+ought
+to
+be
+ashamed
+to
+stick
+around
+a
+woman
+like
+you
+do
+Now
+come
+along
+with
+me
+you
+see
+they
+come
+I
+ll
+look
+after
+them
+all
+right
+Goodbye
+During
+another
+circle
+Frank
+one
+of
+the
+spirits
+interfering
+with
+Mrs
+Burton
+left
+her
+and
+controlled
+the
+intermediary
+exhibiting
+little
+trace
+of
+memory
+in
+any
+form
+Spirit
+FRANK
+Patient
+MRS
+BURTON
+Dr
+Where
+did
+you
+come
+from
+Sp
+I
+don
+t
+know
+Dr
+Do
+you
+know
+any
+one
+here
+Sp
+I
+don
+t
+see
+anybody
+I
+know
+Dr
+Don
+t
+you
+know
+where
+you
+came
+from
+Sp
+I
+don
+t
+know
+myself
+How
+can
+I
+answer
+questions
+when
+I
+don
+t
+know
+Dr
+How
+long
+have
+you
+been
+dead
+Sp
+Dead
+The
+idea
+Say
+what
+s
+the
+matter
+with
+me
+I
+think
+it
+looks
+very
+funny
+to
+see
+you
+all
+sitting
+around
+here
+Are
+you
+having
+a
+meeting
+or
+what
+is
+it
+called
+anyhow
+Dr
+Yes
+it
+s
+a
+meeting
+Try
+to
+tell
+us
+who
+you
+are
+Sp
+I
+don
+t
+know
+why
+I
+should
+tell
+you
+that
+Dr
+You
+are
+a
+stranger
+to
+us
+Sp
+I
+don
+t
+know
+whether
+I
+shall
+stay
+here
+or
+not
+I
+am
+always
+peculiar
+among
+strangers
+you
+know
+Dr
+Tell
+us
+where
+you
+came
+from
+Sp
+For
+my
+dear
+life
+I
+don
+t
+know
+myself
+so
+how
+can
+I
+tell
+you
+Say
+why
+do
+you
+hold
+my
+arm
+I
+m
+a
+strong
+man
+and
+can
+sit
+still
+by
+myself
+Dr
+I
+thought
+you
+were
+a
+woman
+Sp
+God
+above
+Why
+do
+you
+think
+I
+m
+a
+woman
+You
+ll
+have
+to
+look
+again
+because
+I
+am
+a
+man
+sure
+enough
+and
+I
+ve
+always
+been
+a
+man
+But
+things
+are
+funny
+and
+I
+don
+t
+know
+it
+has
+been
+so
+peculiar
+with
+me
+for
+some
+time
+You
+know
+I
+was
+walking
+along
+and
+then
+I
+heard
+some
+singing
+so
+I
+thought
+I
+would
+peek
+in
+and
+before
+I
+knew
+it
+I
+was
+feeling
+fine
+You
+know
+I
+have
+not
+been
+feeling
+well
+for
+some
+time
+everything
+has
+seemed
+unusual
+After
+becoming
+enmeshed
+in
+aura
+of
+sensitive
+I
+don
+t
+know
+what
+is
+the
+matter
+with
+me
+anyhow
+Somebody
+said
+to
+me
+that
+if
+I
+came
+in
+where
+the
+singing
+was
+I
+would
+find
+out
+what
+is
+the
+matter
+with
+me
+I
+have
+asked
+everybody
+I
+saw
+but
+everybody
+passed
+by
+they
+were
+so
+stuck
+up
+they
+wouldn
+t
+talk
+to
+a
+fellow
+any
+more
+The
+people
+all
+looked
+like
+wax
+to
+me
+Dear
+life
+I
+ve
+been
+talking
+and
+talking
+and
+walking
+and
+walking
+and
+for
+dear
+life
+I
+could
+never
+get
+any
+one
+to
+answer
+me
+or
+take
+any
+notice
+of
+me
+before
+As
+a
+spirit
+he
+was
+invisible
+to
+mortals
+and
+therefore
+unnoticed
+by
+them
+You
+are
+the
+first
+one
+to
+answer
+any
+question
+I
+have
+some
+little
+peculiar
+kind
+of
+thing
+in
+my
+throat
+once
+in
+a
+while
+and
+I
+can
+t
+talk
+and
+then
+I
+seem
+to
+get
+well
+again
+But
+I
+feel
+queer
+so
+queer
+Dr
+Can
+you
+remember
+anything
+happening
+to
+you
+at
+some
+time
+Sp
+Something
+happens
+every
+day
+One
+time
+I
+remember
+one
+thing
+and
+another
+time
+something
+else
+but
+I
+don
+t
+remember
+anything
+clearly
+I
+cannot
+for
+dear
+life
+know
+where
+I
+am
+at
+It
+is
+the
+most
+peculiar
+thing
+I
+ever
+saw
+Dr
+How
+old
+are
+you
+Sp
+I
+cannot
+tell
+you
+that
+I
+haven
+t
+known
+my
+age
+for
+some
+time
+Nobody
+ever
+asks
+me
+about
+that
+and
+the
+natural
+circumstance
+is
+that
+I
+forgot
+Hearing
+a
+passing
+train
+Why
+there
+s
+a
+train
+coming
+It
+s
+a
+long
+time
+since
+I
+heard
+that
+It
+seems
+I
+live
+again
+for
+a
+short
+time
+I
+don
+t
+know
+what
+it
+is
+Dr
+Where
+did
+you
+live
+formerly
+Where
+do
+you
+think
+you
+are
+now
+Sp
+I
+don
+t
+know
+where
+I
+lived
+before
+but
+right
+now
+I
+am
+in
+this
+room
+with
+a
+lot
+of
+people
+Dr
+Do
+you
+know
+you
+are
+in
+Los
+Angeles
+California
+Sp
+For
+dear
+life
+no
+Dr
+Where
+do
+you
+think
+you
+ought
+to
+be
+Sp
+I
+cannot
+seem
+to
+recall
+things
+There
+are
+times
+that
+I
+can
+tell
+you
+that
+I
+am
+a
+woman
+and
+then
+I
+get
+some
+kind
+of
+funny
+thing
+I
+do
+not
+like
+Static
+treatment
+of
+patient
+Dr
+What
+do
+you
+get
+Sp
+When
+I
+am
+a
+woman
+I
+have
+long
+hair
+and
+when
+the
+hair
+is
+hanging
+down
+this
+funny
+thing
+begins
+Mrs
+Burton
+was
+in
+the
+habit
+of
+taking
+her
+hair
+down
+during
+a
+treatment
+Dr
+What
+do
+you
+mean
+Sp
+It
+seems
+like
+a
+million
+needles
+strike
+me
+and
+for
+Gods
+sake
+it
+is
+the
+worst
+thing
+I
+ever
+had
+in
+my
+whole
+life
+I
+don
+t
+want
+to
+be
+a
+woman
+I
+only
+get
+that
+funny
+thing
+when
+I
+am
+a
+woman
+Seeing
+Mrs
+B
+in
+circle
+She
+s
+the
+one
+with
+the
+long
+hair
+To
+Mrs
+B
+I
+m
+going
+to
+get
+you
+Dr
+Do
+you
+know
+that
+lady
+Sp
+Yes
+she
+gets
+so
+mad
+at
+me
+at
+times
+and
+wants
+to
+chase
+me
+away
+Dr
+She
+probably
+doesn
+t
+want
+you
+around
+Possibly
+you
+bother
+her
+SP
+She
+bothers
+me
+too
+Dr
+Try
+to
+understand
+your
+condition
+Cannot
+you
+realize
+that
+you
+are
+so
+called
+dead
+At
+this
+time
+you
+are
+a
+woman
+Look
+at
+your
+clothes
+You
+say
+you
+are
+a
+man
+and
+yet
+you
+are
+wearing
+the
+clothes
+of
+a
+woman
+Sp
+For
+God
+s
+sake
+I
+don
+t
+want
+to
+be
+a
+woman
+any
+more
+I
+m
+a
+man
+and
+I
+want
+to
+be
+a
+man
+I
+used
+to
+be
+a
+man
+all
+the
+time
+but
+I
+cannot
+for
+dear
+life
+know
+how
+I
+can
+get
+out
+of
+this
+condition
+That
+woman
+says
+to
+go
+and
+I
+try
+to
+get
+out
+but
+I
+cannot
+Suddenly
+recognizing
+Dr
+W
+You
+are
+the
+one
+that
+gave
+me
+that
+fire
+Praise
+the
+Lord
+I
+want
+to
+get
+rid
+of
+you
+I
+don
+t
+like
+you
+with
+all
+those
+fires
+you
+give
+me
+I
+don
+t
+want
+to
+have
+anything
+to
+do
+with
+you
+Mrs
+B
+How
+long
+have
+you
+been
+with
+me
+Sp
+With
+you
+You
+always
+chase
+me
+out
+What
+did
+you
+do
+with
+that
+woman
+that
+was
+with
+me
+Another
+spirit
+obsessing
+the
+patient
+dislodged
+previously
+She
+sang
+for
+me
+We
+have
+lost
+her
+I
+have
+been
+hunting
+and
+hunting
+for
+her
+Can
+you
+tell
+me
+where
+she
+is
+Dr
+She
+left
+that
+lady
+and
+controlled
+this
+same
+body
+as
+you
+are
+doing
+now
+After
+that
+she
+went
+to
+the
+spirit
+world
+That
+is
+where
+you
+are
+going
+when
+you
+leave
+here
+Sp
+That
+woman
+Mrs
+B
+has
+no
+business
+to
+scold
+me
+like
+she
+does
+I
+haven
+t
+done
+her
+any
+harm
+Dr
+Suppose
+you
+were
+a
+lady
+and
+some
+spirit
+bothered
+you
+would
+you
+like
+it
+Sp
+Certainly
+I
+would
+not
+like
+it
+very
+well
+Dr
+You
+bothered
+her
+You
+are
+a
+spirit
+and
+she
+is
+a
+mortal
+She
+wants
+to
+get
+rid
+of
+you
+Sp
+She
+bothers
+me
+with
+all
+those
+needles
+They
+hit
+her
+on
+the
+head
+and
+it
+seems
+like
+the
+needles
+are
+hitting
+my
+head
+Dr
+She
+is
+in
+her
+mortal
+body
+but
+you
+are
+a
+spirit
+invisible
+to
+us
+Sp
+What
+do
+you
+mean
+Dr
+Just
+exactly
+what
+I
+say
+Your
+mind
+is
+invisible
+to
+us
+You
+are
+temporarily
+controlling
+my
+wife
+s
+body
+Sp
+Why
+I
+never
+saw
+your
+wife
+and
+I
+do
+not
+want
+to
+I
+Will
+tell
+you
+one
+thing
+I
+am
+a
+man
+and
+will
+never
+be
+anything
+else
+and
+I
+don
+t
+want
+to
+be
+married
+to
+you
+Dr
+You
+may
+be
+a
+man
+as
+you
+claim
+but
+I
+want
+you
+to
+recognize
+the
+fact
+that
+you
+are
+invisible
+to
+us
+This
+is
+my
+wife
+s
+body
+See
+Chap
+Page
+Spirit
+Carrie
+Huntington
+Sp
+For
+God
+s
+sake
+sure
+I
+am
+a
+woman
+Noticing
+clothes
+of
+psychic
+For
+the
+land
+s
+sake
+alive
+when
+did
+these
+clothes
+come
+on
+me
+Dr
+They
+have
+been
+on
+you
+quite
+a
+while
+How
+did
+you
+get
+here
+Sp
+Somebody
+said
+You
+go
+in
+there
+and
+you
+will
+get
+understanding
+because
+you
+do
+not
+need
+to
+wander
+as
+you
+are
+doing
+And
+now
+I
+am
+a
+woman
+Dr
+Only
+temporarily
+Try
+to
+understand
+what
+I
+am
+telling
+you
+You
+lost
+your
+body
+perhaps
+a
+long
+time
+ago
+Sp
+That
+woman
+Mrs
+B
+is
+the
+fault
+of
+it
+Dr
+You
+have
+been
+bothering
+that
+lady
+probably
+for
+many
+years
+and
+you
+may
+have
+been
+troubling
+others
+What
+is
+your
+name
+Sp
+I
+can
+t
+think
+Dr
+You
+lost
+your
+own
+body
+and
+have
+been
+wandering
+around
+in
+that
+outer
+darkness
+which
+is
+described
+in
+the
+Bible
+Were
+you
+a
+religious
+man
+Sp
+I
+don
+t
+want
+to
+have
+anything
+to
+do
+with
+the
+churches
+I
+am
+sick
+and
+tired
+of
+them
+all
+They
+all
+say
+if
+you
+do
+not
+do
+so
+and
+so
+you
+will
+go
+straight
+to
+hell
+where
+you
+will
+bum
+forever
+They
+teach
+and
+preach
+damnation
+you
+know
+I
+was
+quite
+a
+young
+man
+when
+a
+minister
+told
+me
+I
+would
+go
+to
+that
+terrible
+hell
+and
+they
+did
+not
+want
+me
+in
+the
+church
+any
+more
+because
+I
+did
+not
+do
+as
+they
+said
+I
+should
+I
+did
+not
+believe
+any
+of
+it
+I
+was
+not
+such
+a
+very
+bad
+man
+After
+I
+left
+that
+church
+I
+thought
+I
+would
+try
+another
+For
+dear
+life
+I
+got
+into
+the
+same
+hell
+and
+damnation
+and
+I
+was
+tired
+of
+it
+all
+They
+talked
+of
+God
+and
+holy
+things
+They
+said
+I
+should
+give
+my
+money
+to
+God
+They
+said
+I
+should
+give
+my
+tobacco
+to
+God
+I
+could
+not
+see
+why
+God
+should
+need
+my
+tobacco
+and
+what
+little
+money
+I
+had
+I
+could
+not
+see
+things
+that
+way
+so
+I
+left
+that
+church
+I
+went
+to
+another
+church
+and
+they
+talked
+and
+talked
+to
+me
+After
+awhile
+they
+said
+that
+the
+devil
+was
+after
+me
+because
+I
+would
+not
+give
+my
+money
+to
+the
+church
+One
+time
+I
+had
+been
+out
+with
+the
+boys
+for
+a
+while
+I
+never
+drank
+too
+much
+but
+I
+drank
+enough
+that
+time
+to
+be
+lively
+I
+thought
+now
+I
+will
+go
+right
+straight
+up
+to
+the
+front
+and
+sit
+down
+so
+I
+did
+They
+tried
+to
+save
+my
+soul
+for
+God
+so
+they
+told
+me
+The
+minister
+said
+that
+the
+devil
+was
+right
+after
+me
+and
+I
+got
+pretty
+seared
+He
+said
+And
+he
+is
+going
+to
+get
+you
+I
+thought
+I
+would
+look
+behind
+and
+probably
+I
+might
+see
+him
+but
+I
+didn
+t
+He
+said
+Come
+up
+come
+up
+and
+we
+will
+save
+your
+soul
+from
+hell
+come
+and
+be
+saved
+Come
+to
+the
+front
+and
+be
+converted
+You
+will
+be
+born
+again
+I
+was
+a
+little
+contrary
+for
+a
+while
+and
+then
+I
+got
+up
+and
+went
+right
+up
+to
+the
+front
+as
+I
+wanted
+to
+see
+what
+they
+would
+do
+The
+minister
+said
+Now
+you
+kneel
+down
+there
+So
+I
+knelt
+down
+He
+put
+his
+hands
+on
+my
+head
+and
+they
+all
+sang
+and
+sang
+and
+they
+prayed
+and
+prayed
+for
+me
+They
+said
+Be
+converted
+now
+I
+thought
+it
+was
+grand
+all
+the
+girls
+putting
+their
+hands
+on
+me
+and
+singing
+and
+praying
+for
+me
+Then
+the
+minister
+came
+again
+and
+he
+said
+You
+will
+have
+to
+pray
+or
+the
+devil
+will
+get
+after
+you
+I
+could
+not
+be
+a
+hypocrite
+so
+I
+told
+him
+if
+I
+was
+a
+sinner
+I
+would
+have
+to
+stay
+one
+I
+don
+t
+believe
+the
+devil
+is
+a
+person
+anyhow
+so
+I
+told
+him
+and
+he
+was
+angry
+He
+thought
+I
+was
+a
+bad
+pill
+They
+tried
+all
+they
+could
+to
+convert
+me
+but
+it
+was
+no
+good
+so
+I
+finally
+went
+away
+After
+I
+left
+there
+some
+men
+came
+after
+me
+so
+I
+ran
+as
+hard
+as
+I
+could
+then
+somebody
+struck
+me
+on
+the
+head
+and
+I
+had
+great
+pain
+I
+fell
+down
+but
+I
+got
+up
+again
+I
+wanted
+to
+give
+that
+man
+a
+push
+down
+the
+hill
+but
+he
+pushed
+me
+and
+I
+rolled
+and
+rolled
+down
+that
+hill
+There
+were
+lots
+of
+people
+around
+me
+after
+I
+stopped
+rolling
+and
+all
+at
+once
+I
+felt
+all
+right
+again
+Dr
+That
+was
+probably
+the
+time
+you
+lost
+your
+physical
+body
+You
+died
+Sp
+I
+did
+not
+die
+Dr
+What
+place
+was
+it
+where
+you
+rolled
+down
+the
+hill
+Sp
+It
+was
+down
+in
+Texas
+I
+walked
+and
+ran
+and
+tried
+to
+talk
+to
+people
+but
+they
+would
+not
+answer
+me
+they
+seemed
+like
+sticks
+I
+felt
+so
+queer
+in
+my
+head
+I
+asked
+them
+if
+they
+could
+tell
+me
+where
+my
+home
+was
+I
+felt
+that
+pain
+Once
+in
+a
+while
+I
+could
+get
+away
+I
+then
+came
+to
+a
+lady
+and
+she
+said
+Come
+along
+and
+before
+I
+knew
+it
+we
+had
+a
+crowd
+around
+us
+and
+she
+used
+to
+sing
+Evidently
+the
+spirit
+Carrie
+Huntington
+The
+Patient
+Mrs
+B
+had
+often
+been
+annoyed
+by
+the
+singing
+of
+spirits
+I
+talked
+to
+her
+once
+in
+a
+while
+and
+then
+all
+at
+once
+she
+disappeared
+and
+after
+that
+I
+got
+the
+needles
+Came
+more
+fully
+into
+control
+of
+patient
+and
+felt
+electrical
+treatments
+more
+keen
+I
+felt
+them
+pretty
+bad
+Dr
+You
+are
+a
+spirit
+and
+are
+now
+using
+my
+wife
+s
+body
+Sp
+How
+in
+the
+world
+did
+I
+get
+into
+your
+wife
+s
+body
+Do
+You
+like
+your
+wife
+to
+be
+all
+kinds
+of
+tramps
+Dr
+Yes
+long
+enough
+to
+give
+the
+spirits
+an
+understanding
+regarding
+the
+invisible
+side
+Sp
+Are
+these
+your
+wife
+s
+clothes
+Did
+I
+borrow
+them
+for
+a
+while
+Did
+your
+wife
+dress
+me
+I
+am
+sorry
+to
+show
+myself
+like
+a
+woman
+and
+not
+like
+a
+man
+What
+will
+these
+people
+think
+that
+I
+m
+crazy
+Laughter
+It
+isn
+t
+funny
+Dr
+You
+are
+an
+ignorant
+spirit
+in
+outer
+darkness
+Intelligent
+spirits
+have
+brought
+you
+here
+to
+control
+this
+body
+temporarily
+so
+that
+you
+can
+understand
+your
+condition
+Also
+they
+took
+you
+away
+from
+that
+lady
+Mrs
+B
+Sp
+Will
+she
+get
+those
+awful
+needles
+again
+Dr
+Are
+there
+any
+more
+persons
+where
+you
+came
+from
+Or
+are
+you
+the
+last
+one
+Sp
+The
+woman
+and
+the
+other
+man
+went
+then
+you
+gave
+me
+the
+needles
+I
+kicked
+like
+a
+steer
+to
+get
+out
+but
+I
+could
+not
+How
+could
+you
+expect
+me
+to
+do
+any
+better
+I
+thought
+of
+the
+minister
+that
+talked
+about
+hell
+Dr
+That
+hell
+was
+not
+like
+this
+There
+are
+spirits
+here
+who
+will
+teach
+you
+how
+to
+progress
+in
+the
+spirit
+world
+they
+will
+help
+you
+Is
+your
+father
+living
+Sp
+I
+don
+t
+know
+I
+haven
+t
+seen
+my
+father
+for
+about
+twenty
+five
+or
+thirty
+years
+Mother
+is
+dead
+but
+I
+don
+t
+know
+whether
+father
+is
+or
+not
+I
+don
+t
+know
+any
+of
+my
+relatives
+Mrs
+B
+Did
+I
+meet
+you
+last
+November
+Sp
+Yes
+I
+have
+been
+ill
+ever
+since
+that
+time
+I
+was
+not
+the
+one
+that
+was
+with
+you
+close
+that
+was
+the
+young
+lady
+My
+head
+is
+hurting
+me
+terribly
+Dr
+What
+year
+do
+you
+think
+it
+should
+be
+Sp
+I
+should
+think
+about
+or
+Dr
+It
+is
+now
+Sp
+I
+think
+there
+must
+be
+something
+the
+matter
+with
+me
+Dr
+You
+have
+been
+in
+outer
+darkness
+for
+some
+time
+Sp
+I
+have
+been
+walking
+and
+walking
+and
+I
+got
+with
+that
+lady
+over
+there
+Mrs
+B
+I
+wanted
+to
+go
+I
+kicked
+and
+she
+kicked
+and
+we
+had
+regular
+kickings
+Oh
+look
+there
+See
+My
+Mother
+Oh
+Mother
+Can
+you
+forgive
+me
+I
+was
+not
+as
+you
+wanted
+me
+to
+be
+Mother
+will
+you
+take
+me
+I
+am
+so
+tired
+I
+need
+your
+care
+and
+help
+Will
+you
+take
+me
+Oh
+my
+Mother
+Dr
+What
+does
+she
+say
+Sp
+She
+calls
+me
+She
+says
+Yes
+Frank
+you
+will
+come
+with
+me
+I
+have
+been
+looking
+for
+you
+a
+long
+time
+I
+am
+getting
+weak
+I
+feel
+so
+tired
+Mother
+says
+Frank
+we
+had
+not
+the
+understanding
+of
+the
+real
+life
+because
+we
+were
+not
+taught
+what
+we
+should
+have
+been
+taught
+so
+that
+we
+did
+not
+learn
+to
+know
+God
+s
+wonderful
+universe
+Religion
+is
+a
+long
+way
+from
+the
+real
+life
+The
+ministers
+all
+teach
+that
+we
+should
+just
+believe
+and
+then
+we
+are
+saved
+No
+no
+belief
+is
+only
+a
+setback
+Get
+knowledge
+of
+God
+We
+do
+not
+do
+that
+Frank
+we
+will
+help
+you
+to
+learn
+what
+a
+beautiful
+world
+there
+is
+on
+the
+other
+side
+when
+we
+have
+understanding
+You
+have
+to
+make
+your
+own
+efforts
+to
+learn
+to
+understand
+the
+Golden
+Rule
+of
+God
+s
+beautiful
+teaching
+of
+life
+and
+be
+of
+help
+and
+service
+to
+your
+fellowman
+Now
+Frank
+she
+says
+you
+have
+been
+very
+mischievous
+in
+your
+life
+I
+know
+you
+were
+a
+good
+boy
+but
+you
+always
+were
+too
+lively
+You
+were
+ignorant
+of
+the
+real
+life
+and
+went
+away
+from
+home
+when
+I
+died
+The
+home
+was
+broken
+up
+you
+went
+one
+way
+and
+the
+rest
+went
+another
+I
+did
+not
+know
+Frank
+what
+things
+were
+but
+I
+wish
+the
+truth
+could
+be
+taught
+She
+says
+Now
+come
+with
+me
+to
+the
+spirit
+world
+where
+we
+have
+understanding
+There
+we
+have
+love
+harmony
+peace
+and
+bliss
+but
+we
+have
+to
+live
+for
+one
+another
+You
+have
+to
+go
+to
+school
+and
+learn
+You
+must
+not
+bother
+any
+one
+any
+more
+as
+you
+have
+done
+Come
+Frank
+and
+we
+will
+go
+to
+a
+beautiful
+home
+in
+the
+spirit
+world
+Thank
+you
+and
+Goodby
+Several
+weeks
+later
+the
+last
+intruder
+left
+Mrs
+Burton
+and
+through
+Mrs
+Wickland
+inquired
+for
+the
+companions
+who
+had
+preceded
+her
+resenting
+having
+been
+held
+captive
+Spirit
+MAGGIE
+WILKINSON
+Patient
+MRS
+BURTON
+Dr
+Good
+Evening
+friend
+who
+are
+you
+Taking
+psychic
+s
+hand
+Sp
+Don
+t
+hold
+my
+hand
+Don
+t
+touch
+me
+Dr
+What
+is
+your
+name
+Sp
+My
+name
+is
+Maggie
+Dr
+Maggie
+what
+Sp
+Maggie
+Wilkinson
+Dr
+Do
+you
+know
+that
+you
+are
+in
+Los
+Angeles
+Where
+did
+You
+come
+from
+SP
+I
+came
+from
+Dallas
+Texas
+Dr
+How
+did
+you
+reach
+Los
+Angeles
+SP
+I
+am
+not
+in
+Los
+Angeles
+I
+am
+in
+Texas
+I
+have
+been
+kicking
+and
+kicking
+all
+the
+time
+Dr
+Why
+did
+you
+do
+that
+SP
+I
+have
+been
+kicking
+because
+I
+have
+been
+in
+a
+prison
+Victim
+s
+aura
+There
+were
+several
+of
+us
+but
+they
+have
+all
+disappeared
+Other
+obsessing
+spirits
+previously
+dislodged
+from
+patient
+They
+have
+all
+gone
+but
+me
+and
+I
+don
+t
+like
+it
+Dr
+Would
+you
+like
+to
+go
+where
+your
+friends
+have
+gone
+Sp
+I
+don
+t
+care
+I
+really
+don
+t
+care
+for
+the
+others
+anyway
+They
+always
+wanted
+to
+have
+everything
+and
+I
+was
+always
+behind
+Dr
+Don
+t
+you
+realize
+that
+you
+are
+in
+a
+strange
+condition
+Tell
+us
+how
+long
+you
+have
+been
+dead
+Sp
+Dead
+Why
+is
+that
+woman
+with
+me
+all
+the
+time
+Patient
+She
+always
+gets
+fire
+She
+gets
+the
+worst
+kind
+of
+things
+She
+gets
+up
+on
+something
+puts
+something
+over
+her
+head
+and
+then
+fire
+comes
+When
+Mrs
+Burton
+seated
+herself
+upon
+a
+platform
+beside
+the
+static
+machine
+she
+covered
+her
+head
+with
+a
+woolen
+blanket
+to
+make
+the
+electricity
+more
+effective
+Dr
+Do
+you
+feel
+that
+you
+are
+in
+the
+right
+place
+Sp
+Where
+shall
+I
+go
+Dr
+To
+the
+spirit
+world
+Sp
+What
+is
+that
+Dr
+That
+is
+where
+people
+go
+after
+passing
+out
+of
+their
+bodies
+when
+they
+have
+understanding
+Don
+t
+you
+realize
+that
+something
+strange
+has
+happened
+to
+you
+Sp
+If
+you
+could
+get
+that
+blanket
+from
+being
+put
+on
+my
+head
+and
+that
+fire
+I
+should
+be
+all
+right
+It
+seems
+that
+I
+was
+knocked
+to
+pieces
+How
+in
+the
+world
+can
+anyone
+stand
+being
+shot
+at
+like
+that
+Dr
+That
+was
+done
+to
+chase
+you
+out
+Do
+you
+not
+feel
+free
+now
+What
+have
+you
+been
+doing
+since
+you
+last
+had
+those
+shots
+Sp
+I
+am
+glad
+I
+was
+chased
+out
+for
+I
+feel
+better
+now
+than
+I
+have
+for
+some
+time
+Dr
+Do
+you
+realize
+that
+you
+are
+controlling
+my
+wife
+s
+body
+Sp
+Thank
+God
+I
+am
+not
+Dr
+This
+body
+which
+you
+are
+using
+belongs
+to
+my
+wife
+Sp
+Your
+wife
+nothing
+Dr
+Do
+you
+recognize
+the
+clothes
+you
+are
+wearing
+Sp
+That
+s
+nothing
+to
+me
+Dr
+Where
+did
+you
+get
+them
+Sp
+I
+m
+no
+thief
+I
+am
+going
+to
+have
+you
+arrested
+for
+calling
+me
+a
+thief
+The
+first
+police
+station
+I
+find
+I
+shall
+swear
+out
+a
+warrant
+against
+you
+Dr
+Maggie
+what
+is
+the
+color
+of
+your
+hair
+Sp
+Brown
+dark
+brown
+Dr
+Touching
+psychic
+s
+hair
+This
+hair
+is
+not
+brown
+These
+clothes
+belong
+to
+my
+wife
+Sp
+I
+don
+t
+care
+whether
+they
+are
+my
+clothes
+or
+not
+I
+never
+asked
+for
+them
+Dr
+Tell
+us
+how
+long
+you
+have
+been
+dead
+Sp
+I
+m
+not
+dead
+One
+time
+you
+say
+one
+thing
+and
+another
+time
+you
+say
+another
+Dr
+I
+mean
+when
+did
+you
+lose
+your
+body
+Sp
+I
+haven
+t
+lost
+my
+body
+it
+s
+not
+in
+the
+grave
+Dr
+Were
+you
+ever
+sick
+and
+did
+you
+suddenly
+become
+better
+Sp
+I
+was
+very
+sick
+and
+when
+I
+got
+better
+I
+was
+in
+a
+prison
+I
+was
+moving
+around
+and
+some
+woman
+bothered
+me
+There
+were
+lots
+of
+us
+but
+they
+all
+got
+so
+seared
+of
+the
+fire
+that
+they
+left
+Dr
+When
+did
+you
+come
+to
+Los
+Angeles
+Sp
+I
+m
+not
+in
+Los
+Angeles
+I
+m
+in
+Dallas
+Texas
+If
+I
+am
+in
+Los
+Angeles
+how
+did
+I
+get
+here
+Dr
+You
+must
+have
+come
+with
+a
+lady
+who
+has
+red
+hair
+Mrs
+B
+seated
+nearby
+Sp
+She
+had
+no
+right
+to
+bring
+me
+here
+Dr
+She
+also
+came
+from
+Texas
+Sp
+What
+became
+of
+the
+others
+Dr
+They
+were
+brought
+to
+an
+understanding
+and
+went
+to
+the
+spirit
+world
+That
+is
+where
+you
+should
+be
+Why
+should
+you
+hover
+around
+that
+woman
+Sp
+Hover
+around
+nothing
+I
+have
+been
+in
+a
+prison
+but
+I
+could
+not
+help
+it
+I
+did
+what
+I
+could
+to
+get
+out
+Those
+people
+I
+saw
+said
+they
+would
+help
+me
+out
+but
+they
+didn
+t
+I
+made
+quite
+a
+disturbance
+and
+they
+went
+away
+from
+me
+Dr
+Probably
+they
+brought
+you
+here
+Sp
+All
+I
+see
+is
+people
+sitting
+around
+Mrs
+B
+Did
+you
+come
+out
+here
+with
+me
+What
+do
+you
+want
+to
+bother
+me
+for
+Sp
+I
+have
+nothing
+to
+do
+with
+you
+Oh
+you
+re
+the
+one
+that
+kept
+me
+in
+the
+prison
+Mrs
+B
+What
+was
+the
+name
+of
+that
+girl
+friend
+of
+yours
+You
+used
+to
+be
+with
+Referring
+to
+another
+spirit
+that
+had
+been
+troubling
+Mrs
+B
+Sp
+Where
+In
+Texas
+Mrs
+B
+Yes
+Sp
+Her
+name
+was
+Mary
+and
+there
+was
+another
+one
+Carrie
+Mrs
+B
+Did
+Carrie
+come
+with
+you
+Sp
+Yes
+of
+course
+Say
+what
+did
+you
+keep
+me
+closed
+up
+for
+Why
+didn
+t
+you
+let
+me
+out
+Mrs
+B
+I
+kept
+telling
+you
+to
+get
+out
+SP
+I
+know
+you
+did
+but
+you
+didn
+t
+open
+the
+door
+so
+I
+could
+go
+Dr
+All
+you
+had
+to
+do
+was
+to
+think
+yourself
+free
+from
+that
+lady
+Sp
+I
+can
+t
+think
+myself
+free
+Dr
+Intelligent
+spirits
+can
+think
+themselves
+anywhere
+it
+is
+only
+ignorant
+spirits
+who
+cannot
+Sp
+To
+Mrs
+B
+Say
+what
+did
+you
+keep
+me
+around
+you
+for
+Dr
+You
+were
+an
+uninvited
+guest
+Mrs
+B
+I
+m
+glad
+to
+get
+rid
+of
+you
+Sp
+I
+m
+glad
+too
+I
+m
+mighty
+glad
+to
+get
+out
+of
+that
+prison
+Why
+didn
+t
+you
+let
+me
+out
+I
+knocked
+and
+knocked
+but
+you
+kept
+me
+there
+To
+Dr
+W
+You
+gave
+me
+those
+fire
+things
+then
+I
+got
+out
+and
+I
+m
+glad
+of
+it
+Dr
+Did
+you
+get
+out
+after
+the
+last
+treatment
+Sp
+You
+call
+that
+a
+treatment
+Dr
+If
+you
+got
+out
+of
+that
+lady
+I
+should
+call
+it
+a
+good
+treatment
+Sp
+You
+don
+t
+know
+how
+I
+suffered
+from
+that
+fire
+especially
+the
+shooting
+You
+are
+the
+one
+that
+gave
+me
+that
+fire
+and
+I
+don
+t
+like
+you
+Dr
+I
+had
+to
+give
+the
+lady
+those
+treatments
+to
+get
+you
+out
+Sp
+You
+think
+that
+devil
+machine
+is
+a
+little
+god
+You
+want
+me
+to
+go
+where
+Dr
+To
+the
+spirit
+world
+Sp
+Where
+is
+that
+Dr
+A
+place
+where
+the
+discarnated
+spirits
+go
+to
+get
+understanding
+You
+have
+lost
+your
+physical
+body
+but
+do
+not
+understand
+it
+and
+you
+have
+been
+bothering
+that
+lady
+Mrs
+B
+Mrs
+B
+When
+once
+I
+get
+you
+and
+the
+others
+out
+I
+shall
+keep
+the
+door
+closed
+and
+closed
+so
+tight
+that
+none
+of
+you
+can
+get
+in
+Dr
+Think
+yourself
+free
+and
+you
+will
+not
+be
+in
+a
+prison
+Mortals
+cannot
+travel
+by
+thought
+but
+spirits
+can
+You
+are
+invisible
+to
+us
+You
+are
+temporarily
+using
+the
+body
+of
+another
+this
+body
+belongs
+to
+my
+wife
+Sp
+You
+have
+told
+me
+that
+before
+Dr
+Can
+t
+you
+see
+you
+are
+in
+a
+strange
+condition
+Mrs
+B
+Do
+you
+know
+Maggie
+Mackin
+Another
+spirit
+whose
+presence
+Mrs
+B
+had
+clairaudiently
+been
+aware
+of
+Sp
+Yes
+and
+I
+know
+Mary
+too
+Dr
+How
+old
+were
+you
+when
+you
+passed
+out
+of
+your
+body
+Can
+you
+recall
+something
+of
+your
+past
+Sp
+I
+remember
+being
+out
+riding
+and
+the
+horses
+ran
+away
+then
+everything
+became
+dark
+and
+since
+then
+I
+do
+not
+seem
+to
+remember
+much
+Dr
+Do
+you
+know
+what
+year
+it
+is
+Sp
+I
+don
+t
+have
+to
+answer
+you
+Are
+you
+a
+lawyer
+or
+a
+judge
+Who
+are
+you
+Dr
+I
+m
+a
+fireman
+Can
+you
+realize
+that
+it
+is
+Sp
+It
+doesn
+t
+bother
+me
+that
+much
+Snapping
+fingers
+I
+don
+t
+care
+Dr
+I
+thought
+you
+were
+anxious
+to
+get
+out
+of
+your
+trouble
+Sp
+I
+wanted
+to
+get
+out
+of
+that
+prison
+and
+now
+I
+feel
+better
+than
+I
+have
+for
+years
+Mrs
+B
+You
+ought
+to
+thank
+Doctor
+for
+getting
+you
+out
+Sp
+That
+man
+ought
+to
+be
+arrested
+for
+giving
+those
+shots
+it
+made
+you
+feel
+like
+your
+head
+was
+going
+to
+the
+dickens
+Dr
+Can
+you
+see
+any
+of
+your
+friends
+here
+Sp
+There
+are
+two
+Indians
+one
+is
+a
+big
+fellow
+and
+one
+is
+a
+girl
+and
+there
+is
+a
+lady
+with
+curly
+hair
+and
+light
+blue
+eyes
+Spirits
+Dr
+Does
+the
+Indian
+girl
+answer
+to
+the
+name
+of
+Silver
+Star
+One
+of
+Mrs
+Wickland
+s
+guides
+Sp
+Yes
+Dr
+These
+spirits
+will
+help
+you
+to
+progress
+in
+the
+spirit
+life
+Sp
+There
+s
+one
+thing
+sure
+I
+m
+going
+to
+Heaven
+and
+not
+to
+the
+other
+place
+I
+went
+to
+church
+and
+was
+a
+good
+woman
+Dr
+Those
+persons
+whom
+you
+see
+are
+spirits
+like
+yourself
+We
+do
+not
+see
+them
+Sp
+They
+are
+there
+just
+the
+same
+They
+say
+if
+I
+will
+go
+along
+with
+them
+they
+will
+show
+me
+a
+nice
+home
+That
+would
+be
+nice
+for
+I
+haven
+t
+had
+a
+home
+for
+a
+long
+time
+Am
+I
+going
+to
+have
+that
+fire
+any
+more
+I
+won
+t
+go
+to
+that
+woman
+with
+the
+red
+hair
+any
+more
+either
+and
+I
+thank
+God
+for
+that
+Dr
+Now
+think
+yourself
+free
+and
+go
+with
+these
+friends
+Sp
+All
+right
+I
+will
+go
+Goodby
+When
+Mrs
+Burton
+first
+came
+to
+us
+she
+could
+not
+follow
+any
+occupation
+but
+after
+the
+obsessing
+spirits
+were
+removed
+she
+was
+able
+to
+take
+a
+clerical
+position
+in
+a
+large
+commercial
+house
+CHAPTER
+IV
+Earth
+Sphere
+Conditions
+and
+the
+Magnetic
+Aura
+UNENLIGHTENED
+Spirits
+often
+wander
+aimlessly
+for
+many
+years
+in
+the
+earth
+sphere
+their
+lack
+of
+knowledge
+of
+a
+higher
+spirit
+world
+which
+is
+attained
+only
+through
+understanding
+keeping
+them
+in
+a
+dreary
+condition
+of
+confusion
+monotony
+and
+suffering
+many
+remain
+in
+the
+scenes
+of
+their
+earth
+lives
+continuing
+their
+former
+activities
+while
+others
+fall
+into
+a
+state
+of
+heavy
+sleep
+from
+which
+they
+are
+with
+difficulty
+aroused
+A
+spirit
+who
+was
+still
+following
+his
+old
+occupation
+without
+any
+knowledge
+of
+his
+transition
+controlled
+Mrs
+Wickland
+at
+one
+of
+our
+circles
+in
+Chicago
+Why
+are
+you
+sitting
+in
+the
+dark
+he
+asked
+We
+were
+at
+that
+time
+experimenting
+with
+dark
+circles
+I
+am
+Hesselroth
+from
+the
+drug
+store
+he
+said
+Mr
+Hesselroth
+the
+Swedish
+proprietor
+of
+a
+Chicago
+drug
+store
+had
+died
+the
+year
+before
+in
+a
+hospital
+but
+we
+knew
+nothing
+of
+this
+man
+his
+death
+or
+his
+circumstances
+however
+on
+this
+evening
+one
+of
+his
+friends
+Mr
+Eckholm
+was
+in
+our
+circle
+The
+spirit
+was
+not
+aware
+of
+his
+death
+claiming
+that
+he
+was
+still
+attending
+to
+his
+drug
+store
+His
+friend
+in
+the
+circle
+said
+he
+had
+been
+informed
+that
+the
+drug
+store
+had
+been
+sold
+to
+the
+clerk
+and
+so
+stated
+to
+the
+spirit
+but
+this
+the
+latter
+emphatically
+denied
+saying
+Abrahamson
+only
+manages
+it
+for
+me
+The
+spirit
+told
+of
+a
+robbery
+which
+had
+occurred
+in
+his
+house
+recently
+and
+described
+the
+three
+burglars
+He
+said
+he
+had
+been
+frightened
+when
+they
+entered
+but
+gaining
+courage
+had
+gone
+for
+his
+revolver
+only
+to
+find
+that
+he
+was
+not
+able
+to
+pick
+it
+up
+He
+had
+then
+struck
+at
+one
+of
+the
+burglars
+but
+his
+hand
+had
+gone
+right
+through
+the
+fellow
+and
+he
+could
+not
+understand
+why
+he
+could
+do
+nothing
+at
+all
+After
+his
+condition
+was
+explained
+to
+him
+he
+saw
+many
+spirit
+friends
+appear
+who
+welcomed
+him
+to
+his
+new
+home
+in
+the
+spirit
+world
+Later
+investigation
+verified
+the
+statement
+made
+by
+the
+spirit
+that
+the
+drug
+store
+had
+not
+been
+sold
+and
+also
+the
+fact
+that
+the
+house
+had
+been
+burglarized
+It
+could
+not
+be
+held
+that
+the
+subconscious
+mind
+of
+the
+psychic
+played
+any
+part
+in
+this
+case
+nor
+could
+the
+theory
+of
+auto
+suggestion
+be
+maintained
+for
+Mr
+Hesselroth
+was
+entirely
+unknown
+to
+every
+one
+in
+the
+room
+with
+the
+exception
+of
+his
+friend
+Mr
+Eckholm
+and
+this
+friend
+held
+the
+opposite
+idea
+regarding
+the
+sale
+of
+the
+store
+Many
+years
+later
+this
+spirit
+returned
+to
+us
+in
+California
+speaking
+again
+through
+Mrs
+Wickland
+EXPERIENCE
+SEPTEMBER
+Spirit
+MR
+HESSELROTH
+Spirit
+I
+have
+come
+in
+to
+say
+just
+a
+few
+words
+for
+I
+have
+been
+helped
+out
+of
+darkness
+and
+have
+become
+a
+helper
+in
+the
+Band
+of
+Mercy
+Doctor
+Who
+are
+you
+friend
+Sp
+I
+am
+one
+of
+the
+helpers
+here
+I
+come
+around
+sometimes
+and
+I
+came
+tonight
+to
+say
+a
+few
+words
+to
+you
+I
+was
+once
+in
+a
+very
+dark
+condition
+but
+now
+I
+am
+one
+of
+your
+Band
+I
+thought
+you
+might
+like
+to
+know
+If
+it
+had
+not
+been
+for
+you
+I
+would
+probably
+still
+be
+in
+the
+dark
+Many
+years
+have
+passed
+I
+have
+quite
+an
+understanding
+of
+life
+now
+through
+you
+and
+through
+this
+little
+circle
+of
+the
+Band
+of
+Mercy
+It
+was
+not
+here
+it
+was
+in
+Chicago
+that
+I
+was
+helped
+I
+am
+very
+much
+pleased
+to
+be
+here
+with
+you
+tonight
+I
+should
+like
+to
+give
+you
+my
+name
+but
+I
+seem
+to
+have
+forgotten
+it
+because
+I
+have
+not
+heard
+it
+for
+so
+long
+It
+will
+come
+to
+me
+and
+then
+I
+will
+give
+it
+Do
+you
+remember
+an
+old
+gentleman
+you
+used
+to
+know
+Mr
+Eckholm
+He
+was
+not
+so
+very
+old
+either
+He
+was
+a
+very
+dear
+friend
+of
+mine
+and
+through
+him
+I
+came
+to
+see
+you
+Dr
+At
+some
+meeting
+in
+Chicago
+Sp
+Yes
+I
+had
+a
+drug
+store
+in
+Chicago
+My
+name
+is
+Hesselroth
+I
+could
+not
+think
+of
+my
+name
+for
+a
+moment
+I
+am
+one
+of
+your
+helpers
+here
+Mr
+Eckholm
+is
+with
+me
+and
+he
+also
+does
+all
+he
+can
+He
+is
+very
+happy
+to
+help
+with
+your
+work
+here
+He
+was
+heart
+and
+soul
+with
+it
+during
+his
+earth
+life
+I
+also
+feel
+that
+I
+have
+to
+do
+all
+I
+can
+to
+help
+because
+if
+you
+had
+not
+helped
+me
+I
+should
+have
+been
+in
+that
+drug
+store
+yet
+selling
+medicine
+For
+a
+whole
+year
+after
+I
+passed
+out
+I
+attended
+to
+the
+business
+as
+I
+did
+when
+on
+earth
+only
+I
+did
+not
+feel
+that
+I
+was
+sick
+any
+more
+I
+took
+sick
+in
+the
+store
+and
+was
+sent
+to
+the
+hospital
+and
+I
+passed
+out
+in
+the
+hospital
+They
+took
+my
+body
+to
+the
+undertakers
+not
+to
+my
+home
+You
+know
+it
+says
+in
+the
+Bible
+Where
+your
+treasure
+is
+there
+will
+your
+heart
+be
+also
+When
+I
+woke
+up
+from
+the
+sleep
+of
+death
+I
+thought
+of
+my
+store
+and
+there
+I
+found
+myself
+I
+saw
+that
+everything
+was
+going
+on
+all
+right
+but
+it
+seemed
+so
+strange
+that
+I
+could
+not
+talk
+to
+any
+of
+my
+customers
+I
+thought
+that
+during
+my
+sickness
+I
+had
+lost
+my
+faculty
+of
+speech
+so
+I
+did
+not
+think
+much
+about
+it
+I
+attended
+to
+business
+and
+I
+impressed
+my
+clerk
+to
+do
+things
+I
+wanted
+done
+I
+was
+running
+the
+store
+and
+the
+clerk
+was
+managing
+it
+for
+me
+I
+did
+not
+realize
+that
+I
+was
+dead
+until
+I
+came
+to
+this
+gentleman
+Dr
+W
+in
+his
+little
+circle
+When
+burglars
+got
+into
+my
+home
+I
+thought
+of
+the
+revolver
+that
+I
+always
+kept
+in
+a
+drawer
+I
+went
+there
+and
+tried
+and
+tried
+to
+get
+it
+but
+my
+hand
+went
+me
+I
+commenced
+to
+see
+things
+I
+saw
+my
+spirit
+father
+and
+mother
+Then
+I
+thought
+I
+must
+be
+a
+little
+out
+of
+my
+head
+So
+I
+thought
+I
+had
+better
+go
+up
+to
+see
+my
+friend
+Eckholm
+I
+always
+thought
+he
+was
+just
+a
+little
+off
+because
+he
+believed
+in
+Spiritualism
+I
+wanted
+to
+see
+Eckholm
+to
+ask
+him
+if
+ghosts
+could
+come
+back
+and
+there
+I
+was
+a
+ghost
+myself
+Then
+I
+came
+to
+this
+circle
+and
+I
+found
+I
+could
+talk
+and
+after
+a
+while
+the
+door
+opened
+opened
+to
+that
+beautiful
+land
+beyond
+I
+wish
+you
+could
+see
+the
+reception
+I
+had
+My
+relatives
+and
+friends
+all
+opened
+their
+arms
+to
+me
+and
+said
+Welcome
+to
+our
+home
+in
+spirit
+Welcome
+to
+that
+everlasting
+life
+Welcome
+to
+an
+understanding
+of
+God
+Such
+a
+reception
+cannot
+be
+described
+until
+you
+see
+it
+for
+yourselves
+and
+are
+with
+us
+That
+is
+happiness
+it
+is
+Heaven
+I
+will
+not
+take
+any
+more
+of
+your
+time
+but
+I
+am
+glad
+that
+I
+could
+come
+and
+talk
+tonight
+It
+was
+about
+fifteen
+years
+ago
+that
+I
+first
+came
+here
+Eckholm
+says
+he
+feels
+proud
+of
+this
+work
+and
+he
+sends
+love
+to
+all
+of
+you
+here
+Now
+Good
+Night
+Pathos
+and
+tragedy
+are
+often
+the
+grim
+accompaniment
+of
+the
+sufferings
+of
+earthbound
+spirits
+The
+spirit
+of
+the
+following
+narrative
+was
+taken
+from
+a
+patient
+who
+was
+subject
+to
+doleful
+spells
+of
+crying
+and
+afflicted
+with
+intense
+head
+pains
+all
+of
+which
+ceased
+after
+the
+spirit
+was
+removed
+EXPERIENCE
+JANUARY
+Spirit
+MINNIE
+DAY
+Patient
+MRS
+L
+W
+Psychic
+MRS
+WICKLAND
+Spirit
+Crying
+piteously
+Oh
+my
+head
+hurts
+so
+badly
+I
+don
+t
+like
+those
+needles
+electrical
+treatments
+given
+patient
+they
+hurt
+me
+so
+My
+head
+hurts
+I
+am
+lost
+I
+don
+t
+know
+where
+I
+am
+at
+There
+were
+thousands
+and
+thousands
+of
+needles
+I
+had
+to
+cry
+Doctor
+Where
+do
+you
+live
+Sp
+I
+don
+t
+know
+Dr
+Where
+did
+your
+parents
+live
+Sp
+I
+don
+t
+know
+Dr
+Aren
+t
+you
+a
+little
+child
+Sp
+I
+am
+only
+little
+I
+am
+Minnie
+Day
+Dr
+Where
+did
+you
+live
+How
+old
+are
+you
+Sp
+I
+don
+t
+know
+Ask
+Ma
+Dr
+Don
+t
+you
+know
+what
+city
+you
+lived
+in
+Sp
+In
+St
+Louis
+Oh
+my
+father
+is
+coming
+He
+hit
+me
+on
+the
+head
+And
+there
+s
+Willie
+Dr
+Who
+is
+Willie
+Sp
+He
+s
+my
+brother
+Here
+s
+my
+father
+and
+I
+m
+afraid
+He
+says
+to
+come
+with
+him
+Oh
+Ma
+my
+head
+hurts
+My
+Ma
+says
+for
+me
+to
+go
+with
+her
+cause
+she
+has
+a
+new
+home
+for
+me
+and
+Willie
+Dr
+You
+will
+go
+to
+her
+home
+in
+the
+spirit
+world
+Sp
+What
+is
+the
+spirit
+world
+What
+does
+that
+mean
+Dr
+That
+is
+the
+invisible
+world
+around
+the
+earth
+Do
+you
+know
+that
+you
+are
+dead
+Sp
+What
+do
+you
+mean
+Dr
+I
+mean
+that
+you
+have
+lost
+your
+physical
+body
+What
+have
+you
+been
+doing
+recently
+Sp
+I
+have
+been
+running
+all
+over
+trying
+to
+find
+somebody
+Mama
+died
+a
+long
+time
+ago
+when
+I
+was
+a
+little
+girl
+After
+Ma
+died
+Papa
+was
+so
+mean
+to
+me
+and
+Willie
+and
+he
+hit
+me
+so
+many
+times
+I
+feel
+so
+bad
+and
+my
+head
+hurts
+I
+have
+been
+to
+so
+many
+places
+and
+my
+Ma
+is
+dead
+and
+I
+don
+t
+know
+where
+to
+go
+Dr
+You
+were
+in
+such
+mental
+distress
+that
+you
+did
+not
+realize
+your
+condition
+You
+have
+lost
+your
+physical
+body
+and
+your
+friends
+would
+call
+you
+dead
+Sp
+Did
+I
+die
+Sometimes
+I
+feel
+as
+if
+I
+were
+in
+a
+box
+We
+were
+a
+big
+crowd
+spirits
+obsessing
+the
+patient
+and
+they
+Pushed
+and
+pushed
+and
+there
+was
+one
+big
+man
+and
+he
+was
+so
+mean
+to
+us
+He
+chased
+us
+one
+way
+then
+another
+but
+one
+day
+we
+lost
+him
+This
+tormenting
+spirit
+had
+been
+attracted
+from
+the
+patient
+two
+days
+before
+I
+felt
+so
+glad
+he
+was
+lost
+and
+I
+thought
+I
+could
+be
+quiet
+but
+I
+got
+all
+those
+needles
+Dr
+You
+were
+influencing
+a
+lady
+and
+making
+her
+cry
+Sp
+What
+do
+you
+mean
+Dr
+You
+are
+a
+spirit
+and
+were
+in
+the
+aura
+of
+that
+lady
+When
+she
+had
+an
+electrical
+treatment
+you
+felt
+it
+and
+left
+her
+You
+are
+using
+my
+wife
+s
+body
+now
+Look
+at
+your
+hands
+do
+they
+belong
+to
+you
+Sp
+Oh
+look
+I
+have
+a
+ring
+But
+that
+is
+not
+mine
+and
+I
+have
+not
+stolen
+it
+Excitedly
+Take
+it
+away
+I
+didn
+t
+steal
+that
+ring
+Dr
+This
+is
+not
+your
+body
+and
+that
+is
+not
+your
+ring
+It
+is
+very
+likely
+that
+you
+died
+when
+your
+head
+was
+hurt
+The
+spirit
+lives
+after
+the
+body
+dies
+Sp
+But
+I
+have
+been
+alive
+Dr
+You
+were
+living
+but
+without
+a
+physical
+body
+and
+came
+in
+touch
+with
+a
+sensitive
+a
+lady
+who
+is
+now
+in
+the
+other
+house
+She
+acts
+just
+as
+you
+do
+and
+complains
+of
+her
+head
+hurting
+in
+the
+same
+place
+yours
+hurts
+you
+She
+has
+been
+acting
+like
+an
+insane
+person
+but
+it
+is
+all
+due
+to
+spirit
+influence
+Sp
+The
+man
+was
+so
+mean
+that
+we
+had
+with
+us
+but
+now
+he
+is
+lost
+and
+we
+are
+so
+glad
+We
+were
+all
+seared
+of
+him
+but
+we
+could
+not
+run
+away
+from
+him
+He
+was
+awful
+mean
+he
+bit
+and
+scratched
+and
+would
+fight
+Dr
+He
+was
+very
+obstinate
+He
+was
+controlling
+this
+body
+a
+short
+time
+ago
+just
+as
+you
+are
+now
+We
+have
+circles
+like
+this
+where
+spirits
+may
+come
+for
+help
+Sp
+Spirits
+I
+don
+t
+know
+anything
+about
+them
+My
+head
+hurts
+me
+Dr
+The
+body
+you
+are
+using
+belongs
+to
+my
+wife
+and
+she
+has
+no
+pain
+in
+her
+head
+Sp
+Those
+needles
+hurt
+me
+so
+much
+Dr
+When
+the
+lady
+had
+a
+treatment
+today
+you
+evidently
+were
+able
+to
+get
+away
+and
+are
+now
+allowed
+to
+control
+this
+body
+So
+that
+we
+can
+help
+you
+A
+short
+time
+ago
+you
+said
+that
+your
+father
+and
+mother
+were
+here
+are
+they
+here
+now
+Sp
+Don
+t
+you
+see
+Mama
+She
+s
+standing
+right
+there
+Dr
+Wouldn
+t
+you
+like
+to
+go
+with
+your
+mother
+Sp
+But
+she
+s
+dead
+Dr
+You
+are
+dead
+also
+There
+is
+no
+death
+really
+We
+See
+Chap
+Page
+Spirit
+John
+Sullivan
+Patient
+Mrs
+L
+W
+only
+lose
+our
+physical
+bodies
+Spirit
+is
+invisible
+Sp
+Oh
+take
+me
+away
+Take
+me
+away
+My
+father
+is
+coming
+and
+I
+m
+afraid
+He
+ll
+strike
+me
+again
+Take
+me
+away
+Dr
+Your
+father
+probably
+comes
+for
+forgiveness
+You
+understand
+he
+cannot
+progress
+in
+the
+spirit
+world
+until
+you
+forgive
+him
+Ask
+him
+what
+he
+has
+to
+say
+to
+you
+Sp
+He
+doesn
+t
+say
+anything
+he
+s
+crying
+He
+comes
+up
+to
+Mama
+now
+Dr
+Doesn
+t
+he
+look
+sorry
+Sp
+He
+says
+he
+is
+so
+sorry
+for
+what
+he
+did
+The
+child
+spirit
+was
+removed
+and
+the
+distressed
+father
+took
+control
+of
+the
+psychic
+Crying
+in
+anguish
+he
+fell
+on
+his
+knees
+with
+his
+arms
+outstretched
+Spirit
+William
+Day
+Spirit
+Forgive
+me
+Forgive
+me
+I
+didn
+t
+know
+what
+I
+was
+doing
+I
+didn
+t
+mean
+to
+kill
+you
+Minnie
+I
+was
+very
+nervous
+and
+the
+children
+made
+such
+a
+noise
+I
+was
+so
+sad
+because
+my
+wife
+had
+died
+Give
+me
+a
+chance
+Just
+give
+me
+one
+more
+chance
+too
+have
+suffered
+If
+I
+had
+only
+lived
+I
+have
+been
+in
+the
+dark
+so
+long
+and
+cannot
+be
+helped
+and
+I
+cannot
+come
+near
+my
+child
+she
+is
+so
+afraid
+of
+me
+I
+have
+tried
+to
+reach
+her
+to
+ask
+for
+forgiveness
+but
+she
+is
+so
+seared
+when
+I
+come
+near
+her
+that
+I
+cannot
+reach
+her
+Don
+t
+any
+of
+you
+ever
+strike
+a
+child
+else
+you
+will
+suffer
+for
+years
+and
+years
+I
+did
+not
+mean
+to
+hurt
+her
+I
+loved
+her
+but
+I
+killed
+her
+If
+there
+is
+a
+God
+lift
+this
+trouble
+and
+sorrow
+away
+from
+me
+Give
+me
+some
+light
+and
+comfort
+in
+my
+suffering
+I
+cannot
+restated
+have
+no
+peace
+I
+can
+only
+see
+my
+work
+that
+I
+did
+in
+anger
+Try
+to
+control
+yourself
+if
+you
+get
+angry
+else
+you
+will
+suffer
+as
+I
+have
+God
+help
+me
+Oh
+God
+Give
+me
+one
+more
+chance
+just
+one
+Dr
+Do
+you
+realize
+that
+you
+are
+dead
+Sp
+No
+I
+ran
+away
+when
+I
+killed
+my
+child
+Somebody
+got
+after
+me
+and
+ran
+very
+hard
+then
+something
+hit
+me
+in
+the
+neck
+and
+I
+fell
+down
+Evidently
+killed
+I
+got
+right
+up
+and
+ran
+and
+I
+have
+been
+running
+so
+long
+it
+seems
+years
+Many
+times
+I
+have
+seen
+my
+wife
+accusing
+me
+for
+killing
+my
+child
+I
+did
+kill
+her
+God
+help
+me
+I
+have
+tried
+to
+find
+just
+a
+little
+comfort
+and
+light
+Dr
+You
+cannot
+find
+light
+until
+you
+have
+understanding
+Sp
+God
+give
+me
+light
+and
+understanding
+All
+I
+see
+is
+that
+poor
+child
+s
+head
+split
+open
+where
+I
+struck
+her
+I
+tried
+to
+ask
+Minnie
+for
+forgiveness
+but
+she
+shrank
+from
+me
+and
+I
+could
+not
+get
+near
+her
+and
+there
+was
+my
+wife
+always
+accusing
+me
+for
+what
+I
+had
+done
+Dr
+She
+will
+not
+accuse
+you
+any
+more
+Sp
+Will
+she
+forgive
+me
+Dr
+Yes
+What
+is
+your
+name
+Sp
+William
+Day
+Dr
+Can
+you
+recall
+what
+year
+it
+is
+Sp
+My
+brain
+is
+in
+such
+a
+turmoil
+I
+have
+been
+running
+and
+running
+for
+so
+long
+trying
+to
+get
+away
+from
+that
+crowd
+of
+people
+that
+were
+after
+me
+Everybody
+I
+saw
+I
+ran
+from
+knowing
+that
+they
+too
+would
+accuse
+me
+for
+killing
+Minnie
+At
+nights
+my
+wife
+has
+stood
+by
+me
+accusing
+me
+and
+then
+there
+was
+the
+child
+with
+her
+head
+all
+split
+open
+and
+the
+blood
+pouring
+out
+I
+have
+had
+hell
+It
+could
+not
+be
+worse
+Is
+there
+no
+help
+for
+me
+I
+prayed
+and
+prayed
+but
+it
+did
+no
+good
+Dr
+Do
+you
+know
+that
+you
+are
+in
+California
+Sp
+California
+When
+did
+I
+get
+here
+Did
+I
+run
+all
+the
+way
+from
+St
+Louis
+to
+California
+Dr
+Do
+you
+understand
+that
+you
+are
+a
+spirit
+controlling
+the
+body
+of
+a
+mortal
+Sp
+Do
+you
+mean
+that
+I
+am
+dead
+Dr
+You
+have
+lost
+your
+physical
+body
+Sp
+Won
+t
+I
+have
+to
+stay
+in
+the
+grave
+until
+the
+dead
+rise
+Dr
+You
+are
+here
+now
+how
+did
+you
+get
+out
+of
+the
+grave
+Sp
+I
+have
+had
+no
+rest
+for
+I
+don
+t
+know
+how
+long
+Dr
+There
+is
+no
+such
+thing
+as
+death
+When
+you
+pass
+out
+of
+your
+physical
+body
+you
+lose
+your
+five
+physical
+sense
+organs
+and
+unless
+you
+have
+understanding
+of
+the
+spirit
+life
+you
+are
+in
+the
+dark
+and
+can
+only
+see
+when
+coming
+in
+touch
+with
+some
+mortal
+Sp
+The
+people
+are
+hounding
+me
+until
+I
+am
+tired
+out
+Dr
+Now
+you
+must
+try
+to
+become
+reconciled
+with
+your
+wife
+and
+child
+Sp
+Do
+you
+think
+they
+will
+ever
+forgive
+me
+Please
+forgive
+me
+wife
+I
+was
+not
+worthy
+of
+you
+You
+were
+an
+angel
+and
+I
+was
+such
+a
+brute
+Will
+you
+please
+forgive
+me
+If
+you
+will
+only
+give
+me
+just
+one
+chance
+I
+will
+try
+so
+hard
+I
+have
+suffered
+so
+much
+Carrie
+Carrie
+Is
+it
+really
+true
+that
+you
+will
+forgive
+me
+Is
+it
+true
+You
+were
+such
+a
+patient
+woman
+and
+tried
+so
+hard
+to
+help
+me
+but
+I
+was
+no
+good
+I
+loved
+my
+children
+but
+I
+had
+such
+a
+bad
+temper
+I
+really
+killed
+my
+wife
+by
+letting
+her
+sew
+just
+to
+keep
+the
+family
+together
+I
+made
+good
+money
+but
+there
+were
+always
+men
+around
+telling
+me
+to
+come
+with
+them
+and
+I
+did
+not
+know
+anything
+until
+my
+wages
+were
+all
+gone
+and
+I
+went
+home
+feeling
+like
+a
+devil
+Dr
+Perhaps
+the
+trouble
+was
+not
+all
+yours
+for
+you
+might
+have
+been
+obsessed
+When
+you
+leave
+here
+with
+your
+wife
+you
+will
+find
+a
+wonderful
+spirit
+world
+Sp
+I
+am
+not
+worthy
+to
+go
+with
+my
+wife
+but
+I
+will
+try
+to
+do
+good
+I
+don
+t
+want
+you
+to
+go
+away
+from
+me
+any
+more
+Carrie
+Crying
+Minnie
+can
+you
+forgive
+your
+Papa
+My
+dear
+child
+I
+killed
+you
+but
+I
+did
+not
+mean
+to
+Forgive
+your
+Papa
+Will
+I
+wake
+up
+after
+a
+while
+and
+find
+myself
+in
+darkness
+again
+Am
+I
+asleep
+or
+dreaming
+Minnie
+don
+t
+go
+away
+from
+Papa
+Please
+forgive
+me
+Dr
+You
+are
+neither
+asleep
+nor
+dreaming
+but
+are
+beginning
+to
+realize
+your
+condition
+Sp
+Did
+they
+kill
+me
+when
+they
+hit
+me
+in
+my
+neck
+and
+head
+They
+shot
+me
+Dr
+We
+can
+t
+say
+certainly
+but
+they
+probably
+did
+Sp
+If
+I
+can
+just
+have
+one
+more
+chance
+I
+will
+do
+my
+level
+best
+to
+keep
+my
+family
+together
+Dr
+There
+is
+something
+else
+you
+can
+do
+also
+after
+you
+acquire
+understanding
+it
+will
+be
+your
+duty
+to
+help
+poor
+unfortunate
+spirits
+who
+are
+obsessing
+mortals
+making
+devils
+of
+some
+of
+them
+When
+you
+had
+your
+own
+body
+you
+may
+have
+been
+obsessed
+by
+some
+spirits
+Sp
+I
+did
+not
+care
+for
+drink
+I
+hated
+the
+very
+sight
+of
+it
+But
+when
+once
+I
+got
+just
+a
+smell
+of
+it
+something
+took
+hold
+of
+me
+and
+made
+me
+feel
+like
+a
+devil
+and
+I
+could
+not
+resist
+it
+I
+could
+not
+do
+anything
+with
+myself
+God
+help
+me
+and
+give
+me
+just
+a
+little
+comfort
+Dr
+When
+you
+leave
+here
+you
+will
+be
+reunited
+with
+your
+family
+Sp
+Are
+you
+sure
+about
+that
+Dr
+Positive
+but
+you
+must
+do
+as
+the
+advanced
+spirits
+instruct
+you
+Sp
+If
+there
+is
+anything
+I
+can
+do
+to
+help
+you
+I
+will
+do
+it
+because
+you
+have
+reunited
+me
+with
+my
+family
+I
+came
+home
+drunk
+and
+you
+don
+t
+know
+how
+I
+felt
+when
+I
+realized
+that
+my
+wife
+was
+dying
+I
+was
+so
+drunk
+that
+I
+did
+not
+fully
+realize
+things
+until
+the
+next
+morning
+when
+I
+woke
+up
+and
+there
+was
+my
+wife
+dead
+I
+could
+not
+understand
+it
+What
+was
+I
+to
+do
+What
+could
+I
+do
+with
+the
+children
+My
+wife
+dead
+My
+wife
+and
+Minnie
+say
+they
+will
+both
+forgive
+me
+and
+now
+I
+have
+my
+wife
+and
+two
+children
+and
+I
+am
+going
+to
+start
+all
+over
+again
+God
+bless
+you
+all
+for
+what
+you
+have
+done
+for
+me
+and
+my
+family
+The
+confusion
+and
+mental
+suffering
+existing
+on
+the
+earthplane
+is
+vividly
+portrayed
+by
+the
+spirits
+who
+are
+brought
+to
+our
+circle
+for
+help
+EXPERIENCE
+MARCH
+Spirit
+MR
+MALLORY
+Psychic
+MRS
+WICKLAND
+The
+controlling
+spirit
+came
+in
+while
+we
+were
+singing
+That
+Beautiful
+Shore
+and
+laughed
+uproariously
+Doctor
+Have
+you
+found
+the
+Beautiful
+Shore
+Tell
+us
+what
+you
+know
+about
+it
+Spirit
+It
+s
+all
+humbug
+Dr
+Is
+that
+so
+Sp
+Yes
+Laughing
+hilariously
+It
+s
+silly
+to
+believe
+in
+such
+a
+thing
+Dr
+You
+are
+on
+the
+other
+side
+of
+life
+tell
+us
+something
+about
+it
+Have
+you
+found
+nothing
+If
+you
+do
+not
+believe
+in
+a
+hereafter
+tell
+us
+why
+Explain
+yourself
+If
+you
+are
+a
+skeptic
+tell
+us
+your
+belief
+Sp
+Belief
+Gosh
+Laughing
+Dr
+Tell
+us
+what
+you
+are
+laughing
+about
+Sp
+You
+might
+just
+as
+well
+laugh
+as
+cry
+one
+is
+just
+the
+same
+as
+the
+other
+You
+were
+singing
+That
+Beautiful
+Shore
+and
+while
+you
+are
+singing
+that
+you
+know
+you
+are
+lying
+Dr
+Do
+you
+imply
+that
+life
+does
+not
+mean
+anything
+at
+all
+Sp
+It
+most
+certainly
+does
+not
+There
+is
+nothing
+in
+it
+It
+is
+just
+a
+lie
+The
+whole
+thing
+is
+nothing
+but
+a
+pack
+of
+lies
+both
+life
+and
+religion
+the
+whole
+humbug
+life
+religion
+and
+everything
+connected
+with
+it
+Dr
+Have
+you
+tried
+to
+understand
+your
+own
+life
+the
+mystery
+of
+it
+Sp
+My
+own
+life
+Humbug
+nothing
+but
+humbug
+Laughing
+Dr
+How
+do
+you
+know
+it
+is
+humbug
+You
+are
+laughing
+at
+your
+own
+ignorance
+Sp
+I
+might
+just
+as
+well
+laugh
+as
+cry
+one
+is
+no
+worse
+or
+better
+than
+the
+other
+It
+is
+all
+lies
+damned
+lies
+I
+had
+my
+troubles
+Dr
+Where
+Over
+there
+or
+here
+Sp
+Everywhere
+Laughing
+Dr
+Are
+you
+happy
+Sp
+Happy
+Such
+nonsense
+There
+is
+no
+such
+thing
+there
+never
+was
+and
+there
+never
+will
+be
+Dr
+Do
+you
+really
+know
+anything
+about
+it
+Did
+you
+seek
+for
+truth
+when
+you
+had
+your
+own
+body
+Sp
+I
+prayed
+to
+God
+and
+all
+that
+nonsense
+Gosh
+Dr
+And
+you
+found
+it
+all
+a
+humbug
+What
+has
+that
+to
+do
+with
+the
+actual
+facts
+of
+life
+Sp
+Once
+I
+tried
+to
+be
+some
+one
+Then
+the
+thought
+came
+to
+me
+that
+everything
+was
+humbug
+humbug
+nothing
+but
+humbug
+As
+a
+man
+you
+know
+what
+I
+mean
+You
+are
+talking
+to
+a
+man
+and
+you
+know
+all
+about
+it
+Dr
+You
+are
+invisible
+to
+us
+Have
+you
+ever
+seen
+intelligence
+Sp
+What
+kind
+of
+talk
+is
+that
+I
+don
+t
+believe
+in
+nonsense
+any
+more
+You
+can
+have
+faith
+and
+believe
+that
+you
+can
+walk
+on
+water
+but
+you
+fall
+through
+just
+the
+same
+I
+said
+I
+have
+faith
+that
+I
+can
+walk
+on
+water
+but
+I
+fell
+through
+Dr
+Because
+you
+left
+reason
+out
+Sp
+Reason
+You
+can
+t
+walk
+on
+water
+with
+reason
+Dr
+It
+was
+not
+intended
+that
+we
+should
+walk
+on
+water
+Water
+is
+for
+drinking
+and
+bathing
+Sp
+Why
+are
+you
+holding
+my
+hands
+Dr
+I
+am
+holding
+my
+wife
+s
+hands
+Sp
+You
+don
+t
+know
+what
+you
+are
+talking
+about
+Do
+you
+believe
+that
+Dr
+I
+know
+that
+I
+am
+holding
+my
+wife
+s
+hands
+Sp
+I
+used
+to
+have
+faith
+like
+that
+Dr
+How
+did
+you
+happen
+to
+lose
+faith
+Sp
+It
+is
+all
+humbug
+Dr
+Life
+is
+the
+beginning
+of
+knowledge
+Sp
+I
+haven
+t
+had
+any
+knowledge
+yet
+Dr
+You
+will
+have
+before
+you
+leave
+here
+Sp
+I
+had
+faith
+and
+I
+believed
+and
+then
+what
+Dr
+What
+next
+Sp
+Yes
+what
+next
+I
+worked
+like
+a
+slave
+for
+a
+minister
+of
+God
+I
+do
+not
+work
+for
+him
+now
+that
+was
+some
+time
+ago
+I
+went
+away
+from
+there
+He
+cursed
+me
+and
+I
+had
+my
+cares
+and
+troubles
+I
+swore
+to
+God
+that
+there
+is
+no
+such
+thing
+as
+God
+if
+he
+could
+be
+so
+mean
+as
+to
+call
+such
+a
+man
+his
+minister
+And
+I
+lost
+faith
+Dr
+What
+has
+that
+to
+do
+with
+the
+facts
+of
+life
+and
+the
+hereafter
+Sp
+When
+you
+die
+you
+are
+dead
+Dr
+Then
+why
+didn
+t
+you
+stay
+dead
+when
+you
+died
+Sp
+Stay
+dead
+I
+haven
+t
+died
+yet
+Dr
+You
+died
+as
+far
+as
+your
+body
+is
+concerned
+Sp
+I
+have
+been
+running
+away
+from
+those
+hypocrites
+In
+the
+first
+place
+they
+took
+all
+the
+money
+I
+made
+If
+there
+is
+a
+God
+then
+for
+God
+s
+sake
+why
+does
+he
+always
+want
+money
+They
+always
+say
+you
+must
+have
+faith
+have
+faith
+and
+pay
+your
+money
+to
+the
+church
+and
+you
+should
+work
+for
+God
+My
+work
+was
+hard
+I
+worked
+from
+six
+o
+clock
+every
+morning
+until
+late
+every
+night
+all
+for
+God
+I
+worked
+for
+God
+and
+often
+I
+did
+not
+get
+enough
+so
+that
+I
+could
+get
+along
+Dr
+Tell
+us
+where
+you
+came
+from
+Sp
+All
+I
+want
+is
+my
+freedom
+Dr
+Won
+t
+you
+tell
+us
+where
+you
+came
+from
+Sp
+Look
+at
+all
+those
+devils
+down
+there
+Invisibles
+Hear
+how
+they
+curse
+and
+laugh
+They
+say
+I
+know
+you
+I
+know
+you
+Look
+at
+that
+one
+sitting
+over
+there
+Look
+at
+them
+all
+Hear
+them
+laugh
+They
+say
+I
+should
+tell
+you
+that
+they
+want
+you
+to
+pray
+for
+them
+for
+they
+are
+in
+darkness
+Dr
+We
+want
+to
+help
+them
+to
+a
+better
+understanding
+Sp
+Oh
+listen
+to
+them
+cursing
+Dr
+You
+must
+show
+them
+charity
+You
+do
+not
+seem
+to
+know
+what
+charity
+is
+Sp
+God
+Look
+at
+that
+man
+They
+say
+when
+you
+give
+charity
+they
+don
+t
+like
+it
+Dr
+I
+do
+not
+mean
+money
+Give
+them
+a
+chance
+to
+help
+themselves
+Do
+you
+know
+what
+year
+it
+is
+now
+Sp
+I
+don
+t
+care
+I
+don
+t
+care
+if
+it
+is
+a
+hundred
+years
+from
+now
+I
+ve
+lost
+faith
+in
+God
+humanity
+and
+everything
+and
+everybody
+I
+used
+to
+have
+faith
+Then
+a
+servant
+of
+God
+took
+my
+wife
+and
+children
+away
+from
+me
+and
+yet
+I
+worked
+for
+God
+from
+six
+in
+the
+morning
+to
+twelve
+at
+night
+Dr
+But
+you
+did
+not
+add
+understanding
+to
+your
+faith
+Sp
+I
+had
+faith
+in
+the
+Holy
+Ghost
+and
+the
+Spirit
+Dr
+Why
+did
+you
+not
+add
+understanding
+to
+your
+faith
+Sp
+I
+had
+faith
+enough
+to
+move
+mountains
+We
+were
+taught
+to
+just
+have
+faith
+in
+the
+Holy
+Spirit
+Just
+look
+at
+them
+all
+spirits
+sitting
+there
+Look
+at
+that
+one
+Here
+you
+Calango
+He
+and
+I
+have
+fights
+once
+in
+a
+while
+but
+I
+always
+get
+the
+best
+of
+him
+I
+can
+talk
+better
+now
+than
+I
+have
+done
+for
+a
+long
+time
+Here
+you
+Calango
+sitting
+there
+like
+a
+fool
+They
+told
+me
+to
+go
+in
+there
+so
+I
+came
+in
+I
+think
+you
+were
+afraid
+of
+me
+at
+first
+but
+I
+came
+in
+just
+the
+same
+Dr
+How
+did
+you
+come
+in
+Sp
+In
+here
+How
+did
+I
+come
+in
+I
+don
+t
+know
+Dr
+Where
+did
+you
+get
+that
+hand
+Touching
+Mrs
+Wickland
+s
+hand
+Sp
+That
+hand
+I
+suppose
+it
+is
+mine
+It
+doesn
+t
+belong
+to
+any
+body
+else
+Here
+Calango
+you
+sit
+here
+Now
+I
+can
+talk
+to
+you
+fellows
+Dr
+Now
+stop
+talking
+Sp
+Do
+you
+think
+you
+are
+the
+boss
+here
+Dr
+Yes
+Sp
+I
+have
+no
+faith
+in
+you
+nor
+any
+one
+else
+Dr
+I
+want
+you
+to
+understand
+that
+you
+have
+lost
+your
+physical
+body
+You
+are
+controlling
+my
+wife
+s
+body
+yet
+you
+are
+invisible
+to
+us
+You
+talk
+about
+those
+men
+sitting
+there
+we
+cannot
+see
+them
+We
+are
+in
+mortal
+bodies
+but
+you
+have
+lost
+your
+physical
+body
+Sp
+Can
+t
+you
+see
+me
+Dr
+We
+cannot
+see
+spirits
+You
+are
+controlling
+my
+wife
+s
+body
+Intelligent
+spirits
+have
+brought
+you
+here
+Sp
+You
+asked
+me
+to
+come
+All
+those
+in
+darkness
+came
+in
+too
+You
+invited
+us
+During
+a
+concentration
+for
+all
+earthbound
+spirits
+Dr
+I
+said
+you
+should
+listen
+to
+intelligent
+spirits
+around
+you
+who
+would
+help
+you
+You
+are
+all
+in
+darkness
+Sp
+Yes
+but
+you
+invited
+us
+in
+and
+here
+we
+are
+I
+want
+to
+tell
+you
+if
+you
+don
+t
+want
+us
+I
+won
+t
+talk
+Dr
+You
+were
+invited
+by
+intelligent
+spirits
+to
+come
+here
+and
+allowed
+to
+control
+my
+wife
+s
+body
+so
+that
+we
+could
+help
+you
+understand
+that
+you
+no
+longer
+have
+a
+mortal
+body
+The
+church
+has
+not
+the
+right
+understanding
+of
+God
+You
+found
+humbug
+in
+the
+church
+so
+you
+think
+everything
+is
+humbug
+You
+lost
+your
+body
+probably
+a
+long
+time
+ago
+My
+wife
+is
+a
+psychic
+sensitive
+and
+you
+are
+temporarily
+controlling
+her
+body
+Look
+about
+perhaps
+you
+can
+see
+some
+one
+you
+know
+Sp
+I
+can
+see
+Calango
+Dr
+You
+must
+realize
+that
+life
+means
+something
+Sp
+I
+have
+had
+faith
+and
+enough
+of
+it
+too
+I
+sacrificed
+my
+money
+and
+my
+wife
+and
+you
+see
+where
+I
+am
+Dr
+What
+has
+that
+to
+do
+with
+the
+facts
+of
+life
+Did
+you
+ever
+study
+the
+wonders
+of
+Nature
+Sp
+I
+do
+not
+believe
+in
+God
+there
+is
+no
+such
+thing
+Dr
+God
+has
+nothing
+to
+do
+with
+humbug
+Did
+you
+understand
+the
+Bible
+at
+all
+The
+Bible
+says
+God
+is
+Love
+Humbuggery
+has
+nothing
+to
+do
+with
+universal
+life
+We
+want
+to
+help
+you
+understand
+better
+things
+Sp
+No
+one
+ever
+helps
+me
+Dr
+Do
+you
+know
+you
+are
+in
+Los
+Angeles
+California
+Sp
+No
+Dr
+Try
+to
+understand
+what
+the
+real
+life
+means
+it
+means
+something
+you
+do
+not
+know
+of
+Did
+you
+ever
+make
+a
+flower
+Can
+you
+make
+grass
+grow
+or
+suspend
+life
+Did
+you
+ever
+study
+vegetation
+Sp
+That
+s
+God
+s
+Nature
+Dr
+Can
+ignorance
+produce
+intelligence
+Did
+you
+ever
+study
+the
+marvelous
+things
+of
+God
+Break
+an
+egg
+and
+you
+do
+not
+find
+life
+in
+it
+Take
+another
+egg
+keep
+it
+warm
+for
+twentyone
+days
+and
+a
+chicken
+comes
+out
+of
+it
+Sp
+That
+s
+natural
+Dr
+What
+produces
+the
+chicken
+We
+must
+add
+knowledge
+to
+our
+faith
+The
+Bible
+says
+God
+is
+spirit
+and
+they
+that
+worship
+him
+must
+worship
+him
+in
+spirit
+and
+in
+truth
+You
+do
+not
+find
+that
+in
+the
+churches
+They
+only
+have
+blind
+faith
+Sp
+I
+sure
+had
+faith
+Dr
+The
+Bible
+says
+Know
+the
+truth
+and
+the
+truth
+shall
+make
+you
+free
+Although
+the
+Bible
+is
+not
+a
+Holy
+Book
+it
+contains
+some
+wonderful
+truths
+Sp
+I
+don
+t
+believe
+it
+Laughing
+Dr
+You
+re
+laughing
+at
+your
+own
+ignorance
+My
+wife
+allows
+ignorant
+spirits
+to
+control
+her
+body
+so
+that
+we
+can
+bring
+them
+to
+an
+understanding
+of
+their
+condition
+She
+wants
+you
+to
+know
+that
+life
+exists
+on
+the
+other
+side
+We
+do
+not
+know
+where
+you
+came
+from
+but
+we
+allow
+you
+to
+control
+my
+wife
+s
+body
+Where
+was
+your
+home
+Sp
+My
+home
+That
+was
+in
+Canada
+near
+Montreal
+Dr
+I
+was
+there
+in
+Are
+you
+a
+French
+Canadian
+Sp
+My
+great
+grandfather
+was
+Dr
+Do
+you
+remember
+your
+name
+Sp
+I
+can
+t
+remember
+things
+Dr
+Now
+we
+want
+you
+to
+understand
+things
+Sp
+I
+was
+a
+slave
+Dr
+That
+is
+all
+in
+the
+past
+Sp
+I
+only
+see
+the
+past
+and
+it
+makes
+me
+crazy
+Instead
+of
+crying
+as
+many
+do
+I
+thought
+I
+would
+laugh
+at
+everything
+Whenever
+I
+got
+so
+mad
+I
+did
+not
+know
+what
+to
+do
+with
+myself
+I
+started
+to
+laugh
+I
+guess
+I
+felt
+a
+little
+better
+for
+laughing
+instead
+of
+crying
+I
+had
+my
+heart
+sorrows
+they
+took
+my
+wife
+my
+home
+went
+my
+children
+went
+My
+wife
+was
+a
+very
+pretty
+girl
+One
+day
+I
+came
+home
+from
+my
+work
+and
+I
+had
+worked
+very
+hard
+My
+wife
+and
+children
+were
+gone
+But
+after
+a
+while
+that
+minister
+of
+God
+did
+not
+want
+my
+wife
+any
+more
+then
+she
+commenced
+to
+go
+back
+on
+him
+but
+by
+that
+time
+I
+had
+gone
+down
+I
+said
+no
+church
+for
+mine
+that
+if
+one
+of
+God
+s
+ministers
+can
+break
+up
+my
+home
+and
+take
+my
+wife
+and
+children
+then
+there
+is
+no
+God
+I
+went
+clear
+down
+to
+hell
+for
+that
+fellow
+I
+went
+down
+and
+down
+but
+even
+down
+there
+in
+the
+gutter
+you
+find
+friendship
+and
+love
+for
+each
+other
+If
+you
+are
+down
+they
+too
+are
+down
+with
+you
+All
+the
+other
+people
+look
+down
+on
+you
+but
+believe
+me
+these
+others
+are
+true
+friends
+They
+will
+help
+you
+and
+divide
+whatever
+they
+have
+with
+you
+No
+matter
+how
+down
+you
+are
+if
+you
+haven
+t
+a
+cent
+you
+will
+find
+they
+will
+help
+you
+One
+day
+I
+will
+never
+forget
+what
+I
+saw
+never
+forget
+God
+if
+there
+is
+a
+God
+why
+in
+the
+name
+of
+the
+devil
+does
+he
+allow
+such
+things
+One
+day
+I
+met
+my
+wife
+Where
+was
+she
+She
+had
+gone
+down
+to
+the
+gutter
+I
+found
+her
+in
+one
+of
+those
+fine
+houses
+you
+hear
+about
+where
+that
+filthy
+devil
+had
+put
+her
+when
+he
+was
+through
+with
+her
+I
+looked
+at
+her
+and
+she
+looked
+at
+me
+You
+here
+I
+said
+And
+she
+said
+You
+here
+Why
+are
+you
+here
+I
+asked
+What
+are
+you
+here
+for
+she
+asked
+I
+said
+I
+came
+here
+probably
+of
+my
+own
+free
+will
+She
+said
+she
+had
+been
+put
+there
+by
+that
+glorious
+minister
+of
+God
+to
+hide
+his
+own
+shame
+To
+hide
+his
+own
+dirty
+work
+and
+not
+have
+people
+ask
+her
+questions
+he
+put
+her
+in
+a
+fast
+house
+and
+let
+her
+stay
+there
+and
+she
+did
+not
+care
+for
+anything
+We
+were
+both
+down
+all
+because
+of
+that
+devil
+I
+have
+never
+gone
+to
+church
+since
+I
+cursed
+that
+man
+and
+all
+religious
+cranks
+My
+wife
+wouldn
+t
+have
+anything
+to
+do
+with
+me
+and
+I
+wouldn
+t
+have
+her
+She
+was
+lying
+there
+full
+of
+disease
+There
+is
+not
+an
+animal
+living
+that
+goes
+so
+low
+as
+a
+woman
+when
+she
+goes
+to
+the
+dogs
+Can
+any
+one
+believe
+in
+a
+God
+that
+would
+let
+a
+woman
+like
+my
+wife
+suffer
+as
+she
+did
+through
+no
+fault
+of
+her
+own
+Why
+should
+such
+things
+exist
+Dr
+Why
+didn
+t
+you
+use
+the
+reason
+God
+gave
+you
+Sp
+There
+are
+hundreds
+of
+people
+living
+low
+down
+and
+they
+don
+t
+care
+where
+they
+go
+Dr
+Now
+you
+are
+going
+to
+care
+Let
+me
+talk
+now
+You
+went
+to
+church
+and
+adopted
+a
+blind
+faith
+that
+you
+admit
+Sp
+I
+wanted
+to
+be
+a
+good
+man
+Dr
+Didn
+t
+you
+feel
+a
+desire
+for
+something
+higher
+You
+merely
+had
+faith
+and
+did
+not
+add
+understanding
+God
+gave
+you
+sense
+he
+gave
+you
+intelligent
+reasoning
+faculties
+but
+you
+adopted
+a
+blind
+faith
+and
+clung
+to
+it
+That
+was
+not
+God
+s
+fault
+To
+our
+faith
+we
+must
+add
+knowledge
+and
+that
+will
+make
+us
+free
+God
+did
+not
+write
+the
+Bible
+Sp
+It
+is
+a
+Holy
+Book
+That
+is
+what
+they
+say
+Dr
+It
+was
+written
+by
+man
+Did
+you
+ever
+analyze
+the
+marvels
+of
+the
+human
+mind
+I
+am
+talking
+of
+facts
+now
+Did
+you
+ever
+realize
+how
+wonderful
+the
+human
+body
+is
+or
+how
+the
+invisible
+mind
+is
+able
+to
+control
+the
+material
+body
+Did
+you
+ever
+see
+the
+wonders
+of
+Nature
+Sp
+All
+that
+has
+nothing
+to
+do
+with
+my
+misery
+Dr
+If
+you
+had
+used
+your
+own
+faculties
+you
+would
+understand
+that
+love
+and
+mind
+are
+invisible
+Sp
+Didn
+t
+that
+devil
+love
+my
+wife
+Dr
+That
+was
+not
+love
+You
+did
+not
+use
+your
+faculties
+You
+joined
+the
+church
+in
+blind
+faith
+without
+using
+your
+reason
+We
+do
+not
+see
+you
+you
+are
+invisible
+to
+us
+and
+are
+using
+my
+wife
+s
+body
+temporarily
+We
+are
+interested
+in
+the
+condition
+of
+the
+so
+called
+dead
+and
+many
+of
+them
+are
+brought
+here
+to
+be
+enlightened
+You
+have
+been
+brought
+here
+by
+intelligent
+spirits
+so
+that
+you
+can
+learn
+to
+understand
+your
+true
+condition
+You
+have
+an
+opportunity
+to
+progress
+in
+the
+spirit
+world
+but
+you
+must
+forget
+your
+hatred
+You
+lost
+your
+physical
+body
+Do
+you
+know
+what
+year
+it
+is
+It
+is
+and
+you
+are
+in
+California
+Sp
+How
+did
+I
+get
+here
+I
+never
+was
+in
+California
+Dr
+How
+does
+spirit
+travel
+You
+spoke
+of
+other
+people
+here
+we
+do
+not
+see
+them
+We
+do
+not
+see
+you
+You
+are
+using
+my
+wife
+s
+organism
+Can
+t
+you
+see
+how
+wonderful
+life
+is
+Sp
+Why
+aren
+t
+we
+taught
+those
+things
+Dr
+Because
+the
+truth
+is
+not
+in
+the
+people
+You
+will
+have
+to
+judge
+for
+yourself
+between
+the
+facts
+of
+life
+and
+the
+creed
+of
+the
+church
+Churches
+are
+man
+made
+things
+God
+is
+Spirit
+and
+you
+must
+worship
+him
+in
+spirit
+and
+in
+truth
+in
+spirit
+and
+in
+truth
+We
+have
+aspirations
+for
+a
+higher
+life
+but
+that
+does
+not
+give
+us
+knowledge
+God
+is
+Spirit
+invisible
+Intelligence
+He
+manifests
+himself
+in
+all
+the
+wonders
+of
+the
+Universe
+Sp
+All
+these
+people
+here
+invisibles
+have
+had
+disappointments
+as
+I
+have
+but
+all
+have
+different
+stories
+We
+sit
+and
+talk
+to
+each
+other
+from
+time
+to
+time
+all
+telling
+of
+the
+past
+All
+have
+their
+troubles
+Dr
+God
+has
+nothing
+whatever
+to
+do
+with
+that
+The
+Universe
+is
+God
+s
+Temple
+and
+our
+souls
+are
+His
+Manifestations
+Think
+of
+the
+marvelous
+things
+in
+the
+Universe
+You
+speak
+of
+your
+friends
+being
+here
+yet
+we
+cannot
+see
+them
+Sp
+They
+want
+to
+know
+if
+you
+can
+help
+them
+all
+from
+their
+troubles
+Dr
+Yes
+we
+can
+Tell
+them
+that
+life
+means
+something
+Look
+around
+and
+you
+may
+see
+intelligent
+spirits
+who
+will
+help
+you
+Sp
+There
+are
+six
+of
+us
+and
+we
+have
+all
+had
+the
+same
+trouble
+and
+disappointment
+but
+each
+has
+a
+different
+story
+Dr
+Tell
+them
+that
+none
+of
+you
+need
+be
+in
+the
+condition
+you
+are
+in
+Sp
+There
+s
+one
+group
+called
+The
+Laughing
+Fools
+there
+s
+another
+called
+The
+Cursing
+Fools
+there
+s
+another
+called
+The
+Swearing
+Fools
+there
+s
+another
+called
+The
+Singing
+Fools
+They
+sing
+and
+pray
+from
+morning
+until
+night
+You
+get
+sick
+and
+tired
+of
+hearing
+them
+Dr
+The
+Bible
+says
+As
+a
+man
+thinketh
+in
+his
+heart
+so
+is
+he
+Religious
+fanatics
+are
+the
+worst
+They
+have
+not
+added
+understanding
+to
+their
+blind
+faith
+We
+all
+have
+faculties
+but
+do
+not
+use
+them
+Is
+that
+God
+s
+fault
+Sp
+I
+have
+not
+worked
+for
+a
+long
+time
+Sometimes
+none
+of
+us
+have
+any
+food
+We
+have
+done
+without
+it
+so
+long
+that
+now
+we
+do
+not
+seem
+to
+need
+it
+Dr
+The
+spirit
+does
+not
+need
+food
+Sp
+We
+are
+starving
+starving
+Dr
+Spiritually
+starving
+Sp
+We
+are
+all
+starving
+for
+something
+but
+we
+don
+t
+know
+what
+it
+is
+We
+are
+all
+anxious
+to
+know
+We
+all
+say
+that
+our
+souls
+cry
+out
+for
+something
+but
+we
+don
+t
+know
+what
+it
+is
+None
+of
+us
+want
+to
+pray
+For
+my
+part
+I
+cannot
+I
+had
+faith
+and
+prayed
+but
+here
+I
+am
+in
+all
+this
+trouble
+Dr
+God
+has
+given
+each
+one
+of
+you
+reasoning
+faculties
+Sp
+Would
+you
+help
+us
+all
+They
+all
+say
+they
+are
+hungry
+for
+happiness
+All
+we
+can
+see
+is
+our
+past
+and
+we
+all
+want
+something
+higher
+All
+I
+can
+see
+is
+my
+wife
+as
+I
+saw
+her
+last
+down
+down
+Dr
+So
+far
+as
+your
+wife
+is
+concerned
+it
+was
+only
+her
+body
+that
+was
+diseased
+not
+her
+spirit
+Sp
+When
+we
+saw
+each
+other
+we
+both
+cried
+Dr
+After
+you
+have
+understanding
+you
+can
+all
+do
+a
+great
+work
+in
+helping
+others
+Listen
+to
+the
+invisible
+friends
+who
+are
+around
+you
+All
+be
+quiet
+a
+moment
+and
+your
+eyes
+will
+open
+to
+undreamed
+of
+things
+Sp
+Do
+you
+think
+my
+wife
+can
+get
+help
+She
+was
+as
+pure
+as
+a
+lily
+I
+loved
+her
+Dr
+You
+can
+love
+her
+still
+We
+must
+all
+try
+to
+find
+ourselves
+As
+we
+grow
+out
+of
+our
+ignorance
+we
+see
+the
+higher
+things
+of
+existence
+both
+here
+and
+in
+the
+spirit
+life
+If
+we
+were
+born
+into
+a
+perfect
+condition
+we
+would
+not
+appreciate
+it
+You
+have
+seen
+hell
+and
+when
+you
+progress
+you
+will
+see
+heaven
+You
+will
+find
+a
+beautiful
+condition
+and
+you
+will
+appreciate
+it
+You
+will
+then
+be
+enthusiastic
+helpers
+eager
+to
+serve
+others
+You
+must
+all
+open
+your
+hearts
+for
+higher
+things
+Sp
+I
+love
+my
+wife
+To
+the
+invisibles
+No
+boys
+don
+t
+go
+yet
+wait
+a
+little
+while
+longer
+Dr
+The
+Bible
+says
+Ask
+and
+it
+shall
+be
+given
+you
+seek
+and
+ye
+shall
+find
+knock
+and
+it
+shall
+be
+opened
+unto
+you
+Sp
+With
+heartfelt
+solemnity
+If
+there
+is
+a
+God
+help
+me
+Help
+my
+poor
+wife
+We
+loved
+each
+other
+Oh
+God
+Help
+us
+all
+We
+are
+starving
+for
+something
+Dr
+His
+messengers
+will
+help
+you
+You
+will
+see
+many
+who
+will
+gladly
+help
+you
+all
+Sp
+God
+help
+us
+all
+Dr
+If
+you
+will
+look
+around
+you
+will
+see
+spirits
+who
+will
+help
+you
+Sp
+There
+s
+my
+boy
+my
+own
+little
+boy
+Charlie
+You
+are
+my
+boy
+You
+died
+many
+years
+ago
+but
+you
+are
+my
+boy
+Charlie
+Have
+you
+come
+to
+help
+your
+old
+Dad
+my
+boy
+Your
+poor
+Dad
+has
+suffered
+hell
+my
+boy
+Help
+your
+mother
+boy
+help
+your
+mother
+poor
+mother
+Suddenly
+amazed
+Why
+that
+s
+my
+little
+boy
+Charlie
+but
+he
+s
+a
+man
+now
+Charlie
+my
+little
+boy
+can
+you
+forgive
+your
+old
+Dad
+I
+tried
+so
+hard
+to
+have
+faith
+and
+I
+tried
+to
+be
+good
+If
+there
+is
+a
+God
+open
+my
+eyes
+to
+see
+God
+help
+me
+Gazing
+at
+some
+vision
+then
+speaking
+in
+a
+hushed
+voice
+Now
+we
+can
+all
+see
+the
+glory
+of
+God
+and
+we
+will
+all
+go
+with
+Charlie
+Astonished
+You
+Are
+you
+here
+also
+Clara
+Come
+to
+me
+oh
+Clara
+I
+forgive
+you
+I
+forgive
+you
+Clara
+I
+know
+it
+was
+not
+your
+fault
+It
+was
+that
+devil
+he
+took
+you
+away
+from
+me
+I
+love
+you
+and
+always
+have
+loved
+you
+Come
+Clara
+come
+with
+us
+and
+let
+us
+go
+with
+Charlie
+He
+will
+probably
+forgive
+you
+Dr
+What
+does
+he
+say
+Sp
+He
+says
+Come
+with
+me
+to
+my
+spirit
+home
+where
+all
+is
+lovely
+where
+you
+will
+be
+happy
+It
+was
+because
+of
+sorrow
+and
+suffering
+that
+you
+looked
+at
+life
+as
+you
+did
+Dr
+Don
+t
+you
+realize
+there
+is
+something
+beautiful
+ahead
+of
+you
+Sp
+Is
+it
+Heaven
+Why
+look
+there
+There
+s
+my
+mother
+and
+sister
+Emma
+Are
+you
+both
+here
+too
+Can
+you
+forgive
+Clara
+and
+me
+I
+thought
+you
+were
+in
+Heaven
+mother
+you
+were
+so
+good
+You
+always
+loved
+me
+Dr
+Do
+you
+realize
+now
+that
+there
+is
+something
+higher
+than
+your
+past
+Sp
+Yes
+Now
+I
+know
+there
+is
+a
+God
+I
+do
+believe
+in
+God
+now
+for
+I
+know
+His
+glory
+I
+see
+and
+feel
+His
+glory
+Dr
+After
+you
+have
+understanding
+you
+must
+help
+the
+others
+you
+were
+talking
+about
+Sp
+They
+are
+all
+coming
+with
+me
+I
+want
+them
+all
+to
+come
+for
+I
+cannot
+leave
+them
+You
+have
+helped
+all
+of
+us
+Now
+we
+will
+go
+come
+on
+boys
+We
+had
+names
+for
+each
+other
+but
+they
+were
+not
+our
+own
+In
+our
+hatred
+and
+because
+we
+laughed
+we
+were
+called
+The
+Laughing
+Fools
+Most
+of
+our
+time
+was
+spent
+in
+talking
+over
+our
+past
+Now
+we
+have
+all
+found
+God
+we
+have
+found
+Him
+in
+His
+glory
+in
+His
+happiness
+in
+the
+spirit
+world
+We
+do
+not
+need
+to
+believe
+for
+we
+know
+He
+will
+help
+us
+all
+Mother
+father
+and
+sister
+all
+are
+here
+Come
+on
+now
+boys
+We
+all
+listened
+to
+what
+this
+man
+said
+and
+you
+see
+where
+it
+brought
+us
+Today
+I
+call
+you
+our
+savior
+because
+you
+have
+saved
+us
+from
+darkness
+and
+brought
+us
+to
+glory
+You
+saved
+us
+all
+Not
+only
+myself
+but
+the
+others
+have
+opened
+their
+eyes
+to
+see
+the
+glory
+of
+God
+and
+not
+a
+God
+of
+hatred
+and
+envy
+Dr
+You
+can
+thank
+my
+wife
+who
+allows
+her
+body
+to
+be
+used
+so
+that
+spirits
+may
+be
+helped
+Sp
+I
+will
+never
+forget
+you
+You
+have
+given
+me
+happiness
+that
+I
+have
+not
+known
+for
+years
+and
+years
+You
+say
+it
+is
+Is
+that
+true
+I
+thought
+it
+was
+Dr
+Can
+you
+tell
+us
+your
+name
+friend
+Sp
+My
+name
+Yes
+it
+s
+Mallory
+They
+called
+me
+a
+Laughing
+Fool
+We
+thank
+you
+all
+for
+your
+patience
+I
+was
+full
+of
+hatred
+when
+I
+came
+but
+that
+has
+all
+gone
+now
+God
+bless
+you
+all
+I
+have
+to
+call
+you
+my
+savior
+because
+you
+have
+saved
+us
+from
+that
+dark
+condition
+and
+brought
+us
+to
+a
+beautiful
+place
+Clara
+you
+come
+too
+for
+I
+love
+you
+dearly
+You
+are
+well
+now
+Dr
+You
+will
+now
+become
+useful
+spirits
+Find
+God
+and
+forget
+the
+past
+Sp
+The
+last
+time
+I
+saw
+Clara
+she
+was
+very
+sick
+and
+was
+taking
+morphine
+all
+the
+time
+Come
+to
+me
+Clara
+I
+forgive
+you
+See
+Charlie
+is
+with
+us
+Can
+t
+we
+help
+Clara
+She
+seems
+dazed
+Dr
+She
+is
+probably
+still
+under
+the
+effects
+of
+the
+opiate
+Your
+love
+will
+bring
+her
+to
+you
+Sp
+I
+never
+could
+hate
+her
+she
+was
+so
+pure
+Clara
+wake
+up
+You
+are
+not
+dead
+Forget
+the
+past
+and
+live
+in
+the
+new
+life
+Thank
+you
+all
+for
+bringing
+me
+happiness
+and
+also
+for
+bringing
+God
+to
+me
+in
+my
+heart
+I
+never
+properly
+understood
+Him
+before
+I
+found
+Him
+in
+the
+glory
+of
+Nature
+too
+Look
+at
+all
+those
+beautiful
+flowers
+Is
+this
+Heaven
+Dr
+It
+is
+the
+spirit
+world
+Sp
+Now
+I
+m
+always
+going
+to
+be
+with
+my
+loved
+ones
+in
+the
+spirit
+world
+We
+will
+go
+Goodbye
+A
+communication
+of
+a
+different
+type
+was
+received
+from
+the
+spirit
+of
+a
+young
+man
+son
+of
+one
+of
+the
+members
+of
+our
+circle
+The
+young
+man
+had
+passed
+over
+two
+months
+before
+but
+having
+been
+unbiased
+and
+open
+minded
+was
+readily
+enlightened
+by
+his
+spirit
+friends
+In
+his
+short
+visit
+to
+our
+circle
+he
+gave
+an
+interesting
+description
+of
+conditions
+as
+he
+observed
+them
+in
+both
+the
+earth
+sphere
+and
+the
+spirit
+world
+EXPERIENCE
+APRIL
+Spirit
+W
+Y
+Psychic
+MRS
+WICKLAND
+Spirit
+Well
+Dad
+I
+m
+here
+again
+The
+spirit
+friends
+gave
+me
+the
+privilege
+of
+coming
+and
+talking
+first
+Dad
+it
+s
+queer
+that
+I
+should
+go
+so
+quickly
+but
+my
+time
+had
+come
+I
+am
+glad
+the
+door
+is
+not
+shut
+for
+me
+I
+have
+seen
+many
+heartbroken
+spirits
+who
+go
+to
+their
+relatives
+and
+friends
+and
+the
+door
+is
+closed
+in
+their
+faces
+Through
+skepticism
+and
+unconsciousness
+of
+the
+presence
+of
+spirits
+I
+have
+much
+to
+be
+thankful
+for
+because
+it
+s
+hard
+for
+them
+Grandpa
+B
+and
+Uncle
+C
+stood
+right
+beside
+me
+when
+I
+woke
+up
+from
+the
+sleep
+of
+death
+It
+was
+queer
+It
+was
+like
+an
+electric
+shock
+going
+through
+my
+body
+Life
+is
+queer
+If
+each
+one
+of
+you
+could
+see
+the
+experiences
+gone
+through
+by
+those
+who
+go
+into
+the
+sleep
+of
+death
+Dad
+I
+had
+a
+little
+knowledge
+of
+the
+next
+life
+not
+much
+but
+a
+little
+and
+it
+helped
+I
+could
+realize
+that
+the
+change
+of
+death
+had
+taken
+place
+I
+recognized
+my
+relatives
+and
+friends
+Uncle
+F
+says
+I
+should
+tell
+you
+that
+I
+was
+much
+better
+off
+than
+he
+was
+when
+he
+passed
+to
+the
+other
+side
+and
+that
+now
+his
+work
+is
+to
+help
+the
+unfortunate
+ones
+who
+do
+not
+understand
+the
+real
+life
+Dad
+wasn
+t
+it
+queer
+that
+I
+should
+wake
+up
+to
+the
+new
+birth
+See
+Chap
+Page
+Spirit
+F
+W
+of
+life
+on
+my
+earthly
+birthday
+Now
+I
+have
+my
+spiritual
+birthday
+on
+the
+same
+day
+as
+my
+earthly
+birthday
+Dad
+it
+s
+glorious
+Tell
+E
+so
+and
+B
+and
+mother
+tell
+all
+of
+them
+that
+I
+am
+happy
+in
+the
+thought
+that
+I
+can
+come
+to
+them
+and
+that
+the
+door
+is
+not
+closed
+to
+me
+Tell
+my
+little
+son
+that
+I
+am
+not
+dead
+that
+I
+am
+not
+in
+the
+grave
+but
+am
+with
+him
+and
+I
+will
+learn
+the
+laws
+governing
+so
+that
+I
+can
+guide
+him
+through
+life
+Let
+him
+have
+an
+understanding
+that
+I
+am
+there
+with
+him
+and
+that
+I
+have
+more
+strength
+and
+power
+to
+help
+him
+than
+before
+Thank
+God
+that
+I
+also
+had
+understanding
+so
+that
+I
+did
+not
+come
+too
+close
+to
+my
+dear
+wife
+otherwise
+I
+would
+have
+gotten
+into
+her
+magnetic
+aura
+and
+might
+have
+caused
+trouble
+My
+dear
+little
+wife
+I
+am
+glad
+that
+I
+did
+not
+make
+trouble
+for
+us
+both
+I
+have
+seen
+much
+of
+the
+work
+done
+among
+those
+who
+have
+passed
+out
+and
+do
+not
+realize
+it
+They
+go
+home
+to
+their
+relatives
+and
+friends
+and
+want
+to
+stay
+there
+rather
+than
+go
+on
+Dad
+I
+m
+so
+glad
+you
+could
+come
+here
+again
+and
+I
+m
+glad
+so
+glad
+that
+there
+is
+no
+wall
+between
+us
+Mr
+Y
+Father
+of
+spirit
+I
+am
+glad
+too
+that
+I
+had
+an
+opportunity
+of
+being
+here
+again
+Sp
+I
+feel
+now
+that
+there
+is
+no
+parting
+It
+is
+only
+that
+I
+have
+gone
+to
+another
+country
+but
+I
+am
+with
+you
+all
+I
+am
+with
+you
+when
+you
+are
+all
+together
+and
+talk
+about
+me
+I
+do
+not
+feel
+that
+I
+have
+gone
+Tell
+mother
+and
+my
+dear
+little
+wife
+not
+to
+mourn
+for
+me
+but
+to
+feel
+glad
+that
+I
+can
+be
+with
+them
+It
+was
+very
+hard
+that
+we
+should
+have
+to
+part
+when
+everything
+looked
+so
+bright
+for
+us
+in
+our
+little
+home
+but
+it
+was
+my
+time
+to
+go
+and
+when
+our
+time
+comes
+to
+go
+from
+this
+earth
+life
+we
+have
+to
+go
+We
+do
+not
+go
+away
+as
+people
+think
+we
+do
+we
+are
+here
+with
+our
+loved
+ones
+only
+our
+bodies
+are
+not
+visible
+I
+wish
+you
+could
+see
+how
+Uncle
+F
+works
+in
+the
+dark
+earth
+sphere
+to
+help
+and
+to
+serve
+the
+unfortunate
+ones
+there
+to
+prevent
+them
+from
+obsessing
+any
+one
+He
+is
+so
+anxious
+to
+have
+everybody
+know
+the
+real
+truth
+on
+the
+other
+side
+and
+it
+is
+a
+pity
+that
+so
+much
+dogma
+and
+creed
+are
+the
+stumblingblocks
+The
+little
+time
+I
+have
+been
+gone
+I
+have
+learned
+so
+much
+I
+thank
+you
+Dad
+that
+you
+and
+mother
+did
+not
+force
+any
+strong
+dogma
+or
+religion
+or
+creed
+upon
+my
+mind
+I
+was
+free
+Thank
+you
+for
+it
+Mr
+Y
+It
+s
+pretty
+hard
+sometimes
+to
+know
+exactly
+what
+to
+do
+regarding
+religion
+in
+bringing
+up
+children
+Sp
+I
+wish
+all
+could
+have
+been
+as
+free
+as
+I
+was
+then
+there
+would
+not
+be
+so
+much
+sorrow
+and
+doubt
+Dad
+I
+m
+so
+glad
+I
+can
+come
+to
+you
+again
+The
+other
+day
+Uncle
+F
+Uncle
+C
+and
+I
+went
+to
+the
+earth
+sphere
+not
+to
+our
+home
+but
+to
+the
+condition
+that
+exists
+on
+the
+lower
+plane
+That
+is
+more
+of
+a
+hell
+than
+anybody
+can
+describe
+It
+s
+worse
+than
+an
+insane
+asylum
+where
+one
+is
+crazy
+in
+one
+way
+and
+another
+in
+another
+way
+You
+can
+t
+imagine
+what
+a
+hell
+it
+is
+One
+has
+one
+creed
+one
+another
+and
+they
+are
+all
+in
+the
+dark
+They
+are
+all
+hypnotized
+in
+their
+creeds
+and
+beliefs
+and
+you
+can
+not
+get
+any
+sense
+whatever
+into
+them
+You
+have
+to
+put
+some
+object
+lesson
+before
+them
+to
+attract
+their
+attention
+At
+times
+music
+will
+make
+them
+realize
+their
+condition
+If
+you
+can
+attract
+their
+attention
+you
+can
+sometimes
+reach
+the
+real
+spirit
+but
+dogmas
+and
+creeds
+are
+so
+planted
+in
+their
+minds
+that
+they
+cannot
+see
+anything
+If
+you
+want
+to
+realize
+in
+part
+what
+the
+condition
+of
+the
+earth
+sphere
+is
+go
+to
+the
+worst
+ward
+in
+an
+insane
+asylum
+and
+you
+can
+then
+have
+some
+realization
+of
+the
+condition
+on
+the
+invisible
+side
+when
+they
+have
+no
+knowledge
+of
+the
+next
+life
+Imagine
+a
+spirit
+of
+that
+character
+coming
+in
+contact
+with
+a
+person
+s
+magnetic
+aura
+and
+acting
+through
+him
+as
+is
+often
+the
+case
+They
+call
+that
+person
+insane
+and
+send
+him
+to
+the
+insane
+asylum
+where
+there
+are
+a
+lot
+of
+other
+lunatics
+both
+of
+earth
+and
+the
+spirit
+side
+of
+life
+It
+is
+terrible
+to
+know
+that
+such
+a
+condition
+exists
+and
+that
+selfish
+creeds
+And
+dogmas
+are
+the
+cause
+of
+it
+all
+I
+have
+to
+thank
+you
+and
+mother
+again
+for
+not
+forcing
+any
+dogma
+on
+me
+what
+little
+knowledge
+I
+had
+was
+the
+real
+truth
+of
+life
+Uncle
+C
+took
+me
+at
+another
+time
+to
+different
+conditions
+He
+said
+Come
+we
+will
+go
+and
+we
+went
+to
+some
+place
+in
+spirit
+life
+We
+came
+to
+a
+place
+which
+I
+cannot
+describe
+I
+can
+t
+describe
+my
+feelings
+I
+can
+t
+describe
+the
+conditions
+because
+the
+music
+was
+so
+sublime
+so
+different
+from
+anything
+I
+have
+ever
+heard
+I
+felt
+so
+light
+I
+felt
+I
+was
+lifted
+up
+Such
+people
+as
+were
+there
+I
+cannot
+describe
+them
+Imagine
+if
+you
+can
+a
+place
+where
+there
+is
+the
+most
+beautiful
+music
+where
+there
+is
+a
+grand
+orchestra
+of
+masters
+all
+playing
+in
+one
+grand
+unit
+of
+music
+Can
+you
+imagine
+what
+it
+would
+be
+I
+enjoyed
+it
+but
+Oh
+I
+could
+not
+realize
+its
+full
+import
+because
+I
+wanted
+you
+and
+my
+dear
+little
+wife
+to
+hear
+it
+I
+could
+not
+enjoy
+it
+alone
+I
+wanted
+to
+open
+the
+door
+to
+you
+all
+at
+home
+so
+that
+you
+could
+all
+listen
+to
+it
+then
+I
+should
+have
+felt
+satisfied
+I
+thought
+and
+thought
+and
+an
+old
+gentleman
+came
+up
+to
+me
+and
+patted
+me
+on
+the
+shoulder
+and
+said
+Young
+man
+I
+receive
+your
+thought
+Do
+not
+worry
+Soon
+the
+time
+will
+come
+for
+which
+we
+are
+all
+working
+when
+an
+instrument
+will
+be
+invented
+on
+earth
+through
+which
+all
+who
+wish
+can
+hear
+the
+grand
+masters
+in
+the
+spirit
+world
+Not
+yet
+but
+in
+time
+Dad
+my
+work
+is
+to
+learn
+to
+help
+others
+less
+fortunate
+than
+myself
+and
+also
+to
+learn
+to
+be
+a
+help
+and
+not
+a
+detriment
+to
+my
+dear
+wife
+and
+little
+boy
+and
+to
+you
+all
+I
+am
+learning
+my
+lessons
+and
+after
+knowing
+them
+I
+will
+come
+to
+you
+Don
+t
+think
+I
+am
+not
+with
+you
+all
+but
+think
+I
+am
+there
+for
+I
+am
+and
+in
+that
+way
+I
+can
+be
+much
+closer
+especially
+when
+you
+have
+music
+because
+music
+brings
+us
+much
+closer
+to
+those
+we
+love
+Goodbye
+and
+tell
+my
+dear
+wife
+I
+send
+her
+best
+love
+With
+exquisite
+grace
+and
+courteous
+inquiry
+came
+the
+spirit
+of
+one
+formerly
+a
+famous
+actress
+whose
+friends
+had
+tried
+in
+vain
+to
+waken
+her
+from
+the
+sleep
+of
+death
+EXPERIENCE
+JULY
+Spirit
+LILLIAN
+R
+Psychic
+MRS
+WICKLAND
+Doctor
+Good
+Evening
+friend
+Where
+have
+you
+come
+from
+Spirit
+Somebody
+told
+me
+to
+come
+here
+but
+I
+do
+not
+know
+what
+I
+should
+do
+My
+condition
+is
+so
+strange
+that
+I
+cannot
+understand
+it
+I
+do
+not
+realize
+where
+I
+am
+Dr
+You
+are
+in
+Los
+Angeles
+California
+Sp
+No
+There
+are
+many
+here
+who
+wanted
+me
+to
+come
+but
+I
+cannot
+understand
+why
+I
+do
+not
+know
+any
+of
+you
+here
+Dr
+You
+were
+brought
+here
+to
+be
+helped
+Sp
+I
+do
+not
+know
+that
+I
+need
+any
+help
+Things
+look
+so
+confusing
+to
+me
+Dr
+That
+is
+because
+you
+do
+not
+understand
+your
+condition
+Where
+do
+you
+think
+you
+should
+be
+Sp
+Where
+my
+home
+is
+Dr
+What
+state
+did
+you
+live
+in
+Sp
+Of
+course
+most
+of
+the
+time
+I
+was
+in
+New
+York
+but
+at
+times
+I
+was
+in
+London
+and
+other
+places
+Dr
+Cannot
+you
+see
+any
+one
+you
+know
+or
+the
+one
+who
+brought
+you
+here
+Sp
+Oh
+Disturbed
+greatly
+by
+pain
+in
+limb
+Dr
+Were
+you
+in
+some
+accident
+Were
+you
+traveling
+What
+is
+the
+last
+thing
+you
+remember
+Sp
+I
+was
+very
+sick
+I
+had
+such
+pain
+Dr
+Probably
+that
+was
+your
+last
+illness
+Did
+you
+become
+well
+suddenly
+Sp
+No
+it
+seems
+to
+me
+that
+I
+have
+been
+sleeping
+and
+in
+some
+way
+or
+another
+I
+am
+just
+waking
+up
+Everything
+looks
+so
+queer
+Dr
+You
+do
+not
+understand
+your
+condition
+You
+do
+not
+need
+to
+have
+that
+pain
+If
+you
+say
+I
+will
+not
+have
+that
+pain
+it
+will
+disappear
+Will
+you
+do
+that
+Sp
+Yes
+but
+it
+seems
+very
+hard
+to
+say
+You
+are
+a
+Christian
+Scientist
+are
+you
+not
+I
+looked
+into
+Christian
+Science
+but
+I
+certainly
+could
+not
+say
+my
+pains
+were
+imagination
+Dr
+You
+are
+in
+a
+different
+condition
+now
+Do
+you
+ever
+see
+any
+of
+your
+friends
+around
+you
+Sp
+Yes
+I
+sometimes
+see
+many
+of
+my
+particular
+friends
+that
+have
+gone
+before
+and
+then
+I
+think
+to
+myself
+that
+I
+have
+gone
+crazy
+My
+friends
+are
+around
+me
+and
+some
+one
+says
+Wake
+up
+But
+I
+cannot
+see
+I
+do
+not
+want
+to
+see
+them
+Dr
+That
+is
+because
+you
+do
+not
+want
+to
+understand
+Were
+you
+afraid
+of
+them
+when
+they
+were
+living
+Sp
+No
+I
+was
+not
+Dr
+Then
+why
+should
+you
+be
+afraid
+of
+them
+when
+they
+have
+lost
+their
+mortal
+bodies
+Sp
+I
+am
+afraid
+and
+very
+nervous
+and
+I
+do
+not
+want
+them
+to
+come
+near
+me
+Why
+don
+t
+my
+lovely
+friends
+come
+Dr
+To
+your
+earthly
+friends
+you
+are
+dead
+but
+to
+your
+spirit
+friends
+you
+are
+not
+dead
+Sp
+I
+was
+sick
+but
+I
+cannot
+remember
+that
+I
+died
+I
+went
+to
+sleep
+but
+I
+cannot
+remember
+that
+I
+failed
+to
+wake
+up
+Several
+of
+my
+friends
+just
+came
+and
+called
+me
+to
+go
+with
+them
+Dr
+Do
+you
+know
+why
+they
+told
+you
+to
+wake
+up
+To
+your
+spirit
+friends
+you
+are
+only
+sleeping
+Sp
+Why
+do
+they
+call
+me
+Dr
+To
+help
+you
+and
+make
+you
+understand
+Sp
+I
+do
+not
+know
+you
+Dr
+I
+am
+Dr
+Wickland
+Who
+brought
+you
+here
+Sp
+Anna
+H
+an
+actress
+well
+known
+to
+the
+spirit
+during
+earth
+life
+told
+me
+to
+come
+Dr
+She
+spoke
+to
+us
+once
+as
+you
+are
+doing
+now
+Sp
+She
+came
+to
+me
+but
+I
+knew
+she
+was
+dead
+and
+gone
+Dr
+She
+is
+not
+dead
+We
+do
+not
+see
+you
+we
+only
+hear
+you
+talk
+You
+do
+not
+see
+me
+you
+only
+see
+my
+body
+Mind
+is
+invisible
+there
+is
+no
+death
+See
+Chap
+Pages
+Spirit
+Anna
+H
+Sp
+So
+many
+people
+have
+come
+to
+me
+and
+want
+me
+to
+wake
+up
+and
+start
+in
+my
+work
+again
+Dr
+If
+you
+do
+not
+mind
+telling
+us
+we
+should
+like
+to
+know
+who
+you
+are
+Sp
+Don
+t
+you
+know
+me
+I
+was
+an
+actress
+I
+was
+known
+as
+Lillian
+R
+I
+am
+not
+dead
+William
+Stead
+came
+to
+me
+and
+also
+the
+late
+King
+Edward
+I
+was
+his
+favorite
+actress
+I
+cannot
+understand
+why
+I
+came
+here
+They
+say
+I
+was
+brought
+here
+for
+you
+to
+awaken
+me
+Dr
+We
+are
+interested
+in
+life
+s
+problems
+and
+in
+the
+question
+What
+becomes
+of
+the
+Dead
+Sp
+I
+studied
+some
+but
+only
+understood
+slightly
+the
+phenomena
+I
+studied
+but
+at
+the
+same
+time
+my
+life
+was
+so
+busy
+so
+much
+taken
+up
+with
+others
+and
+I
+was
+also
+trying
+to
+live
+the
+best
+I
+knew
+how
+I
+am
+very
+tired
+and
+sleepy
+Dr
+What
+was
+the
+nature
+of
+your
+sickness
+Sp
+They
+told
+me
+so
+many
+different
+things
+until
+at
+last
+I
+do
+not
+know
+what
+it
+was
+I
+had
+such
+dreadful
+pains
+down
+this
+way
+from
+the
+knee
+down
+I
+was
+unconscious
+for
+a
+time
+I
+cannot
+remember
+things
+very
+clearly
+in
+some
+way
+I
+seem
+to
+have
+lost
+my
+memory
+I
+cannot
+recollect
+anything
+of
+the
+past
+I
+feel
+different
+as
+if
+I
+had
+nothing
+to
+look
+forward
+to
+in
+the
+future
+I
+am
+not
+unhappy
+but
+at
+the
+same
+time
+I
+am
+not
+happy
+Dr
+We
+will
+explain
+matters
+to
+you
+You
+do
+not
+need
+to
+worry
+Sp
+My
+friends
+came
+and
+I
+would
+not
+have
+anything
+to
+do
+with
+them
+They
+said
+Come
+along
+but
+I
+said
+No
+no
+no
+I
+am
+not
+ready
+yet
+I
+do
+not
+want
+to
+go
+Dr
+You
+had
+already
+gone
+but
+did
+not
+understand
+it
+Your
+friends
+came
+to
+help
+you
+but
+you
+did
+not
+understand
+it
+Do
+you
+know
+where
+you
+are
+now
+This
+is
+my
+wife
+s
+body
+you
+are
+using
+She
+is
+sleeping
+You
+are
+not
+talking
+through
+your
+own
+body
+Sp
+Noticing
+another
+invisible
+formerly
+a
+friend
+John
+J
+A
+is
+here
+Dr
+This
+lady
+is
+a
+psychic
+She
+is
+my
+wife
+and
+allows
+spirits
+to
+control
+her
+so
+that
+we
+can
+make
+them
+understand
+their
+condition
+Mr
+John
+J
+A
+Mr
+Stead
+and
+Anna
+H
+could
+not
+make
+you
+understand
+Sp
+I
+was
+afraid
+of
+them
+Dr
+This
+is
+a
+Clearing
+House
+for
+just
+such
+conditions
+as
+yours
+You
+are
+a
+spirit
+and
+are
+controlling
+a
+mortal
+body
+We
+See
+Chap
+Page
+Spirit
+John
+J
+A
+on
+the
+mortal
+side
+can
+talk
+to
+you
+because
+we
+are
+in
+our
+mortal
+bodies
+You
+have
+lost
+your
+physical
+body
+but
+have
+a
+spiritual
+body
+When
+you
+passed
+away
+you
+only
+went
+to
+sleep
+and
+you
+are
+just
+now
+waking
+up
+You
+awaken
+and
+find
+yourself
+in
+this
+twilight
+Sp
+Someone
+seemed
+to
+give
+me
+an
+electric
+shock
+and
+I
+seemed
+to
+come
+to
+life
+but
+still
+I
+am
+dazed
+There
+is
+a
+room
+full
+of
+faces
+people
+whom
+I
+have
+known
+in
+life
+but
+who
+have
+passed
+on
+They
+have
+been
+around
+me
+trying
+to
+talk
+to
+me
+but
+I
+would
+not
+listen
+Dr
+That
+was
+your
+mistake
+Sp
+Does
+the
+spirit
+still
+live
+Dr
+Certainly
+it
+does
+We
+are
+mortals
+but
+these
+others
+whom
+you
+see
+are
+spirits
+Sp
+They
+are
+just
+as
+real
+as
+you
+are
+Dr
+They
+are
+more
+real
+than
+we
+are
+because
+they
+are
+free
+and
+we
+are
+in
+a
+dream
+state
+Sp
+I
+feel
+that
+my
+being
+well
+is
+just
+a
+dream
+and
+that
+I
+will
+wake
+up
+in
+pain
+Dr
+When
+you
+leave
+here
+you
+will
+go
+with
+the
+others
+Sp
+Do
+you
+mean
+I
+can
+go
+with
+them
+Dr
+As
+soon
+as
+you
+cease
+to
+resist
+them
+Sp
+Here
+comes
+one
+then
+another
+and
+they
+say
+they
+want
+me
+Dr
+Don
+t
+you
+remember
+that
+Longfellow
+said
+Life
+is
+real
+Life
+is
+earnest
+And
+the
+grave
+is
+not
+its
+goal
+Dust
+thou
+art
+to
+dust
+returnest
+Was
+not
+spoken
+of
+the
+soul
+Sp
+What
+beautiful
+things
+I
+see
+Are
+they
+not
+beautiful
+This
+is
+not
+a
+dream
+Dr
+They
+are
+showing
+you
+some
+of
+the
+things
+on
+the
+spirit
+side
+of
+life
+Sp
+Just
+look
+at
+those
+beautiful
+homes
+on
+that
+hillside
+Look
+at
+those
+lovely
+walks
+beautiful
+lakes
+and
+hills
+lovely
+flowers
+that
+bloom
+everywhere
+Isn
+t
+it
+beautiful
+Can
+I
+go
+there
+Dr
+There
+is
+nothing
+to
+hinder
+you
+except
+your
+own
+unwillingness
+and
+resistance
+Sp
+I
+was
+an
+actress
+in
+life
+still
+in
+my
+heart
+I
+believed
+in
+a
+God
+You
+know
+the
+church
+always
+looks
+down
+on
+actresses
+I
+always
+liked
+to
+give
+the
+world
+the
+best
+there
+was
+in
+me
+I
+wanted
+to
+show
+what
+we
+can
+do
+to
+help
+amuse
+people
+Dr
+You
+can
+do
+the
+same
+thing
+now
+in
+your
+new
+life
+Sp
+In
+a
+way
+many
+would
+say
+that
+I
+was
+not
+a
+Christian
+In
+my
+own
+way
+I
+believed
+in
+being
+good
+and
+doing
+good
+for
+others
+that
+was
+my
+belief
+At
+times
+I
+went
+to
+church
+but
+at
+times
+I
+did
+not
+feel
+at
+home
+in
+that
+atmosphere
+I
+always
+tried
+to
+do
+my
+best
+Dr
+The
+reason
+you
+did
+not
+feel
+at
+home
+in
+church
+was
+because
+the
+spirit
+of
+truth
+was
+not
+there
+Sp
+Look
+at
+the
+lights
+Are
+they
+not
+beautiful
+they
+are
+singing
+and
+vibrating
+into
+different
+shades
+and
+tunes
+The
+colorings
+are
+wonderful
+I
+will
+try
+to
+do
+there
+what
+I
+could
+not
+do
+here
+I
+should
+many
+times
+have
+liked
+to
+give
+the
+world
+more
+than
+good
+and
+happy
+thoughts
+I
+knew
+at
+times
+that
+life
+must
+have
+a
+greater
+purpose
+than
+is
+generally
+realized
+I
+was
+true
+to
+myself
+in
+my
+own
+heart
+Such
+beautiful
+things
+I
+can
+see
+Is
+that
+Heaven
+Dr
+Yes
+but
+not
+the
+Christian
+Heaven
+Not
+the
+Heaven
+of
+Salvation
+but
+the
+spirit
+world
+surrounding
+the
+earth
+world
+Jesus
+taught
+the
+existence
+of
+spirits
+and
+a
+spirit
+world
+and
+Paul
+says
+There
+is
+a
+natural
+body
+and
+there
+is
+a
+spiritual
+body
+first
+that
+which
+is
+natural
+and
+afterward
+that
+which
+is
+spiritual
+Sp
+Anna
+H
+says
+she
+is
+different
+now
+from
+what
+she
+was
+when
+I
+knew
+her
+She
+says
+I
+do
+not
+know
+her
+now
+She
+is
+serving
+and
+helping
+the
+unfortunate
+ones
+She
+says
+she
+wanted
+to
+do
+what
+she
+could
+to
+wake
+me
+up
+May
+I
+ask
+what
+you
+are
+doing
+here
+Dr
+This
+is
+an
+Institution
+for
+research
+and
+the
+obtaining
+of
+knowledge
+concerning
+what
+becomes
+of
+the
+dead
+This
+is
+also
+a
+Spiritual
+Clearing
+House
+This
+lady
+you
+are
+controlling
+is
+my
+wife
+she
+is
+a
+psychic
+intermediary
+and
+you
+are
+allowed
+to
+use
+her
+body
+and
+brain
+to
+convince
+you
+of
+your
+present
+condition
+You
+are
+using
+a
+body
+not
+your
+own
+Raising
+Mrs
+Wickland
+s
+hand
+This
+is
+not
+your
+hand
+Sp
+No
+it
+is
+not
+It
+is
+queer
+Dr
+The
+queer
+part
+is
+the
+human
+ignorance
+on
+these
+points
+Sp
+The
+church
+does
+not
+teach
+these
+things
+Dr
+The
+church
+limits
+itself
+to
+faith
+alone
+and
+does
+not
+desire
+to
+add
+the
+required
+knowledge
+regarding
+the
+natural
+continuation
+of
+the
+spirit
+after
+death
+The
+Bible
+says
+that
+to
+our
+faith
+we
+must
+add
+knowledge
+and
+Jesus
+taught
+Know
+the
+truth
+and
+the
+truth
+shall
+make
+you
+free
+If
+you
+had
+understood
+these
+truths
+you
+would
+have
+accepted
+the
+spirit
+friends
+who
+came
+to
+you
+when
+you
+awakened
+Sp
+It
+is
+all
+so
+beautiful
+that
+I
+should
+like
+to
+go
+with
+them
+They
+say
+that
+when
+I
+am
+stronger
+I
+shall
+finish
+my
+work
+over
+there
+How
+will
+they
+take
+care
+of
+me
+I
+am
+very
+weak
+Dr
+You
+will
+not
+be
+so
+weak
+when
+you
+leave
+this
+body
+As
+a
+man
+thinketh
+in
+his
+heart
+so
+is
+he
+You
+will
+be
+received
+with
+love
+and
+taken
+to
+a
+beautiful
+home
+You
+will
+be
+so
+overjoyed
+with
+your
+new
+condition
+that
+you
+will
+not
+have
+time
+to
+be
+weak
+Sp
+Will
+I
+not
+go
+into
+a
+sleep
+again
+Dr
+When
+you
+were
+sick
+and
+in
+great
+pain
+you
+were
+probably
+given
+opiates
+and
+they
+may
+have
+had
+a
+stupifying
+effect
+Sp
+Thank
+you
+Now
+they
+are
+calling
+me
+and
+I
+feel
+that
+I
+want
+to
+go
+I
+feel
+such
+gratitude
+to
+you
+for
+helping
+me
+and
+for
+being
+the
+means
+of
+my
+understanding
+and
+also
+for
+helping
+me
+to
+reach
+my
+friends
+so
+that
+I
+may
+know
+how
+to
+go
+to
+them
+instead
+of
+shutting
+the
+door
+against
+them
+and
+leaving
+myself
+in
+the
+dark
+I
+thank
+you
+all
+that
+I
+had
+the
+opportunity
+of
+being
+awakened
+to
+such
+a
+beautiful
+condition
+as
+I
+now
+see
+I
+was
+only
+in
+the
+darkness
+of
+my
+own
+consciousness
+They
+call
+me
+and
+keep
+on
+calling
+me
+and
+they
+all
+say
+they
+are
+glad
+to
+invite
+me
+to
+their
+home
+in
+the
+spirit
+world
+There
+is
+one
+thing
+they
+want
+me
+to
+say
+but
+I
+do
+not
+know
+whether
+I
+am
+strong
+enough
+One
+gentleman
+says
+I
+was
+King
+Edward
+in
+life
+but
+I
+am
+an
+ordinary
+person
+now
+I
+wanted
+to
+wake
+you
+up
+because
+I
+have
+been
+awakened
+from
+the
+life
+I
+led
+My
+mother
+was
+a
+Queen
+but
+she
+is
+a
+Queen
+no
+longer
+She
+has
+to
+serve
+others
+more
+than
+she
+did
+when
+she
+was
+on
+earth
+My
+mother
+knew
+of
+spirit
+phenomena
+and
+she
+also
+knew
+of
+spirit
+return
+but
+she
+did
+not
+know
+what
+her
+duty
+was
+and
+she
+was
+waited
+on
+all
+her
+life
+She
+was
+never
+allowed
+to
+do
+anything
+or
+have
+any
+real
+responsibility
+She
+serves
+here
+and
+there
+Now
+I
+have
+to
+serve
+and
+help
+until
+I
+understand
+the
+real
+life
+This
+gentleman
+says
+that
+is
+the
+message
+he
+wished
+to
+send
+He
+came
+to
+say
+this
+because
+you
+probably
+thought
+he
+was
+still
+a
+King
+He
+is
+here
+only
+as
+a
+man
+He
+wants
+to
+help
+you
+as
+the
+others
+are
+doing
+He
+is
+not
+of
+noble
+or
+royal
+blood
+any
+more
+All
+my
+friends
+have
+come
+to
+shake
+hands
+and
+they
+all
+seem
+to
+be
+one
+family
+I
+want
+to
+say
+Good
+Night
+but
+how
+will
+I
+go
+Dr
+Thought
+is
+the
+solver
+of
+Nature
+s
+problems
+Think
+of
+your
+friends
+over
+there
+and
+you
+will
+be
+with
+them
+You
+will
+have
+to
+fix
+your
+mind
+from
+here
+to
+there
+Think
+I
+am
+actually
+there
+Sp
+I
+certainly
+want
+to
+thank
+you
+for
+the
+opportunity
+of
+coming
+here
+and
+for
+awakening
+me
+so
+that
+I
+can
+be
+with
+my
+friends
+over
+there
+The
+organism
+of
+every
+human
+being
+generates
+a
+nervous
+force
+and
+magnetism
+which
+surrounds
+him
+with
+an
+atmosphere
+of
+vital
+emanations
+and
+psychic
+light
+known
+as
+the
+Magnetic
+Aura
+This
+aura
+is
+visible
+as
+a
+light
+to
+earthbound
+spirits
+in
+their
+condition
+of
+darkness
+and
+they
+may
+become
+attracted
+to
+persons
+peculiarly
+susceptible
+to
+their
+encroachment
+Such
+spirits
+are
+often
+unable
+to
+leave
+this
+psychic
+atmosphere
+and
+in
+the
+resulting
+state
+of
+confusion
+confusional
+psychosis
+although
+struggling
+for
+freedom
+they
+find
+themselves
+living
+the
+life
+of
+the
+psychic
+with
+him
+resenting
+his
+presence
+and
+bewildered
+by
+a
+sense
+of
+dual
+personality
+After
+a
+number
+of
+spirits
+had
+been
+taken
+from
+a
+patient
+who
+was
+very
+unmanageable
+at
+first
+we
+had
+the
+following
+experience
+which
+clearly
+shows
+the
+suffering
+that
+spirits
+may
+endure
+when
+enmeshed
+in
+the
+aura
+of
+a
+mortal
+EXPERIENCE
+JANUARY
+Spirit
+EMILY
+JULIA
+STEVE
+Patient
+MRS
+L
+W
+Psychic
+MRS
+WICKLAND
+Doctor
+Tell
+us
+who
+you
+are
+We
+are
+interested
+in
+all
+spirits
+who
+are
+in
+darkness
+Tell
+us
+how
+long
+you
+have
+been
+dead
+Spirit
+I
+guess
+something
+happened
+to
+me
+Dr
+Do
+you
+realize
+that
+you
+have
+passed
+out
+of
+your
+own
+body
+Sp
+I
+don
+t
+want
+my
+hands
+held
+I
+am
+a
+lady
+of
+means
+an
+expression
+often
+used
+by
+the
+patient
+and
+want
+to
+be
+shown
+the
+courtesies
+and
+respect
+due
+a
+lady
+Dr
+Did
+they
+call
+you
+Mrs
+or
+Miss
+Sp
+I
+am
+a
+lady
+of
+means
+and
+I
+am
+not
+used
+to
+this
+kind
+of
+questioning
+I
+just
+feel
+like
+giving
+you
+a
+piece
+of
+my
+mind
+Dr
+What
+seems
+to
+be
+your
+trouble
+Sp
+You
+it
+seems
+have
+such
+a
+way
+of
+giving
+me
+all
+kinds
+Of
+strange
+things
+in
+my
+back
+static
+treatment
+of
+patient
+and
+cannot
+see
+why
+you
+should
+do
+so
+You
+have
+also
+kept
+me
+in
+prison
+It
+must
+have
+been
+you
+that
+put
+me
+in
+prison
+Who
+are
+you
+anyway
+Dr
+I
+am
+a
+friend
+and
+I
+want
+to
+talk
+to
+you
+Sp
+In
+the
+first
+place
+I
+don
+t
+know
+you
+and
+in
+the
+second
+place
+I
+have
+nothing
+to
+talk
+to
+you
+about
+Who
+are
+you
+Tell
+me
+your
+name
+Dr
+I
+am
+Dr
+Wickland
+Sp
+I
+really
+didn
+t
+mean
+to
+ask
+your
+name
+for
+I
+m
+not
+at
+all
+interested
+to
+know
+it
+Dr
+Wouldn
+t
+you
+like
+to
+go
+to
+the
+spirit
+side
+of
+life
+Sp
+I
+do
+not
+like
+to
+hear
+about
+such
+things
+I
+am
+no
+spirit
+Dr
+Look
+at
+your
+hands
+do
+they
+belong
+to
+you
+Sp
+You
+are
+the
+means
+of
+my
+having
+been
+kept
+in
+prison
+so
+long
+and
+now
+you
+are
+trying
+to
+show
+me
+things
+that
+are
+not
+true
+and
+so
+I
+will
+not
+listen
+to
+you
+Dr
+How
+did
+you
+happen
+to
+come
+here
+Sp
+I
+do
+not
+know
+myself
+It
+is
+very
+curious
+I
+seemed
+to
+be
+in
+prison
+and
+before
+I
+knew
+anything
+I
+was
+here
+I
+do
+not
+see
+how
+I
+came
+There
+were
+a
+whole
+lot
+of
+us
+and
+somehow
+I
+have
+been
+left
+alone
+I
+have
+been
+in
+prison
+but
+I
+do
+not
+know
+what
+I
+have
+done
+Dr
+Where
+were
+you
+when
+you
+had
+those
+others
+with
+you
+Where
+were
+you
+staying
+Referring
+to
+obsessing
+spirits
+in
+patient
+s
+aura
+Sp
+I
+was
+staying
+where
+I
+belonged
+There
+were
+a
+lot
+of
+us
+all
+bunched
+together
+men
+and
+women
+We
+had
+a
+home
+but
+we
+could
+not
+get
+out
+of
+it
+Sometimes
+we
+were
+in
+warm
+quarters
+For
+a
+time
+I
+have
+been
+by
+myself
+and
+I
+have
+been
+in
+a
+dark
+place
+Before
+I
+was
+in
+prison
+we
+could
+talk
+one
+at
+a
+time
+control
+the
+patient
+but
+now
+I
+am
+all
+alone
+You
+have
+no
+right
+to
+put
+all
+those
+burning
+things
+on
+me
+Dr
+That
+kind
+of
+electrical
+treatment
+is
+very
+good
+for
+earthbound
+spirits
+ignorant
+ones
+Sp
+Ignorant
+How
+dare
+you
+talk
+like
+that
+to
+me
+How
+dare
+you
+Dr
+Don
+t
+you
+know
+that
+you
+have
+passed
+out
+of
+your
+mortal
+body
+You
+have
+lost
+your
+physical
+body
+Sp
+How
+do
+you
+know
+I
+have
+Dr
+Because
+the
+body
+you
+are
+talking
+through
+is
+not
+your
+own
+It
+is
+my
+wife
+s
+body
+Sp
+I
+never
+saw
+you
+before
+you
+put
+those
+sharp
+things
+in
+me
+Dr
+You
+were
+not
+using
+this
+body
+at
+that
+time
+Sp
+What
+does
+it
+all
+mean
+Dr
+It
+means
+that
+you
+have
+been
+using
+another
+person
+s
+body
+Sp
+Well
+that
+explains
+many
+things
+in
+a
+way
+Sometimes
+I
+felt
+that
+I
+did
+not
+belong
+where
+I
+was
+then
+once
+in
+a
+while
+I
+felt
+I
+was
+myself
+again
+There
+was
+one
+big
+old
+man
+a
+big
+fool
+but
+we
+had
+to
+do
+just
+as
+he
+said
+Another
+spirit
+obsessing
+patient
+previously
+removed
+I
+did
+not
+feel
+like
+doing
+as
+he
+said
+because
+I
+had
+all
+the
+money
+I
+wanted
+so
+why
+should
+I
+bother
+with
+such
+a
+rascal
+I
+felt
+I
+had
+to
+do
+what
+he
+said
+and
+yet
+I
+could
+not
+see
+why
+I
+should
+I
+was
+not
+in
+my
+own
+home
+and
+yet
+I
+had
+to
+be
+there
+and
+I
+never
+could
+understand
+why
+I
+could
+not
+get
+away
+He
+kept
+several
+of
+us
+with
+him
+Dr
+Did
+the
+electricity
+help
+you
+to
+get
+away
+Sp
+Yes
+it
+did
+but
+it
+hurt
+like
+fury
+It
+seems
+as
+if
+it
+tore
+the
+life
+out
+of
+me
+Dr
+The
+electricity
+liberated
+you
+just
+the
+same
+Sp
+We
+could
+not
+get
+away
+from
+that
+man
+We
+had
+to
+do
+as
+he
+said
+He
+ran
+and
+ran
+all
+the
+time
+the
+patient
+often
+ran
+away
+and
+we
+had
+to
+do
+the
+same
+There
+was
+a
+little
+girl
+and
+she
+cried
+all
+the
+time
+Obsessing
+spirit
+previously
+dislodged
+from
+same
+patient
+At
+times
+I
+was
+free
+and
+at
+times
+I
+was
+in
+such
+misery
+Some
+times
+I
+felt
+I
+could
+float
+from
+one
+place
+to
+another
+Dr
+At
+such
+times
+you
+were
+a
+free
+spirit
+SP
+Don
+t
+say
+that
+word
+How
+I
+do
+hate
+it
+I
+do
+not
+have
+any
+use
+for
+anything
+of
+that
+kind
+Dr
+You
+do
+not
+recognize
+the
+fact
+that
+when
+you
+pass
+out
+of
+the
+mortal
+body
+you
+do
+not
+die
+but
+that
+you
+live
+you
+then
+become
+a
+spirit
+Sp
+You
+know
+I
+am
+not
+dead
+Cannot
+you
+understand
+that
+I
+am
+talking
+to
+you
+and
+that
+I
+can
+move
+my
+hands
+and
+arms
+Dr
+My
+friend
+while
+you
+are
+talking
+we
+cannot
+see
+you
+We
+can
+only
+see
+my
+wife
+You
+are
+talking
+through
+my
+wife
+s
+body
+This
+is
+Mrs
+Wickland
+sitting
+here
+What
+is
+your
+name
+Sp
+I
+am
+Mrs
+Emily
+Julia
+Steve
+I
+was
+married
+but
+my
+husband
+died
+some
+years
+ago
+Dr
+Do
+you
+know
+that
+you
+are
+in
+California
+Sp
+I
+have
+never
+been
+there
+I
+went
+first
+to
+Chicago
+and
+from
+there
+to
+St
+Louis
+The
+patient
+had
+also
+lived
+in
+St
+Louis
+and
+had
+there
+first
+developed
+her
+aberration
+Dr
+Where
+did
+you
+live
+in
+St
+Louis
+See
+Chap
+Page
+Spirit
+John
+Sullivan
+Patient
+Mrs
+L
+W
+See
+Chap
+Page
+Spirit
+Minnie
+Day
+Patient
+Mrs
+L
+W
+Sp
+I
+was
+traveling
+I
+did
+not
+live
+there
+I
+did
+once
+live
+on
+La
+Salle
+Avenue
+Chicago
+but
+I
+was
+there
+for
+a
+little
+while
+only
+It
+was
+near
+La
+Salle
+and
+Division
+From
+there
+I
+went
+to
+St
+Louis
+and
+from
+there
+well
+I
+really
+don
+t
+know
+where
+I
+went
+I
+do
+know
+that
+my
+head
+was
+bothering
+me
+a
+great
+deal
+Patient
+complained
+similarly
+Dr
+Do
+you
+remember
+being
+sick
+Sp
+I
+cannot
+recall
+much
+of
+anything
+Suddenly
+greatly
+excited
+No
+No
+I
+think
+there
+is
+something
+the
+matter
+with
+me
+Do
+you
+think
+I
+am
+going
+crazy
+Look
+Look
+There
+is
+my
+husband
+No
+no
+He
+is
+a
+ghost
+Just
+look
+at
+him
+Dr
+We
+are
+talking
+to
+a
+ghost
+when
+we
+talk
+to
+you
+and
+we
+are
+not
+afraid
+Sp
+There
+is
+my
+child
+too
+There
+is
+my
+little
+baby
+I
+am
+losing
+my
+mind
+My
+Lily
+my
+little
+Lily
+Oh
+my
+Lily
+Hugo
+my
+husband
+I
+know
+I
+am
+losing
+my
+mind
+Why
+there
+s
+my
+mother
+I
+know
+my
+mind
+is
+giving
+way
+I
+am
+afraid
+they
+are
+all
+coming
+toward
+me
+Hugo
+my
+husband
+is
+it
+really
+you
+My
+little
+Lily
+how
+I
+do
+love
+you
+I
+am
+so
+afraid
+Dr
+Understand
+that
+you
+have
+lost
+your
+physical
+body
+and
+are
+now
+a
+spirit
+Try
+to
+realize
+this
+Sp
+Please
+explain
+why
+Hugo
+my
+mother
+and
+Lily
+are
+around
+me
+Are
+they
+not
+happy
+in
+Heaven
+Why
+don
+t
+they
+stay
+there
+Dr
+Do
+you
+know
+anything
+about
+Heaven
+Sp
+Heaven
+is
+above
+where
+Christ
+and
+God
+are
+Dr
+Jesus
+said
+The
+Kingdom
+of
+God
+is
+within
+you
+The
+Bible
+says
+Ye
+are
+the
+Temple
+of
+God
+and
+the
+Spirit
+of
+God
+dwelleth
+in
+you
+Again
+God
+is
+Love
+and
+he
+that
+dwelleth
+in
+Love
+dwelleth
+in
+God
+God
+is
+above
+God
+is
+below
+God
+is
+everywhere
+Sp
+Don
+t
+you
+believe
+in
+a
+personal
+God
+Dr
+God
+is
+Spirit
+God
+could
+not
+be
+only
+in
+one
+place
+Sp
+I
+am
+getting
+so
+tired
+that
+it
+is
+hard
+for
+me
+to
+understand
+what
+you
+say
+If
+there
+were
+only
+a
+place
+where
+I
+could
+rest
+I
+would
+gladly
+go
+I
+cannot
+describe
+to
+you
+what
+misery
+I
+have
+been
+in
+I
+have
+no
+home
+anywhere
+that
+I
+can
+go
+to
+no
+place
+to
+rest
+my
+weary
+head
+I
+went
+from
+one
+place
+to
+another
+and
+I
+could
+not
+find
+home
+or
+peace
+I
+have
+prayed
+that
+I
+might
+find
+rest
+for
+just
+a
+little
+while
+but
+somebody
+always
+comes
+and
+disturbs
+me
+There
+were
+so
+many
+around
+each
+crowding
+the
+other
+and
+I
+probably
+was
+mean
+myself
+but
+I
+could
+not
+help
+it
+I
+felt
+as
+if
+a
+wild
+beast
+had
+gotten
+hold
+of
+me
+and
+I
+fought
+everybody
+like
+a
+tiger
+and
+when
+I
+was
+through
+I
+was
+weak
+for
+days
+and
+days
+I
+suffered
+terribly
+That
+horrible
+man
+was
+always
+after
+us
+and
+that
+poor
+little
+child
+was
+crying
+all
+the
+time
+she
+was
+so
+crowded
+I
+wish
+I
+had
+a
+little
+home
+of
+my
+own
+where
+I
+could
+go
+and
+not
+have
+that
+man
+around
+me
+again
+He
+was
+terrible
+you
+have
+no
+idea
+He
+was
+such
+a
+rascal
+but
+he
+went
+away
+and
+we
+have
+not
+seen
+him
+for
+quite
+a
+while
+The
+little
+girl
+who
+cried
+so
+much
+has
+also
+gone
+She
+always
+had
+trouble
+with
+her
+head
+I
+did
+not
+mean
+to
+be
+a
+bad
+woman
+but
+that
+man
+tormented
+us
+all
+so
+much
+that
+we
+did
+not
+know
+what
+to
+do
+Dr
+Wouldn
+t
+you
+like
+to
+go
+with
+your
+husband
+and
+mother
+and
+little
+girl
+and
+have
+them
+all
+take
+care
+of
+you
+so
+that
+you
+can
+rest
+Try
+to
+realize
+that
+you
+have
+lost
+your
+physical
+body
+Sp
+When
+did
+I
+lose
+my
+body
+Dr
+We
+cannot
+tell
+you
+that
+Sp
+Sometimes
+I
+have
+felt
+I
+was
+a
+big
+woman
+and
+I
+could
+fight
+everybody
+and
+then
+I
+would
+seem
+smaller
+and
+it
+was
+very
+confusing
+Dr
+That
+may
+have
+been
+caused
+by
+your
+influencing
+different
+people
+You
+can
+be
+free
+from
+that
+condition
+Sp
+Then
+will
+I
+have
+a
+rest
+Will
+I
+wake
+up
+and
+find
+that
+I
+have
+only
+had
+a
+dream
+and
+then
+have
+that
+horrible
+man
+and
+that
+crying
+child
+around
+me
+I
+do
+not
+want
+to
+ever
+see
+that
+man
+again
+He
+used
+to
+fight
+those
+women
+as
+if
+he
+were
+a
+demon
+and
+he
+was
+so
+angry
+and
+he
+treated
+the
+little
+girl
+very
+badly
+She
+was
+afraid
+of
+him
+Dr
+Now
+try
+to
+forget
+what
+has
+happened
+and
+live
+for
+the
+future
+Go
+with
+your
+husband
+and
+he
+will
+explain
+the
+beauties
+of
+the
+spirit
+world
+to
+you
+Sp
+My
+husband
+Hugo
+I
+love
+him
+so
+dearly
+and
+after
+he
+died
+life
+was
+not
+worth
+living
+to
+me
+My
+dear
+child
+went
+to
+him
+just
+a
+month
+afterward
+She
+was
+a
+child
+three
+years
+of
+age
+Hugo
+my
+husband
+was
+my
+life
+I
+did
+not
+care
+what
+became
+of
+me
+after
+he
+left
+When
+my
+husband
+lived
+we
+traveled
+a
+great
+deal
+We
+went
+everywhere
+We
+went
+to
+Alaska
+and
+there
+he
+took
+cold
+and
+had
+pneumonia
+and
+my
+little
+child
+got
+very
+sick
+It
+is
+hard
+to
+live
+all
+that
+over
+again
+Dr
+Why
+go
+all
+over
+that
+again
+when
+your
+people
+are
+here
+to
+take
+you
+away
+with
+them
+Sp
+I
+want
+to
+go
+with
+them
+but
+I
+am
+afraid
+because
+they
+are
+dead
+Hugo
+says
+he
+has
+been
+looking
+for
+me
+for
+years
+and
+years
+but
+he
+could
+not
+find
+me
+and
+I
+cannot
+tell
+him
+where
+I
+have
+been
+When
+Hugo
+and
+Lily
+died
+I
+took
+very
+sick
+and
+the
+doctors
+said
+I
+was
+a
+nervous
+wreck
+I
+grew
+very
+much
+worse
+and
+I
+remember
+them
+taking
+me
+to
+a
+place
+called
+Elgin
+probably
+an
+asylum
+I
+have
+just
+a
+faint
+recollection
+of
+that
+When
+I
+grew
+better
+evidently
+died
+I
+went
+to
+St
+Louis
+because
+I
+had
+a
+sister
+there
+Since
+I
+began
+to
+talk
+I
+feel
+different
+and
+now
+I
+want
+to
+go
+with
+all
+my
+people
+Just
+look
+at
+that
+beautiful
+bed
+Now
+I
+can
+rest
+and
+with
+Hugo
+I
+shall
+not
+have
+worries
+any
+more
+God
+bless
+you
+all
+and
+help
+you
+Hugo
+says
+to
+tell
+you
+he
+is
+so
+pleased
+he
+found
+me
+at
+last
+and
+to
+say
+we
+shall
+be
+reunited
+and
+never
+part
+again
+God
+bless
+you
+each
+and
+all
+CHAPTER
+V
+Tormenting
+Spirits
+Marriage
+Disturbances
+OBSESSING
+SPIRITS
+may
+purposely
+torment
+helpless
+sensitives
+sometimes
+for
+revenge
+but
+more
+often
+with
+a
+desire
+to
+punish
+the
+latter
+who
+they
+declare
+are
+interfering
+with
+them
+These
+tormenting
+spirits
+frequently
+cause
+their
+victims
+to
+commit
+deeds
+of
+violence
+upon
+themselves
+and
+do
+not
+seem
+to
+suffer
+from
+pain
+which
+they
+inflict
+upon
+the
+physical
+body
+of
+the
+sensitive
+yet
+contradictory
+as
+it
+may
+seem
+many
+labor
+under
+the
+delusion
+that
+the
+body
+of
+the
+mortal
+is
+their
+own
+After
+the
+death
+of
+her
+husband
+Mrs
+L
+W
+developed
+a
+melancholia
+which
+was
+followed
+by
+hallucinations
+of
+hearing
+and
+constantly
+tormented
+by
+hearing
+the
+voices
+of
+spirits
+she
+often
+dashed
+madly
+out
+of
+the
+house
+screaming
+and
+pulling
+out
+her
+hair
+At
+such
+times
+her
+daughter
+who
+was
+clairvoyant
+saw
+spirits
+about
+her
+mother
+particularly
+the
+spirit
+of
+a
+jeering
+man
+and
+the
+patient
+herself
+often
+saw
+this
+man
+saying
+There
+comes
+that
+terrible
+man
+again
+The
+patient
+was
+brought
+from
+St
+Louis
+to
+Los
+Angeles
+in
+the
+belief
+that
+a
+change
+of
+scene
+and
+climate
+would
+be
+beneficial
+but
+the
+violent
+attacks
+increased
+in
+these
+seizures
+she
+bit
+her
+hands
+and
+arms
+beat
+her
+face
+with
+a
+slipper
+and
+tore
+off
+her
+clothes
+She
+finally
+became
+uncontrollable
+and
+was
+taken
+to
+the
+Psychopathic
+Ward
+declared
+insane
+and
+committed
+to
+a
+sanitarium
+where
+she
+remained
+for
+a
+year
+without
+any
+improvement
+After
+escaping
+three
+times
+she
+was
+placed
+in
+our
+care
+and
+within
+a
+few
+months
+the
+tormenting
+spirits
+were
+taken
+away
+the
+lady
+became
+entirely
+normal
+has
+since
+remained
+well
+and
+is
+assisting
+her
+daughter
+with
+her
+household
+occupations
+A
+few
+days
+after
+her
+arrival
+at
+our
+Institute
+the
+spirit
+of
+the
+jeering
+man
+so
+often
+seen
+by
+the
+patient
+s
+daughter
+was
+removed
+and
+allowed
+to
+control
+Mrs
+Wickland
+See
+Chap
+Page
+Spirit
+Minnie
+Day
+Patient
+Mrs
+L
+W
+Chap
+Page
+Spirit
+Emily
+Steve
+Patient
+Mrs
+L
+W
+EXPERIENCE
+JANUARY
+Spirit
+JOHN
+SULLIVAN
+Patient
+MRS
+L
+W
+Psychic
+MRS
+WICKLAND
+The
+spirit
+struggled
+furiously
+for
+a
+time
+and
+restraint
+was
+required
+Spirit
+What
+in
+the
+world
+are
+you
+holding
+me
+for
+I
+have
+nothing
+whatever
+to
+do
+with
+you
+folks
+I
+don
+t
+like
+any
+of
+you
+I
+don
+t
+see
+what
+right
+you
+have
+to
+hold
+me
+I
+never
+did
+you
+any
+harm
+and
+I
+ll
+make
+it
+pretty
+hot
+for
+you
+before
+I
+get
+through
+Doctor
+You
+came
+to
+us
+as
+a
+stranger
+and
+at
+once
+started
+fighting
+What
+else
+could
+I
+do
+but
+hold
+you
+in
+restraint
+Sp
+I
+don
+t
+want
+to
+be
+held
+down
+like
+this
+Dr
+Who
+are
+you
+Sp
+Why
+should
+I
+tell
+you
+who
+I
+am
+I
+don
+t
+know
+any
+of
+you
+and
+I
+don
+t
+care
+who
+you
+are
+Just
+leave
+me
+alone
+so
+that
+can
+go
+Dr
+Tell
+us
+who
+you
+are
+friend
+You
+seem
+to
+be
+a
+pretty
+strong
+girl
+Sp
+If
+you
+take
+me
+for
+a
+girl
+you
+had
+better
+look
+again
+Dr
+Tell
+us
+where
+you
+came
+from
+and
+what
+you
+want
+Sp
+What
+do
+you
+want
+to
+know
+for
+Dr
+Perhaps
+we
+can
+help
+you
+out
+of
+your
+present
+condition
+Sp
+Don
+t
+hold
+me
+so
+tight
+then
+I
+will
+talk
+Dr
+Tell
+us
+all
+about
+yourself
+Sp
+In
+the
+first
+place
+I
+don
+t
+want
+those
+needles
+referring
+to
+electrical
+treatment
+given
+patient
+put
+on
+me
+Then
+I
+have
+been
+kept
+a
+prisoner
+for
+a
+while
+Now
+I
+m
+out
+I
+feel
+just
+like
+fighting
+Freed
+from
+aura
+of
+patient
+and
+the
+restraint
+placed
+upon
+him
+by
+intelligent
+spirits
+What
+in
+the
+world
+did
+you
+put
+all
+those
+needles
+on
+me
+for
+If
+I
+can
+go
+away
+from
+here
+I
+will
+go
+back
+home
+Dr
+Where
+is
+your
+home
+Sp
+My
+home
+is
+where
+I
+came
+from
+Dr
+I
+am
+curious
+to
+know
+how
+you
+got
+those
+needles
+on
+your
+back
+Sp
+It
+was
+just
+like
+I
+was
+on
+fire
+every
+time
+I
+had
+them
+I
+don
+t
+want
+to
+sit
+here
+and
+be
+held
+down
+and
+I
+m
+going
+Dr
+How
+did
+you
+happen
+to
+have
+the
+benefit
+of
+such
+needles
+I
+am
+very
+curious
+to
+know
+Sp
+I
+don
+t
+know
+myself
+but
+I
+got
+them
+Dr
+How
+did
+you
+happen
+to
+come
+here
+Sp
+I
+don
+t
+know
+Dr
+Did
+you
+come
+here
+with
+somebody
+you
+were
+attached
+to
+Sp
+I
+was
+only
+attached
+to
+myself
+Dr
+Where
+have
+you
+been
+recently
+Sp
+I
+have
+been
+in
+darkness
+I
+got
+away
+from
+my
+home
+then
+I
+could
+not
+see
+anything
+It
+seemed
+as
+if
+I
+was
+blind
+Dr
+Were
+you
+not
+in
+a
+strange
+condition
+when
+you
+were
+in
+that
+place
+you
+call
+home
+Sp
+It
+wasn
+t
+my
+real
+home
+but
+it
+was
+just
+like
+it
+Dr
+Did
+you
+become
+disgusted
+sometimes
+and
+then
+act
+queerly
+Sp
+Sometimes
+I
+did
+not
+know
+where
+I
+was
+and
+then
+I
+acted
+up
+all
+the
+time
+Once
+in
+a
+while
+we
+had
+a
+big
+fight
+There
+were
+several
+people
+around
+but
+I
+will
+get
+them
+some
+day
+Dr
+Who
+were
+they
+Sp
+Why
+I
+don
+t
+know
+all
+kinds
+of
+people
+Dr
+Were
+there
+any
+women
+Sp
+There
+were
+so
+many
+you
+could
+not
+rest
+Women
+Some
+day
+I
+am
+going
+to
+get
+hold
+of
+the
+rest
+of
+them
+and
+shake
+them
+up
+Dr
+I
+don
+t
+see
+why
+you
+should
+want
+to
+harm
+others
+Sp
+One
+woman
+would
+come
+at
+me
+one
+way
+and
+one
+another
+and
+it
+made
+me
+mad
+but
+what
+can
+a
+fellow
+do
+when
+he
+has
+a
+whole
+lot
+of
+women
+around
+Other
+obsessing
+spirits
+in
+patient
+s
+aura
+Dr
+Where
+do
+you
+think
+you
+are
+now
+Sp
+Where
+I
+don
+t
+care
+where
+I
+am
+Dr
+Where
+have
+you
+been
+living
+Sp
+We
+have
+been
+living
+at
+different
+places
+We
+have
+been
+from
+one
+place
+to
+another
+until
+I
+am
+plumb
+disgusted
+with
+everything
+I
+feel
+like
+running
+away
+so
+nobody
+can
+find
+me
+Dr
+You
+could
+not
+get
+away
+from
+yourself
+Sp
+I
+have
+had
+nothing
+but
+women
+around
+me
+women
+women
+until
+I
+am
+sick
+and
+tired
+of
+women
+I
+got
+one
+woman
+down
+and
+I
+bit
+and
+kicked
+and
+still
+she
+clung
+to
+me
+The
+patient
+Mrs
+L
+W
+She
+has
+no
+business
+to
+hang
+around
+me
+like
+she
+does
+Some
+day
+I
+shall
+kill
+her
+Dr
+Do
+you
+know
+what
+you
+have
+been
+doing
+Sp
+I
+don
+t
+care
+what
+I
+have
+been
+doing
+I
+took
+a
+chunk
+out
+of
+her
+wrist
+one
+day
+but
+she
+clung
+to
+me
+just
+the
+same
+Then
+I
+pulled
+her
+hair
+out
+as
+much
+as
+I
+could
+but
+still
+she
+clung
+I
+couldn
+t
+get
+rid
+of
+her
+Dr
+Friend
+wouldn
+t
+you
+like
+to
+know
+what
+you
+have
+been
+doing
+Sp
+I
+don
+t
+care
+to
+know
+but
+it
+makes
+me
+so
+mad
+because
+since
+I
+got
+those
+needles
+in
+me
+I
+don
+t
+seem
+to
+have
+any
+power
+Dr
+Where
+is
+the
+woman
+now
+Sp
+I
+haven
+t
+seen
+her
+for
+a
+while
+Dr
+What
+harm
+did
+she
+ever
+do
+you
+Sp
+She
+has
+no
+business
+to
+hang
+on
+to
+me
+like
+she
+does
+Dr
+Suppose
+we
+reverse
+matters
+and
+say
+that
+it
+is
+you
+who
+have
+been
+hanging
+on
+to
+her
+Sp
+She
+has
+no
+business
+to
+dress
+me
+up
+in
+woman
+s
+clothes
+and
+put
+woman
+s
+hair
+on
+my
+head
+Dr
+How
+long
+have
+you
+been
+dead
+Sp
+Dead
+I
+ll
+show
+you
+that
+I
+m
+not
+dead
+and
+I
+will
+also
+show
+you
+that
+you
+are
+not
+strong
+enough
+to
+hold
+me
+either
+Talk
+about
+me
+being
+dead
+Laughing
+harshly
+Dr
+Do
+you
+not
+realize
+that
+you
+have
+been
+in
+a
+strange
+condition
+for
+some
+time
+Sp
+It
+s
+the
+worst
+I
+have
+ever
+been
+in
+Keep
+your
+hands
+off
+me
+for
+they
+are
+like
+fire
+they
+are
+so
+hot
+Dr
+Has
+it
+ever
+occurred
+to
+you
+to
+ask
+how
+that
+woman
+could
+dress
+you
+up
+Don
+t
+you
+think
+you
+have
+been
+very
+selfish
+Sp
+Selfish
+Selfish
+She
+s
+the
+selfish
+one
+Dr
+Suppose
+you
+were
+an
+ignorant
+spirit
+hovering
+around
+the
+woman
+Sp
+Me
+hang
+around
+a
+woman
+Not
+me
+no
+sir
+Dr
+Such
+things
+happen
+just
+the
+same
+Did
+you
+ever
+read
+your
+Bible
+Do
+you
+remember
+how
+they
+cast
+out
+spirits
+in
+olden
+times
+You
+are
+also
+a
+spirit
+such
+as
+they
+had
+to
+deal
+with
+Sp
+There
+were
+devils
+and
+I
+ll
+show
+you
+I
+m
+no
+devil
+Dr
+You
+have
+been
+tormenting
+a
+woman
+and
+I
+chased
+you
+out
+with
+electricity
+Sp
+Well
+now
+I
+ve
+caught
+you
+Attempting
+to
+fight
+I
+ll
+bet
+you
+are
+the
+one
+who
+put
+me
+in
+the
+dungeon
+Now
+I
+will
+get
+that
+woman
+and
+bite
+her
+to
+pieces
+That
+woman
+hung
+on
+me
+all
+the
+time
+and
+I
+want
+to
+get
+rid
+of
+her
+Dr
+You
+were
+hanging
+on
+to
+her
+She
+is
+rid
+of
+you
+now
+Try
+to
+understand
+that
+you
+are
+a
+spirit
+and
+come
+to
+your
+senses
+I
+am
+telling
+you
+the
+absolute
+truth
+Sp
+I
+wish
+I
+could
+get
+hold
+of
+that
+woman
+I
+will
+smash
+her
+up
+good
+and
+I
+will
+smash
+her
+face
+again
+Dr
+Why
+should
+you
+want
+to
+do
+harm
+to
+the
+woman
+She
+is
+not
+bothering
+you
+Sp
+I
+would
+like
+to
+get
+after
+you
+too
+Dr
+If
+you
+don
+t
+behave
+yourself
+you
+will
+get
+more
+of
+the
+electricity
+Sp
+I
+would
+rather
+stay
+here
+but
+you
+hold
+me
+too
+tight
+Dr
+You
+tell
+us
+you
+are
+a
+man
+but
+we
+can
+t
+see
+you
+We
+can
+only
+see
+a
+woman
+Sp
+Haven
+t
+you
+got
+any
+eyes
+Don
+t
+you
+know
+I
+am
+a
+man
+Dr
+You
+have
+woman
+s
+clothes
+on
+Sp
+I
+tore
+them
+off
+but
+she
+put
+them
+on
+and
+I
+tore
+them
+off
+Dr
+You
+have
+lost
+the
+woman
+that
+you
+say
+has
+been
+bothering
+you
+and
+are
+now
+controlling
+another
+woman
+Sp
+What
+do
+you
+mean
+by
+that
+Dr
+You
+are
+an
+ignorant
+earthbound
+spirit
+hovering
+around
+the
+earth
+plane
+bothering
+a
+woman
+You
+are
+now
+using
+my
+wife
+s
+body
+Sp
+I
+m
+not
+using
+anybody
+s
+body
+but
+my
+own
+Why
+did
+that
+woman
+hang
+on
+to
+me
+Dr
+You
+were
+doing
+the
+hanging
+on
+Since
+you
+have
+been
+taken
+away
+from
+her
+the
+woman
+is
+getting
+along
+nicely
+Sp
+Did
+you
+put
+me
+in
+that
+dungeon
+Dr
+No
+intelligent
+spirits
+put
+you
+there
+You
+are
+very
+selfish
+selfish
+to
+the
+last
+degree
+Don
+t
+you
+think
+you
+should
+try
+to
+realize
+your
+condition
+If
+your
+record
+were
+written
+would
+you
+care
+to
+have
+everybody
+read
+it
+Sp
+I
+don
+t
+care
+I
+get
+so
+mad
+to
+think
+I
+should
+have
+a
+woman
+hanging
+on
+to
+me
+and
+then
+have
+her
+dress
+me
+in
+woman
+s
+clothes
+I
+hate
+women
+Dr
+That
+lady
+has
+been
+brought
+here
+because
+she
+has
+been
+bothered
+by
+foolish
+spirits
+We
+realized
+that
+it
+was
+obsession
+and
+we
+drove
+you
+away
+with
+electrical
+treatments
+We
+are
+now
+trying
+to
+bring
+you
+to
+your
+senses
+Sp
+If
+I
+could
+just
+get
+hold
+of
+that
+woman
+I
+would
+bite
+her
+to
+pieces
+I
+will
+bite
+her
+arms
+too
+Dr
+Try
+to
+be
+sensible
+then
+you
+will
+have
+understanding
+and
+be
+able
+to
+progress
+and
+be
+happy
+Sp
+There
+is
+no
+happiness
+Dr
+Have
+you
+ever
+tried
+to
+understand
+God
+or
+the
+real
+question
+of
+life
+Sp
+There
+is
+no
+God
+or
+there
+would
+be
+no
+misery
+Dr
+If
+there
+is
+no
+Supreme
+Being
+how
+do
+you
+happen
+to
+be
+How
+do
+you
+exist
+Can
+you
+explain
+how
+it
+is
+possible
+for
+you
+to
+talk
+to
+us
+through
+my
+wife
+s
+body
+Sp
+Is
+it
+your
+wife
+that
+is
+hanging
+on
+to
+me
+all
+the
+time
+Dr
+You
+were
+bothering
+a
+lady
+who
+came
+here
+for
+help
+I
+chased
+you
+away
+from
+her
+then
+intelligent
+spirits
+put
+you
+in
+a
+dungeon
+Now
+you
+are
+using
+my
+wife
+s
+body
+for
+a
+time
+SP
+Why
+in
+the
+world
+should
+I
+be
+bothering
+women
+when
+I
+hate
+them
+I
+will
+smash
+every
+one
+I
+can
+Dr
+Friend
+if
+you
+ever
+expect
+to
+be
+happy
+you
+will
+have
+to
+change
+your
+attitude
+You
+have
+lost
+your
+own
+body
+and
+are
+hovering
+around
+the
+earth
+plane
+obsessing
+people
+Selfish
+spirits
+always
+do
+that
+The
+insane
+asylums
+are
+full
+of
+obsessed
+people
+You
+have
+tormented
+this
+woman
+for
+three
+or
+four
+years
+Sp
+How
+in
+the
+devil
+could
+I
+get
+hold
+of
+that
+woman
+I
+hate
+women
+and
+why
+in
+the
+world
+should
+I
+have
+a
+woman
+hanging
+on
+to
+me
+all
+the
+time
+I
+wouldn
+t
+hang
+on
+to
+a
+woman
+for
+love
+or
+money
+for
+I
+hate
+women
+I
+would
+like
+to
+crush
+every
+woman
+they
+are
+all
+deceitful
+creatures
+God
+never
+made
+such
+a
+thing
+as
+a
+woman
+They
+are
+the
+most
+selfish
+creatures
+in
+the
+world
+If
+you
+treat
+them
+to
+all
+kinds
+of
+nice
+things
+they
+are
+all
+right
+but
+when
+you
+turn
+your
+back
+they
+stab
+you
+They
+get
+all
+the
+money
+they
+can
+out
+of
+you
+I
+swore
+revenge
+on
+all
+women
+and
+I
+will
+have
+that
+revenge
+I
+could
+have
+had
+a
+good
+home
+once
+if
+it
+hadn
+t
+been
+for
+a
+woman
+Revenge
+is
+sweet
+and
+I
+will
+have
+it
+Dr
+Now
+the
+time
+has
+come
+when
+you
+must
+stop
+and
+consider
+the
+question
+of
+life
+more
+seriously
+Don
+t
+you
+think
+you
+have
+made
+many
+mistakes
+yourself
+Examine
+your
+past
+life
+and
+see
+whether
+you
+have
+been
+perfect
+Sp
+No
+one
+is
+perfect
+Dr
+Don
+t
+you
+think
+that
+perhaps
+you
+had
+many
+faults
+Sp
+No
+man
+is
+perfect
+but
+I
+am
+as
+good
+as
+the
+average
+man
+Dr
+Try
+to
+understand
+the
+mystery
+of
+life
+You
+have
+probably
+been
+dead
+many
+years
+Intelligent
+spirits
+are
+here
+now
+to
+help
+you
+and
+they
+will
+teach
+you
+many
+wonderful
+things
+You
+have
+been
+allowed
+to
+come
+here
+and
+use
+my
+wife
+s
+brain
+and
+body
+that
+we
+might
+try
+to
+help
+you
+Sp
+She
+s
+a
+fool
+to
+allow
+it
+Dr
+She
+allows
+it
+because
+she
+has
+charity
+for
+such
+as
+you
+All
+women
+are
+not
+false
+Sp
+My
+mother
+was
+a
+very
+good
+woman
+If
+it
+was
+not
+for
+her
+I
+would
+kill
+every
+woman
+I
+come
+in
+contact
+with
+But
+she
+has
+been
+dead
+forty
+or
+fifty
+years
+Dr
+You
+are
+dead
+too
+as
+far
+as
+the
+body
+is
+concerned
+You
+are
+a
+spirit
+now
+Look
+around
+and
+tell
+us
+what
+you
+see
+be
+honest
+now
+Sp
+I
+see
+my
+mother
+but
+I
+m
+afraid
+of
+her
+Dr
+We
+are
+not
+afraid
+of
+you
+Sp
+Well
+my
+mothers
+a
+ghost
+Dr
+She
+s
+a
+spirit
+like
+yourself
+What
+does
+your
+mother
+say
+to
+you
+Sp
+She
+says
+John
+I
+have
+been
+hunting
+for
+you
+for
+years
+But
+I
+am
+afraid
+of
+her
+Dr
+Does
+she
+appear
+ghostly
+Sp
+No
+but
+I
+am
+afraid
+Why
+here
+s
+my
+father
+too
+And
+there
+s
+Lizzie
+Don
+t
+you
+come
+near
+me
+I
+don
+t
+want
+you
+either
+Don
+t
+you
+come
+near
+me
+I
+don
+t
+want
+you
+Lizzie
+you
+snake
+Dr
+Probably
+she
+has
+come
+to
+ask
+you
+to
+forgive
+her
+for
+something
+she
+did
+Sp
+I
+will
+never
+never
+forgive
+her
+Dr
+Sometimes
+mistakes
+happen
+There
+may
+have
+been
+a
+misunderstanding
+You
+may
+have
+taken
+for
+granted
+things
+that
+were
+not
+true
+Sp
+I
+hate
+her
+and
+I
+don
+t
+want
+her
+near
+me
+Dr
+Try
+to
+put
+hatred
+out
+of
+your
+heart
+and
+be
+sensible
+Sp
+Lizzie
+you
+go
+away
+or
+I
+will
+kill
+you
+You
+acted
+like
+a
+snake
+I
+don
+t
+want
+to
+listen
+to
+you
+You
+are
+as
+false
+as
+they
+make
+them
+I
+don
+t
+believe
+what
+you
+say
+Don
+t
+you
+come
+here
+with
+all
+kinds
+of
+excuses
+for
+I
+don
+t
+believe
+you
+I
+am
+mad
+at
+you
+and
+I
+will
+stay
+mad
+You
+are
+a
+big
+liar
+Dr
+What
+does
+the
+spirit
+say
+to
+you
+Who
+is
+she
+Sp
+That
+s
+Lizzie
+who
+made
+all
+my
+trouble
+and
+she
+says
+all
+the
+trouble
+was
+caused
+by
+jealousy
+But
+I
+was
+not
+jealous
+Dr
+Listen
+to
+what
+she
+has
+to
+say
+Sp
+Listening
+That
+s
+a
+fine
+story
+We
+were
+going
+to
+be
+married
+and
+she
+was
+a
+nice
+girl
+She
+says
+I
+looked
+at
+everything
+the
+wrong
+way
+and
+that
+I
+was
+jealous
+Dr
+You
+were
+probably
+stubborn
+and
+hot
+headed
+Sp
+To
+Lizzie
+You
+re
+a
+liar
+You
+went
+with
+that
+other
+fellow
+you
+know
+you
+did
+She
+says
+that
+when
+she
+went
+home
+that
+evening
+she
+happened
+to
+meet
+that
+fellow
+on
+the
+street
+car
+He
+only
+walked
+a
+block
+with
+her
+and
+I
+happened
+to
+see
+them
+walking
+together
+I
+went
+home
+and
+stabbed
+myself
+Dr
+That
+was
+certainly
+a
+brave
+act
+I
+suppose
+you
+committed
+suicide
+Sp
+I
+wish
+I
+could
+have
+died
+but
+I
+could
+not
+I
+would
+have
+been
+far
+better
+off
+but
+I
+m
+going
+to
+have
+revenge
+on
+women
+Dr
+Why
+don
+t
+you
+try
+to
+be
+sensible
+and
+forgive
+the
+girl
+Sp
+Say
+do
+you
+believe
+her
+story
+I
+suffered
+a
+great
+deal
+from
+that
+stab
+I
+gave
+myself
+and
+I
+did
+wish
+I
+could
+die
+There
+s
+Lizzie
+walking
+around
+and
+she
+s
+crying
+Dr
+Listen
+to
+your
+own
+conscience
+Sp
+I
+loved
+that
+girl
+and
+what
+did
+I
+get
+from
+her
+Dr
+I
+think
+your
+mother
+spoiled
+you
+when
+you
+were
+a
+boy
+Sp
+My
+mother
+thought
+the
+world
+of
+me
+and
+gave
+me
+every
+thing
+I
+wanted
+so
+that
+I
+could
+have
+a
+good
+time
+No
+Mother
+don
+t
+come
+near
+me
+There
+is
+no
+help
+for
+me
+Dr
+The
+first
+lesson
+you
+must
+learn
+is
+to
+crucify
+self
+Jesus
+said
+Except
+ye
+become
+as
+little
+children
+ye
+shall
+not
+enter
+into
+the
+kingdom
+of
+Heaven
+I
+don
+t
+think
+you
+understand
+what
+that
+means
+All
+you
+cared
+for
+was
+self
+and
+your
+mother
+spoiled
+you
+Sp
+Mother
+says
+she
+is
+very
+sorry
+now
+Here
+s
+Lizzie
+again
+I
+don
+t
+believe
+her
+because
+she
+did
+go
+with
+that
+fellow
+Dr
+Suppose
+she
+did
+what
+of
+it
+You
+must
+have
+had
+a
+very
+jealous
+disposition
+Sp
+She
+says
+she
+did
+not
+go
+with
+him
+and
+that
+she
+has
+told
+me
+what
+she
+did
+Dr
+Do
+you
+know
+that
+she
+is
+dead
+Sp
+She
+is
+not
+If
+she
+Is
+is
+she
+a
+ghost
+Dr
+You
+say
+she
+stands
+there
+Does
+she
+look
+like
+a
+ghost
+Sp
+No
+she
+doesn
+t
+My
+mother
+says
+John
+be
+reasonable
+and
+sensible
+Your
+own
+conscience
+accuses
+you
+It
+is
+hard
+when
+you
+love
+a
+girl
+to
+see
+her
+with
+another
+fellow
+What
+I
+suffered
+on
+account
+of
+Lizzie
+After
+seeing
+her
+with
+the
+other
+fellow
+I
+went
+home
+and
+stabbed
+myself
+just
+a
+little
+bit
+to
+try
+and
+scare
+her
+I
+thought
+if
+I
+did
+that
+she
+would
+come
+to
+me
+Dr
+You
+committed
+suicide
+but
+you
+do
+not
+realize
+that
+you
+are
+a
+spirit
+and
+have
+been
+troubling
+a
+lady
+and
+obsessing
+her
+She
+is
+a
+patient
+of
+ours
+Sp
+What
+do
+I
+care
+for
+her
+I
+hate
+women
+and
+she
+won
+t
+leave
+me
+alone
+All
+I
+wanted
+was
+revenge
+and
+I
+got
+it
+Dr
+That
+lady
+has
+done
+all
+kinds
+of
+wild
+things
+because
+you
+were
+obsessing
+her
+Sp
+Mother
+and
+Lizzie
+both
+stand
+there
+crying
+but
+nobody
+cares
+for
+me
+so
+what
+s
+the
+use
+Dr
+What
+name
+did
+you
+have
+beside
+John
+Sp
+John
+Sullivan
+Dr
+I
+should
+think
+you
+would
+feel
+ashamed
+to
+have
+bothered
+that
+lady
+Sp
+I
+m
+not
+any
+more
+ashamed
+of
+myself
+than
+you
+are
+Dr
+Do
+you
+think
+you
+loved
+this
+girl
+Or
+was
+it
+only
+selfishness
+on
+your
+part
+You
+simply
+wanted
+her
+that
+s
+all
+Sp
+She
+could
+have
+been
+mine
+but
+I
+made
+her
+suffer
+My
+love
+turned
+to
+hate
+No
+Lizzie
+you
+don
+t
+need
+to
+cry
+I
+shall
+never
+forgive
+you
+if
+you
+ask
+me
+a
+hundred
+times
+Dr
+If
+your
+mother
+had
+given
+you
+a
+few
+thrashings
+you
+would
+not
+be
+in
+the
+condition
+you
+are
+now
+Try
+to
+forgive
+Lizzie
+and
+by
+doing
+so
+you
+will
+be
+helped
+yourself
+Sp
+I
+shall
+never
+forgive
+her
+The
+women
+were
+all
+crazy
+after
+me
+I
+was
+considered
+a
+good
+looking
+man
+Dr
+That
+was
+your
+trouble
+If
+you
+had
+been
+homely
+you
+would
+have
+had
+some
+sense
+You
+must
+try
+to
+be
+sensible
+now
+because
+you
+are
+using
+my
+wife
+s
+body
+Sp
+Well
+take
+your
+wife
+I
+don
+t
+want
+her
+Say
+Mother
+it
+s
+no
+use
+you
+and
+Lizzie
+standing
+there
+and
+crying
+for
+I
+shall
+never
+forgive
+her
+Dr
+If
+you
+don
+t
+forgive
+when
+you
+have
+this
+opportunity
+you
+will
+find
+yourself
+in
+a
+dark
+dungeon
+when
+you
+leave
+here
+and
+there
+you
+will
+stay
+until
+you
+repent
+Try
+to
+understand
+that
+the
+wrong
+is
+within
+yourself
+Sp
+I
+ll
+not
+forgive
+I
+loved
+my
+mother
+and
+I
+always
+had
+plenty
+of
+money
+Dr
+What
+city
+did
+you
+live
+in
+Sp
+St
+Louis
+Dr
+Do
+you
+know
+you
+are
+in
+California
+Sp
+I
+know
+where
+I
+am
+I
+am
+in
+St
+Louis
+and
+it
+s
+winter
+It
+s
+about
+nineteen
+degrees
+below
+zero
+Dr
+What
+year
+do
+you
+think
+it
+is
+SP
+Dr
+It
+is
+the
+of
+January
+Sp
+I
+do
+hate
+to
+see
+women
+cry
+Mother
+stop
+crying
+To
+see
+a
+woman
+cry
+always
+distresses
+me
+Dr
+Doesn
+t
+your
+conscience
+trouble
+you
+at
+all
+Sp
+What
+s
+the
+use
+of
+worrying
+about
+things
+Dr
+Listen
+to
+what
+your
+mother
+says
+then
+she
+can
+help
+you
+Sp
+Mother
+I
+ll
+tell
+you
+if
+you
+had
+spanked
+me
+more
+when
+I
+was
+a
+little
+boy
+and
+not
+given
+in
+to
+me
+so
+much
+I
+might
+have
+been
+a
+different
+fellow
+from
+what
+I
+am
+now
+It
+is
+too
+late
+in
+life
+to
+change
+and
+what
+s
+more
+one
+never
+gets
+anywhere
+by
+changing
+Dr
+You
+still
+have
+more
+misery
+ahead
+of
+you
+unless
+you
+are
+willing
+to
+forgive
+Sp
+I
+don
+t
+care
+to
+be
+in
+that
+dungeon
+you
+speak
+of
+Why
+do
+parents
+give
+their
+children
+all
+they
+want
+You
+see
+Mother
+what
+nice
+work
+you
+have
+done
+Aren
+t
+you
+proud
+of
+your
+son
+You
+brought
+me
+to
+this
+This
+is
+your
+work
+Dr
+You
+pretend
+to
+love
+your
+mother
+but
+you
+have
+no
+charity
+or
+sympathy
+for
+anybody
+Sp
+I
+hate
+the
+word
+sympathy
+My
+father
+says
+I
+shall
+have
+to
+change
+I
+am
+too
+old
+to
+change
+now
+Frightened
+and
+shrinking
+from
+something
+Take
+that
+away
+Take
+me
+away
+I
+m
+sick
+Dr
+You
+must
+be
+serious
+and
+honest
+Sp
+My
+mother
+says
+she
+knows
+that
+she
+raised
+me
+wrong
+Don
+t
+let
+me
+go
+in
+that
+dungeon
+I
+ll
+forgive
+Lizzie
+I
+ll
+do
+anything
+I
+am
+tired
+of
+life
+and
+tired
+of
+everything
+Dr
+When
+you
+reach
+the
+spirit
+side
+of
+life
+you
+must
+try
+to
+be
+of
+service
+to
+others
+instead
+of
+a
+detriment
+Try
+to
+undo
+the
+wrong
+you
+have
+done
+by
+obsessing
+this
+lady
+Sp
+She
+tormented
+me
+and
+I
+hate
+women
+I
+got
+revenge
+I
+took
+a
+slipper
+and
+pounded
+her
+face
+I
+did
+it
+for
+revenge
+on
+women
+for
+I
+hate
+them
+all
+The
+spirit
+could
+not
+be
+brought
+to
+realize
+his
+situation
+and
+he
+was
+taken
+away
+to
+be
+placed
+in
+a
+dungeon
+until
+he
+could
+overcome
+self
+and
+his
+hatred
+toward
+humanity
+Several
+years
+ago
+a
+friend
+of
+ours
+complained
+of
+the
+peculiar
+and
+erratic
+actions
+of
+a
+business
+associate
+Mr
+P
+who
+had
+suddenly
+become
+extremely
+irritable
+and
+despotic
+to
+those
+in
+his
+employ
+highly
+unreasonable
+impossible
+to
+please
+and
+subject
+to
+violent
+attacks
+of
+swearing
+As
+obsession
+seemed
+indicated
+we
+concentrated
+for
+the
+gentleman
+in
+question
+and
+after
+several
+weeks
+an
+irate
+spirit
+spoke
+through
+Mrs
+Wickland
+and
+frankly
+admitted
+having
+tormented
+this
+man
+wanting
+revenge
+for
+attentions
+which
+he
+claimed
+the
+latter
+had
+been
+paying
+to
+his
+wife
+The
+situation
+had
+existed
+during
+his
+life
+but
+he
+did
+not
+discover
+this
+until
+after
+his
+death
+The
+spirit
+gave
+the
+name
+of
+a
+man
+prominent
+in
+local
+business
+circles
+he
+had
+passed
+out
+some
+time
+before
+but
+was
+not
+aware
+of
+the
+fact
+He
+said
+that
+he
+had
+been
+sick
+for
+a
+long
+time
+but
+could
+now
+go
+where
+he
+pleased
+without
+any
+trouble
+for
+he
+had
+become
+well
+He
+could
+not
+understand
+why
+his
+wife
+would
+no
+longer
+speak
+to
+him
+or
+why
+his
+child
+who
+had
+always
+been
+so
+affectionate
+was
+now
+so
+cold
+toward
+him
+He
+declared
+that
+some
+of
+his
+friends
+were
+false
+to
+him
+and
+had
+for
+some
+time
+been
+paying
+attention
+to
+his
+wife
+sending
+her
+gifts
+and
+flowers
+but
+that
+he
+would
+have
+revenge
+on
+them
+as
+soon
+as
+he
+was
+through
+with
+his
+present
+victim
+The
+spirit
+said
+that
+he
+could
+not
+think
+very
+clearly
+but
+supposed
+that
+was
+because
+he
+had
+recently
+taken
+an
+anaesthetic
+which
+he
+thought
+also
+accounted
+for
+the
+peculiar
+lightness
+of
+his
+body
+and
+a
+feeling
+of
+having
+no
+weight
+He
+was
+puzzled
+by
+the
+fact
+that
+whenever
+he
+thought
+about
+any
+persons
+he
+immediately
+found
+himself
+with
+them
+and
+involved
+in
+their
+affairs
+Recently
+he
+had
+been
+around
+Mr
+P
+but
+could
+not
+get
+away
+from
+him
+this
+had
+exasperated
+him
+exceedingly
+he
+had
+done
+a
+lot
+of
+swearing
+kept
+the
+man
+awake
+made
+him
+go
+to
+work
+early
+and
+had
+annoyed
+him
+in
+every
+way
+possible
+After
+many
+explanations
+the
+spirit
+finally
+realized
+that
+he
+had
+died
+although
+this
+was
+at
+first
+difficult
+for
+him
+to
+comprehend
+for
+he
+had
+always
+thought
+death
+ended
+all
+and
+that
+was
+all
+there
+was
+to
+it
+Being
+assured
+that
+activity
+and
+progression
+awaited
+him
+in
+the
+spirit
+world
+and
+that
+matters
+would
+there
+be
+explained
+to
+him
+to
+his
+entire
+satisfaction
+he
+left
+The
+following
+day
+there
+was
+such
+a
+remarkable
+improvement
+in
+the
+conduct
+of
+Mr
+P
+and
+his
+behavior
+was
+so
+wholly
+normal
+that
+the
+entire
+office
+force
+noticed
+the
+change
+although
+Mr
+P
+himself
+never
+knew
+of
+the
+experimental
+effort
+which
+had
+been
+made
+in
+his
+behalf
+A
+patient
+Miss
+R
+F
+was
+intermittently
+seized
+by
+impulses
+to
+run
+away
+and
+at
+such
+times
+became
+greatly
+agitated
+but
+shortly
+after
+entering
+our
+Institute
+she
+was
+relieved
+of
+the
+instigator
+of
+these
+wanderings
+EXPERIENCE
+SEPTEMBER
+Spirit
+EDWARD
+STERLING
+Patient
+Miss
+R
+F
+Psychic
+MRS
+WICKLAND
+An
+intelligence
+took
+control
+of
+the
+psychic
+and
+rising
+attempted
+to
+run
+away
+becoming
+very
+indignant
+when
+restrained
+Doctor
+Won
+t
+you
+sit
+down
+Spirit
+No
+Dr
+Where
+are
+you
+going
+Sp
+Home
+Dr
+Home
+Where
+is
+your
+home
+Sp
+I
+want
+to
+go
+to
+find
+it
+Struggling
+for
+freedom
+Dr
+What
+a
+nice
+lady
+you
+are
+to
+act
+like
+this
+Sp
+Lady
+Lady
+I
+m
+no
+lady
+I
+m
+a
+man
+Dr
+Where
+did
+you
+come
+from
+Sp
+That
+doesn
+t
+make
+any
+difference
+I
+m
+going
+home
+Dr
+Where
+is
+your
+home
+Sp
+Wherever
+I
+can
+find
+it
+I
+know
+I
+am
+not
+going
+to
+sit
+here
+any
+longer
+I
+m
+going
+I
+ll
+tell
+you
+that
+Dr
+Recognizing
+the
+phraseology
+of
+the
+patient
+Why
+did
+you
+cut
+off
+your
+hair
+The
+patient
+under
+an
+irrational
+impulse
+had
+cut
+her
+hair
+short
+Sp
+Do
+you
+think
+I
+want
+to
+wear
+long
+hair
+like
+a
+woman
+No
+sir
+I
+don
+t
+I
+m
+going
+yes
+sir
+I
+m
+going
+I
+tell
+you
+Dr
+Where
+will
+you
+go
+You
+have
+no
+home
+Sp
+I
+won
+t
+stay
+here
+I
+m
+going
+Dr
+How
+long
+have
+you
+been
+dead
+Sp
+I
+m
+not
+dead
+I
+m
+going
+I
+don
+t
+want
+those
+awful
+things
+put
+into
+me
+all
+over
+my
+body
+Referring
+to
+static
+electrical
+treatment
+applied
+to
+patient
+It
+s
+just
+like
+sticking
+sharp
+things
+into
+me
+real
+sharp
+things
+Dr
+You
+felt
+the
+electricity
+I
+gave
+to
+a
+patient
+Sp
+I
+tried
+twice
+to
+run
+away
+but
+I
+was
+brought
+back
+Dr
+Why
+did
+you
+make
+that
+lady
+cut
+off
+her
+hair
+Sp
+I
+didn
+t
+make
+anybody
+cut
+their
+hair
+off
+It
+s
+my
+body
+and
+I
+can
+cut
+my
+hair
+off
+if
+I
+want
+to
+I
+went
+to
+sleep
+and
+when
+I
+woke
+up
+my
+hair
+had
+grown
+so
+long
+that
+I
+did
+not
+know
+what
+to
+do
+I
+went
+to
+sleep
+and
+I
+slept
+a
+long
+time
+and
+after
+waking
+up
+I
+found
+I
+had
+long
+hair
+and
+I
+wasn
+t
+going
+to
+have
+that
+so
+I
+would
+look
+like
+a
+woman
+I
+could
+not
+go
+to
+a
+barber
+shop
+cause
+I
+was
+too
+ashamed
+to
+be
+seen
+on
+the
+street
+so
+I
+cut
+it
+off
+myself
+Dr
+You
+did
+not
+cut
+your
+own
+hair
+you
+cut
+off
+the
+hair
+of
+the
+lady
+you
+were
+controlling
+Sp
+It
+was
+my
+own
+hair
+I
+cut
+Why
+do
+you
+keep
+me
+here
+like
+this
+I
+haven
+t
+done
+anything
+to
+you
+or
+anybody
+else
+Dr
+You
+have
+been
+disturbing
+a
+lady
+and
+doing
+her
+a
+great
+wrong
+You
+say
+you
+are
+a
+man
+and
+yet
+you
+are
+wearing
+lady
+s
+clothes
+How
+do
+you
+account
+for
+that
+Sp
+I
+couldn
+t
+get
+any
+man
+s
+clothes
+Dr
+Shouldn
+t
+that
+fact
+open
+your
+eyes
+and
+show
+you
+that
+there
+is
+something
+the
+matter
+with
+you
+Sp
+Can
+t
+I
+sit
+down
+Dr
+Yes
+if
+you
+will
+sit
+quietly
+Should
+you
+not
+try
+to
+find
+out
+what
+is
+the
+matter
+with
+you
+Sp
+I
+don
+t
+want
+to
+stay
+here
+I
+m
+going
+home
+Dr
+If
+you
+will
+sit
+still
+and
+listen
+I
+will
+explain
+your
+situation
+You
+are
+so
+called
+dead
+Sp
+I
+am
+not
+dead
+I
+ll
+have
+you
+know
+Stop
+holding
+me
+Dr
+I
+am
+not
+holding
+you
+I
+am
+holding
+my
+wife
+You
+must
+realize
+that
+you
+are
+in
+a
+strange
+position
+You
+passed
+out
+of
+your
+mortal
+body
+but
+do
+not
+understand
+your
+situation
+Sp
+Let
+me
+go
+I
+want
+to
+get
+out
+of
+here
+What
+are
+you
+holding
+my
+hands
+for
+Dr
+I
+am
+not
+holding
+your
+hands
+I
+am
+holding
+my
+wife
+s
+hands
+Sp
+Your
+wife
+s
+hands
+I
+never
+saw
+you
+before
+and
+I
+m
+not
+your
+wife
+Do
+you
+think
+a
+man
+marries
+another
+man
+I
+never
+heard
+such
+talk
+Dr
+What
+I
+tell
+you
+is
+true
+just
+the
+same
+You
+are
+an
+ignorant
+spirit
+and
+do
+not
+understand
+your
+condition
+Sp
+You
+let
+me
+alone
+I
+want
+to
+go
+home
+Dr
+Did
+you
+ever
+stop
+to
+think
+what
+happens
+to
+a
+person
+when
+he
+dies
+Sp
+I
+am
+not
+dead
+I
+just
+went
+to
+sleep
+Dr
+That
+was
+the
+sleep
+of
+death
+Sp
+I
+slept
+so
+long
+that
+when
+I
+woke
+up
+my
+hair
+had
+grown
+long
+Dr
+Not
+only
+had
+your
+hair
+grown
+but
+you
+also
+had
+on
+woman
+s
+clothes
+How
+did
+you
+get
+them
+Sp
+I
+m
+not
+dead
+just
+the
+same
+Dr
+You
+have
+lost
+your
+physical
+body
+When
+you
+lose
+that
+you
+are
+supposed
+to
+be
+dead
+Sp
+If
+I
+was
+dead
+I
+would
+go
+to
+the
+grave
+and
+stay
+there
+until
+the
+last
+day
+You
+stay
+there
+until
+Gabriel
+blows
+his
+horn
+Dr
+That
+is
+only
+ignorant
+belief
+You
+were
+too
+lazy
+to
+understand
+life
+s
+mysteries
+Sp
+I
+was
+taught
+that
+when
+I
+died
+if
+I
+believed
+in
+God
+and
+Christ
+and
+that
+Christ
+died
+for
+our
+sins
+I
+would
+go
+to
+Heaven
+Dr
+Why
+did
+you
+not
+go
+to
+Heaven
+when
+you
+died
+You
+have
+died
+so
+far
+as
+the
+world
+is
+concerned
+You
+are
+here
+and
+yet
+we
+cannot
+see
+you
+I
+see
+only
+my
+wife
+s
+body
+Sp
+I
+have
+never
+seen
+your
+wife
+and
+I
+don
+t
+know
+her
+Dr
+Have
+you
+ever
+heard
+about
+mediums
+Sp
+Yes
+but
+I
+don
+t
+believe
+in
+them
+Dr
+You
+are
+speaking
+through
+a
+medium
+now
+You
+claim
+to
+be
+a
+man
+and
+yet
+you
+are
+using
+a
+woman
+s
+body
+to
+speak
+through
+Sp
+Lies
+nothing
+but
+lies
+Dr
+It
+is
+true
+nevertheless
+You
+have
+woman
+s
+clothes
+on
+You
+know
+there
+is
+something
+strange
+about
+your
+condition
+You
+probably
+do
+not
+know
+that
+you
+are
+in
+Los
+Angeles
+California
+Sp
+No
+I
+am
+not
+Dr
+Where
+should
+you
+be
+Sp
+I
+have
+been
+on
+the
+go
+for
+some
+time
+traveling
+Dr
+Look
+at
+your
+hands
+they
+are
+not
+yours
+Sp
+I
+never
+saw
+you
+before
+you
+put
+all
+that
+electricity
+into
+me
+and
+I
+feel
+like
+giving
+you
+a
+good
+licking
+What
+do
+you
+think
+of
+any
+man
+doing
+such
+a
+thing
+to
+another
+man
+It
+goes
+right
+through
+you
+You
+don
+t
+know
+how
+it
+hurts
+I
+m
+not
+going
+to
+stand
+for
+any
+more
+such
+nonsense
+I
+stood
+it
+for
+a
+long
+time
+then
+I
+went
+When
+I
+left
+a
+great
+big
+Indian
+spirit
+got
+hold
+of
+me
+and
+put
+me
+in
+prison
+I
+got
+loose
+after
+awhile
+and
+came
+here
+Dr
+You
+have
+been
+bothering
+a
+woman
+who
+was
+a
+patient
+of
+ours
+and
+electrical
+treatments
+given
+to
+her
+dislodged
+you
+Sp
+What
+is
+the
+matter
+with
+me
+I
+have
+felt
+so
+crowded
+Dr
+Can
+t
+you
+understand
+that
+you
+are
+in
+a
+strange
+situation
+You
+were
+probably
+a
+big
+man
+and
+you
+felt
+crowded
+because
+you
+were
+occupying
+a
+body
+smaller
+than
+your
+own
+physical
+body
+Why
+don
+t
+you
+open
+your
+mind
+and
+learn
+the
+facts
+Sp
+There
+s
+nothing
+to
+learn
+Dr
+It
+has
+probably
+been
+a
+long
+time
+since
+you
+lost
+your
+body
+What
+year
+is
+it
+Sp
+I
+had
+a
+good
+long
+sleep
+and
+I
+don
+t
+know
+Dr
+Shouldn
+t
+your
+present
+strange
+condition
+cause
+you
+to
+ask
+questions
+We
+cannot
+see
+you
+we
+can
+only
+hear
+you
+talk
+Sp
+What
+sense
+is
+there
+in
+talking
+to
+a
+person
+when
+you
+don
+t
+see
+him
+Dr
+This
+lady
+is
+a
+psychic
+and
+you
+are
+a
+spirit
+talking
+through
+her
+body
+Sp
+I
+don
+t
+believe
+you
+Dr
+This
+is
+my
+wife
+s
+body
+Are
+you
+my
+wife
+talking
+to
+me
+Sp
+I
+m
+not
+your
+wife
+I
+m
+a
+man
+Dr
+I
+drove
+you
+away
+from
+the
+woman
+you
+were
+controlling
+You
+made
+her
+act
+like
+an
+insane
+person
+How
+did
+you
+come
+here
+Sp
+You
+tell
+me
+how
+Dr
+You
+are
+an
+invisible
+spirit
+you
+do
+not
+understand
+your
+situation
+The
+lady
+you
+have
+been
+bothering
+happened
+to
+be
+in
+a
+nervous
+condition
+and
+susceptible
+to
+spirit
+obsession
+and
+you
+obsessed
+her
+You
+made
+that
+lady
+do
+many
+insane
+things
+What
+do
+you
+think
+of
+such
+actions
+Sp
+I
+wouldn
+t
+say
+it
+was
+anything
+very
+grand
+but
+I
+don
+t
+even
+know
+any
+woman
+Dr
+You
+influenced
+her
+to
+cut
+off
+her
+hair
+and
+to
+run
+away
+Sp
+What
+did
+I
+want
+with
+long
+hair
+I
+went
+to
+sleep
+and
+when
+I
+woke
+up
+my
+hair
+had
+grown
+too
+long
+so
+I
+cut
+it
+off
+that
+s
+all
+Dr
+That
+was
+the
+woman
+s
+hair
+you
+cut
+Sp
+It
+was
+too
+long
+Dr
+That
+is
+her
+business
+Just
+reverse
+things
+Suppose
+you
+had
+your
+own
+body
+and
+somebody
+cut
+your
+hair
+off
+would
+you
+like
+it
+Sp
+No
+I
+wouldn
+t
+but
+she
+couldn
+t
+help
+yourself
+Dr
+Don
+t
+you
+think
+that
+you
+were
+very
+selfish
+Sp
+I
+don
+t
+know
+Say
+if
+as
+you
+say
+I
+m
+dead
+why
+is
+it
+that
+I
+m
+not
+in
+Heaven
+or
+hell
+Dr
+There
+are
+no
+such
+places
+Sp
+I
+haven
+t
+seen
+God
+or
+Christ
+or
+the
+devil
+yet
+you
+tell
+me
+I
+am
+dead
+Dr
+You
+are
+not
+dead
+Sp
+Why
+just
+a
+little
+while
+ago
+you
+said
+I
+was
+Dr
+You
+are
+dead
+to
+the
+world
+Sp
+You
+said
+I
+was
+dead
+Dr
+I
+said
+you
+were
+so
+called
+dead
+you
+lost
+your
+physical
+body
+Sp
+You
+said
+I
+was
+dead
+Dr
+Now
+listen
+to
+reason
+or
+I
+will
+have
+to
+take
+you
+into
+the
+office
+and
+give
+you
+more
+electricity
+Sp
+I
+don
+t
+want
+that
+it
+makes
+you
+feel
+like
+you
+were
+burning
+up
+Dr
+We
+wanted
+to
+get
+you
+out
+and
+we
+succeeded
+Sp
+What
+business
+is
+it
+of
+yours
+if
+I
+stayed
+there
+Dr
+We
+wanted
+that
+lady
+to
+be
+rid
+of
+you
+Sp
+You
+had
+no
+right
+to
+get
+me
+away
+from
+her
+Dr
+Do
+you
+think
+it
+was
+right
+of
+you
+to
+control
+her
+and
+disturb
+her
+life
+Sp
+A
+fellow
+has
+got
+to
+have
+some
+place
+to
+live
+Dr
+Suppose
+it
+had
+been
+your
+mother
+and
+a
+selfish
+spirit
+were
+controlling
+her
+and
+making
+her
+act
+as
+if
+insane
+do
+you
+think
+that
+would
+be
+right
+Sp
+I
+was
+not
+insane
+and
+I
+did
+not
+make
+her
+insane
+either
+Dr
+It
+was
+an
+insane
+act
+for
+her
+to
+cut
+off
+her
+hair
+and
+run
+away
+Sp
+How
+would
+you
+like
+to
+have
+your
+hair
+long
+if
+you
+were
+a
+man
+Dr
+It
+was
+the
+lady
+s
+body
+and
+the
+lady
+s
+hair
+not
+yours
+Now
+you
+have
+been
+driven
+from
+the
+lady
+s
+body
+and
+you
+must
+change
+your
+conduct
+If
+you
+are
+not
+careful
+you
+will
+be
+put
+into
+a
+dungeon
+You
+said
+a
+short
+time
+ago
+that
+an
+Indian
+got
+hold
+of
+you
+you
+had
+better
+be
+careful
+or
+another
+Indian
+will
+get
+hold
+of
+you
+Sp
+I
+will
+fight
+him
+if
+he
+does
+Dr
+Listen
+to
+me
+My
+wife
+is
+a
+psychic
+and
+she
+allows
+such
+spirits
+as
+you
+to
+control
+her
+body
+to
+bring
+them
+to
+a
+realization
+of
+their
+condition
+You
+should
+appreciate
+the
+privilege
+There
+are
+thousands
+of
+spirits
+who
+would
+be
+glad
+to
+be
+in
+your
+place
+at
+this
+moment
+You
+know
+that
+you
+are
+in
+a
+strange
+condition
+Perhaps
+some
+of
+your
+kindred
+are
+here
+They
+will
+take
+you
+with
+them
+to
+the
+spirit
+world
+You
+must
+behave
+yourself
+and
+understand
+and
+be
+sensible
+Sp
+What
+shall
+I
+do
+Dr
+Understand
+that
+there
+is
+a
+spirit
+world
+and
+that
+you
+should
+strive
+to
+reach
+it
+Sp
+You
+mean
+Heaven
+Dr
+The
+Kingdom
+of
+Heaven
+is
+within
+one
+Sp
+Don
+t
+you
+believe
+that
+Christ
+died
+for
+your
+sins
+Dr
+He
+did
+not
+die
+for
+mine
+Don
+t
+you
+understand
+that
+something
+is
+lacking
+in
+such
+a
+belief
+Jesus
+taught
+us
+how
+to
+understand
+life
+he
+did
+not
+die
+for
+the
+sins
+of
+any
+one
+Those
+who
+believe
+that
+Christ
+died
+for
+their
+sins
+lack
+the
+right
+understanding
+of
+His
+teachings
+It
+is
+a
+sin
+against
+God
+to
+teach
+such
+a
+doctrine
+If
+it
+were
+true
+it
+would
+mean
+that
+God
+had
+made
+a
+mistake
+and
+was
+forced
+to
+provide
+an
+intercessor
+as
+an
+offering
+of
+atonement
+for
+His
+own
+mistake
+Now
+friend
+you
+must
+leave
+my
+wife
+and
+you
+must
+also
+leave
+the
+other
+lady
+alone
+Sp
+What
+are
+you
+talking
+about
+I
+never
+saw
+your
+wife
+Dr
+You
+are
+temporarily
+controlling
+my
+wife
+s
+body
+We
+cannot
+see
+you
+If
+you
+do
+not
+come
+to
+your
+senses
+pretty
+soon
+we
+shall
+have
+to
+force
+you
+out
+and
+then
+you
+will
+be
+in
+the
+outer
+darkness
+which
+the
+Bible
+speaks
+about
+Sp
+It
+is
+not
+right
+that
+God
+should
+treat
+me
+as
+he
+has
+I
+prayed
+and
+prayed
+and
+prayed
+I
+went
+to
+church
+and
+paid
+a
+whole
+lot
+of
+money
+to
+the
+church
+because
+they
+said
+if
+I
+did
+not
+give
+money
+I
+would
+go
+straight
+to
+hell
+when
+I
+died
+and
+I
+thought
+when
+I
+paid
+my
+money
+I
+should
+get
+my
+money
+s
+worth
+Dr
+What
+did
+Jesus
+say
+God
+is
+Spirit
+and
+they
+that
+worship
+him
+must
+worship
+him
+in
+Spirit
+and
+in
+truth
+God
+is
+Spirit
+not
+a
+spirit
+The
+Bible
+says
+God
+is
+Love
+and
+He
+that
+dwelleth
+in
+Love
+dwelleth
+in
+God
+Where
+will
+you
+look
+to
+find
+such
+a
+God
+except
+within
+your
+own
+self
+Ye
+are
+the
+temple
+of
+God
+and
+the
+spirit
+of
+God
+dwelleth
+in
+you
+What
+is
+Heaven
+It
+is
+a
+condition
+of
+your
+own
+mind
+attained
+when
+you
+understand
+life
+s
+purpose
+Sp
+Isn
+t
+Heaven
+a
+place
+It
+says
+so
+in
+the
+Bible
+it
+says
+Heaven
+is
+paved
+with
+golden
+streets
+Isn
+t
+that
+so
+Dr
+That
+like
+many
+other
+statements
+in
+the
+Bible
+is
+symbolical
+of
+great
+truths
+of
+life
+Sp
+You
+said
+a
+short
+time
+ago
+that
+Jesus
+did
+not
+die
+for
+your
+sins
+What
+do
+you
+believe
+Dr
+I
+recognize
+that
+we
+are
+all
+spiritual
+beings
+in
+mortal
+bodies
+while
+on
+earth
+When
+we
+pass
+out
+of
+our
+mortal
+bodies
+with
+understanding
+we
+will
+not
+waken
+in
+darkness
+but
+our
+spiritual
+eyes
+will
+be
+open
+and
+advanced
+spirits
+will
+help
+us
+to
+progress
+in
+the
+spirit
+world
+Some
+kind
+spirit
+friends
+of
+yours
+may
+be
+here
+now
+Do
+you
+not
+realize
+that
+some
+change
+has
+taken
+place
+with
+you
+Sp
+I
+can
+talk
+more
+than
+I
+could
+You
+said
+I
+was
+talking
+through
+your
+wife
+How
+can
+I
+talk
+through
+her
+Dr
+My
+wife
+is
+a
+psychic
+who
+is
+so
+developed
+that
+spirits
+can
+talk
+through
+her
+and
+intelligent
+spirits
+have
+allowed
+you
+to
+control
+her
+However
+you
+will
+not
+be
+able
+to
+stay
+long
+Sp
+I
+think
+I
+will
+stay
+here
+I
+feel
+better
+I
+feel
+pretty
+good
+now
+Dr
+You
+will
+feel
+still
+better
+after
+you
+realize
+the
+beautiful
+condition
+in
+the
+spirit
+world
+You
+will
+have
+to
+become
+as
+a
+little
+child
+then
+you
+can
+enter
+the
+kingdom
+of
+Heaven
+Do
+not
+merely
+believe
+but
+try
+to
+understand
+What
+is
+your
+name
+Sp
+Edward
+Dr
+And
+your
+other
+name
+Sp
+I
+don
+t
+know
+Dr
+Where
+did
+you
+live
+Do
+you
+know
+that
+you
+are
+in
+Los
+Angeles
+California
+Do
+you
+know
+what
+year
+it
+is
+Sp
+No
+I
+don
+t
+know
+Dr
+Why
+don
+t
+you
+know
+Sp
+I
+have
+no
+memory
+I
+can
+t
+think
+I
+don
+t
+know
+anything
+any
+more
+Such
+a
+state
+of
+bewilderment
+suggests
+that
+the
+cause
+of
+amnesia
+conditions
+found
+in
+certain
+patients
+is
+probably
+possession
+by
+confused
+spirit
+intelligences
+Dr
+That
+is
+because
+you
+have
+been
+in
+the
+outer
+darkness
+and
+being
+a
+wandering
+spirit
+you
+drifted
+into
+that
+lady
+s
+aura
+controlled
+her
+and
+made
+her
+act
+as
+if
+insane
+Sp
+I
+wanted
+to
+have
+a
+good
+quiet
+home
+Dr
+Is
+it
+right
+to
+do
+the
+things
+you
+have
+done
+Sp
+When
+you
+have
+been
+walking
+in
+darkness
+for
+a
+long
+time
+and
+you
+see
+a
+light
+don
+t
+you
+want
+to
+stay
+Dr
+That
+is
+not
+the
+right
+kind
+of
+light
+You
+need
+the
+spiritual
+light
+of
+understanding
+Sp
+Then
+do
+you
+think
+I
+ought
+to
+go
+to
+church
+and
+sing
+and
+pray
+to
+God
+and
+read
+the
+Bible
+Dr
+Did
+you
+ever
+make
+a
+thorough
+study
+of
+the
+history
+of
+the
+Bible
+to
+learn
+who
+wrote
+it
+Sp
+It
+was
+God
+s
+inspired
+book
+Dr
+God
+did
+not
+write
+the
+Bible
+the
+book
+is
+man
+made
+Could
+one
+credit
+God
+with
+having
+written
+certain
+things
+in
+the
+Bible
+many
+of
+which
+are
+unfit
+to
+be
+read
+in
+respectable
+society
+Sp
+Who
+wrote
+the
+book
+Dr
+It
+was
+compiled
+from
+many
+sources
+during
+different
+periods
+mainly
+for
+the
+purpose
+of
+keeping
+people
+in
+subjection
+through
+fear
+of
+an
+imaginary
+devil
+and
+hell
+The
+Bible
+is
+a
+collection
+of
+poetry
+history
+allegories
+and
+philosophy
+of
+contradictions
+and
+truths
+But
+humanity
+believes
+that
+every
+word
+of
+the
+Bible
+is
+inspired
+and
+insists
+upon
+interpreting
+it
+literally
+instead
+of
+accepting
+what
+is
+reasonable
+The
+Bible
+states
+that
+The
+letter
+killeth
+but
+the
+spirit
+giveth
+life
+and
+Spiritual
+things
+are
+spiritually
+discerned
+Hence
+religion
+is
+a
+process
+of
+mental
+discernment
+The
+teachings
+of
+Christ
+contain
+wonderful
+truths
+but
+the
+allegories
+have
+been
+taught
+as
+historical
+facts
+by
+the
+church
+and
+dogma
+doctrine
+and
+creed
+have
+obscured
+their
+underlying
+spiritual
+significance
+SP
+Don
+t
+you
+believe
+that
+God
+made
+the
+earth
+in
+six
+days
+and
+rested
+on
+the
+seventh
+Dr
+No
+that
+is
+only
+an
+allegorical
+statement
+The
+seven
+days
+are
+symbolical
+of
+the
+seven
+principles
+in
+Nature
+God
+is
+at
+once
+the
+Creator
+and
+the
+Creation
+if
+God
+should
+rest
+all
+would
+be
+at
+an
+end
+We
+should
+understand
+life
+as
+it
+is
+not
+merely
+believe
+what
+is
+told
+us
+Now
+it
+is
+getting
+late
+and
+you
+cannot
+stay
+any
+longer
+See
+whether
+some
+one
+is
+here
+whom
+you
+know
+Sp
+Oh
+There
+s
+my
+mother
+It
+s
+a
+long
+time
+since
+I
+saw
+her
+But
+she
+died
+when
+I
+was
+a
+kid
+Dr
+Listen
+to
+her
+she
+can
+help
+you
+Sp
+Oh
+mother
+will
+you
+take
+me
+I
+Take
+me
+mother
+I
+m
+so
+tired
+Oh
+mother
+take
+me
+with
+you
+Dr
+Of
+course
+she
+will
+take
+you
+with
+her
+but
+you
+will
+have
+to
+rid
+yourself
+of
+all
+your
+foolish
+beliefs
+and
+acquire
+understanding
+Sp
+Let
+me
+go
+Rising
+to
+walk
+away
+Dr
+You
+will
+have
+to
+think
+yourself
+with
+your
+mother
+You
+can
+t
+take
+this
+body
+with
+you
+because
+it
+belongs
+to
+my
+wife
+Just
+think
+yourself
+with
+your
+mother
+and
+you
+will
+be
+there
+instantly
+Sp
+I
+m
+so
+tired
+and
+weary
+so
+tired
+Let
+me
+go
+with
+my
+mother
+I
+see
+her
+coming
+she
+went
+away
+for
+a
+while
+Dr
+Now
+go
+with
+your
+mother
+God
+gave
+you
+intelligence
+to
+think
+and
+you
+must
+be
+reasonable
+and
+let
+your
+mother
+and
+others
+teach
+you
+Sp
+Mother
+says
+I
+must
+ask
+you
+to
+forgive
+me
+for
+being
+so
+rude
+and
+she
+also
+says
+I
+must
+ask
+that
+lady
+to
+please
+forgive
+me
+for
+bothering
+her
+Dr
+Can
+you
+tell
+us
+where
+you
+came
+from
+Sp
+I
+can
+t
+remember
+Dr
+What
+year
+do
+you
+think
+it
+is
+Sp
+It
+should
+be
+Dr
+That
+was
+nineteen
+years
+ago
+Who
+is
+the
+President
+Sp
+McKinley
+Dr
+He
+was
+shot
+on
+the
+sixth
+of
+September
+and
+died
+on
+the
+fourteenth
+This
+is
+now
+Sp
+Where
+have
+I
+been
+all
+that
+time
+Sleeping
+The
+winter
+of
+was
+awfully
+sick
+and
+it
+seems
+hard
+to
+remember
+anything
+else
+after
+that
+It
+was
+around
+Christmas
+and
+I
+caught
+cold
+and
+I
+was
+very
+sick
+Dr
+Where
+were
+you
+when
+you
+were
+taken
+sick
+Sp
+I
+was
+working
+in
+the
+woods
+I
+worked
+in
+a
+lumber
+town
+at
+lumbering
+I
+remember
+something
+hitting
+me
+on
+the
+head
+and
+that
+s
+all
+I
+remember
+My
+mother
+says
+my
+name
+is
+Sterling
+yes
+that
+s
+it
+Dr
+Can
+your
+mother
+tell
+what
+place
+you
+came
+from
+before
+you
+took
+up
+lumbering
+Sp
+I
+was
+born
+in
+Iowa
+mother
+says
+but
+when
+I
+got
+hurt
+I
+was
+working
+in
+the
+woods
+in
+Northern
+Wisconsin
+I
+used
+to
+live
+in
+Iowa
+Dr
+Can
+you
+remember
+the
+name
+of
+the
+town
+Sp
+No
+I
+can
+t
+Dr
+Well
+friend
+try
+to
+obtain
+an
+understanding
+of
+life
+and
+be
+of
+service
+to
+humanity
+instead
+of
+a
+detriment
+You
+have
+been
+bothering
+a
+lady
+and
+she
+is
+not
+yet
+entirely
+free
+Sp
+I
+was
+not
+the
+only
+one
+bothering
+her
+there
+are
+two
+more
+just
+as
+bad
+as
+I
+am
+Dr
+When
+you
+have
+understanding
+you
+must
+help
+this
+lady
+to
+get
+well
+and
+take
+the
+other
+spirits
+away
+from
+her
+Sp
+I
+will
+try
+Thank
+you
+Goodbye
+I
+Haunted
+houses
+are
+often
+frequented
+by
+spirits
+who
+seek
+revenge
+for
+wrongs
+suffered
+by
+them
+during
+life
+While
+Mrs
+Wickland
+and
+I
+were
+in
+Wisconsin
+we
+held
+a
+circle
+in
+the
+home
+of
+friends
+and
+Mrs
+Wickland
+was
+controlled
+by
+the
+spirit
+of
+a
+man
+who
+said
+he
+had
+been
+murdered
+by
+the
+owner
+of
+a
+near
+by
+stone
+quarry
+but
+that
+he
+was
+still
+alive
+in
+his
+house
+at
+the
+side
+of
+the
+quarry
+He
+laughed
+spitefully
+and
+said
+He
+killed
+me
+but
+I
+am
+having
+my
+revenge
+I
+haunt
+him
+Although
+we
+explained
+to
+the
+spirit
+the
+existence
+of
+a
+higher
+life
+he
+stated
+that
+he
+was
+not
+yet
+ready
+to
+leave
+his
+old
+haunts
+and
+refusing
+to
+progress
+departed
+Our
+friends
+then
+told
+us
+that
+they
+had
+known
+this
+man
+in
+life
+that
+ten
+years
+before
+the
+quarry
+had
+been
+owned
+by
+three
+men
+one
+of
+whom
+desiring
+to
+own
+the
+quarry
+himself
+had
+bought
+the
+holdings
+of
+the
+second
+man
+but
+the
+third
+man
+who
+lived
+in
+the
+house
+by
+the
+quarry
+had
+refused
+to
+sell
+A
+few
+days
+later
+the
+third
+man
+was
+found
+dead
+and
+although
+there
+was
+no
+proof
+as
+to
+the
+identity
+of
+the
+murderer
+there
+was
+a
+strong
+suspicion
+in
+the
+neighborhood
+that
+the
+first
+partner
+was
+the
+perpetrator
+of
+the
+crime
+As
+time
+went
+on
+the
+owner
+of
+the
+stone
+quarry
+developed
+a
+strange
+reluctance
+to
+work
+the
+quarry
+and
+rumor
+said
+that
+he
+was
+haunted
+by
+his
+dead
+partner
+It
+became
+common
+report
+that
+the
+house
+nearby
+was
+haunted
+and
+when
+our
+friends
+had
+driven
+there
+a
+year
+before
+to
+pick
+berries
+they
+had
+had
+an
+unusual
+experience
+After
+placing
+the
+horse
+in
+the
+empty
+barn
+they
+noticed
+some
+berries
+in
+the
+yard
+and
+returned
+to
+the
+barn
+for
+a
+basket
+when
+the
+horse
+began
+to
+rear
+wildly
+and
+neighed
+in
+terror
+Stopping
+in
+amazement
+our
+friends
+heard
+a
+coarse
+laugh
+and
+looking
+about
+saw
+a
+grinning
+man
+standing
+in
+the
+doorway
+of
+the
+deserted
+house
+It
+was
+the
+man
+who
+had
+died
+several
+years
+before
+they
+had
+known
+him
+in
+life
+and
+recognized
+him
+now
+The
+man
+laughed
+and
+vanished
+and
+our
+friends
+rushed
+to
+the
+barn
+took
+the
+horse
+out
+and
+drove
+away
+in
+great
+haste
+We
+had
+a
+series
+of
+letters
+from
+Mrs
+G
+G
+who
+resided
+in
+a
+village
+in
+New
+York
+she
+was
+a
+psychic
+and
+clairvoyant
+whose
+house
+was
+haunted
+by
+a
+band
+of
+evil
+spirits
+She
+wrote
+that
+she
+had
+been
+in
+the
+best
+of
+health
+when
+she
+had
+moved
+into
+this
+house
+but
+had
+soon
+become
+afflicted
+with
+a
+strange
+ailment
+of
+the
+arms
+and
+legs
+which
+no
+doctors
+could
+relieve
+Spirits
+who
+claimed
+to
+be
+her
+guides
+advised
+her
+to
+have
+a
+psychic
+circle
+every
+evening
+and
+sit
+for
+half
+an
+hour
+saying
+they
+could
+help
+her
+in
+this
+way
+They
+explained
+that
+she
+was
+being
+injured
+by
+the
+spirit
+of
+the
+woman
+who
+had
+built
+the
+house
+and
+that
+she
+could
+free
+herself
+by
+having
+a
+certain
+friend
+of
+hers
+attend
+the
+next
+circle
+This
+friend
+came
+and
+the
+spirit
+said
+she
+would
+leave
+with
+this
+woman
+When
+the
+latter
+reached
+her
+home
+she
+was
+taken
+with
+the
+same
+sickness
+with
+which
+Mrs
+G
+G
+had
+been
+troubled
+while
+Mrs
+G
+G
+recovered
+But
+disturbances
+of
+various
+kinds
+continued
+in
+the
+house
+even
+the
+orchard
+was
+haunted
+and
+spirits
+were
+heard
+to
+say
+that
+Mrs
+G
+G
+could
+not
+live
+if
+she
+remained
+there
+for
+they
+would
+kill
+any
+one
+who
+came
+into
+that
+house
+The
+G
+s
+sold
+the
+house
+and
+moved
+away
+without
+telling
+the
+purchasers
+anything
+of
+their
+mysterious
+experiences
+The
+new
+owners
+took
+possession
+of
+the
+house
+and
+the
+mother
+an
+elderly
+lady
+went
+to
+bed
+the
+first
+night
+apparently
+well
+but
+in
+a
+short
+time
+screamed
+that
+two
+men
+had
+come
+into
+her
+room
+threatening
+to
+kill
+her
+and
+before
+morning
+she
+was
+dead
+Mrs
+G
+G
+however
+continued
+her
+circles
+but
+was
+unable
+to
+rid
+herself
+of
+spirit
+influences
+and
+finally
+wrote
+to
+us
+for
+aid
+There
+is
+no
+one
+I
+can
+go
+to
+or
+depend
+upon
+I
+joined
+the
+New
+Thought
+Society
+to
+be
+helped
+they
+claimed
+to
+send
+out
+vibrations
+but
+I
+failed
+to
+get
+in
+on
+the
+wave
+No
+one
+prays
+more
+earnestly
+for
+help
+than
+or
+tries
+harder
+to
+do
+right
+Tell
+me
+if
+you
+can
+how
+to
+get
+relief
+We
+concentrated
+for
+the
+lady
+as
+well
+as
+the
+house
+and
+a
+number
+of
+spirits
+were
+brought
+from
+both
+One
+of
+the
+first
+declared
+that
+he
+did
+not
+know
+he
+was
+obsessing
+Mrs
+G
+G
+Another
+spirit
+was
+Harry
+Harris
+who
+had
+so
+brutally
+mistreated
+his
+wife
+that
+she
+had
+shot
+herself
+How
+his
+life
+had
+ended
+we
+did
+not
+learn
+He
+insisted
+that
+he
+was
+not
+dead
+but
+was
+living
+in
+an
+old
+house
+with
+a
+band
+of
+outlaws
+spirits
+and
+that
+they
+would
+kill
+any
+one
+who
+dared
+to
+move
+into
+their
+house
+Another
+evening
+four
+spirits
+were
+brought
+from
+the
+haunted
+house
+first
+two
+women
+then
+Pete
+who
+had
+been
+a
+dexterous
+pickpocket
+in
+life
+and
+a
+woman
+named
+Kate
+who
+had
+been
+killed
+by
+Pete
+and
+had
+hounded
+him
+ever
+since
+To
+conceal
+himself
+Pete
+was
+hiding
+with
+others
+in
+a
+house
+that
+belonged
+to
+them
+and
+to
+no
+one
+else
+We
+kill
+any
+one
+who
+comes
+in
+he
+said
+speaking
+through
+Mrs
+Wickland
+He
+admitted
+having
+troubled
+Mrs
+G
+G
+I
+stayed
+with
+her
+to
+get
+my
+grub
+he
+said
+While
+Pete
+was
+speaking
+Kate
+took
+control
+of
+another
+medium
+who
+was
+in
+the
+circle
+and
+Pete
+was
+terror
+stricken
+while
+Kate
+attempted
+to
+escape
+from
+him
+Each
+thought
+the
+other
+was
+a
+ghost
+and
+neither
+was
+aware
+of
+controlling
+a
+psychic
+It
+was
+some
+time
+before
+they
+realized
+that
+both
+had
+died
+Finally
+Pete
+sank
+on
+his
+knees
+and
+begged
+Kate
+to
+forgive
+him
+a
+reconciliation
+followed
+and
+both
+left
+promising
+to
+reform
+Later
+Mrs
+G
+G
+wrote
+that
+she
+had
+greatly
+improved
+In
+answer
+to
+an
+urgent
+appeal
+for
+help
+Mrs
+Wickland
+and
+I
+called
+at
+the
+home
+of
+Mr
+and
+Mrs
+C
+in
+Pasadena
+where
+nightly
+rappings
+and
+noises
+were
+keeping
+the
+family
+awake
+for
+hours
+Mr
+C
+had
+purchased
+this
+house
+from
+the
+children
+of
+an
+elderly
+lady
+who
+had
+died
+some
+time
+before
+A
+fact
+not
+known
+to
+us
+until
+later
+The
+house
+had
+been
+moved
+to
+Mr
+C
+s
+lot
+remodeled
+there
+and
+the
+C
+s
+had
+then
+moved
+into
+it
+only
+to
+be
+disturbed
+by
+noises
+of
+all
+kinds
+Every
+night
+between
+twelve
+and
+four
+the
+door
+of
+a
+closet
+between
+two
+bedrooms
+was
+shaken
+and
+rattled
+loudly
+and
+rappings
+and
+crackings
+kept
+the
+family
+awake
+While
+we
+were
+seated
+in
+one
+of
+the
+rooms
+of
+the
+C
+home
+discussing
+the
+situation
+Mrs
+Wickland
+became
+unexpectedly
+entranced
+by
+a
+spirit
+who
+complained
+of
+intense
+rheumatism
+and
+stormed
+at
+the
+C
+s
+for
+living
+in
+her
+house
+This
+is
+my
+house
+she
+declared
+peremptorily
+and
+these
+people
+have
+no
+business
+in
+it
+I
+will
+chase
+them
+out
+The
+controlling
+spirit
+proved
+to
+be
+the
+former
+owner
+of
+the
+house
+and
+later
+inquiry
+bore
+out
+the
+statement
+that
+she
+had
+suffered
+severely
+from
+rheumatism
+She
+could
+not
+realize
+that
+she
+was
+dead
+but
+insisted
+that
+she
+was
+still
+living
+in
+her
+own
+house
+although
+troubled
+by
+intruders
+If
+I
+am
+dead
+why
+am
+I
+not
+in
+Heaven
+she
+asked
+Many
+explanations
+at
+last
+resulted
+in
+understanding
+and
+a
+penitent
+departure
+and
+in
+a
+letter
+written
+several
+months
+later
+Mr
+C
+stated
+that
+all
+noises
+had
+entirely
+ceased
+in
+the
+house
+That
+spirits
+often
+play
+a
+serious
+part
+in
+domestic
+disturbances
+and
+break
+up
+many
+homes
+we
+have
+had
+ample
+evidence
+A
+patient
+Mrs
+SI
+who
+was
+brought
+to
+us
+from
+a
+Northern
+state
+was
+the
+second
+wife
+of
+a
+Dakota
+farmer
+After
+the
+birth
+of
+her
+first
+child
+she
+developed
+a
+tendency
+to
+wander
+away
+at
+random
+and
+when
+brought
+back
+and
+questioned
+she
+could
+only
+give
+vague
+answers
+but
+always
+insisted
+that
+her
+husband
+a
+steady
+reliable
+farmer
+was
+faithless
+to
+her
+When
+the
+obsessing
+spirit
+was
+transferred
+to
+Mrs
+Wickland
+we
+found
+that
+it
+was
+none
+other
+than
+the
+first
+wife
+who
+indignantly
+accused
+her
+husband
+of
+being
+faithless
+to
+her
+and
+said
+that
+she
+was
+determined
+to
+get
+rid
+of
+her
+rival
+After
+passing
+out
+of
+the
+physical
+body
+she
+had
+remained
+on
+the
+farm
+but
+she
+was
+unaware
+of
+her
+death
+and
+did
+not
+realize
+that
+her
+rival
+was
+her
+husband
+s
+second
+wife
+The
+spirit
+after
+due
+explanation
+and
+enlightenment
+left
+and
+Mrs
+SI
+restored
+to
+herself
+returned
+to
+her
+Dakota
+home
+We
+had
+a
+similar
+experience
+with
+an
+acquaintance
+of
+ours
+a
+gentleman
+whose
+first
+wife
+had
+died
+leaving
+him
+to
+care
+for
+their
+small
+son
+Later
+he
+married
+again
+but
+before
+long
+we
+noticed
+that
+the
+family
+life
+was
+becoming
+unhappy
+and
+the
+culmination
+came
+one
+Sunday
+morning
+when
+the
+second
+wife
+angrily
+left
+the
+house
+The
+husband
+desolately
+came
+to
+our
+home
+followed
+presently
+by
+the
+little
+boy
+and
+although
+they
+had
+never
+visited
+us
+before
+they
+remained
+for
+some
+hours
+In
+the
+evening
+the
+boy
+returned
+and
+while
+Mrs
+Wickland
+was
+conversing
+with
+him
+and
+a
+group
+of
+friends
+she
+became
+controlled
+by
+the
+spirit
+of
+a
+woman
+who
+said
+she
+was
+the
+boy
+s
+mother
+She
+had
+no
+knowledge
+of
+her
+death
+and
+craved
+longingly
+to
+caress
+her
+small
+son
+saying
+I
+want
+my
+boy
+I
+want
+my
+boy
+Then
+she
+burst
+forth
+into
+a
+jealous
+denunciation
+of
+her
+successor
+and
+declared
+she
+would
+drive
+her
+out
+of
+the
+house
+I
+chased
+her
+away
+this
+morning
+she
+exulted
+She
+too
+was
+finally
+made
+to
+understand
+the
+true
+situation
+and
+regretting
+the
+suffering
+she
+had
+caused
+promised
+to
+do
+everything
+possible
+to
+make
+amends
+The
+second
+wife
+returned
+home
+again
+and
+during
+the
+ten
+years
+which
+have
+elapsed
+since
+this
+episode
+no
+further
+disturbances
+have
+occurred
+in
+the
+family
+Miss
+L
+was
+the
+young
+fiancee
+of
+a
+widower
+who
+had
+formerly
+with
+his
+wife
+occupied
+a
+flat
+in
+the
+same
+building
+in
+which
+the
+Young
+lady
+lived
+and
+the
+two
+women
+had
+been
+intimate
+friends
+The
+wife
+died
+very
+suddenly
+and
+some
+time
+after
+her
+death
+the
+gentleman
+became
+engaged
+to
+the
+young
+lady
+Soon
+after
+this
+the
+latter
+began
+to
+show
+mental
+abnormalities
+which
+continually
+grew
+worse
+In
+her
+normal
+condition
+she
+esteemed
+the
+man
+highly
+but
+when
+she
+came
+to
+us
+she
+had
+a
+violent
+dislike
+for
+him
+and
+asserted
+that
+she
+would
+rather
+die
+or
+go
+to
+an
+insane
+asylum
+than
+marry
+him
+She
+had
+made
+several
+attempts
+to
+end
+her
+life
+but
+had
+each
+time
+seemed
+to
+come
+to
+herself
+at
+the
+last
+moment
+and
+called
+for
+help
+At
+the
+time
+the
+patient
+entered
+the
+Institute
+Mrs
+Wickland
+clairvoyantly
+saw
+the
+spirit
+of
+a
+woman
+of
+the
+brunette
+type
+possessing
+the
+patient
+who
+was
+a
+decided
+blond
+This
+spirit
+was
+so
+interblended
+with
+the
+patient
+that
+it
+was
+difficult
+for
+Mrs
+Wickland
+to
+determine
+from
+the
+transfiguration
+whether
+the
+patient
+was
+light
+or
+dark
+When
+Mrs
+Wickland
+described
+this
+spirit
+the
+patient
+s
+mother
+and
+fiance
+both
+recognized
+her
+as
+the
+man
+s
+former
+wife
+The
+patient
+proved
+very
+obdurate
+screaming
+spells
+alternated
+with
+obstinate
+stubborn
+moods
+and
+she
+could
+not
+be
+left
+alone
+at
+any
+time
+She
+declared
+herself
+insane
+and
+scoffed
+at
+being
+cured
+and
+insisted
+that
+she
+wanted
+to
+die
+for
+if
+she
+lived
+she
+would
+have
+to
+marry
+that
+man
+One
+day
+during
+a
+treatment
+she
+entered
+a
+semi
+trance
+condition
+and
+a
+spirit
+intelligence
+expressed
+itself
+forcefully
+He
+shall
+never
+marry
+her
+He
+shall
+never
+have
+her
+I
+will
+drive
+her
+to
+an
+insane
+asylum
+or
+I
+will
+kill
+her
+but
+he
+shall
+never
+have
+her
+Immediately
+following
+this
+the
+spirit
+of
+a
+child
+spoke
+defensively
+as
+if
+protecting
+a
+mother
+The
+patient
+s
+sister
+who
+was
+present
+recognized
+in
+the
+latter
+intelligence
+the
+deceased
+thirteen
+year
+old
+son
+of
+the
+dead
+wife
+The
+climax
+came
+a
+few
+days
+later
+The
+patient
+had
+been
+unusually
+obstinate
+and
+unruly
+and
+very
+contemptuous
+to
+her
+fiance
+when
+he
+called
+After
+a
+strong
+treatment
+was
+administered
+the
+patient
+became
+quiet
+and
+slept
+well
+that
+night
+However
+during
+the
+night
+Mrs
+Wickland
+was
+greatly
+troubled
+by
+the
+presence
+of
+a
+spirit
+who
+annoyed
+her
+until
+four
+o
+clock
+in
+the
+morning
+when
+she
+became
+completely
+entranced
+by
+the
+spirit
+of
+the
+man
+s
+former
+wife
+After
+considerable
+effort
+I
+induced
+the
+spirit
+to
+talk
+but
+she
+was
+with
+difficulty
+convinced
+of
+her
+real
+situation
+that
+she
+was
+a
+spirit
+and
+controlling
+Mrs
+Wickland
+s
+body
+She
+strongly
+censured
+both
+her
+forrner
+husband
+and
+our
+patient
+for
+their
+treachery
+to
+her
+and
+repeated
+her
+threats
+against
+the
+girl
+I
+will
+send
+her
+to
+the
+asylum
+I
+will
+kill
+her
+she
+declared
+A
+great
+deal
+of
+argument
+and
+persuasion
+were
+needed
+to
+bring
+the
+spirit
+to
+repentance
+but
+this
+was
+at
+last
+accomplished
+Upon
+being
+asked
+if
+her
+son
+was
+with
+her
+she
+said
+that
+she
+had
+seen
+him
+at
+times
+but
+that
+he
+was
+dead
+and
+she
+did
+not
+want
+to
+have
+anything
+to
+do
+with
+him
+The
+spirit
+was
+urged
+to
+leave
+the
+young
+woman
+whom
+she
+was
+tormenting
+and
+go
+with
+other
+spirit
+intelligences
+to
+a
+higher
+life
+of
+which
+she
+showed
+herself
+entirely
+ignorant
+Although
+repentant
+she
+still
+longed
+to
+remain
+on
+the
+earth
+plane
+but
+finally
+consented
+to
+leave
+and
+to
+cease
+troubling
+the
+patient
+then
+she
+suddenly
+became
+weak
+and
+declared
+she
+was
+dying
+This
+sensation
+often
+occurs
+when
+spirits
+realize
+their
+actual
+situation
+sometimes
+they
+again
+experience
+the
+physical
+conditions
+under
+which
+they
+passed
+out
+of
+their
+earth
+bodies
+Chills
+and
+violent
+attacks
+of
+coughing
+added
+to
+the
+spirit
+s
+distress
+and
+after
+a
+painful
+pseudo
+death
+struggle
+she
+left
+These
+symptoms
+were
+recognized
+by
+her
+husband
+and
+the
+patient
+s
+mother
+as
+corresponding
+exactly
+with
+those
+manifested
+by
+the
+man
+s
+wife
+at
+the
+time
+of
+her
+death
+from
+pneumonia
+After
+this
+the
+patient
+recovered
+rapidly
+She
+was
+soon
+able
+to
+leave
+the
+Institute
+is
+now
+well
+and
+happily
+married
+A
+peculiar
+case
+was
+that
+of
+Mr
+Me
+a
+well
+known
+man
+in
+Chicago
+whose
+family
+name
+is
+one
+of
+highest
+social
+prominence
+This
+man
+suddenly
+began
+to
+act
+strangely
+he
+shunned
+the
+members
+of
+his
+family
+and
+told
+his
+wife
+and
+relatives
+that
+he
+wished
+to
+live
+on
+a
+higher
+plane
+and
+wanted
+nothing
+more
+to
+do
+with
+them
+Then
+one
+day
+he
+packed
+his
+trunk
+and
+left
+home
+going
+to
+live
+in
+a
+small
+room
+which
+he
+had
+rented
+in
+the
+lowest
+section
+of
+the
+city
+We
+had
+never
+seen
+this
+gentleman
+but
+a
+relative
+of
+his
+who
+knew
+of
+our
+work
+asked
+us
+to
+concentrate
+for
+him
+at
+our
+next
+psychic
+circle
+we
+did
+so
+and
+a
+spirit
+was
+brought
+who
+controlled
+Mrs
+Wickland
+After
+some
+solicitation
+she
+gave
+her
+full
+name
+confessing
+that
+she
+had
+been
+the
+first
+wife
+of
+Mr
+Me
+and
+she
+then
+told
+her
+story
+She
+had
+met
+Mr
+Me
+in
+Chicago
+during
+the
+World
+s
+Fair
+and
+for
+a
+time
+they
+had
+lived
+together
+without
+the
+formality
+of
+marriage
+until
+his
+relatives
+discovered
+the
+situation
+and
+compelled
+them
+to
+marry
+The
+girl
+was
+accepted
+in
+society
+but
+rebelled
+at
+the
+restraints
+of
+conventional
+life
+and
+being
+of
+a
+vain
+and
+restless
+disposition
+could
+not
+live
+happily
+with
+her
+husband
+She
+finally
+left
+him
+and
+went
+to
+the
+west
+side
+where
+she
+entered
+a
+house
+of
+ill
+repute
+Although
+at
+times
+she
+regretted
+the
+folly
+of
+her
+conduct
+she
+continued
+her
+mode
+of
+living
+became
+a
+morphine
+addict
+and
+finally
+committed
+suicide
+After
+her
+death
+she
+had
+returned
+to
+her
+husband
+and
+when
+he
+married
+again
+she
+felt
+angrily
+aggrieved
+and
+at
+last
+influenced
+him
+to
+leave
+his
+wife
+and
+child
+to
+go
+to
+quarters
+where
+she
+herself
+felt
+more
+at
+home
+We
+convinced
+her
+of
+the
+great
+wrong
+she
+was
+doing
+in
+controlling
+her
+former
+husband
+in
+this
+manner
+and
+after
+she
+had
+obtained
+an
+understanding
+of
+the
+progress
+awaiting
+her
+in
+the
+spirit
+world
+she
+promised
+to
+leave
+wishing
+to
+attain
+a
+higher
+condition
+When
+next
+we
+saw
+the
+relative
+of
+Mr
+Me
+who
+had
+asked
+us
+to
+concentrate
+for
+him
+we
+told
+her
+of
+the
+story
+related
+by
+the
+spirit
+and
+in
+amazement
+she
+admitted
+it
+was
+true
+in
+every
+detail
+that
+the
+name
+given
+was
+correct
+and
+that
+Mr
+Me
+had
+been
+married
+before
+but
+that
+the
+unfortunate
+episode
+had
+been
+regarded
+by
+the
+family
+as
+a
+skeleton
+in
+the
+closet
+and
+was
+never
+mentioned
+She
+later
+reported
+that
+Mr
+Me
+had
+returned
+to
+his
+home
+normal
+and
+sane
+and
+was
+again
+living
+happily
+with
+his
+wife
+and
+child
+CHAPTER
+VI
+Spirits
+and
+Crime
+HABITS
+desires
+and
+inclinations
+are
+rooted
+in
+the
+mind
+and
+remain
+with
+the
+individual
+after
+he
+is
+freed
+from
+his
+physical
+body
+until
+they
+are
+eliminated
+by
+the
+will
+The
+spirits
+of
+many
+criminals
+murderers
+those
+who
+were
+executed
+or
+are
+seeking
+for
+revenge
+remain
+indefinitely
+in
+the
+earth
+sphere
+and
+often
+endeavor
+to
+continue
+their
+former
+activities
+and
+to
+carry
+out
+their
+evil
+designs
+through
+controlling
+the
+bodies
+of
+mortals
+who
+are
+sensitive
+to
+their
+influence
+In
+many
+cases
+of
+revolting
+murder
+investigations
+will
+show
+that
+the
+crimes
+were
+committed
+by
+innocent
+persons
+under
+the
+control
+of
+disembodied
+spirits
+who
+had
+taken
+complete
+possession
+of
+the
+murderer
+There
+is
+little
+doubt
+that
+the
+murder
+of
+Stanford
+White
+by
+Harry
+K
+Thaw
+in
+at
+Madison
+Square
+Roof
+Garden
+New
+York
+was
+due
+to
+spirit
+influence
+Harry
+Thaw
+was
+a
+psychic
+sensitive
+and
+had
+shown
+evidence
+of
+this
+fact
+all
+his
+life
+and
+whatever
+personal
+grievances
+he
+may
+have
+had
+when
+he
+killed
+Stanford
+White
+he
+was
+unquestionably
+obsessed
+by
+avenging
+spirits
+who
+desired
+retribution
+for
+real
+or
+fancied
+injustice
+done
+to
+themselves
+or
+kindred
+Harry
+Thaw
+was
+largely
+only
+the
+psychic
+subject
+and
+the
+physical
+instrument
+through
+which
+was
+enacted
+a
+terrible
+drama
+by
+the
+invisible
+world
+the
+actors
+being
+ignorant
+revengeful
+spirits
+On
+July
+several
+weeks
+after
+the
+tragedy
+occurred
+a
+strange
+spirit
+controlled
+Mrs
+Wickland
+during
+a
+psychic
+circle
+and
+fell
+prostrate
+to
+the
+floor
+Placing
+the
+form
+of
+my
+wife
+in
+a
+chair
+I
+began
+questioning
+the
+controlling
+intelligence
+The
+stranger
+strenuously
+objected
+to
+being
+touched
+brusquely
+demanded
+to
+be
+left
+alone
+and
+called
+out
+Hey
+there
+waiter
+Bring
+me
+a
+drink
+What
+kind
+of
+drink
+do
+you
+want
+Bring
+me
+a
+whiskey
+and
+soda
+and
+be
+quick
+about
+it
+Who
+are
+you
+None
+of
+your
+business
+who
+I
+am
+Where
+do
+you
+think
+you
+are
+In
+Madison
+Square
+Roof
+Garden
+of
+course
+What
+is
+your
+named
+Stanford
+White
+Holding
+one
+hand
+on
+the
+back
+of
+his
+head
+on
+the
+right
+side
+and
+clutching
+at
+his
+chest
+and
+abdomen
+as
+if
+in
+great
+pain
+he
+cried
+Have
+a
+waiter
+bring
+me
+that
+whiskey
+and
+soda
+I
+was
+about
+to
+ask
+further
+questions
+when
+the
+spirit
+s
+attention
+was
+attracted
+to
+some
+invisible
+and
+he
+began
+to
+tremble
+with
+fear
+Are
+you
+seeing
+dead
+people
+I
+asked
+He
+nodded
+his
+head
+violently
+then
+shouted
+They
+are
+after
+me
+and
+jumping
+from
+the
+chair
+ran
+to
+a
+corner
+of
+the
+room
+in
+an
+effort
+to
+escape
+His
+agitation
+was
+so
+great
+that
+he
+lost
+control
+of
+the
+psychic
+and
+was
+gone
+Immediately
+another
+spirit
+took
+possession
+of
+the
+psychic
+and
+in
+great
+excitement
+began
+to
+walk
+back
+and
+forth
+exclaiming
+exultantly
+I
+killed
+the
+dog
+I
+killed
+the
+dog
+There
+he
+lies
+pointing
+at
+the
+floor
+toward
+the
+spot
+where
+White
+had
+lost
+control
+The
+dog
+I
+have
+been
+looking
+for
+a
+chance
+to
+kill
+him
+for
+several
+years
+and
+I
+got
+him
+at
+last
+The
+dog
+I
+forced
+the
+spirit
+to
+sit
+down
+and
+learned
+that
+his
+name
+was
+Johnson
+I
+killed
+Stanford
+White
+he
+boasted
+He
+deserved
+death
+He
+had
+trifled
+too
+long
+with
+our
+daughters
+He
+was
+very
+pronounced
+in
+his
+denunciation
+of
+society
+men
+They
+steal
+our
+children
+from
+us
+and
+put
+fine
+clothes
+on
+them
+and
+the
+parents
+do
+not
+know
+what
+becomes
+of
+them
+I
+asked
+the
+spirit
+whether
+he
+was
+aware
+of
+being
+dead
+but
+he
+laughed
+at
+the
+idea
+and
+said
+How
+could
+a
+dead
+person
+talk
+The
+doctor
+said
+I
+had
+consumption
+and
+would
+die
+soon
+but
+I
+didn
+t
+die
+I
+never
+felt
+better
+in
+my
+life
+When
+asked
+to
+carefully
+examine
+his
+hands
+feet
+and
+dress
+he
+demanded
+to
+know
+how
+he
+a
+man
+became
+possessed
+of
+a
+woman
+s
+body
+Lengthy
+argument
+finally
+convinced
+the
+perplexed
+spirit
+of
+the
+fact
+of
+his
+transition
+and
+he
+departed
+thoroughly
+penitent
+He
+was
+followed
+by
+a
+third
+entity
+but
+this
+intelligence
+was
+aware
+of
+being
+a
+spirit
+temporarily
+controlling
+a
+borrowed
+body
+I
+am
+Harry
+Thaw
+s
+father
+Save
+my
+boy
+Save
+my
+boy
+He
+is
+not
+guilty
+Harry
+will
+not
+be
+electrocuted
+Later
+events
+proved
+this
+to
+be
+true
+He
+is
+sensitive
+to
+spirit
+influence
+and
+has
+been
+all
+his
+life
+He
+was
+always
+erratic
+and
+so
+excitable
+that
+we
+were
+afraid
+to
+correct
+him
+for
+fear
+he
+would
+become
+insane
+But
+I
+see
+our
+mistake
+now
+I
+did
+not
+understand
+the
+cause
+of
+Harry
+s
+queer
+actions
+while
+I
+was
+in
+the
+physical
+but
+now
+from
+the
+spirit
+side
+of
+life
+I
+can
+see
+that
+Harry
+has
+been
+a
+tool
+in
+the
+hands
+of
+selfish
+earthbound
+spirits
+most
+of
+his
+life
+He
+was
+obsessed
+by
+revengeful
+spirits
+when
+he
+killed
+Stanford
+White
+I
+have
+tried
+to
+reach
+the
+external
+world
+by
+every
+possible
+avenue
+to
+tell
+the
+people
+that
+Harry
+is
+not
+insane
+but
+that
+he
+is
+a
+psychic
+sensitive
+Save
+my
+boy
+Save
+my
+boy
+he
+begged
+repeatedly
+What
+would
+you
+have
+us
+do
+Please
+write
+to
+my
+wife
+and
+to
+my
+attorney
+Mr
+Olcott
+We
+did
+not
+then
+know
+that
+Mr
+Olcott
+had
+been
+Mr
+Thaw
+s
+attorney
+but
+verified
+the
+fact
+afterward
+Tell
+them
+your
+experience
+and
+what
+I
+have
+said
+to
+you
+and
+urge
+them
+to
+recognize
+and
+understand
+Harry
+s
+condition
+We
+promised
+to
+comply
+with
+the
+wish
+of
+the
+spirit
+and
+he
+then
+departed
+The
+following
+evening
+July
+another
+spirit
+came
+he
+seemed
+at
+first
+to
+be
+looking
+for
+some
+one
+then
+asked
+Where
+did
+the
+other
+fellows
+go
+This
+spirit
+also
+condemned
+high
+society
+in
+general
+and
+denounced
+young
+girls
+in
+particular
+for
+their
+foolishness
+The
+rich
+take
+our
+girls
+to
+their
+dens
+they
+put
+them
+on
+the
+stage
+and
+the
+girls
+disown
+their
+parents
+They
+deserve
+licking
+he
+declared
+and
+emphasized
+his
+words
+with
+suitable
+gestures
+This
+spirit
+was
+laboring
+under
+such
+great
+mental
+excitement
+that
+he
+suddenly
+lost
+control
+before
+I
+could
+ascertain
+any
+particulars
+On
+February
+the
+spirit
+of
+Mr
+Thaw
+returned
+and
+reiterated
+his
+statement
+that
+Harry
+was
+a
+psychic
+sensitive
+who
+was
+frequently
+subject
+to
+the
+influence
+of
+mischievous
+spirits
+He
+also
+urged
+upon
+humanity
+the
+great
+need
+for
+inquiry
+into
+the
+subject
+of
+spirit
+influence
+saying
+that
+a
+proper
+understanding
+would
+prevent
+untold
+misery
+to
+both
+spirits
+and
+their
+unfortunate
+mortal
+victims
+That
+Richard
+Ivens
+hung
+for
+the
+murder
+of
+Mrs
+Bessie
+Hollister
+in
+Chicago
+was
+a
+victim
+of
+foreign
+influences
+was
+so
+evident
+that
+alienists
+criminologists
+and
+psychologists
+alike
+declared
+their
+belief
+that
+Ivens
+was
+innocent
+and
+that
+he
+had
+confessed
+the
+crime
+under
+the
+hypnotic
+suggestion
+of
+some
+unknown
+person
+Ivens
+would
+alternately
+confess
+his
+guilt
+saying
+with
+a
+strange
+trance
+like
+stare
+that
+a
+big
+man
+had
+compelled
+him
+to
+commit
+the
+deed
+and
+then
+again
+wildly
+deny
+it
+Hugo
+Munsterburg
+M
+D
+Professor
+of
+Psychology
+Harvard
+University
+wrote
+in
+June
+It
+is
+an
+interesting
+and
+yet
+rather
+clear
+case
+of
+dissociation
+and
+auto
+suggestion
+The
+witches
+of
+the
+seventeenth
+century
+were
+burned
+on
+account
+of
+similar
+confessions
+and
+the
+popular
+understanding
+of
+mental
+aberrations
+has
+not
+made
+much
+progress
+since
+that
+time
+Professor
+William
+James
+of
+Harvard
+wrote
+Whether
+guilty
+or
+not
+Ivens
+must
+have
+been
+in
+a
+state
+of
+dissociated
+personality
+He
+was
+not
+his
+natural
+self
+during
+those
+fateful
+first
+days
+but
+the
+victim
+of
+one
+of
+those
+rare
+alterations
+of
+personality
+either
+suggested
+or
+spontaneous
+which
+are
+now
+well
+known
+to
+occur
+in
+predisposed
+subjects
+We
+present
+a
+sequel
+to
+this
+tragic
+story
+EXPERIENCE
+MARCH
+Spirit
+RICHARD
+IVENS
+Psychic
+MRS
+WICKLAND
+When
+the
+spirit
+assumed
+control
+the
+psychic
+fell
+to
+the
+floor
+apparently
+lifeless
+and
+only
+after
+half
+an
+hour
+of
+strenuous
+effort
+was
+the
+intelligence
+brought
+to
+consciousness
+Leave
+me
+alone
+he
+moaned
+do
+you
+want
+to
+hang
+me
+again
+He
+complained
+of
+having
+great
+pain
+in
+the
+neck
+and
+begged
+to
+be
+left
+undisturbed
+saying
+he
+wanted
+only
+to
+sleep
+What
+is
+the
+trouble
+with
+your
+neck
+It
+is
+broken
+They
+hanged
+me
+and
+I
+am
+dead
+I
+want
+to
+remain
+dead
+if
+you
+bring
+me
+to
+life
+they
+will
+hang
+me
+again
+What
+is
+your
+name
+Richard
+Ivens
+Were
+you
+guilty
+of
+the
+murder
+of
+Mrs
+Hollister
+I
+do
+not
+know
+Others
+said
+I
+was
+If
+I
+did
+it
+I
+do
+not
+know
+it
+Why
+did
+you
+plead
+guilty
+at
+times
+and
+then
+again
+deny
+your
+confession
+I
+pleaded
+guilty
+because
+those
+three
+fellows
+spirits
+made
+me
+The
+big
+man
+stood
+over
+me
+with
+a
+knife
+and
+threatened
+to
+kill
+me
+if
+I
+would
+not
+plead
+guilty
+When
+the
+big
+man
+was
+not
+there
+I
+told
+them
+that
+I
+did
+not
+know
+whether
+I
+killed
+the
+lady
+or
+not
+I
+told
+it
+to
+the
+police
+I
+told
+it
+to
+the
+jailer
+and
+to
+everybody
+that
+questioned
+me
+but
+they
+would
+not
+believe
+me
+when
+I
+told
+them
+the
+truth
+I
+have
+suffered
+so
+much
+Why
+did
+you
+call
+me
+back
+when
+I
+was
+dead
+Why
+didn
+t
+you
+let
+me
+sleep
+They
+will
+arrest
+me
+and
+hang
+me
+again
+Suddenly
+the
+spirit
+shouted
+with
+fright
+Don
+t
+you
+see
+There
+is
+that
+big
+man
+again
+He
+has
+his
+knife
+and
+the
+two
+short
+fellows
+are
+with
+him
+Oh
+Clutching
+his
+knee
+he
+cried
+My
+knee
+He
+has
+driven
+the
+knife
+through
+my
+knee
+and
+through
+the
+other
+leg
+My
+leg
+My
+leg
+He
+is
+the
+devil
+He
+has
+stabbed
+me
+The
+terrified
+spirit
+was
+gradually
+made
+to
+understand
+that
+his
+tormentors
+were
+spirits
+that
+he
+was
+free
+from
+his
+physical
+body
+and
+beyond
+the
+power
+of
+bodily
+harm
+You
+are
+using
+a
+body
+not
+your
+own
+and
+need
+now
+to
+free
+yourself
+from
+all
+mental
+delusions
+Do
+you
+not
+see
+other
+spirits
+beside
+your
+enemies
+Why
+yes
+there
+are
+others
+now
+they
+seem
+to
+be
+friendly
+and
+there
+there
+s
+Mrs
+Hollister
+Ask
+the
+man
+with
+the
+knife
+why
+he
+hounds
+you
+I
+suggested
+He
+only
+grins
+Ask
+him
+why
+he
+wanted
+to
+kill
+the
+lady
+He
+says
+because
+he
+hates
+women
+he
+stopped
+abruptly
+and
+breathless
+seemed
+to
+be
+watching
+a
+scene
+of
+great
+disturbance
+They
+have
+taken
+those
+devils
+away
+It
+was
+a
+lively
+fight
+but
+they
+got
+them
+Calming
+himself
+he
+said
+I
+feel
+better
+now
+I
+am
+so
+glad
+that
+terrible
+man
+is
+gone
+Asked
+to
+recall
+what
+he
+could
+of
+the
+Hollister
+tragedy
+he
+said
+When
+I
+saw
+the
+woman
+that
+night
+I
+also
+saw
+the
+big
+man
+My
+head
+began
+to
+feel
+very
+strange
+I
+was
+grabbed
+by
+the
+throat
+and
+lost
+consciousness
+When
+I
+came
+to
+myself
+again
+the
+big
+man
+said
+that
+I
+had
+killed
+the
+woman
+I
+had
+known
+the
+man
+for
+about
+a
+month
+but
+I
+did
+not
+know
+he
+was
+a
+spirit
+He
+has
+been
+hounding
+me
+ever
+since
+Why
+didn
+t
+they
+give
+me
+a
+chance
+to
+live
+even
+if
+I
+would
+have
+been
+in
+prison
+Oh
+the
+shame
+I
+have
+brought
+upon
+my
+family
+I
+feel
+so
+sorry
+for
+my
+poor
+mother
+if
+she
+could
+only
+know
+the
+truth
+If
+I
+could
+only
+speak
+to
+her
+and
+tell
+her
+that
+I
+could
+not
+help
+it
+that
+I
+did
+not
+do
+it
+Nobody
+had
+any
+sympathy
+for
+me
+and
+nobody
+would
+believe
+me
+when
+I
+told
+them
+about
+the
+big
+fellow
+standing
+over
+me
+with
+the
+knife
+He
+made
+me
+plead
+guilty
+If
+I
+committed
+the
+crime
+I
+am
+sorry
+for
+it
+but
+I
+don
+t
+know
+that
+I
+have
+done
+it
+Why
+did
+they
+kill
+me
+After
+I
+had
+explained
+the
+continuity
+of
+life
+and
+progression
+into
+higher
+spiritual
+realms
+he
+eagerly
+asked
+If
+they
+did
+not
+kill
+me
+is
+the
+lady
+still
+alive
+also
+Certainly
+doubtless
+she
+has
+come
+here
+to
+forgive
+you
+Although
+you
+destroyed
+her
+physical
+body
+you
+were
+not
+responsible
+for
+the
+act
+you
+were
+merely
+used
+by
+wicked
+spirits
+who
+hypnotized
+you
+With
+this
+new
+understanding
+the
+weary
+spirit
+was
+taken
+in
+charge
+by
+invisible
+helpers
+who
+told
+us
+that
+the
+Big
+Man
+and
+his
+accomplices
+had
+in
+earth
+life
+belonged
+to
+a
+band
+of
+White
+Caps
+which
+had
+operated
+extensively
+for
+some
+years
+in
+England
+and
+America
+mutilating
+and
+killing
+many
+women
+in
+their
+criminal
+mania
+Several
+months
+later
+the
+spirit
+of
+the
+Big
+Man
+himself
+was
+brought
+to
+our
+circle
+EXPERIENCE
+JUNE
+Spirit
+CHARLES
+THE
+FIGHTER
+Psychic
+MRS
+WICKLAND
+The
+spirit
+seemed
+stupefied
+by
+drink
+and
+when
+finally
+aroused
+was
+so
+pugnacious
+that
+the
+aid
+of
+several
+persons
+was
+required
+to
+quiet
+him
+I
+m
+Charles
+The
+Fighter
+and
+I
+ll
+have
+you
+all
+shot
+he
+shouted
+Turning
+to
+some
+other
+invisibles
+he
+cursed
+them
+for
+having
+lured
+him
+to
+this
+place
+and
+commanded
+them
+to
+help
+him
+instead
+of
+standing
+idly
+by
+Subdued
+at
+last
+Charles
+The
+Fighter
+was
+compelled
+to
+listen
+to
+an
+elucidation
+of
+his
+real
+situation
+In
+an
+endeavor
+to
+convince
+him
+that
+he
+was
+controlling
+the
+body
+of
+another
+he
+was
+asked
+to
+examine
+the
+hands
+of
+the
+psychic
+Seeing
+the
+hand
+of
+a
+woman
+he
+shrank
+back
+terror
+stricken
+and
+cried
+Take
+that
+hand
+away
+Take
+it
+away
+I
+don
+t
+want
+to
+see
+it
+any
+more
+Questioned
+regarding
+the
+story
+of
+the
+hand
+he
+declared
+I
+shall
+never
+tell
+I
+would
+rather
+die
+Oh
+There
+is
+her
+face
+too
+And
+the
+hand
+that
+I
+cut
+off
+to
+get
+the
+diamond
+ring
+They
+haunted
+me
+all
+this
+time
+Looking
+about
+in
+horror
+he
+seemed
+to
+see
+a
+vast
+gathering
+of
+specters
+See
+all
+those
+faces
+Have
+I
+killed
+all
+those
+people
+Have
+they
+come
+to
+accuse
+me
+There
+There
+is
+that
+boy
+He
+was
+hung
+once
+but
+he
+seems
+to
+be
+after
+me
+too
+Ivens
+I
+killed
+the
+woman
+but
+I
+made
+him
+confess
+to
+save
+my
+own
+neck
+But
+just
+wait
+you
+devil
+you
+I
+will
+fix
+you
+when
+I
+get
+out
+of
+this
+I
+will
+cut
+you
+all
+to
+pieces
+But
+at
+last
+Charles
+The
+Fighter
+realized
+that
+further
+resistance
+was
+useless
+and
+that
+his
+days
+of
+robbery
+and
+murder
+were
+over
+He
+told
+of
+his
+hideous
+career
+of
+crime
+and
+said
+that
+he
+murdered
+for
+revenge
+stole
+to
+buy
+whiskey
+and
+drank
+to
+drown
+his
+conscience
+and
+to
+escape
+the
+specters
+which
+constantly
+haunted
+him
+In
+early
+childhood
+he
+had
+been
+happy
+under
+the
+care
+of
+his
+own
+mother
+but
+after
+her
+death
+his
+stepmother
+had
+abused
+him
+so
+mercilessly
+that
+he
+often
+rushed
+sobbing
+to
+his
+room
+and
+on
+his
+knees
+prayed
+to
+his
+dead
+mother
+for
+help
+This
+roused
+the
+stepmother
+to
+a
+jealous
+fury
+and
+regardless
+of
+the
+protests
+of
+a
+weak
+father
+she
+had
+beaten
+him
+angrily
+forbidding
+him
+to
+ever
+mention
+the
+name
+of
+his
+mother
+again
+Her
+abuse
+grew
+into
+such
+a
+cruel
+tyranny
+that
+the
+boy
+had
+developed
+an
+over
+powering
+hatred
+for
+her
+and
+revengefully
+vowed
+that
+when
+he
+was
+grown
+he
+would
+kill
+every
+woman
+possible
+Consistently
+he
+had
+carried
+out
+his
+ghastly
+purpose
+and
+had
+given
+his
+entire
+life
+to
+plotting
+and
+perpetrating
+atrocities
+and
+crimes
+generally
+victimizing
+women
+Ile
+had
+died
+in
+during
+a
+wild
+fight
+with
+his
+companions
+but
+he
+had
+not
+been
+aware
+of
+the
+loss
+of
+his
+physical
+body
+He
+boasted
+that
+for
+many
+years
+he
+had
+continued
+his
+crimes
+always
+eluding
+the
+police
+Once
+in
+Boston
+I
+wanted
+to
+kill
+a
+policeman
+but
+when
+I
+sneaked
+up
+behind
+him
+and
+hit
+him
+on
+the
+head
+with
+a
+club
+the
+club
+went
+right
+through
+him
+and
+never
+hurt
+him
+He
+didn
+t
+even
+turn
+around
+The
+spirit
+thought
+himself
+now
+in
+the
+hands
+of
+authorities
+but
+declared
+that
+he
+was
+willing
+to
+give
+himself
+up
+to
+escape
+the
+haunting
+faces
+of
+his
+many
+victims
+I
+would
+be
+glad
+to
+go
+to
+bell
+to
+get
+away
+from
+this
+torment
+While
+listening
+to
+an
+explanation
+of
+the
+law
+of
+cause
+and
+effect
+and
+the
+conditions
+prevailing
+in
+the
+spirit
+world
+Charles
+saw
+his
+own
+mother
+standing
+before
+him
+The
+sight
+of
+her
+had
+an
+overwhelming
+effect
+the
+hardened
+criminal
+cowered
+in
+his
+seat
+and
+wept
+piteously
+while
+his
+mother
+pleaded
+with
+him
+to
+come
+with
+her
+and
+learn
+to
+expiate
+his
+crimes
+I
+Crushed
+by
+guilt
+and
+remorse
+he
+cried
+abjectly
+I
+cannot
+go
+with
+you
+Dear
+mother
+don
+t
+ask
+me
+to
+go
+with
+you
+You
+must
+go
+back
+to
+Heaven
+and
+I
+must
+go
+to
+hell
+where
+I
+belong
+I
+must
+be
+cut
+to
+pieces
+and
+burned
+in
+the
+fires
+of
+hell
+But
+maternal
+love
+prevailed
+and
+the
+spirit
+humble
+and
+penitent
+followed
+his
+mother
+in
+Harry
+Hayward
+a
+handsome
+reprobate
+with
+a
+weakness
+for
+beautiful
+women
+and
+a
+life
+of
+gaiety
+hired
+a
+villain
+to
+murder
+his
+sweetheart
+in
+Minnesota
+and
+was
+hanged
+While
+he
+was
+in
+prison
+awaiting
+execution
+he
+maintained
+his
+debonair
+attitude
+to
+the
+last
+played
+cards
+with
+his
+jailer
+with
+the
+utmost
+nonchalance
+and
+ordered
+ice
+cream
+his
+favorite
+dish
+whenever
+possible
+When
+you
+come
+to
+hell
+where
+I
+am
+going
+he
+told
+the
+jailer
+I
+am
+going
+to
+treat
+you
+to
+ice
+cream
+During
+this
+time
+I
+anonymously
+sent
+him
+a
+book
+and
+several
+papers
+relating
+to
+the
+spirit
+world
+but
+otherwise
+had
+no
+connection
+with
+him
+On
+February
+a
+nurse
+asked
+us
+to
+concentrate
+for
+Mrs
+McA
+a
+patient
+whom
+she
+was
+attending
+arid
+whose
+case
+strongly
+suggested
+psychic
+invalidism
+chronic
+illness
+and
+lassitude
+due
+to
+spirit
+obsession
+The
+nurse
+was
+a
+psychic
+sensitive
+herself
+and
+surmised
+that
+many
+of
+the
+uncontrollable
+notions
+of
+her
+beautiful
+patient
+were
+caused
+by
+spirit
+obsession
+and
+had
+several
+times
+endeavored
+to
+order
+any
+intruder
+away
+One
+day
+Mrs
+McA
+developed
+an
+intense
+desire
+for
+homemade
+ice
+cream
+although
+ordinarily
+she
+did
+not
+care
+in
+the
+least
+for
+it
+But
+she
+insisted
+that
+her
+whim
+be
+satisfied
+at
+once
+putting
+her
+maids
+to
+a
+great
+deal
+of
+inconvenience
+When
+the
+nurse
+entered
+the
+room
+with
+the
+ice
+cream
+she
+had
+a
+sudden
+feeling
+that
+some
+one
+had
+rushed
+upon
+her
+and
+the
+next
+instant
+was
+seized
+by
+so
+strong
+a
+feeling
+of
+choking
+that
+she
+was
+forced
+to
+leave
+the
+room
+Upon
+recovery
+she
+returned
+and
+convinced
+of
+the
+presence
+of
+a
+spirit
+flung
+a
+window
+open
+and
+silently
+ordered
+any
+foreign
+entity
+present
+to
+leave
+the
+house
+This
+nurse
+and
+Mrs
+McA
+s
+maid
+attended
+our
+circle
+that
+evening
+and
+the
+controlling
+spirit
+at
+once
+complained
+of
+pain
+in
+See
+Chap
+Page
+Spirit
+Grace
+Brusted
+Patient
+Mrs
+MCA
+the
+neck
+readily
+explaining
+that
+his
+neck
+had
+been
+broken
+when
+Ile
+was
+hung
+and
+said
+his
+name
+was
+Harry
+Hayward
+Can
+t
+you
+give
+me
+some
+ice
+cream
+I
+have
+tried
+and
+tried
+to
+get
+some
+and
+today
+I
+could
+almost
+taste
+it
+but
+I
+couldn
+t
+quite
+get
+it
+I
+was
+chased
+away
+by
+a
+woman
+she
+threw
+me
+out
+of
+the
+window
+I
+don
+t
+like
+to
+be
+thrown
+out
+of
+a
+window
+by
+a
+woman
+Hayward
+realized
+that
+he
+was
+hovering
+around
+the
+earth
+as
+a
+spirit
+and
+when
+we
+inquired
+how
+he
+had
+learned
+about
+spirit
+life
+he
+replied
+that
+while
+he
+was
+in
+jail
+he
+had
+read
+of
+it
+in
+some
+literature
+which
+had
+been
+sent
+him
+by
+an
+unknown
+person
+He
+complained
+that
+no
+matter
+where
+he
+went
+no
+one
+would
+take
+any
+notice
+of
+him
+when
+he
+took
+a
+seat
+in
+a
+train
+some
+one
+would
+come
+along
+and
+sit
+down
+on
+his
+lap
+and
+he
+would
+be
+powerless
+to
+move
+He
+was
+very
+pleased
+to
+be
+able
+to
+converse
+with
+people
+again
+and
+asked
+many
+questions
+about
+the
+various
+persons
+concerned
+with
+his
+trial
+and
+execution
+inquiring
+particularly
+about
+the
+guard
+with
+whom
+he
+had
+spent
+a
+great
+deal
+of
+time
+playing
+cards
+I
+was
+under
+the
+impression
+that
+this
+guard
+had
+died
+some
+time
+before
+and
+informed
+the
+spirit
+so
+suggesting
+that
+possibly
+he
+might
+be
+able
+to
+see
+him
+in
+the
+spirit
+world
+He
+was
+silent
+a
+moment
+endeavoring
+to
+trace
+his
+former
+friend
+then
+said
+emphatically
+No
+that
+man
+is
+not
+dead
+I
+see
+him
+playing
+cards
+at
+his
+son
+s
+home
+in
+Minneapolis
+Hayward
+was
+readily
+enlightened
+concerning
+the
+higher
+life
+and
+left
+expressing
+a
+willingness
+to
+progress
+in
+the
+spirit
+world
+The
+psychic
+invalid
+showed
+marked
+changes
+for
+the
+better
+after
+this
+and
+subsequent
+correspondence
+proved
+Hayward
+s
+statement
+about
+the
+old
+guard
+to
+be
+true
+The
+latter
+was
+living
+and
+on
+the
+evening
+of
+our
+experience
+with
+Hayward
+had
+been
+playing
+cards
+in
+his
+son
+s
+home
+Ten
+years
+later
+after
+the
+spirit
+of
+another
+murderer
+who
+was
+hung
+had
+been
+in
+our
+circle
+Hayward
+returned
+and
+told
+something
+of
+his
+earth
+life
+EXPERIENCE
+SEPTEMBER
+Spirit
+HARRY
+HAYWARD
+Psychic
+MRS
+WICKLAND
+I
+think
+I
+should
+like
+to
+come
+in
+and
+say
+something
+for
+I
+feel
+I
+have
+been
+in
+the
+same
+boat
+as
+the
+fellow
+who
+preceded
+me
+I
+mean
+on
+the
+same
+platform
+I
+feel
+but
+little
+better
+than
+he
+I
+had
+a
+little
+more
+understanding
+than
+he
+had
+and
+therefore
+my
+punishment
+was
+a
+little
+harder
+I
+had
+education
+and
+all
+the
+money
+I
+needed
+but
+I
+wanted
+more
+I
+also
+want
+to
+tell
+you
+that
+since
+I
+have
+come
+to
+the
+spirit
+side
+of
+life
+I
+have
+wished
+I
+could
+go
+on
+every
+street
+corner
+and
+shout
+a
+message
+to
+mothers
+not
+to
+raise
+their
+children
+in
+the
+wrong
+way
+Mothers
+say
+they
+love
+their
+children
+they
+worship
+them
+and
+they
+let
+them
+go
+astray
+because
+they
+cannot
+say
+No
+to
+them
+Do
+not
+raise
+children
+without
+discipline
+Train
+children
+as
+you
+train
+animals
+as
+you
+train
+flowers
+If
+you
+plant
+a
+flower
+in
+your
+garden
+you
+don
+t
+want
+it
+to
+grow
+up
+wild
+but
+you
+train
+it
+so
+that
+it
+will
+grow
+successfully
+and
+have
+graceful
+flowers
+But
+how
+little
+does
+humanity
+think
+of
+the
+children
+s
+growth
+and
+training
+children
+are
+not
+trained
+to
+become
+blossoms
+for
+humanity
+I
+tell
+you
+if
+my
+mother
+I
+do
+not
+condemn
+her
+by
+any
+means
+had
+trained
+me
+properly
+so
+that
+she
+could
+have
+said
+No
+to
+me
+instead
+of
+worshipping
+me
+and
+letting
+me
+have
+all
+the
+money
+I
+wanted
+and
+if
+she
+had
+punished
+me
+when
+I
+did
+wrong
+I
+would
+have
+been
+different
+No
+I
+would
+not
+have
+been
+hung
+if
+my
+mother
+had
+taught
+me
+the
+beautiful
+lesson
+of
+living
+for
+others
+and
+of
+loving
+my
+fellow
+man
+as
+myself
+If
+mothers
+would
+think
+of
+their
+children
+s
+welfare
+and
+raise
+them
+in
+the
+beautiful
+thought
+of
+living
+for
+others
+they
+would
+all
+be
+better
+I
+lived
+a
+very
+sporty
+life
+Nobody
+taught
+me
+any
+other
+I
+had
+a
+very
+good
+time
+and
+I
+liked
+the
+girls
+pretty
+well
+but
+there
+came
+a
+time
+when
+I
+spent
+more
+money
+than
+my
+father
+allowed
+me
+to
+have
+I
+was
+only
+a
+young
+man
+and
+I
+should
+have
+been
+made
+to
+work
+My
+misfortune
+was
+that
+my
+mother
+and
+father
+were
+rich
+Work
+was
+a
+disgrace
+for
+me
+they
+thought
+It
+would
+have
+been
+far
+better
+if
+they
+had
+put
+me
+to
+work
+instead
+of
+giving
+me
+money
+each
+time
+I
+asked
+for
+it
+I
+commenced
+to
+gamble
+You
+know
+when
+you
+get
+into
+that
+game
+it
+is
+hard
+to
+quit
+Money
+came
+too
+easy
+for
+me
+I
+met
+a
+young
+lady
+whom
+I
+liked
+Young
+girls
+always
+were
+sweet
+to
+me
+and
+I
+was
+able
+to
+have
+whoever
+I
+wanted
+The
+young
+lady
+liked
+me
+and
+I
+liked
+her
+for
+what
+I
+got
+from
+her
+so
+we
+decided
+that
+she
+would
+insure
+herself
+for
+in
+my
+name
+I
+had
+a
+scheme
+If
+somebody
+killed
+her
+I
+would
+not
+get
+the
+blame
+but
+I
+would
+get
+the
+money
+I
+laid
+a
+bold
+scheme
+I
+hired
+a
+man
+to
+kill
+her
+At
+the
+time
+the
+deed
+was
+to
+be
+committed
+I
+took
+another
+girl
+to
+the
+theater
+because
+I
+thought
+that
+whatever
+happened
+blame
+could
+not
+then
+be
+attached
+to
+me
+I
+hired
+a
+man
+to
+take
+her
+for
+a
+buggy
+ride
+out
+to
+Lake
+Calhoun
+and
+he
+was
+to
+kill
+her
+When
+they
+got
+to
+the
+woods
+the
+man
+killed
+her
+and
+came
+home
+Being
+in
+the
+theater
+the
+girl
+I
+was
+with
+could
+testify
+I
+was
+not
+at
+the
+scene
+of
+the
+killing
+but
+you
+know
+I
+was
+so
+crazy
+to
+get
+hold
+of
+the
+insurance
+money
+that
+I
+never
+thought
+how
+it
+looked
+to
+go
+to
+the
+insurance
+office
+so
+soon
+after
+the
+death
+and
+they
+became
+suspicious
+and
+finally
+caught
+me
+If
+I
+had
+only
+waited
+a
+week
+or
+two
+they
+would
+never
+have
+surmised
+anything
+about
+me
+I
+was
+arrested
+My
+mother
+loved
+me
+so
+much
+that
+she
+tried
+to
+put
+the
+blame
+on
+my
+other
+brother
+He
+was
+married
+and
+had
+two
+children
+The
+trial
+cost
+my
+parents
+a
+whole
+lot
+of
+money
+and
+lasted
+months
+and
+months
+before
+they
+could
+make
+any
+headway
+They
+could
+not
+decide
+whether
+it
+was
+Eddie
+or
+I
+that
+should
+be
+hung
+for
+the
+deed
+One
+day
+while
+I
+was
+in
+jail
+there
+came
+a
+little
+pamphlet
+for
+me
+and
+some
+papers
+all
+about
+the
+spirit
+world
+I
+knew
+I
+had
+to
+go
+for
+finally
+I
+had
+been
+sentenced
+to
+be
+hung
+I
+realized
+my
+trouble
+The
+papers
+interested
+me
+very
+much
+and
+I
+thought
+I
+should
+like
+to
+know
+what
+the
+spirit
+world
+was
+I
+believed
+in
+it
+in
+a
+way
+and
+in
+another
+way
+I
+didn
+t
+The
+doctrine
+was
+better
+than
+the
+church
+had
+taught
+but
+for
+a
+while
+I
+treated
+it
+more
+as
+a
+joke
+I
+talked
+about
+it
+quite
+a
+little
+to
+the
+watchman
+but
+when
+the
+time
+came
+for
+me
+to
+be
+hung
+I
+shrank
+from
+it
+It
+is
+a
+very
+strange
+sensation
+when
+you
+think
+you
+are
+going
+to
+the
+gallows
+and
+your
+life
+will
+be
+snapped
+out
+you
+cannot
+imagine
+how
+it
+feels
+You
+cannot
+imagine
+the
+sensation
+you
+have
+when
+you
+realize
+that
+you
+have
+only
+a
+few
+hours
+to
+live
+Still
+the
+little
+message
+which
+had
+been
+sent
+to
+me
+gave
+me
+a
+little
+courage
+and
+I
+thought
+probably
+only
+my
+body
+would
+be
+destroyed
+and
+not
+my
+spirit
+So
+at
+the
+last
+moment
+I
+kept
+up
+my
+courage
+and
+felt
+that
+I
+wanted
+to
+see
+What
+the
+hereafter
+was
+I
+have
+to
+thank
+the
+one
+who
+sent
+me
+that
+pamphlet
+because
+it
+was
+a
+bright
+cheerful
+spot
+to
+me
+at
+the
+last
+of
+my
+days
+When
+I
+realized
+that
+I
+had
+passed
+out
+of
+my
+body
+my
+first
+thought
+was
+I
+am
+not
+dead
+I
+went
+to
+my
+mother
+and
+I
+spoke
+to
+her
+and
+she
+felt
+my
+presence
+I
+still
+clung
+to
+my
+body
+however
+and
+I
+felt
+I
+could
+not
+leave
+it
+I
+got
+out
+of
+it
+quickly
+but
+I
+went
+back
+to
+it
+again
+When
+my
+body
+was
+cremated
+I
+stood
+by
+and
+saw
+it
+burned
+After
+that
+I
+walked
+around
+but
+I
+could
+not
+find
+the
+spirit
+world
+I
+walked
+and
+walked
+from
+one
+place
+to
+another
+I
+still
+had
+my
+feeling
+for
+nice
+pretty
+women
+so
+I
+traveled
+In
+a
+way
+I
+realized
+that
+I
+was
+dead
+yet
+I
+did
+not
+fully
+realize
+it
+One
+time
+I
+felt
+I
+would
+like
+to
+take
+a
+journey
+and
+I
+wanted
+to
+travel
+by
+train
+I
+went
+to
+the
+ticket
+office
+to
+get
+a
+ticket
+but
+I
+had
+no
+money
+I
+thought
+I
+would
+talk
+to
+the
+agent
+nicely
+and
+he
+would
+give
+me
+a
+ticket
+but
+he
+paid
+no
+attention
+to
+me
+So
+I
+thought
+All
+right
+I
+m
+going
+on
+the
+train
+anyway
+so
+on
+I
+got
+I
+sat
+down
+on
+one
+of
+the
+seats
+and
+before
+I
+knew
+it
+a
+great
+big
+fat
+man
+sat
+right
+down
+on
+my
+lap
+I
+got
+real
+mad
+I
+tried
+to
+push
+him
+off
+but
+I
+could
+not
+and
+I
+could
+not
+get
+up
+either
+I
+had
+to
+let
+that
+man
+sit
+on
+me
+until
+he
+was
+ready
+to
+get
+off
+the
+train
+I
+had
+not
+learned
+the
+power
+of
+thought
+to
+think
+myself
+away
+I
+had
+only
+learned
+to
+walk
+I
+had
+not
+yet
+learned
+the
+little
+thought
+lesson
+to
+think
+myself
+in
+a
+place
+in
+order
+to
+be
+there
+Before
+long
+I
+came
+to
+a
+beautiful
+lady
+Mrs
+McA
+and
+I
+commenced
+to
+like
+her
+Before
+I
+knew
+it
+I
+was
+in
+her
+magnetic
+aura
+and
+I
+could
+not
+get
+away
+She
+wanted
+to
+be
+in
+bed
+all
+the
+time
+and
+there
+I
+was
+Once
+I
+heard
+some
+one
+say
+You
+must
+leave
+this
+lady
+and
+go
+away
+if
+there
+is
+any
+spirit
+around
+her
+it
+must
+leave
+and
+go
+away
+I
+was
+there
+however
+I
+was
+very
+fond
+of
+ice
+cream
+and
+I
+wanted
+some
+so
+I
+impressed
+the
+lady
+to
+ask
+for
+it
+When
+it
+was
+brought
+in
+I
+wanted
+it
+I
+seemed
+to
+come
+in
+contact
+with
+the
+lady
+who
+was
+carrying
+it
+and
+I
+felt
+that
+if
+I
+could
+only
+get
+a
+good
+hold
+of
+her
+I
+would
+get
+the
+cream
+All
+at
+once
+I
+was
+a
+lady
+myself
+and
+when
+I
+tried
+to
+get
+that
+ice
+cream
+I
+had
+the
+same
+sensation
+that
+had
+when
+I
+was
+hung
+But
+the
+lady
+who
+was
+carrying
+the
+ice
+cream
+had
+such
+power
+that
+before
+I
+knew
+it
+she
+had
+thrown
+me
+out
+of
+the
+window
+bodily
+mind
+you
+I
+have
+to
+thank
+you
+for
+delivering
+me
+from
+all
+that
+trouble
+and
+also
+want
+to
+thank
+you
+from
+the
+bottom
+of
+my
+heart
+for
+the
+sermon
+you
+gave
+me
+at
+that
+time
+which
+helped
+me
+to
+an
+understanding
+of
+the
+beautiful
+world
+beyond
+I
+wish
+again
+that
+I
+could
+stand
+on
+every
+street
+corner
+and
+tell
+the
+mothers
+to
+raise
+their
+children
+to
+be
+good
+men
+and
+women
+and
+when
+necessary
+punish
+them
+while
+they
+are
+little
+and
+not
+spare
+the
+rod
+and
+spoil
+the
+child
+If
+mothers
+raised
+their
+children
+properly
+there
+would
+not
+be
+the
+selfishness
+there
+is
+in
+the
+world
+I
+have
+a
+nice
+little
+home
+in
+the
+spirit
+world
+now
+and
+I
+have
+much
+to
+do
+for
+my
+work
+is
+not
+yet
+done
+I
+am
+trying
+to
+extend
+help
+to
+all
+those
+who
+wish
+help
+I
+thank
+you
+for
+enlightening
+me
+in
+the
+first
+place
+Good
+Night
+The
+Car
+Barn
+Murderer
+of
+Chicago
+was
+a
+criminal
+of
+a
+different
+type
+a
+victim
+of
+his
+environment
+and
+was
+brought
+to
+our
+circle
+some
+time
+after
+his
+execution
+when
+he
+followed
+a
+girl
+formerly
+a
+family
+neighbor
+who
+came
+to
+visit
+Mrs
+Wickland
+He
+returned
+several
+times
+after
+that
+to
+tell
+his
+story
+and
+to
+bring
+earthbound
+spirits
+of
+similar
+experiences
+to
+an
+understanding
+EXPERIENCE
+SEPTEMBER
+Spirit
+PETE
+NEIDEMEYER
+Psychic
+MRS
+WICKLAND
+I
+want
+to
+come
+here
+tonight
+to
+tell
+you
+that
+I
+also
+am
+one
+who
+is
+very
+thankful
+to
+you
+although
+you
+probably
+do
+not
+care
+whether
+I
+come
+again
+or
+not
+But
+I
+do
+know
+you
+helped
+me
+to
+something
+like
+happiness
+which
+I
+thought
+never
+could
+be
+mine
+I
+was
+nothing
+but
+a
+wild
+beast
+in
+earth
+life
+but
+still
+when
+you
+do
+not
+give
+children
+proper
+training
+how
+can
+you
+expect
+to
+have
+good
+men
+I
+had
+no
+training
+at
+all
+My
+mother
+was
+very
+wild
+and
+did
+not
+care
+what
+became
+of
+her
+children
+She
+thought
+Let
+them
+take
+care
+of
+themselves
+So
+you
+go
+out
+in
+company
+with
+others
+and
+get
+into
+first
+one
+game
+then
+another
+Sometimes
+you
+go
+to
+church
+I
+didn
+t
+believe
+in
+that
+old
+story
+about
+Christ
+I
+could
+not
+believe
+it
+and
+I
+thought
+there
+was
+no
+such
+thing
+as
+what
+they
+taught
+about
+Christ
+and
+if
+there
+was
+what
+did
+I
+care
+I
+walked
+in
+the
+path
+of
+evil
+from
+the
+time
+I
+was
+a
+little
+boy
+until
+I
+got
+where
+I
+could
+not
+live
+any
+longer
+whether
+I
+wanted
+to
+or
+not
+I
+will
+tell
+you
+if
+you
+have
+children
+please
+give
+them
+an
+understanding
+when
+they
+are
+little
+If
+they
+take
+anything
+from
+a
+person
+make
+them
+take
+it
+back
+where
+they
+got
+it
+Don
+t
+let
+them
+get
+the
+idea
+that
+you
+will
+take
+it
+from
+them
+and
+think
+it
+is
+all
+right
+If
+they
+steal
+once
+they
+will
+again
+if
+not
+properly
+taught
+When
+I
+stole
+my
+mother
+thought
+I
+was
+a
+smart
+boy
+I
+kept
+on
+going
+from
+bad
+to
+worse
+I
+belonged
+to
+a
+gang
+of
+about
+a
+dozen
+boys
+We
+got
+so
+bold
+and
+desperate
+that
+we
+did
+not
+care
+what
+became
+of
+us
+We
+got
+into
+all
+kinds
+of
+hold
+ups
+and
+the
+more
+we
+got
+into
+the
+better
+we
+liked
+it
+At
+last
+we
+held
+up
+and
+killed
+people
+The
+result
+was
+that
+we
+were
+caught
+and
+hung
+I
+am
+Neidemeyer
+and
+here
+I
+am
+Years
+ago
+I
+was
+brought
+to
+this
+circle
+through
+our
+neighbor
+girl
+I
+liked
+that
+girl
+very
+much
+One
+day
+she
+went
+away
+from
+home
+and
+I
+thought
+I
+would
+go
+with
+her
+I
+did
+nut
+realize
+that
+I
+had
+been
+hung
+I
+did
+not
+realize
+that
+I
+was
+dead
+I
+had
+gone
+home
+and
+had
+stayed
+there
+for
+a
+long
+time
+but
+I
+did
+not
+know
+that
+I
+was
+dead
+My
+mother
+was
+a
+strange
+woman
+but
+from
+what
+I
+have
+seen
+since
+I
+came
+to
+the
+spirit
+side
+of
+life
+I
+realize
+that
+she
+was
+obsessed
+Nobody
+could
+do
+anything
+with
+my
+mother
+My
+father
+and
+my
+brother
+were
+very
+good
+people
+but
+my
+mother
+and
+I
+were
+the
+black
+ones
+This
+neighbor
+girl
+was
+good
+and
+she
+always
+tried
+to
+do
+the
+best
+for
+me
+that
+she
+could
+The
+day
+I
+followed
+her
+she
+went
+to
+this
+man
+s
+house
+Dr
+W
+and
+she
+went
+into
+a
+little
+room
+and
+spoke
+with
+the
+psychic
+through
+whom
+I
+am
+talking
+now
+and
+I
+saw
+things
+that
+day
+that
+I
+had
+never
+seen
+before
+I
+did
+not
+know
+what
+they
+meant
+Somebody
+seemed
+to
+keep
+me
+there
+and
+I
+could
+not
+get
+away
+Before
+I
+knew
+much
+I
+was
+sitting
+in
+a
+little
+meeting
+I
+heard
+singing
+and
+before
+I
+realized
+it
+I
+was
+full
+of
+life
+again
+I
+could
+talk
+and
+my
+throat
+did
+not
+hurt
+me
+any
+more
+I
+began
+to
+wonder
+what
+had
+happened
+to
+me
+You
+talked
+to
+me
+so
+kindly
+that
+it
+helped
+me
+You
+talked
+to
+me
+about
+the
+real
+life
+on
+the
+other
+side
+You
+helped
+me
+to
+an
+understanding
+of
+life
+not
+what
+the
+church
+and
+ministers
+taught
+that
+we
+should
+pray
+to
+God
+and
+believe
+in
+the
+blood
+of
+Christ
+and
+that
+Christ
+died
+for
+our
+sins
+and
+that
+if
+we
+believe
+that
+we
+will
+go
+to
+Heaven
+I
+was
+not
+the
+kind
+that
+could
+go
+on
+that
+straight
+road
+because
+I
+felt
+that
+was
+too
+easy
+and
+I
+couldn
+t
+believe
+that
+we
+could
+get
+to
+Heaven
+without
+any
+effort
+on
+our
+part
+I
+knew
+I
+was
+bad
+yet
+I
+felt
+in
+my
+heart
+that
+I
+should
+do
+something
+to
+try
+and
+be
+good
+and
+do
+good
+for
+what
+I
+had
+done
+bad
+The
+thought
+of
+that
+seemed
+to
+be
+more
+reasonable
+than
+that
+of
+jumping
+from
+my
+bad
+condition
+right
+into
+Heaven
+I
+thought
+I
+would
+not
+be
+a
+very
+good
+example
+either
+You
+commenced
+to
+talk
+to
+me
+about
+the
+philosophy
+of
+God
+in
+a
+way
+I
+had
+never
+heard
+before
+and
+it
+appealed
+to
+my
+sense
+I
+hope
+somebody
+will
+talk
+in
+that
+way
+to
+my
+fellow
+men
+who
+are
+in
+the
+condition
+I
+was
+It
+would
+touch
+their
+hearts
+There
+are
+many
+of
+them
+who
+are
+not
+bad
+but
+nobody
+cares
+for
+them
+The
+majority
+of
+them
+do
+not
+believe
+in
+the
+Jesus
+Christ
+story
+As
+they
+are
+now
+they
+are
+going
+to
+the
+dogs
+Since
+I
+came
+to
+this
+little
+circle
+the
+first
+time
+and
+received
+help
+I
+have
+had
+my
+struggles
+It
+is
+years
+since
+I
+made
+my
+first
+appearance
+here
+I
+want
+to
+tell
+you
+what
+I
+have
+to
+do
+since
+my
+mother
+passed
+out
+I
+have
+tried
+and
+tried
+to
+bring
+her
+to
+an
+understanding
+of
+the
+truth
+but
+she
+will
+not
+listen
+I
+hope
+some
+day
+to
+be
+able
+to
+awaken
+her
+to
+a
+higher
+condition
+As
+we
+progress
+we
+go
+from
+circle
+to
+circle
+If
+I
+believed
+that
+Christ
+died
+for
+my
+sins
+that
+belief
+and
+creed
+would
+keep
+me
+out
+of
+the
+higher
+spirit
+world
+When
+I
+had
+passed
+out
+of
+my
+body
+you
+told
+me
+that
+I
+should
+look
+for
+spirit
+friends
+who
+would
+help
+me
+and
+that
+my
+first
+lesson
+would
+be
+to
+serve
+others
+I
+have
+had
+a
+very
+hard
+time
+The
+first
+thing
+I
+had
+to
+do
+was
+to
+conquer
+self
+and
+it
+is
+very
+hard
+to
+conquer
+selfishness
+when
+you
+have
+never
+thought
+of
+anything
+else
+but
+selfishness
+We
+must
+conquer
+that
+before
+we
+can
+do
+any
+work
+at
+all
+in
+the
+spirit
+world
+The
+best
+way
+is
+to
+be
+put
+in
+a
+dark
+room
+we
+sometimes
+call
+it
+a
+dungeon
+where
+we
+see
+nothing
+but
+ourselves
+and
+our
+acts
+of
+the
+past
+One
+after
+another
+these
+acts
+come
+crowding
+in
+The
+good
+ones
+are
+so
+few
+that
+they
+hardly
+count
+for
+anything
+When
+we
+do
+see
+a
+good
+act
+it
+seems
+as
+if
+it
+belongs
+to
+some
+one
+else
+We
+have
+to
+stay
+there
+until
+our
+hearts
+and
+eyes
+are
+opened
+When
+we
+seek
+to
+overcome
+our
+bad
+habits
+and
+to
+live
+for
+others
+then
+we
+get
+out
+of
+the
+selfish
+state
+My
+heart
+was
+very
+hardened
+but
+finally
+I
+cried
+out
+Not
+my
+will
+any
+longer
+but
+thine
+The
+first
+thing
+to
+be
+done
+is
+to
+help
+serve
+the
+very
+lowest
+we
+come
+in
+contact
+with
+I
+felt
+that
+I
+did
+not
+want
+to
+assist
+with
+this
+or
+that
+but
+I
+had
+to
+I
+had
+to
+learn
+patience
+When
+we
+can
+serve
+without
+grumbling
+and
+do
+it
+for
+the
+love
+of
+our
+fellow
+man
+it
+does
+not
+seem
+so
+hard
+So
+I
+have
+gone
+on
+and
+on
+from
+one
+thing
+to
+another
+always
+learning
+and
+through
+learning
+I
+have
+stepped
+into
+a
+more
+beautiful
+condition
+In
+the
+invisible
+world
+we
+advance
+by
+stages
+but
+only
+through
+learning
+I
+want
+to
+thank
+you
+tonight
+for
+the
+help
+you
+have
+given
+me
+I
+have
+a
+beautiful
+little
+home
+in
+the
+spirit
+world
+by
+this
+time
+and
+I
+am
+happy
+but
+my
+work
+is
+not
+done
+yet
+My
+work
+is
+to
+keep
+on
+helping
+those
+who
+need
+help
+and
+to
+try
+to
+influence
+the
+boys
+on
+earth
+not
+to
+do
+the
+mischief
+they
+Are
+planning
+but
+to
+try
+to
+be
+good
+and
+do
+the
+very
+best
+they
+know
+how
+for
+their
+fellow
+men
+Goodbye
+EXPERIENCE
+AUGUST
+Spirit
+PETE
+NEIDEMEYER
+Psychie
+MRS
+WICKLAND
+I
+should
+like
+to
+come
+here
+tonight
+to
+say
+a
+few
+words
+I
+want
+to
+thank
+you
+for
+helping
+me
+to
+the
+higher
+life
+I
+had
+gone
+down
+down
+and
+had
+only
+hatred
+and
+selfish
+thoughts
+I
+was
+down
+as
+far
+as
+I
+could
+go
+My
+mother
+was
+obsessed
+She
+had
+a
+great
+deal
+of
+influence
+over
+me
+She
+was
+down
+on
+the
+world
+and
+made
+me
+do
+things
+to
+the
+neighbors
+that
+I
+should
+never
+have
+done
+My
+father
+and
+brother
+were
+good
+people
+and
+were
+looked
+up
+to
+I
+am
+Pete
+Neidemeyer
+I
+want
+to
+thank
+you
+for
+having
+helped
+me
+and
+now
+I
+want
+to
+ask
+you
+to
+send
+good
+thoughts
+to
+my
+mother
+She
+has
+passed
+out
+but
+I
+cannot
+reach
+her
+She
+was
+obsessed
+by
+a
+very
+evil
+spirit
+she
+sent
+evil
+thoughts
+to
+me
+and
+I
+was
+very
+sensitive
+to
+them
+You
+did
+a
+Christian
+act
+for
+me
+which
+no
+one
+else
+had
+ever
+done
+I
+was
+shunned
+by
+all
+When
+you
+are
+in
+a
+large
+city
+with
+all
+its
+temptations
+and
+have
+not
+learned
+anything
+about
+the
+higher
+things
+you
+get
+in
+bad
+company
+You
+get
+so
+wrapped
+up
+with
+things
+that
+are
+bad
+that
+you
+think
+everything
+belongs
+to
+you
+just
+as
+much
+as
+it
+does
+to
+the
+other
+fellow
+Jealousy
+selfishness
+and
+ignorance
+are
+three
+things
+that
+we
+should
+all
+try
+to
+conquer
+When
+they
+get
+hold
+of
+you
+they
+are
+the
+devil
+in
+you
+You
+feel
+jealous
+of
+everybody
+that
+has
+more
+than
+you
+You
+are
+selfish
+You
+don
+t
+want
+to
+give
+anything
+away
+you
+just
+want
+to
+keep
+it
+all
+for
+yourself
+You
+want
+everything
+that
+belongs
+to
+others
+You
+feel
+that
+if
+there
+is
+a
+God
+he
+should
+have
+given
+you
+a
+chance
+as
+well
+as
+the
+rest
+of
+them
+In
+that
+atmosphere
+I
+was
+brought
+up
+Mother
+was
+selfish
+and
+jealous
+Nobody
+in
+the
+neighborhood
+liked
+her
+she
+did
+not
+have
+one
+friend
+I
+was
+her
+pet
+and
+I
+could
+have
+anything
+Father
+told
+me
+not
+to
+do
+bad
+things
+but
+mother
+said
+not
+to
+mind
+what
+he
+told
+me
+but
+to
+go
+ahead
+and
+do
+as
+I
+pleased
+I
+went
+out
+and
+stayed
+out
+nights
+in
+bad
+company
+We
+got
+a
+gang
+together
+I
+did
+not
+mean
+to
+get
+into
+the
+gang
+as
+I
+did
+but
+I
+was
+forced
+into
+it
+by
+the
+club
+You
+understand
+they
+have
+clubs
+secret
+clubs
+those
+fellows
+and
+when
+you
+join
+you
+have
+to
+do
+just
+what
+they
+say
+because
+you
+are
+in
+their
+power
+If
+you
+try
+to
+withdraw
+you
+cannot
+because
+they
+will
+squeal
+on
+you
+They
+watch
+you
+and
+somebody
+follows
+you
+all
+the
+time
+The
+new
+beginners
+are
+the
+ones
+who
+do
+the
+dirty
+work
+The
+leaders
+very
+seldom
+get
+caught
+There
+is
+a
+school
+and
+the
+new
+beginners
+learn
+to
+do
+bad
+things
+Some
+of
+the
+leaders
+are
+in
+the
+finest
+society
+in
+big
+cities
+and
+they
+get
+to
+know
+where
+we
+can
+find
+people
+to
+rob
+You
+may
+sometimes
+wonder
+how
+we
+know
+where
+to
+go
+to
+find
+jewelry
+and
+money
+Our
+leaders
+know
+all
+about
+it
+They
+are
+in
+fine
+society
+all
+the
+time
+They
+have
+money
+so
+it
+wouldn
+t
+do
+any
+good
+to
+squeal
+on
+them
+If
+I
+should
+tell
+you
+the
+names
+of
+some
+of
+our
+leaders
+who
+are
+in
+society
+in
+Chicago
+you
+would
+not
+believe
+me
+You
+would
+say
+that
+it
+is
+not
+so
+If
+you
+would
+tell
+on
+them
+they
+would
+at
+once
+squeal
+on
+you
+and
+say
+you
+robbed
+such
+a
+house
+What
+could
+you
+do
+You
+just
+have
+to
+keep
+still
+That
+is
+what
+the
+underworld
+is
+doing
+The
+upper
+world
+uses
+the
+underworld
+when
+it
+suits
+its
+purpose
+What
+we
+steal
+in
+one
+city
+they
+send
+off
+to
+another
+city
+Always
+you
+will
+find
+our
+leaders
+in
+the
+finest
+society
+but
+we
+do
+not
+dare
+say
+anything
+When
+you
+once
+join
+their
+club
+what
+I
+would
+call
+the
+Devil
+s
+Club
+you
+can
+t
+say
+anything
+You
+are
+in
+their
+claws
+and
+our
+leaders
+are
+worse
+than
+devils
+they
+are
+so
+mean
+If
+we
+should
+kill
+we
+are
+the
+ones
+who
+suffer
+but
+they
+get
+the
+money
+I
+came
+here
+tonight
+to
+thank
+you
+for
+having
+helped
+me
+Nobody
+ever
+gave
+me
+a
+helping
+hand
+before
+In
+that
+car
+barn
+murder
+I
+did
+not
+kill
+any
+one
+I
+was
+with
+the
+gang
+but
+the
+one
+who
+did
+the
+work
+did
+not
+get
+hung
+he
+got
+away
+We
+four
+were
+hung
+because
+we
+were
+there
+I
+was
+innocent
+My
+work
+was
+to
+watch
+which
+I
+did
+but
+I
+did
+not
+murder
+I
+was
+hung
+for
+it
+If
+you
+have
+any
+influence
+at
+all
+do
+not
+hang
+people
+Let
+them
+have
+another
+chance
+because
+sometimes
+you
+will
+find
+they
+are
+innocent
+Keep
+them
+in
+the
+pen
+give
+them
+another
+chance
+If
+they
+are
+hung
+then
+where
+are
+they
+All
+they
+have
+in
+their
+hearts
+is
+hatred
+They
+go
+back
+to
+earth
+life
+and
+do
+more
+mischief
+They
+control
+people
+and
+obsession
+steps
+in
+I
+had
+hatred
+when
+I
+was
+hung
+and
+said
+if
+there
+is
+life
+again
+I
+will
+get
+even
+and
+fight
+for
+revenge
+You
+remember
+Tillie
+who
+lived
+next
+door
+to
+me
+I
+told
+you
+about
+her
+before
+She
+used
+to
+come
+to
+your
+circles
+I
+followed
+her
+once
+and
+through
+her
+influence
+I
+came
+into
+your
+circle
+and
+was
+converted
+to
+the
+higher
+life
+Tillie
+always
+had
+a
+good
+influence
+over
+me
+and
+sometimes
+she
+wanted
+to
+talk
+to
+me
+but
+mother
+Was
+always
+jealous
+and
+didn
+t
+want
+her
+to
+talk
+Mother
+was
+very
+mean
+to
+Tillie
+s
+people
+She
+got
+so
+mad
+at
+the
+time
+I
+was
+hung
+that
+she
+tormented
+all
+her
+neighbors
+She
+tore
+up
+all
+the
+fences
+and
+closed
+up
+all
+the
+stable
+windows
+on
+their
+side
+She
+tried
+to
+shoot
+every
+body
+she
+could
+If
+my
+father
+bad
+had
+the
+gun
+loaded
+mother
+would
+have
+been
+in
+great
+trouble
+Tillie
+was
+my
+guardian
+angel
+and
+through
+your
+circle
+I
+got
+over
+my
+hatred
+Now
+I
+try
+to
+help
+others
+with
+the
+light
+you
+gave
+me
+My
+mission
+is
+to
+help
+the
+unfortunate
+ones
+like
+this
+fellow
+who
+came
+before
+me
+I
+try
+to
+influence
+people
+to
+be
+more
+just
+If
+you
+have
+a
+chance
+to
+hang
+any
+one
+don
+t
+do
+it
+but
+give
+him
+another
+chance
+You
+have
+no
+right
+to
+kill
+Nobody
+should
+kill
+another
+person
+We
+are
+all
+God
+s
+children
+We
+all
+make
+mistakes
+and
+the
+strong
+should
+help
+the
+weak
+When
+one
+person
+murders
+another
+no
+justice
+is
+shown
+no
+mercy
+The
+judge
+and
+the
+jury
+what
+mercy
+do
+they
+show
+a
+fellow
+when
+he
+has
+murdered
+Why
+should
+they
+kill
+him
+instead
+of
+giving
+him
+another
+chance
+Why
+don
+t
+they
+give
+a
+good
+word
+to
+the
+poor
+ones
+Why
+don
+t
+they
+go
+to
+the
+prisoners
+and
+teach
+them
+of
+the
+higher
+life
+and
+also
+have
+psychic
+circles
+and
+try
+to
+help
+them
+As
+soon
+as
+you
+stop
+capital
+punishment
+you
+will
+not
+have
+so
+much
+killing
+When
+persons
+are
+hanged
+they
+have
+revenge
+and
+hatred
+in
+their
+hearts
+and
+all
+they
+want
+to
+do
+is
+kill
+kill
+kill
+So
+they
+influence
+sensitive
+mortals
+and
+make
+them
+commit
+all
+kinds
+of
+crime
+I
+want
+to
+say
+again
+if
+you
+have
+any
+influence
+stop
+capital
+punishment
+This
+is
+a
+Christian
+country
+and
+nobody
+has
+a
+right
+to
+kill
+another
+As
+they
+killed
+Christ
+so
+they
+kill
+boys
+who
+have
+been
+murderers
+instead
+of
+teaching
+them
+while
+they
+are
+young
+Isn
+t
+is
+right
+that
+they
+should
+be
+taught
+to
+do
+better
+and
+to
+live
+better
+lives
+The
+time
+will
+come
+when
+the
+world
+will
+have
+to
+understand
+that
+it
+must
+overcome
+selfishness
+There
+will
+be
+lots
+of
+trouble
+before
+that
+time
+comes
+There
+will
+be
+much
+destruction
+but
+after
+that
+things
+will
+be
+better
+I
+am
+now
+doing
+my
+work
+in
+the
+spirit
+world
+and
+I
+thank
+you
+for
+bringing
+me
+to
+a
+realization
+and
+waking
+me
+up
+I
+have
+little
+meetings
+here
+and
+there
+I
+give
+little
+thoughts
+of
+cheer
+to
+those
+in
+darkness
+I
+am
+up
+against
+a
+very
+hard
+condition
+and
+that
+is
+to
+get
+my
+mother
+to
+understand
+I
+wish
+you
+would
+all
+send
+good
+kind
+thoughts
+to
+her
+because
+she
+only
+had
+hatred
+and
+selfishness
+and
+jealousy
+in
+her
+heart
+She
+was
+so
+wrapped
+up
+in
+herself
+that
+now
+she
+will
+not
+listen
+to
+any
+one
+Help
+me
+to
+wake
+her
+up
+and
+realize
+the
+true
+condition
+of
+life
+Oh
+how
+I
+thank
+you
+for
+helping
+me
+At
+heart
+I
+was
+not
+a
+murderer
+yet
+I
+was
+hung
+for
+murder
+I
+was
+not
+with
+the
+gang
+that
+was
+doing
+the
+work
+all
+I
+did
+was
+to
+watch
+I
+was
+there
+with
+them
+and
+that
+was
+enough
+for
+the
+jury
+I
+had
+the
+name
+Now
+I
+am
+trying
+to
+do
+my
+part
+but
+I
+have
+much
+to
+learn
+I
+was
+very
+ignorant
+of
+the
+real
+life
+My
+father
+wanted
+me
+to
+go
+to
+Sunday
+School
+Mother
+told
+me
+I
+didn
+t
+need
+to
+go
+but
+I
+went
+and
+I
+didn
+t
+find
+anything
+there
+that
+appealed
+to
+me
+so
+I
+quit
+going
+I
+know
+now
+that
+God
+is
+everywhere
+and
+that
+I
+am
+a
+part
+of
+God
+I
+had
+a
+hard
+time
+getting
+rid
+of
+selfishness
+jealousy
+and
+ignorance
+they
+are
+the
+root
+of
+all
+evil
+When
+they
+are
+gone
+love
+kindness
+and
+sympathy
+take
+their
+place
+Get
+an
+understanding
+of
+the
+higher
+life
+and
+you
+will
+be
+happy
+All
+should
+be
+brothers
+and
+sisters
+on
+earth
+as
+we
+are
+in
+the
+higher
+life
+In
+the
+spirit
+world
+our
+real
+eyes
+are
+opened
+You
+cannot
+progress
+until
+you
+have
+learned
+the
+lessons
+of
+life
+You
+know
+a
+school
+boy
+cannot
+go
+to
+University
+until
+after
+he
+gets
+through
+his
+school
+books
+He
+must
+go
+to
+Kindergarten
+before
+he
+can
+enter
+the
+University
+and
+he
+has
+to
+get
+there
+step
+by
+step
+So
+it
+is
+in
+the
+spirit
+world
+It
+is
+the
+world
+of
+happiness
+We
+cannot
+appreciate
+it
+until
+we
+have
+it
+before
+us
+Everybody
+should
+know
+these
+things
+before
+they
+step
+over
+the
+Borderland
+We
+cannot
+go
+to
+the
+spirit
+world
+until
+we
+have
+an
+understanding
+of
+it
+When
+we
+are
+one
+with
+God
+then
+we
+have
+happiness
+I
+do
+not
+know
+much
+and
+I
+cannot
+say
+much
+because
+I
+have
+seen
+so
+little
+of
+it
+I
+have
+much
+work
+to
+do
+before
+I
+go
+on
+The
+spirit
+world
+is
+like
+going
+into
+a
+garden
+and
+seeing
+one
+beautiful
+flower
+here
+and
+another
+there
+The
+flowers
+all
+stand
+up
+so
+straight
+and
+look
+at
+you
+and
+seem
+to
+say
+Please
+take
+me
+This
+one
+has
+a
+certain
+odor
+and
+that
+one
+another
+but
+all
+are
+beautiful
+and
+fragrant
+The
+spirit
+world
+is
+like
+a
+flower
+bed
+all
+is
+beauty
+and
+harmony
+I
+mean
+there
+is
+no
+selfishness
+One
+shines
+more
+than
+another
+because
+he
+has
+more
+understanding
+We
+will
+all
+get
+there
+but
+we
+have
+to
+gain
+advancement
+for
+ourselves
+No
+one
+needs
+to
+get
+discouraged
+all
+will
+get
+there
+but
+it
+takes
+time
+Thank
+you
+for
+having
+helped
+me
+to
+an
+understanding
+and
+a
+home
+But
+for
+that
+I
+should
+have
+been
+an
+earthbound
+spirit
+doing
+more
+harm
+than
+good
+for
+I
+had
+hatred
+in
+my
+heart
+I
+am
+very
+happy
+but
+I
+want
+you
+all
+to
+send
+a
+good
+thought
+to
+my
+mother
+so
+that
+I
+can
+wake
+her
+up
+and
+help
+her
+to
+overcome
+her
+selfishness
+jealousy
+and
+ignorance
+Just
+give
+me
+a
+chance
+to
+wake
+her
+up
+I
+thank
+you
+all
+CHAPTER
+VII
+Spirits
+and
+Suicide
+A
+GREAT
+NUMBER
+of
+unaccountable
+suicides
+are
+due
+to
+the
+obsessing
+or
+possessing
+influence
+of
+earthbound
+spirits
+Some
+of
+these
+spirits
+are
+actuated
+by
+a
+desire
+to
+torment
+their
+victims
+others
+who
+have
+ended
+their
+physical
+existence
+as
+suicides
+find
+themselves
+still
+alive
+and
+having
+no
+knowledge
+of
+a
+spirit
+world
+labor
+under
+the
+delusion
+that
+their
+self
+destructive
+attempts
+have
+failed
+and
+continue
+their
+suicidal
+efforts
+When
+these
+intelligences
+come
+in
+contact
+with
+mortal
+sensitives
+they
+mistake
+the
+physical
+bodies
+for
+their
+own
+and
+impress
+the
+sensitives
+with
+morbid
+thoughts
+and
+instigate
+them
+to
+deeds
+of
+self
+destruction
+The
+fate
+of
+a
+suicide
+is
+invariably
+one
+of
+deepest
+misery
+his
+rash
+act
+holding
+him
+in
+the
+earth
+sphere
+until
+such
+time
+as
+his
+physical
+life
+would
+have
+had
+a
+natural
+ending
+One
+suicide
+case
+which
+we
+contacted
+was
+the
+spirit
+of
+a
+woman
+Mrs
+X
+who
+had
+been
+my
+Sunday
+School
+teacher
+when
+I
+was
+a
+boy
+in
+Europe
+but
+of
+whom
+Mrs
+Wickland
+had
+never
+heard
+This
+lady
+had
+been
+intelligent
+and
+spiritual
+an
+earnest
+church
+member
+happily
+married
+and
+the
+mother
+of
+several
+children
+Without
+any
+warning
+while
+apparently
+happy
+and
+contented
+she
+had
+suddenly
+hung
+herself
+and
+the
+horrified
+husband
+and
+children
+could
+in
+no
+way
+account
+for
+the
+tragedy
+One
+winter
+day
+ten
+years
+later
+when
+Mrs
+Wickland
+and
+I
+were
+alone
+in
+our
+home
+in
+Chicago
+Mrs
+Wickland
+was
+unexpectedly
+controlled
+by
+a
+spirit
+who
+gasped
+for
+breath
+and
+seemed
+to
+be
+strangling
+This
+spirit
+like
+so
+many
+others
+was
+unconscious
+of
+controlling
+a
+body
+not
+its
+own
+and
+upon
+contacting
+matter
+again
+experienced
+its
+last
+death
+struggle
+After
+much
+questioning
+I
+learned
+to
+my
+great
+surprise
+that
+this
+was
+the
+spirit
+of
+my
+former
+friend
+who
+had
+ended
+her
+physical
+life
+by
+hanging
+herself
+She
+was
+still
+bound
+to
+the
+earth
+sphere
+and
+related
+the
+indescribable
+mental
+hell
+she
+had
+been
+in
+during
+all
+those
+years
+As
+soon
+as
+I
+found
+myself
+out
+of
+my
+body
+I
+saw
+at
+once
+the
+cause
+for
+my
+rash
+act
+Evil
+spirits
+who
+had
+been
+attracted
+to
+me
+by
+the
+jealous
+thoughts
+of
+other
+persons
+were
+standing
+near
+grinning
+with
+devilish
+satisfaction
+at
+their
+work
+They
+had
+influenced
+me
+to
+end
+my
+life
+I
+had
+no
+occasion
+to
+even
+think
+of
+such
+folly
+An
+irresistible
+impulse
+had
+suddenly
+come
+over
+me
+I
+fastened
+the
+rope
+around
+my
+neck
+and
+only
+realized
+what
+I
+had
+done
+when
+it
+was
+too
+late
+I
+would
+have
+given
+the
+world
+to
+have
+been
+able
+to
+regain
+possession
+of
+my
+body
+Oh
+what
+horrors
+of
+despair
+and
+remorse
+I
+have
+gone
+through
+My
+home
+shattered
+my
+husband
+brokenhearted
+and
+discouraged
+and
+my
+little
+ones
+needing
+my
+care
+They
+do
+not
+know
+that
+I
+come
+to
+them
+and
+try
+to
+comfort
+them
+and
+I
+have
+seen
+nothing
+but
+gloom
+and
+darkness
+until
+now
+Comforted
+and
+reassured
+by
+an
+explanation
+of
+the
+true
+spiritual
+realms
+this
+spirit
+was
+eager
+to
+go
+with
+the
+higher
+intelligences
+and
+learn
+how
+she
+might
+be
+of
+service
+to
+her
+loved
+ones
+on
+earth
+Many
+years
+later
+when
+we
+had
+with
+us
+a
+patient
+of
+strong
+suicidal
+tendencies
+this
+spirit
+returned
+to
+warn
+her
+against
+carrying
+out
+her
+intentions
+EXPERIENCE
+NOVEMBER
+Spirit
+MRS
+X
+Psychic
+MRS
+WICKLAND
+It
+is
+a
+long
+time
+since
+I
+have
+been
+here
+I
+should
+like
+to
+say
+a
+few
+words
+to
+this
+young
+lady
+who
+is
+contemplating
+suicide
+Many
+years
+ago
+I
+was
+a
+happy
+wife
+with
+two
+dear
+children
+and
+a
+very
+kind
+husband
+We
+lived
+together
+happily
+since
+we
+were
+both
+of
+a
+cheerful
+disposition
+and
+because
+of
+this
+there
+were
+many
+jealous
+thoughts
+centered
+upon
+us
+I
+did
+not
+know
+at
+that
+time
+that
+I
+was
+a
+psychic
+because
+I
+belonged
+to
+the
+Baptist
+Church
+I
+did
+the
+very
+best
+I
+could
+around
+the
+home
+but
+somebody
+started
+to
+upset
+us
+One
+day
+when
+my
+husband
+went
+to
+work
+I
+kissed
+him
+goodby
+and
+was
+very
+happy
+but
+after
+he
+was
+gone
+all
+in
+a
+moment
+something
+got
+hold
+of
+me
+I
+did
+not
+know
+what
+I
+was
+doing
+I
+didn
+t
+know
+a
+thing
+I
+remember
+feeling
+very
+strange
+as
+if
+somebody
+had
+taken
+complete
+hold
+of
+me
+and
+I
+did
+not
+realize
+what
+was
+taking
+place
+After
+awhile
+everything
+changed
+I
+saw
+my
+husband
+in
+terrible
+mental
+agony
+and
+he
+was
+crying
+very
+bitterly
+When
+things
+became
+a
+little
+clearer
+to
+me
+I
+saw
+my
+body
+hanging
+there
+Oh
+if
+you
+could
+only
+realize
+what
+a
+condition
+I
+was
+in
+My
+husband
+stood
+there
+in
+the
+shed
+looking
+at
+my
+hanging
+body
+he
+was
+crying
+heart
+brokenly
+but
+I
+could
+do
+nothing
+to
+help
+him
+There
+I
+stood
+at
+his
+side
+wishing
+with
+all
+my
+power
+that
+I
+could
+have
+that
+body
+again
+but
+I
+could
+not
+There
+were
+my
+two
+little
+children
+weeping
+for
+me
+and
+I
+could
+not
+help
+them
+I
+did
+not
+know
+what
+was
+the
+matter
+until
+I
+saw
+some
+evil
+spirits
+standing
+near
+laughing
+at
+us
+They
+had
+gotten
+hold
+of
+me
+and
+made
+me
+kill
+myself
+because
+they
+wanted
+to
+break
+up
+our
+happy
+home
+My
+husband
+could
+never
+forget
+the
+sight
+of
+my
+body
+hanging
+in
+the
+shed
+My
+children
+were
+small
+and
+needed
+my
+help
+but
+the
+responsibility
+of
+raising
+them
+was
+thrown
+on
+my
+husband
+It
+should
+have
+been
+my
+duty
+to
+have
+shared
+that
+responsibility
+Although
+I
+had
+been
+influenced
+to
+do
+what
+I
+did
+for
+ten
+long
+years
+I
+could
+see
+nothing
+before
+me
+but
+what
+I
+had
+done
+I
+could
+see
+how
+much
+the
+children
+needed
+me
+but
+I
+could
+do
+nothing
+for
+them
+and
+oh
+how
+I
+suffered
+My
+poor
+poor
+children
+One
+day
+a
+very
+cold
+day
+I
+felt
+that
+I
+had
+come
+to
+life
+again
+I
+felt
+a
+new
+warmth
+I
+did
+not
+know
+where
+I
+was
+but
+I
+felt
+that
+I
+had
+come
+to
+life
+I
+found
+myself
+talking
+to
+Dr
+Wickland
+He
+told
+me
+what
+had
+happened
+and
+explained
+that
+I
+was
+only
+temporarily
+controlling
+Mrs
+Wickland
+and
+that
+friends
+would
+take
+me
+to
+the
+spirit
+world
+After
+this
+I
+felt
+somewhat
+better
+and
+I
+thank
+you
+for
+having
+helped
+me
+to
+the
+beautiful
+condition
+I
+have
+now
+But
+oh
+how
+I
+suffered
+during
+those
+ten
+long
+years
+All
+I
+could
+see
+was
+my
+body
+hanging
+before
+me
+and
+the
+children
+s
+need
+of
+me
+My
+husband
+and
+children
+How
+they
+needed
+my
+care
+but
+I
+was
+powerless
+to
+help
+them
+I
+want
+to
+warn
+anybody
+who
+is
+thinking
+of
+trying
+to
+get
+out
+of
+the
+physical
+body
+Do
+not
+do
+it
+under
+any
+circumstances
+You
+do
+not
+know
+you
+cannot
+realize
+what
+a
+hell
+you
+will
+find
+yourself
+in
+You
+cannot
+step
+into
+your
+body
+again
+after
+you
+once
+leave
+it
+and
+you
+cannot
+do
+your
+duty
+to
+others
+Think
+of
+my
+children
+always
+having
+the
+thought
+that
+their
+mother
+committed
+suicide
+Neither
+my
+husband
+nor
+children
+can
+ever
+really
+forgive
+me
+Even
+though
+I
+was
+controlled
+when
+I
+did
+what
+I
+did
+I
+have
+had
+to
+suffer
+If
+you
+had
+an
+understanding
+of
+the
+laws
+of
+the
+spirit
+side
+of
+life
+you
+would
+not
+commit
+suicide
+knowing
+the
+results
+Overcome
+any
+thoughts
+of
+taking
+your
+life
+Be
+happy
+on
+this
+earth
+plane
+until
+the
+time
+comes
+for
+you
+to
+go
+to
+the
+spirit
+world
+The
+ten
+years
+that
+I
+suffered
+was
+the
+time
+I
+should
+have
+remained
+on
+earth
+before
+passing
+to
+the
+spirit
+side
+of
+life
+After
+my
+ten
+years
+had
+expired
+I
+should
+have
+left
+my
+body
+for
+my
+life
+would
+have
+been
+lived
+out
+but
+during
+that
+time
+I
+could
+have
+given
+help
+to
+my
+husband
+and
+children
+I
+should
+not
+have
+reached
+the
+spirit
+side
+of
+life
+before
+my
+allotted
+time
+and
+my
+punishment
+was
+to
+constantly
+see
+my
+body
+hanging
+before
+me
+for
+ten
+years
+All
+that
+time
+I
+could
+realize
+that
+my
+husband
+and
+children
+were
+in
+great
+need
+of
+my
+help
+Now
+I
+am
+as
+happy
+as
+I
+can
+be
+until
+my
+family
+is
+reunited
+and
+I
+am
+doing
+all
+I
+can
+to
+help
+my
+children
+I
+want
+you
+to
+send
+my
+love
+to
+my
+dear
+husband
+He
+feels
+that
+he
+is
+all
+alone
+I
+am
+with
+him
+but
+I
+can
+do
+nothing
+to
+comfort
+him
+in
+his
+loneliness
+Goodbye
+On
+November
+while
+Mrs
+Wickland
+and
+I
+were
+visiting
+with
+friends
+in
+Chicago
+a
+circle
+had
+been
+formed
+for
+a
+psychic
+demonstration
+when
+Mrs
+Wickland
+heard
+some
+one
+say
+I
+am
+in
+the
+dark
+She
+inquired
+who
+had
+made
+the
+remark
+but
+no
+one
+in
+the
+room
+had
+uttered
+a
+word
+however
+the
+gentleman
+sitting
+beside
+Mrs
+Wickland
+declared
+that
+he
+too
+had
+heard
+the
+voice
+A
+moment
+later
+Mrs
+Wickland
+became
+entranced
+and
+fell
+to
+the
+floor
+the
+spirit
+clutching
+at
+the
+throat
+and
+crying
+Take
+the
+rope
+away
+Take
+the
+rope
+away
+I
+am
+in
+the
+dark
+Why
+did
+I
+do
+it
+Oh
+why
+did
+I
+do
+it
+When
+the
+excited
+spirit
+had
+been
+somewhat
+quieted
+she
+told
+us
+that
+her
+name
+was
+Minnie
+Harmening
+that
+she
+was
+a
+young
+girl
+and
+had
+lived
+on
+a
+farm
+near
+Palatine
+As
+she
+was
+speaking
+brokenly
+between
+sobs
+it
+was
+difficult
+to
+distinguish
+her
+words
+and
+I
+understood
+her
+to
+say
+that
+she
+came
+from
+Palestine
+which
+seemed
+rather
+strange
+The
+spirit
+was
+in
+great
+grief
+because
+she
+had
+hung
+herself
+and
+thought
+the
+body
+of
+the
+psychic
+was
+her
+own
+and
+that
+the
+rope
+was
+still
+about
+her
+neck
+She
+said
+that
+on
+October
+without
+any
+cause
+or
+premeditation
+she
+had
+been
+overpowered
+by
+a
+desire
+to
+take
+her
+life
+and
+when
+alone
+had
+gone
+to
+the
+barn
+and
+hung
+herself
+A
+big
+man
+with
+a
+black
+beard
+made
+me
+do
+it
+Spirit
+He
+met
+me
+in
+the
+barnyard
+and
+hypnotized
+me
+and
+made
+me
+hang
+myself
+to
+a
+rafter
+but
+I
+don
+t
+know
+why
+I
+did
+it
+My
+brother
+John
+found
+me
+and
+cut
+me
+down
+and
+my
+parents
+were
+almost
+beside
+themselves
+But
+I
+am
+not
+dead
+I
+am
+at
+home
+all
+the
+time
+and
+I
+talk
+to
+my
+mother
+and
+father
+I
+try
+to
+comfort
+them
+and
+make
+them
+know
+that
+I
+am
+not
+dead
+but
+they
+do
+not
+notice
+me
+and
+do
+not
+answer
+me
+My
+folks
+all
+sit
+around
+the
+table
+crying
+and
+there
+is
+my
+empty
+chair
+but
+no
+one
+answers
+me
+Why
+don
+t
+they
+answer
+me
+We
+could
+not
+at
+first
+convince
+her
+that
+she
+was
+expressing
+herself
+through
+the
+body
+of
+another
+but
+after
+a
+lengthy
+conversation
+she
+was
+somewhat
+enlightened
+and
+comforted
+and
+left
+with
+spirit
+friends
+Previous
+to
+this
+incident
+neither
+Mrs
+Wickland
+nor
+I
+had
+heard
+of
+the
+Harmening
+suicide
+mystery
+and
+we
+did
+not
+know
+that
+such
+a
+girl
+had
+ever
+existed
+Several
+days
+later
+a
+reporter
+from
+one
+of
+the
+Chicago
+dailies
+came
+to
+interview
+us
+regarding
+our
+research
+work
+and
+I
+related
+our
+recent
+experience
+with
+the
+Harmening
+girl
+In
+great
+surprise
+he
+said
+that
+he
+himself
+had
+been
+the
+reporter
+on
+the
+Harmening
+case
+and
+that
+the
+girl
+had
+lived
+in
+Palatine
+Cook
+County
+Illinois
+The
+dead
+body
+of
+the
+girl
+had
+been
+found
+hanging
+in
+her
+father
+s
+barn
+but
+no
+one
+knew
+of
+any
+cause
+for
+suicide
+although
+the
+girl
+had
+always
+been
+peculiar
+There
+was
+a
+suspicion
+of
+murder
+because
+the
+clothes
+about
+the
+chest
+had
+been
+torn
+and
+the
+neck
+badly
+scratched
+leading
+the
+authorities
+to
+believe
+that
+a
+crime
+had
+been
+committed
+and
+the
+body
+hung
+up
+to
+avert
+suspicion
+On
+Thanksgiving
+Day
+November
+the
+spirit
+of
+Minnie
+Harmening
+came
+to
+us
+again
+still
+grieving
+because
+of
+the
+suffering
+of
+her
+parents
+and
+the
+intolerant
+attitude
+assumed
+toward
+her
+family
+by
+the
+villagers
+and
+church
+members
+who
+considered
+the
+family
+disgraced
+The
+girl
+had
+been
+a
+devout
+member
+of
+a
+German
+Lutheran
+Church
+but
+because
+she
+had
+died
+a
+suicide
+the
+pastor
+had
+refused
+to
+allow
+the
+funeral
+service
+to
+be
+held
+in
+the
+church
+nor
+would
+the
+congregation
+permit
+the
+body
+to
+be
+buried
+in
+the
+consecrated
+ground
+of
+the
+churchyard
+Minnie
+said
+that
+the
+funeral
+service
+had
+been
+held
+at
+the
+home
+of
+her
+parents
+but
+the
+minister
+had
+considered
+the
+viewing
+of
+the
+body
+such
+a
+sacrilege
+that
+he
+had
+stepped
+outside
+the
+house
+while
+others
+paid
+their
+last
+tribute
+and
+this
+had
+added
+still
+more
+to
+the
+grief
+of
+her
+already
+distracted
+parents
+These
+statements
+I
+found
+corroborated
+in
+the
+papers
+afterward
+I
+asked
+the
+spirit
+why
+her
+clothes
+had
+been
+torn
+and
+she
+answered
+I
+did
+that
+myself
+The
+big
+man
+spirit
+with
+the
+beard
+told
+me
+to
+hang
+myself
+but
+as
+soon
+as
+I
+had
+kicked
+the
+box
+away
+from
+my
+feet
+I
+felt
+the
+rope
+tightening
+around
+my
+neck
+and
+came
+to
+my
+senses
+I
+clawed
+at
+the
+rope
+and
+tried
+to
+loosen
+it
+but
+I
+only
+tightened
+it
+and
+scratched
+myself
+Fourteen
+years
+later
+the
+spirit
+of
+Minnie
+Harmening
+spoke
+to
+us
+again
+EXPERIENCE
+OCTOBER
+Spirit
+MINNIE
+HARMENING
+Psychic
+MRS
+WICKLAND
+I
+want
+to
+thank
+you
+for
+all
+the
+help
+you
+have
+given
+me
+When
+I
+committed
+the
+act
+which
+took
+my
+life
+I
+was
+only
+a
+young
+girl
+of
+sixteen
+I
+had
+so
+much
+suffering
+afterwards
+and
+was
+very
+very
+miserable
+I
+could
+see
+my
+father
+and
+mother
+sitting
+at
+the
+table
+crying
+and
+I
+could
+not
+help
+them
+When
+the
+time
+came
+for
+my
+body
+to
+be
+buried
+the
+minister
+would
+not
+take
+it
+into
+the
+church
+and
+would
+not
+bury
+it
+because
+he
+said
+I
+had
+committed
+a
+sin
+in
+taking
+my
+own
+life
+He
+also
+said
+that
+I
+could
+not
+be
+buried
+in
+the
+graveyard
+because
+of
+my
+act
+and
+he
+would
+not
+even
+look
+at
+the
+funeral
+as
+it
+passed
+by
+I
+did
+not
+do
+the
+deed
+myself
+I
+was
+obsessed
+It
+was
+very
+hard
+for
+my
+father
+and
+mother
+and
+sisters
+The
+minister
+would
+not
+even
+come
+into
+the
+room
+where
+my
+body
+lay
+but
+spoke
+from
+another
+room
+he
+was
+too
+holy
+to
+be
+where
+the
+body
+was
+This
+made
+it
+much
+harder
+for
+my
+parents
+Do
+not
+think
+that
+by
+taking
+your
+own
+life
+you
+can
+bury
+yourself
+in
+the
+hereafter
+I
+was
+obsessed
+when
+I
+took
+my
+life
+and
+did
+not
+know
+what
+I
+was
+doing
+but
+I
+am
+suffering
+because
+my
+father
+and
+mother
+are
+still
+mourning
+for
+me
+Very
+often
+I
+go
+to
+see
+my
+poor
+old
+mother
+and
+she
+is
+very
+old
+now
+I
+am
+the
+girl
+who
+lived
+at
+Palatine
+You
+remember
+me
+don
+t
+you
+The
+neighbors
+made
+it
+still
+harder
+for
+my
+folks
+because
+they
+told
+mother
+what
+a
+disgrace
+it
+was
+for
+the
+family
+I
+feel
+very
+badly
+about
+the
+matter
+I
+want
+to
+thank
+you
+for
+the
+help
+I
+received
+here
+It
+was
+through
+you
+that
+I
+received
+light
+and
+understanding
+I
+am
+happy
+in
+a
+way
+but
+not
+real
+happy
+because
+I
+feel
+the
+grief
+my
+father
+and
+mother
+have
+When
+I
+lived
+I
+did
+not
+understand
+obsession
+After
+I
+had
+hung
+myself
+I
+saw
+a
+man
+beside
+me
+staring
+at
+me
+Just
+when
+the
+rope
+was
+around
+my
+neck
+I
+came
+to
+I
+tried
+my
+best
+to
+get
+it
+off
+my
+neck
+but
+I
+had
+kicked
+the
+box
+from
+under
+myself
+and
+my
+whole
+weight
+was
+in
+the
+rope
+and
+I
+could
+do
+nothing
+I
+scratched
+my
+body
+in
+an
+effort
+to
+free
+myself
+but
+it
+was
+no
+use
+If
+one
+takes
+his
+own
+life
+he
+goes
+through
+a
+bitter
+experience
+and
+suffers
+greatly
+yes
+suffers
+greatly
+I
+thank
+you
+very
+much
+for
+the
+light
+and
+understanding
+I
+have
+received
+for
+it
+has
+been
+a
+great
+help
+to
+me
+Another
+experience
+illustrating
+the
+power
+exercised
+over
+sensitive
+mortals
+by
+malignant
+earthbound
+spirits
+occurred
+in
+Chicago
+Mrs
+Wickland
+and
+I
+were
+resting
+on
+a
+bench
+in
+Lincoln
+Park
+on
+July
+when
+an
+elderly
+gentleman
+seated
+himself
+beside
+us
+Mrs
+Wickland
+at
+first
+saw
+two
+men
+on
+the
+bench
+but
+upon
+looking
+again
+noticed
+only
+one
+A
+conversation
+ensued
+which
+drifted
+into
+occultism
+and
+when
+the
+stranger
+Mr
+F
+expressed
+an
+interest
+in
+psychic
+phenomena
+we
+invited
+him
+to
+call
+at
+our
+home
+On
+the
+following
+evening
+Mr
+F
+called
+upon
+us
+and
+later
+Mrs
+Wickland
+became
+entranced
+by
+the
+spirit
+of
+a
+man
+who
+was
+greatly
+agitated
+He
+called
+Mr
+F
+by
+name
+saying
+he
+was
+his
+friend
+Mr
+B
+of
+Cleveland
+who
+had
+been
+with
+him
+in
+Lincoln
+Park
+the
+previous
+week
+and
+had
+had
+an
+appointment
+to
+meet
+him
+there
+again
+on
+that
+very
+day
+Mr
+F
+was
+greatly
+startled
+by
+this
+communication
+for
+his
+friend
+had
+committed
+suicide
+in
+his
+club
+at
+Cleveland
+the
+preceding
+Sunday
+Mr
+B
+had
+lived
+in
+Cleveland
+and
+had
+come
+to
+Chicago
+the
+week
+before
+to
+close
+a
+real
+estate
+deal
+but
+before
+final
+negotiations
+were
+completed
+had
+returned
+for
+a
+week
+end
+visit
+to
+Cleveland
+He
+was
+in
+a
+cheerful
+frame
+of
+mind
+when
+he
+left
+his
+home
+on
+Sunday
+morning
+but
+after
+conversing
+with
+a
+group
+of
+friends
+at
+his
+club
+he
+had
+gone
+into
+an
+adjoining
+room
+placed
+carbolic
+acid
+in
+his
+glass
+of
+wine
+and
+drinking
+it
+had
+fallen
+dead
+Mr
+B
+had
+been
+a
+man
+of
+wealth
+and
+position
+to
+all
+appearances
+singularly
+fortunate
+and
+happy
+and
+there
+seemed
+no
+reason
+for
+his
+suicide
+The
+spirit
+of
+Mr
+B
+was
+greatly
+troubled
+and
+bewildered
+and
+asked
+his
+friend
+what
+was
+the
+matter
+with
+him
+I
+go
+home
+to
+my
+wife
+and
+children
+but
+they
+do
+not
+seem
+to
+see
+me
+or
+hear
+me
+I
+have
+been
+with
+you
+for
+several
+days
+but
+you
+will
+not
+talk
+to
+me
+What
+is
+the
+matter
+Calming
+the
+spirit
+we
+finally
+made
+him
+realize
+that
+to
+the
+world
+he
+was
+dead
+and
+after
+explaining
+the
+suicide
+to
+him
+we
+asked
+why
+he
+had
+taken
+his
+life
+I
+did
+not
+take
+my
+life
+I
+went
+to
+the
+club
+and
+was
+talking
+to
+my
+friends
+then
+I
+went
+into
+another
+room
+but
+I
+do
+not
+know
+what
+happened
+after
+that
+The
+next
+thing
+that
+I
+remember
+is
+that
+I
+saw
+my
+body
+lying
+on
+the
+floor
+and
+a
+man
+spirit
+watching
+me
+and
+laughing
+After
+learning
+more
+of
+his
+condition
+the
+spirit
+urged
+his
+friend
+to
+write
+to
+his
+wife
+and
+tell
+her
+that
+in
+reality
+he
+was
+not
+dead
+at
+all
+On
+the
+evening
+of
+the
+Mr
+F
+called
+again
+when
+the
+spirit
+of
+Mr
+B
+came
+a
+second
+time
+still
+greatly
+disturbed
+and
+asked
+his
+friend
+why
+he
+had
+not
+written
+to
+his
+wife
+and
+urgently
+begged
+him
+to
+do
+so
+I
+know
+now
+that
+I
+was
+influenced
+to
+commit
+suicide
+by
+evil
+spirits
+who
+were
+opposed
+to
+my
+carrying
+out
+that
+real
+estate
+deal
+Rather
+than
+see
+my
+purpose
+accomplished
+they
+determined
+to
+kill
+me
+Please
+tell
+my
+wife
+the
+truth
+and
+warn
+all
+the
+world
+to
+be
+wiser
+While
+the
+trial
+of
+a
+young
+man
+who
+was
+accused
+of
+killing
+a
+college
+girl
+Marion
+Lambert
+was
+in
+progress
+in
+Waukegan
+Illinois
+the
+spirit
+of
+the
+murdered
+girl
+was
+brought
+to
+us
+on
+June
+entrancing
+Mrs
+Wickland
+She
+was
+weeping
+uncontrollably
+and
+in
+such
+distress
+that
+she
+was
+at
+first
+unable
+to
+speak
+then
+suddenly
+cried
+out
+I
+did
+it
+I
+did
+it
+Nobody
+can
+help
+me
+now
+If
+I
+only
+could
+tell
+them
+and
+make
+them
+understand
+but
+they
+will
+not
+listen
+I
+am
+in
+the
+dark
+and
+can
+see
+only
+the
+past
+and
+everything
+foolish
+I
+have
+done
+Oh
+what
+a
+foolish
+girl
+I
+was
+What
+is
+your
+name
+Marion
+Lambert
+Where
+do
+you
+think
+you
+are
+I
+do
+not
+know
+I
+am
+not
+acquainted
+with
+any
+one
+here
+Crying
+They
+talk
+of
+hell
+but
+that
+could
+not
+be
+as
+bad
+as
+what
+I
+have
+gone
+through
+just
+because
+of
+my
+foolishness
+I
+would
+like
+very
+much
+to
+get
+out
+of
+all
+this
+trouble
+I
+took
+my
+own
+life
+I
+didn
+t
+mean
+to
+kill
+myself
+I
+only
+meant
+to
+take
+enough
+cyanide
+of
+potassium
+to
+scare
+him
+And
+now
+they
+blame
+him
+for
+my
+death
+I
+would
+so
+like
+to
+do
+something
+to
+make
+them
+understand
+he
+is
+not
+guilty
+Oh
+but
+they
+will
+not
+believe
+me
+I
+talk
+to
+the
+different
+people
+at
+the
+court
+house
+but
+they
+take
+no
+notice
+of
+me
+and
+will
+not
+listen
+to
+me
+Everything
+is
+so
+strange
+I
+don
+t
+know
+what
+to
+do
+I
+was
+such
+a
+foolish
+girl
+Oh
+my
+poor
+father
+and
+mother
+I
+m
+half
+crazy
+with
+trouble
+and
+worry
+If
+I
+could
+only
+go
+to
+the
+court
+house
+and
+show
+them
+that
+I
+am
+not
+dead
+but
+that
+I
+am
+alive
+Why
+don
+t
+they
+listen
+to
+me
+I
+go
+to
+the
+court
+house
+but
+nobody
+will
+speak
+to
+me
+and
+I
+have
+spoken
+to
+so
+many
+people
+I
+am
+in
+such
+agony
+I
+don
+t
+know
+what
+to
+do
+If
+I
+had
+had
+more
+sense
+I
+would
+never
+have
+done
+what
+I
+did
+but
+it
+s
+no
+use
+saying
+that
+now
+it
+is
+too
+late
+I
+wish
+I
+could
+be
+in
+my
+body
+again
+I
+studied
+a
+great
+deal
+but
+I
+was
+so
+foolish
+it
+did
+me
+no
+good
+and
+now
+I
+am
+suffering
+Everything
+is
+so
+dark
+and
+I
+am
+in
+such
+trouble
+The
+spirit
+was
+so
+hysterical
+that
+it
+was
+exceedingly
+difficult
+to
+make
+her
+understand
+that
+she
+could
+best
+help
+by
+keeping
+away
+from
+the
+court
+house
+go
+with
+kindly
+intelligences
+to
+the
+spirit
+world
+and
+learn
+the
+higher
+purposes
+of
+life
+In
+July
+the
+interest
+of
+the
+American
+public
+was
+centered
+in
+a
+murder
+case
+in
+Los
+Angeles
+in
+which
+Harry
+New
+was
+accused
+of
+killing
+his
+sweetheart
+Freda
+Lesser
+The
+tragedy
+had
+taken
+place
+on
+July
+in
+Topanga
+Canyon
+where
+Harry
+and
+Freda
+had
+driven
+late
+in
+the
+day
+Near
+the
+crest
+a
+shot
+was
+fired
+which
+ended
+the
+girl
+s
+life
+and
+Harry
+New
+was
+arrested
+on
+a
+charge
+of
+murder
+The
+girl
+had
+been
+expecting
+motherhood
+and
+this
+fact
+was
+used
+in
+the
+trial
+as
+a
+motive
+for
+the
+crime
+Harry
+New
+was
+convicted
+of
+second
+degree
+murder
+and
+sentenced
+to
+San
+Quentin
+for
+ten
+years
+During
+the
+trial
+we
+had
+an
+interesting
+experience
+which
+would
+have
+thrown
+new
+light
+on
+the
+case
+could
+it
+have
+been
+accepted
+as
+evidence
+in
+court
+EXPERIENCE
+JANUARY
+Spirit
+FREDA
+LESSER
+Psychic
+MRS
+WICKLAND
+The
+controlling
+spirit
+was
+crying
+pathetically
+and
+seemed
+bewildered
+Doctor
+What
+is
+the
+matter
+with
+you
+Spirit
+Oh
+I
+feel
+so
+bad
+Dr
+What
+seems
+to
+be
+the
+trouble
+Sp
+Lots
+of
+trouble
+Dr
+Possibly
+we
+may
+be
+able
+to
+help
+you
+Sp
+That
+s
+impossible
+Oh
+I
+feel
+so
+bad
+Weeping
+Dr
+How
+long
+have
+you
+been
+dead
+SP
+I
+am
+not
+dead
+I
+am
+sick
+and
+downhearted
+Dr
+Why
+should
+you
+be
+downhearted
+Sp
+Because
+of
+my
+own
+foolishness
+Dr
+What
+have
+you
+been
+doing
+Sp
+Lots
+of
+things
+Dr
+What
+in
+particular
+Have
+you
+been
+happy
+Sp
+Oh
+no
+I
+have
+not
+been
+happy
+Wringing
+hands
+in
+anguish
+I
+wish
+I
+wish
+I
+wish
+I
+had
+not
+been
+so
+foolish
+Dr
+Did
+something
+happen
+to
+you
+Sp
+Yes
+everything
+happened
+Dr
+What
+is
+your
+name
+Is
+it
+John
+Sp
+I
+m
+not
+a
+man
+Oh
+all
+those
+people
+And
+that
+big
+crowd
+And
+they
+will
+not
+listen
+when
+I
+tell
+them
+about
+it
+Dr
+What
+is
+your
+name
+Sp
+I
+feel
+so
+bad
+I
+can
+t
+think
+Oh
+Harry
+Harry
+It
+was
+not
+your
+fault
+What
+are
+those
+people
+doing
+with
+him
+He
+hasn
+t
+done
+anything
+it
+was
+my
+foolishness
+Dr
+What
+did
+you
+do
+Sp
+I
+fought
+with
+him
+I
+got
+hold
+of
+the
+revolver
+and
+was
+going
+to
+fool
+him
+He
+tried
+to
+take
+the
+revolver
+away
+from
+me
+and
+we
+both
+fought
+for
+it
+I
+was
+only
+trying
+to
+fool
+him
+I
+go
+to
+see
+him
+but
+I
+don
+t
+know
+what
+to
+do
+Dr
+Why
+did
+you
+take
+the
+revolver
+Sp
+I
+was
+only
+trying
+to
+scare
+him
+Dr
+Did
+you
+fire
+the
+revolver
+Sp
+He
+tried
+to
+take
+the
+revolver
+away
+from
+me
+and
+it
+exploded
+I
+feel
+so
+bad
+and
+he
+will
+not
+talk
+to
+me
+and
+there
+are
+all
+those
+people
+bothering
+him
+He
+did
+not
+do
+anything
+It
+was
+all
+my
+foolishness
+He
+was
+a
+good
+fellow
+but
+I
+fooled
+him
+Where
+am
+I
+now
+Dr
+You
+are
+in
+Highland
+Park
+Los
+Angeles
+Sp
+Why
+did
+I
+come
+here
+Dr
+Some
+good
+friend
+brought
+you
+here
+Sp
+Why
+I
+went
+to
+Harry
+Dr
+Do
+you
+refer
+to
+Harry
+New
+Sp
+Yes
+of
+course
+I
+do
+Dr
+Did
+you
+care
+for
+him
+Sp
+I
+care
+for
+him
+more
+than
+ever
+because
+I
+cannot
+get
+to
+him
+He
+did
+not
+do
+it
+he
+did
+not
+shoot
+me
+I
+told
+him
+that
+I
+would
+kill
+myself
+and
+I
+went
+and
+got
+the
+revolver
+He
+didn
+t
+get
+it
+I
+got
+it
+from
+his
+auto
+and
+I
+had
+it
+I
+didn
+t
+mean
+to
+do
+anything
+I
+was
+just
+going
+to
+frighten
+him
+It
+was
+just
+foolishness
+foolishness
+foolishness
+Dr
+What
+is
+your
+name
+Sp
+Freda
+Freda
+Lesser
+Dr
+Do
+you
+realize
+that
+you
+have
+lost
+your
+body
+Sp
+I
+don
+t
+know
+anything
+except
+that
+I
+go
+to
+mother
+and
+Harry
+and
+all
+over
+and
+no
+one
+pays
+any
+attention
+to
+me
+I
+want
+to
+tell
+them
+how
+things
+happened
+but
+no
+one
+will
+listen
+to
+me
+not
+any
+one
+I
+am
+so
+distressed
+and
+I
+don
+t
+know
+why
+I
+cannot
+be
+heard
+when
+I
+talk
+I
+am
+so
+unhappy
+Dr
+The
+people
+you
+refer
+to
+do
+not
+know
+that
+you
+are
+there
+You
+are
+invisible
+to
+them
+Sp
+Oh
+that
+poor
+fellow
+is
+suffering
+for
+my
+foolishness
+You
+don
+t
+know
+what
+my
+condition
+is
+No
+one
+will
+listen
+to
+what
+I
+say
+not
+one
+Dr
+They
+do
+not
+know
+you
+are
+there
+You
+are
+invisible
+to
+us
+we
+cannot
+see
+you
+Sp
+Why
+can
+t
+you
+see
+me
+Crying
+again
+and
+wringing
+her
+hands
+Foolish
+girl
+foolish
+girl
+Dr
+You
+must
+try
+to
+control
+yourself
+You
+have
+been
+brought
+here
+by
+kind
+spirits
+and
+allowed
+to
+control
+my
+wife
+s
+body
+and
+brain
+for
+a
+short
+time
+You
+can
+only
+use
+this
+body
+temporarily
+Sp
+Why
+can
+t
+you
+tell
+those
+people
+that
+it
+was
+all
+my
+foolishness
+Dr
+They
+would
+not
+believe
+me
+if
+I
+did
+tell
+them
+Sp
+Tell
+them
+what
+Dr
+That
+a
+spirit
+came
+and
+talked
+to
+us
+Do
+you
+not
+realize
+that
+at
+the
+time
+the
+revolver
+went
+off
+you
+lost
+your
+body
+Sp
+I
+thought
+I
+had
+only
+hurt
+myself
+Oh
+how
+I
+suffered
+I
+do
+not
+see
+how
+I
+could
+be
+dead
+because
+when
+you
+die
+you
+never
+suffer
+any
+more
+and
+I
+have
+suffered
+Dr
+No
+one
+actually
+dies
+only
+the
+physical
+body
+is
+lost
+Your
+suffering
+was
+mental
+Sp
+But
+my
+head
+hurts
+so
+much
+Dr
+That
+is
+a
+mental
+condition
+also
+Sp
+Why
+can
+t
+Harry
+talk
+to
+me
+Dr
+He
+does
+not
+know
+you
+are
+there
+He
+cannot
+see
+you
+Sp
+I
+go
+where
+he
+is
+and
+try
+to
+tell
+them
+that
+the
+whole
+thing
+was
+caused
+by
+my
+foolishness
+Oh
+if
+I
+could
+only
+change
+things
+I
+took
+that
+revolver
+and
+said
+I
+was
+going
+to
+kill
+myself
+but
+I
+thought
+I
+would
+only
+scare
+him
+When
+he
+saw
+I
+had
+the
+revolver
+I
+he
+fought
+with
+me
+to
+get
+it
+away
+I
+didn
+t
+mean
+anything
+I
+was
+only
+fooling
+I
+love
+him
+and
+he
+loves
+me
+He
+did
+not
+know
+how
+the
+revolver
+came
+in
+his
+hands
+He
+had
+it
+in
+his
+auto
+I
+picked
+it
+up
+and
+hid
+it
+in
+my
+clothes
+for
+a
+while
+and
+then
+I
+told
+him
+I
+was
+going
+to
+kill
+myself
+Dr
+Had
+you
+any
+idea
+of
+marrying
+him
+Sp
+Yes
+some
+idea
+Dr
+Did
+you
+really
+care
+for
+him
+enough
+to
+marry
+him
+Sp
+Yes
+We
+had
+no
+quarrel
+I
+was
+just
+going
+to
+scare
+him
+but
+you
+know
+girls
+do
+foolish
+things
+sometimes
+I
+wanted
+to
+test
+him
+to
+see
+if
+he
+cared
+for
+me
+Crying
+Dr
+Remember
+you
+are
+using
+my
+wife
+s
+brain
+and
+body
+and
+must
+try
+to
+calm
+yourself
+Look
+around
+and
+you
+will
+find
+kind
+spirit
+friends
+who
+will
+help
+you
+Sp
+I
+can
+never
+be
+helped
+any
+more
+I
+m
+so
+unhappy
+Dr
+When
+you
+leave
+here
+you
+will
+be
+taken
+to
+the
+spirit
+world
+You
+have
+not
+yet
+found
+it
+because
+you
+have
+been
+so
+disturbed
+with
+your
+trouble
+Spirit
+friends
+are
+around
+you
+waiting
+to
+help
+you
+Sp
+I
+want
+to
+tell
+those
+men
+bow
+things
+happened
+but
+they
+will
+not
+listen
+to
+me
+They
+don
+t
+seem
+to
+hear
+me
+or
+see
+me
+I
+go
+to
+Harry
+and
+because
+he
+feels
+me
+around
+him
+sometimes
+they
+think
+that
+he
+is
+crazy
+Dr
+You
+are
+a
+free
+spirit
+now
+and
+you
+must
+listen
+to
+the
+spirit
+friends
+who
+are
+here
+They
+will
+teach
+you
+how
+to
+obtain
+understanding
+and
+overcome
+your
+troubles
+Sp
+Will
+they
+kill
+Harry
+for
+my
+foolishness
+Dr
+I
+hardly
+think
+so
+Sp
+Poor
+fellow
+poor
+fellow
+I
+feel
+so
+sorry
+for
+him
+and
+his
+mother
+They
+both
+cry
+and
+my
+mother
+cries
+Why
+did
+I
+do
+such
+a
+foolish
+thing
+It
+was
+a
+piece
+of
+folly
+Dr
+Now
+look
+around
+and
+see
+if
+you
+can
+see
+friends
+who
+will
+help
+you
+Sp
+There
+s
+a
+young
+lady
+standing
+there
+spirit
+and
+she
+says
+that
+she
+was
+helped
+here
+and
+she
+says
+she
+brought
+me
+here
+She
+says
+she
+was
+in
+the
+same
+trouble
+I
+was
+and
+that
+she
+was
+helped
+and
+is
+so
+happy
+now
+and
+that
+she
+can
+help
+me
+She
+says
+she
+was
+just
+as
+foolish
+as
+I
+was
+she
+took
+poison
+to
+scare
+her
+fellow
+and
+killed
+herself
+Dr
+Does
+she
+tell
+you
+her
+name
+Sp
+She
+says
+she
+has
+been
+around
+me
+because
+she
+does
+missionary
+work
+helping
+to
+take
+care
+of
+girls
+in
+the
+same
+trouble
+as
+myself
+Dr
+Does
+she
+look
+sorrowful
+Sp
+No
+she
+looks
+happy
+She
+says
+she
+goes
+around
+and
+finds
+unfortunate
+girls
+who
+are
+in
+the
+same
+condition
+she
+was
+in
+when
+she
+went
+to
+spirit
+life
+Crying
+Dr
+Don
+t
+allow
+yourself
+to
+become
+excited
+You
+do
+not
+realize
+what
+a
+privilege
+you
+have
+in
+being
+allowed
+to
+control
+a
+mortal
+body
+and
+obtain
+understanding
+Many
+remain
+in
+a
+bewildered
+condition
+for
+years
+and
+years
+Sp
+The
+lady
+standing
+there
+says
+you
+helped
+her
+when
+she
+was
+in
+the
+same
+trouble
+I
+am
+Dr
+What
+washer
+name
+Sp
+She
+says
+her
+name
+is
+Marion
+Lambert
+She
+says
+she
+works
+hard
+to
+help
+unfortunate
+girls
+who
+are
+in
+trouble
+and
+do
+foolish
+things
+and
+that
+she
+tries
+to
+help
+them
+to
+happiness
+She
+says
+that
+is
+her
+mission
+and
+that
+is
+why
+she
+brought
+me
+here
+Crying
+Dr
+Try
+to
+understand
+that
+you
+are
+using
+the
+body
+of
+this
+psychic
+only
+temporarily
+and
+must
+not
+misuse
+it
+by
+becoming
+excited
+This
+girl
+you
+see
+came
+to
+us
+some
+years
+ago
+in
+the
+same
+distressed
+condition
+that
+you
+are
+in
+Now
+she
+tells
+you
+that
+she
+is
+happy
+and
+doing
+missionary
+work
+Sp
+Can
+I
+ever
+be
+happy
+Dr
+Of
+course
+you
+can
+This
+is
+only
+a
+temporary
+trouble
+you
+are
+in
+No
+one
+ever
+dies
+it
+is
+only
+the
+physical
+body
+which
+is
+lost
+The
+spirit
+cannot
+die
+Sp
+But
+I
+never
+understood
+that
+I
+never
+heard
+anything
+about
+spirits
+before
+Dr
+If
+any
+one
+had
+spoken
+to
+you
+about
+spirits
+while
+you
+were
+in
+earth
+life
+you
+would
+probably
+have
+laughed
+at
+the
+idea
+Sp
+The
+lady
+says
+she
+will
+take
+care
+of
+me
+she
+wants
+me
+to
+rest
+I
+am
+so
+tired
+She
+says
+that
+I
+must
+go
+with
+her
+and
+also
+that
+I
+must
+thank
+you
+for
+the
+opportunity
+of
+coming
+here
+Will
+I
+have
+any
+more
+of
+that
+awful
+crying
+Dr
+No
+You
+will
+be
+taught
+the
+real
+lesson
+of
+life
+Physical
+life
+is
+only
+temporary
+Every
+one
+has
+troubles
+of
+one
+kind
+or
+another
+but
+through
+trouble
+we
+become
+wiser
+Sp
+Gazing
+intently
+at
+some
+spirit
+her
+face
+brightened
+then
+she
+shook
+her
+head
+No
+no
+that
+cannot
+be
+Crying
+Dr
+What
+do
+you
+see
+Sp
+I
+was
+expecting
+a
+baby
+and
+a
+girl
+has
+come
+holding
+a
+baby
+which
+she
+says
+belongs
+to
+me
+Can
+I
+have
+it
+Dr
+Certainly
+you
+can
+Sp
+But
+I
+am
+not
+worthy
+They
+will
+look
+down
+on
+me
+Dr
+You
+are
+not
+going
+to
+remain
+on
+earth
+Sp
+I
+feel
+much
+happier
+than
+I
+did
+when
+I
+came
+When
+did
+the
+baby
+come
+Dr
+The
+baby
+was
+freed
+when
+you
+lost
+your
+body
+Sp
+I
+don
+t
+see
+how
+that
+could
+happen
+Dr
+Many
+things
+happen
+with
+which
+you
+are
+not
+familiar
+You
+do
+not
+understand
+the
+wonderful
+mystery
+of
+life
+Sp
+Did
+I
+kill
+the
+baby
+too
+when
+the
+revolver
+went
+off
+Dr
+When
+your
+body
+was
+killed
+the
+spirit
+of
+the
+little
+on
+was
+also
+liberated
+While
+you
+are
+talking
+through
+this
+body
+we
+cannot
+see
+you
+The
+real
+things
+of
+life
+are
+invisible
+Did
+you
+ever
+see
+music
+Sp
+I
+have
+heard
+it
+I
+hear
+beautiful
+music
+now
+Dr
+You
+are
+beginning
+to
+realize
+the
+real
+things
+of
+life
+Sp
+Another
+beautiful
+lady
+with
+white
+hair
+is
+here
+and
+she
+says
+she
+will
+be
+my
+mother
+for
+the
+present
+and
+she
+will
+take
+care
+of
+me
+She
+says
+she
+belongs
+to
+the
+Mercy
+Band
+Dr
+The
+Mercy
+Band
+of
+spirits
+is
+trying
+to
+bring
+before
+the
+world
+the
+fact
+that
+there
+is
+no
+death
+and
+for
+many
+years
+we
+have
+been
+cooperating
+with
+them
+helping
+spirits
+who
+are
+in
+trouble
+and
+darkness
+Sp
+This
+lady
+is
+very
+beautiful
+She
+is
+not
+the
+one
+who
+was
+here
+first
+nor
+the
+one
+with
+the
+baby
+This
+one
+says
+her
+name
+is
+Mrs
+Case
+Dr
+When
+she
+was
+on
+earth
+she
+was
+greatly
+interested
+in
+this
+work
+Sp
+The
+other
+lady
+says
+she
+will
+take
+care
+of
+my
+baby
+because
+that
+is
+her
+work
+She
+says
+her
+name
+is
+Abbie
+Judson
+and
+she
+takes
+care
+of
+the
+waif
+children
+She
+says
+she
+was
+a
+Spiritualist
+when
+on
+earth
+and
+that
+she
+wrote
+Oh
+I
+feel
+so
+sorry
+for
+poor
+Harry
+Will
+he
+ever
+forgive
+me
+Dr
+He
+knows
+the
+circumstances
+and
+he
+will
+forgive
+you
+Sp
+Please
+can
+I
+go
+with
+these
+people
+Will
+I
+cry
+any
+more
+I
+have
+been
+crying
+so
+much
+that
+my
+eyes
+hurt
+me
+Dr
+The
+spirit
+friends
+will
+enlighten
+you
+and
+will
+teach
+you
+life
+s
+lessons
+and
+you
+will
+be
+happy
+A
+sudden
+death
+undoubtedly
+attributable
+to
+spirit
+influence
+was
+that
+of
+Olive
+T
+well
+known
+motion
+picture
+actress
+The
+newspapers
+reported
+that
+Olive
+T
+had
+committed
+suicide
+See
+Chap
+Page
+Spirit
+Mrs
+Case
+See
+Chap
+Page
+Spirit
+Olive
+T
+one
+evening
+in
+the
+early
+fall
+of
+in
+Paris
+France
+and
+six
+days
+later
+her
+chum
+Anna
+D
+also
+ended
+her
+life
+Shortly
+after
+the
+following
+occurred
+EXPERIENCE
+SEPTEMBER
+Spirit
+OLIVE
+T
+Psychic
+MRS
+WICKLAND
+The
+spirit
+seemed
+to
+be
+in
+painful
+contortions
+and
+was
+crying
+wretchedly
+Doctor
+Who
+are
+you
+friend
+Come
+tell
+us
+who
+you
+are
+Tell
+us
+what
+is
+troubling
+you
+and
+why
+you
+are
+crying
+You
+have
+been
+brought
+here
+to
+be
+helped
+Spirit
+Oh
+look
+Look
+at
+that
+Dr
+What
+do
+you
+see
+Sp
+Look
+there
+Oh
+look
+Isn
+t
+that
+horrible
+that
+face
+Alluding
+to
+an
+invisible
+entity
+Dr
+Do
+you
+know
+where
+you
+are
+You
+are
+in
+California
+Sp
+Help
+me
+Oh
+help
+me
+Dr
+You
+must
+be
+reasonable
+Sp
+Give
+me
+something
+to
+drink
+champagne
+give
+me
+some
+champagne
+Dr
+You
+are
+now
+a
+spirit
+and
+will
+have
+no
+further
+use
+for
+champagne
+You
+have
+lost
+your
+body
+and
+are
+now
+in
+California
+Sp
+Writhing
+with
+face
+distorted
+as
+if
+in
+intense
+pain
+Oh
+look
+Help
+me
+Dr
+Try
+to
+realize
+that
+you
+have
+lost
+your
+own
+body
+and
+are
+now
+controlling
+the
+body
+of
+my
+wife
+who
+is
+a
+psychic
+sensitive
+Intelligent
+spirits
+have
+brought
+you
+here
+that
+you
+might
+be
+helped
+You
+can
+only
+stay
+a
+short
+time
+Sp
+Give
+me
+something
+to
+drink
+Dr
+Who
+are
+you
+What
+is
+your
+name
+We
+have
+nothing
+to
+drink
+and
+would
+not
+give
+it
+to
+you
+if
+we
+had
+Try
+to
+realize
+your
+situation
+Sp
+Take
+me
+out
+of
+this
+Dr
+Out
+of
+what
+Try
+to
+be
+reasonable
+and
+the
+intelligent
+spirits
+can
+help
+you
+and
+bring
+you
+to
+a
+better
+understanding
+Sp
+With
+intense
+excitement
+Get
+some
+champagne
+for
+me
+Dr
+You
+must
+not
+act
+so
+wildly
+Realize
+that
+you
+are
+now
+a
+spirit
+My
+wife
+is
+a
+psychic
+intermediary
+and
+allows
+spirits
+like
+yourself
+to
+control
+her
+body
+that
+they
+may
+be
+helped
+Don
+t
+you
+understand
+that
+you
+are
+in
+a
+strange
+condition
+Sp
+I
+don
+t
+care
+Dr
+You
+will
+not
+gain
+anything
+by
+acting
+in
+this
+way
+Excitement
+will
+only
+add
+to
+your
+misery
+Sp
+Complaining
+a
+great
+pain
+I
+want
+champagne
+and
+I
+want
+it
+quick
+Dr
+You
+won
+t
+get
+any
+more
+champagne
+that
+life
+is
+past
+Your
+earthly
+life
+is
+over
+Come
+to
+a
+realization
+of
+your
+actual
+situation
+Intelligent
+spirits
+will
+help
+you
+and
+bring
+you
+to
+a
+better
+condition
+in
+the
+spirit
+life
+Sp
+Give
+me
+a
+cigarette
+Dr
+You
+will
+not
+get
+any
+more
+cigarettes
+Tell
+us
+who
+you
+are
+and
+what
+your
+situation
+is
+Your
+only
+salvation
+now
+is
+to
+realize
+your
+condition
+then
+you
+will
+have
+understanding
+and
+progress
+in
+spirit
+life
+Where
+did
+you
+come
+from
+You
+cannot
+satisfy
+your
+earthly
+cravings
+any
+longer
+Tell
+us
+your
+troubles
+Do
+you
+know
+that
+you
+are
+in
+Los
+Angeles
+California
+Sp
+Becoming
+greatly
+excited
+and
+pointing
+Look
+at
+that
+man
+standing
+over
+there
+Spirit
+He
+s
+horrible
+horrible
+I
+am
+so
+afraid
+of
+him
+Don
+t
+let
+him
+come
+near
+me
+He
+looks
+terrible
+Don
+t
+let
+him
+touch
+me
+Dr
+Listen
+to
+us
+we
+are
+your
+friends
+We
+understand
+your
+condition
+Tell
+us
+who
+you
+are
+Sp
+I
+cannot
+tell
+just
+now
+I
+am
+too
+afraid
+Oh
+I
+m
+so
+afraid
+of
+that
+man
+He
+haunts
+me
+he
+s
+with
+me
+all
+the
+time
+What
+is
+this
+place
+Dr
+This
+is
+a
+psychic
+circle
+where
+we
+help
+spirits
+that
+are
+in
+darkness
+and
+ignorance
+If
+you
+will
+calm
+yourself
+and
+try
+to
+be
+quiet
+we
+shall
+be
+able
+to
+help
+you
+Believe
+what
+I
+tell
+you
+then
+we
+can
+help
+you
+Sp
+The
+man
+over
+there
+is
+making
+such
+horrible
+faces
+at
+me
+that
+it
+frightens
+me
+Dr
+Try
+to
+compose
+yourself
+then
+our
+spirit
+forces
+can
+aid
+you
+Sp
+I
+don
+t
+understand
+you
+Dr
+You
+are
+a
+spirit
+and
+the
+man
+you
+see
+is
+also
+a
+spirit
+You
+have
+lost
+your
+physical
+body
+and
+now
+have
+a
+spirit
+body
+Sp
+I
+don
+t
+understand
+you
+and
+I
+m
+so
+afraid
+Dr
+You
+do
+not
+need
+to
+fear
+just
+listen
+Our
+spirit
+forces
+will
+help
+you
+if
+you
+will
+be
+quiet
+Sp
+Suddenly
+animated
+at
+the
+sight
+of
+some
+invisible
+Oh
+Anna
+Anna
+D
+Where
+did
+you
+come
+from
+She
+s
+afraid
+of
+that
+man
+too
+He
+is
+going
+over
+to
+Anna
+Don
+t
+let
+him
+get
+her
+Dr
+Tell
+us
+who
+you
+are
+then
+we
+can
+help
+you
+more
+easily
+Sp
+I
+am
+Olive
+T
+Dr
+Then
+you
+passed
+out
+just
+before
+Anna
+D
+did
+Neither
+of
+you
+realizes
+that
+you
+have
+lost
+your
+physical
+body
+She
+also
+needs
+help
+Sp
+She
+s
+not
+dead
+Dr
+She
+does
+not
+realize
+any
+more
+than
+you
+do
+that
+she
+has
+passed
+out
+of
+her
+physical
+body
+Sp
+Anna
+how
+did
+you
+get
+here
+Dr
+You
+are
+both
+spirits
+and
+can
+stay
+here
+only
+a
+short
+time
+Do
+you
+not
+realize
+that
+you
+have
+passed
+out
+of
+your
+bodies
+that
+something
+strange
+has
+taken
+place
+To
+Olive
+T
+You
+were
+in
+Paris
+and
+now
+you
+are
+in
+California
+Sp
+California
+Please
+tell
+me
+who
+that
+nice
+looking
+lady
+is
+standing
+over
+there
+Spirit
+Dr
+Probably
+she
+is
+some
+spirit
+who
+brought
+you
+here
+for
+help
+Ask
+her
+who
+she
+is
+Sp
+Why
+it
+s
+Anna
+H
+Dr
+She
+is
+serving
+those
+who
+are
+in
+trouble
+Sp
+Crying
+I
+can
+t
+see
+any
+more
+What
+s
+the
+matter
+with
+me
+Where
+am
+I
+Dr
+You
+are
+in
+Los
+Angeles
+California
+Sp
+Yes
+but
+I
+m
+not
+with
+my
+own
+folks
+Where
+are
+they
+all
+Dr
+According
+to
+reports
+you
+were
+in
+Paris
+and
+had
+been
+out
+one
+evening
+after
+which
+you
+went
+to
+your
+apartment
+and
+committed
+suicide
+Sp
+There
+s
+the
+fellow
+that
+made
+me
+do
+that
+that
+man
+standing
+over
+there
+the
+one
+who
+made
+such
+horrible
+faces
+Spirit
+Dr
+He
+will
+not
+be
+able
+to
+bother
+you
+any
+more
+Sp
+He
+says
+he
+took
+me
+to
+that
+place
+where
+I
+was
+Crying
+Why
+should
+he
+do
+that
+I
+got
+so
+that
+I
+could
+not
+sleep
+because
+of
+that
+fellow
+he
+bothered
+me
+all
+the
+time
+Dr
+You
+must
+have
+been
+a
+psychic
+Sp
+Don
+t
+let
+him
+come
+near
+me
+I
+have
+already
+suffered
+so
+much
+through
+him
+Nobody
+knows
+bow
+I
+have
+suffered
+No
+one
+understood
+my
+different
+moods
+Dr
+How
+could
+they
+when
+they
+knew
+nothing
+about
+spirits
+troubling
+people
+You
+were
+obsessed
+and
+very
+few
+understand
+obsession
+Sp
+I
+feel
+very
+sick
+but
+please
+do
+not
+let
+me
+die
+I
+want
+to
+live
+See
+Chap
+Pages
+Spirit
+Anna
+H
+Dr
+Nobody
+ever
+dies
+only
+the
+physical
+body
+is
+lost
+You
+have
+lost
+your
+physical
+body
+and
+from
+now
+on
+you
+will
+begin
+to
+live
+in
+the
+spirit
+world
+Sp
+Say
+Anna
+D
+why
+are
+you
+here
+Dr
+Does
+she
+know
+that
+she
+has
+passed
+away
+Sp
+Agitated
+and
+weeping
+anew
+with
+fright
+That
+fellow
+standing
+over
+there
+he
+is
+the
+cause
+of
+her
+death
+he
+says
+so
+Dr
+You
+are
+using
+my
+wife
+s
+brain
+and
+body
+and
+you
+must
+try
+to
+quiet
+yourself
+Anna
+H
+brought
+you
+here
+for
+help
+Sp
+She
+doesn
+t
+care
+for
+me
+Dr
+Listen
+to
+what
+she
+says
+be
+calm
+and
+listen
+By
+being
+quiet
+you
+can
+be
+helped
+You
+must
+have
+some
+regard
+for
+my
+wife
+s
+nervous
+system
+She
+allows
+spirits
+like
+you
+to
+control
+her
+body
+so
+you
+must
+not
+misuse
+it
+Listen
+to
+what
+Anna
+H
+says
+Sp
+Anna
+H
+says
+that
+she
+is
+now
+serving
+those
+who
+are
+in
+the
+dark
+because
+of
+their
+foolishness
+selfishness
+and
+the
+misuse
+of
+money
+She
+is
+striving
+to
+do
+her
+part
+Crying
+again
+If
+I
+had
+only
+understood
+Dr
+You
+would
+not
+have
+listened
+to
+anything
+about
+spirits
+when
+you
+had
+your
+body
+Sp
+I
+don
+t
+know
+what
+you
+mean
+Dr
+I
+mean
+that
+you
+have
+lost
+your
+mortal
+body
+and
+are
+now
+controlling
+my
+wife
+s
+body
+We
+are
+talking
+to
+you
+but
+we
+do
+not
+see
+you
+Sp
+Where
+am
+I
+Dr
+You
+are
+in
+Highland
+Park
+Los
+Angeles
+Sp
+I
+can
+t
+understand
+things
+Anna
+Anna
+DJ
+How
+did
+you
+come
+here
+Are
+you
+in
+Paris
+too
+Dr
+What
+does
+she
+say
+Sp
+She
+says
+she
+doesn
+t
+know
+anything
+she
+feels
+so
+strange
+Dr
+She
+is
+also
+a
+spirit
+and
+does
+not
+understand
+her
+condition
+Sp
+Anna
+H
+brought
+her
+here
+too
+She
+says
+that
+by
+serving
+others
+she
+has
+progressed
+Dr
+She
+controlled
+this
+psychic
+about
+two
+years
+ago
+Sp
+She
+says
+that
+she
+will
+take
+care
+of
+us
+both
+and
+that
+I
+can
+get
+rest
+and
+sleep
+I
+will
+go
+with
+her
+and
+will
+take
+Anna
+D
+along
+with
+me
+because
+Anna
+H
+brought
+us
+two
+together
+She
+says
+Anna
+D
+also
+needs
+help
+Dr
+You
+will
+find
+many
+intelligent
+spirits
+who
+will
+be
+willing
+to
+help
+you
+Sp
+That
+horrible
+fellow
+cannot
+bother
+me
+any
+more
+can
+he
+He
+scared
+both
+Anna
+D
+and
+me
+We
+were
+together
+so
+much
+Dr
+The
+man
+you
+speak
+of
+is
+also
+a
+spirit
+He
+will
+not
+trouble
+you
+any
+more
+Sp
+I
+got
+so
+that
+I
+could
+not
+sleep
+and
+I
+felt
+so
+badly
+Dr
+I
+presume
+that
+the
+spirit
+you
+speak
+of
+impressed
+you
+to
+do
+the
+things
+you
+did
+Sp
+Yes
+that
+is
+so
+Dr
+Now
+you
+must
+go
+with
+Anna
+H
+she
+and
+the
+others
+will
+help
+you
+Sp
+She
+says
+I
+can
+go
+to
+sleep
+and
+rest
+I
+see
+so
+many
+people
+and
+I
+don
+t
+know
+who
+they
+are
+Spirits
+I
+am
+tired
+and
+want
+to
+rest
+I
+have
+not
+had
+any
+rest
+for
+years
+it
+seems
+but
+it
+is
+only
+a
+short
+time
+I
+suppose
+Now
+I
+will
+go
+with
+Anna
+H
+Goodbye
+Shortly
+after
+the
+death
+of
+Virginia
+R
+cinema
+star
+who
+died
+in
+San
+Francisco
+the
+spirit
+of
+the
+girl
+was
+brought
+by
+Olive
+T
+to
+our
+circle
+to
+be
+awakened
+and
+afterward
+Olive
+T
+herself
+spoke
+through
+the
+psychic
+EXPERIENCE
+APRIL
+Spirit
+OLIVE
+T
+Psychic
+MRS
+WICKLAND
+I
+felt
+that
+I
+must
+come
+in
+and
+thank
+you
+for
+the
+glory
+that
+has
+been
+bestowed
+upon
+me
+since
+the
+time
+I
+was
+here
+last
+During
+our
+childhood
+we
+should
+be
+taught
+the
+real
+lesson
+of
+life
+and
+made
+to
+understand
+life
+in
+its
+true
+sense
+Let
+pictures
+be
+shown
+of
+the
+real
+life
+If
+they
+would
+put
+on
+the
+screen
+the
+pictures
+of
+the
+real
+life
+the
+real
+understanding
+and
+teach
+the
+people
+that
+there
+is
+no
+death
+teach
+them
+of
+the
+beautiful
+conditions
+on
+the
+other
+side
+of
+life
+which
+are
+waiting
+for
+every
+one
+entitled
+to
+them
+after
+they
+understand
+the
+higher
+life
+the
+world
+would
+be
+different
+I
+lived
+in
+a
+life
+of
+make
+believe
+and
+we
+tried
+to
+amuse
+humanity
+I
+am
+sorry
+for
+the
+girls
+who
+fall
+into
+a
+life
+of
+sport
+They
+think
+they
+have
+a
+good
+time
+yes
+for
+a
+while
+But
+there
+is
+always
+some
+little
+voice
+conscience
+that
+bothers
+you
+no
+matter
+how
+you
+try
+to
+kill
+it
+Oh
+if
+I
+could
+only
+teach
+the
+young
+girls
+tell
+them
+of
+the
+folly
+of
+such
+a
+life
+If
+I
+could
+only
+teach
+them
+to
+look
+up
+to
+the
+higher
+life
+and
+show
+them
+the
+truth
+of
+that
+life
+We
+should
+teach
+people
+to
+live
+for
+others
+not
+for
+self
+We
+should
+teach
+the
+girls
+the
+principles
+of
+life
+One
+thing
+that
+is
+very
+detrimental
+to
+the
+world
+is
+drink
+and
+morphine
+As
+conditions
+are
+now
+they
+are
+driving
+the
+girls
+and
+boys
+to
+misery
+People
+condemn
+without
+acting
+and
+what
+do
+they
+gain
+They
+drive
+the
+young
+to
+the
+depths
+because
+when
+the
+law
+forbids
+things
+they
+want
+them
+and
+in
+some
+way
+or
+another
+they
+get
+them
+They
+enjoy
+them
+more
+because
+they
+are
+forbidden
+There
+is
+also
+something
+else
+You
+know
+whiskey
+and
+the
+other
+alcoholic
+drinks
+have
+a
+thousand
+yes
+a
+million
+thoughts
+that
+go
+with
+them
+The
+cranks
+concentrate
+their
+minds
+on
+drink
+and
+condemn
+it
+and
+when
+sensitives
+get
+it
+they
+become
+wild
+They
+become
+crazy
+with
+all
+the
+thoughts
+that
+are
+sent
+with
+it
+It
+drives
+them
+down
+and
+down
+Man
+should
+live
+and
+learn
+of
+God
+s
+wonderful
+manifestations
+God
+is
+the
+Life
+of
+All
+but
+man
+is
+the
+devil
+I
+do
+not
+mean
+man
+alone
+when
+I
+say
+man
+but
+I
+mean
+humanity
+God
+gave
+us
+a
+free
+will
+but
+we
+misuse
+it
+People
+should
+be
+taught
+the
+true
+teachings
+of
+Christ
+They
+say
+Did
+not
+Christ
+make
+wine
+And
+did
+He
+not
+give
+it
+to
+the
+people
+They
+do
+not
+understand
+that
+it
+was
+the
+Wine
+of
+Life
+Christ
+spoke
+about
+the
+spiritual
+The
+majority
+of
+people
+think
+he
+spoke
+of
+the
+material
+Understand
+God
+right
+Do
+not
+let
+us
+fear
+Him
+He
+is
+not
+a
+man
+sitting
+on
+a
+throne
+but
+He
+is
+the
+Spirit
+of
+All
+Life
+Everything
+around
+us
+is
+a
+part
+of
+this
+Divine
+Life
+Evil
+has
+its
+place
+just
+as
+the
+good
+has
+If
+we
+had
+no
+evil
+we
+could
+not
+know
+the
+good
+It
+is
+only
+from
+the
+experiences
+we
+pass
+through
+that
+we
+learn
+the
+lessons
+of
+life
+that
+we
+gain
+wisdom
+and
+I
+learn
+of
+the
+life
+everlasting
+that
+lies
+before
+us
+My
+salvation
+came
+in
+the
+spirit
+world
+when
+I
+found
+the
+truth
+because
+I
+had
+been
+through
+misery
+After
+I
+had
+gone
+through
+the
+fire
+of
+conscience
+I
+was
+purified
+I
+was
+anxious
+to
+find
+the
+truth
+and
+after
+I
+found
+it
+there
+was
+no
+doubting
+I
+wanted
+peace
+and
+harmony
+and
+I
+was
+then
+ready
+for
+it
+You
+find
+gold
+after
+it
+has
+gone
+through
+the
+fire
+of
+purification
+After
+my
+soul
+had
+gone
+through
+the
+fire
+of
+conscience
+I
+found
+God
+within
+myself
+not
+on
+the
+outside
+Find
+God
+and
+be
+content
+within
+yourself
+Learn
+to
+understand
+yourself
+first
+before
+you
+judge
+others
+then
+you
+will
+not
+judge
+Let
+us
+be
+friends
+to
+all
+do
+good
+to
+all
+and
+do
+good
+whenever
+we
+can
+Let
+us
+conquer
+self
+Whenever
+self
+rises
+within
+you
+to
+torment
+you
+and
+tries
+to
+make
+you
+give
+way
+to
+anger
+and
+give
+way
+to
+drinking
+and
+all
+kinds
+of
+trouble
+say
+to
+yourself
+that
+you
+are
+not
+angry
+and
+that
+you
+will
+not
+give
+way
+to
+things
+Then
+instead
+of
+saying
+anything
+to
+others
+get
+up
+and
+turn
+around
+and
+your
+anger
+will
+be
+gone
+because
+you
+will
+not
+say
+what
+you
+wanted
+to
+and
+many
+times
+in
+that
+way
+you
+will
+have
+harmony
+When
+we
+are
+in
+a
+state
+of
+anger
+we
+say
+things
+that
+afterwards
+we
+are
+sorry
+for
+and
+sometimes
+these
+things
+can
+never
+be
+forgotten
+So
+let
+us
+always
+think
+if
+we
+feel
+anger
+coming
+over
+us
+that
+we
+will
+not
+give
+way
+to
+it
+let
+us
+turn
+around
+and
+say
+No
+I
+will
+conquer
+self
+I
+will
+look
+to
+higher
+things
+not
+the
+lower
+I
+will
+conquer
+and
+you
+cannot
+come
+in
+and
+torment
+I
+was
+in
+that
+state
+of
+anger
+and
+it
+was
+my
+death
+What
+did
+I
+do
+I
+killed
+myself
+I
+did
+not
+mean
+to
+kill
+myself
+but
+I
+did
+it
+in
+a
+mood
+of
+anger
+Conquer
+self
+before
+it
+is
+too
+late
+Conquer
+your
+anger
+before
+it
+goes
+too
+far
+I
+was
+swept
+by
+anger
+and
+what
+happened
+I
+killed
+myself
+Then
+when
+I
+woke
+up
+and
+saw
+what
+I
+had
+done
+I
+was
+in
+anguish
+It
+was
+through
+anger
+anger
+and
+selfishness
+Let
+us
+conquer
+and
+when
+anger
+comes
+in
+let
+us
+say
+Get
+thee
+behind
+me
+Satan
+Turnaround
+and
+that
+will
+shutout
+any
+spirit
+that
+would
+take
+possession
+of
+you
+If
+I
+had
+turned
+around
+I
+would
+not
+have
+done
+what
+I
+did
+If
+I
+could
+only
+tell
+people
+of
+the
+life
+they
+should
+live
+and
+have
+them
+put
+pictures
+on
+the
+screen
+of
+the
+true
+life
+and
+teachings
+of
+Jesus
+and
+the
+lessons
+He
+taught
+and
+how
+much
+good
+we
+could
+all
+do
+for
+humanity
+it
+would
+turn
+many
+criminals
+and
+they
+would
+become
+good
+men
+and
+omen
+This
+is
+Olive
+T
+Good
+Night
+Mrs
+R
+was
+a
+patient
+with
+such
+strong
+suicidal
+inclinations
+that
+she
+was
+unable
+to
+eat
+or
+sleep
+constantly
+scratched
+the
+hair
+from
+her
+head
+and
+had
+wasted
+away
+to
+a
+mere
+shadow
+She
+declared
+that
+she
+had
+killed
+five
+hundred
+persons
+and
+her
+one
+thought
+was
+to
+end
+her
+own
+life
+and
+since
+there
+seemed
+no
+hope
+of
+recovery
+she
+was
+placed
+in
+a
+sanitarium
+where
+she
+was
+confined
+in
+a
+locked
+room
+for
+three
+years
+After
+being
+placed
+in
+our
+care
+she
+made
+several
+attempts
+at
+self
+destruction
+but
+within
+a
+few
+weeks
+she
+was
+freed
+from
+a
+gloomy
+spirit
+who
+had
+himself
+committed
+suicide
+and
+from
+that
+time
+there
+was
+no
+further
+recurrence
+of
+the
+suicidal
+impulse
+Mrs
+R
+remained
+with
+us
+for
+some
+time
+gaining
+steadily
+in
+weight
+strength
+and
+health
+she
+became
+entirely
+normal
+and
+returned
+to
+live
+with
+her
+relatives
+taking
+up
+all
+her
+former
+occupations
+EXPERIENCE
+FEBRUARY
+Spirit
+RALPH
+STEVENSON
+Patient
+MRS
+R
+Psychic
+MRS
+WICKLAND
+Doctor
+Where
+did
+you
+come
+from
+Spirit
+I
+was
+straggling
+along
+and
+saw
+a
+light
+so
+I
+came
+in
+Dr
+Can
+you
+tell
+us
+who
+you
+are
+Sp
+No
+I
+don
+t
+know
+Dr
+Can
+t
+you
+remember
+what
+your
+name
+is
+Sp
+I
+can
+t
+seem
+to
+remember
+anything
+What
+is
+the
+matter
+with
+my
+head
+It
+hurts
+me
+so
+badly
+Dr
+What
+seems
+to
+be
+the
+matter
+with
+your
+head
+Sp
+It
+is
+difficult
+for
+me
+to
+think
+What
+am
+I
+here
+for
+Who
+are
+you
+Dr
+They
+call
+me
+Dr
+Wickland
+Sp
+What
+kind
+of
+a
+doctor
+are
+you
+Dr
+Medical
+What
+is
+your
+name
+Sp
+My
+name
+It
+is
+strange
+but
+I
+can
+t
+remember
+my
+name
+Dr
+How
+long
+have
+you
+been
+dead
+Sp
+Dead
+you
+say
+Why
+I
+m
+not
+dead
+I
+wish
+I
+were
+Dr
+Is
+life
+so
+unpleasant
+for
+you
+Sp
+Yes
+it
+is
+If
+I
+am
+dead
+then
+it
+is
+very
+hard
+to
+be
+dead
+I
+have
+tried
+and
+tried
+to
+die
+but
+it
+seems
+every
+single
+time
+I
+come
+to
+life
+again
+Why
+is
+it
+that
+I
+cannot
+die
+Dr
+There
+is
+no
+actual
+death
+Sp
+Of
+course
+there
+is
+Dr
+How
+do
+you
+know
+there
+is
+such
+a
+thing
+as
+death
+Sp
+I
+don
+t
+know
+anything
+In
+great
+distress
+I
+want
+to
+die
+I
+want
+to
+die
+Life
+is
+so
+dark
+and
+gloomy
+I
+wish
+I
+could
+die
+and
+forget
+forget
+just
+forget
+Why
+can
+t
+I
+die
+I
+think
+sometimes
+I
+am
+dead
+then
+all
+at
+once
+I
+am
+alive
+again
+I
+want
+to
+forget
+all
+the
+trouble
+and
+agony
+that
+I
+have
+Where
+shall
+I
+go
+so
+that
+I
+can
+die
+Sometimes
+I
+get
+in
+places
+auras
+but
+I
+am
+always
+pushed
+out
+in
+the
+dark
+again
+and
+I
+go
+from
+place
+to
+place
+I
+cannot
+find
+my
+home
+and
+I
+cannot
+die
+What
+is
+the
+matter
+Oh
+let
+me
+forget
+just
+for
+a
+little
+while
+Let
+me
+be
+free
+from
+my
+thoughts
+and
+this
+horrible
+darkness
+Why
+can
+t
+I
+die
+Dr
+You
+are
+on
+the
+wrong
+path
+friend
+Sp
+Then
+where
+shall
+I
+find
+the
+right
+path
+Dr
+Within
+yourself
+Sp
+There
+was
+a
+time
+when
+I
+believed
+in
+a
+God
+and
+there
+was
+a
+time
+when
+I
+believed
+in
+Heaven
+and
+hell
+but
+not
+any
+more
+It
+is
+dark
+and
+gloomy
+and
+my
+conscience
+accuses
+me
+so
+Let
+me
+forget
+I
+want
+to
+forget
+oh
+how
+I
+want
+to
+forget
+Dr
+Do
+you
+know
+that
+you
+have
+lost
+your
+physical
+body
+Sp
+I
+do
+not
+know
+anything
+about
+it
+Dr
+Why
+are
+you
+here
+Sp
+I
+see
+you
+people
+I
+don
+t
+know
+any
+of
+you
+but
+as
+I
+look
+in
+your
+faces
+you
+appear
+to
+be
+good
+Will
+you
+take
+me
+in
+and
+give
+me
+a
+little
+light
+and
+some
+happiness
+I
+have
+not
+seen
+either
+for
+years
+and
+years
+Dr
+What
+is
+causing
+all
+your
+trouble
+Sp
+Why
+is
+it
+there
+is
+no
+God
+Why
+does
+He
+let
+me
+be
+in
+this
+darkness
+and
+gloom
+I
+was
+once
+a
+good
+boy
+but
+I
+was
+oh
+I
+can
+t
+say
+it
+I
+must
+not
+say
+it
+No
+no
+I
+must
+not
+Greatly
+agitated
+Dr
+Tell
+us
+what
+is
+on
+your
+mind
+Sp
+I
+have
+done
+a
+great
+wrong
+I
+can
+never
+be
+forgiven
+God
+would
+not
+forgive
+any
+one
+like
+me
+no
+no
+no
+Dr
+Try
+to
+understand
+your
+condition
+we
+can
+help
+you
+You
+say
+you
+are
+a
+man
+Sp
+I
+am
+a
+man
+Dr
+You
+are
+using
+a
+woman
+s
+body
+Sp
+I
+cannot
+think
+how
+I
+could
+have
+become
+a
+woman
+in
+my
+sorrows
+and
+not
+know
+it
+Seeing
+an
+invisible
+and
+becoming
+wildly
+excited
+Don
+t
+come
+here
+don
+t
+don
+t
+Go
+away
+Look
+look
+Look
+over
+there
+Go
+away
+I
+can
+t
+stand
+it
+Dr
+What
+have
+you
+done
+Sp
+If
+I
+should
+tell
+you
+I
+would
+be
+arrested
+I
+cannot
+stay
+any
+longer
+I
+must
+go
+now
+I
+must
+run
+away
+I
+must
+The
+patient
+Mrs
+R
+had
+a
+number
+of
+times
+attempted
+to
+run
+away
+They
+are
+coming
+after
+me
+and
+if
+I
+stay
+they
+will
+catch
+me
+Let
+me
+go
+There
+they
+are
+my
+accusers
+Dr
+Where
+do
+you
+think
+you
+are
+Sp
+In
+New
+York
+Dr
+You
+are
+far
+from
+New
+York
+you
+are
+in
+Los
+Angeles
+California
+What
+year
+do
+you
+think
+it
+is
+Do
+you
+know
+it
+is
+Sp
+That
+can
+t
+be
+Dr
+What
+year
+do
+you
+think
+it
+is
+Sp
+Dr
+That
+was
+seventeen
+years
+ago
+Can
+t
+you
+realize
+that
+You
+have
+lost
+your
+physical
+body
+There
+is
+no
+actual
+death
+only
+transition
+Only
+the
+physical
+body
+is
+lost
+Did
+you
+ever
+study
+the
+problems
+of
+life
+and
+death
+Sp
+No
+I
+never
+studied
+anything
+I
+only
+believed
+My
+name
+is
+Ralph
+but
+I
+forget
+my
+last
+name
+My
+father
+is
+dead
+Dr
+No
+more
+than
+you
+are
+Sp
+Of
+course
+I
+am
+not
+dead
+I
+wish
+I
+were
+Will
+you
+please
+take
+me
+away
+from
+here
+and
+kill
+me
+so
+that
+I
+can
+die
+Mrs
+R
+had
+often
+begged
+to
+be
+killed
+Oh
+here
+they
+are
+coming
+again
+I
+will
+not
+confess
+If
+I
+do
+they
+will
+put
+me
+in
+prison
+and
+I
+am
+in
+trouble
+enough
+Dr
+You
+are
+in
+darkness
+owing
+to
+your
+ignorance
+Confess
+and
+we
+will
+help
+you
+Sp
+I
+cannot
+confess
+I
+have
+tried
+before
+but
+I
+could
+not
+My
+past
+stands
+out
+right
+before
+me
+Dr
+From
+what
+you
+say
+you
+have
+evidently
+been
+obsessing
+people
+and
+in
+your
+effort
+to
+kill
+yourself
+you
+have
+probably
+caused
+others
+to
+commit
+suicide
+Haven
+t
+you
+found
+yourself
+in
+queer
+circumstances
+at
+times
+Sp
+I
+did
+not
+try
+to
+understand
+myself
+In
+alarm
+Oh
+Alice
+Spirit
+No
+no
+I
+am
+afraid
+I
+did
+not
+mean
+to
+do
+what
+I
+did
+No
+Alice
+don
+t
+accuse
+me
+Dr
+If
+you
+will
+tell
+us
+what
+your
+trouble
+is
+we
+can
+help
+you
+Sp
+We
+told
+each
+other
+that
+we
+would
+die
+but
+we
+did
+not
+die
+Alice
+why
+did
+you
+tell
+me
+to
+kill
+you
+Why
+did
+you
+I
+killed
+you
+first
+and
+then
+I
+killed
+myself
+but
+I
+could
+not
+die
+Oh
+Alice
+Alice
+Dr
+She
+probably
+understands
+conditions
+better
+than
+you
+do
+Sp
+She
+says
+Ralph
+we
+were
+foolish
+I
+will
+tell
+you
+but
+I
+know
+I
+shall
+be
+arrested
+when
+I
+get
+through
+Alice
+and
+I
+were
+engaged
+to
+be
+married
+but
+her
+parents
+did
+not
+want
+us
+to
+marry
+because
+they
+thought
+I
+was
+not
+what
+I
+should
+be
+We
+loved
+each
+other
+very
+dearly
+so
+we
+decided
+that
+I
+should
+kill
+her
+then
+kill
+myself
+I
+did
+it
+but
+I
+never
+could
+kill
+myself
+and
+I
+guess
+as
+Alice
+is
+here
+I
+did
+not
+kill
+her
+either
+Ever
+since
+I
+tried
+to
+kill
+her
+she
+comes
+and
+accuses
+me
+Alice
+and
+I
+were
+together
+and
+she
+said
+all
+the
+time
+Now
+kill
+me
+Quick
+quick
+Kill
+me
+Go
+ahead
+Do
+it
+Do
+it
+I
+hesitated
+because
+I
+loved
+her
+but
+she
+kept
+on
+saying
+Do
+it
+quick
+Do
+it
+I
+still
+hesitated
+but
+Alice
+said
+Come
+now
+do
+it
+Be
+quick
+I
+could
+not
+so
+she
+said
+since
+she
+could
+not
+go
+home
+again
+and
+we
+could
+not
+marry
+why
+not
+die
+together
+But
+she
+would
+not
+do
+the
+deed
+herself
+I
+could
+not
+do
+it
+either
+She
+kept
+urging
+me
+to
+kill
+her
+so
+at
+last
+I
+shut
+my
+eyes
+and
+shot
+her
+and
+then
+I
+shot
+myself
+before
+I
+saw
+her
+fall
+I
+saw
+her
+lying
+on
+the
+floor
+and
+I
+tried
+to
+run
+away
+after
+I
+got
+up
+and
+I
+ran
+and
+ran
+and
+ran
+and
+I
+have
+been
+running
+and
+walking
+ever
+since
+trying
+to
+forget
+but
+I
+cannot
+Sometimes
+Alice
+comes
+to
+me
+but
+I
+always
+say
+No
+I
+am
+the
+cause
+of
+your
+death
+so
+stay
+away
+from
+me
+I
+ran
+and
+ran
+to
+get
+away
+from
+the
+police
+and
+everybody
+else
+A
+while
+ago
+I
+felt
+I
+was
+an
+old
+woman
+and
+I
+could
+not
+get
+away
+from
+being
+a
+woman
+for
+a
+long
+time
+I
+got
+away
+but
+after
+a
+while
+I
+was
+that
+old
+woman
+again
+Dr
+You
+were
+obsessing
+somebody
+at
+that
+time
+Sp
+Obsessing
+What
+do
+you
+mean
+by
+that
+Dr
+Did
+you
+ever
+read
+in
+the
+Bible
+of
+unclean
+spirits
+Sp
+Yes
+I
+did
+But
+when
+I
+was
+that
+old
+woman
+I
+wanted
+to
+die
+and
+I
+could
+not
+I
+could
+not
+get
+rid
+of
+that
+old
+woman
+hanging
+around
+me
+either
+I
+could
+not
+get
+her
+away
+from
+me
+I
+don
+t
+want
+to
+be
+around
+that
+old
+woman
+any
+more
+Excitedly
+Oh
+Alice
+don
+t
+come
+When
+I
+was
+with
+the
+old
+woman
+there
+were
+such
+sharp
+sparks
+like
+lightning
+on
+me
+I
+thought
+they
+would
+kill
+me
+and
+I
+wanted
+to
+die
+The
+patient
+had
+often
+said
+that
+she
+hoped
+the
+electrical
+treatments
+would
+kill
+her
+They
+seemed
+to
+be
+like
+a
+streak
+of
+lightning
+and
+it
+struck
+me
+but
+I
+did
+not
+die
+Dr
+Those
+sparks
+were
+caused
+by
+static
+electricity
+which
+was
+given
+to
+one
+of
+our
+patients
+whom
+you
+have
+evidently
+been
+obsessing
+She
+always
+talked
+of
+dying
+just
+as
+you
+are
+doing
+you
+have
+been
+controlling
+her
+and
+ruining
+her
+life
+The
+electricity
+drove
+you
+away
+from
+her
+she
+will
+be
+well
+and
+you
+will
+now
+be
+helped
+When
+you
+leave
+here
+you
+will
+go
+with
+Alice
+who
+will
+help
+you
+to
+understand
+your
+condition
+You
+do
+not
+yet
+realize
+that
+you
+have
+lost
+your
+physical
+body
+and
+that
+you
+are
+still
+alive
+Alice
+is
+a
+spirit
+just
+as
+you
+are
+You
+are
+an
+invisible
+spirit
+and
+are
+controlling
+my
+wife
+s
+body
+Spirit
+and
+mind
+never
+die
+Sp
+Do
+you
+think
+I
+shall
+ever
+find
+peace
+I
+should
+like
+to
+have
+just
+one
+hour
+of
+peace
+Dr
+You
+have
+all
+eternity
+before
+you
+Sp
+Will
+I
+be
+forgiven
+for
+what
+I
+have
+done
+Dr
+Your
+own
+confession
+and
+sorrow
+are
+sufficient
+Be
+patient
+and
+willing
+to
+learn
+and
+you
+will
+be
+helped
+Sp
+There
+s
+my
+mother
+Spirit
+Mother
+I
+am
+not
+worthy
+to
+be
+called
+your
+son
+I
+loved
+you
+very
+dearly
+but
+I
+can
+t
+have
+you
+come
+to
+me
+now
+Weeping
+Oh
+Mother
+will
+you
+forgive
+me
+I
+love
+you
+still
+Will
+you
+take
+your
+wayward
+son
+and
+forgive
+him
+Will
+you
+give
+me
+happiness
+for
+a
+little
+while
+I
+have
+suffered
+oh
+so
+much
+Please
+take
+me
+with
+you
+if
+you
+can
+forgive
+me
+My
+own
+mother
+Dr
+Does
+your
+mother
+answer
+you
+Sp
+Mother
+says
+My
+son
+my
+son
+a
+mother
+s
+love
+is
+stronger
+than
+anything
+else
+I
+have
+tried
+so
+much
+and
+so
+many
+times
+to
+come
+close
+to
+you
+but
+you
+were
+always
+running
+away
+The
+first
+spirit
+left
+and
+the
+mother
+then
+spoke
+through
+the
+psychic
+Spirit
+MRS
+STEVENSON
+I
+am
+now
+united
+with
+my
+dear
+son
+For
+a
+long
+time
+I
+have
+tried
+to
+come
+in
+close
+touch
+with
+him
+but
+could
+not
+Each
+time
+that
+I
+thought
+I
+was
+going
+to
+reach
+him
+he
+would
+run
+away
+from
+me
+He
+has
+seen
+me
+many
+times
+but
+was
+afraid
+because
+he
+was
+taught
+the
+false
+doctrine
+that
+when
+we
+die
+we
+are
+dead
+and
+that
+is
+why
+people
+are
+afraid
+of
+the
+dead
+We
+do
+not
+die
+we
+simply
+pass
+on
+to
+the
+spirit
+side
+of
+life
+to
+a
+beautiful
+condition
+if
+we
+realize
+the
+truth
+But
+we
+must
+learn
+much
+regarding
+the
+next
+life
+while
+we
+are
+on
+earth
+Study
+your
+own
+life
+and
+yourself
+because
+if
+you
+do
+not
+you
+will
+be
+like
+my
+dear
+son
+He
+has
+been
+running
+for
+years
+trying
+to
+get
+away
+from
+me
+and
+his
+sweetheart
+and
+also
+from
+every
+policeman
+he
+has
+seen
+while
+in
+the
+earth
+sphere
+He
+has
+been
+obsessing
+a
+lady
+for
+some
+time
+and
+he
+had
+to
+stay
+in
+her
+magnetic
+aura
+because
+he
+did
+not
+know
+how
+to
+get
+away
+He
+has
+been
+in
+hell
+not
+a
+hell
+of
+fire
+but
+a
+hell
+of
+ignorance
+Look
+into
+conditions
+of
+the
+next
+life
+so
+that
+you
+may
+be
+prepared
+for
+death
+comes
+when
+it
+is
+not
+expected
+Be
+prepared
+not
+by
+belief
+but
+by
+actual
+knowledge
+Find
+out
+what
+is
+beyond
+the
+veil
+of
+death
+Then
+when
+the
+time
+comes
+for
+you
+to
+go
+to
+the
+spirit
+side
+of
+life
+you
+will
+go
+with
+open
+eyes
+and
+know
+where
+you
+are
+going
+and
+you
+will
+not
+be
+like
+my
+poor
+son
+an
+earthbound
+spirit
+My
+poor
+boy
+He
+is
+so
+tired
+and
+worried
+he
+is
+sick
+men
+tally
+I
+will
+nurse
+him
+and
+teach
+him
+of
+the
+life
+everlasting
+so
+that
+he
+can
+realize
+the
+beautiful
+condition
+in
+the
+spirit
+world
+Do
+not
+merely
+believe
+if
+you
+only
+believe
+you
+will
+stay
+just
+where
+you
+are
+We
+must
+all
+practice
+the
+Golden
+Rule
+to
+live
+for
+others
+and
+serve
+others
+then
+we
+will
+attain
+happiness
+when
+we
+pass
+to
+the
+spirit
+side
+of
+life
+Thank
+you
+for
+the
+help
+you
+have
+given
+my
+son
+A
+mother
+s
+love
+is
+strong
+and
+when
+you
+see
+my
+boy
+again
+he
+will
+be
+better
+because
+all
+doubt
+will
+be
+gone
+Doubt
+is
+a
+wall
+it
+is
+a
+wall
+we
+build
+for
+ourselves
+between
+life
+and
+death
+and
+that
+doubt
+can
+never
+bring
+mother
+and
+son
+together
+He
+ran
+away
+from
+me
+whenever
+he
+saw
+me
+and
+neither
+Alice
+nor
+I
+could
+come
+near
+him
+He
+thought
+he
+was
+alive
+and
+that
+he
+had
+not
+killed
+himself
+Some
+time
+ago
+he
+came
+in
+contact
+with
+a
+sensitive
+person
+a
+woman
+and
+has
+been
+obsessing
+her
+but
+he
+thought
+he
+was
+in
+prison
+I
+thank
+you
+all
+tonight
+for
+the
+help
+given
+my
+son
+and
+may
+God
+bless
+you
+for
+the
+work
+you
+are
+doing
+Goodbye
+CHAPTER
+VIII
+Spirits
+and
+Narcotics
+Inebriety
+Amnesia
+RELENTLESS
+as
+is
+the
+grip
+which
+the
+drug
+habit
+holds
+on
+its
+mortal
+victims
+the
+power
+of
+narcotics
+extends
+even
+more
+tyrannically
+beyond
+the
+grave
+The
+desire
+is
+implanted
+in
+the
+very
+soul
+itself
+and
+the
+agony
+of
+earthbound
+spirits
+whose
+cravings
+for
+gratification
+are
+in
+vain
+is
+beyond
+description
+Such
+spirits
+frequently
+obtain
+partial
+satisfaction
+through
+controlling
+mortal
+sensitives
+and
+forcing
+them
+to
+become
+addicts
+of
+some
+drug
+Often
+spirits
+suffering
+from
+the
+narcotic
+evil
+have
+come
+to
+our
+circle
+and
+many
+urgent
+warnings
+have
+been
+given
+by
+discarnate
+intelligences
+who
+were
+formerly
+subject
+to
+this
+slavery
+Twenty
+five
+years
+after
+the
+first
+conversation
+with
+Minnie
+Morgan
+which
+occurred
+during
+my
+dissecting
+work
+this
+spirit
+who
+had
+been
+a
+morphine
+fiend
+returned
+and
+told
+of
+earth
+sphere
+conditions
+as
+well
+as
+of
+the
+higher
+spirit
+world
+EXPERIENCE
+JULY
+Spirit
+MINNIE
+MORGAN
+Psychic
+MRS
+WICKLAND
+I
+feel
+that
+I
+am
+one
+of
+you
+although
+I
+do
+not
+know
+you
+I
+was
+helped
+by
+you
+I
+certainly
+had
+wonderful
+help
+in
+being
+brought
+to
+understand
+that
+there
+is
+a
+real
+life
+In
+the
+spirit
+world
+we
+know
+each
+other
+as
+we
+should
+be
+known
+not
+as
+you
+know
+each
+other
+in
+earth
+life
+with
+all
+kinds
+of
+hidden
+thoughts
+You
+wander
+like
+wild
+cattle
+on
+the
+battle
+field
+of
+selfishness
+and
+jealousy
+Love
+is
+so
+little
+understood
+You
+do
+not
+know
+what
+real
+love
+is
+because
+God
+is
+Love
+and
+God
+dwells
+in
+Love
+The
+majority
+of
+people
+only
+believe
+and
+think
+there
+is
+some
+place
+in
+the
+sky
+to
+which
+they
+go
+when
+they
+die
+Whenever
+I
+gave
+that
+subject
+any
+thought
+I
+made
+up
+my
+mind
+that
+I
+would
+have
+a
+good
+time
+while
+I
+could
+and
+then
+when
+the
+time
+came
+to
+die
+I
+would
+be
+ready
+to
+go
+because
+at
+the
+last
+I
+could
+throw
+my
+sins
+on
+Jesus
+and
+be
+washed
+as
+white
+as
+snow
+I
+started
+out
+in
+life
+with
+that
+belief
+I
+said
+See
+Chap
+Page
+Spirit
+Minnie
+Morgan
+Why
+can
+t
+I
+have
+a
+good
+time
+like
+others
+The
+future
+will
+take
+care
+of
+itself
+With
+that
+thought
+many
+persons
+go
+out
+to
+sow
+their
+wild
+oats
+thinking
+that
+when
+the
+proper
+time
+comes
+they
+will
+be
+prayed
+for
+and
+that
+then
+they
+will
+step
+into
+the
+glory
+of
+Heaven
+That
+is
+what
+I
+thought
+I
+tried
+to
+live
+a
+life
+of
+glory
+or
+what
+I
+thought
+was
+glory
+What
+does
+that
+mean
+It
+means
+to
+have
+a
+good
+time
+to
+live
+and
+not
+care
+what
+becomes
+of
+one
+s
+soul
+I
+said
+Let
+us
+have
+a
+good
+time
+while
+we
+can
+and
+I
+started
+out
+in
+life
+that
+way
+I
+had
+my
+sorrows
+and
+I
+had
+my
+good
+time
+as
+I
+called
+it
+but
+that
+is
+not
+a
+good
+time
+We
+cannot
+for
+one
+minute
+step
+over
+the
+laws
+of
+nature
+except
+we
+suffer
+in
+some
+way
+or
+other
+If
+we
+go
+too
+far
+in
+anything
+we
+suffer
+for
+it
+both
+mentally
+and
+physically
+We
+keep
+on
+going
+and
+going
+sometimes
+our
+good
+time
+is
+better
+sometimes
+worse
+I
+lived
+a
+very
+fast
+life
+and
+called
+it
+a
+glorious
+time
+but
+grief
+and
+adversity
+came
+In
+the
+way
+of
+the
+world
+I
+lived
+very
+fast
+I
+went
+to
+church
+once
+in
+a
+while
+to
+be
+sure
+my
+soul
+would
+be
+taken
+care
+of
+I
+paid
+money
+to
+the
+church
+so
+I
+would
+be
+all
+right
+and
+then
+I
+drowned
+myself
+in
+the
+glory
+of
+the
+world
+It
+was
+all
+right
+for
+a
+while
+Each
+time
+I
+had
+glory
+as
+I
+called
+it
+I
+suffered
+both
+physically
+and
+mentally
+I
+tried
+to
+shake
+it
+off
+and
+go
+on
+a
+little
+longer
+I
+fell
+by
+the
+wayside
+After
+a
+while
+my
+physical
+body
+wore
+out
+and
+I
+had
+misery
+and
+sickness
+At
+one
+time
+I
+was
+considered
+a
+very
+pretty
+girl
+I
+had
+my
+beaux
+and
+all
+that
+goes
+with
+a
+good
+time
+but
+I
+went
+down
+and
+down
+to
+the
+very
+lowest
+I
+was
+a
+physical
+wreck
+but
+I
+was
+still
+on
+earth
+Never
+let
+any
+one
+give
+you
+the
+least
+bit
+of
+morphine
+When
+you
+start
+on
+that
+road
+you
+are
+lost
+Not
+that
+a
+soul
+is
+ever
+lost
+but
+you
+are
+lost
+for
+a
+time
+while
+you
+are
+a
+slave
+to
+the
+drug
+You
+suffer
+agony
+There
+is
+nothing
+worse
+than
+to
+crave
+morphine
+and
+be
+unable
+to
+get
+it
+It
+seems
+like
+every
+nerve
+in
+your
+body
+is
+creeping
+I
+got
+wild
+because
+I
+could
+not
+get
+it
+I
+did
+not
+care
+for
+anything
+I
+would
+have
+sold
+my
+very
+soul
+if
+I
+could
+only
+have
+gotten
+morphine
+I
+lost
+all
+decency
+I
+lost
+everything
+All
+I
+wanted
+was
+morphine
+It
+was
+terrible
+It
+burned
+to
+my
+very
+heart
+I
+felt
+it
+in
+every
+nerve
+and
+I
+felt
+as
+if
+I
+were
+on
+fire
+If
+only
+some
+one
+would
+have
+gotten
+morphine
+for
+me
+Just
+a
+little
+Just
+a
+little
+bit
+A
+little
+bit
+I
+felt
+I
+couldn
+t
+stand
+it
+any
+longer
+I
+wanted
+just
+a
+little
+a
+little
+bit
+Only
+a
+little
+The
+spirit
+seemed
+to
+live
+again
+all
+the
+agony
+she
+had
+endured
+when
+in
+earth
+life
+It
+also
+seemed
+evident
+that
+in
+addition
+to
+the
+visible
+circle
+of
+investigators
+she
+was
+addressing
+an
+audience
+of
+earthbound
+spirits
+I
+died
+in
+that
+terrible
+condition
+My
+physical
+body
+was
+gone
+I
+had
+worn
+it
+out
+just
+worn
+it
+out
+Then
+I
+was
+operated
+on
+post
+mortem
+but
+I
+still
+lived
+I
+wanted
+to
+get
+to
+my
+body
+They
+operated
+on
+me
+and
+after
+a
+while
+I
+felt
+that
+something
+was
+picking
+me
+to
+small
+pieces
+Dissection
+I
+cried
+and
+I
+fought
+because
+I
+wanted
+that
+body
+so
+I
+could
+satisfy
+my
+very
+soul
+I
+was
+burning
+up
+They
+picked
+at
+every
+nerve
+they
+looked
+at
+my
+heart
+my
+shoulder
+and
+down
+to
+the
+leg
+pick
+pick
+pick
+all
+the
+time
+I
+got
+so
+desperate
+I
+fought
+with
+all
+my
+power
+and
+I
+seared
+some
+away
+from
+my
+body
+They
+never
+touched
+it
+again
+There
+were
+five
+or
+six
+men
+with
+knives
+all
+wanting
+to
+do
+something
+with
+my
+body
+pick
+pick
+pick
+But
+there
+came
+another
+he
+looked
+and
+looked
+at
+me
+and
+picked
+and
+picked
+and
+he
+drove
+me
+wild
+I
+thought
+if
+I
+could
+only
+get
+hold
+of
+him
+I
+would
+fix
+him
+He
+paid
+no
+attention
+to
+me
+I
+tried
+to
+scare
+him
+as
+I
+had
+seared
+the
+others
+but
+I
+could
+not
+budge
+him
+He
+would
+not
+move
+one
+inch
+from
+that
+body
+of
+mine
+I
+followed
+him
+and
+thought
+I
+would
+haunt
+him
+but
+all
+at
+once
+I
+got
+well
+controlled
+the
+psychic
+and
+began
+to
+fight
+him
+with
+all
+the
+strength
+and
+power
+I
+had
+for
+picking
+me
+to
+pieces
+To
+my
+great
+surprise
+after
+this
+gentleman
+Dr
+W
+talked
+to
+me
+I
+found
+I
+was
+dead
+I
+did
+not
+know
+I
+had
+lost
+my
+body
+for
+I
+had
+not
+been
+dead
+at
+all
+This
+gentleman
+told
+me
+that
+the
+people
+working
+on
+my
+body
+were
+students
+and
+that
+it
+was
+necessary
+for
+them
+to
+work
+on
+a
+dead
+body
+before
+they
+were
+able
+to
+pass
+their
+examinations
+I
+seared
+five
+of
+them
+and
+they
+never
+touched
+me
+again
+but
+I
+could
+not
+scare
+this
+one
+To
+Dr
+W
+Now
+I
+come
+to
+thank
+you
+You
+were
+the
+one
+who
+enlightened
+me
+and
+gave
+me
+an
+understanding
+of
+the
+real
+life
+beyond
+I
+found
+I
+could
+not
+throw
+my
+sins
+on
+Christ
+He
+was
+our
+teacher
+but
+we
+must
+live
+our
+own
+lives
+as
+He
+taught
+us
+to
+live
+and
+not
+throw
+our
+sins
+and
+troubles
+on
+Him
+That
+is
+a
+false
+doctrine
+He
+is
+the
+Life
+the
+Light
+and
+theWay
+He
+said
+I
+am
+the
+Light
+of
+the
+world
+he
+that
+followeth
+me
+shall
+not
+walk
+in
+darkness
+Many
+others
+before
+Him
+taught
+the
+same
+lesson
+of
+life
+I
+found
+that
+in
+the
+past
+there
+had
+been
+many
+teachers
+like
+Christ
+Confucius
+was
+one
+He
+taught
+the
+same
+as
+did
+Christ
+In
+the
+Old
+Testament
+we
+find
+the
+same
+principles
+as
+Christ
+taught
+His
+sayings
+are
+the
+same
+in
+the
+Old
+as
+in
+the
+New
+Let
+us
+all
+do
+what
+we
+can
+to
+find
+God
+within
+us
+Learn
+to
+live
+according
+to
+Christ
+s
+teachings
+Love
+the
+Lord
+thy
+God
+with
+all
+thy
+heart
+and
+thy
+neighbor
+as
+thyself
+I
+would
+not
+have
+the
+home
+in
+the
+spirit
+world
+that
+I
+have
+if
+I
+had
+not
+been
+disturbed
+and
+received
+an
+understanding
+of
+the
+real
+life
+I
+was
+very
+wicked
+and
+you
+know
+the
+desire
+I
+had
+for
+morphine
+That
+desire
+was
+with
+me
+even
+after
+I
+left
+my
+body
+The
+desire
+for
+anything
+belongs
+to
+the
+soul
+not
+to
+the
+body
+The
+body
+is
+only
+a
+cloak
+or
+dress
+for
+your
+soul
+All
+the
+desires
+of
+life
+all
+the
+faculties
+that
+belong
+to
+the
+soul
+go
+with
+you
+to
+the
+grave
+and
+beyond
+the
+grave
+What
+would
+I
+have
+been
+if
+I
+had
+not
+been
+given
+an
+understanding
+of
+how
+to
+overcome
+my
+desires
+I
+would
+have
+been
+an
+earthbound
+spirit
+and
+would
+have
+gotten
+into
+some
+sensitive
+person
+s
+magnetism
+and
+made
+that
+sensitive
+a
+morphine
+fiend
+so
+I
+could
+have
+had
+my
+desire
+fulfilled
+and
+the
+life
+of
+the
+sensitive
+would
+have
+been
+ruined
+I
+would
+have
+lived
+in
+the
+earth
+sphere
+for
+years
+and
+years
+if
+I
+had
+gotten
+into
+that
+condition
+I
+would
+have
+ruined
+one
+and
+then
+another
+and
+so
+I
+would
+have
+kept
+on
+Find
+out
+what
+belongs
+to
+the
+soul
+and
+what
+belongs
+to
+the
+body
+If
+this
+were
+done
+we
+would
+not
+have
+so
+much
+trouble
+and
+crime
+nor
+so
+much
+sickness
+We
+would
+have
+Love
+and
+Heaven
+on
+earth
+because
+we
+would
+have
+pity
+for
+the
+unfortunate
+ones
+who
+are
+living
+just
+for
+their
+own
+desires
+It
+says
+in
+the
+Bible
+Prove
+all
+things
+hold
+fast
+that
+which
+is
+good
+That
+means
+do
+not
+have
+any
+desire
+for
+anything
+If
+you
+use
+too
+much
+of
+anything
+in
+this
+earth
+life
+such
+as
+morphine
+whiskey
+or
+tobacco
+then
+you
+are
+a
+slave
+and
+must
+stop
+its
+use
+Many
+people
+condemn
+many
+things
+and
+that
+thought
+of
+condemnation
+is
+very
+hard
+for
+a
+sensitive
+person
+Everything
+on
+earth
+is
+meant
+for
+us
+to
+use
+but
+not
+misuse
+Many
+people
+condemn
+liquor
+tobacco
+morphine
+opium
+but
+it
+is
+their
+misuse
+which
+should
+be
+condemned
+They
+are
+all
+necessary
+things
+if
+they
+are
+used
+rightly
+Isn
+t
+an
+opiate
+a
+good
+thing
+if
+you
+must
+undergo
+an
+operation
+To
+be
+operated
+upon
+without
+an
+opiate
+would
+be
+wrong
+the
+suffering
+would
+be
+too
+great
+Opiates
+help
+pain
+Many
+people
+use
+these
+things
+because
+they
+are
+forbidden
+They
+say
+Forbidden
+fruit
+tastes
+best
+When
+things
+are
+forbidden
+everybody
+wants
+them
+and
+they
+ruin
+themselves
+using
+them
+I
+lived
+in
+the
+lower
+world
+the
+underworld
+and
+I
+know
+what
+I
+am
+talking
+about
+I
+took
+anything
+to
+keep
+my
+nerves
+quiet
+Anything
+used
+moderately
+in
+a
+sensible
+way
+is
+all
+right
+When
+a
+man
+who
+works
+very
+hard
+either
+physically
+or
+mentally
+sits
+down
+to
+rest
+he
+is
+nervous
+and
+fatigued
+Give
+him
+a
+good
+cigar
+and
+let
+him
+relax
+His
+nervousness
+goes
+and
+he
+becomes
+stronger
+It
+is
+a
+thorough
+relaxation
+he
+smokes
+and
+feels
+better
+With
+this
+complete
+relaxation
+comes
+quietude
+the
+man
+sleeps
+and
+is
+rested
+for
+his
+work
+the
+next
+day
+If
+people
+would
+have
+more
+love
+for
+each
+other
+and
+less
+condemnation
+they
+would
+be
+more
+like
+brothers
+and
+sisters
+That
+is
+the
+life
+in
+the
+higher
+realms
+We
+cannot
+reach
+that
+stage
+until
+we
+have
+gotten
+rid
+of
+all
+desires
+all
+hatred
+all
+selfishness
+all
+envy
+We
+cannot
+progress
+until
+we
+have
+thrown
+away
+all
+these
+things
+and
+said
+God
+help
+me
+to
+love
+my
+enemies
+and
+friends
+better
+than
+myself
+Then
+we
+will
+be
+ready
+to
+travel
+the
+road
+Some
+people
+think
+that
+after
+they
+learn
+the
+lesson
+of
+truth
+they
+will
+step
+into
+the
+glory
+of
+Heaven
+But
+Heaven
+is
+a
+condition
+In
+conquering
+my
+desire
+for
+morphine
+I
+had
+to
+do
+so
+little
+by
+little
+step
+by
+step
+until
+I
+could
+say
+No
+more
+morphine
+for
+me
+After
+I
+had
+conquered
+my
+friends
+and
+relatives
+met
+me
+and
+said
+Now
+you
+are
+ready
+to
+come
+with
+us
+to
+the
+home
+that
+has
+been
+prepared
+for
+you
+Before
+that
+time
+I
+had
+to
+live
+all
+by
+myself
+I
+was
+not
+in
+a
+dark
+dungeon
+like
+some
+are
+but
+all
+around
+me
+was
+myself
+nothing
+else
+I
+had
+to
+learn
+and
+strive
+to
+overcome
+It
+says
+in
+the
+Big
+Book
+that
+Christ
+went
+to
+the
+lower
+spheres
+to
+give
+help
+and
+teach
+We
+all
+have
+to
+teach
+and
+help
+the
+fallen
+ones
+and
+give
+them
+strength
+to
+overcome
+their
+desires
+I
+wish
+I
+could
+take
+you
+along
+with
+me
+for
+a
+few
+moments
+to
+see
+the
+conditions
+in
+the
+lower
+sphere
+what
+they
+call
+the
+earth
+sphere
+Here
+is
+the
+sphere
+of
+whiskey
+here
+the
+sphere
+of
+morphine
+here
+the
+sphere
+of
+the
+opium
+fiend
+here
+the
+sphere
+of
+selfishness
+and
+here
+the
+sphere
+of
+misers
+Of
+all
+these
+conditions
+that
+of
+the
+miser
+is
+the
+worst
+He
+sacrifices
+everything
+for
+money
+He
+will
+not
+eat
+because
+he
+thinks
+he
+cannot
+afford
+it
+He
+starves
+his
+mind
+because
+he
+wants
+money
+money
+and
+what
+is
+the
+result
+In
+the
+earth
+sphere
+he
+is
+in
+the
+dark
+but
+he
+sees
+his
+money
+being
+spent
+and
+he
+is
+in
+hell
+He
+suffers
+terribly
+He
+sees
+his
+relatives
+get
+his
+money
+it
+is
+divided
+some
+going
+here
+some
+there
+If
+it
+were
+all
+in
+one
+place
+he
+could
+count
+it
+over
+and
+that
+would
+be
+all
+right
+but
+his
+relatives
+all
+want
+their
+share
+to
+spend
+Now
+imagine
+that
+money
+has
+been
+his
+treasure
+Each
+cent
+that
+is
+spent
+is
+like
+cutting
+a
+piece
+from
+his
+body
+because
+his
+whole
+mind
+and
+soul
+were
+in
+that
+money
+and
+to
+see
+it
+scattered
+and
+spent
+is
+hell
+for
+him
+Think
+what
+that
+means
+to
+him
+He
+cannot
+be
+helped
+until
+he
+feels
+that
+he
+no
+longer
+wants
+his
+money
+then
+his
+soul
+or
+better
+nature
+will
+open
+up
+and
+he
+will
+be
+helped
+He
+will
+be
+under
+the
+guidance
+of
+a
+teacher
+and
+will
+be
+taught
+that
+money
+belongs
+to
+the
+earth
+life
+not
+to
+the
+spirit
+He
+then
+has
+to
+do
+good
+A
+miser
+never
+gets
+his
+money
+in
+the
+right
+way
+He
+may
+not
+be
+a
+thief
+but
+if
+he
+loans
+money
+he
+charges
+too
+high
+a
+rate
+of
+interest
+For
+every
+cent
+he
+got
+in
+the
+wrong
+way
+he
+has
+to
+do
+right
+He
+must
+do
+some
+kind
+act
+and
+help
+poor
+people
+in
+their
+work
+He
+has
+to
+lay
+down
+his
+life
+and
+earn
+everything
+before
+he
+can
+gain
+happiness
+in
+the
+spirit
+world
+He
+has
+to
+serve
+first
+and
+he
+must
+help
+those
+from
+whom
+he
+took
+money
+to
+get
+it
+back
+You
+know
+a
+sin
+against
+the
+Holy
+Ghost
+cannot
+be
+forgiven
+It
+must
+be
+atoned
+for
+That
+is
+his
+life
+in
+the
+spirit
+world
+We
+have
+to
+look
+at
+a
+murderer
+differently
+There
+are
+ten
+different
+degrees
+of
+murder
+There
+is
+murder
+by
+quick
+temper
+that
+is
+not
+real
+murder
+It
+is
+committed
+under
+stress
+of
+strong
+quick
+temper
+At
+heart
+the
+man
+is
+not
+a
+murderer
+he
+simply
+lost
+control
+of
+his
+temper
+Of
+course
+he
+has
+to
+suffer
+and
+do
+good
+where
+he
+did
+wrong
+Temper
+is
+a
+very
+hard
+thing
+to
+conquer
+but
+it
+must
+be
+conquered
+because
+it
+kills
+our
+better
+nature
+and
+makes
+us
+do
+many
+wrong
+and
+unkind
+things
+Then
+we
+have
+the
+cunning
+murderer
+He
+plans
+and
+schemes
+he
+wants
+a
+man
+s
+money
+He
+is
+nice
+and
+sweet
+and
+goes
+to
+church
+He
+plans
+and
+schemes
+to
+get
+that
+man
+s
+life
+in
+some
+way
+or
+another
+but
+he
+does
+it
+slowly
+He
+has
+evil
+thoughts
+In
+the
+spirit
+world
+this
+man
+has
+to
+suffer
+a
+great
+deal
+and
+must
+atone
+for
+his
+actions
+from
+the
+time
+he
+began
+to
+plan
+and
+scheme
+to
+murder
+Then
+there
+is
+the
+psychic
+sensitive
+who
+does
+not
+care
+for
+anybody
+He
+doesn
+t
+belong
+to
+one
+church
+or
+another
+he
+takes
+things
+easy
+What
+is
+not
+done
+today
+can
+be
+done
+tomorrow
+or
+the
+next
+day
+He
+does
+not
+use
+his
+will
+A
+cunning
+spirit
+gets
+into
+this
+man
+s
+magnetic
+aura
+and
+controls
+him
+He
+commits
+some
+crime
+The
+man
+will
+hang
+for
+his
+deed
+but
+he
+never
+did
+it
+He
+will
+probably
+say
+he
+does
+not
+know
+that
+he
+did
+anything
+Or
+he
+may
+say
+I
+must
+have
+been
+drunk
+when
+I
+did
+it
+for
+I
+don
+t
+remember
+anything
+about
+it
+But
+it
+was
+not
+liquor
+that
+did
+it
+Liquor
+never
+does
+that
+When
+a
+man
+is
+drunk
+his
+mind
+is
+in
+a
+stupor
+It
+is
+a
+spirit
+that
+does
+the
+work
+If
+that
+spirit
+has
+been
+wronged
+in
+life
+all
+he
+wants
+is
+revenge
+The
+law
+does
+not
+really
+find
+out
+whether
+the
+man
+is
+guilty
+or
+not
+he
+is
+hung
+The
+majority
+of
+murders
+and
+hold
+ups
+are
+committed
+by
+spirits
+They
+scheme
+and
+scheme
+and
+use
+mortals
+as
+tools
+until
+they
+wake
+up
+and
+realize
+what
+wrong
+they
+have
+been
+doing
+Often
+honesty
+and
+modesty
+have
+both
+been
+killed
+When
+I
+was
+a
+child
+I
+was
+very
+modest
+but
+when
+I
+killed
+modesty
+I
+was
+ruined
+Then
+I
+did
+not
+care
+for
+anything
+Honesty
+is
+a
+virtue
+we
+should
+all
+cultivate
+Judges
+lawyers
+and
+ministers
+in
+the
+majority
+of
+cases
+do
+not
+give
+justice
+they
+look
+for
+gain
+They
+kill
+justice
+honesty
+and
+truth
+Let
+us
+do
+all
+we
+can
+to
+keep
+those
+three
+to
+the
+front
+Honesty
+and
+truth
+will
+convert
+the
+world
+You
+cannot
+convert
+it
+by
+condemnation
+People
+are
+not
+taught
+the
+truth
+Have
+wisdom
+and
+human
+kindness
+and
+you
+will
+see
+better
+results
+Teach
+wisdom
+and
+let
+more
+of
+the
+Christ
+spirit
+be
+in
+every
+one
+Live
+as
+He
+taught
+do
+as
+He
+did
+then
+happiness
+will
+reign
+I
+am
+sorry
+to
+have
+taken
+up
+so
+much
+time
+but
+I
+did
+not
+know
+I
+would
+talk
+so
+long
+Even
+now
+I
+feel
+I
+have
+more
+to
+say
+but
+I
+must
+stop
+My
+name
+when
+I
+lived
+in
+Chicago
+was
+Minnie
+Morgan
+but
+that
+name
+does
+not
+belong
+to
+me
+and
+I
+do
+not
+want
+it
+any
+more
+That
+name
+has
+a
+horror
+for
+me
+Even
+when
+I
+repeat
+that
+name
+I
+feel
+a
+horror
+of
+it
+My
+own
+name
+is
+not
+to
+be
+given
+tonight
+We
+have
+to
+earn
+our
+names
+and
+I
+have
+no
+name
+until
+I
+have
+earned
+it
+After
+all
+these
+twenty
+five
+years
+it
+was
+in
+that
+I
+passed
+out
+I
+have
+not
+advanced
+sufficiently
+to
+have
+even
+a
+name
+I
+am
+happy
+and
+I
+will
+earn
+a
+name
+and
+then
+I
+will
+be
+called
+by
+it
+My
+name
+was
+down
+in
+the
+very
+lowest
+place
+If
+any
+one
+of
+you
+should
+pass
+out
+you
+would
+have
+a
+name
+that
+is
+honest
+and
+good
+Your
+name
+will
+follow
+you
+and
+you
+will
+want
+it
+I
+would
+not
+cling
+to
+mine
+for
+it
+has
+such
+a
+horror
+for
+me
+Can
+you
+see
+the
+difference
+When
+you
+have
+done
+the
+best
+you
+could
+in
+earth
+life
+you
+have
+traveled
+the
+right
+road
+and
+when
+you
+pass
+to
+the
+spirit
+side
+of
+life
+your
+relatives
+and
+friends
+will
+meet
+you
+I
+had
+no
+one
+to
+meet
+me
+No
+friends
+came
+I
+had
+gone
+too
+low
+My
+friend
+was
+morphine
+Isn
+t
+that
+a
+terrible
+condition
+You
+know
+when
+I
+wanted
+morphine
+I
+did
+not
+always
+get
+it
+in
+the
+right
+way
+During
+my
+earth
+life
+I
+sometimes
+stole
+money
+to
+get
+morphine
+Now
+I
+have
+to
+do
+good
+step
+by
+step
+I
+have
+been
+doing
+work
+in
+the
+slums
+helping
+those
+as
+unfortunate
+as
+I
+had
+been
+I
+lived
+with
+those
+who
+craved
+morphine
+Now
+I
+can
+help
+them
+to
+overcome
+their
+desire
+for
+it
+That
+is
+my
+work
+It
+is
+not
+pleasant
+but
+I
+have
+to
+do
+it
+Some
+one
+has
+to
+do
+it
+so
+why
+not
+I
+I
+suffer
+with
+them
+I
+can
+give
+them
+sympathy
+for
+I
+too
+have
+suffered
+Give
+these
+unfortunate
+ones
+your
+sympathy
+and
+loving
+thoughts
+for
+it
+will
+help
+them
+You
+have
+not
+lived
+as
+they
+have
+and
+you
+do
+not
+know
+what
+their
+condition
+means
+Each
+one
+that
+I
+help
+to
+the
+right
+road
+is
+Heaven
+to
+me
+Remember
+each
+one
+is
+Heaven
+to
+me
+The
+more
+I
+help
+the
+more
+happiness
+I
+find
+Some
+day
+I
+shall
+say
+goodbye
+to
+this
+condition
+and
+progress
+to
+the
+spirit
+side
+of
+life
+Do
+not
+condemn
+those
+who
+have
+fallen
+remember
+they
+have
+no
+will
+of
+their
+own
+Send
+kind
+thoughts
+to
+them
+and
+say
+a
+prayer
+God
+help
+them
+to
+have
+a
+will
+of
+their
+own
+to
+overcome
+their
+desire
+Send
+out
+thoughts
+to
+help
+them
+overcome
+do
+not
+send
+evil
+unkind
+thoughts
+The
+next
+time
+I
+come
+you
+will
+know
+what
+my
+name
+is
+because
+by
+that
+time
+I
+shall
+have
+earned
+it
+Thank
+you
+for
+helping
+me
+to
+the
+right
+road
+because
+I
+am
+happy
+in
+helping
+others
+but
+I
+shall
+have
+a
+hard
+climb
+to
+find
+bliss
+Good
+Night
+and
+I
+again
+thank
+you
+for
+having
+helped
+me
+The
+day
+after
+receiving
+a
+request
+by
+telephone
+from
+an
+adjoining
+city
+that
+we
+concentrate
+for
+a
+pharmacist
+who
+was
+a
+drug
+addict
+and
+evidently
+obsessed
+the
+spirit
+of
+a
+morphine
+fiend
+was
+removed
+from
+him
+and
+brought
+to
+our
+circle
+an
+entity
+in
+torment
+convulsed
+with
+the
+drug
+craving
+and
+wildly
+begging
+for
+just
+one
+grain
+EXPERIENCE
+MARCH
+Spirit
+ELIZABETH
+NOBLE
+Psychic
+MRS
+WICKLAND
+Spirit
+Don
+t
+bother
+me
+I
+want
+rest
+Doctor
+Haven
+t
+you
+rested
+long
+enough
+Do
+you
+want
+to
+rest
+forever
+Sp
+I
+have
+been
+running
+I
+have
+not
+been
+resting
+Dr
+What
+have
+you
+been
+running
+away
+from
+The
+police
+The
+spirit
+began
+to
+cough
+severely
+Dr
+Forget
+your
+old
+condition
+that
+is
+all
+past
+Tell
+us
+who
+you
+are
+and
+where
+you
+came
+from
+Sp
+I
+am
+so
+sick
+Coughing
+more
+violently
+Dr
+Do
+not
+bring
+that
+condition
+with
+you
+You
+lost
+your
+body
+probably
+a
+long
+time
+ago
+Do
+you
+know
+you
+are
+a
+spirit
+What
+is
+the
+matter
+Sp
+I
+don
+t
+know
+Another
+paroxysm
+of
+coughing
+Dr
+You
+ought
+to
+know
+This
+is
+not
+your
+body
+you
+are
+not
+sick
+now
+You
+are
+free
+from
+your
+physical
+body
+Think
+yourself
+well
+and
+you
+will
+be
+well
+Sp
+I
+am
+sick
+you
+do
+not
+know
+Who
+are
+you
+Dr
+I
+am
+a
+doctor
+and
+if
+you
+do
+as
+you
+are
+told
+you
+will
+become
+well
+This
+is
+not
+your
+body
+You
+are
+now
+an
+invisible
+spirit
+Sp
+I
+am
+sick
+Dr
+You
+only
+hold
+that
+idea
+in
+your
+mind
+This
+body
+is
+not
+your
+own
+You
+are
+not
+sick
+Sp
+You
+don
+t
+know
+Dr
+You
+are
+ignorant
+of
+your
+condition
+and
+do
+not
+realize
+that
+you
+have
+lost
+your
+body
+Sp
+I
+am
+sick
+Dr
+In
+your
+mind
+only
+that
+is
+an
+old
+habit
+Sp
+I
+am
+dying
+I
+want
+to
+lie
+down
+Coughing
+Dr
+You
+are
+only
+using
+this
+body
+temporarily
+Your
+coughing
+body
+is
+in
+the
+grave
+You
+must
+stop
+coughing
+Sp
+I
+have
+no
+coughing
+body
+This
+is
+my
+body
+I
+can
+t
+help
+coughing
+Dr
+Where
+did
+you
+come
+from
+Sp
+I
+don
+t
+know
+Why
+do
+you
+tell
+me
+I
+can
+t
+cough
+Dr
+There
+is
+no
+need
+of
+it
+Sp
+You
+don
+t
+know
+anything
+about
+it
+Dr
+The
+body
+which
+you
+are
+using
+now
+is
+not
+sick
+Sp
+I
+am
+sick
+You
+give
+me
+some
+medicine
+and
+give
+it
+to
+me
+quick
+Give
+me
+some
+before
+I
+get
+too
+sick
+Dr
+You
+like
+to
+be
+sick
+Don
+t
+you
+want
+to
+be
+well
+Sp
+I
+am
+sick
+and
+ought
+to
+be
+in
+bed
+Think
+of
+a
+poor
+sick
+woman
+having
+to
+stay
+here
+Coughing
+Dr
+Think
+strongly
+that
+you
+are
+not
+sick
+and
+you
+will
+not
+be
+Sp
+Give
+me
+some
+medicine
+I
+want
+a
+little
+morphine
+my
+heart
+is
+bad
+Dr
+You
+have
+lost
+your
+body
+and
+are
+a
+spirit
+now
+Sp
+Give
+me
+some
+medicine
+then
+I
+ll
+feel
+better
+Give
+me
+fifteen
+grains
+My
+cough
+is
+so
+bad
+Give
+me
+some
+Give
+me
+some
+morphine
+I
+said
+Just
+a
+little
+Only
+a
+little
+then
+just
+one
+grain
+Give
+it
+to
+me
+in
+the
+arm
+I
+like
+it
+in
+the
+arm
+best
+Dr
+You
+must
+stop
+this
+foolish
+talk
+Sp
+Shrieking
+wildly
+You
+must
+give
+me
+something
+quick
+I
+can
+t
+stand
+it
+any
+longer
+I
+said
+give
+me
+some
+One
+grain
+just
+one
+grain
+I
+must
+have
+it
+With
+face
+distorted
+hands
+clawing
+the
+air
+fiercely
+Dr
+I
+thought
+you
+said
+you
+were
+sick
+Sp
+I
+am
+sick
+Dr
+From
+selfishness
+Try
+to
+understand
+your
+condition
+Sp
+You
+give
+me
+some
+morphine
+before
+I
+die
+Dr
+You
+must
+be
+quiet
+then
+we
+can
+help
+you
+Where
+did
+you
+come
+from
+Sp
+Oh
+my
+God
+Give
+me
+some
+morphine
+I
+want
+medicine
+Won
+t
+you
+please
+please
+give
+me
+just
+one
+grain
+Dr
+What
+is
+your
+name
+Sp
+Claw
+like
+fingers
+desperately
+clutching
+about
+My
+God
+just
+give
+me
+one
+grain
+just
+one
+Dr
+Do
+you
+know
+that
+you
+are
+in
+California
+Sp
+No
+Dr
+You
+are
+in
+Los
+Angeles
+California
+Where
+do
+you
+think
+you
+are
+Sp
+I
+don
+t
+care
+Just
+give
+me
+one
+little
+grain
+I
+must
+have
+it
+Dr
+Forget
+that
+and
+think
+of
+something
+else
+You
+have
+lost
+your
+physical
+body
+Sp
+I
+have
+such
+a
+bad
+cough
+and
+my
+heart
+is
+bad
+I
+m
+dying
+Dr
+How
+can
+you
+die
+when
+you
+have
+already
+lost
+your
+physical
+body
+Sp
+If
+I
+have
+another
+body
+I
+m
+just
+the
+same
+as
+I
+was
+before
+Dr
+Forget
+your
+old
+habits
+and
+you
+will
+feel
+better
+Sp
+I
+want
+morphine
+When
+you
+want
+it
+you
+want
+it
+badly
+Striking
+right
+and
+left
+I
+can
+t
+stand
+it
+any
+longer
+Give
+me
+some
+Dr
+If
+you
+listen
+to
+us
+you
+can
+be
+helped
+out
+of
+your
+present
+condition
+Intelligent
+spirits
+will
+also
+help
+you
+If
+you
+do
+not
+want
+to
+listen
+you
+will
+have
+to
+go
+You
+must
+overcome
+old
+habits
+your
+physical
+body
+is
+gone
+Sp
+Please
+give
+me
+fifteen
+grains
+Dr
+I
+will
+give
+you
+nothing
+You
+no
+longer
+have
+a
+physical
+body
+which
+craves
+morphine
+You
+now
+have
+an
+opportunity
+to
+be
+helped
+Sp
+Give
+me
+some
+oh
+give
+me
+some
+If
+you
+will
+only
+give
+me
+some
+morphine
+I
+ll
+be
+all
+right
+Struggling
+Dr
+If
+you
+do
+not
+quiet
+yourself
+you
+will
+have
+to
+go
+Sp
+That
+is
+nice
+I
+am
+sick
+I
+only
+ask
+you
+for
+morphine
+Dr
+You
+are
+very
+selfish
+Sp
+I
+have
+been
+running
+trying
+to
+get
+some
+morphine
+Why
+won
+t
+you
+give
+me
+some
+Dr
+No
+more
+of
+that
+You
+have
+lost
+your
+mortal
+body
+and
+are
+now
+using
+my
+wife
+s
+body
+You
+can
+be
+helped
+if
+you
+will
+listen
+Understand
+you
+are
+a
+spirit
+Sp
+I
+have
+such
+a
+bad
+cough
+I
+need
+morphine
+Dr
+No
+doubt
+you
+have
+been
+in
+the
+earth
+plane
+in
+darkness
+for
+a
+long
+time
+You
+no
+longer
+have
+your
+own
+body
+Sp
+I
+have
+my
+own
+body
+Dr
+The
+body
+you
+are
+struggling
+with
+is
+not
+yours
+Will
+you
+try
+to
+understand
+Sp
+Yes
+but
+I
+m
+very
+sick
+Dr
+You
+are
+not
+sick
+you
+are
+very
+selfish
+Why
+don
+t
+you
+pay
+attention
+and
+try
+to
+understand
+that
+you
+are
+a
+spirit
+Sp
+That
+s
+all
+right
+I
+need
+morphine
+just
+the
+same
+Dr
+Get
+that
+idea
+out
+of
+your
+mind
+You
+only
+imagine
+you
+are
+sick
+Did
+you
+not
+say
+you
+had
+been
+running
+Sp
+Yes
+I
+have
+been
+to
+every
+drug
+store
+in
+town
+to
+get
+morphine
+I
+get
+it
+once
+in
+a
+while
+through
+some
+sensitive
+but
+it
+doesn
+t
+last
+long
+Dr
+You
+get
+it
+by
+obsessing
+some
+one
+you
+have
+no
+physical
+body
+now
+Sp
+I
+have
+a
+body
+Dr
+Not
+a
+physical
+body
+You
+are
+using
+my
+wife
+s
+body
+Intelligent
+spirits
+have
+brought
+you
+here
+to
+be
+helped
+Sp
+All
+the
+help
+I
+want
+is
+morphine
+When
+I
+think
+I
+can
+t
+get
+it
+it
+makes
+me
+sick
+Dr
+That
+is
+only
+because
+you
+hold
+that
+thought
+in
+your
+mind
+Tell
+us
+where
+you
+came
+from
+Sp
+I
+don
+t
+know
+Dr
+You
+don
+t
+seem
+to
+care
+Sp
+No
+I
+want
+morphine
+Dr
+Do
+you
+know
+what
+year
+it
+is
+Sp
+I
+don
+t
+care
+about
+that
+all
+I
+want
+is
+morphine
+I
+have
+been
+to
+every
+store
+in
+town
+Dr
+Which
+town
+Sp
+I
+don
+t
+know
+I
+can
+t
+remember
+I
+never
+stayed
+in
+any
+place
+long
+because
+I
+wanted
+to
+see
+the
+world
+Dr
+What
+is
+the
+last
+place
+you
+remember
+Sp
+I
+can
+t
+remember
+Dr
+What
+is
+your
+name
+Sp
+I
+haven
+t
+heard
+it
+for
+so
+many
+years
+that
+I
+don
+t
+know
+what
+they
+would
+call
+me
+now
+Dr
+Try
+to
+recall
+what
+year
+it
+is
+Sp
+I
+want
+morphine
+so
+bad
+that
+I
+can
+t
+think
+or
+talk
+about
+anything
+else
+Dr
+What
+was
+your
+mother
+s
+name
+Sp
+My
+mother
+s
+name
+Dr
+Was
+it
+Mrs
+Brown
+or
+Green
+or
+White
+Sp
+No
+color
+at
+all
+If
+you
+would
+give
+me
+just
+one
+grain
+everything
+would
+be
+fine
+If
+you
+are
+a
+doctor
+then
+give
+me
+some
+They
+always
+do
+Dr
+You
+will
+not
+get
+any
+this
+time
+Sp
+Then
+you
+are
+not
+a
+doctor
+Dr
+You
+are
+controlling
+my
+wife
+s
+body
+you
+are
+a
+spirit
+Sp
+I
+don
+t
+care
+anything
+about
+that
+Dr
+If
+you
+cannot
+be
+sincere
+you
+will
+have
+to
+go
+Overcome
+your
+old
+habits
+we
+can
+help
+you
+Sp
+I
+am
+a
+sick
+woman
+Dr
+Were
+you
+married
+Sp
+Yes
+Dr
+What
+was
+your
+husband
+s
+name
+Sp
+Frank
+Noble
+Dr
+What
+did
+Frank
+call
+you
+Sp
+Elizabeth
+Dr
+What
+did
+your
+husband
+do
+for
+a
+living
+Sp
+Anything
+Dr
+How
+old
+are
+you
+Sp
+I
+am
+forty
+two
+years
+old
+Dr
+Who
+is
+President
+Sp
+I
+don
+t
+know
+and
+I
+don
+t
+care
+I
+never
+entered
+politics
+My
+husband
+was
+crazy
+over
+politics
+I
+was
+busy
+keeping
+my
+house
+clean
+My
+husband
+called
+me
+Betty
+He
+used
+to
+say
+Betty
+you
+are
+a
+good
+girl
+Dr
+Where
+is
+Frank
+Sp
+I
+haven
+t
+seen
+him
+for
+ages
+He
+was
+a
+pretty
+good
+fellow
+Dr
+Where
+is
+your
+mother
+Sp
+My
+mother
+is
+dead
+Dr
+Where
+did
+you
+come
+from
+SP
+I
+came
+from
+from
+El
+Paso
+Texas
+Dr
+Were
+you
+born
+there
+Sp
+Ask
+my
+husband
+Moaning
+I
+am
+too
+sick
+Dr
+Can
+t
+you
+realize
+that
+you
+have
+no
+physical
+body
+but
+are
+a
+spirit
+Sp
+Then
+I
+can
+go
+to
+Heaven
+and
+sing
+I
+used
+to
+go
+to
+church
+Dr
+What
+church
+did
+you
+go
+to
+Sp
+The
+Methodist
+Dr
+Did
+your
+husband
+go
+too
+Sp
+Frank
+was
+such
+a
+good
+fellow
+I
+have
+not
+seen
+him
+for
+a
+long
+time
+He
+liked
+me
+and
+I
+liked
+him
+In
+a
+shrill
+voice
+Frank
+I
+want
+to
+see
+you
+Frankie
+Frankie
+will
+you
+help
+me
+Are
+you
+here
+Frankle
+Dr
+Don
+t
+speak
+that
+way
+Sp
+Would
+you
+give
+me
+some
+morphine
+Frankie
+always
+gave
+it
+to
+me
+Dr
+Russell
+always
+told
+me
+that
+I
+should
+take
+it
+for
+my
+heart
+Affectedly
+Frankie
+Frankie
+Dr
+Why
+do
+you
+call
+Frankie
+in
+that
+way
+Sp
+Oh
+I
+always
+call
+him
+in
+time
+for
+dinner
+I
+always
+used
+to
+call
+him
+he
+is
+a
+lovely
+little
+fellow
+Dr
+Don
+t
+be
+so
+foolish
+Be
+sincere
+Sp
+Oh
+I
+m
+sincere
+when
+I
+call
+Frankie
+I
+m
+thinking
+of
+Frankie
+I
+love
+him
+But
+I
+love
+morphine
+too
+Oh
+Frankle
+is
+standing
+there
+Spirit
+When
+did
+you
+come
+Frankie
+Give
+me
+some
+morphine
+Dr
+Does
+he
+answer
+you
+Sp
+He
+says
+he
+will
+not
+give
+me
+anything
+Frankie
+you
+used
+to
+go
+to
+the
+drug
+store
+for
+me
+Be
+a
+good
+fellow
+now
+Just
+give
+me
+one
+shot
+Frankie
+and
+I
+won
+t
+ask
+you
+again
+You
+know
+I
+m
+awful
+sick
+You
+love
+me
+don
+t
+you
+Frankie
+Then
+just
+give
+me
+a
+little
+and
+we
+will
+both
+be
+so
+happy
+together
+The
+spirit
+was
+taken
+away
+and
+her
+husband
+controlled
+the
+psychic
+Spirit
+FRANK
+NOBLE
+Psychic
+MRs
+WICKKLAND
+Spirit
+I
+am
+Frank
+Noble
+I
+have
+been
+trying
+very
+hard
+for
+some
+time
+to
+bring
+my
+wife
+here
+for
+help
+Doctor
+It
+must
+have
+required
+a
+good
+deal
+of
+patience
+on
+your
+part
+Sp
+Thank
+you
+for
+bringing
+her
+to
+me
+Dr
+We
+are
+glad
+to
+have
+been
+of
+any
+help
+Sp
+My
+wife
+was
+very
+sick
+Once
+the
+doctor
+gave
+her
+morphine
+to
+help
+her
+pain
+and
+from
+that
+time
+she
+had
+spells
+so
+severe
+that
+we
+could
+do
+nothing
+but
+call
+the
+doctor
+to
+give
+her
+morphine
+It
+was
+an
+awful
+habit
+to
+get
+into
+Many
+many
+times
+she
+played
+sick
+I
+know
+when
+she
+wanted
+morphine
+She
+had
+played
+that
+game
+so
+long
+that
+it
+really
+was
+very
+easy
+for
+her
+to
+play
+sick
+to
+scare
+us
+all
+and
+to
+ask
+for
+morphine
+What
+could
+a
+fellow
+do
+After
+she
+had
+it
+she
+would
+be
+well
+sometimes
+for
+whole
+weeks
+and
+sometimes
+for
+a
+month
+The
+spells
+she
+had
+were
+very
+bad
+Dr
+Where
+did
+you
+live
+Sp
+We
+came
+from
+El
+Paso
+Texas
+Dr
+Do
+you
+know
+when
+you
+passed
+out
+Sp
+No
+I
+can
+t
+tell
+you
+It
+has
+been
+very
+strange
+for
+me
+I
+had
+a
+hard
+time
+Of
+course
+I
+was
+not
+a
+rich
+man
+I
+had
+to
+earn
+my
+living
+doing
+what
+I
+could
+Dr
+That
+is
+no
+disgrace
+Sp
+I
+had
+no
+education
+so
+had
+to
+do
+whatever
+I
+could
+Sometimes
+I
+worked
+at
+mining
+other
+times
+I
+worked
+in
+the
+woods
+and
+sometimes
+I
+was
+a
+carpenter
+I
+did
+anything
+to
+keep
+my
+home
+together
+At
+one
+time
+Elizabeth
+was
+a
+very
+good
+girl
+One
+time
+when
+she
+had
+a
+child
+she
+was
+very
+sick
+and
+in
+great
+pain
+The
+doctor
+gave
+her
+pills
+and
+after
+a
+while
+she
+wanted
+more
+and
+more
+and
+at
+last
+she
+went
+insane
+over
+morphine
+She
+was
+very
+hard
+to
+get
+along
+with
+until
+she
+got
+it
+and
+after
+that
+she
+was
+happy
+and
+she
+would
+not
+have
+another
+spell
+for
+a
+while
+The
+habit
+grew
+on
+her
+She
+had
+bad
+coughing
+spells
+and
+she
+died
+in
+one
+of
+them
+She
+took
+a
+pill
+and
+in
+some
+way
+or
+other
+she
+choked
+to
+death
+She
+went
+through
+the
+death
+scene
+here
+tonight
+Dr
+She
+would
+have
+coughed
+a
+great
+deal
+more
+if
+I
+had
+not
+checked
+her
+Sp
+For
+a
+long
+time
+I
+tried
+to
+find
+her
+but
+when
+I
+came
+near
+her
+she
+ran
+away
+and
+only
+called
+for
+morphine
+Once
+in
+a
+while
+I
+lost
+her
+completely
+and
+I
+did
+not
+know
+where
+she
+was
+It
+is
+strange
+When
+you
+think
+of
+people
+you
+are
+right
+with
+them
+Finally
+I
+was
+always
+able
+to
+find
+my
+wife
+whenever
+I
+lost
+her
+Sometimes
+she
+got
+into
+another
+person
+I
+found
+her
+again
+but
+she
+was
+so
+afraid
+of
+me
+I
+died
+before
+she
+did
+Dr
+Did
+you
+have
+any
+knowledge
+of
+the
+spirit
+world
+before
+you
+passed
+on
+Sp
+My
+mother
+was
+a
+medium
+and
+I
+learned
+the
+truth
+from
+her
+Elizabeth
+would
+never
+believe
+it
+because
+she
+was
+a
+Methodist
+She
+thought
+I
+would
+go
+to
+hell
+because
+I
+believed
+in
+Spiritualism
+Look
+into
+the
+truth
+and
+you
+will
+be
+much
+better
+off
+Do
+not
+have
+creeds
+dogmas
+or
+doubts
+Thank
+you
+for
+helping
+us
+because
+when
+my
+wife
+gets
+out
+of
+this
+stupor
+she
+is
+in
+she
+will
+be
+better
+They
+put
+her
+to
+sleep
+under
+morphine
+when
+she
+was
+in
+the
+hospital
+Now
+she
+will
+not
+bother
+others
+any
+more
+and
+we
+shall
+be
+together
+Thank
+you
+for
+helping
+us
+Good
+night
+The
+spirit
+of
+Olive
+T
+who
+had
+controlled
+the
+psychic
+upon
+several
+occasions
+returned
+one
+evening
+and
+speaking
+of
+the
+real
+happiness
+of
+service
+urged
+that
+all
+those
+subject
+to
+the
+temptations
+of
+society
+life
+and
+the
+excitement
+of
+the
+movie
+world
+be
+warned
+against
+the
+use
+of
+drugs
+and
+asked
+if
+she
+might
+bring
+in
+a
+spirit
+who
+was
+in
+trouble
+and
+needed
+to
+be
+awakened
+A
+spirit
+who
+seemed
+to
+be
+in
+a
+drowsy
+state
+then
+controlled
+the
+psychic
+collapsing
+weakly
+but
+when
+spoken
+to
+began
+to
+struggle
+desperately
+as
+if
+in
+the
+throes
+of
+great
+pain
+and
+agony
+EXPERIENCE
+OCTOBER
+Spirit
+WALLACE
+R
+PSYCHIC
+MRS
+WICKLAND
+Doctor
+Tell
+us
+who
+you
+are
+Do
+you
+realize
+that
+you
+have
+lost
+your
+physical
+body
+The
+spirit
+did
+not
+seem
+to
+hear
+but
+moaned
+incessantly
+and
+writhed
+as
+if
+in
+torture
+Dr
+Can
+you
+talk
+Understand
+that
+you
+are
+now
+a
+spirit
+See
+Chap
+Pages
+Spirit
+Olive
+T
+Still
+no
+answer
+the
+contortions
+of
+the
+body
+continued
+Dr
+Try
+to
+talk
+Who
+are
+you
+Sp
+Faintly
+Wally
+Dr
+Wally
+who
+Sp
+Wally
+R
+Dr
+Make
+an
+effort
+to
+talk
+use
+your
+will
+Will
+to
+be
+your
+rational
+self
+Try
+to
+understand
+your
+condition
+then
+we
+can
+help
+you
+The
+spirit
+continued
+to
+struggle
+and
+groan
+Dr
+Try
+to
+talk
+you
+can
+Forget
+your
+old
+condition
+forget
+your
+old
+habit
+You
+no
+longer
+have
+your
+old
+physical
+body
+You
+are
+controlling
+the
+body
+of
+another
+Make
+an
+effort
+to
+talk
+wake
+up
+No
+answer
+Dr
+Forget
+your
+trouble
+and
+start
+anew
+Do
+you
+know
+Olive
+T
+Who
+had
+preceded
+this
+spirit
+The
+intelligence
+moaned
+and
+held
+out
+imploring
+hands
+Sp
+Weakly
+My
+wife
+Dr
+Your
+wife
+is
+not
+here
+Sp
+Where
+is
+she
+Dr
+She
+is
+not
+here
+Friends
+have
+brought
+you
+here
+Try
+to
+rouse
+yourself
+Often
+when
+persons
+pass
+out
+of
+the
+physical
+under
+the
+conditions
+you
+did
+under
+the
+influence
+of
+narcotics
+they
+remain
+in
+a
+stupor
+for
+some
+time
+But
+it
+is
+time
+for
+you
+to
+waken
+now
+Can
+you
+see
+Olive
+T
+here
+Sp
+In
+a
+whisper
+I
+am
+sick
+Dr
+You
+must
+forget
+that
+Your
+sickness
+is
+over
+You
+passed
+out
+of
+your
+physical
+body
+quite
+a
+while
+ago
+Do
+you
+realize
+that
+You
+are
+what
+people
+call
+dead
+But
+you
+are
+not
+actually
+dead
+you
+have
+only
+lost
+your
+physical
+body
+You
+yourself
+are
+still
+living
+You
+are
+using
+another
+body
+temporarily
+Olive
+T
+and
+others
+brought
+you
+here
+to
+be
+helped
+You
+have
+been
+in
+a
+stupified
+condition
+for
+a
+long
+time
+You
+feel
+much
+better
+now
+don
+t
+you
+The
+spirit
+motioned
+languidly
+as
+if
+noticing
+a
+group
+of
+invisibles
+Dr
+Whom
+do
+you
+see
+Endeavor
+to
+talk
+Understand
+you
+no
+longer
+have
+a
+physical
+body
+you
+are
+here
+in
+spirit
+controlling
+this
+body
+which
+belongs
+to
+my
+wife
+You
+have
+been
+brought
+here
+for
+the
+purpose
+of
+being
+helped
+Try
+to
+be
+your
+own
+natural
+self
+We
+always
+enjoyed
+your
+pictures
+Wake
+up
+and
+be
+yourself
+Do
+not
+think
+you
+are
+dreaming
+you
+are
+not
+The
+spirit
+again
+stretched
+out
+his
+hands
+Dr
+Do
+you
+see
+friends
+Sp
+I
+am
+going
+to
+die
+Dr
+You
+have
+already
+done
+that
+as
+much
+as
+you
+ever
+will
+You
+have
+only
+lost
+your
+physical
+body
+Do
+you
+see
+friends
+Sp
+Yes
+but
+I
+am
+going
+to
+die
+Dr
+You
+cannot
+die
+again
+Sp
+I
+see
+so
+many
+who
+have
+died
+Dr
+They
+are
+not
+actually
+dead
+at
+all
+They
+are
+spirits
+like
+yourself
+You
+have
+already
+passed
+out
+of
+your
+mortal
+body
+You
+are
+a
+spirit
+but
+do
+not
+understand
+the
+fact
+This
+body
+which
+you
+are
+using
+is
+not
+yours
+You
+have
+lost
+your
+body
+and
+have
+not
+wakened
+to
+your
+real
+condition
+Friends
+have
+brought
+you
+here
+for
+help
+But
+the
+spirit
+could
+not
+be
+roused
+again
+and
+was
+taken
+away
+One
+of
+the
+guiding
+intelligences
+then
+came
+in
+and
+said
+The
+other
+spirit
+was
+so
+tired
+that
+we
+could
+not
+waken
+him
+but
+now
+we
+will
+be
+able
+to
+take
+care
+of
+him
+He
+is
+so
+weak
+He
+has
+not
+overcome
+his
+old
+habit
+We
+brought
+him
+here
+so
+that
+we
+could
+take
+him
+to
+the
+spirit
+world
+Olive
+T
+and
+others
+work
+to
+help
+the
+ones
+who
+are
+in
+that
+particular
+trouble
+earthbound
+spirits
+who
+have
+the
+craving
+for
+morphine
+Often
+people
+do
+not
+have
+the
+habit
+but
+they
+are
+influenced
+by
+spirits
+who
+have
+the
+craving
+and
+who
+get
+into
+their
+magnetic
+auras
+Many
+persons
+are
+easily
+influenced
+because
+they
+live
+such
+nervous
+sensitive
+lives
+that
+they
+are
+half
+in
+spirit
+They
+then
+become
+influenced
+by
+earthbound
+spirits
+who
+are
+so
+much
+in
+earth
+life
+that
+they
+obsess
+people
+We
+are
+going
+to
+help
+this
+young
+man
+and
+sometime
+he
+will
+come
+again
+when
+he
+is
+stronger
+and
+tell
+his
+experience
+but
+he
+cannot
+talk
+tonight
+He
+has
+gradually
+been
+awakening
+for
+some
+time
+but
+he
+is
+still
+bewildered
+and
+he
+could
+not
+realize
+the
+higher
+life
+He
+has
+been
+in
+many
+places
+and
+with
+his
+wife
+much
+of
+the
+time
+She
+helped
+him
+in
+fighting
+his
+habit
+but
+he
+was
+too
+weak
+to
+properly
+understand
+He
+had
+no
+resistive
+power
+left
+After
+he
+passed
+out
+his
+spirit
+was
+in
+a
+kind
+of
+sleep
+from
+morphine
+Still
+he
+has
+been
+wandering
+in
+a
+twilight
+state
+on
+earth
+life
+to
+find
+his
+home
+and
+family
+and
+trying
+to
+realize
+where
+he
+was
+He
+thought
+he
+was
+lost
+We
+have
+tried
+to
+reach
+him
+from
+our
+side
+of
+life
+but
+it
+has
+been
+very
+hard
+We
+will
+now
+take
+care
+of
+him
+One
+week
+later
+the
+spirit
+of
+Wallace
+R
+returned
+somewhat
+stronger
+and
+telling
+of
+his
+suffering
+made
+an
+anguished
+appeal
+to
+others
+to
+overcome
+the
+drug
+habit
+EXPERIENCE
+OCTOBER
+Spirit
+WALLACE
+R
+Psychic
+MRS
+WICKLAND
+The
+spirit
+seemed
+very
+weak
+and
+was
+at
+first
+unable
+to
+talk
+Doctor
+Whom
+have
+we
+here
+Rouse
+yourself
+and
+talk
+Do
+not
+think
+of
+any
+sickness
+Just
+talk
+as
+you
+used
+to
+do
+Spirit
+Faintly
+That
+is
+easy
+to
+say
+Dr
+Make
+the
+effort
+you
+will
+find
+it
+easy
+Sp
+I
+wanted
+to
+come
+in
+to
+get
+a
+little
+more
+understanding
+I
+could
+not
+get
+much
+the
+last
+time
+I
+am
+in
+the
+dark
+I
+am
+in
+the
+darkness
+having
+to
+overcome
+my
+physical
+habit
+which
+is
+attached
+to
+the
+soul
+Dr
+Have
+you
+been
+here
+before
+Sp
+Yes
+I
+was
+here
+not
+long
+ago
+and
+I
+thank
+you
+for
+helping
+me
+but
+I
+need
+more
+help
+Please
+give
+me
+strength
+to
+overcome
+my
+physical
+habit
+of
+using
+drugs
+I
+had
+little
+understanding
+of
+the
+life
+hereafter
+I
+lived
+from
+day
+to
+day
+the
+life
+of
+the
+world
+I
+did
+not
+realize
+what
+it
+would
+mean
+to
+be
+on
+the
+other
+side
+of
+life
+Dr
+Very
+few
+interest
+themselves
+in
+higher
+things
+Sp
+I
+also
+want
+to
+thank
+you
+for
+having
+helped
+me
+during
+the
+time
+I
+was
+sick
+At
+that
+time
+I
+felt
+such
+a
+strong
+power
+trying
+to
+help
+me
+to
+overcome
+and
+trying
+to
+give
+me
+strength
+I
+felt
+drawn
+somewhere
+but
+I
+was
+too
+weak
+to
+realize
+the
+power
+that
+was
+sent
+out
+to
+help
+me
+Dr
+We
+concentrated
+for
+you
+during
+the
+time
+you
+were
+sick
+as
+we
+thought
+there
+might
+be
+some
+obsession
+there
+SP
+I
+was
+too
+weak
+to
+realize
+Dr
+Of
+course
+you
+did
+not
+understand
+SP
+I
+had
+no
+power
+and
+there
+was
+no
+battery
+at
+our
+end
+to
+help
+me
+My
+only
+hope
+was
+to
+try
+to
+conquer
+I
+was
+in
+such
+misery
+and
+so
+helpless
+that
+many
+spirits
+demonstrated
+through
+me
+and
+I
+had
+no
+one
+who
+understood
+how
+to
+help
+me
+conquer
+the
+soul
+craving
+The
+spirit
+kept
+the
+hands
+across
+the
+chest
+and
+constantly
+twisted
+the
+fingers
+one
+over
+the
+other
+People
+think
+when
+they
+take
+drugs
+that
+the
+habit
+will
+end
+when
+they
+pass
+out
+of
+the
+physical
+I
+tried
+to
+conquer
+but
+when
+my
+mortal
+body
+had
+gone
+and
+my
+dear
+noble
+wife
+could
+not
+be
+with
+me
+to
+help
+me
+battle
+in
+the
+hard
+struggle
+I
+seemed
+helpless
+She
+is
+a
+dear
+noble
+soul
+she
+stood
+by
+me
+and
+helped
+me
+but
+I
+had
+not
+the
+power
+to
+conquer
+After
+I
+had
+lost
+all
+the
+surroundings
+of
+earth
+I
+went
+into
+a
+kind
+of
+sleep
+for
+awhile
+but
+oh
+how
+I
+longed
+for
+my
+wife
+and
+children
+Also
+how
+I
+longed
+to
+conquer
+but
+could
+not
+I
+suffered
+writhing
+painfully
+oh
+how
+I
+suffered
+I
+tried
+to
+go
+somewhere
+to
+get
+help
+to
+get
+help
+to
+overcome
+but
+I
+must
+thank
+you
+you
+gave
+me
+both
+strength
+and
+power
+I
+wish
+I
+could
+have
+had
+more
+power
+from
+your
+good
+thoughts
+Since
+last
+I
+was
+here
+I
+have
+gained
+much
+I
+am
+not
+strong
+yet
+but
+I
+am
+able
+to
+see
+and
+realize
+how
+I
+can
+win
+my
+battle
+From
+the
+little
+I
+have
+seen
+of
+the
+spirit
+world
+since
+I
+was
+here
+last
+I
+realize
+how
+wonderful
+things
+are
+Earnestly
+I
+wish
+I
+could
+warn
+many
+I
+knew
+and
+tell
+them
+not
+to
+play
+with
+drugs
+They
+think
+it
+is
+fun
+in
+the
+beginning
+but
+how
+they
+will
+have
+to
+suffer
+at
+the
+last
+Even
+the
+soul
+burns
+from
+the
+craving
+They
+should
+do
+everything
+they
+can
+to
+over
+come
+the
+habit
+They
+not
+only
+suffer
+here
+but
+they
+suffer
+terribly
+after
+they
+pass
+out
+then
+the
+soul
+is
+on
+fire
+With
+an
+agonized
+expression
+hands
+and
+fingers
+working
+nervously
+Many
+yes
+many
+come
+back
+and
+try
+to
+get
+the
+drug
+try
+to
+get
+even
+a
+little
+and
+they
+ruin
+others
+against
+their
+will
+I
+knew
+many
+times
+that
+I
+myself
+did
+not
+want
+it
+but
+there
+was
+such
+a
+strong
+power
+back
+of
+me
+Obsession
+If
+the
+world
+could
+only
+know
+My
+dear
+noble
+wife
+is
+trying
+very
+hard
+to
+warn
+others
+so
+they
+will
+not
+meet
+the
+same
+fate
+and
+death
+I
+did
+It
+was
+awful
+After
+the
+death
+of
+Wallace
+R
+his
+wife
+Mrs
+R
+played
+a
+leading
+role
+in
+a
+moving
+picture
+which
+vividly
+portrayed
+the
+horrors
+of
+the
+narcotic
+evil
+Thanks
+to
+you
+here
+I
+have
+found
+relief
+I
+feel
+better
+I
+will
+gain
+now
+I
+have
+opened
+my
+soul
+s
+eyes
+and
+I
+find
+there
+are
+great
+possibilities
+for
+me
+and
+in
+time
+there
+will
+be
+relief
+for
+me
+Oh
+if
+I
+could
+only
+warn
+and
+help
+others
+So
+many
+are
+taking
+that
+deadly
+drug
+They
+think
+they
+can
+forget
+sorrow
+and
+gain
+strength
+from
+the
+drug
+They
+do
+for
+a
+while
+but
+it
+only
+lasts
+a
+little
+time
+then
+it
+is
+worse
+They
+take
+it
+a
+second
+time
+and
+it
+is
+a
+little
+worse
+a
+third
+time
+still
+worse
+and
+so
+on
+When
+people
+drink
+whiskey
+it
+makes
+them
+drunk
+but
+after
+a
+good
+sleep
+they
+get
+over
+it
+and
+they
+do
+not
+have
+the
+terrible
+craving
+that
+they
+do
+from
+drugs
+The
+world
+will
+go
+mad
+if
+the
+narcotic
+evil
+is
+not
+stopped
+soon
+Shutting
+out
+liquor
+did
+great
+harm
+because
+people
+must
+have
+a
+stimulant
+of
+some
+kind
+They
+work
+hard
+very
+hard
+in
+the
+movies
+and
+it
+is
+nerve
+racking
+work
+As
+I
+said
+they
+must
+have
+something
+to
+stimulate
+their
+nerves
+so
+they
+can
+go
+on
+If
+they
+took
+some
+wine
+or
+beer
+or
+even
+some
+whiskey
+to
+quiet
+their
+nerves
+it
+would
+not
+be
+such
+a
+detriment
+as
+morphine
+is
+Most
+of
+them
+use
+morphine
+and
+oh
+moaning
+in
+anguish
+if
+I
+could
+only
+come
+back
+and
+warn
+them
+If
+only
+they
+would
+believe
+me
+I
+would
+tell
+them
+to
+overcome
+and
+let
+them
+know
+what
+a
+terrible
+thing
+it
+is
+to
+be
+a
+slave
+to
+a
+drug
+If
+they
+only
+would
+realize
+what
+is
+beyond
+they
+would
+never
+use
+drugs
+Dr
+The
+condition
+of
+the
+spirits
+who
+have
+taken
+drugs
+during
+earth
+life
+must
+be
+terrible
+on
+the
+other
+side
+Sp
+Shuddering
+I
+don
+t
+want
+to
+go
+there
+The
+earth
+sphere
+I
+saw
+one
+glimpse
+of
+it
+Thank
+you
+for
+concentrating
+for
+me
+it
+has
+been
+of
+such
+help
+I
+was
+weak
+but
+through
+your
+concentration
+they
+have
+been
+able
+to
+help
+me
+on
+this
+side
+and
+give
+me
+strength
+and
+also
+to
+put
+me
+to
+sleep
+so
+I
+can
+gain
+strength
+I
+was
+trying
+to
+come
+back
+somewhere
+to
+get
+help
+at
+some
+psychic
+circle
+but
+I
+could
+not
+do
+very
+much
+I
+did
+not
+understand
+then
+Since
+I
+was
+here
+the
+last
+time
+and
+you
+talked
+to
+me
+I
+am
+stronger
+and
+I
+have
+come
+now
+to
+thank
+you
+and
+to
+say
+I
+am
+on
+the
+way
+to
+health
+and
+happiness
+I
+wish
+I
+had
+know
+about
+you
+when
+I
+was
+first
+taken
+sick
+I
+could
+probably
+have
+overcome
+and
+conquered
+If
+I
+could
+only
+talk
+to
+my
+dear
+noble
+wife
+and
+thank
+her
+for
+helping
+me
+and
+for
+trying
+to
+warn
+others
+who
+are
+on
+the
+same
+road
+I
+was
+I
+will
+conquer
+now
+and
+then
+I
+want
+the
+world
+to
+know
+I
+want
+to
+warn
+the
+grown
+ups
+to
+warn
+children
+to
+warn
+young
+men
+to
+warn
+young
+women
+to
+never
+never
+start
+taking
+that
+deadly
+drug
+I
+would
+rather
+have
+pain
+than
+take
+it
+For
+a
+while
+it
+kills
+pain
+then
+opens
+the
+wound
+worse
+than
+ever
+You
+do
+not
+know
+how
+terrible
+the
+suffering
+is
+I
+could
+not
+tell
+You
+If
+I
+were
+burning
+in
+hell
+it
+could
+not
+be
+worse
+than
+having
+every
+nerve
+in
+my
+body
+burning
+It
+drives
+one
+mad
+No
+one
+can
+realize
+it
+except
+through
+experience
+Dr
+The
+spirit
+friends
+can
+help
+you
+Sp
+I
+have
+help
+now
+and
+I
+do
+thank
+you
+Next
+time
+if
+I
+can
+come
+again
+I
+may
+be
+able
+to
+tell
+of
+my
+progression
+in
+the
+other
+world
+I
+have
+seen
+very
+little
+but
+I
+will
+learn
+I
+am
+in
+a
+school
+a
+hospital
+where
+I
+am
+learning
+to
+overcome
+People
+think
+that
+when
+they
+die
+all
+troubles
+will
+be
+ended
+That
+is
+the
+first
+time
+you
+really
+live
+and
+all
+your
+desires
+and
+cravings
+are
+with
+you
+because
+they
+belong
+to
+the
+soul
+not
+the
+body
+The
+body
+is
+only
+the
+dress
+Now
+I
+am
+in
+school
+to
+learn
+the
+lessons
+of
+life
+from
+the
+real
+standpoint
+and
+I
+am
+learning
+Thank
+you
+all
+for
+helping
+me
+and
+also
+for
+giving
+me
+the
+opportunity
+of
+learning
+the
+lessons
+of
+life
+I
+wish
+many
+places
+had
+circles
+like
+this
+to
+help
+spirits
+in
+darkness
+Some
+time
+send
+my
+love
+to
+my
+dear
+noble
+wife
+I
+will
+try
+when
+I
+am
+stronger
+to
+impress
+her
+that
+I
+am
+there
+with
+her
+Dr
+Be
+brave
+and
+forget
+all
+about
+your
+trouble
+Let
+the
+Mercy
+Band
+of
+Spirit
+Forces
+help
+you
+then
+you
+will
+gradually
+overcome
+Sp
+Yes
+I
+will
+and
+thank
+you
+Goodbye
+Spirits
+of
+former
+drunkards
+no
+longer
+able
+to
+satisfy
+their
+desire
+for
+liquor
+in
+the
+usual
+way
+may
+attach
+themselves
+to
+susceptible
+mortals
+and
+through
+suggestive
+influence
+force
+the
+latter
+to
+drink
+for
+them
+Victims
+of
+such
+obsession
+have
+been
+brought
+to
+our
+observation
+the
+most
+recent
+case
+being
+that
+of
+Mrs
+V
+a
+periodic
+inebriate
+who
+for
+some
+time
+had
+endeavored
+in
+vain
+to
+overcome
+the
+tendency
+to
+drink
+Having
+again
+failed
+to
+conquer
+this
+irresistible
+impulse
+she
+came
+to
+us
+one
+evening
+strongly
+under
+the
+influence
+of
+liquor
+and
+asked
+to
+be
+given
+a
+treatment
+After
+her
+departure
+we
+held
+a
+concentration
+circle
+when
+the
+spirit
+of
+a
+drunkard
+dislodged
+from
+Mrs
+V
+controlled
+Mrs
+Wickland
+EXPERIENCE
+APRIL
+Spirit
+PAUL
+HoPKINS
+Patient
+MRS
+V
+Psychic
+MRS
+WICKLAND
+Doctor
+Are
+you
+a
+stranger
+to
+us
+Where
+did
+you
+come
+from
+Spirit
+Attempting
+to
+fight
+It
+s
+too
+warm
+Why
+did
+you
+pull
+me
+away
+when
+I
+was
+just
+going
+to
+have
+a
+drink
+and
+a
+good
+time
+Dr
+Aren
+t
+you
+ashamed
+of
+yourself
+Do
+you
+think
+that
+controlling
+a
+lady
+and
+ruining
+her
+life
+is
+a
+good
+time
+Sp
+When
+a
+fellow
+feels
+so
+blue
+what
+can
+he
+do
+Dr
+You
+must
+overcome
+your
+old
+habit
+Sp
+I
+m
+so
+warm
+I
+m
+awfully
+hot
+Dr
+Where
+did
+you
+come
+from
+Sp
+Give
+me
+something
+quick
+I
+m
+so
+dry
+Dr
+You
+have
+had
+all
+you
+are
+going
+to
+have
+Sp
+I
+m
+burning
+up
+Dr
+You
+made
+a
+lady
+drink
+for
+you
+Do
+you
+know
+that
+you
+are
+dead
+and
+are
+now
+a
+spirit
+Sp
+All
+I
+know
+is
+I
+m
+hot
+It
+was
+pouring
+fire
+all
+over
+me
+Static
+treatment
+given
+patient
+Dr
+That
+was
+good
+for
+you
+Sp
+I
+ran
+away
+when
+all
+that
+hot
+fire
+came
+down
+on
+me
+It
+s
+the
+first
+time
+I
+ever
+felt
+anything
+like
+that
+It
+was
+so
+hot
+that
+I
+thought
+I
+was
+in
+an
+oven
+They
+must
+have
+new
+things
+these
+days
+Dr
+What
+do
+you
+mean
+Sp
+Fire
+pouring
+down
+on
+my
+back
+I
+am
+dry
+I
+m
+awful
+dry
+Give
+me
+something
+just
+a
+few
+drops
+Dr
+Can
+t
+you
+understand
+that
+you
+have
+lost
+your
+mortal
+body
+and
+are
+a
+spirit
+Do
+you
+understand
+what
+I
+am
+talking
+about
+Sp
+No
+I
+don
+t
+know
+you
+Dr
+But
+you
+understand
+me
+do
+you
+not
+You
+are
+a
+spirit
+Sp
+You
+give
+me
+something
+to
+drink
+I
+m
+awful
+dry
+Give
+me
+something
+I
+tell
+you
+I
+only
+got
+a
+very
+few
+drops
+when
+you
+took
+me
+away
+Dr
+Why
+don
+t
+you
+behave
+yourself
+SP
+I
+can
+t
+any
+more
+Just
+give
+me
+a
+little
+only
+a
+few
+drops
+Dr
+If
+you
+don
+t
+behave
+yourself
+you
+will
+find
+yourself
+in
+the
+dark
+Sp
+Say
+will
+you
+tell
+that
+druggist
+that
+he
+didn
+t
+give
+it
+to
+me
+strong
+enough
+Tell
+him
+will
+you
+Dr
+You
+are
+done
+with
+druggists
+Sp
+I
+want
+something
+to
+drink
+Dr
+Do
+you
+think
+it
+is
+honorable
+to
+influence
+a
+woman
+and
+make
+her
+drink
+to
+satisfy
+you
+Sp
+I
+ve
+got
+to
+get
+it
+some
+way
+Dr
+Should
+you
+influence
+that
+lady
+to
+drink
+whiskey
+for
+you
+Sp
+Lady
+I
+drank
+it
+myself
+No
+lady
+got
+any
+I
+want
+it
+all
+myself
+You
+can
+t
+get
+very
+much
+these
+days
+and
+when
+you
+get
+it
+you
+don
+t
+give
+it
+away
+You
+want
+it
+all
+yourself
+Dr
+Don
+t
+you
+realize
+that
+you
+are
+getting
+it
+through
+a
+lady
+Sp
+You
+give
+me
+some
+and
+give
+it
+to
+me
+quick
+Dr
+I
+want
+you
+to
+understand
+your
+condition
+Sp
+I
+m
+always
+a
+good
+fellow
+Dr
+Good
+for
+nothing
+Sp
+No
+Dr
+That
+s
+it
+exactly
+good
+for
+nothing
+What
+have
+you
+been
+doing
+lately
+Sp
+I
+haven
+t
+been
+working
+for
+some
+time
+Dr
+Do
+you
+know
+what
+year
+it
+is
+Sp
+I
+don
+t
+care
+Dr
+You
+have
+been
+interfering
+with
+the
+life
+of
+a
+woman
+This
+is
+not
+your
+own
+body
+can
+you
+understand
+that
+It
+is
+a
+woman
+s
+body
+Sp
+Woman
+s
+Dr
+Yes
+See
+your
+skirts
+Sp
+I
+don
+t
+wear
+skirts
+But
+I
+ve
+been
+a
+woman
+once
+in
+a
+while
+Dr
+And
+through
+that
+woman
+you
+got
+the
+whiskey
+You
+should
+be
+ashamed
+of
+yourself
+You
+are
+not
+satisfied
+with
+abusing
+yourself
+but
+you
+must
+also
+control
+a
+woman
+Sp
+Why
+should
+I
+be
+ashamed
+I
+have
+done
+nothing
+but
+drink
+some
+innocent
+whiskey
+Dr
+You
+know
+that
+you
+are
+in
+a
+strange
+condition
+Sp
+I
+know
+I
+feel
+funny
+once
+in
+a
+while
+Dr
+You
+have
+been
+brought
+here
+and
+allowed
+to
+temporarily
+control
+this
+body
+so
+you
+may
+be
+made
+to
+understand
+that
+you
+must
+leave
+that
+lady
+alone
+Her
+name
+is
+Mrs
+V
+do
+you
+know
+her
+Sp
+That
+s
+not
+my
+name
+I
+haven
+t
+heard
+my
+name
+for
+a
+long
+time
+Once
+in
+a
+while
+I
+feel
+kind
+of
+queer
+I
+am
+not
+so
+correct
+about
+things
+as
+I
+used
+to
+be
+Dr
+Should
+you
+not
+ask
+the
+reason
+The
+fact
+is
+you
+have
+lost
+your
+physical
+body
+Sp
+What
+s
+the
+matter
+with
+me
+Dr
+You
+are
+a
+spirit
+and
+are
+invisible
+to
+us
+We
+cannot
+see
+you
+Sp
+Can
+t
+you
+see
+me
+Dr
+No
+Sp
+You
+don
+t
+see
+me
+I
+m
+a
+big
+fellow
+Don
+t
+you
+see
+me
+Why
+Probably
+you
+have
+had
+something
+to
+drink
+too
+Say
+you
+give
+me
+a
+drink
+will
+you
+We
+will
+be
+pretty
+good
+fellows
+together
+I
+shall
+be
+happy
+if
+you
+will
+give
+some
+whiskey
+Dr
+You
+would
+be
+in
+a
+fine
+condition
+then
+Sp
+If
+you
+will
+give
+me
+whiskey
+I
+will
+remember
+you
+in
+my
+will
+You
+give
+me
+something
+to
+drink
+then
+we
+will
+be
+pretty
+good
+fellows
+together
+Dr
+I
+will
+do
+nothing
+of
+the
+kind
+Sp
+Won
+t
+you
+help
+a
+poor
+fellow
+when
+he
+gets
+so
+dry
+Dr
+We
+want
+to
+help
+you
+but
+not
+in
+that
+way
+Sp
+Why
+did
+you
+give
+me
+that
+hot
+fire
+Dr
+I
+was
+giving
+an
+electrical
+treatment
+to
+a
+lady
+not
+to
+you
+The
+lady
+asked
+me
+to
+We
+drove
+you
+away
+from
+her
+but
+that
+does
+not
+seem
+to
+interest
+you
+does
+it
+Sp
+How
+would
+you
+have
+liked
+that
+Dr
+You
+deserved
+it
+Sp
+Say
+can
+t
+you
+give
+me
+some
+whiskey
+Dr
+You
+are
+only
+wasting
+time
+What
+we
+are
+trying
+to
+do
+is
+to
+make
+you
+understand
+your
+condition
+You
+are
+an
+invisible
+spirit
+controlling
+the
+body
+of
+this
+woman
+Sp
+What
+s
+the
+matter
+with
+that
+other
+woman
+Why
+do
+I
+always
+have
+to
+go
+with
+her
+Dr
+You
+have
+been
+obsessing
+her
+You
+are
+selfish
+and
+have
+been
+controlling
+and
+influencing
+her
+It
+is
+not
+the
+woman
+s
+fault
+it
+is
+your
+own
+fault
+Did
+you
+ever
+read
+the
+Bible
+Sp
+The
+Bible
+Dr
+Do
+you
+remember
+how
+Jesus
+cast
+out
+unclean
+spirits
+You
+are
+such
+a
+spirit
+Sp
+Looking
+at
+hands
+These
+rings
+do
+not
+belong
+to
+me
+and
+yet
+how
+in
+the
+devil
+could
+they
+belong
+to
+any
+one
+else
+Dr
+Do
+you
+recognize
+these
+hands
+Sp
+No
+I
+must
+have
+had
+a
+little
+too
+much
+But
+I
+don
+t
+seem
+so
+very
+tipsy
+I
+guess
+I
+have
+had
+a
+little
+too
+much
+probably
+You
+can
+hypnotize
+people
+in
+many
+ways
+maybe
+that
+s
+it
+Or
+probably
+I
+ve
+had
+too
+little
+and
+you
+had
+better
+give
+me
+more
+whiskey
+so
+I
+can
+see
+just
+a
+few
+drops
+I
+am
+blind
+Give
+me
+something
+and
+be
+a
+good
+fellow
+Give
+me
+just
+one
+glass
+more
+then
+I
+shall
+be
+all
+right
+Will
+you
+do
+it
+Dr
+You
+will
+have
+to
+leave
+if
+you
+are
+not
+sensible
+Sp
+You
+can
+t
+drive
+me
+out
+and
+there
+s
+not
+many
+fellows
+who
+could
+either
+I
+m
+pretty
+strong
+you
+can
+see
+that
+Dr
+We
+cannot
+see
+you
+at
+all
+Sp
+I
+could
+fight
+all
+of
+you
+I
+have
+done
+it
+before
+with
+people
+Rolling
+up
+sleeves
+You
+d
+better
+look
+out
+Dr
+Why
+can
+t
+you
+listen
+to
+what
+I
+am
+telling
+you
+You
+are
+invisible
+to
+us
+Sp
+Can
+t
+you
+see
+me
+Dr
+No
+You
+have
+lost
+your
+own
+body
+This
+is
+not
+your
+body
+Sp
+It
+isn
+t
+Attempting
+to
+fight
+Give
+me
+something
+to
+drink
+Dr
+Aren
+t
+you
+ashamed
+of
+yourself
+Sp
+Why
+should
+I
+be
+ashamed
+All
+I
+had
+was
+a
+drink
+Dr
+You
+do
+not
+understand
+your
+condition
+Sp
+Why
+didn
+t
+you
+tell
+that
+woman
+to
+wait
+a
+minute
+The
+patient
+had
+left
+after
+her
+treatment
+She
+ran
+away
+What
+for
+Tell
+her
+to
+wait
+a
+minute
+Dr
+You
+will
+be
+taken
+care
+of
+and
+will
+not
+disturb
+any
+more
+persons
+Sp
+She
+s
+a
+pretty
+good
+woman
+When
+I
+want
+whiskey
+she
+is
+always
+ready
+with
+the
+money
+and
+gives
+it
+to
+me
+Dr
+That
+will
+not
+happen
+any
+more
+Sp
+I
+am
+not
+alone
+there
+are
+many
+others
+with
+me
+Dr
+Did
+they
+all
+want
+to
+drink
+Sp
+Yes
+Dr
+You
+were
+ruining
+a
+woman
+s
+life
+You
+drank
+through
+that
+woman
+You
+controlled
+her
+and
+she
+drank
+for
+you
+Sp
+Do
+you
+mean
+that
+big
+fat
+woman
+Say
+she
+s
+good
+hearted
+She
+s
+always
+ready
+to
+treat
+me
+We
+have
+very
+good
+times
+together
+glorious
+times
+Laughing
+Dr
+You
+have
+had
+your
+last
+good
+time
+Do
+you
+think
+you
+are
+doing
+something
+honorable
+when
+you
+upset
+a
+woman
+s
+life
+and
+make
+a
+drunkard
+of
+her
+Sp
+I
+m
+no
+drunkard
+I
+can
+walk
+just
+as
+straight
+and
+fast
+as
+any
+one
+I
+have
+sense
+We
+both
+have
+a
+good
+drink
+together
+Dr
+There
+is
+no
+sense
+of
+shame
+in
+you
+Try
+to
+realize
+that
+you
+are
+an
+invisible
+spirit
+and
+have
+lost
+your
+own
+body
+It
+is
+now
+Do
+you
+know
+that
+you
+are
+in
+Los
+Angeles
+California
+You
+lost
+your
+body
+probably
+many
+years
+ago
+and
+have
+been
+hovering
+around
+in
+the
+earth
+sphere
+ever
+since
+Sp
+I
+want
+something
+to
+drink
+right
+now
+Dr
+Is
+that
+what
+you
+call
+a
+glorious
+time
+Sp
+It
+s
+a
+good
+time
+for
+a
+while
+Dr
+You
+were
+ruining
+a
+lady
+s
+life
+Sp
+I
+haven
+t
+done
+that
+Dr
+When
+you
+wanted
+whiskey
+you
+made
+that
+lady
+drink
+it
+for
+you
+Sp
+I
+did
+not
+I
+drank
+it
+myself
+Dr
+Yes
+through
+the
+lady
+Don
+t
+act
+so
+innocent
+You
+impressed
+the
+woman
+to
+get
+whiskey
+for
+you
+Sp
+Well
+she
+has
+the
+money
+I
+don
+t
+make
+any
+money
+any
+more
+Dr
+Is
+it
+right
+to
+influence
+that
+woman
+just
+to
+satisfy
+yourself
+Did
+your
+mother
+teach
+you
+such
+things
+Sp
+My
+mother
+died
+long
+ago
+Dr
+Suppose
+your
+mother
+were
+alive
+would
+you
+like
+to
+see
+her
+a
+slave
+to
+an
+earthbound
+spirit
+Sp
+I
+am
+not
+an
+earthbound
+spirit
+Dr
+Would
+you
+like
+to
+see
+your
+mother
+surrounded
+by
+a
+crowd
+of
+earthbound
+spirits
+who
+were
+making
+her
+drink
+Would
+that
+make
+you
+happy
+Sp
+She
+wouldn
+t
+do
+it
+This
+woman
+is
+good
+enough
+for
+me
+She
+only
+buys
+whiskey
+Dr
+Yes
+and
+you
+drink
+it
+through
+her
+Sp
+I
+drink
+it
+myself
+Dr
+By
+controlling
+the
+lady
+Mrs
+V
+just
+as
+you
+are
+now
+controlling
+the
+body
+of
+this
+lady
+Sp
+I
+am
+not
+controlling
+any
+one
+I
+ve
+only
+had
+a
+drink
+Dr
+Try
+to
+be
+sensible
+This
+body
+is
+not
+yours
+Sp
+Whose
+is
+it
+then
+Dr
+It
+belongs
+to
+my
+wife
+She
+is
+a
+psychic
+sensitive
+through
+whom
+spirits
+can
+talk
+Sp
+Will
+she
+have
+a
+drink
+with
+me
+Will
+you
+Dr
+No
+Sp
+I
+ll
+treat
+the
+crowd
+Dr
+I
+thought
+you
+had
+no
+money
+Sp
+I
+always
+get
+some
+money
+from
+the
+lady
+Dr
+She
+is
+not
+here
+Sp
+You
+get
+it
+and
+I
+ll
+treat
+the
+crowd
+Come
+on
+with
+me
+everybody
+I
+ll
+treat
+you
+all
+Dr
+Does
+the
+lady
+pay
+the
+bills
+with
+money
+that
+you
+earn
+SP
+She
+s
+splendid
+There
+s
+another
+man
+helps
+her
+to
+pay
+for
+things
+Dr
+That
+is
+her
+husband
+SP
+Husband
+Dr
+Yes
+husband
+You
+are
+making
+a
+slave
+of
+the
+woman
+and
+making
+a
+drunkard
+of
+her
+Suppose
+it
+were
+your
+mother
+who
+was
+being
+tormented
+Sp
+My
+mother
+Dr
+Yes
+think
+that
+over
+carefully
+Suppose
+somebody
+should
+make
+a
+drunkard
+of
+your
+mother
+how
+would
+you
+feel
+Or
+of
+your
+sister
+Sp
+They
+know
+better
+Dr
+Is
+your
+conduct
+honorable
+Sp
+I
+m
+a
+good
+fellow
+and
+I
+always
+want
+to
+be
+on
+the
+best
+side
+of
+the
+women
+Women
+are
+always
+my
+best
+friends
+They
+always
+have
+money
+and
+are
+willing
+to
+spend
+it
+Dr
+Now
+listen
+to
+me
+You
+have
+actually
+lost
+your
+physical
+body
+probably
+many
+years
+ago
+Who
+is
+the
+President
+Sp
+I
+don
+t
+know
+I
+can
+t
+recall
+any
+one
+Dr
+Is
+Lincoln
+the
+President
+Sp
+No
+that
+was
+a
+long
+time
+ago
+Dr
+Cleveland
+Sp
+No
+Dr
+McKinley
+Arthur
+Sp
+He
+was
+President
+a
+long
+time
+ago
+Dr
+Do
+you
+remember
+Wilson
+Sp
+Wilson
+I
+don
+t
+know
+that
+fellow
+Dr
+Do
+you
+know
+about
+the
+big
+war
+in
+Europe
+with
+twenty
+three
+nations
+fighting
+Sp
+I
+don
+t
+care
+all
+I
+want
+is
+a
+drink
+I
+am
+getting
+so
+thirsty
+What
+do
+I
+care
+for
+war
+If
+they
+want
+to
+kill
+themselves
+what
+do
+I
+care
+They
+are
+better
+off
+If
+they
+don
+t
+know
+any
+better
+than
+to
+kill
+each
+other
+let
+them
+go
+ahead
+Dr
+What
+did
+your
+mother
+call
+you
+Sp
+She
+called
+me
+Paul
+Dr
+What
+was
+your
+surname
+Sp
+It
+is
+a
+long
+time
+since
+I
+heard
+it
+Dr
+What
+did
+they
+call
+your
+father
+Sp
+They
+called
+him
+John
+Hopkins
+Dr
+Then
+you
+must
+be
+Paul
+Hopkins
+What
+state
+were
+you
+born
+in
+Sp
+I
+have
+forgotten
+Of
+yes
+I
+was
+born
+in
+Yuma
+Arizona
+Dr
+Were
+you
+ever
+in
+Los
+Angeles
+Sp
+Yes
+once
+in
+a
+while
+They
+used
+to
+have
+pretty
+good
+saloons
+on
+Main
+Street
+and
+I
+suppose
+they
+are
+there
+now
+Dr
+No
+they
+are
+all
+gone
+Sp
+Then
+I
+don
+t
+know
+what
+became
+of
+them
+Dr
+They
+have
+all
+been
+done
+away
+with
+Sp
+They
+were
+on
+Main
+Street
+between
+Second
+and
+Third
+Dr
+What
+would
+your
+mother
+think
+of
+your
+condition
+Sp
+My
+mother
+is
+dead
+Dr
+Her
+spirit
+did
+not
+die
+She
+would
+be
+sorry
+to
+find
+you
+in
+this
+condition
+Sp
+I
+m
+in
+an
+all
+right
+condition
+I
+feel
+tip
+top
+I
+get
+a
+glass
+of
+whiskey
+when
+I
+want
+it
+and
+it
+makes
+me
+feel
+good
+and
+happy
+Dr
+Does
+it
+make
+you
+happy
+to
+see
+a
+man
+lying
+drunk
+in
+the
+gutter
+Sp
+I
+have
+never
+seen
+it
+But
+liquor
+is
+good
+Oh
+ho
+Who
+is
+that
+Seeing
+some
+spirit
+Dr
+Who
+is
+it
+Sp
+I
+will
+have
+to
+sit
+up
+and
+take
+notice
+She
+s
+a
+nice
+lady
+To
+spirit
+Who
+are
+you
+Dr
+Perhaps
+it
+is
+you
+own
+mother
+Sp
+She
+was
+an
+old
+lady
+This
+lady
+says
+she
+knew
+my
+mother
+My
+mother
+was
+a
+good
+Christian
+woman
+I
+suppose
+she
+is
+with
+God
+in
+Heaven
+sitting
+near
+the
+throne
+Dr
+Jesus
+taught
+that
+God
+is
+Spirit
+and
+God
+is
+Love
+You
+cannot
+find
+such
+a
+God
+sitting
+on
+a
+throne
+Sp
+Where
+does
+He
+sit
+Dr
+God
+is
+Spirit
+and
+is
+not
+in
+any
+particular
+place
+He
+is
+the
+Life
+of
+all
+Nature
+You
+are
+an
+expression
+of
+God
+himself
+Understand
+that
+you
+are
+an
+ignorant
+spirit
+and
+must
+overcome
+your
+old
+habits
+and
+that
+you
+will
+then
+progress
+Sp
+This
+lady
+says
+if
+I
+behave
+myself
+I
+can
+go
+to
+bed
+and
+rest
+I
+m
+awfully
+tired
+I
+am
+a
+pretty
+tired
+fellow
+Will
+they
+let
+me
+rest
+myself
+Dr
+Yes
+and
+when
+you
+wake
+you
+will
+realize
+that
+you
+are
+a
+spirit
+and
+that
+you
+must
+overcome
+old
+habits
+and
+progress
+as
+you
+should
+on
+the
+spirit
+side
+of
+life
+Sp
+That
+lady
+is
+a
+nurse
+Dr
+We
+cannot
+see
+her
+as
+you
+do
+We
+do
+not
+see
+you
+You
+are
+controlling
+my
+wife
+s
+body
+SP
+I
+do
+not
+understand
+that
+I
+want
+to
+go
+to
+that
+bed
+Dr
+You
+must
+learn
+the
+purpose
+of
+life
+SP
+They
+say
+if
+I
+lie
+down
+in
+that
+bed
+I
+will
+not
+get
+any
+more
+whiskey
+Dr
+You
+will
+be
+taught
+how
+to
+progress
+Sp
+Can
+I
+have
+any
+more
+whiskey
+Dr
+No
+Sp
+Well
+I
+don
+t
+care
+I
+m
+tired
+and
+I
+feel
+happy
+What
+can
+a
+fellow
+do
+I
+have
+no
+home
+and
+no
+place
+to
+go
+You
+must
+have
+a
+good
+time
+sometimes
+a
+jollification
+time
+Dr
+You
+did
+not
+understand
+your
+condition
+Sp
+This
+lady
+says
+I
+will
+have
+a
+home
+with
+my
+mother
+I
+will
+go
+to
+my
+mother
+Will
+she
+like
+me
+Dr
+Mother
+love
+never
+dies
+After
+you
+acquire
+understanding
+you
+must
+help
+this
+lady
+whom
+you
+have
+been
+tormenting
+You
+have
+made
+that
+poor
+lady
+a
+drunkard
+Sp
+Have
+I
+I
+didn
+t
+know
+that
+I
+wanted
+something
+to
+drink
+but
+I
+did
+not
+know
+I
+was
+doing
+any
+harm
+Dr
+When
+she
+came
+here
+tonight
+she
+was
+drunk
+and
+I
+gave
+her
+a
+treatment
+Sp
+I
+had
+that
+Dr
+You
+made
+her
+drunk
+she
+herself
+does
+not
+want
+to
+drink
+She
+tries
+to
+resist
+the
+impulse
+She
+is
+a
+sensitive
+and
+you
+hypnotized
+her
+and
+made
+her
+drink
+Sp
+It
+s
+pretty
+hard
+for
+a
+fellow
+to
+give
+it
+up
+Dr
+You
+will
+have
+to
+do
+your
+duty
+and
+help
+her
+Sp
+I
+feel
+pretty
+tired
+I
+want
+to
+go
+to
+that
+bed
+Dr
+Think
+yourself
+in
+that
+bed
+and
+you
+will
+be
+there
+Sp
+I
+will
+By
+thinking
+Dr
+Yes
+be
+perfectly
+quiet
+and
+think
+yourself
+in
+that
+bed
+Sp
+Remember
+me
+I
+am
+a
+good
+fellow
+and
+I
+like
+you
+anyhow
+even
+if
+you
+gave
+me
+that
+fire
+I
+mean
+well
+Dr
+The
+lady
+whom
+you
+see
+will
+be
+your
+nurse
+and
+will
+look
+after
+you
+Sp
+My
+mother
+is
+here
+Oh
+mother
+my
+dear
+will
+you
+forgive
+me
+I
+was
+not
+a
+good
+fellow
+I
+will
+not
+drink
+any
+more
+whiskey
+Mother
+says
+she
+will
+help
+me
+God
+bless
+you
+for
+the
+work
+you
+have
+done
+for
+me
+After
+the
+foregoing
+experience
+a
+friend
+reported
+a
+marked
+change
+for
+the
+better
+in
+Mrs
+V
+saying
+that
+no
+further
+desire
+for
+intoxicants
+was
+manifested
+Mrs
+V
+herself
+acknowledged
+this
+change
+and
+expressed
+her
+gratitude
+for
+the
+relief
+obtained
+Not
+at
+all
+uncommon
+are
+the
+cases
+of
+amnesia
+when
+total
+lapse
+of
+memory
+occurs
+all
+sense
+of
+identity
+is
+lost
+and
+the
+victim
+wanders
+to
+strange
+places
+returning
+to
+his
+normal
+self
+without
+any
+knowledge
+of
+his
+recent
+actions
+We
+have
+abundant
+demonstration
+that
+this
+state
+is
+frequently
+due
+to
+the
+influence
+of
+obsessing
+spirits
+One
+case
+was
+that
+of
+a
+young
+man
+C
+B
+who
+shortly
+after
+he
+had
+established
+himself
+in
+business
+with
+his
+father
+rose
+early
+one
+morning
+and
+left
+his
+home
+without
+the
+knowledge
+of
+his
+parents
+No
+trace
+of
+him
+could
+be
+found
+and
+after
+several
+weeks
+of
+anxiety
+the
+parents
+asked
+us
+to
+concentrate
+for
+their
+missing
+son
+We
+did
+so
+emphasizing
+that
+the
+young
+man
+should
+have
+no
+rest
+until
+he
+would
+write
+to
+his
+parents
+The
+following
+morning
+he
+wrote
+to
+them
+saying
+he
+was
+on
+board
+a
+United
+States
+Man
+of
+War
+at
+San
+Francisco
+that
+he
+had
+enlisted
+in
+the
+Navy
+and
+would
+be
+gone
+for
+several
+years
+The
+boy
+s
+parents
+were
+anxious
+to
+have
+him
+at
+home
+with
+them
+and
+wrote
+him
+to
+that
+effect
+saying
+they
+would
+do
+all
+they
+could
+to
+obtain
+his
+release
+The
+day
+before
+our
+next
+concentration
+circle
+C
+wrote
+his
+parents
+that
+they
+should
+do
+nothing
+regarding
+his
+discharge
+for
+he
+was
+entirely
+willing
+to
+serve
+his
+term
+of
+enlistment
+The
+following
+evening
+we
+again
+concentrated
+for
+C
+B
+and
+a
+spirit
+controlled
+Mrs
+Wickland
+as
+related
+in
+the
+succeeding
+article
+clearly
+giving
+indication
+of
+having
+been
+the
+cause
+of
+the
+young
+man
+s
+recent
+actions
+EXPERIENCE
+DECEMBER
+Spirit
+JOHN
+EDWARDS
+Patient
+C
+B
+Psychic
+MRS
+WICKLAND
+While
+singing
+Throw
+out
+the
+Life
+Line
+an
+amusing
+episode
+occurred
+As
+the
+intelligence
+assumed
+control
+of
+Mrs
+Wickland
+he
+seemed
+to
+be
+pulling
+himself
+along
+hand
+over
+hand
+as
+if
+by
+a
+rope
+and
+then
+made
+the
+motions
+of
+swimming
+Doctor
+Did
+you
+hold
+on
+to
+the
+life
+line
+Have
+you
+been
+drifting
+about
+Where
+did
+you
+come
+from
+You
+do
+not
+need
+to
+swim
+on
+dry
+land
+What
+is
+the
+matter
+with
+you
+Spirit
+I
+want
+to
+find
+out
+what
+s
+the
+matter
+with
+me
+Dr
+How
+long
+have
+you
+been
+dead
+Sp
+To
+audience
+He
+calls
+me
+dead
+I
+am
+not
+dead
+but
+not
+so
+much
+alive
+either
+Dr
+Where
+did
+you
+come
+from
+Sp
+Lots
+of
+people
+brought
+me
+here
+Dr
+Who
+brought
+you
+Sp
+A
+whole
+lot
+of
+people
+Dr
+I
+don
+t
+see
+them
+Sp
+I
+don
+t
+see
+why
+they
+want
+me
+I
+want
+to
+be
+out
+at
+sea
+Dr
+Have
+you
+been
+out
+before
+Sp
+Yes
+Dr
+Why
+do
+you
+want
+to
+go
+out
+to
+sea
+Have
+you
+been
+out
+many
+times
+Sp
+Quite
+a
+little
+Dr
+Don
+t
+you
+want
+to
+be
+on
+shore
+Sp
+I
+don
+t
+want
+to
+be
+a
+dry
+crab
+I
+was
+all
+ready
+to
+go
+out
+but
+you
+pulled
+me
+to
+shore
+I
+don
+t
+see
+why
+they
+should
+pull
+me
+to
+shore
+Dr
+Were
+you
+drowned
+at
+sea
+Sp
+If
+I
+had
+been
+how
+could
+I
+be
+here
+Dr
+Your
+spirit
+could
+be
+here
+Sp
+You
+mean
+the
+soul
+Dr
+Yes
+Sp
+Then
+that
+should
+be
+with
+God
+Dr
+Where
+is
+God
+Sp
+If
+you
+don
+t
+know
+that
+then
+you
+ought
+to
+go
+to
+Sunday
+School
+Dr
+I
+did
+go
+but
+I
+did
+not
+find
+out
+there
+Sp
+Then
+you
+did
+not
+go
+to
+the
+right
+one
+Dr
+Which
+one
+should
+I
+have
+gone
+to
+Sp
+There
+are
+all
+kinds
+of
+denominations
+they
+are
+not
+all
+alike
+but
+they
+all
+know
+about
+God
+Dr
+What
+church
+did
+you
+go
+to
+Sp
+The
+church
+where
+I
+go
+is
+where
+I
+can
+be
+all
+alone
+I
+do
+not
+go
+there
+very
+often
+I
+can
+belong
+to
+any
+denomination
+When
+you
+are
+on
+the
+water
+you
+can
+t
+go
+to
+church
+you
+go
+to
+service
+Dr
+Which
+church
+did
+you
+like
+best
+Sp
+They
+are
+all
+alike
+It
+s
+just
+a
+matter
+of
+form
+They
+all
+belong
+to
+one
+God
+and
+teach
+a
+hereafter
+a
+Heaven
+and
+a
+hell
+and
+that
+Christ
+died
+for
+our
+sins
+So
+you
+see
+I
+feel
+like
+this
+you
+can
+just
+as
+well
+belong
+to
+one
+as
+another
+They
+all
+praise
+God
+so
+it
+makes
+no
+difference
+Dr
+You
+were
+a
+liberal
+man
+Sp
+I
+don
+t
+know
+that
+I
+was
+that
+either
+I
+don
+t
+know
+what
+kind
+of
+a
+man
+I
+was
+I
+had
+my
+own
+religion
+in
+a
+way
+I
+had
+to
+go
+to
+church
+once
+in
+a
+while
+to
+show
+the
+Captain
+that
+I
+could
+Dr
+What
+ship
+were
+you
+on
+Sp
+I
+was
+on
+all
+kinds
+Dr
+Were
+you
+an
+ordinary
+sailor
+Sp
+I
+was
+in
+the
+Navy
+Dr
+Can
+you
+tell
+us
+what
+year
+it
+is
+Sp
+I
+don
+t
+even
+know
+what
+month
+it
+is
+Dr
+Do
+you
+know
+the
+year
+Sp
+I
+do
+not
+know
+Sp
+Is
+it
+Sp
+No
+That
+s
+not
+the
+year
+Dr
+What
+should
+it
+be
+Sp
+Dr
+Where
+were
+you
+sailing
+Sp
+One
+time
+I
+went
+around
+on
+the
+battleship
+Cincinnati
+Dr
+Where
+did
+you
+go
+Sp
+One
+time
+around
+the
+Coast
+Dr
+Did
+you
+ever
+go
+through
+the
+Panama
+Canal
+Sp
+No
+I
+was
+near
+it
+once
+but
+not
+through
+Dr
+What
+did
+you
+do
+on
+ship
+Sp
+I
+just
+did
+anything
+that
+came
+along
+Dr
+How
+old
+were
+you
+Sp
+I
+can
+t
+seem
+to
+remember
+Dr
+And
+now
+you
+want
+to
+go
+to
+sea
+again
+Sp
+Yes
+I
+don
+t
+want
+to
+be
+on
+land
+because
+I
+don
+t
+feel
+I
+belong
+there
+There
+is
+something
+in
+life
+when
+you
+are
+on
+the
+ocean
+something
+to
+it
+You
+have
+regular
+meals
+and
+no
+worry
+if
+your
+work
+is
+done
+all
+right
+Dr
+Is
+there
+much
+work
+to
+do
+Sp
+Oh
+yes
+lots
+of
+scrubbing
+there
+is
+always
+something
+to
+do
+The
+Captain
+does
+not
+want
+his
+men
+to
+be
+idle
+If
+we
+were
+left
+alone
+we
+would
+have
+a
+good
+time
+If
+there
+is
+nothing
+else
+to
+do
+we
+have
+to
+polish
+all
+the
+time
+I
+know
+something
+about
+it
+We
+have
+to
+polish
+the
+stairways
+the
+machinery
+and
+the
+fixings
+around
+it
+all
+have
+to
+be
+polished
+Every
+day
+we
+polish
+the
+knobs
+the
+machinery
+and
+the
+stairs
+It
+is
+all
+bright
+and
+shining
+It
+s
+a
+big
+ship
+Dr
+Were
+you
+on
+a
+battleship
+Sp
+I
+was
+on
+different
+battleships
+Dr
+Were
+you
+under
+fire
+at
+any
+time
+Sp
+No
+we
+did
+not
+fight
+The
+Cuban
+War
+was
+not
+much
+of
+a
+war
+The
+Philippines
+was
+more
+Dr
+Were
+you
+there
+Sp
+We
+were
+outside
+We
+did
+not
+get
+in
+the
+Bay
+not
+all
+of
+us
+only
+a
+few
+Dewey
+went
+in
+I
+was
+there
+but
+not
+on
+his
+ship
+I
+was
+outside
+cruising
+around
+Some
+had
+to
+be
+on
+guard
+and
+watch
+If
+we
+had
+all
+gone
+in
+we
+would
+have
+been
+trapped
+There
+were
+others
+around
+there
+Dr
+What
+is
+your
+name
+Sp
+My
+name
+It
+has
+been
+so
+long
+since
+I
+heard
+it
+I
+have
+forgotten
+it
+My
+name
+is
+John
+Dr
+John
+what
+Sp
+John
+Edwards
+Dr
+Were
+you
+ever
+on
+the
+Pacific
+Coast
+Sp
+Yes
+we
+were
+around
+there
+one
+time
+I
+was
+more
+on
+the
+Eastern
+Coast
+Dr
+Were
+you
+discharged
+when
+you
+left
+the
+vessel
+Sp
+Slowly
+Left
+the
+vessel
+Dr
+Didn
+t
+you
+leave
+the
+vessel
+Or
+did
+you
+have
+an
+accident
+of
+some
+kind
+Sp
+I
+don
+t
+know
+Dr
+Were
+you
+sick
+Sp
+I
+don
+t
+know
+Dr
+Is
+Manila
+Bay
+the
+last
+you
+remember
+Sp
+No
+that
+s
+a
+long
+time
+ago
+Dr
+Where
+did
+you
+go
+from
+there
+Sp
+I
+was
+quite
+young
+when
+we
+were
+in
+Manila
+Bay
+Dr
+That
+must
+have
+been
+in
+How
+long
+were
+you
+at
+sea
+Sp
+I
+don
+t
+know
+The
+last
+I
+remember
+is
+Dr
+What
+happened
+to
+you
+in
+Were
+you
+sick
+Sp
+I
+seem
+confused
+It
+seems
+to
+me
+that
+we
+were
+I
+do
+not
+remember
+very
+well
+we
+were
+painting
+the
+boat
+I
+do
+not
+know
+what
+place
+it
+was
+I
+can
+t
+think
+In
+some
+way
+we
+were
+not
+in
+the
+Navy
+Yard
+it
+was
+a
+little
+outside
+We
+were
+on
+the
+scaffold
+on
+the
+side
+of
+the
+vessel
+Dr
+Did
+something
+happen
+to
+you
+Sp
+My
+head
+got
+so
+funny
+I
+think
+I
+had
+some
+kind
+of
+a
+vertigo
+spell
+I
+felt
+funny
+It
+seemed
+like
+my
+head
+was
+swimming
+Dr
+Were
+you
+painting
+the
+boat
+Sp
+We
+were
+cleaning
+and
+fixing
+it
+up
+Dr
+Were
+you
+in
+dry
+dock
+Sp
+I
+cannot
+remember
+what
+it
+was
+Something
+happened
+so
+I
+got
+in
+the
+water
+Dr
+You
+probably
+dropped
+off
+the
+scaffold
+Sp
+I
+don
+t
+know
+but
+I
+got
+well
+right
+away
+Dr
+It
+is
+very
+likely
+that
+you
+lost
+your
+body
+at
+that
+time
+and
+became
+a
+spirit
+Sp
+A
+spirit
+What
+do
+you
+mean
+Dr
+I
+mean
+you
+lost
+your
+mortal
+body
+You
+are
+invisible
+to
+us
+Sp
+But
+I
+was
+going
+to
+sea
+I
+felt
+as
+if
+a
+part
+of
+me
+was
+a
+sailor
+but
+I
+also
+felt
+that
+I
+was
+teaching
+some
+sailor
+Through
+obsessing
+C
+B
+I
+could
+smell
+the
+salt
+air
+around
+him
+Sailors
+have
+a
+kind
+of
+atmosphere
+around
+them
+you
+can
+tell
+them
+when
+you
+see
+them
+I
+wanted
+to
+go
+back
+again
+You
+feel
+funny
+when
+you
+are
+on
+land
+You
+feel
+you
+do
+not
+belong
+there
+The
+land
+is
+so
+solid
+you
+do
+not
+feel
+right
+I
+feel
+the
+ocean
+is
+the
+bosom
+of
+a
+mother
+you
+are
+rocked
+to
+sleep
+You
+feel
+so
+fine
+when
+the
+waves
+rock
+you
+to
+sleep
+Dr
+When
+you
+fell
+from
+the
+boat
+you
+probably
+lost
+your
+body
+and
+you
+have
+been
+a
+spirit
+since
+then
+This
+is
+not
+your
+body
+Look
+at
+these
+hands
+Sp
+Noticing
+hands
+of
+psychic
+That
+is
+not
+my
+hand
+Laughing
+No
+I
+should
+say
+not
+I
+had
+big
+big
+hands
+That
+hand
+has
+not
+pulled
+any
+ropes
+That
+s
+funny
+I
+have
+a
+hand
+like
+that
+Laughing
+with
+amusement
+Dr
+And
+you
+have
+a
+dress
+and
+long
+hair
+Are
+those
+the
+feet
+of
+a
+sailor
+Sp
+They
+are
+not
+mine
+Oh
+I
+see
+One
+time
+a
+long
+time
+ago
+you
+know
+we
+used
+to
+go
+to
+one
+town
+then
+another
+I
+was
+not
+on
+the
+battleship
+all
+the
+time
+You
+know
+my
+father
+was
+a
+sea
+Captain
+and
+of
+course
+we
+were
+on
+water
+all
+the
+time
+He
+sailed
+from
+New
+York
+to
+India
+and
+around
+there
+Dr
+On
+a
+sailing
+vessel
+Sp
+Yes
+He
+had
+a
+sailing
+vessel
+first
+when
+I
+was
+just
+a
+little
+kid
+Then
+he
+had
+a
+vessel
+He
+went
+between
+Calcutta
+New
+York
+and
+England
+Dr
+With
+a
+merchant
+vessel
+Sp
+Yes
+He
+had
+a
+lot
+of
+stuff
+Then
+he
+went
+to
+Australia
+one
+time
+he
+dealt
+in
+cotton
+and
+wool
+When
+I
+grew
+up
+I
+felt
+I
+wanted
+to
+be
+in
+the
+employ
+of
+the
+Government
+so
+I
+joined
+the
+Navy
+to
+my
+father
+s
+disgust
+He
+did
+not
+like
+it
+but
+he
+said
+I
+was
+a
+sailor
+born
+I
+think
+I
+was
+born
+on
+the
+water
+I
+do
+not
+know
+the
+land
+My
+mother
+taught
+me
+to
+read
+and
+write
+and
+that
+was
+all
+the
+schooling
+I
+had
+We
+were
+always
+on
+the
+water
+Mother
+was
+a
+pretty
+good
+woman
+Dr
+Did
+your
+mother
+die
+Sp
+My
+mother
+is
+not
+living
+and
+my
+father
+is
+dead
+too
+They
+both
+died
+some
+years
+ago
+But
+this
+was
+not
+what
+I
+was
+going
+to
+talk
+about
+Dr
+You
+were
+talking
+about
+these
+hands
+and
+this
+dress
+Sp
+I
+do
+not
+see
+how
+I
+could
+get
+a
+woman
+s
+hands
+and
+dress
+That
+was
+what
+I
+was
+going
+to
+talk
+about
+when
+I
+drifted
+away
+I
+do
+not
+know
+but
+I
+should
+judge
+I
+was
+about
+eighteen
+or
+nineteen
+when
+we
+were
+in
+Calcutta
+I
+like
+to
+go
+around
+and
+see
+everything
+and
+I
+like
+to
+talk
+I
+drifted
+into
+a
+meeting
+one
+time
+In
+India
+Calcutta
+is
+a
+pretty
+good
+town
+and
+has
+a
+nice
+climate
+I
+drifted
+into
+this
+meeting
+and
+I
+got
+a
+whole
+lot
+of
+books
+They
+called
+this
+meeting
+Theosophy
+They
+were
+nice
+people
+but
+queer
+When
+they
+talk
+before
+you
+know
+it
+you
+believe
+in
+reincarnation
+Is
+this
+skirt
+reincarnation
+You
+said
+I
+am
+dead
+so
+now
+how
+can
+you
+explain
+it
+in
+any
+other
+way
+That
+must
+explain
+it
+because
+I
+am
+back
+as
+a
+woman
+Dr
+You
+might
+call
+this
+reincarnation
+in
+a
+way
+When
+you
+pass
+out
+you
+leave
+your
+mortal
+body
+and
+become
+a
+spirit
+Sp
+You
+know
+they
+go
+to
+Devachan
+and
+that
+is
+a
+long
+way
+off
+Say
+Madam
+Blavatsky
+was
+a
+great
+speaker
+I
+heard
+her
+in
+Calcutta
+Then
+there
+was
+Leadbeater
+I
+was
+only
+a
+kid
+but
+you
+know
+when
+you
+get
+something
+in
+your
+head
+when
+you
+are
+a
+kid
+it
+stays
+there
+My
+father
+said
+John
+don
+t
+you
+believe
+that
+you
+will
+go
+crazy
+I
+said
+It
+is
+better
+than
+nothing
+it
+tells
+good
+things
+That
+salvation
+scheme
+is
+not
+right
+My
+heart
+felt
+so
+big
+when
+I
+said
+that
+It
+swelled
+up
+when
+I
+got
+those
+books
+It
+may
+be
+that
+I
+am
+back
+again
+as
+a
+woman
+I
+didn
+t
+think
+I
+would
+be
+a
+woman
+I
+wanted
+to
+be
+a
+sailor
+again
+Dr
+You
+are
+using
+a
+woman
+s
+body
+only
+temporarily
+Sp
+So
+I
+am
+a
+woman
+temporarily
+Laughing
+Dr
+You
+are
+a
+spirit
+and
+probably
+have
+been
+since
+It
+is
+now
+You
+have
+been
+out
+of
+your
+body
+ten
+years
+Sp
+How
+do
+you
+know
+I
+died
+then
+Dr
+You
+say
+that
+is
+the
+last
+date
+you
+remember
+Sp
+Do
+you
+go
+by
+that
+Then
+I
+have
+been
+in
+Devachan
+Maybe
+sailors
+don
+t
+stay
+in
+Devachan
+so
+long
+maybe
+their
+vibrations
+are
+better
+I
+know
+the
+vibrations
+are
+much
+more
+vibrating
+on
+a
+steamboat
+especially
+when
+there
+are
+storms
+Laughing
+Really
+and
+truly
+have
+I
+reincarnated
+Dr
+It
+is
+likely
+that
+you
+passed
+out
+of
+your
+body
+at
+the
+time
+you
+spoke
+of
+and
+you
+have
+been
+a
+spirit
+but
+were
+not
+aware
+of
+your
+condition
+Sp
+So
+I
+do
+not
+know
+anything
+Dr
+Whatever
+your
+condition
+has
+been
+you
+have
+been
+brought
+here
+tonight
+to
+acquire
+understanding
+We
+are
+investigators
+of
+psychic
+phenomena
+and
+spirit
+obsession
+Sometimes
+spirits
+take
+control
+of
+mortals
+and
+cause
+them
+to
+do
+strange
+things
+You
+have
+been
+attracted
+here
+and
+are
+controlling
+this
+body
+which
+belongs
+to
+my
+wife
+You
+are
+using
+it
+temporarily
+We
+do
+not
+see
+you
+we
+only
+hear
+you
+talk
+Sp
+Then
+in
+reality
+I
+am
+in
+a
+woman
+I
+am
+only
+fooling
+you
+then
+Dr
+My
+wife
+is
+so
+constituted
+that
+spirits
+can
+use
+her
+body
+temporarily
+Have
+you
+ever
+heard
+of
+mediums
+Sp
+Yes
+I
+have
+been
+to
+mediums
+to
+have
+my
+fortune
+told
+You
+know
+they
+are
+only
+controlled
+by
+Indians
+Dr
+Indians
+are
+excellent
+gate
+keepers
+They
+are
+good
+protectors
+for
+mediums
+Sp
+Why
+did
+I
+come
+here
+Dr
+For
+understanding
+You
+have
+evidently
+been
+doing
+mischief
+unconsciously
+You
+are
+in
+Los
+Angeles
+California
+Sp
+I
+know
+I
+was
+in
+San
+Francisco
+once
+I
+have
+not
+been
+there
+for
+a
+long
+time
+It
+was
+in
+Dr
+You
+probably
+made
+a
+young
+man
+leave
+his
+home
+and
+parents
+without
+any
+provocation
+at
+all
+and
+made
+him
+enlist
+as
+a
+sailor
+in
+the
+Navy
+Sp
+He
+had
+no
+business
+to
+do
+that
+Dr
+He
+is
+interested
+in
+other
+work
+He
+seemed
+to
+lose
+himself
+and
+enlisted
+in
+the
+Navy
+He
+is
+San
+Francisco
+now
+There
+is
+evidence
+in
+his
+case
+that
+some
+spirit
+has
+been
+interfering
+with
+him
+and
+I
+surmise
+that
+you
+are
+the
+one
+Sp
+For
+goodness
+sake
+I
+wouldn
+t
+do
+that
+I
+woke
+up
+one
+morning
+and
+I
+felt
+I
+was
+on
+land
+for
+some
+reason
+or
+other
+and
+I
+wanted
+to
+be
+on
+water
+Dr
+You
+were
+drifting
+about
+and
+came
+in
+contact
+with
+this
+young
+man
+who
+is
+sensitive
+to
+spirit
+influence
+He
+had
+been
+studying
+too
+hard
+and
+so
+made
+himself
+sensitive
+You
+got
+into
+his
+magnetic
+aura
+acted
+through
+him
+and
+caused
+him
+to
+do
+things
+he
+did
+not
+want
+to
+do
+Did
+you
+enlist
+very
+recently
+to
+go
+out
+to
+sea
+again
+Sp
+It
+seems
+I
+woke
+up
+early
+one
+morning
+and
+wanted
+to
+go
+back
+to
+the
+water
+I
+felt
+I
+was
+lost
+Dr
+Didn
+t
+you
+realize
+that
+you
+did
+not
+have
+full
+control
+of
+yourself
+Sp
+I
+felt
+queer
+In
+a
+way
+I
+was
+in
+a
+dreamy
+state
+Say
+I
+didn
+t
+mean
+to
+do
+anything
+wrong
+Dr
+We
+understand
+your
+position
+and
+know
+you
+are
+a
+good
+fellow
+We
+don
+t
+blame
+you
+Sp
+Who
+is
+that
+boy
+Dr
+His
+name
+is
+B
+he
+is
+a
+young
+boy
+of
+seventeen
+Sp
+He
+claimed
+he
+was
+twenty
+one
+or
+he
+could
+not
+have
+joined
+Dr
+He
+is
+large
+and
+looks
+older
+than
+he
+is
+We
+concentrated
+for
+him
+and
+I
+suppose
+we
+pulled
+you
+to
+shore
+Sp
+I
+felt
+some
+one
+pull
+me
+and
+then
+I
+felt
+I
+was
+in
+the
+water
+I
+recall
+we
+were
+in
+New
+York
+or
+somewhere
+around
+there
+and
+it
+was
+awfully
+stormy
+and
+icy
+I
+was
+doing
+something
+and
+fell
+in
+the
+water
+There
+was
+ice
+all
+around
+me
+We
+had
+been
+there
+for
+a
+while
+but
+I
+do
+not
+know
+any
+more
+How
+did
+I
+get
+into
+that
+boy
+Dr
+You
+drifted
+into
+his
+aura
+Sp
+Why
+here
+comes
+my
+mother
+I
+haven
+t
+seen
+her
+for
+a
+long
+time
+She
+died
+in
+New
+York
+She
+says
+Oh
+John
+I
+have
+been
+hunting
+for
+you
+for
+so
+long
+I
+didn
+t
+know
+it
+If
+I
+am
+dead
+why
+didn
+t
+I
+go
+to
+her
+Dr
+Many
+fall
+into
+a
+sleep
+and
+remain
+in
+that
+condition
+for
+some
+time
+Sp
+Oh
+I
+was
+in
+Devachan
+That
+is
+where
+I
+was
+sleeping
+to
+reincarnate
+Dr
+Now
+you
+must
+go
+with
+your
+mother
+She
+will
+take
+you
+to
+her
+home
+Sp
+I
+will
+go
+to
+my
+mother
+and
+father
+my
+old
+father
+Dr
+Does
+he
+have
+understanding
+now
+Sp
+Mother
+says
+Yes
+but
+she
+had
+a
+time
+with
+him
+He
+wanted
+to
+see
+the
+Savior
+I
+never
+quite
+believed
+in
+that
+story
+I
+wanted
+to
+find
+out
+about
+it
+but
+never
+did
+I
+think
+Theosophy
+is
+the
+best
+because
+they
+do
+not
+have
+that
+blood
+question
+to
+deal
+with
+I
+don
+t
+believe
+in
+one
+person
+being
+killed
+for
+others
+If
+I
+did
+anything
+wrong
+why
+should
+I
+not
+suffer
+myself
+God
+is
+Love
+and
+He
+never
+wanted
+any
+one
+killed
+to
+save
+another
+Such
+damned
+foolish
+things
+The
+church
+people
+are
+so
+down
+on
+Jews
+and
+yet
+Jesus
+was
+a
+Jew
+Dr
+Now
+you
+must
+go
+with
+your
+father
+and
+mother
+Sp
+I
+ve
+been
+in
+a
+nice
+crowd
+This
+has
+been
+a
+good
+night
+I
+feel
+pretty
+good
+It
+has
+been
+a
+good
+night
+to
+speak
+with
+nice
+people
+and
+spend
+a
+couple
+of
+hours
+having
+a
+good
+time
+You
+say
+you
+cannot
+see
+these
+others
+here
+but
+there
+are
+quite
+a
+few
+Now
+mother
+says
+my
+dear
+little
+mother
+she
+says
+I
+must
+go
+She
+has
+not
+seen
+her
+son
+for
+a
+long
+time
+We
+have
+lots
+to
+talk
+about
+together
+I
+told
+you
+my
+mother
+was
+good
+I
+must
+say
+goodbye
+to
+you
+all
+Trying
+to
+rise
+but
+unable
+to
+do
+so
+Why
+what
+s
+the
+matter
+with
+my
+legs
+I
+cannot
+stand
+on
+them
+Dr
+You
+are
+only
+controlling
+the
+upper
+part
+of
+the
+body
+Sp
+Then
+I
+m
+only
+half
+a
+man
+Laughing
+heartily
+Worse
+and
+worse
+Only
+half
+woman
+half
+sailor
+Now
+I
+must
+go
+with
+my
+dear
+little
+mother
+Dr
+You
+must
+learn
+to
+think
+Sp
+Think
+Have
+I
+not
+been
+thinking
+before
+Laughing
+Excuse
+me
+but
+everything
+seems
+a
+joke
+Dr
+That
+s
+all
+right
+You
+will
+have
+to
+travel
+by
+thinking
+Sp
+Not
+by
+my
+legs
+Will
+I
+not
+need
+my
+legs
+any
+more
+I
+haven
+t
+any
+you
+know
+I
+m
+only
+half
+a
+man
+Dr
+Just
+think
+yourself
+with
+your
+mother
+and
+you
+will
+be
+there
+Sp
+Think
+myself
+with
+my
+mother
+and
+I
+will
+be
+there
+I
+am
+going
+now
+But
+you
+folks
+are
+so
+jolly
+that
+I
+think
+I
+ll
+come
+again
+some
+day
+You
+don
+t
+mind
+if
+I
+come
+do
+you
+By
+the
+way
+will
+you
+please
+tell
+that
+boy
+I
+feel
+sorry
+if
+I
+did
+him
+mischief
+Dr
+Will
+you
+try
+to
+help
+him
+You
+can
+Sp
+I
+can
+How
+Dr
+By
+impressing
+him
+to
+return
+home
+Your
+mother
+will
+explain
+to
+you
+Sp
+My
+mother
+says
+I
+should
+thank
+you
+for
+finding
+me
+But
+she
+found
+her
+son
+in
+a
+woman
+She
+did
+not
+recognize
+me
+in
+a
+woman
+but
+we
+have
+to
+take
+things
+as
+they
+come
+Now
+I
+will
+go
+Good
+Night
+The
+day
+after
+this
+the
+attitude
+of
+C
+B
+changed
+entirely
+He
+then
+wrote
+to
+his
+parents
+urging
+them
+to
+do
+everything
+possible
+to
+secure
+his
+release
+as
+he
+wanted
+to
+come
+home
+and
+continue
+his
+work
+He
+added
+that
+he
+could
+not
+understand
+why
+he
+had
+enlisted
+and
+that
+he
+seemed
+to
+have
+been
+in
+a
+daze
+Since
+the
+young
+man
+had
+enlisted
+as
+being
+of
+age
+while
+in
+reality
+only
+seventeen
+he
+was
+after
+many
+difficulties
+and
+delays
+released
+from
+service
+and
+he
+returned
+to
+his
+home
+once
+more
+his
+normal
+self
+CHAPTER
+IX
+Psychic
+Invalidism
+SPIRITS
+who
+are
+ignorant
+of
+having
+lost
+their
+physical
+bodies
+often
+hold
+firmly
+in
+mind
+the
+thought
+of
+their
+former
+physical
+condition
+and
+continue
+to
+suffer
+pain
+This
+error
+of
+the
+mortal
+mind
+persists
+until
+an
+understanding
+of
+transition
+and
+spiritual
+laws
+is
+reached
+when
+freedom
+from
+ideas
+of
+physical
+limitations
+is
+attained
+When
+spirits
+who
+are
+under
+this
+delusion
+of
+suffering
+and
+disease
+come
+into
+the
+auras
+of
+mortals
+their
+condition
+is
+conveyed
+to
+the
+sensitives
+and
+chronic
+lassitude
+pseudo
+illness
+and
+psychic
+invalidism
+result
+These
+sensitives
+endure
+all
+the
+pain
+of
+the
+spirits
+former
+physical
+condition
+and
+ordinary
+methods
+of
+treatment
+fail
+to
+cure
+for
+the
+only
+permanent
+relief
+is
+found
+through
+the
+dislodgement
+of
+the
+ignorant
+entities
+While
+we
+were
+in
+Chicago
+a
+friend
+of
+ours
+Miss
+F
+W
+a
+companion
+to
+Mrs
+McA
+prominent
+modiste
+in
+the
+city
+asked
+us
+to
+concentrate
+for
+Mrs
+McA
+who
+was
+a
+chronic
+invalid
+The
+latter
+had
+been
+ordered
+by
+her
+physicians
+to
+take
+a
+rest
+cure
+and
+could
+not
+be
+induced
+to
+get
+up
+again
+She
+was
+suffering
+intense
+pains
+in
+the
+head
+and
+was
+subject
+to
+many
+changeable
+moods
+Miss
+F
+W
+and
+Mrs
+McA
+s
+masseuse
+were
+present
+during
+the
+following
+occurrence
+EXPERIENCE
+APRIL
+Spirit
+GRACE
+BRUSTED
+Patient
+MRS
+MCA
+Psychic
+MRS
+WICKLAND
+The
+spirit
+at
+first
+spoke
+with
+great
+difficulty
+complained
+of
+being
+very
+sick
+and
+was
+unable
+to
+sit
+up
+She
+insisted
+that
+she
+was
+too
+sick
+to
+be
+up
+and
+wished
+to
+go
+to
+bed
+When
+asked
+whether
+she
+knew
+any
+one
+in
+the
+room
+she
+at
+once
+recognized
+Mrs
+McA
+s
+masseuse
+and
+demanded
+that
+she
+take
+her
+to
+bed
+inimediately
+wait
+upon
+her
+and
+draw
+down
+the
+shades
+as
+the
+light
+was
+too
+strong
+for
+a
+sick
+person
+For
+origin
+of
+Mrs
+Eddy
+s
+Mortal
+Mind
+teaching
+see
+Chap
+Page
+Spirit
+Mrs
+Eddy
+See
+Chap
+Page
+Spirit
+Harry
+Hayward
+Patient
+Mrs
+McA
+She
+gave
+her
+name
+as
+Grace
+Brusted
+of
+Boston
+said
+she
+was
+a
+Universalist
+and
+that
+the
+year
+was
+She
+had
+been
+sick
+for
+a
+long
+time
+and
+felt
+as
+if
+she
+were
+two
+persons
+at
+times
+herself
+and
+at
+other
+times
+another
+person
+She
+was
+often
+called
+Mrs
+McA
+but
+was
+tired
+of
+answering
+to
+that
+name
+as
+she
+did
+not
+like
+Mrs
+McA
+Recently
+she
+had
+had
+to
+do
+entirely
+too
+much
+work
+having
+had
+to
+give
+orders
+to
+the
+sewing
+girls
+futhermore
+Miss
+F
+W
+would
+have
+to
+do
+things
+in
+her
+way
+or
+be
+discharged
+The
+spirit
+repeated
+again
+that
+she
+was
+tired
+of
+living
+a
+double
+life
+that
+she
+could
+not
+understand
+it
+and
+was
+more
+than
+ready
+to
+die
+The
+way
+of
+progression
+was
+then
+explained
+and
+the
+spirit
+s
+grandmother
+and
+mother
+appeared
+to
+her
+saying
+that
+she
+had
+always
+been
+a
+spoiled
+child
+but
+would
+now
+have
+to
+learn
+to
+serve
+others
+Miss
+F
+W
+and
+the
+masseuse
+said
+that
+Mrs
+McA
+had
+been
+acting
+in
+the
+same
+manner
+as
+this
+spirit
+even
+using
+the
+identical
+language
+and
+they
+later
+reported
+that
+on
+the
+following
+morning
+Mrs
+MCA
+was
+in
+a
+very
+genial
+mood
+remarking
+that
+it
+was
+the
+first
+time
+for
+many
+months
+that
+she
+had
+wakened
+without
+a
+headache
+After
+this
+she
+improved
+rapidly
+left
+her
+bed
+and
+resumed
+her
+usual
+activities
+For
+over
+a
+period
+of
+six
+years
+a
+friend
+of
+ours
+an
+elderly
+gentleman
+eighty
+four
+years
+old
+was
+afflicted
+with
+unaccountable
+pains
+in
+the
+back
+of
+the
+neck
+and
+a
+peculiar
+dizziness
+and
+vertigo
+which
+came
+upon
+him
+with
+increasing
+frequency
+When
+seized
+with
+these
+attacks
+he
+felt
+that
+walls
+and
+buildings
+would
+fall
+and
+crush
+him
+an
+extreme
+nausea
+accompanied
+these
+sensations
+and
+if
+seated
+he
+would
+fall
+forward
+with
+his
+head
+below
+his
+knees
+and
+for
+some
+time
+would
+be
+unable
+to
+straighten
+himself
+without
+help
+Unable
+to
+find
+any
+physical
+cause
+for
+his
+distress
+the
+possibility
+of
+spirit
+interference
+was
+suggested
+and
+we
+concentrated
+for
+him
+at
+our
+psychic
+circle
+A
+spirit
+then
+controlled
+Mrs
+Wickland
+and
+fell
+forward
+with
+head
+between
+the
+knees
+We
+labored
+with
+the
+entity
+for
+some
+time
+until
+he
+was
+finally
+able
+to
+tell
+us
+that
+his
+name
+was
+Jack
+Finch
+that
+he
+was
+about
+sixty
+five
+years
+old
+and
+had
+been
+an
+inmate
+of
+an
+institution
+near
+Madison
+Wisconsin
+He
+said
+that
+when
+he
+was
+quite
+small
+some
+one
+probably
+his
+sister
+had
+been
+carrying
+him
+and
+had
+dropped
+him
+to
+the
+floor
+and
+that
+this
+fall
+had
+broken
+his
+back
+and
+left
+him
+helpless
+As
+he
+grew
+older
+he
+became
+a
+great
+care
+his
+mother
+neglected
+him
+and
+he
+was
+finally
+placed
+in
+an
+institution
+He
+remembered
+he
+had
+been
+in
+a
+cyclone
+at
+one
+time
+and
+that
+something
+had
+struck
+him
+on
+the
+back
+of
+the
+neck
+adding
+still
+further
+to
+his
+misery
+He
+had
+always
+been
+in
+great
+pain
+and
+his
+broken
+back
+and
+injured
+neck
+produced
+dizzy
+spells
+which
+would
+cause
+him
+to
+double
+over
+and
+remain
+in
+a
+cramped
+position
+until
+aid
+was
+given
+When
+this
+dizziness
+came
+upon
+him
+he
+would
+feel
+as
+if
+he
+were
+sliding
+off
+a
+roof
+or
+as
+if
+the
+walls
+were
+crushing
+him
+again
+he
+often
+felt
+as
+if
+the
+bed
+would
+fall
+on
+him
+and
+as
+if
+everything
+were
+spinning
+around
+He
+said
+that
+because
+of
+his
+helpless
+condition
+no
+one
+had
+ever
+cared
+for
+him
+with
+the
+single
+exception
+of
+a
+nurse
+by
+the
+name
+of
+Anasteena
+who
+had
+been
+very
+kind
+to
+him
+at
+the
+institution
+and
+had
+always
+fed
+him
+But
+everything
+is
+changed
+now
+Sometimes
+I
+feel
+like
+a
+small
+man
+and
+sometimes
+like
+a
+woman
+or
+like
+a
+big
+man
+Sensations
+experienced
+when
+influencing
+different
+mortals
+When
+the
+spirit
+was
+brought
+to
+a
+realization
+that
+he
+had
+lost
+his
+mortal
+body
+and
+could
+no
+longer
+have
+any
+physical
+pain
+he
+asked
+If
+I
+have
+lost
+my
+body
+and
+if
+I
+am
+dead
+then
+why
+haven
+t
+I
+seen
+God
+Where
+is
+He
+This
+led
+to
+an
+explanation
+of
+the
+true
+nature
+of
+God
+His
+manifestation
+in
+all
+things
+and
+the
+existence
+of
+the
+spirit
+world
+Being
+told
+to
+look
+about
+to
+see
+whether
+some
+one
+was
+present
+whom
+he
+had
+known
+on
+earth
+he
+said
+Why
+there
+is
+my
+mother
+She
+wants
+me
+to
+go
+with
+her
+to
+her
+home
+she
+says
+she
+will
+take
+care
+of
+me
+now
+She
+says
+I
+never
+knew
+what
+real
+life
+was
+on
+account
+of
+my
+crippled
+body
+but
+that
+I
+will
+commence
+to
+really
+live
+from
+now
+on
+While
+speaking
+he
+saw
+in
+the
+distance
+another
+spirit
+coming
+toward
+him
+and
+he
+exclaimed
+with
+great
+joy
+It
+is
+Anasteena
+Can
+I
+go
+with
+her
+too
+Assured
+that
+he
+could
+go
+with
+his
+mother
+and
+friend
+that
+he
+would
+be
+well
+cared
+for
+and
+would
+begin
+a
+life
+of
+happiness
+he
+said
+fervently
+God
+bless
+you
+and
+was
+then
+taken
+away
+The
+next
+day
+the
+friend
+who
+had
+suffered
+from
+the
+vertigo
+attacks
+found
+himself
+free
+from
+the
+ailment
+and
+said
+he
+had
+so
+much
+surplus
+energy
+that
+he
+felt
+he
+must
+be
+forty
+eight
+instead
+of
+eighty
+four
+Nor
+was
+he
+ever
+subject
+to
+any
+recurrence
+of
+his
+former
+trouble
+Mr
+Z
+from
+the
+neighboring
+town
+of
+Burbank
+who
+had
+suffered
+for
+twenty
+five
+years
+from
+sleeplessness
+and
+an
+intense
+nausea
+without
+having
+been
+able
+to
+obtain
+relief
+was
+brought
+to
+us
+by
+a
+physician
+who
+suspected
+obsession
+in
+the
+case
+During
+the
+consultation
+Mrs
+Wickland
+saw
+the
+spirit
+of
+a
+man
+standing
+behind
+the
+patient
+and
+when
+she
+described
+this
+spirit
+the
+patient
+recognized
+an
+old
+friend
+who
+had
+passed
+out
+a
+number
+of
+years
+before
+After
+an
+electrical
+treatment
+had
+been
+given
+to
+the
+patient
+this
+spirit
+left
+him
+and
+taking
+control
+of
+Mrs
+Wickland
+spoke
+to
+his
+friend
+recalling
+incidents
+of
+their
+former
+acquaintanceship
+Mr
+Z
+had
+at
+one
+time
+been
+engaged
+to
+the
+daughter
+of
+this
+spirit
+but
+for
+religious
+reasons
+the
+engagement
+had
+been
+broken
+The
+two
+men
+had
+however
+continued
+friendly
+relations
+and
+when
+the
+father
+found
+himself
+in
+financial
+straits
+Mr
+Z
+had
+aided
+him
+in
+a
+business
+way
+When
+the
+father
+later
+died
+of
+cancer
+of
+the
+stomach
+he
+was
+attracted
+to
+Mr
+Z
+because
+of
+his
+regard
+for
+him
+becoming
+enclosed
+in
+his
+aura
+he
+was
+unable
+to
+free
+himself
+and
+had
+remained
+with
+him
+for
+twenty
+five
+years
+conveying
+to
+his
+mortal
+friend
+the
+symptoms
+of
+the
+disease
+from
+which
+he
+had
+suffered
+while
+in
+earth
+life
+After
+receiving
+an
+explanation
+of
+the
+laws
+of
+the
+higher
+life
+he
+left
+repentantly
+and
+Mr
+Z
+was
+no
+longer
+troubled
+with
+the
+nausa
+condition
+An
+unusual
+type
+of
+psychic
+invalidism
+due
+to
+spirit
+influence
+was
+the
+case
+of
+Mrs
+G
+who
+had
+for
+many
+years
+suffered
+in
+tensely
+from
+a
+peculiar
+spinal
+affliction
+which
+baffled
+all
+skill
+of
+physicians
+After
+Mrs
+G
+had
+been
+under
+our
+care
+for
+some
+time
+a
+spirit
+who
+had
+died
+of
+a
+broken
+back
+and
+neck
+was
+removed
+and
+controlled
+Mrs
+Wickland
+The
+guiding
+intelligences
+explained
+that
+he
+had
+drifted
+into
+the
+aura
+of
+the
+patient
+when
+she
+was
+a
+child
+and
+had
+become
+enmeshed
+in
+her
+nervous
+system
+thus
+transferring
+to
+his
+victim
+the
+physical
+condition
+under
+which
+he
+had
+died
+and
+which
+he
+still
+believed
+himself
+to
+be
+suffering
+from
+With
+the
+removal
+of
+the
+spirit
+the
+patient
+was
+promptly
+relieved
+and
+suffered
+no
+more
+pain
+in
+the
+back
+EXPERIENCE
+JULY
+Spirit
+JAmEs
+HOXEN
+Patient
+MRs
+G
+Psychic
+MRS
+WICKLAND
+The
+controlling
+spirit
+seemed
+to
+be
+paralyzed
+with
+head
+hanging
+toward
+the
+shoulder
+At
+first
+unable
+to
+speak
+he
+pointed
+to
+the
+neck
+and
+moaned
+continually
+as
+if
+in
+great
+pain
+At
+these
+indications
+both
+Mr
+and
+Mrs
+G
+who
+were
+in
+the
+circle
+became
+intensely
+interested
+Doctor
+Overcome
+your
+old
+habits
+friend
+forget
+your
+pain
+Manipulating
+hands
+and
+arms
+See
+your
+arms
+are
+not
+stiff
+now
+Straighten
+up
+you
+are
+not
+paralyzed
+We
+are
+going
+to
+help
+you
+Understand
+that
+you
+have
+lost
+your
+old
+body
+You
+are
+a
+spirit
+and
+must
+not
+hover
+around
+the
+earth
+plane
+causing
+trouble
+Talk
+and
+tell
+us
+who
+you
+are
+Where
+did
+you
+come
+from
+Spirit
+Oh
+Making
+frantic
+efforts
+to
+reach
+Mrs
+G
+stretching
+forth
+both
+hands
+to
+her
+imploringly
+Mrs
+G
+No
+you
+cannot
+come
+back
+here
+I
+do
+not
+want
+you
+Sp
+Oh
+Beginning
+to
+cry
+and
+making
+another
+effort
+to
+reach
+Mrs
+G
+Dr
+You
+cannot
+be
+selfish
+any
+longer
+You
+must
+listen
+to
+intelligent
+spirits
+who
+will
+help
+you
+You
+can
+only
+find
+happi
+ness
+by
+forgetting
+your
+present
+condition
+Intelligent
+spirits
+will
+take
+you
+to
+the
+spirit
+world
+Moaning
+and
+crying
+will
+not
+help
+you
+Mrs
+G
+The
+gentleman
+who
+is
+speaking
+to
+you
+is
+a
+doctor
+and
+he
+will
+help
+you
+Dr
+Try
+to
+talk
+Sp
+I
+don
+t
+want
+any
+more
+fire
+Electric
+treatments
+given
+patient
+Dr
+You
+surely
+will
+have
+more
+if
+you
+stay
+around
+here
+Sp
+I
+don
+t
+want
+any
+more
+Struggling
+Oh
+that
+fire
+Dr
+Listen
+to
+me
+Something
+must
+have
+happened
+to
+you
+a
+long
+time
+ago
+Can
+you
+remember
+what
+occurred
+Mrs
+G
+Answer
+the
+doctor
+Dr
+Understand
+your
+true
+condition
+You
+died
+probably
+a
+long
+time
+ago
+Sp
+Oh
+My
+back
+my
+back
+Dr
+What
+is
+the
+matter
+with
+your
+back
+Sp
+It
+s
+broken
+Dr
+What
+happened
+to
+you
+Sp
+I
+fell
+off
+a
+horse
+Dr
+Where
+did
+you
+live
+Sp
+I
+can
+t
+tell
+just
+now
+I
+thought
+I
+was
+dead
+in
+a
+way
+but
+I
+don
+t
+feel
+like
+dying
+now
+My
+back
+and
+head
+and
+neck
+are
+all
+gone
+to
+pieces
+My
+head
+is
+going
+off
+my
+spine
+The
+patient
+had
+continually
+suffered
+from
+a
+sensation
+of
+the
+head
+being
+dislocated
+from
+the
+spine
+Dr
+When
+did
+the
+accident
+happen
+Sp
+I
+don
+t
+know
+I
+struck
+right
+here
+Left
+side
+of
+neck
+Dr
+Forget
+that
+condition
+you
+do
+not
+need
+to
+have
+that
+sensation
+now
+This
+body
+which
+you
+are
+controlling
+is
+all
+right
+Do
+you
+know
+you
+are
+invisible
+to
+us
+Sp
+I
+don
+t
+want
+any
+more
+fire
+It
+strikes
+my
+neck
+too
+hard
+Dr
+That
+was
+necessary
+to
+get
+you
+out
+Why
+did
+you
+influence
+that
+lady
+and
+bother
+her
+Sp
+My
+neck
+my
+neck
+and
+my
+head
+They
+ache
+so
+I
+can
+t
+stand
+it
+any
+longer
+Dr
+How
+long
+have
+you
+been
+troubled
+this
+way
+Sp
+Many
+years
+a
+long
+long
+time
+Mrs
+G
+Were
+you
+grown
+up
+or
+little
+when
+you
+fell
+off
+the
+horse
+Are
+you
+a
+boy
+or
+a
+girl
+Sp
+I
+am
+a
+boy
+I
+broke
+my
+neck
+a
+long
+time
+ago
+but
+it
+hurts
+yet
+Mrs
+G
+Where
+did
+this
+happen
+Was
+it
+in
+California
+Sp
+No
+far
+far
+away
+I
+don
+t
+know
+where
+Dr
+Think
+back
+and
+your
+memory
+will
+return
+Mr
+G
+Was
+it
+Illinois
+or
+Iowa
+Sp
+I
+have
+been
+asleep
+and
+you
+ll
+have
+to
+wait
+a
+minute
+My
+head
+aches
+so
+and
+my
+neck
+My
+neck
+is
+broken
+My
+head
+has
+gone
+from
+my
+spine
+Mr
+G
+You
+no
+longer
+have
+a
+physical
+head
+Sp
+But
+the
+fire
+gets
+on
+top
+of
+it
+Mrs
+G
+That
+is
+good
+for
+you
+it
+will
+help
+you
+Sp
+It
+s
+fire
+fire
+Mrs
+G
+Your
+neck
+does
+not
+hurt
+you
+at
+all
+now
+Sp
+Yes
+it
+does
+Dr
+No
+it
+does
+not
+Sp
+I
+got
+paralyzed
+My
+spine
+I
+can
+t
+move
+and
+oh
+my
+neck
+I
+can
+t
+move
+My
+neck
+is
+broken
+Dr
+Can
+t
+you
+understand
+that
+your
+broken
+neck
+went
+to
+the
+grave
+Your
+physical
+body
+is
+gone
+This
+body
+is
+all
+right
+but
+you
+will
+use
+it
+for
+only
+a
+little
+while
+Sp
+You
+don
+t
+know
+how
+everything
+hurts
+Dr
+Because
+you
+hold
+that
+idea
+in
+your
+mind
+How
+could
+your
+body
+hurt
+you
+now
+when
+it
+is
+in
+the
+grave
+Sp
+How
+do
+you
+know
+it
+is
+Dr
+This
+is
+not
+your
+body
+Sp
+How
+do
+you
+know
+my
+body
+is
+in
+the
+grave
+Dr
+Because
+you
+yourself
+are
+here
+This
+body
+you
+are
+talking
+through
+is
+not
+yours
+Sp
+How
+do
+you
+know
+Dr
+You
+do
+not
+want
+to
+understand
+You
+are
+a
+selfish
+spirit
+You
+know
+that
+is
+true
+Sp
+I
+have
+been
+to
+church
+and
+I
+know
+about
+Jesus
+Christ
+Mrs
+G
+To
+what
+church
+did
+you
+go
+Sp
+To
+the
+Mennonite
+Church
+Mrs
+G
+had
+grown
+up
+among
+the
+Mennonites
+Mrs
+G
+Where
+was
+that
+Sp
+In
+Kansas
+a
+long
+time
+ago
+Mrs
+G
+had
+lived
+in
+Kansas
+for
+some
+years
+Mr
+G
+In
+what
+town
+Sp
+N
+Mr
+G
+What
+is
+your
+name
+Sp
+I
+lost
+it
+My
+neck
+is
+so
+bad
+Mr
+G
+Did
+you
+live
+in
+town
+Sp
+No
+on
+a
+farm
+about
+a
+mile
+north
+of
+the
+College
+Mr
+G
+What
+is
+your
+name
+Sp
+I
+had
+a
+name
+but
+it
+is
+such
+a
+long
+time
+since
+I
+heard
+it
+Mr
+G
+How
+did
+you
+happen
+to
+fall
+from
+the
+horse
+Sp
+We
+were
+going
+up
+the
+hill
+and
+my
+horse
+got
+scared
+of
+some
+rabbits
+Then
+he
+went
+off
+quick
+I
+did
+not
+get
+hold
+of
+the
+reins
+quick
+enough
+Mr
+G
+You
+were
+not
+a
+good
+rider
+Sp
+I
+had
+no
+saddle
+How
+could
+I
+stick
+on
+Mr
+G
+Evidently
+it
+was
+not
+a
+gentleman
+s
+saddle
+horse
+Sp
+I
+was
+only
+a
+hired
+man
+Mr
+G
+How
+old
+were
+you
+Sp
+I
+was
+about
+sixteen
+or
+seventeen
+I
+think
+Mr
+G
+What
+did
+your
+mother
+call
+you
+Sp
+I
+don
+t
+know
+Dr
+Did
+she
+call
+you
+Mabel
+Sp
+They
+never
+call
+a
+boy
+that
+My
+shoulder
+and
+back
+are
+broken
+My
+neck
+has
+been
+broken
+for
+years
+and
+years
+Dr
+Will
+you
+understand
+that
+you
+have
+lost
+your
+body
+What
+is
+your
+name
+Sp
+My
+name
+is
+James
+Dr
+Was
+that
+all
+they
+called
+you
+Is
+this
+your
+hand
+Indicating
+hand
+of
+the
+psychic
+Sp
+No
+Jimmie
+never
+had
+a
+ring
+Dr
+You
+are
+using
+this
+hand
+temporarily
+it
+does
+not
+belong
+to
+you
+It
+belongs
+to
+my
+wife
+Sp
+I
+have
+seen
+that
+my
+hands
+have
+been
+small
+for
+a
+long
+time
+My
+name
+is
+James
+Hoxen
+Dr
+You
+may
+have
+lost
+your
+body
+after
+that
+accident
+Sp
+My
+head
+will
+drop
+off
+Dr
+Then
+we
+will
+have
+to
+pick
+it
+up
+You
+are
+an
+ignorant
+spirit
+and
+have
+been
+bothering
+that
+lady
+Sp
+What
+is
+a
+spirit
+Dr
+That
+is
+what
+I
+am
+talking
+to
+Sp
+This
+is
+James
+Dr
+I
+see
+my
+wife
+when
+I
+look
+at
+this
+body
+Ask
+any
+of
+these
+people
+whose
+body
+you
+are
+speaking
+through
+Sp
+Then
+I
+belong
+to
+some
+one
+else
+Dr
+To
+whom
+Sp
+Stretching
+his
+arms
+toward
+Mrs
+G
+I
+want
+to
+come
+back
+to
+you
+I
+like
+you
+Mrs
+G
+You
+will
+never
+come
+back
+to
+me
+any
+more
+You
+will
+have
+to
+go
+to
+the
+spirit
+world
+Sp
+Where
+is
+that
+Dr
+It
+is
+the
+invisible
+world
+around
+the
+earth
+plane
+Sp
+Affectedly
+I
+want
+to
+see
+Jesus
+Christ
+Dr
+Why
+do
+you
+whine
+Sp
+That
+is
+my
+way
+to
+talk
+Will
+you
+cure
+my
+neck
+Dr
+Yes
+by
+making
+you
+understand
+your
+true
+condition
+As
+an
+ignorant
+spirit
+you
+have
+been
+bothering
+a
+lady
+By
+using
+the
+fire
+as
+you
+call
+it
+we
+drove
+you
+away
+You
+are
+temporarily
+controlling
+my
+wife
+s
+body
+You
+have
+lost
+your
+physical
+body
+and
+you
+must
+obtain
+understanding
+of
+the
+invisible
+side
+of
+life
+where
+you
+are
+now
+Mr
+G
+Do
+you
+know
+my
+name
+Did
+you
+know
+any
+one
+by
+the
+name
+of
+G
+Sp
+They
+lived
+far
+away
+Mr
+G
+Did
+you
+know
+anybody
+by
+the
+name
+of
+K
+Mrs
+G
+s
+maiden
+name
+Sp
+They
+were
+in
+another
+town
+Mr
+G
+Were
+you
+born
+in
+the
+place
+where
+you
+had
+the
+accident
+Sp
+I
+was
+born
+far
+out
+in
+the
+country
+Mrs
+G
+What
+year
+do
+think
+it
+is
+Sp
+I
+don
+t
+know
+Dr
+Who
+is
+the
+President
+Sp
+I
+never
+read
+very
+much
+about
+things
+I
+lived
+on
+a
+farm
+and
+did
+the
+chores
+That
+was
+long
+ago
+For
+a
+while
+there
+has
+been
+so
+much
+fire
+Dr
+I
+gave
+you
+that
+fire
+it
+is
+electricity
+Sp
+I
+saw
+fire
+it
+is
+not
+electricity
+You
+hold
+electricity
+in
+your
+hand
+and
+it
+jerks
+Dr
+I
+caused
+that
+fire
+Sp
+You
+Shame
+on
+you
+Shame
+on
+you
+You
+To
+do
+that
+to
+an
+innocent
+little
+fellow
+like
+me
+Shame
+on
+you
+Dr
+You
+have
+been
+bothering
+that
+lady
+for
+a
+long
+time
+and
+she
+could
+not
+live
+her
+own
+free
+life
+I
+put
+the
+fire
+on
+you
+and
+you
+left
+Look
+around
+and
+you
+will
+see
+intelligent
+spirits
+here
+who
+will
+help
+you
+Sp
+There
+s
+a
+lot
+of
+people
+here
+Suddenly
+becoming
+greatly
+excited
+and
+beginning
+to
+cry
+Mother
+Oh
+Oh
+Mother
+Dr
+She
+has
+come
+to
+help
+you
+Sp
+Oh
+Mother
+why
+did
+you
+die
+I
+was
+only
+a
+little
+boy
+and
+when
+you
+died
+everything
+was
+broken
+up
+and
+I
+had
+to
+earn
+my
+own
+living
+Dr
+What
+does
+your
+mother
+say
+Sp
+She
+says
+Oh
+Jimmie
+where
+have
+you
+been
+She
+has
+been
+looking
+for
+me
+but
+could
+not
+find
+me
+Dr
+That
+is
+because
+you
+have
+been
+with
+that
+lady
+making
+a
+great
+deal
+of
+trouble
+Now
+you
+can
+go
+with
+your
+mother
+Sp
+It
+s
+a
+long
+time
+since
+I
+saw
+my
+mother
+Dr
+It
+is
+now
+Sp
+No
+Dr
+It
+is
+the
+fourth
+of
+July
+and
+you
+are
+in
+Los
+Angeles
+California
+Sp
+No
+it
+must
+be
+Dr
+That
+was
+thirty
+years
+ago
+Sp
+But
+I
+was
+living
+in
+after
+the
+accident
+I
+was
+crippled
+for
+years
+The
+last
+I
+remember
+it
+was
+Dr
+That
+was
+twenty
+seven
+year
+ago
+Sp
+How
+can
+all
+those
+years
+be
+gone
+Have
+I
+been
+sleeping
+Dr
+Only
+partially
+You
+have
+been
+bothering
+people
+Sp
+I
+have
+been
+kept
+shut
+up
+for
+years
+and
+years
+In
+aura
+of
+patient
+I
+thought
+I
+was
+going
+to
+die
+once
+but
+after
+I
+had
+been
+shut
+up
+for
+a
+while
+I
+felt
+different
+I
+had
+lady
+s
+clothes
+on
+and
+I
+felt
+like
+a
+woman
+but
+my
+neck
+bothered
+me
+so
+and
+my
+head
+was
+like
+it
+came
+off
+my
+spine
+Dr
+You
+got
+into
+that
+lady
+s
+magnetic
+aura
+and
+bothered
+her
+When
+you
+lost
+your
+body
+you
+still
+had
+the
+idea
+that
+your
+neck
+was
+broken
+but
+your
+body
+went
+to
+the
+grave
+Sp
+But
+I
+had
+a
+neck
+that
+always
+hurt
+Dr
+You
+held
+the
+idea
+in
+your
+mind
+that
+you
+still
+had
+a
+broken
+neck
+As
+a
+man
+thinketh
+in
+his
+heart
+so
+is
+he
+Your
+mind
+was
+on
+your
+broken
+neck
+and
+you
+did
+not
+realize
+that
+a
+change
+had
+occurred
+This
+body
+which
+belongs
+to
+my
+wife
+has
+no
+broken
+neck
+Sp
+Your
+wife
+Where
+is
+she
+Dr
+Sleeping
+Look
+at
+your
+feet
+they
+are
+not
+really
+yours
+Sp
+Am
+I
+a
+woman
+Dr
+Only
+temporarily
+Now
+you
+must
+go
+with
+your
+mother
+Sp
+Mother
+will
+you
+take
+me
+with
+you
+Dr
+What
+does
+she
+say
+Sp
+She
+says
+yes
+but
+I
+must
+ask
+that
+lady
+to
+forgive
+me
+But
+I
+could
+not
+help
+it
+I
+could
+not
+get
+out
+I
+was
+shut
+up
+such
+a
+long
+time
+and
+I
+m
+tired
+Now
+I
+will
+go
+with
+my
+mother
+Oh
+Mother
+come
+and
+take
+me
+I
+will
+be
+a
+good
+boy
+Dr
+Now
+you
+will
+find
+understanding
+Sp
+I
+feel
+I
+am
+dying
+My
+head
+is
+off
+again
+Dr
+That
+is
+only
+a
+temporary
+sensation
+When
+you
+leave
+you
+may
+feel
+as
+if
+you
+were
+dying
+but
+that
+is
+only
+because
+you
+are
+losing
+control
+You
+could
+not
+die
+if
+you
+tried
+Nobody
+ever
+really
+dies
+Spirit
+never
+dies
+Sp
+Will
+I
+have
+a
+better
+body
+Dr
+Yes
+Now
+forget
+your
+broken
+neck
+and
+your
+pain
+Sp
+I
+am
+going
+with
+my
+mother
+Please
+forgive
+me
+lady
+Mrs
+G
+That
+s
+all
+right
+James
+Forget
+the
+past
+Dr
+Intelligent
+spirits
+will
+help
+you
+and
+will
+teach
+you
+won
+derful
+things
+Think
+yourself
+with
+your
+mother
+and
+with
+the
+Mercy
+Band
+of
+spirits
+Goodbye
+Sp
+Goodbye
+In
+the
+summer
+of
+a
+gentleman
+Mr
+I
+consulted
+us
+about
+his
+wife
+who
+for
+nine
+months
+had
+been
+confined
+to
+her
+bed
+suffering
+from
+intense
+pain
+in
+the
+head
+diagnosed
+by
+others
+as
+due
+to
+brain
+tumor
+and
+from
+a
+seemingly
+paralyzed
+condition
+of
+one
+arm
+which
+was
+helpless
+We
+made
+several
+calls
+at
+the
+home
+of
+the
+invalid
+giving
+electrical
+treatments
+which
+strengthened
+the
+patient
+but
+Mrs
+Wickland
+clairvoyantly
+saw
+the
+spirit
+of
+a
+man
+with
+a
+ghastly
+head
+wound
+and
+a
+woman
+with
+a
+crippled
+arm
+hovering
+about
+At
+our
+next
+concentration
+circle
+the
+spirit
+of
+this
+man
+controlled
+Mrs
+Wickland
+and
+we
+learned
+that
+in
+life
+he
+had
+been
+a
+house
+painter
+who
+had
+fallen
+from
+a
+scaffold
+and
+as
+he
+said
+split
+open
+his
+head
+He
+did
+not
+know
+that
+he
+had
+died
+and
+declared
+that
+he
+was
+suffering
+from
+agonizing
+pains
+in
+the
+head
+but
+that
+lately
+he
+had
+a
+very
+comfortable
+bed
+to
+rest
+in
+Convinced
+of
+his
+true
+condition
+he
+was
+taken
+away
+and
+from
+that
+time
+Mrs
+I
+had
+no
+further
+pain
+in
+the
+head
+She
+still
+remained
+in
+bed
+however
+feeling
+weak
+and
+suffer
+ing
+with
+the
+paralyzed
+arm
+After
+another
+treatment
+we
+re
+turned
+to
+our
+home
+inviting
+Mr
+I
+to
+attend
+our
+concentration
+circle
+that
+evening
+When
+he
+came
+he
+said
+that
+after
+our
+departure
+his
+wife
+felt
+so
+much
+better
+that
+she
+had
+risen
+and
+for
+the
+first
+time
+in
+nine
+months
+spent
+the
+day
+out
+of
+bed
+The
+events
+of
+the
+evening
+therefore
+were
+of
+great
+interest
+to
+the
+gentleman
+as
+the
+controlling
+spirit
+complained
+of
+pains
+corresponding
+exactly
+with
+those
+endured
+by
+his
+wife
+EXPERIENCE
+JULY
+Spirit
+MRS
+Lizzy
+Davidson
+Patient
+MRS
+I
+Psychic
+MRS
+WICKLAND
+The
+spirit
+held
+one
+arm
+pressed
+tightly
+to
+the
+body
+moaning
+incessantly
+Doctor
+Good
+evening
+Have
+we
+some
+one
+here
+who
+it
+sick
+Is
+this
+one
+who
+has
+passed
+out
+with
+some
+sickness
+and
+still
+holds
+the
+trouble
+in
+his
+mind
+What
+is
+the
+matter
+Spirit
+Groaning
+My
+arm
+Oh
+my
+arm
+Dr
+What
+is
+the
+matter
+with
+it
+Sp
+It
+hurts
+me
+Dr
+What
+happened
+to
+it
+Sp
+Where
+s
+my
+bed
+I
+m
+sick
+Dr
+Are
+you
+sleepy
+Sp
+I
+m
+sick
+in
+bed
+I
+ought
+to
+be
+in
+bed
+Dr
+Haven
+t
+you
+been
+in
+bed
+long
+enough
+Sp
+I
+m
+awfully
+sick
+Dr
+How
+many
+years
+have
+you
+been
+sick
+Sp
+A
+long
+long
+time
+Dr
+How
+long
+is
+it
+since
+you
+died
+Sp
+Died
+I
+m
+sick
+I
+said
+I
+am
+not
+dead
+I
+said
+sick
+you
+do
+not
+know
+about
+me
+I
+am
+so
+sick
+Dr
+I
+realize
+that
+you
+are
+sick
+in
+your
+mind
+Otherwise
+you
+are
+not
+sick
+Sp
+Oh
+Oh
+I
+m
+a
+very
+sick
+woman
+Don
+t
+touch
+me
+My
+arm
+My
+arm
+Dr
+Was
+it
+hurt
+Sp
+Why
+did
+you
+take
+me
+away
+when
+I
+was
+so
+comfortable
+in
+bed
+Oh
+that
+nice
+comfortable
+bed
+To
+Mr
+I
+He
+Dr
+W
+took
+me
+away
+just
+when
+I
+was
+going
+to
+lie
+down
+and
+sleep
+Mr
+I
+I
+am
+very
+glad
+to
+see
+you
+here
+Sp
+He
+took
+me
+along
+with
+him
+and
+I
+wanted
+to
+sleep
+I
+am
+a
+very
+sick
+woman
+Dr
+We
+are
+going
+to
+cure
+your
+arm
+Sp
+Oh
+I
+want
+to
+be
+in
+that
+bed
+It
+s
+so
+nice
+and
+comfortable
+It
+s
+such
+a
+nice
+bed
+and
+there
+is
+such
+a
+nice
+gentleman
+to
+wait
+on
+me
+Dr
+You
+will
+never
+be
+in
+that
+bed
+again
+Sp
+I
+am
+a
+very
+sick
+woman
+You
+had
+better
+call
+a
+doctor
+Mr
+G
+That
+gentleman
+is
+a
+doctor
+Dr
+How
+long
+have
+you
+been
+sick
+Sp
+Recognizing
+Dr
+W
+Why
+you
+are
+the
+one
+who
+gave
+me
+those
+sparks
+Take
+me
+away
+from
+him
+Mr
+G
+That
+was
+an
+electrical
+treatment
+Sp
+He
+told
+me
+I
+should
+go
+with
+him
+He
+said
+Any
+one
+who
+is
+around
+this
+lady
+must
+come
+with
+me
+so
+I
+went
+with
+him
+Why
+did
+you
+tell
+me
+to
+come
+with
+you
+and
+then
+hold
+me
+like
+this
+To
+Mr
+I
+Can
+t
+you
+do
+something
+to
+protect
+me
+Mr
+I
+This
+is
+a
+good
+place
+for
+you
+Sp
+You
+think
+so
+Why
+did
+you
+let
+this
+man
+bring
+me
+here
+Mr
+G
+He
+did
+not
+want
+you
+to
+make
+an
+invalid
+of
+his
+wife
+Sp
+Can
+t
+you
+tell
+this
+man
+to
+leave
+me
+alone
+To
+Mr
+I
+Mr
+I
+No
+I
+think
+you
+are
+in
+good
+hands
+Sp
+No
+No
+No
+I
+don
+t
+want
+to
+stay
+here
+Stamping
+feet
+furiously
+Dr
+Do
+you
+want
+to
+hover
+around
+this
+gentleman
+s
+wife
+and
+ruin
+her
+life
+Sp
+He
+can
+take
+care
+of
+us
+so
+nicely
+I
+like
+him
+and
+I
+want
+to
+stay
+there
+Angrily
+stamping
+feet
+Mr
+I
+They
+will
+take
+good
+care
+of
+you
+here
+Dr
+You
+are
+not
+sick
+but
+you
+have
+a
+bad
+temper
+Sp
+I
+am
+sick
+with
+my
+arm
+Dr
+Only
+in
+your
+mind
+Sp
+Can
+t
+I
+go
+back
+to
+that
+bed
+To
+Mr
+I
+You
+are
+such
+a
+nice
+nurse
+Dr
+You
+have
+been
+bothering
+his
+wife
+hovering
+around
+her
+That
+gentleman
+is
+taking
+care
+of
+his
+wife
+and
+incidentally
+has
+been
+taking
+care
+of
+you
+You
+are
+a
+spirit
+He
+doesn
+t
+want
+you
+there
+any
+more
+SP
+Coaxingly
+to
+Mr
+I
+Don
+t
+you
+want
+to
+take
+care
+of
+me
+again
+Mr
+I
+No
+Sp
+You
+mean
+thing
+you
+Crying
+Dr
+You
+must
+obtain
+understanding
+Are
+you
+a
+cry
+baby
+Sp
+No
+I
+am
+not
+a
+cry
+baby
+Stamping
+feet
+again
+Dr
+Then
+it
+is
+just
+temper
+Now
+behave
+and
+understand
+that
+you
+have
+lost
+your
+mortal
+body
+Sp
+I
+have
+not
+lost
+my
+body
+Dr
+You
+have
+lost
+your
+physical
+body
+that
+is
+in
+the
+grave
+Sp
+I
+am
+not
+in
+the
+grave
+Dr
+But
+your
+body
+is
+Sp
+My
+body
+is
+myself
+No
+I
+am
+not
+in
+the
+grave
+this
+is
+my
+body
+Dr
+Look
+at
+your
+hands
+they
+are
+not
+yours
+Sp
+Where
+did
+I
+get
+these
+rings
+I
+had
+more
+stones
+in
+mine
+didn
+t
+I
+To
+Mr
+I
+Mr
+I
+My
+wife
+had
+Sp
+You
+gave
+me
+a
+nice
+ring
+Mr
+I
+No
+I
+did
+not
+I
+gave
+it
+to
+my
+wife
+Sp
+Yes
+you
+did
+Mr
+I
+No
+I
+did
+not
+Dr
+You
+are
+a
+selfish
+earthbound
+spirit
+Sp
+Spirit
+I
+m
+no
+spirit
+I
+am
+a
+good
+woman
+a
+good
+religious
+womant
+I
+love
+Jesus
+Dr
+Then
+why
+are
+you
+not
+with
+him
+You
+have
+evidently
+been
+dead
+a
+long
+time
+Sp
+I
+say
+I
+am
+not
+dead
+Oh
+My
+arm
+my
+arm
+Mr
+G
+You
+forgot
+that
+you
+had
+a
+crippled
+arm
+You
+have
+been
+moving
+it
+about
+Sp
+Yes
+I
+forgot
+but
+I
+know
+where
+my
+pains
+are
+Stamping
+feet
+Dr
+When
+you
+have
+a
+temper
+you
+forget
+your
+pains
+Sp
+You
+do
+not
+I
+have
+pains
+just
+the
+same
+Don
+t
+you
+know
+that
+Dr
+I
+know
+you
+have
+a
+temper
+Sp
+I
+am
+a
+good
+Christian
+lady
+I
+love
+Jesus
+with
+all
+my
+heart
+and
+all
+my
+soul
+He
+is
+my
+Savior
+Mr
+G
+To
+save
+you
+from
+what
+Sp
+From
+sin
+Dr
+Then
+you
+cannot
+be
+so
+very
+good
+if
+you
+have
+sins
+Sp
+Is
+that
+so
+Say
+are
+we
+in
+church
+Look
+at
+all
+the
+people
+Did
+you
+take
+me
+to
+church
+Dr
+This
+is
+a
+place
+where
+we
+release
+earthbound
+spirits
+Sp
+Earthbound
+spirits
+What
+are
+you
+talking
+about
+Will
+you
+pray
+and
+sing
+Jesus
+Lover
+of
+my
+Soul
+Dr
+No
+we
+will
+not
+Where
+did
+you
+come
+from
+Sp
+I
+get
+so
+mad
+when
+I
+think
+of
+that
+bed
+Why
+did
+you
+take
+me
+away
+from
+that
+nice
+bed
+I
+feel
+so
+sad
+My
+back
+and
+my
+arm
+hurt
+me
+so
+much
+My
+arm
+is
+paralyzed
+I
+was
+shot
+in
+my
+arm
+Dr
+Who
+shot
+you
+Sp
+Ask
+them
+Dr
+Did
+they
+use
+a
+hypodermic
+Sp
+Yes
+that
+s
+what
+I
+mean
+I
+would
+like
+to
+have
+one
+more
+shot
+Will
+you
+give
+me
+just
+a
+little
+Oh
+please
+just
+a
+little
+bit
+Give
+me
+just
+a
+little
+shot
+in
+the
+arm
+Dr
+Were
+you
+a
+drug
+addict
+Sp
+I
+was
+sick
+such
+a
+long
+time
+and
+I
+couldn
+t
+sleep
+so
+they
+put
+something
+in
+my
+arm
+They
+put
+it
+in
+so
+many
+times
+that
+my
+arm
+got
+sore
+then
+it
+seemed
+to
+be
+paralyzed
+They
+put
+in
+too
+much
+Dr
+Well
+now
+we
+must
+hurry
+it
+is
+getting
+late
+Sp
+What
+s
+the
+hurry
+Where
+are
+you
+going
+out
+Dr
+We
+are
+going
+to
+help
+you
+understand
+your
+condition
+You
+have
+lost
+your
+mortal
+body
+and
+are
+a
+spirit
+This
+is
+not
+your
+body
+Sp
+Is
+that
+so
+You
+only
+think
+so
+Dr
+This
+is
+not
+your
+body
+at
+all
+you
+are
+only
+borrowing
+it
+temporarily
+Sp
+How
+do
+you
+know
+Dr
+This
+is
+my
+wife
+s
+body
+Sp
+I
+never
+married
+you
+Dr
+I
+did
+not
+say
+that
+SP
+You
+said
+I
+was
+your
+wife
+Yes
+you
+did
+I
+heard
+it
+myself
+Dr
+I
+said
+you
+were
+talking
+through
+my
+wife
+s
+body
+Sp
+Have
+you
+ever
+heard
+of
+any
+one
+talking
+through
+another
+person
+s
+body
+Dr
+Tell
+us
+who
+you
+are
+Sp
+Hold
+my
+hand
+not
+my
+arm
+Dr
+We
+will
+treat
+your
+arm
+then
+it
+will
+be
+well
+Manipulating
+arm
+Sp
+Oh
+That
+electric
+man
+Dr
+Now
+your
+arm
+is
+not
+paralyzed
+at
+all
+Look
+at
+your
+dress
+Is
+it
+yours
+Where
+did
+you
+get
+it
+Sp
+Did
+you
+buy
+this
+dress
+Dr
+My
+wife
+did
+What
+is
+your
+name
+Sp
+Lizzie
+Dr
+Lizzie
+what
+Sp
+Mrs
+Lizzie
+Davidson
+and
+I
+don
+t
+want
+to
+be
+called
+Lizzie
+When
+you
+speak
+to
+me
+you
+must
+call
+me
+Mrs
+Davidson
+Dr
+Now
+listen
+to
+me
+I
+am
+telling
+you
+a
+fact
+when
+I
+say
+you
+have
+lost
+your
+own
+body
+but
+you
+do
+not
+realize
+it
+You
+have
+been
+bothering
+that
+gentleman
+s
+wife
+Mrs
+I
+for
+a
+long
+time
+You
+have
+made
+her
+an
+invalid
+Sp
+I
+have
+not
+been
+his
+wife
+Dr
+No
+but
+you
+have
+been
+bothering
+his
+wife
+Sp
+Coquettishly
+to
+Mr
+I
+You
+are
+a
+nice
+nurse
+and
+I
+like
+you
+Don
+t
+you
+like
+me
+Mr
+I
+No
+Sp
+I
+don
+t
+want
+your
+wife
+to
+go
+to
+sleep
+because
+when
+she
+sleeps
+I
+can
+t
+stay
+and
+I
+want
+to
+sleep
+in
+that
+nice
+bed
+and
+have
+you
+wait
+on
+me
+Dr
+You
+have
+been
+keeping
+that
+lady
+awake
+all
+night
+Sp
+Because
+when
+she
+sleeps
+I
+have
+to
+go
+Dr
+That
+is
+selfishness
+Sp
+I
+have
+no
+home
+so
+I
+have
+to
+make
+my
+home
+with
+her
+She
+s
+an
+awful
+nice
+lady
+Dr
+Now
+you
+will
+have
+to
+find
+a
+home
+of
+your
+own
+in
+the
+spirit
+world
+Sp
+Where
+is
+that
+Dr
+It
+is
+the
+invisible
+world
+about
+the
+earth
+plane
+Do
+you
+believe
+in
+Heaven
+Sp
+Yes
+where
+God
+is
+and
+Jesus
+Christ
+and
+the
+Holy
+Ghost
+I
+am
+going
+to
+Heaven
+Dr
+Use
+a
+little
+reason
+You
+lost
+your
+physical
+body
+long
+ago
+Sp
+Where
+did
+I
+lose
+it
+Dr
+We
+cannot
+tell
+that
+Sp
+Then
+how
+did
+you
+find
+it
+out
+Dr
+You
+are
+proving
+the
+fact
+yourself
+Do
+you
+realize
+that
+this
+is
+the
+hand
+of
+my
+wife
+that
+I
+am
+holding
+Sp
+You
+are
+holding
+my
+hand
+and
+I
+am
+not
+your
+wife
+Stamping
+Dr
+I
+am
+holding
+my
+wife
+s
+hands
+and
+you
+are
+talking
+through
+her
+Sp
+You
+are
+not
+going
+to
+hold
+me
+any
+longer
+Dr
+You
+are
+talking
+to
+us
+but
+we
+cannot
+see
+you
+You
+are
+invisible
+to
+us
+Every
+one
+here
+sees
+that
+this
+is
+my
+wife
+s
+body
+Mr
+I
+Did
+you
+follow
+Dr
+Wickland
+here
+this
+morning
+Sp
+He
+put
+those
+awful
+things
+in
+me
+Electricity
+Then
+he
+said
+Everybody
+come
+along
+with
+me
+To
+Dr
+W
+Why
+did
+you
+do
+that
+and
+make
+me
+get
+out
+And
+that
+Indian
+girl
+Silver
+Star
+one
+of
+Mrs
+Wickland
+s
+guides
+who
+had
+controlled
+for
+a
+brief
+time
+that
+morning
+telling
+funny
+stories
+to
+attract
+the
+spirit
+s
+attention
+She
+made
+me
+laugh
+until
+I
+got
+so
+weak
+and
+sick
+that
+before
+I
+knew
+it
+I
+was
+away
+from
+that
+lady
+I
+m
+so
+mad
+If
+I
+could
+only
+get
+hold
+of
+that
+Indian
+I
+would
+wring
+her
+neck
+all
+right
+Dr
+I
+thought
+you
+said
+you
+were
+a
+Christian
+Sp
+Yes
+I
+am
+God
+forgive
+me
+for
+saying
+that
+Let
+me
+pray
+I
+made
+a
+mistake
+Mr
+I
+You
+said
+the
+doctor
+brought
+you
+here
+Sp
+He
+did
+not
+bring
+me
+in
+this
+body
+Mr
+I
+That
+body
+has
+been
+here
+all
+day
+you
+came
+with
+the
+doctor
+and
+his
+wife
+in
+their
+auto
+this
+morning
+Sp
+What
+do
+you
+mean
+by
+auto
+Dr
+Don
+t
+you
+know
+what
+an
+automobile
+is
+Sp
+What
+is
+it
+Dr
+It
+is
+a
+car
+that
+runs
+by
+itself
+There
+are
+millions
+of
+them
+in
+use
+now
+You
+lost
+your
+body
+evidently
+a
+long
+time
+ago
+Sp
+Are
+you
+sure
+about
+it
+When
+did
+I
+lose
+it
+Dr
+I
+do
+not
+know
+We
+do
+not
+know
+you
+Sp
+I
+told
+you
+I
+am
+Lizzie
+Davidson
+Let
+us
+pray
+Dr
+I
+think
+you
+are
+two
+faced
+Sp
+I
+think
+so
+too
+sometimes
+Sometimes
+I
+have
+dark
+hair
+and
+sometimes
+light
+The
+patient
+had
+dark
+hair
+Dr
+How
+can
+you
+explain
+that
+Sp
+I
+don
+t
+know
+and
+I
+don
+t
+care
+I
+only
+love
+Jesus
+Dr
+Where
+did
+you
+come
+from
+Do
+you
+know
+where
+you
+are
+You
+are
+in
+Los
+Angeles
+California
+SP
+I
+am
+not
+I
+never
+have
+been
+I
+never
+was
+I
+had
+no
+money
+to
+go
+there
+Dr
+Where
+did
+you
+live
+Sp
+In
+New
+York
+Mr
+I
+Was
+it
+down
+on
+Twenty
+seventh
+Street
+Sp
+No
+it
+wasn
+t
+Dr
+It
+must
+be
+a
+long
+time
+since
+you
+were
+on
+earth
+for
+you
+have
+not
+seen
+automobiles
+that
+run
+without
+horses
+Sp
+Does
+the
+devil
+run
+them
+Dr
+No
+internal
+combustion
+Sp
+Blab
+Blab
+Internal
+combustion
+Dr
+What
+year
+do
+you
+think
+this
+is
+We
+think
+it
+is
+SP
+Then
+you
+re
+off
+It
+is
+Dr
+Who
+is
+President
+Sp
+Don
+t
+you
+know
+Mr
+G
+Yes
+we
+know
+but
+we
+want
+to
+see
+if
+you
+know
+Dr
+I
+think
+it
+is
+Harding
+Sp
+Wait
+a
+little
+I
+have
+to
+think
+It
+is
+Arthur
+Garfield
+was
+shot
+in
+in
+July
+Dr
+Is
+that
+the
+last
+you
+remember
+Can
+you
+recall
+any
+President
+later
+than
+that
+Sp
+No
+just
+Arthur
+He
+became
+President
+after
+Garfield
+was
+shot
+Dr
+We
+have
+had
+many
+Presidents
+since
+then
+Cleveland
+Harrison
+Taft
+and
+many
+others
+Sp
+I
+had
+a
+brother
+in
+law
+named
+Cleveland
+Dr
+Was
+he
+the
+President
+Sp
+Not
+much
+He
+didn
+t
+know
+very
+much
+anyway
+What
+kind
+of
+people
+are
+you
+Dr
+We
+are
+all
+investigators
+Do
+you
+know
+what
+becomes
+of
+the
+dead
+Sp
+They
+go
+to
+Heaven
+and
+see
+Christ
+and
+the
+Holy
+Ghost
+and
+the
+Father
+sitting
+on
+the
+throne
+and
+the
+people
+sitting
+at
+His
+feet
+I
+love
+Jesus
+I
+never
+loved
+anybody
+as
+much
+as
+I
+do
+Jesus
+Dr
+You
+say
+it
+is
+that
+is
+forty
+years
+ago
+It
+is
+now
+Why
+are
+you
+not
+in
+Heaven
+since
+you
+have
+been
+dead
+all
+that
+time
+Sp
+I
+have
+not
+been
+dead
+Dr
+You
+are
+dead
+only
+to
+the
+world
+you
+lost
+your
+physical
+body
+forty
+years
+ago
+Sp
+How
+do
+you
+know
+Dr
+From
+your
+own
+words
+We
+are
+now
+listening
+to
+what
+people
+call
+a
+dead
+person
+You
+are
+talking
+through
+my
+wife
+s
+body
+Sp
+Seeing
+a
+spirit
+Who
+is
+that
+over
+there
+Dr
+Ask
+them
+who
+they
+are
+Sp
+There
+s
+Cleveland
+my
+brother
+in
+law
+Hell
+What
+do
+you
+want
+Mr
+G
+Hello
+Cleveland
+How
+are
+you
+today
+Sp
+Angrily
+to
+Mr
+G
+You
+keep
+still
+You
+don
+t
+know
+him
+Mr
+G
+What
+was
+his
+business
+Sp
+He
+was
+a
+shoemaker
+Mr
+G
+He
+was
+probably
+a
+good
+one
+Sp
+He
+was
+not
+nice
+to
+my
+sister
+I
+don
+t
+like
+you
+Cleveland
+You
+always
+made
+trouble
+Dr
+Listen
+to
+what
+he
+says
+Sp
+To
+spirit
+Cleveland
+You
+devil
+you
+Dr
+That
+is
+fine
+talk
+for
+a
+Christian
+Sp
+God
+forgive
+me
+God
+forgive
+me
+Dr
+Be
+serious
+and
+forgive
+Cleveland
+Sp
+I
+will
+never
+forgive
+him
+never
+He
+went
+away
+and
+took
+my
+sister
+with
+him
+To
+spirit
+You
+devil
+You
+went
+away
+with
+my
+sister
+and
+it
+broke
+my
+heart
+when
+you
+took
+her
+Not
+now
+nor
+in
+the
+world
+to
+come
+will
+I
+ever
+forgive
+you
+no
+not
+much
+Get
+away
+there
+Dr
+Is
+that
+Christian
+charity
+Is
+that
+the
+teaching
+of
+Christ
+Sp
+People
+forget
+themselves
+sometimes
+Dr
+You
+will
+have
+to
+forgive
+him
+and
+ask
+him
+to
+forgive
+you
+Sp
+I
+will
+ask
+forgiveness
+from
+Christ
+From
+Cleveland
+I
+never
+will
+Dr
+Jesus
+said
+Forgive
+and
+ye
+shall
+be
+forgiven
+Sp
+Yes
+but
+nobody
+practices
+it
+I
+will
+pray
+and
+that
+will
+help
+Dr
+No
+it
+will
+not
+Praying
+won
+t
+help
+you
+any
+in
+this
+case
+You
+have
+been
+in
+darkness
+forty
+years
+Sp
+Sometimes
+I
+have
+been
+a
+man
+and
+sometimes
+a
+lady
+Dr
+You
+have
+been
+obsessing
+people
+Sp
+Here
+you
+Cleveland
+you
+have
+no
+business
+to
+come
+here
+and
+torment
+me
+again
+What
+have
+you
+done
+with
+my
+sister
+you
+devil
+you
+Dr
+I
+thought
+you
+belonged
+to
+the
+Holy
+of
+Holies
+Sp
+Cora
+Spirit
+My
+sister
+Why
+did
+you
+go
+with
+that
+man
+I
+will
+never
+forgive
+him
+I
+suffered
+so
+much
+I
+thought
+you
+would
+be
+with
+me
+for
+the
+rest
+of
+your
+life
+I
+promised
+mother
+I
+would
+take
+care
+of
+you
+all
+my
+life
+then
+you
+ran
+away
+with
+that
+thing
+You
+broke
+my
+heart
+Dr
+What
+does
+she
+say
+Sp
+No
+she
+says
+she
+loved
+him
+There
+is
+no
+such
+thing
+as
+loving
+any
+man
+Say
+there
+s
+David
+too
+I
+suppose
+you
+think
+you
+are
+going
+to
+make
+up
+with
+me
+Not
+much
+you
+aren
+t
+I
+never
+will
+forgive
+you
+either
+Dr
+Who
+is
+David
+Sp
+My
+husband
+Dr
+What
+was
+the
+matter
+with
+him
+Sp
+He
+was
+a
+fool
+Dr
+For
+marrying
+you
+Sp
+The
+world
+is
+coming
+to
+an
+end
+People
+are
+so
+full
+of
+sin
+that
+God
+does
+not
+know
+what
+to
+do
+with
+them
+He
+will
+have
+to
+teach
+them
+in
+some
+way
+so
+let
+us
+pray
+I
+want
+to
+go
+to
+Heaven
+Dr
+Do
+you
+think
+you
+have
+much
+chance
+of
+getting
+there
+Sp
+I
+will
+pray
+for
+you
+You
+know
+David
+you
+were
+no
+good
+I
+have
+had
+my
+troubles
+Dr
+Didn
+t
+you
+have
+any
+faults
+Sp
+No
+I
+prayed
+to
+God
+Dr
+Doesn
+t
+your
+conscience
+bother
+you
+Sp
+My
+conscience
+Dr
+Yes
+Doesn
+t
+it
+make
+you
+feel
+guilty
+Sp
+Cora
+you
+always
+loved
+me
+and
+you
+said
+you
+would
+always
+be
+with
+me
+for
+the
+rest
+of
+your
+life
+and
+then
+you
+ran
+away
+with
+that
+thing
+Dr
+What
+does
+she
+say
+Sp
+Cora
+says
+You
+did
+not
+let
+me
+go
+anywhere
+It
+was
+always
+church
+church
+and
+you
+wanted
+me
+to
+pray
+all
+the
+time
+I
+got
+tired
+of
+it
+and
+then
+Cleveland
+came
+and
+he
+promised
+to
+give
+me
+a
+home
+He
+was
+very
+good
+to
+me
+But
+I
+will
+not
+forgive
+him
+anyhow
+Dr
+You
+were
+a
+religious
+fanatic
+and
+your
+sister
+could
+not
+stand
+it
+Sp
+She
+ought
+to
+love
+Jesus
+Dr
+You
+have
+not
+found
+Jesus
+yourself
+Sp
+I
+haven
+t
+found
+Jesus
+because
+I
+am
+not
+dead
+Dr
+Will
+you
+not
+believe
+what
+your
+sister
+says
+to
+you
+Where
+did
+she
+live
+Sp
+She
+lived
+in
+New
+York
+then
+moved
+to
+Chicago
+Dr
+Ask
+her
+whether
+she
+is
+a
+spirit
+Sp
+She
+says
+she
+s
+dead
+To
+sister
+You
+re
+dead
+and
+you
+deserve
+it
+too
+because
+you
+became
+a
+spiritualist
+at
+the
+last
+you
+crazy
+thing
+you
+I
+got
+mad
+at
+you
+because
+you
+ran
+around
+to
+spiritualist
+meetings
+all
+the
+time
+That
+Cleveland
+took
+you
+because
+he
+belonged
+there
+and
+believed
+in
+spirits
+Dr
+I
+am
+sitting
+here
+with
+my
+wife
+and
+you
+an
+invisible
+spirit
+are
+talking
+to
+us
+through
+her
+Dr
+Does
+your
+sister
+say
+anything
+further
+Sp
+She
+says
+Lizzie
+come
+to
+your
+senses
+You
+don
+t
+need
+to
+tell
+me
+that
+Shut
+up
+with
+you
+They
+have
+crushed
+me
+Dr
+Were
+you
+always
+selfish
+Sp
+No
+David
+he
+was
+a
+good
+man
+at
+times
+He
+always
+worked
+and
+took
+care
+of
+me
+I
+had
+a
+good
+home
+but
+he
+did
+not
+want
+me
+to
+go
+to
+church
+so
+much
+He
+wouldn
+t
+pay
+his
+money
+to
+the
+church
+so
+I
+got
+mad
+and
+called
+him
+a
+stingy
+fool
+I
+told
+him
+if
+he
+did
+not
+go
+to
+church
+and
+pay
+money
+to
+the
+Lord
+he
+would
+go
+to
+hell
+And
+there
+he
+is
+Dr
+He
+is
+not
+in
+hell
+Sp
+Yes
+he
+is
+but
+I
+don
+t
+see
+how
+he
+skipped
+out
+David
+you
+died
+a
+long
+time
+ago
+and
+I
+have
+prayed
+for
+you
+because
+I
+thought
+you
+were
+in
+hell
+and
+you
+should
+have
+stayed
+there
+because
+you
+did
+not
+pay
+any
+money
+to
+the
+Lord
+Dr
+Ask
+him
+if
+he
+has
+been
+in
+hell
+Sp
+He
+says
+No
+there
+is
+no
+such
+place
+You
+big
+fool
+you
+are
+in
+hell
+Dr
+You
+yourself
+are
+in
+the
+hell
+of
+ignorance
+You
+are
+bound
+by
+selfishness
+and
+ignorance
+Sp
+Now
+David
+don
+t
+you
+bother
+me
+You
+go
+to
+hell
+because
+you
+belong
+there
+You
+did
+not
+go
+to
+church
+Dr
+Jesus
+said
+Judge
+not
+that
+ye
+be
+not
+judged
+Sp
+I
+have
+been
+born
+again
+in
+the
+blood
+of
+Jesus
+I
+paid
+all
+the
+money
+I
+could
+to
+the
+church
+Dr
+And
+kept
+yourself
+in
+ignorance
+Sp
+I
+have
+been
+baptized
+immersed
+and
+I
+am
+one
+of
+the
+holiest
+I
+was
+a
+good
+church
+member
+I
+worked
+hard
+for
+my
+money
+and
+have
+suffered
+so
+I
+will
+go
+to
+Heaven
+when
+I
+die
+Dr
+You
+never
+will
+really
+die
+Sp
+David
+is
+dead
+Dr
+If
+he
+himself
+were
+dead
+he
+could
+not
+talk
+to
+you
+Sp
+Cora
+died
+in
+Chicago
+Dr
+If
+they
+are
+dead
+how
+can
+they
+talk
+to
+you
+i
+Sp
+Frightened
+Why
+they
+are
+ghosts
+I
+forgot
+they
+are
+dead
+Dr
+Ghosts
+like
+yourself
+You
+are
+a
+ghost
+Sp
+But
+they
+are
+dead
+Dr
+Do
+they
+look
+as
+if
+they
+were
+dead
+Sp
+No
+they
+look
+much
+prettier
+than
+they
+did
+before
+I
+suppose
+they
+are
+in
+Heaven
+To
+the
+spirits
+Have
+you
+folks
+seen
+Christ
+and
+God
+Have
+you
+been
+in
+Heaven
+with
+Them
+Dr
+What
+do
+they
+say
+Sp
+They
+say
+No
+Then
+you
+are
+I
+thought
+so
+then
+you
+have
+been
+in
+hell
+Have
+you
+They
+say
+No
+Dr
+Ask
+them
+if
+the
+body
+you
+are
+using
+is
+yours
+Sp
+To
+invisibles
+Well
+what
+are
+you
+looking
+at
+Don
+t
+you
+know
+me
+They
+say
+not
+as
+I
+look
+now
+How
+is
+that
+Dr
+Have
+I
+not
+been
+telling
+you
+that
+you
+are
+invisible
+to
+us
+and
+that
+you
+are
+using
+my
+wife
+s
+body
+Sp
+How
+Dr
+Spirits
+can
+control
+mortals
+as
+you
+are
+now
+doing
+Jesus
+cast
+out
+unclean
+spirits
+Sp
+Unclean
+I
+m
+not
+unclean
+You
+insult
+me
+again
+Dr
+You
+influenced
+that
+gentleman
+s
+wife
+disturbed
+her
+life
+and
+made
+an
+invalid
+of
+her
+Mr
+I
+Don
+t
+you
+recognize
+me
+Sp
+Yes
+you
+are
+a
+very
+good
+nurse
+and
+I
+think
+I
+should
+like
+to
+have
+you
+nurse
+me
+again
+Dr
+He
+was
+not
+nursing
+you
+he
+was
+nursing
+his
+wife
+Sp
+We
+had
+such
+a
+nice
+bed
+I
+just
+love
+it
+You
+tell
+your
+wife
+that
+she
+must
+not
+get
+up
+because
+if
+she
+does
+I
+can
+t
+stay
+Dr
+You
+will
+never
+go
+there
+again
+Mr
+I
+My
+wife
+is
+up
+now
+She
+has
+been
+up
+the
+whole
+day
+Sp
+I
+want
+her
+in
+bed
+Mr
+I
+She
+has
+been
+up
+since
+the
+doctor
+left
+this
+morning
+She
+had
+to
+remain
+in
+bed
+for
+nine
+months
+That
+Indian
+girl
+made
+me
+laugh
+so
+hard
+that
+I
+could
+not
+stay
+with
+that
+nice
+lady
+It
+makes
+me
+so
+mad
+I
+was
+listen
+ing
+to
+what
+the
+Indian
+said
+and
+I
+laughed
+so
+hard
+at
+her
+that
+I
+lost
+control
+of
+the
+lady
+To
+Mr
+What
+did
+you
+come
+here
+for
+Dr
+He
+wanted
+to
+get
+rid
+of
+you
+Mr
+I
+I
+came
+here
+to
+see
+you
+tonight
+Sp
+Coyly
+Were
+you
+lonesome
+for
+me
+Mr
+I
+Emphatically
+No
+Sp
+I
+would
+like
+to
+go
+back
+with
+you
+can
+I
+Mr
+L
+No
+you
+cannot
+Dr
+You
+were
+very
+selfish
+but
+you
+will
+not
+acknowledge
+it
+Sp
+Here
+s
+my
+sister
+Cora
+and
+her
+husband
+Cleveland
+and
+my
+husband
+David
+No
+no
+Oh
+there
+s
+my
+mother
+Did
+you
+come
+from
+Heaven
+Mother
+Are
+you
+happy
+in
+Heaven
+Mother
+with
+Jesus
+and
+God
+Dr
+What
+does
+she
+say
+Sp
+She
+says
+Lizzie
+behave
+yourself
+Now
+Mother
+I
+was
+always
+a
+good
+girl
+to
+you
+Mother
+says
+You
+were
+always
+selfish
+Lizzie
+Dr
+That
+comes
+from
+your
+own
+mother
+Your
+conscience
+tells
+you
+the
+same
+thing
+You
+had
+a
+mean
+disposition
+ask
+your
+mother
+Sp
+Mother
+did
+you
+come
+from
+Heaven
+Mother
+I
+m
+not
+dead
+yet
+so
+I
+can
+t
+go
+to
+Heaven
+I
+have
+to
+die
+before
+I
+can
+go
+there
+Dr
+The
+Bible
+says
+Ye
+are
+the
+temple
+of
+God
+and
+the
+Spirit
+of
+God
+dwelleth
+in
+you
+Where
+will
+you
+find
+that
+God
+outside
+of
+yourself
+Sp
+It
+says
+in
+the
+Bible
+that
+God
+sits
+on
+a
+throne
+with
+Christ
+on
+His
+right
+hand
+Dr
+The
+Bible
+says
+God
+is
+Love
+and
+he
+that
+dwelleth
+in
+Love
+dwelleth
+in
+God
+Where
+will
+you
+find
+such
+a
+God
+Sp
+In
+Heaven
+Dr
+Jesus
+said
+God
+is
+Spirit
+and
+they
+that
+worship
+Him
+must
+worship
+Him
+in
+Spirit
+and
+in
+truth
+Did
+you
+do
+that
+No
+you
+simply
+accepted
+a
+dogma
+and
+pretended
+you
+were
+saintly
+but
+your
+conscience
+condemned
+you
+all
+the
+time
+did
+it
+not
+Sp
+I
+was
+not
+happy
+Dr
+Your
+conscience
+tells
+you
+that
+you
+were
+a
+hypocrite
+Sp
+How
+do
+you
+know
+it
+does
+Dr
+Your
+actions
+show
+that
+Does
+your
+mother
+say
+any
+thing
+more
+Sp
+She
+says
+Lizzie
+behave
+yourself
+What
+does
+she
+say
+that
+for
+She
+was
+always
+after
+me
+because
+she
+says
+I
+had
+such
+a
+tongue
+Dr
+You
+must
+change
+your
+attitude
+or
+the
+spirit
+forces
+will
+take
+you
+away
+and
+place
+you
+in
+a
+dark
+dungeon
+Sp
+God
+forgive
+me
+I
+will
+pray
+Dr
+You
+are
+not
+sincere
+Sp
+To
+Mr
+I
+Will
+you
+forgive
+me
+Dr
+If
+you
+are
+sincere
+in
+asking
+he
+will
+Sp
+David
+you
+were
+always
+good
+to
+me
+but
+I
+was
+not
+always
+a
+good
+wife
+to
+you
+I
+thought
+you
+were
+a
+devil
+and
+I
+always
+talked
+about
+you
+yes
+I
+did
+Crying
+Dr
+Crying
+will
+not
+help
+you
+Sp
+David
+I
+loved
+you
+anyhow
+Do
+you
+like
+me
+David
+I
+was
+your
+dear
+little
+wife
+He
+says
+Shame
+on
+you
+and
+that
+I
+was
+nice
+when
+I
+did
+not
+have
+a
+temper
+Dr
+Now
+you
+must
+hurry
+and
+go
+Sp
+I
+want
+to
+ask
+that
+nice
+man
+to
+please
+forgive
+me
+To
+Mr
+I
+Will
+you
+Mr
+I
+Yes
+Sp
+Cleveland
+I
+was
+mad
+at
+you
+You
+were
+good
+to
+my
+sister
+but
+why
+did
+you
+go
+away
+Why
+did
+you
+go
+to
+Chicago
+and
+take
+her
+away
+from
+me
+He
+says
+his
+business
+was
+there
+To
+Mr
+I
+Will
+you
+forgive
+me
+I
+mean
+it
+I
+really
+mean
+it
+this
+time
+will
+you
+If
+I
+never
+meant
+it
+in
+my
+life
+before
+I
+do
+now
+Mother
+will
+you
+forgive
+me
+Will
+you
+I
+love
+you
+I
+was
+very
+selfish
+I
+know
+now
+I
+can
+see
+it
+now
+I
+see
+every
+thing
+now
+My
+eyes
+have
+been
+opened
+Oh
+oh
+Crying
+Dr
+Crying
+does
+no
+good
+Listen
+to
+what
+your
+relatives
+say
+Sp
+Can
+I
+go
+with
+them
+to
+Heaven
+Dr
+Forget
+Heaven
+and
+be
+sensible
+You
+will
+never
+find
+God
+as
+you
+have
+imagined
+You
+must
+be
+honest
+with
+yourself
+Sp
+I
+have
+never
+in
+all
+my
+life
+been
+so
+humiliated
+as
+I
+have
+been
+tonight
+You
+forgive
+me
+David
+don
+t
+you
+And
+you
+Cora
+and
+Cleveland
+too
+Dr
+Do
+you
+know
+that
+you
+are
+in
+California
+Sp
+How
+did
+I
+get
+there
+Dr
+You
+evidently
+have
+been
+dead
+some
+forty
+years
+No
+one
+actually
+dies
+but
+the
+physical
+body
+is
+lost
+and
+people
+call
+that
+death
+Sp
+Part
+of
+the
+time
+I
+have
+been
+walking
+but
+for
+a
+very
+long
+time
+I
+have
+had
+such
+a
+good
+time
+in
+that
+nice
+bed
+Dr
+Yes
+disturbing
+that
+gentleman
+s
+wife
+Sp
+But
+he
+has
+been
+so
+good
+to
+me
+he
+s
+so
+nice
+Dr
+Aren
+t
+you
+ashamed
+to
+make
+an
+invalid
+of
+a
+poor
+mortal
+Sp
+David
+will
+you
+take
+me
+along
+with
+you
+Dr
+Now
+you
+must
+go
+Sp
+I
+am
+going
+Rising
+Dr
+You
+cannot
+go
+that
+way
+Sp
+How
+in
+the
+world
+will
+I
+go
+then
+That
+Indian
+girl
+won
+t
+take
+me
+away
+will
+she
+Dr
+She
+will
+teach
+you
+beautiful
+truths
+Sp
+But
+she
+laughed
+at
+me
+Dr
+Now
+think
+yourself
+with
+your
+relatives
+and
+you
+will
+be
+there
+Sp
+Now
+I
+will
+go
+Will
+I
+see
+God
+Dr
+Forget
+that
+You
+do
+not
+have
+the
+right
+understanding
+of
+God
+Sp
+Goodbye
+After
+this
+Mrs
+I
+recovered
+her
+strength
+and
+was
+soon
+walk
+ing
+and
+driving
+about
+Chapter
+X
+Orphans
+VARIOUS
+spirit
+orphans
+who
+have
+known
+no
+family
+ties
+during
+earth
+life
+have
+been
+brought
+to
+us
+for
+aid
+and
+these
+have
+usually
+been
+eager
+for
+knowledge
+and
+ready
+to
+accept
+the
+explanation
+of
+a
+higher
+life
+A
+lonely
+orphan
+came
+to
+us
+one
+evening
+a
+deserted
+waif
+but
+observant
+analytical
+and
+eager
+for
+understanding
+EXPERIENCE
+MAY
+Spirit
+MINNIE
+ON
+THE
+STEP
+Psychic
+MRS
+WICKLAND
+Doctor
+Where
+did
+you
+come
+from
+Spirit
+I
+don
+t
+know
+Dr
+What
+have
+you
+been
+doing
+Sp
+I
+don
+t
+know
+either
+Dr
+Should
+you
+not
+find
+out
+Sp
+What
+Dr
+Where
+you
+are
+and
+where
+you
+came
+from
+Sp
+I
+don
+t
+know
+Dr
+How
+long
+have
+you
+been
+dead
+Sp
+Dead
+I
+don
+t
+know
+I
+don
+t
+know
+anything
+Dr
+Has
+anybody
+come
+to
+you
+and
+told
+you
+that
+you
+have
+lost
+your
+body
+Sp
+No
+I
+have
+been
+going
+around
+everywhere
+and
+talking
+Dr
+To
+whom
+Sp
+To
+every
+body
+I
+could
+talk
+to
+But
+some
+way
+or
+another
+they
+don
+t
+seem
+to
+pay
+attention
+to
+me
+I
+go
+sometimes
+in
+a
+big
+crowd
+and
+think
+I
+will
+get
+hold
+of
+them
+all
+and
+sometimes
+I
+get
+right
+up
+on
+the
+platform
+and
+begin
+to
+ask
+them
+what
+is
+the
+matter
+with
+me
+but
+it
+s
+just
+like
+I
+was
+nobody
+and
+I
+think
+I
+am
+somebody
+I
+think
+I
+was
+good
+but
+nobody
+wants
+me
+Dr
+What
+can
+you
+remember
+before
+that
+time
+Sp
+Before
+that
+time
+I
+was
+somebody
+I
+am
+probably
+nobody
+now
+Dr
+Where
+did
+you
+live
+when
+you
+were
+somebody
+Sp
+Always
+in
+the
+same
+place
+Sometimes
+I
+get
+so
+tired
+then
+I
+go
+and
+lie
+down
+and
+sleep
+and
+sleep
+and
+then
+it
+seems
+after
+I
+have
+slept
+then
+I
+go
+on
+again
+Sometimes
+I
+only
+go
+around
+and
+around
+and
+do
+not
+go
+any
+further
+Dr
+Has
+nobody
+ever
+come
+to
+you
+Sp
+I
+see
+people
+who
+think
+I
+am
+nobody
+They
+do
+not
+notice
+me
+and
+do
+not
+think
+of
+me
+Sometimes
+I
+feel
+miserable
+and
+an
+other
+time
+I
+do
+not
+Dr
+Where
+is
+your
+mother
+Sp
+I
+don
+t
+know
+Sometimes
+I
+go
+hungry
+and
+sometimes
+I
+get
+so
+hungry
+I
+beg
+of
+people
+Sometimes
+I
+get
+something
+and
+sometimes
+not
+If
+I
+can
+get
+in
+the
+kitchen
+I
+get
+something
+to
+eat
+and
+I
+eat
+much
+then
+after
+that
+I
+go
+and
+then
+it
+seems
+I
+am
+out
+again
+Dr
+Out
+where
+Sp
+Everywhere
+Dr
+When
+you
+get
+something
+to
+eat
+do
+you
+feel
+like
+somebody
+else
+Sp
+I
+go
+hungry
+and
+I
+have
+to
+get
+something
+Dr
+Where
+do
+you
+get
+something
+to
+eat
+Sp
+It
+s
+the
+funniest
+thing
+Always
+somebody
+else
+pays
+the
+bill
+and
+I
+have
+nothing
+to
+pay
+that
+s
+the
+funniest
+of
+all
+I
+never
+pay
+for
+anything
+Once
+in
+a
+while
+I
+do
+not
+get
+what
+I
+like
+but
+I
+have
+to
+eat
+it
+Sometimes
+I
+feel
+so
+bad
+after
+eating
+that
+I
+get
+real
+sick
+I
+do
+not
+like
+things
+and
+I
+make
+faces
+Sometimes
+I
+eat
+a
+lot
+and
+sometimes
+a
+little
+Sometimes
+I
+am
+a
+man
+and
+sometimes
+a
+girl
+Obsessing
+different
+persons
+I
+don
+t
+know
+what
+is
+the
+matter
+with
+me
+Why
+is
+everything
+so
+funny
+I
+don
+t
+know
+myself
+I
+go
+and
+I
+walk
+and
+I
+like
+people
+to
+talk
+to
+me
+I
+have
+to
+talk
+all
+the
+time
+I
+only
+hear
+myself
+talk
+Once
+in
+a
+while
+I
+get
+in
+somewhere
+where
+they
+talk
+and
+I
+can
+sit
+down
+and
+some
+times
+I
+feel
+oh
+I
+don
+t
+know
+I
+feel
+like
+I
+was
+half
+a
+person
+sometimes
+somebody
+else
+Dr
+How
+old
+are
+you
+Sp
+How
+old
+am
+I
+I
+don
+t
+know
+Dr
+Don
+t
+you
+know
+how
+old
+you
+are
+Sp
+On
+my
+last
+birthday
+I
+was
+nineteen
+Dr
+Have
+you
+any
+father
+mother
+or
+sister
+Sp
+No
+I
+have
+not
+Dr
+Where
+did
+your
+parents
+live
+Sp
+I
+never
+saw
+my
+father
+or
+mother
+Dr
+Where
+did
+you
+live
+Sp
+I
+don
+t
+know
+if
+my
+father
+and
+mother
+are
+dead
+or
+where
+they
+are
+I
+never
+knew
+Dr
+Did
+you
+live
+in
+an
+institution
+Sp
+I
+was
+brought
+up
+in
+a
+Home
+with
+a
+lot
+of
+children
+Dr
+Did
+you
+know
+many
+of
+the
+children
+Sp
+There
+were
+so
+many
+Dr
+Where
+was
+that
+place
+Sp
+I
+don
+t
+exactly
+know
+It
+is
+kind
+of
+funny
+How
+are
+things
+I
+feel
+funny
+Dr
+It
+must
+be
+a
+strange
+situation
+Sp
+This
+is
+the
+first
+time
+somebody
+talked
+to
+me
+I
+came
+here
+when
+you
+were
+singing
+about
+that
+beautiful
+shore
+I
+thought
+I
+wanted
+to
+go
+on
+that
+other
+shore
+and
+I
+was
+just
+looking
+to
+see
+where
+it
+was
+Dr
+We
+will
+help
+you
+reach
+that
+shore
+Sp
+Before
+I
+knew
+it
+I
+could
+talk
+when
+you
+talked
+to
+me
+Controlled
+psychic
+This
+is
+what
+I
+have
+to
+say
+nobody
+talked
+directly
+to
+me
+for
+a
+long
+long
+time
+If
+I
+talked
+to
+any
+one
+someone
+else
+always
+answered
+I
+never
+seemed
+to
+have
+anything
+to
+say
+No
+one
+paid
+any
+attention
+to
+what
+I
+said
+That
+is
+the
+funniest
+thing
+of
+all
+That
+is
+funny
+I
+got
+out
+of
+the
+home
+that
+I
+was
+working
+in
+because
+they
+were
+awfully
+mean
+to
+me
+Dr
+What
+did
+they
+do
+Whip
+you
+Sp
+Not
+exactly
+I
+was
+working
+in
+a
+family
+somewhere
+I
+was
+so
+hungry
+and
+of
+course
+I
+did
+not
+do
+things
+as
+well
+as
+they
+wanted
+me
+to
+There
+came
+a
+lady
+and
+she
+said
+she
+would
+take
+me
+away
+from
+the
+Home
+I
+wished
+she
+had
+not
+In
+the
+Home
+it
+was
+pretty
+fair
+Of
+course
+we
+had
+hard
+times
+but
+it
+is
+better
+than
+to
+be
+scolded
+all
+the
+time
+In
+the
+Home
+we
+had
+lots
+of
+things
+we
+did
+not
+like
+but
+we
+had
+a
+good
+time
+too
+This
+woman
+took
+me
+and
+the
+first
+thing
+she
+said
+was
+that
+I
+should
+have
+to
+read
+the
+Bible
+from
+morning
+to
+night
+I
+got
+sick
+and
+tired
+of
+the
+Bible
+Then
+I
+had
+to
+pray
+My
+knees
+were
+so
+sore
+I
+could
+hardly
+walk
+on
+them
+I
+had
+to
+be
+on
+my
+knees
+all
+the
+time
+reading
+and
+praying
+She
+said
+I
+should
+walk
+with
+my
+knees
+not
+my
+feet
+She
+tried
+to
+save
+me
+She
+said
+I
+had
+never
+been
+a
+real
+good
+girl
+and
+if
+I
+did
+not
+do
+as
+she
+said
+I
+should
+go
+to
+some
+very
+hot
+place
+In
+the
+Home
+we
+prayed
+and
+the
+Mother
+was
+awful
+nice
+We
+prayed
+and
+believed
+in
+God
+When
+that
+woman
+took
+me
+I
+was
+fourteen
+That
+was
+my
+sorry
+day
+I
+had
+to
+work
+and
+work
+and
+earn
+something
+and
+she
+scolded
+me
+as
+she
+said
+I
+did
+not
+do
+as
+she
+wanted
+me
+to
+It
+was
+praying
+and
+reading
+all
+the
+time
+There
+was
+nothing
+to
+it
+I
+didn
+t
+pray
+I
+had
+to
+get
+down
+on
+my
+knees
+but
+I
+did
+not
+get
+in
+my
+mind
+what
+she
+was
+saying
+because
+my
+knees
+hurt
+me
+She
+got
+awful
+mad
+when
+I
+slipped
+down
+and
+she
+pulled
+my
+hair
+She
+had
+a
+cushion
+under
+her
+knees
+She
+could
+stay
+there
+for
+hours
+She
+said
+I
+was
+a
+sinner
+because
+I
+got
+tired
+Are
+you
+a
+sinner
+when
+you
+can
+t
+stay
+on
+your
+knees
+a
+long
+time
+I
+did
+not
+know
+very
+much
+but
+I
+thought
+many
+times
+really
+and
+truly
+don
+t
+tell
+anyone
+whispering
+confidentially
+but
+I
+thought
+God
+would
+be
+awfully
+tired
+to
+hear
+that
+all
+the
+time
+I
+was
+so
+tired
+that
+I
+went
+to
+sleep
+Then
+she
+pulled
+my
+hair
+and
+slapped
+me
+She
+prayed
+to
+God
+but
+she
+acted
+so
+bad
+She
+said
+if
+I
+was
+not
+good
+the
+devil
+would
+get
+hold
+of
+me
+I
+thought
+sometimes
+really
+and
+truly
+that
+she
+was
+one
+If
+I
+got
+on
+my
+knees
+and
+went
+to
+sleep
+she
+came
+to
+me
+and
+she
+prayed
+God
+help
+me
+out
+of
+this
+misery
+You
+know
+oh
+God
+how
+I
+love
+you
+She
+prayed
+for
+herself
+first
+and
+then
+for
+her
+sister
+her
+mother
+and
+her
+brother
+and
+father
+and
+her
+friends
+and
+at
+last
+she
+prayed
+for
+Minnie
+They
+did
+not
+know
+my
+other
+name
+I
+do
+not
+know
+who
+my
+really
+and
+truly
+father
+and
+mother
+were
+I
+never
+knew
+I
+never
+got
+my
+history
+but
+they
+said
+they
+found
+me
+on
+the
+step
+They
+often
+called
+me
+Minnie
+On
+The
+Step
+I
+got
+so
+mad
+at
+them
+They
+found
+me
+on
+the
+step
+they
+said
+They
+gave
+me
+the
+name
+of
+Minnie
+Dr
+Try
+to
+realize
+that
+you
+have
+lost
+your
+own
+body
+and
+that
+you
+are
+now
+a
+spirit
+Sp
+What
+is
+that
+I
+am
+a
+girl
+Dr
+You
+have
+been
+wandering
+around
+as
+a
+spirit
+Sp
+What
+do
+you
+mean
+Dr
+You
+have
+lost
+your
+body
+Sp
+Did
+I
+die
+I
+really
+and
+truly
+have
+not
+been
+washing
+dishes
+for
+a
+long
+time
+I
+have
+not
+had
+any
+one
+pull
+my
+hair
+for
+a
+long
+time
+either
+I
+ran
+away
+because
+the
+lady
+was
+so
+mean
+I
+was
+running
+away
+from
+her
+Then
+I
+had
+so
+little
+to
+eat
+I
+ran
+away
+and
+I
+got
+so
+hungry
+I
+had
+no
+money
+Dr
+What
+happened
+after
+that
+Sp
+I
+got
+far
+far
+off
+and
+I
+lost
+my
+way
+I
+was
+so
+hungry
+that
+I
+went
+to
+sleep
+It
+came
+so
+dark
+and
+I
+was
+in
+the
+woods
+I
+had
+to
+run
+in
+the
+woods
+so
+that
+she
+would
+not
+find
+me
+I
+walked
+and
+walked
+and
+I
+thought
+I
+would
+find
+some
+one
+to
+give
+me
+something
+to
+eat
+To
+the
+first
+house
+I
+did
+not
+go
+I
+went
+away
+hungry
+and
+I
+walked
+a
+whole
+day
+and
+night
+and
+it
+seems
+there
+was
+nothing
+but
+big
+trees
+and
+forest
+Then
+I
+went
+to
+sleep
+and
+I
+don
+t
+know
+any
+more
+that
+day
+Passed
+out
+Next
+day
+I
+felt
+better
+and
+I
+walked
+again
+and
+I
+got
+to
+the
+city
+I
+walked
+ever
+and
+ever
+so
+far
+and
+saw
+lots
+of
+people
+but
+they
+paid
+no
+attention
+to
+me
+I
+got
+hungry
+so
+I
+saw
+a
+woman
+go
+into
+a
+restaurant
+and
+we
+had
+some
+dinner
+She
+was
+eating
+it
+all
+I
+got
+a
+little
+She
+did
+not
+talk
+to
+me
+Then
+I
+went
+out
+again
+and
+I
+kept
+on
+walking
+and
+after
+a
+while
+I
+saw
+some
+one
+else
+go
+into
+a
+restaurant
+some
+other
+people
+We
+ate
+but
+they
+paid
+for
+it
+Dr
+Do
+you
+know
+what
+you
+were
+doing
+Sp
+No
+Dr
+You
+were
+obsessing
+some
+one
+As
+a
+spirit
+you
+were
+hovering
+around
+some
+mortal
+and
+were
+trying
+to
+satisfy
+your
+hunger
+through
+that
+person
+You
+probably
+lost
+your
+body
+in
+the
+woods
+Sp
+I
+was
+so
+thirsty
+The
+food
+I
+did
+not
+miss
+so
+much
+but
+I
+thought
+everything
+was
+drying
+up
+in
+my
+throat
+I
+thought
+I
+could
+drink
+a
+barrel
+of
+water
+Dr
+You
+carried
+your
+last
+physical
+sensations
+in
+your
+mind
+not
+realizing
+that
+you
+had
+lost
+your
+body
+Sp
+Did
+I
+What
+time
+was
+that
+Don
+t
+you
+know
+me
+then
+How
+did
+I
+get
+here
+Dr
+We
+cannot
+see
+you
+Sp
+Can
+you
+see
+my
+folks
+Dr
+No
+Sp
+Can
+you
+see
+me
+Dr
+No
+Sp
+What
+is
+the
+matter
+with
+me
+Dr
+You
+are
+invisible
+Sp
+Can
+you
+hear
+me
+talk
+Dr
+Yes
+Sp
+You
+can
+hear
+me
+talk
+but
+not
+see
+me
+Dr
+You
+are
+not
+talking
+through
+your
+own
+body
+Sp
+I
+am
+not
+Dr
+Look
+at
+your
+hands
+Do
+you
+recognize
+them
+Sp
+No
+Dr
+Do
+you
+know
+that
+dress
+Sp
+I
+never
+had
+one
+like
+that
+in
+my
+born
+days
+Dr
+You
+are
+using
+some
+one
+else
+s
+body
+Sp
+Some
+party
+probably
+gave
+me
+a
+dress
+I
+have
+a
+ring
+too
+Dr
+The
+ring
+is
+not
+yours
+nor
+is
+the
+hand
+Sp
+I
+commence
+to
+be
+sleepy
+again
+Dr
+You
+have
+been
+allowed
+to
+come
+in
+and
+control
+this
+body
+Sp
+Oh
+Look
+there
+Dr
+What
+do
+you
+see
+Sp
+I
+don
+t
+know
+myself
+There
+s
+a
+lady
+and
+she
+s
+crying
+Spirit
+Dr
+Ask
+her
+who
+she
+is
+Sp
+After
+listening
+in
+amazement
+Oh
+my
+no
+Dr
+What
+does
+she
+say
+Sp
+Don
+t
+cry
+so
+much
+lady
+I
+don
+t
+like
+to
+see
+crying
+faces
+I
+want
+to
+cry
+myself
+when
+she
+cries
+Dr
+What
+does
+she
+say
+Sp
+She
+says
+I
+am
+her
+child
+She
+probably
+is
+sorry
+she
+left
+me
+Is
+she
+my
+really
+and
+truly
+mother
+She
+says
+Oh
+my
+dear
+child
+She
+says
+she
+has
+been
+hunting
+me
+for
+dear
+life
+but
+she
+could
+not
+get
+me
+and
+she
+did
+not
+know
+what
+to
+do
+Dr
+You
+are
+both
+spirits
+and
+you
+will
+find
+intelligent
+spirits
+here
+who
+will
+help
+you
+Sp
+She
+was
+a
+good
+girl
+she
+says
+but
+some
+man
+got
+her
+in
+trouble
+She
+says
+she
+went
+to
+church
+and
+some
+man
+wanted
+to
+marry
+her
+He
+went
+away
+He
+left
+her
+after
+he
+got
+her
+in
+trouble
+she
+says
+and
+she
+had
+nobody
+She
+was
+so
+sick
+She
+felt
+so
+bad
+so
+she
+put
+me
+on
+the
+step
+of
+that
+big
+Home
+she
+says
+and
+she
+has
+never
+been
+happy
+from
+that
+time
+Then
+she
+got
+sick
+and
+died
+Dr
+Make
+her
+understand
+that
+she
+is
+a
+spirit
+like
+yourself
+You
+will
+find
+intelligent
+spirits
+who
+will
+help
+you
+both
+Sp
+My
+Mother
+I
+want
+to
+be
+with
+you
+I
+forgive
+you
+Mother
+Don
+t
+cry
+I
+have
+never
+had
+a
+mother
+and
+you
+will
+be
+my
+mother
+now
+She
+says
+she
+has
+been
+hunting
+me
+for
+a
+long
+time
+and
+somebody
+said
+they
+brought
+us
+here
+to
+this
+place
+so
+we
+could
+meet
+She
+says
+They
+said
+I
+should
+find
+my
+child
+Now
+she
+found
+me
+didn
+t
+she
+Can
+I
+cry
+for
+gladness
+I
+would
+love
+to
+I
+feel
+so
+glad
+I
+have
+a
+mother
+Dr
+You
+will
+both
+have
+a
+home
+in
+the
+spirit
+world
+Sp
+She
+says
+my
+name
+is
+Gladys
+She
+says
+her
+name
+is
+Clara
+Watsman
+Dr
+Where
+was
+her
+home
+Sp
+She
+says
+St
+Louis
+Dr
+You
+will
+find
+other
+spirits
+here
+who
+will
+take
+you
+to
+the
+spirit
+world
+Sp
+What
+is
+that
+Why
+here
+comes
+an
+Indian
+girl
+Spirit
+She
+s
+a
+nice
+little
+girl
+Dr
+She
+will
+teach
+both
+of
+you
+many
+wonderful
+things
+Sp
+Oh
+I
+do
+not
+want
+you
+to
+look
+so
+old
+Mother
+She
+was
+young
+a
+little
+while
+ago
+Dr
+That
+will
+all
+pass
+away
+That
+is
+only
+her
+condition
+of
+sorrow
+Sp
+The
+little
+Indian
+girl
+Silver
+Star
+put
+her
+hand
+over
+her
+and
+she
+said
+Think
+young
+and
+you
+will
+be
+young
+She
+is
+She
+is
+Thinking
+young
+she
+will
+be
+she
+says
+Now
+we
+go
+with
+her
+Don
+t
+forget
+my
+name
+is
+Gladys
+That
+s
+nicer
+than
+Minnie
+On
+The
+Step
+Are
+we
+going
+to
+Heaven
+to
+God
+Dr
+You
+will
+go
+to
+the
+spirit
+world
+and
+you
+will
+obtain
+understanding
+of
+the
+higher
+things
+of
+life
+Sp
+That
+woman
+always
+said
+God
+is
+Spirit
+God
+is
+Love
+God
+is
+everywhere
+Silver
+Star
+says
+we
+must
+thank
+the
+doctor
+Doctor
+what
+Dr
+Dr
+Wickland
+You
+are
+controlling
+my
+wife
+s
+body
+Sp
+My
+mother
+is
+young
+and
+pretty
+now
+Think
+young
+and
+you
+will
+be
+Silver
+Star
+said
+Can
+I
+come
+back
+here
+sometime
+Dr
+Certainly
+as
+far
+as
+I
+am
+concerned
+Sp
+Don
+t
+think
+of
+me
+as
+Minnie
+On
+The
+Step
+will
+you
+Think
+of
+me
+as
+Gladys
+Watsman
+Thank
+you
+all
+I
+am
+somebody
+now
+I
+ve
+got
+a
+name
+That
+s
+worth
+something
+to
+me
+Don
+t
+you
+want
+to
+be
+my
+Grandpa
+Dr
+Maybe
+Sp
+Thank
+you
+all
+for
+being
+patient
+with
+me
+Goodbye
+Minnie
+On
+The
+Step
+became
+an
+ardent
+helper
+of
+wandering
+spirit
+waifs
+and
+has
+brought
+a
+number
+of
+them
+to
+our
+circle
+for
+understanding
+the
+first
+one
+within
+a
+few
+weeks
+after
+her
+own
+enlightenment
+EXPERIENCE
+JULY
+Spirit
+ANNA
+MARY
+Psychic
+MRS
+WICKLAND
+Doctor
+Good
+Evening
+Do
+you
+know
+anyone
+here
+Spirit
+Somebody
+told
+me
+if
+I
+came
+in
+here
+I
+would
+get
+something
+to
+eat
+Dr
+You
+are
+spiritually
+hungry
+Sp
+Is
+that
+something
+to
+eat
+Dr
+No
+it
+is
+something
+for
+your
+mind
+Sp
+I
+don
+t
+know
+if
+I
+need
+anything
+for
+my
+mind
+I
+want
+something
+for
+my
+stomach
+I
+haven
+t
+had
+anything
+to
+eat
+for
+a
+long
+time
+Isn
+t
+it
+funny
+As
+soon
+as
+you
+talk
+to
+me
+I
+am
+not
+hungry
+I
+was
+awful
+hungry
+but
+now
+I
+m
+not
+Dr
+What
+have
+you
+been
+doing
+Sp
+Nothing
+I
+get
+so
+tired
+of
+doing
+nothing
+that
+I
+don
+t
+know
+what
+to
+do
+It
+is
+tiresome
+to
+have
+nothing
+whatever
+to
+do
+no
+aim
+in
+life
+You
+do
+not
+know
+what
+to
+do
+with
+yourself
+I
+want
+something
+to
+do
+You
+get
+so
+nervous
+when
+you
+do
+nothing
+I
+don
+t
+know
+what
+to
+do
+with
+myself
+I
+want
+to
+go
+here
+there
+and
+everywhere
+and
+when
+I
+get
+there
+I
+want
+to
+be
+some
+place
+else
+I
+get
+so
+tired
+wanting
+to
+know
+what
+I
+should
+do
+The
+road
+is
+always
+best
+on
+the
+other
+side
+Dr
+What
+is
+your
+name
+Sp
+They
+call
+me
+Mary
+but
+my
+name
+is
+Anna
+Mary
+Some
+call
+me
+Mary
+and
+some
+call
+me
+Anna
+Dr
+Where
+did
+your
+father
+and
+mother
+live
+Sp
+I
+don
+t
+know
+my
+mother
+and
+father
+Dr
+How
+old
+are
+you
+Sp
+I
+don
+t
+know
+Dr
+Were
+you
+ever
+in
+California
+Sp
+No
+never
+in
+all
+my
+life
+I
+never
+went
+that
+far
+away
+I
+never
+had
+so
+much
+money
+to
+go
+We
+had
+hot
+summers
+and
+cold
+winters
+Dr
+How
+did
+you
+come
+in
+here
+Sp
+Sure
+enough
+how
+did
+I
+come
+Dr
+Who
+brought
+you
+here
+Sp
+Minnie
+On
+The
+Step
+Dr
+Is
+she
+here
+now
+Sp
+Yes
+Dr
+Did
+you
+both
+live
+in
+the
+same
+place
+Sp
+Yes
+Dr
+Were
+you
+anything
+like
+Minnie
+On
+The
+Step
+Sp
+She
+was
+such
+a
+nice
+little
+girl
+I
+ran
+away
+from
+that
+place
+I
+wanted
+to
+see
+the
+world
+I
+did
+not
+want
+to
+stay
+in
+one
+place
+all
+the
+time
+I
+was
+in
+a
+Home
+where
+there
+were
+lots
+of
+children
+and
+Min
+nie
+On
+The
+Step
+was
+there
+too
+that
+was
+our
+home
+I
+worked
+awfully
+hard
+and
+had
+to
+scrub
+and
+scrub
+and
+carry
+water
+and
+I
+got
+tired
+of
+it
+so
+I
+ran
+away
+They
+always
+said
+I
+was
+foolish
+but
+I
+never
+thought
+I
+was
+Dr
+Ask
+Minnie
+On
+The
+Step
+if
+she
+brought
+you
+here
+Sp
+She
+says
+she
+did
+and
+that
+she
+has
+been
+hunting
+for
+me
+and
+then
+brought
+me
+here
+She
+says
+she
+has
+a
+home
+Staring
+in
+surprise
+For
+God
+s
+sake
+in
+Heaven
+If
+I
+ever
+saw
+such
+a
+nice
+place
+Look
+at
+that
+home
+It
+s
+Minnie
+On
+The
+Step
+s
+It
+s
+beautiful
+She
+says
+it
+is
+hers
+Well
+for
+Heaven
+s
+sake
+alive
+Dr
+Ask
+her
+how
+she
+got
+it
+Sp
+To
+Minnie
+On
+The
+Step
+How
+did
+you
+get
+it
+She
+say
+that
+you
+Dr
+W
+and
+you
+and
+you
+and
+you
+pointing
+to
+audience
+helped
+her
+to
+get
+that
+home
+She
+says
+her
+home
+is
+going
+to
+be
+for
+all
+the
+children
+she
+knew
+when
+she
+was
+at
+the
+Home
+and
+they
+are
+all
+going
+to
+that
+home
+that
+she
+can
+hunt
+up
+She
+s
+so
+happy
+I
+never
+knew
+she
+cared
+for
+me
+because
+she
+was
+a
+little
+better
+than
+I
+was
+For
+Heaven
+s
+sake
+alive
+that
+s
+a
+nice
+home
+Dr
+How
+did
+you
+die
+Sp
+I
+m
+not
+dead
+Can
+t
+you
+hear
+me
+talking
+Why
+there
+s
+Mary
+Bloom
+and
+Charlie
+Hoffman
+I
+don
+t
+like
+Charlie
+Hoff
+man
+He
+was
+stuck
+up
+They
+teased
+me
+He
+always
+got
+other
+boys
+and
+they
+all
+chased
+me
+they
+thought
+I
+was
+a
+horse
+They
+always
+pulled
+my
+hair
+They
+always
+hurt
+me
+those
+boys
+and
+Charlie
+Hoffman
+got
+them
+together
+They
+used
+to
+call
+me
+Tow
+Head
+but
+when
+I
+got
+mad
+they
+were
+scared
+They
+ran
+and
+I
+ran
+after
+them
+Then
+comes
+the
+Matron
+She
+grabbed
+hold
+of
+me
+and
+pulled
+my
+hair
+pretty
+good
+She
+was
+awful
+mad
+when
+they
+took
+me
+back
+Mary
+Bloom
+always
+scrubbed
+with
+me
+She
+says
+she
+don
+t
+have
+to
+scrub
+any
+more
+Mary
+Bloom
+s
+in
+Minnie
+s
+home
+Esther
+Bloom
+Mary
+s
+sister
+is
+here
+too
+Minnie
+says
+now
+I
+must
+be
+a
+good
+girl
+and
+then
+she
+will
+see
+after
+me
+I
+will
+have
+a
+nice
+home
+and
+I
+shall
+have
+something
+to
+do
+Dr
+Do
+you
+know
+who
+your
+mother
+was
+Sp
+I
+was
+always
+told
+my
+mother
+was
+a
+fine
+lady
+I
+know
+she
+lived
+in
+a
+beautiful
+house
+but
+she
+didn
+t
+like
+me
+because
+I
+was
+foolish
+Dr
+Was
+she
+ashamed
+of
+you
+Sp
+She
+never
+cared
+for
+me
+They
+said
+she
+was
+very
+beautiful
+Dr
+Do
+you
+want
+to
+go
+with
+Minnie
+On
+The
+Step
+Sp
+She
+s
+a
+lady
+now
+She
+doesn
+t
+look
+like
+she
+did
+She
+is
+beautiful
+Dr
+What
+does
+she
+say
+Sp
+She
+says
+that
+I
+must
+understand
+that
+I
+am
+in
+the
+spirit
+world
+Oh
+look
+at
+that
+pretty
+lady
+Dr
+What
+does
+she
+say
+Sp
+She
+says
+she
+has
+a
+home
+where
+she
+takes
+care
+of
+little
+waifs
+in
+the
+spirit
+world
+and
+teaches
+them
+the
+higher
+philosophy
+of
+God
+She
+is
+beautiful
+beautiful
+Such
+pretty
+white
+hair
+It
+is
+as
+white
+as
+silver
+When
+she
+smiles
+it
+is
+like
+sunshine
+Now
+she
+says
+Come
+my
+dear
+child
+with
+me
+You
+had
+no
+happiness
+in
+earth
+life
+but
+you
+will
+have
+it
+in
+spirit
+life
+with
+me
+because
+I
+gather
+together
+all
+such
+little
+children
+as
+you
+and
+teach
+them
+the
+real
+lesson
+of
+life
+Dr
+Ask
+the
+lady
+her
+name
+Sp
+She
+says
+her
+name
+is
+Abbie
+Judson
+Lady
+you
+won
+t
+call
+me
+foolish
+will
+you
+Will
+you
+be
+my
+mother
+Can
+I
+call
+you
+mother
+lady
+I
+never
+had
+a
+mother
+Will
+you
+take
+me
+in
+your
+arms
+and
+love
+me
+just
+once
+so
+that
+I
+can
+feel
+what
+mother
+love
+is
+Will
+you
+give
+me
+a
+mother
+s
+kiss
+Will
+you
+I
+never
+knew
+what
+that
+is
+She
+says
+Yes
+child
+I
+will
+be
+your
+mother
+I
+will
+watch
+and
+guide
+you
+You
+will
+have
+a
+home
+with
+me
+in
+the
+beautiful
+land
+beyond
+She
+kisses
+me
+Isn
+t
+she
+lovely
+Please
+love
+me
+a
+little
+more
+lady
+Thank
+God
+now
+I
+m
+happy
+for
+I
+have
+found
+a
+mother
+I
+shall
+try
+to
+be
+good
+to
+her
+then
+she
+will
+be
+my
+mother
+I
+have
+prayed
+to
+God
+many
+times
+for
+a
+mother
+and
+now
+I
+have
+one
+To
+an
+invisible
+Say
+will
+you
+forgive
+me
+for
+slapping
+you
+once
+And
+I
+m
+sorry
+that
+I
+kicked
+you
+but
+I
+got
+so
+mad
+at
+you
+I
+m
+so
+glad
+that
+Minnie
+On
+The
+Step
+brought
+me
+here
+cause
+now
+I
+have
+a
+mother
+Dr
+Now
+you
+will
+go
+to
+the
+spirit
+world
+where
+Happiness
+is
+Heaven
+and
+all
+is
+harmony
+Heaven
+is
+a
+condition
+of
+the
+mind
+Sp
+The
+lady
+says
+I
+must
+go
+with
+her
+now
+Dr
+We
+know
+the
+lady
+you
+speak
+of
+She
+has
+brought
+others
+here
+for
+help
+She
+was
+a
+teacher
+in
+earth
+life
+Sp
+She
+says
+she
+has
+a
+beautiful
+home
+Not
+like
+a
+home
+in
+earth
+life
+but
+a
+home
+where
+we
+shall
+be
+taught
+to
+praise
+God
+in
+every
+way
+Dr
+Think
+yourself
+with
+the
+lady
+and
+you
+will
+become
+disengaged
+from
+this
+body
+Sp
+Glory
+Hallelujah
+Minnie
+says
+that
+when
+I
+come
+with
+the
+lady
+I
+must
+not
+use
+those
+words
+for
+they
+are
+foolish
+But
+that
+s
+the
+way
+I
+always
+do
+talk
+when
+I
+m
+glad
+and
+happy
+Mary
+Bloom
+and
+Minnie
+On
+The
+Step
+say
+I
+must
+thank
+you
+for
+teaching
+me
+to
+go
+with
+them
+You
+can
+call
+me
+Anna
+Mary
+Will
+my
+new
+mother
+be
+ashamed
+of
+me
+I
+can
+t
+read
+cause
+I
+never
+had
+time
+to
+learn
+The
+big
+Home
+where
+I
+was
+gave
+me
+to
+a
+lady
+and
+she
+made
+me
+work
+very
+hard
+I
+got
+sick
+and
+I
+coughed
+very
+hard
+But
+I
+had
+to
+work
+just
+the
+same
+I
+got
+sick
+and
+then
+I
+don
+t
+remember
+any
+more
+Thank
+you
+for
+helping
+me
+Goodbye
+We
+had
+been
+concentrating
+for
+some
+time
+for
+a
+little
+girl
+R
+G
+who
+was
+very
+sensitive
+to
+psychic
+conditionA
+and
+troubled
+constantly
+by
+spirits
+During
+the
+weeks
+preceding
+the
+following
+experience
+she
+had
+been
+very
+disobedient
+developed
+a
+strong
+dislike
+for
+arithmetic
+and
+had
+been
+especially
+perverse
+when
+taken
+into
+the
+city
+shops
+The
+mother
+knowing
+that
+a
+spirit
+was
+influencing
+the
+child
+had
+several
+times
+given
+the
+little
+girl
+a
+cold
+shower
+with
+excellent
+result
+EXPERIENCE
+AUGUST
+Spirit
+LILY
+Patient
+R
+G
+Psychic
+MRS
+WICKLAND
+The
+controlling
+spirit
+stamped
+furiously
+and
+spoke
+angrily
+in
+an
+excited
+childish
+voice
+Spirit
+No
+do
+not
+touch
+me
+No
+no
+I
+don
+t
+want
+your
+hands
+on
+me
+I
+do
+not
+like
+you
+You
+have
+so
+much
+fire
+I
+am
+afraid
+of
+that
+fire
+Static
+treatment
+given
+patient
+Doctor
+Tell
+us
+who
+you
+are
+Sp
+I
+don
+t
+know
+Dr
+Where
+did
+you
+come
+from
+You
+must
+have
+come
+from
+some
+place
+Do
+you
+pay
+for
+your
+board
+Sp
+I
+don
+t
+pay
+for
+it
+but
+I
+always
+get
+something
+to
+eat
+I
+have
+no
+money
+Dr
+Who
+are
+you
+Sp
+I
+said
+I
+didn
+t
+know
+Dr
+Did
+your
+mother
+call
+you
+Jim
+Sp
+I
+m
+no
+boy
+Can
+t
+you
+see
+I
+don
+t
+want
+that
+fire
+on
+my
+back
+any
+more
+no
+I
+don
+t
+Stamping
+feet
+Dr
+Did
+you
+always
+have
+bad
+manners
+Sp
+Why
+did
+you
+take
+me
+away
+from
+where
+I
+was
+I
+have
+no
+place
+to
+go
+You
+made
+me
+get
+away
+with
+fire
+fire
+fire
+Stamping
+I
+want
+to
+be
+with
+that
+little
+girl
+Pointing
+to
+R
+G
+She
+belongs
+to
+me
+Dr
+What
+right
+have
+you
+to
+bother
+that
+little
+girl
+She
+does
+not
+belong
+to
+you
+She
+is
+no
+relation
+of
+yours
+Sp
+Crying
+I
+want
+her
+Dr
+Where
+did
+you
+come
+from
+Can
+t
+you
+understand
+that
+you
+are
+dead
+Sp
+I
+want
+to
+be
+with
+that
+little
+girl
+I
+want
+her
+I
+want
+her
+Crying
+You
+chased
+me
+out
+You
+You
+you
+mean
+thing
+Stamping
+Dr
+I
+m
+very
+glad
+of
+it
+What
+right
+have
+you
+to
+be
+with
+that
+little
+girl
+Sp
+I
+have
+no
+home
+Dr
+Can
+t
+you
+understand
+that
+you
+are
+a
+spirit
+You
+are
+invisible
+to
+us
+Sp
+I
+liked
+to
+ride
+in
+that
+automobile
+We
+had
+such
+nice
+times
+Dr
+You
+will
+not
+ride
+in
+that
+automobile
+any
+more
+You
+are
+going
+to
+the
+spirit
+world
+Sp
+To
+the
+mother
+of
+R
+G
+I
+don
+t
+like
+you
+You
+made
+me
+go
+in
+the
+water
+you
+ugly
+mean
+thing
+I
+like
+to
+ride
+in
+the
+auto
+but
+I
+don
+t
+like
+to
+go
+into
+that
+store
+I
+got
+mad
+I
+want
+that
+little
+girl
+I
+want
+her
+I
+got
+lost
+in
+that
+big
+store
+you
+went
+to
+You
+had
+no
+business
+to
+go
+there
+Dr
+You
+have
+no
+business
+to
+bother
+people
+You
+are
+very
+selfish
+Sp
+I
+got
+fire
+on
+my
+back
+Dr
+You
+will
+get
+more
+fire
+if
+you
+do
+not
+behave
+Sp
+Aren
+t
+you
+ashamed
+to
+give
+a
+little
+girl
+so
+much
+fire
+Dr
+That
+was
+what
+you
+needed
+Sp
+You
+gave
+me
+so
+much
+of
+it
+that
+it
+is
+burning
+my
+back
+yet
+I
+got
+so
+mad
+at
+you
+To
+Mrs
+G
+You
+made
+me
+go
+in
+the
+water
+It
+made
+me
+so
+mad
+at
+you
+I
+don
+t
+like
+the
+water
+She
+took
+me
+here
+and
+there
+in
+that
+store
+Dr
+You
+will
+not
+bother
+that
+little
+girl
+any
+more
+What
+is
+your
+name
+Sp
+My
+name
+is
+Lily
+I
+am
+a
+White
+Lily
+Dr
+You
+must
+not
+be
+so
+selfish
+or
+you
+cannot
+find
+a
+home
+in
+the
+spirit
+world
+Mrs
+G
+Where
+did
+you
+find
+my
+little
+girl
+Sp
+I
+saw
+this
+little
+girl
+so
+I
+picked
+up
+with
+her
+We
+had
+such
+nice
+times
+together
+There
+were
+lots
+of
+things
+to
+play
+with
+Dr
+You
+must
+understand
+that
+you
+no
+longer
+have
+a
+physical
+body
+Do
+you
+know
+that
+you
+are
+in
+California
+Sp
+I
+do
+not
+know
+anything
+Dr
+What
+did
+your
+father
+do
+Sp
+I
+did
+not
+know
+much
+about
+my
+father
+Dr
+Where
+is
+your
+mother
+Sp
+I
+do
+not
+know
+I
+ran
+away
+when
+mother
+spanked
+me
+I
+got
+mad
+at
+my
+mother
+and
+ran
+away
+My
+father
+and
+mother
+put
+me
+in
+a
+place
+with
+lots
+of
+other
+children
+but
+I
+ran
+away
+from
+there
+They
+put
+me
+in
+a
+big
+building
+They
+were
+mean
+and
+so
+was
+I
+They
+always
+teased
+me
+I
+got
+so
+mad
+at
+them
+I
+got
+into
+a
+fight
+and
+then
+I
+ran
+away
+Dr
+Where
+did
+you
+go
+when
+you
+ran
+away
+Sp
+I
+fell
+down
+and
+then
+I
+can
+t
+remember
+what
+happened
+Died
+Sometimes
+it
+seems
+like
+I
+am
+a
+very
+small
+girl
+but
+I
+was
+different
+I
+was
+eleven
+or
+twelve
+years
+old
+and
+after
+a
+while
+I
+was
+a
+little
+girl
+again
+It
+seems
+like
+I
+was
+five
+years
+old
+then
+Dr
+What
+did
+they
+call
+you
+when
+you
+were
+a
+little
+girl
+again
+Sp
+They
+called
+me
+R
+but
+that
+wasn
+t
+my
+name
+After
+I
+fell
+down
+it
+was
+dark
+for
+a
+long
+time
+then
+all
+at
+once
+I
+could
+walk
+and
+play
+with
+that
+little
+girl
+Dr
+Some
+accident
+must
+have
+happened
+to
+you
+when
+you
+ran
+away
+You
+lost
+your
+body
+and
+became
+a
+spirit
+We
+do
+not
+see
+you
+Sp
+I
+don
+t
+see
+you
+either
+Dr
+You
+are
+a
+little
+spit
+fire
+Sp
+You
+are
+a
+real
+bogy
+man
+I
+am
+a
+little
+girl
+and
+can
+t
+take
+care
+of
+myself
+You
+let
+go
+my
+hands
+Dr
+I
+m
+not
+holding
+your
+hands
+I
+am
+holding
+my
+wife
+s
+hands
+Sp
+I
+don
+t
+like
+you
+Dr
+You
+are
+using
+my
+wife
+s
+body
+but
+only
+for
+a
+short
+time
+You
+are
+an
+ignorant
+spirit
+and
+have
+been
+hovering
+around
+that
+little
+girl
+and
+have
+now
+been
+taken
+away
+from
+her
+Sp
+She
+is
+my
+little
+girl
+Dr
+Let
+me
+tell
+you
+something
+You
+cannot
+have
+a
+home
+if
+you
+do
+not
+behave
+yourself
+Intelligent
+spirits
+have
+brought
+you
+here
+and
+allowed
+you
+to
+control
+my
+wife
+s
+body
+so
+that
+we
+might
+help
+you
+You
+will
+find
+friendly
+spirits
+here
+who
+will
+help
+you
+and
+will
+show
+you
+the
+wonderful
+things
+in
+the
+spirit
+world
+There
+you
+will
+find
+happiness
+which
+you
+cannot
+find
+by
+hovering
+around
+the
+earth
+plane
+But
+you
+will
+have
+to
+overcome
+your
+temper
+Sp
+Will
+they
+be
+mean
+to
+me
+Everybody
+shoved
+me
+here
+and
+there
+So
+many
+boys
+teased
+me
+then
+I
+got
+mad
+and
+had
+to
+fight
+Dr
+Now
+you
+must
+go
+with
+Silver
+Star
+a
+little
+Indian
+girl
+who
+will
+be
+the
+best
+friend
+you
+ever
+had
+Forget
+your
+past
+Do
+not
+be
+ugly
+You
+will
+be
+shown
+every
+kindness
+and
+nobody
+will
+tease
+you
+Sp
+I
+always
+got
+so
+much
+whipping
+Dr
+The
+intelligent
+spirits
+will
+help
+you
+to
+progress
+Sp
+Why
+here
+comes
+Happy
+Daisy
+Spirit
+Dr
+Does
+she
+look
+as
+if
+she
+would
+scold
+you
+Sp
+No
+The
+boys
+used
+to
+call
+me
+Red
+Head
+and
+Freckles
+and
+I
+used
+to
+go
+for
+them
+Could
+I
+go
+with
+that
+pretty
+lady
+standing
+there
+Dr
+Yes
+and
+you
+will
+not
+have
+any
+more
+fire
+or
+sparks
+Sp
+You
+are
+sure
+you
+are
+not
+telling
+stories
+Happy
+Daisy
+says
+for
+me
+to
+go
+with
+her
+and
+she
+will
+take
+me
+to
+a
+nice
+home
+Will
+that
+be
+Heaven
+She
+says
+I
+must
+learn
+to
+do
+good
+and
+be
+good
+and
+after
+I
+learn
+I
+can
+come
+back
+and
+help
+this
+little
+girl
+and
+I
+m
+going
+to
+help
+her
+in
+school
+too
+Mrs
+G
+Do
+you
+like
+arithmetic
+Sp
+I
+don
+t
+like
+school
+at
+all
+Now
+I
+will
+go
+They
+say
+I
+am
+going
+to
+school
+but
+I
+don
+t
+like
+school
+Dr
+You
+will
+go
+to
+a
+different
+school
+the
+School
+of
+Life
+Sp
+Can
+t
+I
+have
+blue
+eyes
+and
+light
+curly
+hair
+Can
+I
+have
+it
+I
+want
+to
+be
+beautiful
+Dr
+You
+can
+become
+beautiful
+only
+as
+you
+help
+others
+Think
+beautiful
+thoughts
+and
+do
+kind
+acts
+and
+you
+will
+be
+beautiful
+You
+will
+have
+beauty
+of
+spirit
+Now
+go
+with
+these
+friends
+and
+after
+you
+have
+learned
+how
+to
+be
+of
+service
+you
+can
+help
+little
+R
+Think
+yourself
+with
+the
+others
+and
+you
+will
+be
+there
+Determine
+to
+begin
+a
+new
+life
+Sp
+I
+m
+going
+to
+help
+this
+little
+girl
+Goodbye
+A
+week
+after
+the
+interview
+with
+Lily
+another
+homeless
+spirit
+wanderer
+came
+to
+the
+circle
+a
+quaint
+investigative
+philosopher
+who
+had
+been
+drawn
+into
+the
+aura
+of
+Mrs
+G
+the
+mother
+of
+R
+G
+This
+spirit
+was
+an
+orphan
+who
+had
+known
+Mrs
+G
+in
+childhood
+she
+had
+at
+that
+time
+developed
+a
+strong
+affection
+for
+her
+and
+this
+love
+had
+attracted
+the
+spirit
+to
+Mrs
+G
+although
+she
+had
+not
+recognized
+in
+the
+grown
+woman
+the
+friend
+of
+her
+childhood
+EXPERIENCE
+AUGUST
+Spirit
+LAUGHING
+ELLA
+Patient
+MRS
+G
+Psychic
+MRS
+WICKLAND
+Doctor
+Why
+don
+t
+you
+join
+in
+the
+singing
+Spirit
+I
+never
+saw
+these
+people
+before
+so
+why
+should
+I
+join
+in
+the
+singing
+Dr
+Where
+did
+you
+come
+from
+Sp
+I
+don
+t
+know
+Dr
+We
+should
+like
+to
+know
+more
+about
+you
+Isn
+t
+it
+strange
+that
+you
+should
+be
+here
+Sp
+I
+don
+t
+know
+anything
+about
+it
+I
+shall
+have
+to
+find
+out
+Dr
+Tell
+us
+who
+you
+are
+and
+what
+your
+name
+is
+Sp
+Somebody
+said
+if
+I
+came
+here
+I
+would
+find
+a
+home
+Dr
+You
+certainly
+will
+Sp
+I
+have
+not
+had
+a
+home
+for
+a
+long
+time
+Dr
+What
+have
+you
+been
+doing
+Sp
+Walking
+around
+everywhere
+and
+sleeping
+where
+I
+could
+put
+my
+head
+Dr
+Are
+you
+a
+girl
+a
+man
+a
+woman
+or
+a
+boy
+Sp
+Don
+t
+you
+know
+I
+am
+a
+girl
+Dr
+How
+old
+are
+you
+Sp
+Probably
+but
+I
+m
+not
+sure
+but
+I
+think
+I
+am
+sixteen
+or
+seventeen
+Dr
+Where
+were
+you
+staying
+Sp
+I
+don
+t
+know
+Dr
+Try
+to
+think
+perhaps
+you
+can
+remember
+Sp
+I
+have
+been
+to
+so
+many
+places
+I
+should
+like
+to
+have
+a
+home
+Dr
+Have
+you
+no
+father
+and
+mother
+Sp
+No
+Dr
+Where
+did
+you
+stay
+when
+you
+were
+little
+Sp
+I
+always
+stayed
+in
+a
+big
+place
+where
+there
+were
+many
+children
+We
+were
+all
+together
+We
+used
+to
+fight
+and
+carry
+on
+all
+the
+time
+I
+don
+t
+think
+I
+ever
+had
+a
+mother
+I
+think
+I
+was
+born
+in
+that
+big
+place
+I
+was
+there
+as
+long
+as
+I
+can
+remember
+anything
+It
+was
+a
+big
+place
+with
+lots
+of
+boys
+and
+girls
+Some
+were
+good
+and
+some
+bad
+all
+kinds
+I
+did
+everything
+I
+could
+do
+I
+did
+what
+they
+told
+me
+to
+do
+and
+they
+kept
+me
+doing
+things
+all
+the
+time
+I
+kept
+on
+working
+like
+machinery
+They
+said
+Now
+Ella
+you
+go
+there
+and
+Ella
+you
+go
+there
+and
+after
+a
+little
+while
+it
+was
+Ella
+everywhere
+I
+had
+to
+fix
+so
+many
+little
+boys
+and
+girls
+that
+I
+think
+I
+was
+a
+mother
+to
+them
+all
+Dr
+Were
+they
+fond
+of
+you
+Sp
+They
+all
+came
+around
+me
+and
+I
+had
+to
+do
+things
+for
+them
+That
+was
+my
+work
+and
+I
+helped
+them
+all
+I
+could
+And
+it
+wasn
+t
+always
+easy
+to
+bathe
+and
+dress
+a
+dozen
+little
+children
+They
+were
+very
+noisy
+so
+I
+said
+for
+them
+to
+keep
+quiet
+I
+got
+mad
+sometimes
+You
+know
+I
+tried
+to
+do
+my
+very
+best
+but
+when
+they
+stepped
+on
+my
+toes
+I
+got
+mad
+Dr
+How
+long
+ago
+was
+that
+Sp
+I
+don
+t
+think
+it
+s
+so
+long
+ago
+You
+know
+I
+lost
+my
+way
+I
+went
+out
+walking
+one
+time
+and
+I
+couldn
+t
+find
+my
+way
+back
+Dr
+What
+happened
+after
+that
+Sp
+Nothing
+has
+happened
+I
+have
+been
+walking
+to
+find
+that
+Home
+again
+Dr
+Did
+you
+have
+an
+accident
+Sp
+No
+but
+I
+shall
+have
+to
+keep
+on
+walking
+until
+I
+find
+that
+Home
+Dr
+Do
+you
+want
+to
+understand
+why
+you
+have
+been
+walking
+and
+have
+no
+home
+Sp
+Somebody
+said
+if
+I
+came
+here
+I
+would
+have
+a
+home
+and
+they
+pushed
+me
+in
+and
+before
+I
+knew
+anything
+I
+was
+sitting
+here
+and
+you
+were
+singing
+I
+was
+crying
+and
+a
+girl
+said
+you
+had
+helped
+her
+and
+if
+I
+came
+here
+I
+would
+get
+happy
+When
+I
+walked
+it
+was
+half
+dark
+and
+half
+light
+I
+have
+been
+trying
+to
+find
+a
+home
+When
+I
+was
+with
+those
+children
+I
+had
+to
+work
+hard
+but
+it
+s
+better
+to
+have
+them
+than
+to
+have
+nothing
+to
+do
+I
+would
+rather
+have
+my
+children
+Dr
+Were
+they
+orphans
+like
+yourself
+Sp
+They
+thought
+I
+was
+not
+right
+in
+my
+mind
+but
+I
+was
+as
+good
+as
+any
+of
+them
+Dr
+You
+are
+talking
+to
+us
+but
+we
+cannot
+see
+you
+I
+can
+see
+my
+wife
+but
+not
+you
+Sp
+Your
+wife
+For
+land
+s
+sake
+alive
+Laughing
+heartily
+You
+know
+I
+always
+like
+to
+laugh
+and
+when
+all
+the
+children
+began
+to
+cry
+I
+started
+to
+laugh
+and
+I
+laughed
+and
+laughed
+until
+I
+got
+them
+still
+That
+was
+the
+only
+way
+I
+knew
+to
+get
+them
+all
+still
+when
+they
+were
+crying
+Then
+they
+got
+good
+natured
+again
+If
+you
+laugh
+hard
+when
+somebody
+cries
+they
+will
+stop
+crying
+and
+begin
+to
+laugh
+Sometimes
+they
+called
+me
+Laughing
+Ella
+Dr
+Where
+did
+you
+get
+this
+ring
+Sp
+I
+never
+had
+a
+ring
+before
+Greatly
+pleased
+and
+laughing
+again
+Dr
+This
+is
+not
+your
+hand
+and
+this
+is
+not
+your
+body
+Sp
+What
+are
+you
+talking
+about
+Laughing
+Dr
+It
+may
+seem
+foolish
+to
+you
+but
+it
+is
+the
+truth
+Have
+you
+ever
+heard
+that
+He
+who
+laughs
+last
+laughs
+best
+Ask
+these
+people
+whose
+body
+this
+is
+Sp
+To
+audience
+Is
+this
+my
+body
+Ans
+No
+it
+is
+not
+Sp
+Yes
+it
+is
+Dr
+This
+body
+belongs
+to
+Mrs
+Wickland
+Sp
+Mrs
+Wickland
+Laughing
+Dr
+You
+are
+laughing
+at
+your
+own
+ignorance
+You
+are
+temporarily
+controlling
+Mrs
+Wickland
+s
+body
+Sp
+I
+never
+heard
+such
+funny
+talk
+Dr
+What
+I
+am
+telling
+you
+is
+not
+so
+foolish
+as
+it
+sounds
+You
+lost
+your
+physical
+body
+Probably
+you
+were
+sick
+You
+have
+awakened
+to
+a
+new
+condition
+of
+life
+Sp
+How
+could
+I
+waken
+if
+I
+had
+no
+body
+Dr
+You
+have
+a
+spirit
+body
+Sp
+When
+you
+say
+I
+have
+lost
+my
+body
+do
+you
+mean
+I
+am
+dead
+Dr
+To
+the
+world
+yes
+The
+world
+is
+ignorant
+of
+the
+facts
+When
+a
+person
+loses
+his
+physical
+body
+people
+say
+he
+is
+dead
+That
+is
+wrong
+The
+spirit
+has
+only
+left
+the
+body
+The
+spirit
+is
+the
+real
+person
+the
+body
+is
+merely
+the
+house
+Nobody
+dies
+it
+only
+seems
+so
+Sp
+Yes
+they
+do
+I
+have
+seen
+dead
+people
+I
+knew
+a
+little
+girl
+that
+died
+and
+she
+went
+to
+Heaven
+Dr
+You
+have
+only
+seen
+dead
+bodies
+You
+can
+only
+stay
+here
+a
+short
+time
+then
+you
+will
+have
+to
+leave
+Sp
+Where
+will
+I
+go
+Dr
+To
+the
+spirit
+world
+Sp
+Say
+I
+am
+a
+real
+lady
+I
+have
+a
+necklace
+round
+my
+neck
+Dr
+That
+belongs
+to
+my
+wife
+You
+are
+an
+invisible
+spirit
+and
+have
+been
+wandering
+in
+outer
+darkness
+If
+you
+want
+a
+home
+you
+can
+have
+one
+Sp
+Do
+you
+mean
+Heaven
+Dr
+Jesus
+said
+The
+Kingdom
+of
+God
+is
+within
+you
+Sp
+Jesus
+died
+for
+our
+sins
+and
+if
+we
+are
+good
+when
+we
+die
+we
+will
+go
+to
+Heaven
+and
+be
+with
+the
+angels
+We
+prayed
+all
+the
+time
+in
+the
+Home
+Seeing
+little
+R
+G
+sitting
+beside
+her
+mother
+I
+like
+that
+little
+girl
+over
+there
+I
+have
+seen
+her
+before
+Mrs
+G
+Do
+you
+know
+Lily
+She
+is
+a
+spirit
+who
+was
+here
+last
+week
+Sp
+To
+R
+G
+You
+were
+very
+naughty
+the
+other
+day
+when
+we
+had
+company
+What
+made
+you
+so
+naughty
+Mrs
+G
+That
+other
+girl
+Lily
+made
+her
+behave
+badly
+Sp
+That
+other
+girl
+was
+awfully
+mean
+I
+felt
+like
+spanking
+her
+When
+she
+came
+near
+that
+little
+girl
+R
+G
+changed
+faces
+Dr
+She
+was
+a
+spirit
+and
+was
+influencing
+this
+little
+girl
+You
+are
+also
+a
+spirit
+and
+are
+talking
+through
+my
+wife
+s
+body
+In
+just
+that
+way
+the
+spirit
+of
+that
+girl
+acted
+through
+this
+child
+Sp
+Somebody
+told
+me
+to
+come
+in
+here
+and
+I
+would
+find
+a
+home
+and
+that
+I
+had
+a
+mission
+to
+do
+What
+does
+that
+mean
+Dr
+Probably
+you
+can
+protect
+this
+litle
+girl
+Sp
+They
+say
+I
+am
+going
+to
+be
+a
+watcher
+that
+I
+must
+see
+that
+nobody
+gets
+hold
+of
+her
+I
+don
+t
+know
+what
+they
+mean
+Dr
+That
+will
+all
+be
+explained
+to
+you
+Listen
+to
+a
+little
+Indian
+girl
+whom
+you
+will
+find
+here
+She
+will
+take
+you
+to
+a
+home
+Sp
+Will
+they
+like
+me
+In
+that
+big
+Home
+all
+the
+children
+liked
+me
+because
+I
+made
+them
+laugh
+They
+say
+I
+must
+stay
+around
+this
+little
+girl
+and
+protect
+her
+from
+influences
+Dr
+That
+means
+spirit
+influences
+Sp
+I
+am
+going
+to
+look
+into
+that
+business
+Dr
+You
+will
+need
+to
+have
+understanding
+first
+Do
+you
+see
+others
+here
+Sp
+I
+see
+many
+girls
+jumping
+around
+and
+feeling
+happy
+There
+is
+a
+nice
+lady
+here
+and
+she
+says
+her
+name
+is
+Pretty
+Girl
+She
+s
+awfully
+pretty
+There
+s
+a
+young
+girl
+and
+she
+says
+I
+can
+come
+with
+her
+She
+says
+she
+brought
+me
+here
+They
+say
+I
+always
+tried
+to
+do
+everything
+I
+could
+to
+help
+now
+they
+are
+going
+to
+take
+care
+of
+me
+Sometimes
+when
+I
+got
+a
+whipping
+I
+thought
+Well
+maybe
+I
+needed
+it
+I
+cried
+for
+a
+few
+minutes
+and
+then
+I
+went
+into
+my
+little
+corner
+and
+said
+Now
+Ella
+you
+were
+naughty
+and
+you
+needed
+that
+spanking
+I
+thought
+about
+it
+for
+a
+while
+then
+I
+began
+to
+laugh
+and
+I
+never
+felt
+the
+spanking
+at
+all
+When
+you
+feel
+good
+inside
+from
+laughing
+you
+can
+t
+feel
+things
+on
+the
+outside
+You
+just
+try
+it
+Dr
+Now
+you
+must
+go
+with
+these
+friends
+Sp
+They
+say
+when
+I
+get
+understanding
+I
+am
+going
+to
+be
+a
+little
+helper
+To
+R
+G
+Don
+t
+forget
+when
+you
+feel
+naughty
+just
+laugh
+and
+then
+you
+won
+t
+be
+naughty
+When
+I
+get
+to
+be
+nurse
+girl
+for
+that
+little
+girl
+I
+won
+t
+let
+anyone
+in
+I
+will
+see
+that
+they
+stay
+out
+I
+will
+show
+you
+Dr
+Where
+did
+you
+live
+Sp
+In
+Kansas
+Mrs
+G
+had
+formerly
+lived
+in
+Kansas
+I
+had
+to
+dress
+ten
+or
+twelve
+of
+the
+children
+and
+wash
+them
+and
+put
+them
+to
+bed
+Some
+went
+to
+school
+and
+some
+went
+to
+play
+Mrs
+G
+What
+town
+did
+you
+live
+in
+Sp
+Why
+near
+H
+Verified
+later
+Mrs
+G
+Do
+you
+remember
+the
+name
+K
+Superintendent
+of
+orphanage
+at
+H
+Sp
+Why
+yes
+Mrs
+G
+Do
+you
+know
+M
+Assistant
+Matron
+in
+charge
+of
+girls
+Sp
+She
+was
+in
+another
+room
+There
+were
+some
+naughty
+girls
+in
+M
+s
+room
+Sometimes
+even
+the
+Matron
+could
+not
+control
+some
+of
+the
+girls
+even
+when
+she
+spanked
+them
+so
+I
+had
+to
+go
+to
+them
+You
+know
+spanking
+isn
+t
+good
+all
+the
+time
+When
+the
+Matron
+spanked
+the
+little
+ones
+and
+they
+cried
+I
+would
+go
+to
+them
+after
+she
+had
+gone
+and
+make
+them
+laugh
+A
+good
+laugh
+always
+made
+them
+forget
+the
+spanking
+Mrs
+G
+Do
+you
+remember
+seeing
+me
+when
+I
+was
+a
+little
+girl
+Sp
+Staring
+then
+excited
+Yes
+Why
+yes
+I
+remember
+you
+now
+But
+you
+were
+not
+there
+all
+the
+time
+Mrs
+G
+came
+to
+the
+orphanage
+occasionally
+as
+a
+visitor
+You
+used
+to
+come
+and
+then
+go
+away
+You
+always
+had
+such
+pretty
+hair
+and
+you
+used
+to
+have
+such
+pretty
+dresses
+Do
+you
+remember
+you
+had
+a
+parasol
+and
+walked
+around
+like
+a
+big
+lady
+Mrs
+G
+Do
+you
+remember
+the
+time
+I
+fell
+into
+the
+water
+Sp
+Oh
+my
+yes
+and
+everybody
+was
+so
+excited
+and
+you
+got
+wringing
+wet
+and
+your
+Grandmother
+scolded
+you
+I
+took
+a
+liking
+to
+you
+The
+time
+you
+went
+into
+the
+water
+I
+felt
+so
+sorry
+for
+you
+You
+spoiled
+your
+nice
+dress
+That
+was
+a
+long
+long
+time
+ago
+Now
+I
+remember
+lots
+of
+things
+My
+eyes
+seem
+to
+open
+I
+took
+an
+awful
+cold
+and
+I
+got
+sore
+throat
+and
+then
+I
+remember
+I
+went
+to
+sleep
+I
+always
+liked
+you
+and
+now
+I
+ve
+found
+you
+again
+I
+am
+going
+to
+help
+and
+stop
+walking
+to
+find
+that
+home
+Mrs
+G
+I
+am
+grown
+now
+and
+married
+and
+this
+little
+girl
+is
+my
+child
+Spirits
+have
+been
+bothering
+her
+for
+some
+time
+Sp
+I
+will
+help
+you
+I
+have
+found
+you
+and
+we
+will
+be
+together
+again
+Silver
+Star
+the
+little
+Indian
+girl
+says
+I
+must
+learn
+to
+protect
+your
+little
+girl
+Dr
+The
+first
+thing
+you
+must
+do
+is
+to
+go
+to
+the
+spirit
+world
+and
+learn
+about
+your
+new
+conditions
+then
+you
+will
+understand
+how
+to
+help
+someone
+else
+Sp
+I
+will
+do
+all
+I
+can
+Now
+I
+will
+say
+Good
+Night
+but
+I
+will
+come
+again
+Don
+t
+forget
+Laughing
+Ella
+CHAPTER
+XI
+Materialism
+and
+Indifference
+THE
+binding
+influence
+of
+skepticism
+of
+mental
+apathy
+and
+unconcern
+regarding
+the
+higher
+life
+is
+so
+powerful
+after
+transition
+that
+many
+are
+held
+in
+a
+condition
+of
+helpless
+despair
+darkness
+bewilderment
+and
+rebellion
+often
+clinging
+to
+mortals
+as
+their
+only
+means
+of
+expression
+Some
+years
+ago
+a
+friend
+of
+ours
+Mrs
+F
+W
+was
+living
+in
+New
+York
+very
+happily
+married
+and
+leading
+an
+active
+normal
+life
+She
+had
+an
+understanding
+of
+the
+higher
+laws
+of
+life
+but
+her
+husband
+although
+devoted
+to
+her
+maintained
+the
+viewpoint
+of
+a
+materialist
+and
+fatalist
+Believing
+in
+no
+form
+of
+religion
+Mr
+F
+W
+was
+convinced
+that
+death
+ended
+all
+and
+had
+often
+declared
+that
+if
+his
+wife
+should
+pass
+away
+he
+would
+commit
+suicide
+and
+frequently
+urged
+her
+to
+promise
+that
+if
+he
+passed
+away
+first
+she
+would
+take
+her
+life
+but
+to
+this
+she
+would
+not
+consent
+After
+a
+brief
+illness
+this
+gentleman
+suddenly
+passed
+away
+but
+his
+wife
+could
+still
+see
+him
+very
+distinctly
+especially
+at
+night
+when
+he
+repeatedly
+awakened
+her
+frightening
+her
+so
+that
+she
+could
+not
+sleep
+Unconscious
+of
+his
+true
+condition
+he
+still
+sensed
+that
+some
+thing
+strange
+had
+occurred
+and
+wishing
+to
+remove
+the
+barrier
+which
+separated
+him
+from
+his
+wife
+he
+constantly
+urged
+her
+to
+come
+to
+him
+calling
+insistently
+Kill
+yourself
+you
+must
+come
+to
+me
+I
+want
+you
+and
+I
+will
+finally
+get
+you
+so
+kill
+yourself
+now
+The
+continual
+cry
+of
+Kill
+yourself
+was
+with
+Mrs
+F
+W
+day
+and
+night
+until
+she
+feared
+for
+her
+own
+safety
+Anxious
+to
+prevent
+any
+rash
+act
+on
+her
+part
+she
+left
+New
+York
+and
+came
+to
+us
+in
+Chicago
+for
+assistance
+During
+an
+interview
+the
+spirit
+of
+F
+W
+was
+allowed
+to
+control
+Mrs
+Wickland
+and
+when
+he
+found
+himself
+sitting
+beside
+his
+wife
+he
+grasped
+her
+hand
+kissed
+her
+wedding
+ring
+and
+asked
+if
+she
+were
+angry
+with
+him
+since
+she
+would
+not
+answer
+him
+when
+he
+spoke
+to
+her
+Then
+seizing
+her
+in
+his
+arms
+he
+kissed
+her
+frantically
+and
+crushed
+her
+in
+so
+powerful
+an
+embrace
+that
+she
+could
+not
+free
+herself
+and
+called
+for
+aid
+I
+explained
+to
+the
+spirit
+that
+he
+was
+controlling
+a
+body
+not
+his
+own
+and
+that
+he
+had
+passed
+out
+of
+the
+physical
+life
+When
+he
+at
+last
+realized
+the
+situation
+his
+regret
+for
+having
+unintentionally
+annoyed
+his
+wife
+was
+profound
+and
+he
+was
+eager
+to
+learn
+the
+higher
+laws
+in
+order
+to
+understand
+how
+he
+might
+help
+her
+Mrs
+F
+W
+then
+returned
+to
+New
+York
+and
+experienced
+no
+f
+urther
+disturbance
+F
+W
+became
+a
+loyal
+member
+of
+the
+Mercy
+Band
+and
+in
+several
+of
+many
+communications
+since
+received
+from
+him
+he
+related
+the
+bewilderment
+of
+one
+suddenly
+finding
+himself
+on
+the
+spirit
+side
+of
+life
+without
+understanding
+EXPERIENCE
+NOVEMBER
+Spirit
+F
+W
+Psychic
+MRS
+WICKLAND
+Well
+here
+I
+am
+again
+I
+want
+to
+come
+in
+to
+tell
+you
+that
+I
+have
+not
+gone
+I
+have
+to
+speak
+through
+this
+instrument
+but
+otherwise
+I
+am
+here
+to
+help
+you
+all
+do
+the
+good
+work
+you
+are
+doing
+and
+you
+know
+I
+am
+always
+here
+ready
+to
+do
+what
+I
+can
+to
+help
+you
+and
+also
+to
+help
+all
+who
+are
+in
+trouble
+I
+want
+to
+thank
+you
+for
+having
+helped
+me
+otherwise
+my
+wife
+and
+I
+would
+be
+in
+trouble
+and
+through
+my
+own
+fault
+I
+would
+not
+listen
+to
+the
+great
+wonders
+of
+the
+life
+beyond
+When
+I
+was
+in
+my
+parents
+home
+my
+parents
+were
+so
+orthodox
+so
+strong
+in
+their
+belief
+that
+they
+condemned
+every
+one
+who
+did
+not
+believe
+as
+they
+did
+and
+they
+hypnotized
+themselves
+with
+the
+idea
+that
+nothing
+was
+right
+except
+what
+they
+thought
+I
+could
+not
+live
+in
+that
+atmosphere
+and
+I
+left
+home
+I
+was
+only
+a
+boy
+when
+I
+left
+home
+and
+why
+did
+I
+go
+Because
+the
+atmosphere
+was
+so
+strongly
+orthodox
+that
+it
+drove
+me
+away
+I
+could
+not
+believe
+as
+my
+parents
+did
+and
+they
+said
+if
+I
+did
+not
+I
+was
+a
+sinner
+I
+was
+not
+a
+sinner
+and
+I
+could
+not
+believe
+as
+they
+did
+so
+I
+ran
+away
+from
+home
+I
+am
+not
+sorry
+that
+I
+left
+for
+I
+learned
+to
+know
+something
+of
+the
+outside
+world
+I
+had
+my
+troubles
+but
+I
+learned
+from
+them
+I
+learned
+the
+condition
+outside
+of
+the
+church
+and
+I
+learned
+how
+to
+battle
+for
+myself
+but
+I
+was
+bitter
+and
+so
+hard
+toward
+churches
+that
+I
+would
+not
+have
+anything
+to
+do
+with
+any
+religion
+I
+had
+heard
+so
+much
+of
+it
+through
+childhood
+and
+had
+seen
+too
+much
+of
+what
+was
+going
+on
+in
+the
+churches
+I
+do
+not
+mean
+that
+all
+churches
+are
+alike
+but
+you
+will
+find
+that
+when
+there
+is
+too
+much
+orthodoxy
+the
+people
+are
+hypnotized
+and
+feel
+they
+are
+so
+good
+that
+no
+matter
+what
+they
+do
+whether
+they
+are
+right
+or
+wrong
+they
+are
+right
+because
+they
+cannot
+do
+wrong
+They
+are
+so
+holy
+that
+even
+the
+wrong
+they
+do
+is
+considered
+right
+I
+traveled
+and
+saw
+the
+world
+but
+I
+had
+a
+great
+longing
+for
+home
+I
+came
+home
+again
+after
+I
+had
+seen
+enough
+of
+the
+world
+and
+I
+thought
+I
+would
+remain
+with
+my
+parents
+But
+the
+same
+conditions
+were
+still
+there
+I
+wanted
+to
+stay
+at
+home
+to
+do
+my
+duty
+and
+work
+but
+I
+could
+not
+I
+felt
+as
+if
+I
+were
+being
+crushed
+by
+orthodoxy
+so
+I
+went
+away
+again
+I
+traveled
+still
+further
+and
+I
+had
+new
+experiences
+I
+opened
+my
+heart
+and
+tried
+to
+look
+for
+the
+brighter
+and
+happier
+side
+of
+life
+Later
+on
+I
+met
+one
+who
+loved
+me
+one
+who
+made
+a
+home
+for
+me
+That
+was
+the
+first
+time
+I
+felt
+I
+really
+had
+a
+home
+and
+it
+was
+the
+first
+time
+in
+my
+life
+that
+I
+was
+happy
+We
+had
+only
+a
+few
+short
+years
+of
+happiness
+together
+on
+earth
+but
+those
+few
+years
+will
+always
+be
+with
+me
+I
+did
+not
+think
+there
+was
+a
+life
+after
+this
+I
+did
+not
+believe
+in
+anything
+I
+was
+tired
+of
+orthodoxy
+and
+everything
+else
+I
+thought
+when
+I
+died
+that
+would
+be
+the
+end
+and
+there
+would
+be
+no
+more
+That
+was
+also
+wrong
+Do
+not
+let
+us
+go
+to
+one
+side
+of
+the
+road
+or
+the
+other
+but
+let
+us
+stay
+in
+the
+middle
+and
+investigate
+everything
+Find
+the
+truth
+and
+stay
+in
+that
+narrow
+path
+the
+path
+of
+reason
+and
+understanding
+of
+God
+s
+wonderful
+manifestations
+I
+passed
+to
+the
+other
+side
+of
+life
+with
+the
+thought
+that
+there
+was
+nothing
+after
+death
+I
+passed
+on
+very
+suddenly
+When
+death
+came
+it
+was
+like
+a
+sleep
+I
+woke
+up
+and
+saw
+my
+dear
+little
+wife
+crying
+she
+was
+very
+sad
+but
+I
+did
+not
+realize
+that
+the
+change
+had
+taken
+place
+She
+did
+not
+listen
+to
+what
+I
+said
+she
+did
+not
+seem
+to
+hear
+I
+called
+to
+her
+and
+asked
+what
+was
+the
+trouble
+but
+she
+did
+not
+speak
+to
+me
+I
+wondered
+what
+was
+the
+matter
+for
+we
+loved
+each
+other
+dearly
+I
+began
+to
+grow
+stronger
+and
+I
+did
+not
+want
+to
+leave
+her
+I
+came
+in
+direct
+contact
+with
+her
+and
+felt
+that
+she
+must
+come
+to
+me
+and
+be
+with
+me
+for
+we
+had
+never
+been
+parted
+I
+was
+attracted
+to
+her
+through
+her
+sadness
+and
+I
+felt
+she
+must
+come
+to
+me
+I
+did
+not
+realize
+the
+change
+and
+I
+knew
+she
+wanted
+to
+be
+where
+I
+was
+so
+I
+made
+up
+my
+mind
+that
+she
+was
+coming
+to
+me
+Before
+I
+knew
+it
+I
+was
+in
+her
+magnetic
+aura
+I
+stayed
+there
+because
+I
+could
+not
+get
+away
+I
+was
+unhappy
+she
+was
+unhappy
+But
+I
+thank
+God
+she
+had
+an
+understanding
+of
+the
+life
+hereafter
+She
+knew
+the
+condition
+I
+was
+in
+and
+she
+wanted
+to
+free
+herself
+from
+the
+influence
+I
+was
+throwing
+on
+her
+so
+she
+came
+to
+these
+dear
+people
+Dr
+W
+s
+I
+was
+helped
+and
+so
+was
+she
+We
+would
+both
+have
+been
+miserable
+if
+she
+had
+not
+understood
+for
+I
+did
+not
+know
+about
+the
+life
+after
+this
+and
+I
+did
+not
+care
+I
+want
+to
+give
+a
+warning
+to
+all
+of
+you
+here
+do
+not
+doubt
+the
+next
+life
+Some
+day
+you
+will
+all
+have
+to
+go
+the
+same
+way
+Let
+us
+investigate
+let
+us
+know
+the
+truth
+before
+we
+pass
+on
+to
+the
+Great
+Beyond
+so
+we
+may
+go
+with
+open
+eyes
+and
+know
+where
+we
+are
+going
+with
+a
+definite
+knowledge
+If
+my
+wife
+had
+not
+had
+understanding
+I
+would
+have
+made
+her
+take
+her
+own
+life
+then
+where
+would
+we
+have
+been
+There
+are
+many
+passing
+from
+earth
+life
+who
+are
+in
+a
+similar
+state
+They
+find
+themselves
+in
+somebody
+s
+magnetic
+aura
+and
+cannot
+get
+out
+and
+then
+they
+obsess
+that
+person
+I
+wanted
+to
+get
+out
+of
+my
+misery
+but
+I
+did
+not
+know
+how
+and
+the
+only
+way
+I
+could
+think
+of
+was
+that
+my
+wife
+should
+come
+to
+me
+When
+there
+is
+an
+understanding
+of
+life
+then
+one
+cannot
+be
+in
+such
+a
+situation
+as
+I
+was
+when
+I
+passed
+to
+the
+spirit
+side
+of
+life
+I
+want
+to
+thank
+you
+all
+for
+helping
+me
+Since
+I
+have
+been
+helping
+other
+unfortunate
+spirits
+that
+cannot
+see
+and
+do
+not
+know
+of
+the
+higher
+life
+I
+am
+happy
+So
+I
+am
+working
+and
+now
+I
+can
+be
+with
+my
+dear
+wife
+to
+help
+and
+guide
+her
+Learn
+all
+you
+can
+of
+the
+wonderful
+life
+beyond
+I
+wish
+every
+one
+of
+you
+here
+would
+do
+your
+part
+to
+spread
+the
+truth
+that
+there
+is
+a
+life
+after
+this
+and
+that
+we
+must
+find
+it
+If
+we
+do
+not
+learn
+this
+while
+in
+the
+body
+we
+must
+do
+so
+when
+we
+reach
+the
+other
+side
+Many
+many
+times
+we
+are
+sorry
+that
+we
+did
+not
+look
+into
+the
+truth
+before
+we
+passed
+out
+of
+earth
+life
+I
+want
+to
+say
+a
+few
+words
+to
+the
+two
+young
+girls
+who
+are
+about
+to
+leave
+here
+One
+had
+been
+a
+patient
+the
+other
+her
+companion
+When
+you
+leave
+keep
+in
+your
+hearts
+what
+you
+have
+learned
+Remember
+it
+and
+learn
+more
+because
+you
+will
+have
+to
+protect
+yourselves
+Learn
+all
+you
+can
+Help
+others
+in
+similar
+trouble
+and
+you
+will
+help
+yourself
+and
+gain
+strength
+Now
+that
+you
+have
+found
+the
+truth
+do
+not
+put
+your
+light
+under
+a
+bushel
+Helping
+others
+will
+strengthen
+you
+You
+will
+receive
+strength
+and
+power
+to
+keep
+well
+and
+you
+will
+not
+then
+be
+obsessed
+any
+more
+Each
+and
+every
+one
+should
+be
+proud
+to
+help
+spread
+the
+truth
+because
+there
+is
+a
+wave
+of
+obsession
+going
+on
+everywhere
+Let
+us
+all
+do
+our
+part
+and
+do
+our
+work
+while
+we
+are
+here
+gaining
+all
+the
+knowledge
+of
+the
+life
+beyond
+that
+we
+can
+This
+is
+F
+W
+Goodbye
+EXPERIENCE
+JANUARY
+Spirit
+F
+W
+Psychic
+MRS
+WICKLAND
+How
+do
+you
+do
+Don
+t
+you
+know
+me
+I
+think
+you
+should
+This
+is
+F
+W
+The
+time
+must
+come
+when
+there
+will
+be
+circles
+of
+this
+kind
+in
+every
+little
+society
+every
+church
+Then
+people
+will
+not
+be
+taken
+to
+the
+insane
+asylum
+they
+will
+be
+helped
+Many
+of
+the
+poor
+afflicted
+ones
+who
+are
+in
+the
+asylums
+are
+controlled
+by
+spirits
+and
+should
+be
+helped
+but
+most
+persons
+think
+they
+are
+not
+worth
+bothering
+about
+They
+prefer
+to
+send
+people
+to
+the
+insane
+asylum
+and
+let
+them
+stay
+there
+We
+must
+not
+condemn
+the
+spirits
+who
+are
+controlling
+sensitives
+because
+they
+were
+not
+taught
+regarding
+the
+higher
+life
+while
+in
+the
+physical
+and
+have
+no
+knowledge
+of
+it
+Many
+believe
+that
+after
+death
+they
+will
+go
+straight
+to
+Heaven
+and
+will
+see
+God
+on
+a
+throne
+and
+there
+they
+will
+sit
+and
+sing
+and
+eat
+figs
+and
+all
+that
+When
+I
+was
+a
+boy
+my
+father
+and
+mother
+were
+very
+religious
+My
+father
+professed
+holiness
+and
+the
+environment
+was
+such
+that
+I
+felt
+as
+if
+I
+were
+being
+pulled
+to
+pieces
+I
+could
+not
+stand
+the
+atmosphere
+at
+home
+My
+father
+and
+mother
+were
+good
+people
+but
+had
+such
+a
+narrow
+way
+of
+thinking
+that
+I
+felt
+I
+was
+in
+a
+cage
+so
+I
+ran
+away
+when
+I
+was
+only
+a
+child
+I
+had
+many
+struggles
+and
+many
+hardships
+but
+I
+thank
+God
+today
+that
+I
+ran
+away
+I
+learned
+many
+bitter
+lessons
+during
+my
+life
+but
+I
+also
+learned
+not
+to
+be
+a
+mere
+believer
+and
+when
+I
+reached
+the
+spirit
+side
+of
+life
+and
+received
+an
+explanation
+of
+my
+changed
+condition
+I
+was
+not
+held
+back
+by
+any
+orthodox
+religious
+doctrine
+When
+I
+was
+on
+earth
+I
+made
+the
+best
+I
+could
+of
+circumstances
+but
+when
+it
+came
+to
+religion
+I
+did
+not
+believe
+in
+anything
+I
+felt
+that
+death
+was
+all
+and
+there
+was
+nothing
+more
+I
+would
+not
+and
+could
+not
+believe
+as
+my
+parents
+did
+I
+felt
+God
+was
+the
+Life
+of
+all
+things
+not
+an
+angry
+God
+who
+threatened
+hell
+and
+damnation
+as
+the
+churches
+taught
+I
+felt
+there
+was
+nothing
+after
+this
+and
+that
+after
+death
+all
+would
+be
+ended
+I
+made
+up
+my
+mind
+to
+do
+my
+best
+while
+on
+earth
+I
+went
+to
+church
+sometimes
+I
+traveled
+around
+saw
+the
+world
+and
+gained
+experience
+which
+is
+worth
+a
+great
+deal
+to
+me
+now
+After
+I
+was
+married
+my
+wife
+taught
+me
+a
+little
+about
+the
+other
+side
+of
+life
+a
+more
+cheerful
+view
+than
+the
+orthodox
+one
+still
+I
+did
+not
+believe
+However
+there
+was
+a
+little
+light
+of
+understanding
+I
+wanted
+my
+wife
+to
+promise
+that
+if
+I
+should
+die
+first
+she
+would
+go
+too
+and
+if
+she
+went
+first
+I
+would
+follow
+but
+she
+would
+not
+make
+that
+promise
+because
+she
+understood
+more
+of
+the
+next
+life
+than
+I
+did
+The
+time
+came
+when
+I
+had
+to
+leave
+and
+very
+suddenly
+I
+seemed
+to
+go
+into
+a
+pleasant
+sleep
+of
+rest
+and
+I
+woke
+up
+where
+It
+says
+in
+the
+Bible
+Where
+your
+treasure
+is
+there
+will
+your
+heart
+be
+also
+My
+treasure
+was
+my
+dear
+little
+wife
+and
+when
+I
+woke
+up
+I
+found
+myself
+in
+her
+magnetic
+aura
+She
+would
+not
+pay
+any
+attention
+to
+me
+and
+I
+wondered
+what
+could
+be
+the
+trouble
+and
+why
+she
+would
+not
+talk
+to
+me
+when
+I
+spoke
+to
+her
+I
+felt
+queer
+and
+I
+did
+not
+know
+where
+I
+was
+Death
+is
+only
+a
+sleep
+a
+sleep
+as
+natural
+as
+that
+which
+you
+have
+every
+night
+on
+earth
+When
+one
+awakes
+from
+the
+sleep
+of
+death
+everything
+is
+so
+natural
+that
+you
+feel
+you
+are
+still
+with
+your
+relatives
+Then
+if
+you
+get
+into
+a
+person
+s
+magnetic
+aura
+you
+live
+right
+with
+him
+and
+you
+are
+there
+I
+was
+in
+my
+wife
+s
+aura
+and
+could
+not
+realize
+why
+I
+should
+have
+to
+go
+wherever
+she
+went
+and
+not
+be
+an
+independent
+individual
+as
+I
+used
+to
+be
+and
+it
+annoyed
+me
+I
+felt
+desperate
+I
+felt
+that
+my
+wife
+must
+come
+with
+me
+I
+did
+not
+know
+where
+but
+I
+wanted
+her
+My
+love
+for
+her
+was
+so
+strong
+that
+I
+tormented
+her
+against
+my
+will
+because
+I
+had
+no
+understanding
+of
+the
+real
+life
+on
+the
+other
+side
+I
+loved
+my
+wife
+dearly
+yet
+I
+disturbed
+her
+for
+I
+did
+not
+know
+any
+better
+and
+she
+was
+tormented
+tormented
+by
+the
+one
+who
+loved
+and
+idolized
+her
+But
+she
+came
+to
+these
+kind
+people
+Dr
+W
+s
+and
+was
+freed
+and
+I
+thank
+you
+as
+I
+have
+many
+times
+before
+for
+having
+helped
+us
+both
+I
+had
+to
+learn
+by
+experience
+When
+we
+know
+about
+the
+other
+side
+we
+are
+happy
+to
+go
+and
+meet
+friends
+who
+have
+already
+gone
+over
+It
+is
+very
+necessary
+for
+every
+one
+to
+know
+the
+truth
+because
+we
+all
+have
+to
+take
+that
+journey
+I
+know
+now
+that
+God
+is
+Love
+God
+is
+everywhere
+Since
+He
+is
+Love
+and
+Wisdom
+He
+knows
+the
+past
+present
+and
+future
+How
+could
+He
+then
+have
+created
+a
+world
+only
+to
+lose
+control
+of
+it
+For
+if
+He
+later
+found
+the
+people
+full
+of
+sin
+He
+certainly
+must
+have
+lost
+control
+of
+His
+creation
+Yet
+the
+churches
+teach
+that
+having
+lost
+control
+of
+the
+world
+God
+created
+a
+person
+for
+the
+particular
+purpose
+of
+being
+sacrificed
+and
+that
+those
+who
+believe
+this
+will
+win
+a
+golden
+crown
+Let
+us
+not
+misconstrue
+God
+God
+knows
+everything
+and
+He
+reveals
+Himself
+to
+Himself
+Everything
+has
+life
+in
+Nature
+Where
+can
+you
+go
+without
+Life
+without
+God
+He
+is
+in
+everything
+Humanity
+should
+know
+that
+each
+is
+a
+part
+of
+this
+wonderful
+life
+Nothing
+should
+be
+condemned
+because
+everything
+in
+Nature
+is
+perfect
+Any
+disturbances
+in
+Nature
+are
+only
+for
+development
+As
+soon
+as
+you
+have
+trouble
+and
+something
+disturbs
+you
+you
+begin
+to
+long
+for
+a
+higher
+life
+you
+want
+to
+attain
+it
+and
+you
+work
+for
+that
+end
+Life
+goes
+on
+on
+the
+other
+side
+and
+it
+is
+always
+progressive
+Teach
+children
+the
+truth
+Teach
+the
+higher
+things
+of
+life
+All
+is
+God
+Now
+I
+must
+go
+Good
+Night
+In
+the
+following
+case
+the
+apathy
+and
+characteristics
+of
+the
+spirit
+were
+recognized
+by
+Mrs
+H
+W
+the
+mother
+of
+the
+patient
+who
+had
+known
+the
+spirit
+well
+during
+his
+earth
+life
+He
+was
+the
+son
+of
+a
+neighbor
+and
+his
+statements
+were
+confirmed
+by
+the
+patient
+and
+her
+mother
+who
+were
+from
+Chicago
+and
+both
+present
+in
+the
+circle
+EXPERIENCE
+DECEMBER
+Spirit
+FRANK
+BERGQUIST
+Patient
+MRS
+A
+Psychic
+MRS
+WICKLAND
+Doctor
+Who
+are
+you
+friend
+Some
+sleepy
+one
+Wake
+up
+and
+tell
+us
+who
+you
+are
+Have
+you
+found
+a
+happy
+condition
+or
+not
+Spirit
+No
+Dr
+Why
+not
+Sp
+I
+don
+t
+know
+Dr
+What
+was
+the
+trouble
+Didn
+t
+you
+have
+any
+faith
+or
+did
+you
+have
+too
+much
+Sp
+I
+don
+t
+know
+what
+is
+the
+matter
+with
+me
+Dr
+Do
+you
+know
+who
+you
+are
+Sp
+No
+Dr
+Can
+t
+you
+recall
+your
+name
+or
+anything
+about
+yourself
+Do
+you
+know
+how
+long
+you
+have
+been
+dead
+Sp
+I
+don
+t
+know
+Dr
+Where
+do
+you
+think
+you
+are
+Sp
+I
+don
+t
+know
+Dr
+Have
+you
+been
+sleeping
+for
+many
+years
+Sp
+Not
+many
+I
+don
+t
+feel
+natural
+Dr
+Does
+it
+interest
+you
+to
+know
+the
+reason
+Sp
+I
+can
+t
+find
+out
+I
+have
+asked
+many
+but
+they
+do
+not
+understand
+and
+they
+do
+not
+know
+They
+cannot
+inform
+me
+Dr
+They
+have
+been
+in
+darkness
+as
+well
+as
+yourself
+What
+have
+you
+been
+doing
+recently
+Sp
+Doing
+nothing
+Dr
+Don
+t
+you
+get
+tired
+of
+nothing
+Sp
+It
+is
+monotonous
+but
+what
+can
+you
+do
+Dr
+Acquire
+understanding
+Sp
+How
+can
+you
+find
+it
+Dr
+You
+cannot
+find
+understanding
+you
+have
+to
+develop
+your
+mind
+You
+are
+controlling
+a
+woman
+s
+body
+yet
+possibly
+you
+claim
+to
+be
+a
+man
+Are
+you
+a
+man
+or
+a
+woman
+Sp
+I
+am
+a
+man
+but
+have
+been
+a
+woman
+so
+long
+I
+do
+not
+know
+Confusing
+himself
+with
+the
+patient
+Mrs
+A
+Dr
+You
+have
+been
+a
+woman
+a
+long
+time
+Have
+you
+caused
+trouble
+Sp
+Not
+that
+I
+know
+of
+Dr
+Don
+t
+you
+find
+that
+things
+do
+not
+seem
+just
+right
+Sp
+It
+has
+been
+queer
+I
+told
+you
+that
+before
+Dr
+Did
+anything
+disturb
+you
+Sp
+A
+whole
+lot
+Dr
+What
+woke
+you
+up
+and
+disturbed
+you
+and
+caused
+you
+to
+come
+here
+Sp
+I
+don
+t
+know
+Dr
+Have
+you
+been
+disturbed
+at
+all
+Have
+you
+had
+any
+peculiar
+experience
+lately
+Sp
+Yes
+Dr
+In
+what
+way
+Sp
+In
+many
+ways
+I
+cannot
+talk
+as
+I
+want
+to
+talk
+and
+I
+cannot
+do
+as
+I
+please
+to
+do
+Dr
+What
+do
+you
+please
+to
+do
+Sp
+I
+like
+to
+talk
+and
+sing
+Dr
+Have
+you
+not
+been
+able
+to
+do
+that
+Sp
+No
+Dr
+What
+is
+your
+name
+if
+I
+may
+ask
+Sp
+I
+don
+t
+know
+Dr
+Surely
+you
+do
+Sp
+It
+seems
+I
+have
+forgotten
+everything
+I
+ever
+knew
+Dr
+There
+probably
+was
+not
+much
+to
+forget
+anyhow
+That
+is
+very
+often
+the
+case
+What
+did
+you
+do
+in
+life
+Sp
+Any
+little
+thing
+now
+and
+then
+Dr
+Did
+you
+have
+religious
+belief
+of
+any
+kind
+Sp
+Yawning
+and
+stretching
+lazily
+Why
+yes
+Dr
+What
+did
+you
+believe
+in
+Sp
+I
+believed
+in
+God
+and
+Christ
+and
+the
+devil
+and
+the
+other
+things
+Dr
+Have
+you
+seen
+any
+of
+them
+You
+have
+probably
+been
+dead
+a
+long
+time
+Sp
+I
+don
+t
+know
+I
+do
+not
+feel
+dead
+Mrs
+H
+W
+Were
+you
+a
+Baptist
+a
+Methodist
+or
+what
+Sp
+I
+was
+a
+little
+of
+everything
+Mrs
+H
+W
+Where
+did
+you
+live
+Sp
+I
+don
+t
+know
+I
+m
+tired
+Dr
+You
+have
+been
+sleeping
+long
+enough
+What
+else
+have
+you
+been
+doing
+Sp
+Nothing
+Dr
+Don
+t
+you
+get
+tired
+of
+that
+Sp
+You
+get
+pretty
+tired
+of
+doing
+nothing
+It
+is
+monotonous
+And
+to
+be
+a
+fool
+woman
+all
+the
+time
+I
+have
+seen
+nothing
+but
+women
+women
+women
+and
+women
+Other
+spirits
+obsessing
+patient
+I
+saw
+nothing
+else
+Dr
+Don
+t
+you
+get
+tired
+of
+women
+Sp
+They
+do
+get
+pretty
+monotonous
+Dr
+Do
+they
+know
+you
+are
+there
+Sp
+I
+don
+t
+know
+I
+talk
+but
+they
+do
+not
+answer
+me
+Dr
+That
+is
+very
+foolish
+Sp
+It
+seems
+so
+to
+me
+Dr
+Do
+you
+seem
+to
+be
+in
+a
+strange
+condition
+yourself
+Sp
+I
+cannot
+tell
+what
+it
+is
+but
+it
+is
+queer
+Dr
+You
+don
+t
+care
+very
+much
+Sp
+No
+I
+don
+t
+care
+Dr
+Isn
+t
+that
+an
+unfortunate
+condition
+to
+be
+in
+Sp
+I
+have
+been
+walking
+from
+one
+place
+to
+another
+Dr
+Why
+did
+you
+do
+that
+Sp
+I
+had
+nothing
+else
+to
+do
+Dr
+Couldn
+t
+you
+find
+any
+work
+Sp
+Nobody
+wanted
+me
+Dr
+What
+could
+you
+do
+Sp
+Anything
+but
+nothing
+in
+particular
+Dr
+Where
+did
+you
+live
+Sp
+In
+Chicago
+at
+times
+Dr
+Did
+you
+go
+from
+one
+city
+to
+another
+Sp
+I
+was
+in
+Rockford
+and
+Galesburg
+I
+was
+anywhere
+everywhere
+It
+is
+a
+tiresome
+job
+Dr
+You
+must
+have
+been
+born
+tired
+you
+are
+so
+indifferent
+Sp
+What
+was
+the
+use
+Dr
+Did
+you
+try
+to
+understand
+the
+wonderful
+facts
+of
+life
+Sp
+Life
+No
+Dr
+I
+suppose
+you
+only
+believed
+that
+Christ
+died
+for
+your
+sins
+and
+that
+is
+a
+lazy
+man
+s
+job
+That
+is
+not
+enough
+SP
+It
+s
+good
+enough
+for
+me
+It
+was
+good
+enough
+for
+my
+father
+and
+mother
+and
+it
+s
+good
+enough
+for
+me
+Dr
+Are
+your
+father
+and
+mother
+alive
+Sp
+Why
+yes
+I
+think
+so
+but
+I
+don
+t
+know
+Dr
+Where
+did
+they
+live
+Chicago
+Sp
+Somewhere
+around
+Bethany
+Home
+near
+the
+Methodist
+Church
+Dr
+Did
+your
+father
+and
+mother
+belong
+to
+that
+church
+Sp
+Yes
+Dr
+What
+was
+your
+father
+s
+name
+Sp
+I
+don
+t
+know
+Dr
+What
+was
+your
+name
+Sp
+It
+s
+a
+long
+time
+since
+I
+heard
+it
+and
+I
+don
+t
+know
+Mrs
+H
+W
+Recognizing
+from
+the
+foregoing
+the
+traits
+of
+a
+former
+neighbor
+Was
+it
+Frank
+Sp
+I
+don
+t
+care
+what
+you
+call
+me
+call
+me
+anything
+Dr
+We
+don
+t
+want
+to
+do
+that
+Sp
+I
+don
+t
+care
+call
+me
+anything
+I
+am
+pleased
+with
+anything
+Dr
+You
+are
+mentally
+lazy
+Sp
+What
+s
+the
+use
+Mrs
+H
+W
+Do
+you
+know
+anybody
+by
+the
+name
+of
+B
+Sp
+Along
+time
+ago
+Mrs
+H
+W
+Who
+was
+he
+Sp
+He
+was
+somebody
+Mrs
+H
+W
+Were
+you
+related
+to
+him
+by
+marriage
+Whom
+did
+he
+marry
+Sp
+He
+married
+somebody
+I
+knew
+Dr
+What
+was
+her
+name
+Sp
+Names
+have
+gone
+from
+my
+memory
+Yes
+I
+know
+it
+was
+my
+sister
+Say
+I
+don
+t
+know
+what
+is
+the
+matter
+with
+me
+Dr
+You
+are
+dead
+Sp
+Dead
+Then
+I
+m
+gone
+Dr
+Do
+you
+remember
+how
+you
+died
+Sp
+I
+didn
+t
+know
+I
+was
+dead
+How
+can
+I
+remember
+how
+I
+died
+Dr
+Well
+you
+are
+dead
+Sp
+I
+am
+That
+s
+a
+funny
+thing
+but
+I
+don
+t
+care
+Dr
+You
+are
+occupying
+a
+lady
+s
+body
+now
+Sp
+I
+ve
+had
+enough
+of
+ladies
+I
+have
+been
+walking
+and
+walking
+between
+ladies
+until
+I
+am
+sick
+and
+tired
+of
+them
+Dr
+I
+think
+you
+were
+born
+with
+that
+tired
+feeling
+Sp
+I
+think
+so
+myself
+because
+I
+am
+always
+tired
+I
+do
+not
+care
+very
+much
+for
+work
+anyhow
+It
+was
+just
+as
+well
+not
+to
+work
+I
+was
+born
+to
+be
+traveling
+around
+because
+I
+was
+never
+satisfied
+to
+be
+in
+one
+place
+I
+liked
+to
+see
+the
+world
+I
+did
+not
+want
+to
+do
+very
+much
+except
+what
+came
+along
+just
+enough
+so
+I
+could
+get
+along
+Dr
+Were
+you
+a
+sort
+of
+tramp
+Sp
+I
+was
+a
+little
+better
+than
+a
+tramp
+but
+next
+door
+to
+it
+Mrs
+H
+W
+Do
+you
+remember
+that
+you
+had
+a
+twin
+brother
+Sp
+Something
+like
+that
+but
+what
+is
+the
+matter
+with
+me
+anyhow
+I
+cannot
+recall
+anything
+everything
+is
+gone
+I
+do
+not
+know
+for
+sure
+what
+is
+my
+name
+Dr
+Sit
+quietly
+and
+think
+Sp
+After
+a
+moment
+It
+is
+Bergquist
+I
+think
+it
+is
+Frank
+yes
+it
+is
+Frank
+I
+heard
+that
+some
+years
+ago
+It
+s
+an
+awful
+long
+time
+since
+I
+heard
+it
+It
+seems
+so
+far
+away
+that
+it
+is
+miles
+and
+miles
+away
+that
+name
+is
+It
+seems
+like
+I
+was
+walking
+away
+from
+it
+The
+more
+I
+walked
+the
+more
+I
+forgot
+After
+a
+while
+I
+walked
+so
+long
+that
+I
+forgot
+who
+I
+was
+I
+walked
+with
+women
+women
+women
+until
+I
+thought
+I
+was
+a
+woman
+myself
+and
+really
+sometimes
+I
+thought
+I
+was
+And
+probably
+I
+am
+a
+woman
+for
+all
+I
+know
+and
+for
+all
+I
+care
+What
+is
+the
+use
+anyway
+Mrs
+H
+W
+Did
+you
+live
+on
+Paulina
+Street
+Ravenswood
+Chicago
+Sp
+Yes
+Chicago
+that
+was
+where
+I
+was
+some
+of
+the
+time
+Dr
+Do
+you
+know
+where
+you
+are
+now
+Sp
+In
+Chicago
+Dr
+You
+are
+in
+California
+Sp
+California
+Well
+if
+I
+didn
+t
+walk
+after
+those
+women
+clear
+to
+California
+Well
+that
+was
+a
+long
+walk
+I
+know
+I
+haven
+t
+been
+riding
+I
+have
+walked
+for
+miles
+and
+miles
+and
+miles
+At
+last
+I
+got
+to
+California
+That
+was
+some
+walk
+I
+am
+pretty
+tired
+Why
+did
+you
+tell
+me
+I
+walked
+that
+far
+Because
+that
+makes
+me
+very
+tired
+and
+now
+I
+feel
+I
+have
+to
+rest
+Mrs
+H
+W
+That
+is
+natural
+for
+you
+Do
+you
+know
+me
+Sp
+I
+thought
+when
+I
+looked
+at
+you
+I
+had
+seen
+that
+face
+before
+Didn
+t
+you
+go
+to
+the
+Methodist
+Church
+I
+think
+I
+have
+seen
+you
+there
+Mrs
+H
+W
+Do
+you
+remember
+the
+bakery
+on
+W
+Avenue
+Across
+the
+street
+from
+the
+boy
+s
+home
+Sp
+Some
+time
+ago
+that
+was
+Mrs
+H
+W
+Look
+at
+me
+again
+and
+see
+if
+I
+am
+not
+the
+one
+who
+had
+that
+store
+Sp
+Yes
+and
+you
+had
+two
+girls
+Mrs
+H
+W
+Yes
+I
+did
+Would
+you
+know
+one
+of
+them
+if
+you
+saw
+her
+Would
+you
+know
+L
+Sp
+I
+didn
+t
+know
+them
+very
+much
+I
+liked
+that
+girl
+but
+you
+could
+only
+look
+at
+those
+girls
+with
+one
+eye
+Mrs
+H
+W
+Somebody
+looked
+at
+them
+with
+two
+eyes
+They
+are
+both
+married
+Sp
+I
+looked
+at
+them
+with
+a
+quarter
+of
+an
+eye
+They
+wouldn
+t
+look
+at
+a
+fellow
+like
+me
+Dr
+Has
+anybody
+else
+looked
+at
+you
+Sp
+I
+don
+t
+know
+Women
+women
+women
+I
+have
+been
+with
+them
+It
+is
+a
+funny
+world
+anyhow
+Dr
+What
+did
+they
+call
+you
+when
+you
+felt
+that
+you
+were
+a
+woman
+Sp
+I
+don
+t
+hear
+anything
+Of
+course
+I
+have
+had
+a
+long
+walk
+if
+I
+have
+walked
+to
+California
+Sometimes
+I
+got
+chased
+out
+when
+I
+was
+behind
+then
+I
+ran
+fast
+as
+I
+could
+and
+sometimes
+I
+got
+in
+front
+Dr
+In
+front
+of
+what
+SP
+The
+people
+Do
+you
+suppose
+I
+walked
+that
+long
+distance
+alone
+I
+was
+walking
+with
+a
+big
+crowd
+Spirits
+obsessing
+patient
+At
+times
+I
+was
+before
+and
+then
+I
+was
+behind
+What
+s
+the
+use
+We
+all
+talked
+the
+same
+thing
+Dr
+Where
+did
+you
+get
+food
+when
+you
+were
+out
+walking
+Sp
+I
+didn
+t
+seem
+to
+need
+much
+I
+have
+learned
+to
+fast
+Dr
+Didn
+t
+you
+go
+to
+different
+houses
+and
+ask
+for
+food
+Sp
+At
+times
+but
+that
+was
+long
+ago
+Somebody
+said
+if
+you
+fast
+three
+or
+four
+days
+you
+would
+not
+feel
+your
+stomach
+It
+was
+a
+bother
+to
+feel
+hungry
+if
+you
+didn
+t
+have
+anything
+to
+eat
+I
+fasted
+pretty
+good
+and
+it
+was
+a
+good
+thing
+I
+did
+Mrs
+H
+W
+Did
+your
+parents
+live
+on
+the
+top
+floor
+Sp
+In
+the
+basement
+Dr
+To
+Mrs
+H
+W
+Is
+that
+correct
+Mrs
+H
+W
+Yes
+it
+is
+I
+think
+his
+parents
+are
+dead
+now
+Sp
+They
+are
+When
+did
+they
+die
+Mrs
+H
+W
+Not
+long
+ago
+Your
+mother
+died
+a
+year
+ago
+and
+your
+father
+a
+few
+months
+ago
+Sp
+Who
+told
+you
+that
+Mrs
+H
+W
+Your
+sister
+Sp
+Why
+didn
+t
+she
+tell
+me
+Mrs
+H
+W
+You
+are
+dead
+Sp
+Dead
+I
+am
+dead
+I
+feel
+full
+of
+life
+Mrs
+H
+W
+Didn
+t
+you
+used
+to
+go
+to
+saloons
+Sp
+Oh
+don
+t
+talk
+like
+that
+in
+company
+Mrs
+H
+W
+We
+have
+no
+company
+Sp
+I
+went
+but
+don
+t
+tell
+them
+that
+Mrs
+H
+W
+Why
+don
+t
+you
+want
+them
+to
+know
+Sp
+Because
+they
+wouldn
+t
+like
+it
+Mother
+doesn
+t
+like
+me
+to
+go
+there
+Mrs
+H
+W
+You
+had
+a
+good
+father
+and
+mother
+Sp
+I
+wanted
+to
+live
+my
+life
+but
+they
+wanted
+to
+live
+mine
+for
+me
+Mrs
+H
+W
+What
+did
+you
+do
+when
+you
+were
+home
+with
+them
+Sp
+Nothing
+Mrs
+H
+W
+Didn
+t
+you
+help
+in
+the
+kitchen
+Sp
+Mother
+wanted
+me
+to
+but
+I
+didn
+t
+do
+very
+much
+of
+anything
+I
+used
+to
+wash
+the
+dishes
+for
+her
+but
+I
+didn
+t
+want
+to
+do
+it
+Mrs
+H
+W
+She
+made
+you
+Sp
+You
+know
+she
+said
+If
+you
+want
+to
+eat
+you
+will
+have
+to
+work
+Say
+that
+isn
+t
+right
+I
+always
+liked
+to
+slip
+out
+if
+I
+could
+That
+s
+natural
+Dr
+No
+it
+is
+not
+It
+may
+be
+to
+some
+but
+not
+to
+others
+Sp
+Everybody
+likes
+to
+get
+out
+and
+do
+some
+idling
+around
+You
+want
+a
+little
+freedom
+Mrs
+H
+W
+You
+wanted
+all
+freedom
+you
+wanted
+to
+just
+loaf
+around
+Sp
+I
+worked
+sometimes
+once
+in
+a
+while
+I
+gave
+my
+mother
+money
+at
+times
+but
+it
+was
+not
+often
+I
+had
+any
+Mrs
+H
+W
+You
+liked
+best
+to
+walk
+from
+door
+to
+door
+and
+beg
+your
+food
+and
+get
+five
+dollars
+wherever
+you
+could
+Sp
+What
+was
+the
+use
+anyhow
+Dr
+We
+want
+you
+to
+understand
+that
+you
+have
+passed
+out
+of
+your
+body
+You
+have
+been
+dead
+a
+long
+time
+This
+lady
+Mrs
+H
+W
+seems
+to
+know
+who
+you
+are
+Sp
+She
+made
+good
+biscuits
+I
+wished
+sometimes
+I
+had
+one
+Mrs
+H
+W
+Did
+you
+ever
+have
+any
+of
+my
+doughnuts
+Sp
+Yes
+sometimes
+you
+gave
+me
+some
+I
+was
+supposed
+to
+look
+for
+work
+but
+some
+way
+or
+other
+I
+did
+not
+work
+and
+I
+didn
+t
+care
+very
+much
+either
+Dr
+Now
+then
+understand
+friend
+that
+you
+are
+so
+called
+dead
+You
+have
+been
+an
+ignorant
+spirit
+for
+a
+long
+time
+in
+the
+outer
+darkness
+which
+the
+Bible
+speaks
+of
+This
+is
+not
+your
+body
+Sp
+Yes
+it
+is
+Dr
+It
+is
+my
+wife
+s
+Sp
+How
+could
+I
+be
+your
+wife
+when
+I
+am
+a
+man
+Dr
+You
+are
+an
+invisible
+spirit
+We
+do
+not
+see
+you
+We
+only
+hear
+you
+talk
+Do
+you
+recognize
+these
+hands
+Indicating
+hands
+of
+psychic
+Sp
+I
+have
+been
+so
+strange
+for
+a
+long
+time
+What
+in
+the
+world
+is
+it
+It
+has
+been
+so
+strange
+at
+times
+There
+was
+lightning
+and
+thunder
+electricity
+given
+patient
+and
+it
+bothered
+me
+terribly
+I
+have
+not
+been
+left
+alone
+for
+one
+minute
+It
+was
+fierce
+that
+thunder
+and
+lightning
+The
+lightning
+is
+the
+worst
+the
+thunder
+is
+not
+so
+bad
+The
+lightning
+is
+so
+bad
+that
+it
+doesn
+t
+seem
+as
+if
+I
+should
+really
+see
+afterwards
+I
+should
+say
+it
+was
+coming
+down
+in
+torrents
+It
+seemed
+as
+if
+you
+got
+knocked
+in
+the
+head
+and
+then
+got
+it
+again
+and
+again
+It
+was
+wonderful
+how
+you
+got
+it
+It
+was
+a
+wonder
+for
+it
+woke
+me
+up
+It
+woke
+me
+up
+good
+and
+plenty
+at
+times
+so
+that
+I
+could
+not
+stand
+it
+any
+longer
+Mrs
+H
+W
+I
+am
+glad
+of
+it
+Sp
+I
+don
+t
+see
+why
+you
+should
+be
+glad
+Mrs
+H
+W
+I
+will
+tell
+you
+why
+I
+am
+glad
+You
+have
+been
+bothering
+my
+daughter
+for
+a
+long
+time
+Sp
+How
+do
+you
+know
+I
+have
+Mrs
+H
+W
+That
+is
+the
+reason
+you
+were
+with
+women
+all
+the
+time
+You
+are
+ignorant
+and
+have
+been
+troubling
+my
+daughter
+You
+got
+thunder
+and
+lightning
+for
+it
+when
+my
+daughter
+had
+electric
+treatments
+and
+you
+got
+out
+I
+am
+glad
+of
+it
+Dr
+I
+am
+the
+one
+who
+gave
+the
+electricity
+to
+you
+We
+chase
+ignorant
+spirits
+away
+with
+it
+Sp
+I
+think
+you
+had
+better
+be
+a
+little
+milder
+with
+it
+then
+Dr
+I
+do
+not
+like
+to
+give
+it
+but
+it
+is
+sometimes
+necessary
+Sp
+I
+do
+not
+see
+why
+I
+should
+need
+to
+have
+so
+much
+of
+it
+coming
+down
+like
+thunder
+and
+lightning
+You
+get
+it
+in
+the
+head
+like
+a
+sledge
+hammer
+Dr
+But
+we
+succeeded
+in
+driving
+you
+from
+the
+lady
+Sp
+I
+didn
+t
+bother
+any
+lady
+I
+didn
+t
+have
+a
+chance
+I
+was
+walking
+behind
+them
+but
+it
+does
+not
+seem
+to
+me
+that
+I
+had
+any
+way
+of
+bothering
+them
+Mrs
+H
+W
+You
+surely
+bothered
+my
+daughter
+Dr
+That
+was
+why
+we
+had
+to
+give
+you
+electricity
+Were
+there
+any
+others
+with
+you
+Sp
+There
+are
+many
+with
+us
+Dr
+Are
+there
+any
+more
+left
+Sp
+I
+don
+t
+know
+There
+are
+some
+that
+come
+and
+go
+Dr
+They
+will
+get
+electricity
+every
+time
+they
+come
+Sp
+I
+m
+not
+going
+to
+have
+it
+any
+more
+I
+don
+t
+think
+I
+need
+it
+Dr
+If
+you
+stay
+around
+you
+will
+get
+it
+Sp
+I
+don
+t
+care
+for
+any
+more
+Dr
+Have
+you
+ever
+been
+called
+Mrs
+A
+Sp
+No
+I
+never
+was
+a
+woman
+so
+I
+never
+could
+be
+anybody
+by
+that
+name
+I
+was
+with
+women
+Dr
+Did
+you
+hear
+that
+name
+at
+all
+Sp
+No
+Mrs
+H
+W
+That
+is
+my
+daughter
+s
+name
+and
+you
+got
+that
+electricity
+for
+being
+around
+her
+Sp
+Did
+you
+order
+that
+for
+me
+Mrs
+H
+W
+Yes
+I
+did
+Sp
+Then
+you
+are
+a
+bad
+woman
+to
+do
+that
+Mrs
+H
+W
+I
+wanted
+you
+to
+leave
+my
+daughter
+alone
+Sp
+I
+told
+you
+I
+never
+bothered
+your
+daughter
+I
+walked
+behind
+the
+women
+Dr
+You
+walked
+a
+little
+too
+close
+Were
+you
+the
+only
+man
+among
+so
+many
+women
+Sp
+There
+is
+something
+like
+what
+you
+would
+call
+a
+line
+and
+you
+have
+to
+walk
+in
+that
+line
+and
+you
+cannot
+go
+out
+I
+did
+not
+want
+to
+work
+The
+patient
+suffered
+from
+a
+heavy
+listlessness
+Mrs
+H
+W
+You
+were
+too
+lazy
+Sp
+What
+was
+the
+use
+when
+you
+could
+get
+your
+food
+without
+It
+is
+just
+as
+well
+to
+take
+things
+instead
+of
+working
+yourself
+to
+death
+Dr
+That
+is
+a
+poor
+argument
+People
+who
+accomplish
+something
+are
+happy
+Sp
+I
+do
+not
+fancy
+it
+If
+people
+want
+to
+work
+like
+slaves
+they
+are
+welcome
+to
+it
+for
+me
+I
+would
+not
+work
+Dr
+To
+Mrs
+H
+W
+Is
+that
+like
+this
+man
+s
+disposition
+Mrs
+H
+W
+Yes
+every
+inch
+of
+him
+His
+name
+is
+Bergquist
+Sp
+How
+do
+you
+know
+Mrs
+H
+W
+Your
+disposition
+and
+actions
+are
+clear
+to
+me
+Sp
+Can
+you
+know
+one
+s
+name
+before
+you
+know
+the
+person
+Mrs
+H
+W
+I
+know
+you
+by
+your
+actions
+I
+used
+to
+know
+you
+well
+I
+knew
+your
+brother
+who
+went
+to
+war
+in
+Cuba
+He
+came
+home
+had
+consumption
+and
+died
+Sp
+I
+had
+another
+brother
+who
+died
+Dr
+Now
+friend
+I
+want
+you
+to
+understand
+Mrs
+H
+W
+Listen
+to
+the
+doctor
+Sp
+Doctor
+I
+am
+not
+sick
+Mrs
+H
+W
+You
+need
+advice
+from
+the
+doctor
+Sp
+Advice
+Then
+I
+must
+go
+to
+a
+lawyer
+When
+I
+was
+sick
+I
+went
+to
+a
+doctor
+when
+I
+needed
+advice
+I
+would
+go
+to
+a
+lawyer
+Dr
+You
+are
+mentally
+sick
+Sp
+I
+wouldn
+t
+say
+I
+am
+sick
+I
+feel
+pretty
+good
+I
+feel
+better
+than
+I
+have
+for
+years
+and
+years
+in
+the
+past
+Dr
+You
+will
+not
+feel
+yourself
+so
+very
+long
+unless
+you
+change
+your
+attitude
+You
+are
+controlling
+my
+wife
+s
+body
+Sp
+I
+can
+do
+as
+I
+please
+for
+that
+matter
+Dr
+You
+cannot
+in
+this
+instance
+Do
+you
+think
+that
+I
+want
+you
+to
+sit
+here
+indefinitely
+controlling
+my
+wife
+s
+body
+Look
+at
+those
+hands
+Are
+they
+yours
+Wake
+up
+and
+don
+t
+be
+so
+sleepy
+Do
+you
+know
+that
+hand
+Sp
+How
+did
+I
+get
+it
+I
+have
+been
+with
+women
+so
+much
+that
+I
+have
+a
+woman
+s
+hands
+Dr
+You
+must
+wake
+up
+and
+listen
+The
+fact
+is
+you
+are
+an
+ignorant
+spirit
+You
+have
+been
+taken
+away
+from
+that
+lady
+you
+have
+been
+bothering
+her
+for
+a
+long
+time
+You
+lost
+your
+body
+years
+ago
+Sp
+That
+doesn
+t
+interest
+me
+Dr
+It
+will
+have
+to
+You
+died
+a
+long
+time
+ago
+You
+are
+an
+invisible
+spirit
+You
+have
+been
+hovering
+around
+that
+lady
+and
+troubling
+her
+She
+has
+been
+brought
+to
+California
+to
+be
+freed
+from
+spirits
+of
+which
+you
+are
+one
+and
+I
+have
+had
+to
+give
+her
+the
+electricity
+to
+get
+rid
+of
+you
+You
+have
+been
+driven
+away
+from
+her
+and
+allowed
+to
+control
+my
+wife
+s
+body
+The
+point
+is
+you
+will
+have
+to
+leave
+this
+body
+and
+become
+sensible
+Sp
+I
+want
+to
+ask
+you
+this
+if
+I
+haven
+t
+any
+sense
+what
+will
+you
+do
+Mother
+used
+to
+say
+I
+had
+no
+sense
+Dr
+You
+have
+been
+lazy
+but
+now
+you
+will
+have
+to
+use
+the
+sense
+that
+God
+gave
+you
+even
+if
+it
+is
+only
+a
+little
+You
+cannot
+be
+lazy
+any
+longer
+Sp
+I
+will
+not
+work
+either
+Dr
+You
+will
+have
+to
+in
+the
+spirit
+life
+Sp
+How
+do
+you
+know
+How
+do
+you
+know
+they
+will
+make
+me
+work
+Dr
+You
+will
+be
+glad
+to
+work
+You
+cannot
+bother
+people
+any
+more
+Sp
+What
+do
+you
+mean
+Dr
+Ignorant
+spirits
+hover
+around
+the
+earth
+plane
+interfering
+with
+mortals
+and
+make
+them
+act
+as
+if
+insane
+Sp
+What
+is
+a
+poor
+fellow
+to
+do
+Dr
+Use
+the
+sense
+God
+gave
+you
+Sp
+I
+have
+none
+What
+am
+I
+to
+do
+You
+say
+I
+am
+controlling
+a
+body
+that
+does
+not
+belong
+to
+me
+Dr
+Yes
+and
+you
+must
+leave
+this
+body
+and
+listen
+to
+spirits
+who
+will
+help
+you
+My
+wife
+allows
+you
+to
+control
+her
+body
+in
+order
+to
+free
+the
+other
+lady
+Sp
+What
+kind
+of
+a
+wife
+is
+that
+Dr
+She
+is
+a
+psychic
+sensitive
+who
+allows
+ignorant
+spirits
+like
+yourself
+to
+control
+her
+body
+If
+you
+will
+look
+around
+you
+will
+find
+spirits
+who
+will
+help
+you
+Sp
+Spirits
+Dr
+You
+will
+find
+spirits
+who
+will
+help
+you
+and
+teach
+you
+how
+to
+progress
+You
+can
+also
+find
+happiness
+Sp
+My
+legs
+are
+getting
+numb
+Dr
+That
+body
+is
+not
+yours
+We
+do
+not
+see
+you
+Sp
+No
+Dr
+You
+are
+invisible
+to
+us
+Can
+you
+understand
+that
+Sp
+I
+suppose
+I
+can
+t
+get
+that
+in
+my
+head
+Dr
+Look
+around
+and
+you
+will
+find
+invisibles
+like
+yourself
+who
+will
+help
+you
+Sp
+I
+don
+t
+need
+help
+Dr
+You
+do
+you
+need
+help
+to
+progress
+to
+the
+spirit
+land
+Sp
+Where
+is
+that
+place
+Dr
+It
+is
+an
+invisible
+plane
+around
+the
+earth
+and
+you
+will
+find
+it
+if
+you
+look
+for
+it
+You
+will
+be
+taught
+that
+life
+is
+something
+worth
+while
+Sp
+I
+think
+I
+could
+go
+to
+sleep
+Dr
+If
+you
+do
+I
+will
+give
+you
+some
+electricity
+Mrs
+H
+W
+Think
+of
+the
+sorrow
+you
+caused
+your
+mother
+Sp
+I
+was
+a
+fool
+Dr
+You
+were
+not
+one
+you
+allowed
+yourself
+to
+be
+one
+You
+were
+lazy
+Sp
+Mother
+is
+here
+spirit
+but
+I
+can
+t
+see
+what
+she
+wants
+with
+me
+Dr
+Listen
+to
+what
+she
+says
+Sp
+She
+says
+You
+have
+been
+a
+very
+wayward
+boy
+Now
+try
+to
+wake
+up
+and
+be
+different
+because
+life
+is
+different
+on
+this
+side
+and
+you
+will
+have
+to
+earn
+your
+happiness
+Dr
+Then
+you
+will
+find
+that
+life
+is
+worth
+while
+Sp
+Mother
+seems
+to
+be
+very
+happy
+Dr
+She
+will
+help
+you
+if
+you
+are
+in
+earnest
+Sp
+I
+want
+to
+go
+with
+her
+I
+must
+learn
+Dr
+You
+must
+be
+obedient
+Sp
+Mother
+says
+she
+is
+happy
+she
+got
+me
+to
+come
+to
+her
+now
+I
+am
+happy
+in
+my
+way
+to
+see
+her
+Dr
+Try
+to
+realize
+that
+life
+means
+something
+Sp
+I
+will
+go
+with
+her
+then
+She
+says
+I
+must
+not
+bother
+that
+lady
+any
+more
+After
+the
+last
+bombarding
+I
+got
+I
+will
+leave
+that
+body
+alone
+I
+thought
+my
+head
+would
+come
+off
+I
+got
+it
+all
+right
+Mrs
+H
+W
+You
+certainly
+did
+Can
+you
+see
+your
+sister
+F
+Spirit
+Sp
+She
+s
+here
+with
+a
+lot
+of
+people
+I
+think
+I
+will
+go
+now
+Dr
+How
+will
+you
+go
+I
+will
+explain
+to
+you
+Sp
+No
+I
+am
+ready
+to
+go
+Dr
+How
+Sp
+I
+will
+get
+up
+and
+go
+Trying
+in
+vain
+to
+rise
+I
+can
+t
+move
+Dr
+You
+have
+only
+partial
+control
+of
+this
+body
+now
+You
+will
+have
+to
+think
+yourself
+with
+your
+mother
+Sp
+Think
+myself
+Dr
+You
+will
+have
+to
+travel
+by
+thought
+Sp
+You
+come
+over
+there
+Mother
+pointing
+then
+I
+will
+jump
+over
+to
+you
+by
+thought
+Sitting
+still
+for
+a
+moment
+then
+laughing
+heartily
+I
+can
+t
+jump
+That
+would
+be
+quite
+a
+jump
+Dr
+You
+are
+in
+California
+now
+how
+long
+does
+it
+take
+you
+to
+think
+yourself
+in
+Chicago
+You
+can
+be
+there
+instantly
+in
+thought
+for
+you
+have
+no
+physical
+body
+to
+take
+with
+you
+In
+the
+spirit
+world
+thought
+is
+the
+motive
+power
+Sp
+Now
+I
+am
+going
+to
+think
+quick
+and
+jump
+But
+I
+don
+t
+get
+there
+Dr
+You
+must
+relax
+and
+quietly
+think
+yourself
+with
+your
+mother
+and
+then
+you
+will
+lose
+control
+of
+this
+body
+Mrs
+H
+W
+Can
+you
+see
+F
+your
+sister
+Sp
+Yes
+and
+father
+too
+They
+are
+coming
+to
+get
+me
+They
+say
+they
+want
+me
+to
+reform
+and
+be
+a
+good
+fellow
+Yes
+I
+suppose
+I
+must
+Dr
+You
+must
+go
+now
+Your
+first
+lesson
+in
+spirit
+life
+is
+to
+think
+properly
+Sp
+It
+seems
+foolish
+to
+me
+to
+think
+My
+mother
+says
+Thank
+you
+and
+please
+forgive
+me
+for
+my
+ignorance
+Goodbye
+Many
+earthbound
+spirits
+are
+conscious
+of
+influencing
+mortals
+but
+enjoy
+their
+power
+seeming
+to
+be
+without
+scruples
+Often
+these
+have
+during
+earth
+life
+turned
+away
+from
+orthodoxy
+and
+become
+hardened
+to
+higher
+ethics
+and
+ideals
+A
+spirit
+of
+this
+type
+was
+dislodged
+from
+Mr
+G
+who
+had
+since
+childhood
+been
+subject
+to
+violent
+attacks
+of
+temper
+During
+the
+weeks
+when
+this
+spirit
+was
+being
+brought
+to
+the
+front
+preparatory
+to
+removal
+Mr
+G
+was
+very
+irritable
+especially
+when
+driving
+his
+automobile
+and
+developed
+moods
+during
+which
+he
+wished
+to
+be
+away
+from
+every
+one
+After
+the
+spirit
+was
+dislodged
+the
+gentleman
+s
+characteristics
+changed
+completeIy
+and
+he
+became
+natural
+again
+Both
+Mr
+and
+Mrs
+G
+were
+present
+at
+the
+time
+this
+spirit
+controlled
+Mrs
+Wickland
+EXPERIENCE
+SEPTEMBER
+Spirit
+FRED
+HAUPT
+Patient
+MR
+Psychic
+MRS
+WICKLAND
+The
+spirit
+made
+violent
+attempts
+to
+escape
+and
+when
+the
+hands
+of
+the
+psychic
+were
+held
+fought
+furiously
+Doctor
+Who
+are
+you
+Come
+be
+sensible
+This
+will
+not
+do
+you
+any
+good
+There
+is
+no
+use
+in
+fighting
+Who
+are
+you
+Spirit
+It
+s
+none
+of
+your
+business
+who
+I
+am
+I
+don
+t
+want
+to
+be
+here
+with
+you
+I
+didn
+t
+want
+to
+come
+here
+I
+will
+not
+come
+any
+more
+You
+won
+t
+trap
+me
+again
+Dr
+With
+whom
+did
+you
+come
+Sp
+It
+s
+none
+of
+your
+business
+who
+I
+came
+with
+Dr
+How
+long
+have
+you
+been
+dead
+Sp
+I
+m
+not
+dead
+You
+will
+find
+that
+I
+won
+t
+stand
+for
+anything
+To
+Mrs
+G
+You
+don
+t
+care
+for
+me
+any
+more
+Dr
+I
+don
+t
+care
+for
+you
+Sp
+I
+don
+t
+mean
+you
+I
+am
+going
+to
+fight
+you
+all
+right
+You
+gave
+me
+that
+awful
+lightning
+on
+my
+head
+and
+back
+Patient
+s
+electrical
+treatment
+Dr
+That
+was
+electricity
+and
+it
+evidently
+put
+life
+into
+you
+Sp
+I
+told
+you
+many
+times
+that
+I
+would
+never
+come
+here
+again
+Dr
+How
+long
+have
+you
+been
+dead
+Sp
+Dead
+I
+m
+not
+dead
+and
+you
+re
+not
+going
+to
+make
+me
+come
+here
+any
+more
+You
+think
+you
+have
+me
+this
+time
+but
+I
+ll
+fix
+you
+You
+don
+t
+trap
+me
+any
+more
+I
+get
+so
+mad
+at
+you
+Dr
+What
+are
+you
+so
+angry
+about
+Sp
+The
+world
+and
+everybody
+Dr
+If
+you
+have
+a
+grudge
+on
+your
+mind
+perhaps
+we
+can
+help
+you
+remove
+it
+Sp
+You
+can
+go
+your
+way
+and
+I
+ll
+go
+mine
+I
+m
+through
+You
+can
+go
+just
+wherever
+you
+please
+You
+think
+you
+ve
+got
+me
+where
+you
+have
+control
+over
+me
+but
+you
+ll
+find
+you
+will
+get
+left
+I
+ll
+not
+tell
+you
+anything
+so
+you
+don
+t
+need
+to
+ask
+Dr
+We
+are
+anxious
+to
+know
+who
+you
+are
+Sp
+That
+makes
+no
+difference
+to
+me
+You
+think
+you
+have
+me
+in
+your
+claws
+but
+you
+ll
+get
+left
+Dr
+Won
+t
+you
+tell
+us
+who
+you
+are
+Sp
+I
+don
+t
+want
+to
+get
+acquainted
+with
+you
+and
+you
+don
+t
+need
+to
+get
+acquainted
+with
+me
+I
+want
+to
+be
+all
+by
+myself
+and
+I
+m
+going
+out
+I
+don
+t
+want
+any
+one
+around
+me
+I
+want
+to
+be
+alone
+I
+enjoy
+my
+own
+company
+best
+Dr
+What
+experiences
+have
+you
+had
+Sp
+I
+will
+not
+talk
+to
+you
+any
+more
+Dr
+How
+do
+you
+happen
+to
+be
+here
+Sp
+You
+made
+me
+come
+with
+those
+funny
+lights
+Electricity
+Dr
+It
+will
+relieve
+you
+if
+you
+will
+tell
+us
+what
+you
+have
+on
+your
+mind
+because
+we
+can
+help
+you
+Where
+did
+you
+get
+that
+ring
+you
+are
+wearing
+Referring
+to
+ring
+on
+hand
+of
+psychic
+Sp
+That
+s
+none
+of
+your
+business
+It
+needn
+t
+bother
+you
+where
+I
+got
+it
+Dr
+Were
+you
+always
+so
+sarcastic
+Sp
+You
+keep
+your
+hands
+off
+me
+I
+will
+go
+Dr
+Where
+will
+you
+go
+Sp
+That
+makes
+no
+difference
+to
+you
+where
+I
+go
+and
+I
+don
+t
+care
+where
+you
+go
+either
+Dr
+But
+you
+have
+no
+place
+to
+go
+Sp
+Angrily
+Do
+you
+think
+I
+m
+a
+tramp
+I
+always
+had
+enough
+money
+to
+pay
+for
+my
+lodging
+I
+can
+go
+where
+I
+want
+Dr
+Then
+you
+were
+somewhat
+of
+a
+gentleman
+Sp
+When
+I
+am
+in
+gentlemen
+s
+company
+then
+I
+am
+a
+gentleman
+You
+don
+t
+need
+to
+talk
+to
+me
+for
+I
+don
+t
+care
+for
+you
+with
+your
+electric
+sparks
+Dr
+Are
+you
+despondent
+Sp
+No
+I
+m
+mad
+Dr
+Tell
+us
+who
+you
+are
+Sp
+I
+have
+no
+use
+for
+you
+As
+soon
+as
+you
+leave
+your
+hands
+off
+me
+I
+will
+attend
+to
+myself
+Dr
+What
+will
+you
+do
+then
+Sp
+That
+s
+none
+of
+your
+business
+Dr
+Tell
+us
+how
+long
+you
+have
+been
+dead
+Sp
+I
+m
+not
+dead
+and
+never
+have
+been
+Dr
+Would
+you
+understand
+if
+I
+should
+tell
+you
+it
+is
+Would
+you
+believe
+it
+Sp
+I
+won
+t
+have
+anything
+to
+do
+with
+you
+I
+have
+no
+business
+here
+I
+ll
+never
+go
+to
+that
+place
+again
+Dr
+We
+did
+not
+ask
+you
+to
+come
+here
+Sp
+You
+put
+me
+in
+a
+prison
+Dr
+How
+did
+you
+get
+into
+prison
+Who
+put
+you
+there
+Sp
+You
+put
+me
+there
+yesterday
+Dr
+Is
+that
+so
+Sp
+I
+will
+haunt
+you
+until
+you
+don
+t
+know
+where
+you
+are
+at
+Dr
+I
+am
+used
+to
+things
+like
+that
+Sp
+I
+will
+attend
+to
+all
+my
+business
+and
+you
+attend
+to
+yours
+We
+part
+right
+here
+I
+will
+have
+nothing
+more
+to
+do
+with
+you
+I
+am
+going
+my
+own
+way
+and
+you
+can
+go
+yours
+Dr
+Suppose
+we
+will
+not
+let
+you
+Try
+to
+understand
+your
+situation
+You
+are
+a
+spirit
+and
+have
+lost
+your
+mortal
+body
+Sp
+I
+don
+t
+care
+if
+I
+have
+lost
+my
+mortal
+body
+ten
+thousand
+times
+What
+of
+that
+I
+am
+living
+just
+as
+well
+as
+if
+I
+had
+my
+body
+What
+do
+I
+care
+Dr
+Whose
+body
+are
+you
+talking
+through
+Sp
+I
+have
+many
+bodies
+I
+go
+from
+one
+place
+to
+another
+I
+can
+be
+a
+lady
+at
+one
+time
+and
+a
+gentleman
+another
+Nobody
+can
+catch
+me
+Dr
+This
+time
+somebody
+has
+caught
+you
+and
+you
+will
+have
+to
+stop
+interfering
+with
+the
+lives
+of
+others
+Sp
+I
+have
+been
+attending
+to
+my
+own
+business
+for
+many
+years
+Dr
+Didn
+t
+you
+say
+you
+had
+been
+in
+prison
+Sp
+That
+won
+t
+last
+long
+Dr
+If
+you
+don
+t
+change
+your
+behavior
+you
+will
+be
+put
+into
+a
+dark
+dungeon
+Sp
+You
+ll
+get
+left
+I
+ve
+been
+in
+tight
+places
+before
+and
+always
+got
+out
+Dr
+Did
+you
+ever
+own
+a
+Ford
+car
+Sp
+No
+I
+didn
+t
+what
+s
+that
+Dr
+I
+ll
+tell
+you
+a
+story
+A
+man
+who
+owned
+a
+Ford
+machine
+died
+and
+his
+last
+request
+was
+that
+his
+Ford
+should
+be
+placed
+in
+his
+grave
+with
+him
+Sp
+What
+for
+Dr
+He
+said
+his
+Ford
+had
+helped
+him
+out
+of
+many
+a
+tight
+place
+Sp
+Did
+they
+put
+it
+in
+Dr
+Oh
+I
+suppose
+to
+Sp
+Ha
+ha
+Such
+fools
+They
+couldn
+t
+have
+a
+car
+with
+them
+if
+they
+are
+dead
+Dr
+Don
+t
+you
+know
+there
+is
+no
+actual
+death
+No
+one
+really
+dies
+Sp
+You
+say
+I
+am
+not
+dead
+Dr
+Your
+body
+is
+dead
+Sp
+Well
+I
+can
+be
+just
+what
+I
+want
+Sometimes
+a
+man
+sometimes
+a
+woman
+Dr
+No
+you
+cannot
+you
+only
+obsess
+men
+and
+women
+Sp
+No
+I
+don
+t
+If
+I
+want
+I
+can
+boss
+the
+whole
+family
+I
+have
+a
+mighty
+good
+time
+I
+go
+where
+I
+please
+I
+am
+my
+own
+boss
+If
+I
+am
+hungry
+sometimes
+I
+eat
+sometimes
+I
+don
+t
+The
+best
+thing
+to
+work
+up
+an
+appetite
+is
+to
+get
+hungry
+Then
+you
+eat
+everything
+and
+it
+tastes
+good
+If
+you
+are
+not
+hungry
+nothing
+tastes
+good
+I
+tell
+you
+I
+m
+no
+spirit
+Dr
+You
+are
+talking
+through
+my
+wife
+s
+body
+Sp
+We
+are
+just
+wasting
+time
+so
+I
+will
+go
+Dr
+You
+and
+I
+are
+going
+to
+be
+good
+friends
+I
+hope
+Sp
+I
+will
+have
+nothing
+to
+do
+with
+you
+Dr
+Come
+friend
+let
+us
+talk
+things
+over
+Life
+is
+a
+wonderful
+thing
+We
+can
+think
+and
+act
+and
+yet
+we
+do
+not
+know
+ourselves
+Sp
+You
+don
+t
+Well
+that
+s
+too
+bad
+about
+you
+Dr
+Did
+you
+ever
+stop
+to
+think
+how
+wonderful
+sound
+is
+Sp
+It
+s
+no
+more
+wonderful
+than
+anything
+else
+Now
+let
+me
+go
+I
+don
+t
+want
+you
+to
+hold
+me
+any
+longer
+Dr
+No
+I
+can
+t
+let
+you
+go
+until
+you
+behave
+yourself
+Sp
+If
+you
+didn
+t
+hold
+me
+I
+would
+knock
+you
+down
+as
+quick
+as
+lightning
+I
+can
+get
+mad
+I
+have
+a
+temper
+Dr
+Now
+Johnnie
+listen
+to
+what
+I
+have
+to
+say
+Sp
+Johnnie
+That
+s
+not
+my
+name
+I
+will
+not
+tell
+you
+what
+it
+is
+Dr
+Did
+you
+kill
+any
+one
+and
+is
+that
+why
+you
+are
+so
+full
+of
+hatred
+Sp
+No
+I
+am
+an
+honest
+man
+I
+want
+to
+have
+my
+own
+way
+and
+I
+always
+do
+I
+get
+so
+mad
+Dr
+What
+church
+did
+you
+belong
+to
+Sp
+That
+s
+none
+of
+your
+business
+Dr
+Were
+you
+a
+minister
+or
+a
+deacon
+Sp
+No
+I
+wasn
+t
+I
+ll
+not
+tell
+you
+anything
+so
+keep
+still
+Closing
+lips
+firmly
+Dr
+Why
+are
+you
+sitting
+so
+quietly
+Sp
+Be
+still
+I
+am
+thinking
+I
+want
+to
+be
+by
+myself
+Dr
+What
+evil
+thoughts
+have
+you
+in
+your
+mind
+now
+Sp
+You
+look
+out
+asking
+me
+such
+questions
+When
+I
+get
+mad
+I
+could
+knock
+this
+house
+down
+in
+a
+minute
+I
+could
+knock
+everybody
+down
+Dr
+Talk
+is
+cheap
+Sp
+You
+might
+as
+well
+say
+big
+things
+as
+little
+ones
+Dr
+Tell
+us
+who
+you
+are
+and
+how
+long
+you
+have
+been
+dead
+Sp
+Stamping
+feet
+violently
+and
+struggling
+If
+I
+could
+get
+loose
+I
+d
+show
+you
+I
+m
+not
+dead
+I
+ve
+told
+you
+that
+before
+now
+keep
+quiet
+Dr
+But
+you
+are
+talking
+through
+my
+wife
+s
+body
+Sp
+Just
+let
+me
+get
+free
+and
+I
+ll
+show
+you
+a
+few
+things
+Dr
+That
+is
+bombastic
+and
+does
+not
+amount
+to
+anything
+You
+are
+talking
+through
+my
+wife
+s
+body
+Sp
+I
+will
+not
+listen
+to
+you
+any
+longer
+I
+have
+no
+use
+whatever
+for
+you
+Only
+for
+that
+electricity
+you
+couldn
+t
+have
+chased
+me
+out
+and
+put
+me
+in
+prison
+I
+ll
+knock
+you
+down
+when
+I
+get
+loose
+We
+can
+part
+right
+here
+you
+going
+your
+way
+and
+I
+mine
+That
+will
+suit
+me
+just
+right
+Dr
+But
+we
+want
+to
+part
+friends
+Sp
+You
+say
+friends
+You
+can
+never
+find
+a
+friend
+in
+me
+when
+you
+give
+me
+electricity
+like
+you
+did
+Dr
+Those
+were
+just
+friendly
+taps
+That
+was
+the
+best
+thing
+that
+ever
+happened
+to
+you
+Sp
+Sarcastically
+You
+think
+so
+Dr
+Try
+to
+understand
+that
+you
+are
+talking
+through
+my
+wife
+s
+body
+Sp
+I
+don
+t
+want
+to
+have
+anything
+to
+do
+with
+your
+wife
+All
+women
+can
+go
+their
+way
+and
+I
+ll
+go
+mine
+I
+want
+nothing
+to
+do
+with
+women
+and
+I
+don
+t
+want
+your
+wife
+any
+more
+than
+the
+rest
+I
+never
+knew
+your
+wife
+Keep
+her
+yourself
+Dr
+You
+are
+talking
+through
+my
+wife
+s
+body
+You
+cannot
+realize
+your
+condition
+because
+you
+are
+so
+ignorant
+Sp
+You
+are
+just
+as
+ignorant
+as
+I
+am
+Dr
+Be
+free
+and
+open
+minded
+Try
+to
+realize
+that
+you
+are
+a
+spirit
+You
+are
+a
+foolish
+spirit
+and
+do
+not
+know
+it
+Sp
+A
+gentleman
+to
+call
+a
+man
+a
+fool
+Dr
+You
+are
+a
+foolish
+selfish
+spirit
+If
+you
+were
+intelligent
+you
+would
+listen
+to
+me
+Sp
+I
+don
+t
+care
+just
+leave
+my
+hands
+alone
+Dr
+I
+am
+not
+holding
+your
+hands
+I
+am
+holding
+my
+wife
+s
+hands
+Sp
+For
+God
+s
+sake
+can
+t
+you
+see
+I
+am
+a
+man
+Don
+t
+mix
+your
+wife
+with
+me
+Take
+her
+I
+m
+sure
+I
+don
+t
+want
+her
+Dr
+If
+you
+were
+not
+stubborn
+you
+would
+realize
+there
+is
+something
+the
+matter
+with
+you
+Look
+at
+your
+hands
+Sp
+Refusing
+to
+look
+They
+are
+mine
+If
+I
+could
+get
+loose
+I
+would
+show
+you
+a
+thing
+or
+two
+I
+have
+more
+strength
+now
+than
+I
+have
+had
+for
+some
+time
+Now
+I
+can
+talk
+again
+Before
+someone
+always
+interfered
+with
+me
+Now
+I
+am
+myself
+and
+can
+talk
+and
+fight
+Dr
+You
+are
+talking
+through
+my
+wife
+s
+body
+Sp
+I
+ll
+knock
+you
+in
+the
+bead
+if
+you
+don
+t
+stop
+talking
+about
+your
+wife
+Dr
+My
+wife
+is
+a
+psychic
+Sp
+Well
+what
+of
+that
+What
+do
+I
+care
+I
+don
+t
+care
+if
+your
+wife
+is
+a
+thousand
+psychics
+Dr
+Intelligent
+spirits
+have
+brought
+you
+here
+to
+be
+helped
+and
+unless
+you
+are
+willing
+to
+listen
+to
+reason
+you
+will
+be
+put
+in
+a
+dungeon
+Sp
+You
+can
+do
+just
+as
+you
+please
+Dr
+What
+do
+you
+gain
+by
+acting
+this
+way
+We
+are
+trying
+to
+bring
+you
+to
+an
+understanding
+Sp
+I
+was
+converted
+once
+by
+a
+rascal
+of
+a
+minister
+He
+took
+all
+of
+my
+money
+and
+then
+kicked
+me
+out
+Dr
+Probably
+that
+was
+a
+good
+thing
+for
+you
+Sp
+What
+To
+kick
+me
+out
+I
+just
+asked
+him
+a
+few
+questions
+about
+life
+and
+he
+said
+You
+big
+sinner
+get
+out
+of
+here
+All
+he
+wanted
+was
+money
+Dr
+But
+that
+didn
+t
+settle
+the
+question
+of
+life
+Sp
+The
+question
+of
+life
+Life
+is
+life
+that
+s
+all
+We
+are
+born
+here
+we
+stay
+for
+a
+while
+and
+then
+go
+Dr
+Where
+was
+the
+church
+you
+speak
+of
+What
+denomination
+Sp
+I
+will
+not
+tell
+my
+secrets
+to
+you
+I
+will
+not
+talk
+anything
+about
+myself
+I
+won
+t
+tell
+my
+name
+or
+the
+ministers
+Dr
+You
+do
+not
+understand
+that
+you
+are
+among
+friends
+We
+can
+help
+you
+You
+will
+find
+we
+can
+help
+you
+to
+understand
+things
+of
+which
+you
+are
+ignorant
+now
+I
+have
+told
+you
+many
+times
+that
+you
+have
+lost
+your
+body
+and
+are
+a
+spirit
+and
+yet
+you
+do
+not
+understand
+it
+Sp
+I
+have
+not
+lost
+my
+body
+because
+I
+have
+lots
+of
+bodies
+Mr
+G
+How
+could
+you
+have
+more
+than
+one
+body
+Sp
+I
+don
+t
+know
+about
+that
+but
+I
+had
+enjoyment
+with
+others
+Mrs
+G
+How
+did
+you
+find
+these
+others
+Sp
+I
+don
+t
+know
+but
+that
+doesn
+t
+bother
+me
+a
+bit
+Mr
+G
+How
+could
+you
+be
+a
+man
+one
+time
+and
+a
+woman
+another
+Sp
+I
+didn
+t
+stop
+to
+think
+anything
+about
+that
+I
+don
+t
+know
+myself
+Mr
+G
+Who
+brought
+you
+here
+Sp
+They
+brought
+me
+here
+Mr
+G
+Who
+Sp
+I
+don
+t
+know
+I
+was
+not
+going
+to
+come
+here
+at
+all
+but
+they
+made
+me
+come
+I
+said
+I
+would
+never
+come
+here
+any
+more
+Mr
+G
+Have
+you
+been
+here
+before
+Sp
+Sometimes
+Mr
+G
+Who
+brought
+you
+here
+Sp
+I
+told
+you
+I
+didn
+t
+know
+Mr
+G
+Look
+closely
+don
+t
+you
+recognize
+the
+one
+who
+brought
+you
+here
+Sp
+I
+don
+t
+know
+and
+I
+don
+t
+care
+Mr
+G
+Have
+we
+ever
+talked
+to
+you
+before
+Sp
+It
+seems
+so
+Dr
+Do
+you
+recognize
+the
+man
+talking
+to
+you
+You
+may
+have
+been
+friends
+Mr
+G
+Is
+there
+anyone
+here
+whom
+you
+have
+seen
+before
+Sp
+I
+don
+t
+know
+With
+all
+that
+electricity
+on
+my
+head
+it
+hurts
+and
+I
+feel
+like
+knocking
+somebody
+down
+Mrs
+G
+How
+did
+you
+get
+here
+Sp
+That
+s
+nobody
+s
+business
+I
+have
+a
+temper
+that
+no
+one
+can
+conquer
+I
+get
+mad
+as
+quick
+as
+lightning
+and
+it
+comes
+like
+thunder
+Mrs
+G
+When
+you
+get
+into
+another
+body
+do
+you
+have
+a
+temper
+at
+that
+time
+Sp
+Yes
+I
+have
+a
+bad
+temper
+I
+don
+t
+know
+why
+I
+get
+mad
+sometimes
+but
+I
+get
+mad
+like
+fury
+at
+everything
+I
+have
+to
+go
+here
+and
+there
+Mrs
+G
+Can
+t
+you
+stay
+at
+a
+certain
+place
+if
+you
+want
+to
+Sp
+No
+I
+have
+to
+go
+along
+and
+I
+get
+so
+mad
+Mr
+G
+You
+are
+not
+independent
+then
+Sp
+I
+don
+t
+know
+I
+get
+so
+furious
+when
+I
+have
+to
+go
+places
+and
+I
+don
+t
+want
+to
+go
+I
+get
+awful
+mad
+Mr
+G
+Would
+you
+like
+to
+get
+over
+being
+mad
+Pointing
+to
+Dr
+W
+There
+is
+a
+gentleman
+who
+can
+tell
+you
+all
+about
+your
+condition
+as
+he
+is
+a
+physician
+Dr
+If
+you
+will
+be
+sensible
+we
+can
+help
+you
+Sp
+Sometimes
+I
+fly
+off
+about
+things
+that
+don
+t
+amount
+to
+a
+pinch
+of
+snuff
+I
+don
+t
+know
+why
+I
+do
+that
+Dr
+You
+allow
+yourself
+to
+fly
+to
+pieces
+over
+nothing
+Sp
+Things
+don
+t
+always
+go
+my
+way
+and
+when
+they
+don
+t
+I
+don
+t
+feel
+right
+Sometimes
+I
+feel
+as
+if
+I
+did
+not
+have
+whole
+control
+and
+I
+am
+only
+half
+and
+half
+and
+then
+I
+get
+mad
+Dr
+You
+are
+hovering
+around
+people
+and
+using
+their
+bodies
+You
+are
+not
+really
+dead
+The
+mind
+is
+one
+thing
+and
+the
+body
+another
+You
+have
+lost
+your
+mortal
+body
+and
+your
+spiritual
+body
+looks
+like
+your
+mortal
+body
+You
+are
+ignorant
+of
+your
+condition
+and
+come
+in
+touch
+with
+mortals
+who
+are
+sensitives
+then
+you
+try
+to
+control
+them
+but
+they
+have
+wills
+of
+their
+own
+too
+Sp
+I
+always
+get
+mad
+at
+that
+machine
+Mrs
+G
+Don
+t
+you
+like
+machinery
+Sp
+No
+I
+feel
+sometimes
+as
+if
+I
+could
+knock
+it
+all
+to
+pieces
+I
+get
+so
+mad
+at
+it
+Mrs
+G
+Do
+you
+mean
+the
+automobile
+Sp
+I
+don
+t
+know
+What
+does
+that
+mean
+Is
+it
+that
+machine
+that
+runs
+without
+horses
+Dr
+You
+have
+never
+seen
+an
+automobile
+have
+you
+Sp
+Is
+it
+that
+machine
+that
+goes
+Whz
+z
+z
+Circling
+arms
+around
+wildly
+Dr
+Have
+you
+never
+seen
+one
+of
+those
+machines
+Who
+is
+President
+Sp
+I
+don
+t
+know
+I
+haven
+t
+read
+a
+paper
+for
+years
+Dr
+Was
+McKinley
+the
+President
+Sp
+No
+Cleveland
+Dr
+Do
+you
+remember
+the
+Chicago
+World
+s
+Fair
+Sp
+No
+I
+don
+t
+Dr
+Where
+did
+you
+live
+Sp
+I
+lived
+in
+Kansas
+Mr
+G
+Whose
+early
+years
+were
+spent
+in
+Kansas
+In
+H
+or
+N
+Dr
+You
+talk
+things
+over
+with
+that
+gentleman
+Mr
+G
+Mr
+G
+Did
+you
+know
+a
+family
+there
+called
+G
+Sp
+Yes
+they
+lived
+in
+that
+pretty
+house
+a
+big
+house
+Mr
+G
+Did
+you
+live
+in
+N
+Sp
+No
+a
+little
+outside
+I
+was
+a
+helper
+here
+and
+there
+I
+never
+stayed
+long
+in
+one
+place
+Mr
+G
+Did
+you
+live
+on
+farms
+Sp
+Yes
+where
+they
+had
+horses
+I
+don
+t
+like
+to
+ride
+in
+that
+Ch
+ch
+ch
+I
+get
+so
+mad
+when
+things
+don
+t
+go
+just
+right
+Mr
+G
+You
+can
+go
+so
+much
+further
+with
+a
+machine
+than
+you
+can
+with
+horses
+Sp
+I
+like
+air
+and
+you
+don
+t
+always
+have
+the
+windows
+open
+in
+that
+machine
+shut
+up
+in
+there
+Mr
+G
+Were
+you
+ever
+sick
+or
+did
+you
+have
+an
+accident
+Sp
+I
+am
+not
+quite
+sure
+but
+it
+seems
+I
+have
+something
+the
+matter
+with
+my
+head
+I
+do
+not
+really
+know
+what
+happened
+I
+lose
+my
+temper
+so
+often
+that
+I
+know
+there
+is
+something
+the
+matter
+with
+me
+Mr
+G
+Do
+you
+remember
+any
+of
+the
+G
+boys
+Sp
+I
+have
+heard
+of
+them
+Mr
+G
+How
+old
+were
+you
+About
+as
+old
+as
+R
+Sp
+He
+was
+that
+stout
+fellow
+Mr
+G
+Were
+you
+as
+old
+as
+he
+Sp
+No
+no
+He
+was
+more
+lively
+than
+the
+other
+fellow
+and
+liked
+to
+have
+a
+good
+time
+The
+other
+fellow
+Mr
+G
+studied
+He
+wanted
+to
+go
+off
+by
+himself
+I
+think
+he
+was
+going
+to
+study
+for
+a
+minister
+or
+a
+lawyer
+or
+something
+because
+he
+always
+had
+a
+book
+with
+him
+This
+was
+correct
+Mr
+G
+Did
+he
+ever
+sing
+SP
+Who
+Mr
+G
+This
+other
+fellow
+Sp
+I
+don
+t
+know
+very
+much
+about
+him
+I
+was
+just
+a
+helper
+around
+Mr
+G
+Did
+you
+work
+around
+at
+their
+home
+Sp
+No
+I
+lived
+Southwest
+The
+farm
+was
+in
+the
+hollow
+in
+the
+distance
+You
+go
+up
+the
+hill
+and
+then
+down
+in
+the
+hollow
+that
+s
+the
+place
+Mr
+G
+Down
+toward
+W
+Sp
+Yes
+Mr
+G
+Did
+you
+have
+an
+accident
+there
+Sp
+I
+can
+t
+remember
+I
+know
+I
+had
+something
+the
+matter
+with
+my
+head
+There
+were
+a
+lot
+of
+fellows
+out
+with
+the
+threshing
+machine
+the
+threshing
+gang
+Mr
+G
+You
+must
+have
+been
+hurt
+very
+badly
+at
+that
+time
+Sp
+Do
+you
+mean
+when
+they
+were
+threshing
+on
+that
+farm
+What
+is
+the
+matter
+with
+my
+head
+Mr
+G
+You
+must
+have
+been
+so
+badly
+hurt
+that
+you
+passed
+on
+Dr
+Possibly
+you
+thought
+you
+went
+to
+sleep
+You
+lost
+your
+physical
+body
+Most
+people
+would
+call
+you
+dead
+but
+you
+are
+not
+really
+dead
+Mr
+G
+Did
+you
+know
+Tom
+Another
+spirit
+who
+had
+previously
+been
+dislodged
+from
+Mr
+G
+He
+is
+a
+good
+friend
+of
+mine
+Sp
+Yes
+and
+he
+is
+here
+He
+says
+he
+came
+here
+to
+help
+you
+But
+how
+is
+he
+going
+to
+help
+you
+Mr
+G
+Ask
+Tom
+Dr
+Ask
+him
+why
+he
+is
+going
+to
+help
+this
+gentleman
+and
+why
+he
+needs
+help
+Sp
+Tom
+says
+to
+me
+You
+get
+out
+Dr
+You
+listen
+to
+him
+he
+will
+tell
+you
+the
+truth
+Sp
+If
+he
+tells
+me
+anything
+that
+isn
+t
+true
+I
+ll
+knock
+his
+block
+off
+Tom
+says
+that
+I
+for
+God
+s
+sake
+no
+Excitedly
+Tom
+say
+that
+I
+he
+says
+that
+I
+have
+been
+sponging
+on
+that
+man
+Mr
+G
+for
+years
+Dr
+It
+sounds
+strange
+but
+it
+is
+true
+Mr
+G
+Tom
+did
+it
+too
+He
+bothered
+me
+a
+great
+deal
+Now
+he
+is
+a
+good
+friend
+of
+mine
+as
+you
+are
+You
+and
+I
+are
+going
+to
+be
+good
+friends
+are
+we
+not
+Sp
+Why
+did
+I
+get
+so
+mad
+at
+things
+Dr
+When
+you
+hurt
+your
+head
+you
+may
+have
+disturbed
+your
+mind
+Sp
+Tom
+says
+he
+is
+trying
+to
+help
+you
+get
+rid
+of
+me
+that
+s
+what
+he
+says
+He
+s
+going
+to
+get
+left
+Why
+does
+he
+want
+to
+get
+rid
+of
+me
+Mr
+G
+Then
+you
+will
+be
+free
+He
+is
+a
+good
+friend
+of
+ours
+We
+are
+all
+going
+to
+work
+together
+You
+will
+have
+your
+own
+body
+and
+you
+will
+not
+have
+to
+get
+out
+of
+anyone
+Sp
+I
+don
+t
+understand
+what
+you
+folks
+mean
+Dr
+I
+will
+explain
+Don
+t
+contradict
+me
+no
+matter
+how
+foolish
+it
+may
+seem
+to
+you
+I
+will
+tell
+you
+nothing
+but
+the
+absolute
+truth
+Sp
+If
+you
+don
+t
+you
+look
+out
+Dr
+You
+lost
+your
+mortal
+body
+some
+time
+ago
+It
+is
+now
+Sp
+You
+mean
+Dr
+That
+was
+when
+Cleveland
+was
+President
+the
+second
+time
+You
+have
+been
+so
+called
+dead
+all
+these
+years
+There
+is
+no
+actual
+death
+The
+mind
+is
+one
+thing
+the
+body
+another
+It
+is
+the
+physical
+body
+which
+dies
+but
+not
+the
+mind
+or
+spirit
+You
+are
+not
+talking
+through
+your
+own
+body
+now
+Sp
+I
+m
+not
+Dr
+No
+you
+are
+speaking
+through
+my
+wife
+She
+is
+so
+constituted
+that
+spirits
+can
+control
+her
+and
+speak
+through
+her
+and
+we
+are
+having
+these
+investigating
+circles
+to
+come
+in
+contact
+with
+spirits
+like
+yourself
+Ignorant
+spirits
+often
+influence
+mortals
+and
+disturb
+their
+balance
+You
+conveyed
+your
+temper
+to
+this
+gentleman
+Mr
+G
+and
+made
+him
+act
+as
+if
+he
+had
+a
+bad
+temper
+Sp
+I
+did
+Mr
+G
+Did
+you
+ride
+in
+that
+machine
+Sp
+Yes
+but
+I
+hate
+it
+Dr
+I
+ll
+tell
+you
+about
+those
+machines
+About
+they
+began
+to
+invent
+what
+they
+call
+automobiles
+these
+machines
+go
+without
+horses
+for
+they
+run
+by
+their
+own
+power
+We
+have
+millions
+of
+them
+now
+Sp
+What
+have
+they
+done
+with
+their
+fine
+horses
+Dr
+They
+do
+not
+use
+them
+now
+Automobiles
+are
+very
+convenient
+you
+can
+travel
+one
+hundred
+miles
+an
+hour
+but
+the
+average
+is
+twenty
+or
+twenty
+five
+miles
+an
+hour
+Sp
+I
+wouldn
+t
+ride
+in
+one
+that
+goes
+that
+fast
+Dr
+You
+can
+travel
+two
+or
+three
+hundred
+miles
+a
+day
+These
+machines
+have
+been
+invented
+since
+you
+lost
+your
+body
+We
+have
+aeroplanes
+now
+that
+fly
+in
+the
+air
+and
+we
+can
+telegraph
+without
+any
+wires
+We
+can
+even
+talk
+across
+the
+ocean
+without
+any
+wires
+You
+cannot
+realize
+what
+wonderful
+things
+have
+happened
+since
+you
+passed
+out
+Do
+you
+know
+that
+you
+are
+in
+California
+now
+Sp
+I
+feel
+so
+weak
+Dr
+Don
+t
+lose
+control
+friend
+until
+you
+give
+us
+your
+name
+Sp
+I
+don
+t
+know
+it
+my
+head
+is
+in
+such
+a
+mess
+Don
+t
+bother
+me
+and
+I
+will
+tell
+it
+to
+you
+in
+a
+little
+while
+For
+a
+long
+time
+I
+have
+had
+so
+many
+different
+names
+that
+I
+don
+t
+remember
+my
+name
+at
+all
+Dr
+Look
+around
+your
+mother
+may
+be
+here
+Sp
+I
+heard
+my
+mother
+call
+me
+one
+time
+Sometimes
+I
+am
+Charlie
+sometimes
+Henry
+sometimes
+a
+man
+and
+sometimes
+a
+woman
+so
+I
+don
+t
+know
+what
+name
+to
+give
+you
+It
+s
+so
+long
+since
+I
+heard
+my
+own
+name
+that
+I
+seem
+to
+have
+forgotten
+it
+Mr
+G
+Ask
+Tom
+what
+your
+name
+is
+Sp
+He
+says
+my
+name
+is
+Fred
+Yes
+that
+s
+it
+Fred
+Mr
+G
+Fred
+what
+Ask
+Tom
+Sp
+How
+can
+a
+man
+forget
+his
+own
+name
+There
+must
+be
+something
+the
+matter
+with
+him
+Dr
+What
+did
+they
+call
+your
+father
+What
+did
+your
+father
+do
+Mr
+G
+Was
+he
+a
+farmer
+Sp
+No
+he
+was
+not
+a
+farmer
+but
+he
+had
+some
+land
+We
+were
+further
+down
+from
+that
+college
+where
+that
+church
+was
+My
+father
+was
+a
+German
+Mr
+G
+Was
+he
+a
+Mennonite
+Sp
+No
+my
+father
+came
+where
+they
+were
+but
+went
+further
+back
+What
+is
+the
+matter
+with
+me
+Why
+can
+t
+I
+think
+what
+my
+name
+is
+Mr
+G
+Tom
+will
+tell
+you
+if
+you
+ask
+him
+SP
+I
+can
+get
+certain
+places
+and
+things
+then
+I
+can
+t
+go
+any
+further
+I
+remember
+Fred
+because
+everybody
+called
+me
+that
+Dr
+Well
+I
+wouldn
+t
+worry
+about
+it
+any
+more
+Your
+memory
+will
+come
+back
+to
+you
+You
+are
+a
+spirit
+and
+when
+you
+leave
+here
+intelligent
+spirits
+will
+take
+care
+of
+you
+SP
+Tom
+says
+he
+is
+going
+to
+take
+me
+to
+a
+home
+or
+rest
+I
+have
+been
+so
+worried
+and
+I
+get
+so
+tired
+out
+that
+I
+get
+mad
+at
+everything
+I
+will
+not
+be
+angry
+any
+more
+Whenever
+I
+got
+mad
+I
+suffered
+terribly
+after
+it
+I
+always
+felt
+so
+bad
+because
+I
+could
+not
+control
+myself
+I
+always
+felt
+so
+sorry
+I
+said
+such
+mean
+things
+and
+I
+was
+too
+proud
+to
+acknowledge
+it
+but
+I
+knew
+it
+just
+the
+same
+Tom
+says
+Come
+on
+we
+must
+go
+I
+want
+to
+go
+now
+To
+Mr
+G
+Tom
+says
+I
+must
+ask
+you
+if
+you
+will
+forgive
+me
+for
+making
+so
+much
+mischief
+for
+you
+Mr
+G
+We
+are
+going
+to
+help
+you
+and
+let
+bygones
+be
+bygones
+Sp
+You
+are
+not
+mad
+at
+me
+are
+you
+Mr
+G
+Not
+at
+all
+Sp
+I
+feel
+so
+weak
+what
+will
+I
+do
+I
+am
+too
+weak
+to
+go
+with
+Tom
+Dr
+That
+weakness
+is
+a
+common
+experience
+with
+spirits
+when
+they
+begin
+to
+understand
+It
+is
+only
+a
+temporary
+sensation
+you
+are
+merely
+losing
+control
+Think
+yourself
+with
+Tom
+and
+the
+Mercy
+Band
+of
+spirits
+Sp
+My
+head
+feels
+so
+funny
+Am
+I
+going
+crazy
+You
+had
+better
+get
+a
+doctor
+because
+I
+think
+I
+am
+going
+to
+die
+Dr
+You
+will
+be
+all
+right
+as
+soon
+as
+you
+leave
+this
+body
+Sp
+I
+need
+a
+doctor
+for
+the
+blood
+is
+all
+coming
+up
+in
+my
+throat
+and
+I
+can
+t
+breathe
+I
+feel
+so
+choked
+Maybe
+I
+can
+get
+to
+sleep
+Doctors
+always
+say
+if
+you
+can
+sleep
+it
+is
+better
+when
+you
+feel
+weak
+I
+am
+not
+going
+to
+die
+am
+I
+Dr
+You
+must
+remember
+that
+you
+are
+a
+spirit
+and
+are
+controlling
+a
+mortal
+body
+Sp
+Fred
+Haupt
+is
+my
+name
+Tom
+says
+I
+must
+ask
+you
+to
+forgive
+me
+because
+I
+have
+made
+so
+much
+trouble
+in
+getting
+you
+in
+a
+temper
+Mr
+G
+Certainly
+I
+forgive
+you
+Thank
+Tom
+for
+helping
+both
+you
+and
+me
+Sp
+Goodbye
+Silver
+Star
+the
+Indian
+guide
+of
+Mrs
+Wickland
+then
+came
+in
+and
+said
+to
+Mr
+G
+We
+got
+the
+man
+Now
+we
+are
+going
+to
+take
+him
+to
+a
+hospital
+We
+worked
+hard
+to
+get
+him
+he
+was
+so
+in
+your
+magnetic
+aura
+that
+it
+seemed
+like
+taking
+a
+piece
+out
+of
+your
+body
+to
+detach
+him
+from
+you
+He
+had
+been
+with
+you
+for
+a
+long
+time
+he
+was
+with
+you
+when
+you
+were
+a
+child
+When
+things
+did
+not
+go
+right
+for
+him
+he
+flew
+into
+a
+temper
+It
+will
+be
+a
+great
+relief
+to
+have
+him
+away
+and
+you
+will
+feel
+like
+a
+new
+person
+You
+will
+not
+feel
+so
+irritable
+He
+has
+been
+working
+on
+you
+nearly
+all
+your
+life
+but
+lately
+he
+has
+become
+stronger
+and
+stronger
+until
+he
+almost
+had
+control
+of
+you
+Now
+we
+have
+him
+and
+he
+won
+t
+bother
+you
+any
+more
+He
+is
+very
+weak
+and
+needs
+hospital
+care
+he
+can
+hardly
+walk
+He
+will
+have
+to
+be
+nursed
+He
+has
+been
+living
+on
+you
+and
+with
+that
+strength
+taken
+away
+from
+him
+he
+is
+very
+weak
+but
+he
+will
+he
+taken
+care
+of
+CHAPTER
+XII
+Selfishness
+THOSE
+whose
+earthly
+interests
+have
+been
+superficial
+who
+have
+been
+dominated
+by
+pride
+vanity
+greed
+ambition
+and
+selfishness
+are
+held
+in
+the
+earth
+sphere
+after
+transition
+until
+these
+tendencies
+have
+been
+conquered
+and
+love
+and
+sympathy
+have
+been
+developed
+through
+service
+for
+others
+Frequently
+spirits
+whose
+earth
+lives
+were
+spent
+in
+pursuit
+of
+pleasure
+and
+the
+pastimes
+of
+wealthy
+society
+have
+attained
+realization
+of
+a
+higher
+life
+through
+our
+psychic
+circle
+Among
+these
+was
+one
+who
+sank
+with
+the
+Titanic
+in
+EXPERIENCE
+OCTOBER
+Spirit
+JOHN
+J
+A
+Psychic
+MRS
+WICKLAND
+After
+the
+spirit
+of
+W
+T
+Stead
+had
+visited
+with
+us
+a
+few
+moments
+another
+spirit
+came
+in
+struggling
+desperately
+as
+if
+swimming
+and
+called
+loudly
+for
+aid
+Spirit
+Help
+Help
+Doctor
+Where
+did
+you
+come
+from
+Sp
+That
+man
+who
+just
+left
+told
+me
+to
+come
+in
+here
+Dr
+Have
+you
+been
+in
+the
+water
+Sp
+I
+drowned
+but
+I
+have
+come
+to
+life
+again
+I
+cannot
+see
+that
+man
+now
+but
+I
+heard
+him
+talking
+and
+he
+told
+me
+to
+step
+in
+He
+said
+that
+you
+know
+the
+way
+and
+would
+teach
+me
+and
+that
+I
+could
+go
+with
+him
+afterwards
+But
+now
+I
+cannot
+see
+him
+I
+m
+blind
+I
+m
+blind
+I
+don
+t
+know
+whether
+the
+water
+blinded
+me
+or
+not
+but
+I
+am
+blind
+Dr
+That
+is
+only
+spiritual
+blindness
+When
+a
+person
+passes
+out
+of
+his
+physical
+body
+without
+a
+knowledge
+of
+the
+laws
+of
+the
+higher
+life
+he
+finds
+himself
+in
+a
+condition
+of
+darkness
+It
+is
+the
+darkness
+of
+ignorance
+Sp
+Then
+I
+will
+not
+always
+be
+blind
+Dr
+You
+must
+realize
+that
+you
+are
+in
+the
+spirit
+world
+and
+that
+spirit
+friends
+are
+here
+who
+will
+teach
+you
+how
+to
+progress
+out
+of
+your
+condition
+of
+darkness
+SP
+I
+can
+see
+a
+little
+now
+For
+a
+while
+I
+could
+see
+but
+the
+door
+was
+shut
+again
+and
+I
+could
+not
+see
+through
+I
+was
+with
+my
+wife
+and
+child
+for
+a
+time
+but
+no
+one
+noticed
+me
+But
+now
+the
+door
+is
+closed
+and
+I
+am
+out
+in
+the
+cold
+I
+am
+all
+alone
+when
+I
+go
+to
+my
+home
+Changes
+seem
+to
+have
+taken
+place
+I
+do
+not
+know
+what
+I
+shall
+do
+Dr
+You
+have
+not
+realized
+your
+own
+situation
+Sp
+What
+is
+the
+matter
+anyway
+What
+is
+causing
+this
+darkness
+What
+can
+I
+do
+to
+get
+out
+of
+it
+I
+never
+was
+so
+handicapped
+as
+I
+am
+now
+I
+was
+all
+right
+for
+just
+a
+minute
+I
+hear
+somebody
+talking
+There
+now
+I
+see
+him
+again
+Was
+it
+Mr
+Stead
+Dr
+Mr
+Stead
+was
+speaking
+through
+this
+instrument
+just
+before
+you
+came
+Mr
+Stead
+probably
+brought
+you
+here
+for
+help
+It
+is
+our
+work
+to
+awaken
+earthbound
+spirits
+who
+are
+in
+darkness
+Sp
+This
+darkness
+is
+terrible
+I
+have
+been
+in
+this
+darkness
+for
+a
+long
+time
+Dr
+Understand
+that
+there
+is
+no
+death
+Life
+continues
+in
+the
+spirit
+world
+where
+each
+one
+must
+serve
+others
+in
+order
+to
+progress
+Sp
+I
+really
+was
+not
+what
+I
+should
+have
+been
+I
+just
+lived
+for
+self
+I
+wanted
+amusement
+and
+to
+spend
+money
+But
+now
+all
+I
+have
+seen
+is
+my
+past
+and
+I
+have
+been
+in
+the
+darkness
+and
+it
+is
+terrible
+Every
+act
+of
+my
+past
+stands
+before
+me
+and
+I
+want
+to
+run
+away
+from
+it
+but
+I
+cannot
+It
+is
+there
+all
+the
+time
+and
+accuses
+me
+because
+I
+could
+have
+done
+differently
+I
+have
+seen
+so
+many
+places
+where
+I
+could
+have
+done
+good
+but
+now
+it
+seems
+too
+late
+Dr
+When
+a
+person
+lives
+for
+self
+alone
+he
+usually
+finds
+himself
+in
+darkness
+when
+he
+passes
+over
+to
+the
+other
+side
+of
+life
+You
+must
+obtain
+understanding
+of
+the
+glories
+of
+the
+spirit
+world
+and
+realize
+that
+life
+there
+is
+service
+to
+others
+That
+is
+the
+true
+Heaven
+it
+is
+a
+condition
+of
+mind
+Sp
+Why
+are
+not
+these
+things
+taught
+in
+the
+world
+Dr
+Would
+the
+world
+listen
+Humanity
+as
+a
+whole
+does
+not
+look
+for
+the
+spiritual
+side
+of
+life
+but
+looks
+for
+other
+things
+The
+world
+is
+seeking
+for
+amusement
+and
+for
+selfish
+gain
+not
+for
+truth
+Sp
+There
+is
+such
+a
+queer
+feeling
+coming
+over
+me
+Mother
+Mother
+my
+loving
+mother
+Spirit
+I
+am
+a
+man
+but
+I
+feel
+like
+a
+child
+in
+your
+arms
+again
+I
+have
+been
+longing
+for
+you
+but
+I
+have
+been
+living
+all
+by
+myself
+in
+the
+terrible
+darkness
+Why
+is
+it
+that
+I
+should
+be
+in
+the
+dark
+Cannot
+my
+eyes
+be
+cured
+Will
+I
+be
+blind
+all
+the
+time
+Isn
+t
+it
+strange
+that
+I
+can
+see
+you
+yet
+I
+seem
+to
+be
+blind
+Dr
+You
+have
+a
+spiritual
+body
+now
+and
+when
+your
+spiritual
+eyes
+are
+opened
+you
+will
+see
+the
+beautiful
+things
+of
+the
+spirit
+world
+Sp
+I
+see
+Mr
+Stead
+there
+We
+were
+both
+on
+the
+same
+boat
+but
+he
+does
+not
+seem
+to
+be
+in
+the
+dark
+Dr
+He
+understood
+the
+truth
+of
+spirit
+return
+and
+life
+on
+the
+other
+side
+while
+he
+was
+on
+earth
+Life
+is
+a
+school
+and
+we
+must
+learn
+all
+we
+can
+about
+the
+spirit
+side
+of
+life
+while
+we
+are
+on
+earth
+for
+the
+only
+light
+we
+have
+when
+we
+pass
+to
+the
+other
+side
+is
+the
+knowledge
+pertaining
+to
+life
+s
+problems
+which
+we
+have
+gathered
+here
+Sp
+Why
+did
+no
+one
+ever
+tell
+me
+these
+things
+Dr
+Would
+you
+have
+listened
+to
+any
+one
+who
+would
+have
+tried
+to
+talk
+to
+you
+on
+these
+subjects
+Sp
+No
+one
+ever
+approached
+me
+with
+such
+ideas
+Dr
+What
+year
+do
+you
+think
+this
+is
+Sp
+Dr
+It
+is
+Sp
+Where
+have
+I
+been
+I
+have
+been
+very
+hungry
+and
+cold
+I
+had
+a
+very
+great
+deal
+of
+money
+but
+lately
+when
+I
+have
+wanted
+some
+to
+spend
+I
+could
+not
+get
+hold
+of
+it
+Sometimes
+I
+seemed
+to
+be
+shut
+up
+in
+a
+room
+very
+dark
+and
+I
+could
+see
+nothing
+but
+a
+procession
+of
+my
+past
+life
+I
+was
+not
+a
+bad
+man
+but
+you
+probably
+know
+what
+society
+people
+are
+I
+did
+not
+know
+until
+now
+what
+it
+was
+to
+be
+poor
+It
+is
+a
+new
+experience
+to
+me
+Why
+should
+humanity
+not
+be
+taught
+differently
+before
+death
+Then
+there
+would
+not
+be
+such
+suffering
+as
+I
+am
+in
+now
+Dr
+If
+you
+will
+go
+with
+your
+mother
+and
+other
+spirit
+friends
+and
+try
+to
+understand
+what
+they
+tell
+you
+you
+will
+feel
+much
+happier
+Sp
+I
+can
+see
+Mr
+Stead
+I
+met
+him
+on
+the
+boat
+but
+I
+had
+no
+use
+for
+his
+teachings
+I
+thought
+he
+was
+old
+and
+that
+he
+had
+a
+hobby
+You
+know
+when
+people
+get
+old
+they
+have
+hobbies
+of
+one
+kind
+or
+another
+I
+never
+had
+time
+for
+such
+things
+because
+all
+I
+thought
+of
+was
+my
+money
+and
+society
+We
+do
+not
+see
+the
+poor
+people
+and
+we
+do
+not
+care
+to
+see
+them
+I
+could
+do
+so
+differently
+now
+but
+money
+is
+of
+no
+use
+to
+me
+any
+longer
+My
+mother
+is
+waiting
+for
+me
+and
+I
+should
+like
+to
+go
+with
+her
+for
+I
+have
+not
+seen
+her
+for
+years
+and
+it
+is
+so
+good
+to
+see
+her
+She
+says
+she
+could
+not
+reach
+me
+for
+I
+was
+like
+a
+crazy
+man
+and
+would
+not
+listen
+to
+her
+Bless
+you
+all
+for
+the
+help
+you
+have
+been
+to
+me
+and
+for
+having
+opened
+my
+eyes
+It
+is
+misery
+to
+be
+blind
+yet
+able
+to
+see
+the
+procession
+of
+your
+past
+life
+and
+not
+be
+able
+to
+see
+or
+hear
+anything
+else
+Dr
+We
+should
+like
+to
+know
+your
+name
+Sp
+I
+am
+John
+J
+A
+and
+I
+am
+glad
+I
+met
+you
+all
+I
+am
+so
+grateful
+for
+what
+you
+have
+told
+me
+Now
+I
+can
+see
+and
+hear
+and
+understand
+something
+that
+I
+did
+not
+know
+existed
+My
+mother
+and
+friends
+are
+coming
+for
+me
+and
+now
+I
+am
+going
+through
+that
+beautiful
+gate
+into
+what
+will
+be
+to
+me
+Heaven
+I
+again
+thank
+you
+all
+and
+hope
+some
+day
+to
+come
+and
+see
+you
+again
+Goodbye
+A
+few
+weeks
+later
+the
+foregoing
+spirit
+brought
+a
+friend
+another
+member
+of
+New
+York
+s
+aristocracy
+who
+had
+met
+his
+death
+at
+the
+sinking
+of
+the
+Lusitania
+EXPERIENCE
+NOVEMBER
+Spirit
+ALFRED
+V
+Psychic
+MRS
+WICKLAND
+Spirit
+Somebody
+told
+me
+to
+come
+in
+here
+and
+I
+would
+get
+warm
+Doctor
+What
+is
+your
+name
+Sp
+Alfred
+V
+I
+was
+on
+a
+boat
+John
+J
+A
+came
+and
+told
+me
+he
+would
+try
+to
+help
+me
+get
+in
+here
+He
+said
+if
+I
+would
+come
+in
+here
+I
+would
+get
+help
+Say
+I
+have
+never
+been
+hungry
+in
+my
+life
+before
+but
+I
+am
+both
+hungry
+and
+cold
+and
+my
+clothes
+are
+all
+wet
+Dr
+That
+is
+only
+a
+condition
+of
+your
+mind
+You
+have
+lost
+your
+physical
+body
+and
+should
+not
+feel
+the
+need
+of
+food
+Sp
+I
+know
+I
+drowned
+and
+I
+have
+been
+in
+misery
+ever
+since
+Dr
+If
+you
+had
+an
+understanding
+of
+the
+life
+hereafter
+and
+of
+progression
+in
+the
+spirit
+world
+you
+would
+soon
+find
+happiness
+through
+serving
+others
+Sp
+I
+never
+was
+happy
+I
+suppose
+I
+had
+my
+own
+way
+too
+much
+yet
+sometimes
+I
+felt
+what
+was
+the
+use
+But
+I
+thought
+Just
+forget
+yourself
+and
+have
+a
+good
+time
+You
+may
+not
+care
+for
+society
+life
+but
+in
+society
+you
+can
+drown
+yourself
+in
+gaiety
+I
+really
+did
+not
+care
+for
+society
+life
+I
+used
+to
+forget
+myself
+with
+my
+horses
+If
+you
+have
+a
+beautiful
+horse
+he
+is
+faithful
+to
+you
+through
+life
+But
+when
+you
+get
+into
+society
+women
+just
+show
+you
+one
+side
+smiles
+and
+sometimes
+they
+hate
+you
+The
+love
+I
+know
+most
+is
+the
+love
+of
+a
+beautiful
+faithful
+horse
+Horses
+were
+my
+pleasure
+and
+I
+felt
+they
+loved
+me
+Women
+liked
+me
+only
+for
+what
+I
+could
+do
+for
+them
+they
+wanted
+money
+and
+pleasure
+Women
+wanted
+all
+the
+money
+they
+could
+get
+from
+me
+I
+let
+go
+of
+things
+and
+tried
+to
+lose
+myself
+in
+pleasure
+but
+I
+was
+not
+happy
+Society
+does
+not
+know
+anything
+about
+honor
+and
+respectability
+If
+I
+could
+find
+people
+as
+faithful
+and
+true
+as
+my
+horse
+was
+to
+me
+I
+tell
+you
+I
+would
+thank
+you
+for
+that
+society
+But
+go
+into
+the
+kind
+of
+society
+I
+have
+known
+and
+men
+and
+women
+are
+nothing
+I
+was
+a
+sport
+myself
+but
+there
+were
+things
+that
+drove
+me
+to
+forget
+that
+little
+thing
+within
+me
+conscience
+I
+longed
+for
+something
+that
+was
+good
+but
+where
+can
+you
+find
+it
+Not
+amongst
+society
+but
+amongst
+horses
+Society
+is
+all
+right
+if
+you
+want
+that
+kind
+of
+a
+life
+You
+will
+probably
+realize
+that
+I
+developed
+a
+great
+deal
+of
+selfishness
+Dr
+You
+must
+try
+now
+to
+forget
+your
+past
+life
+with
+all
+its
+sorrow
+and
+bitterness
+Look
+for
+higher
+things
+then
+your
+spiritual
+eyes
+will
+be
+opened
+Sp
+Friends
+that
+took
+an
+interest
+in
+me
+brought
+me
+here
+and
+my
+eyes
+have
+been
+opened
+since
+I
+came
+I
+feel
+that
+probably
+but
+I
+am
+not
+sure
+a
+time
+may
+come
+when
+I
+can
+be
+happy
+I
+have
+never
+been
+really
+happy
+for
+when
+a
+child
+I
+had
+my
+own
+way
+too
+much
+I
+thank
+you
+for
+allowing
+me
+to
+come
+here
+If
+I
+ever
+am
+truly
+happy
+I
+will
+come
+back
+and
+tell
+you
+so
+A
+sequel
+to
+the
+above
+occurred
+several
+years
+later
+when
+John
+J
+A
+and
+Alfred
+V
+brought
+to
+our
+circle
+a
+friend
+of
+theirs
+Anna
+H
+stage
+celebrity
+EXPERIENCE
+SEPTEMBER
+Spirit
+ANNA
+H
+Psychic
+MRS
+WICKLAND
+Spirit
+Water
+Please
+water
+A
+glass
+of
+water
+was
+given
+and
+eagerly
+taken
+Thank
+you
+so
+much
+I
+have
+been
+very
+sick
+and
+am
+still
+weak
+The
+doctors
+really
+do
+not
+know
+what
+is
+the
+matter
+with
+me
+They
+said
+I
+must
+be
+kept
+quiet
+My
+legs
+and
+arms
+pain
+me
+so
+Doctor
+We
+will
+relieve
+your
+pain
+Manipulating
+arms
+of
+psychic
+Sp
+Be
+very
+careful
+about
+my
+bones
+I
+want
+to
+retain
+my
+beautiful
+form
+I
+want
+to
+get
+well
+and
+return
+to
+my
+work
+I
+have
+been
+very
+sick
+and
+I
+am
+still
+very
+weak
+Dr
+What
+is
+your
+name
+Sp
+My
+name
+is
+Anna
+H
+Dr
+How
+did
+you
+come
+to
+Los
+Angeles
+Sp
+I
+am
+not
+in
+Los
+Angeles
+I
+am
+in
+New
+York
+Dr
+Who
+brought
+you
+here
+Sp
+I
+thought
+I
+had
+a
+dream
+and
+that
+Alfred
+V
+came
+and
+spoke
+to
+me
+He
+always
+liked
+me
+but
+he
+is
+dead
+Now
+he
+says
+that
+I
+must
+wake
+up
+I
+am
+so
+sick
+My
+bones
+my
+bones
+I
+don
+t
+want
+to
+lose
+my
+beautiful
+form
+I
+feel
+that
+I
+am
+commencing
+to
+get
+better
+and
+stronger
+Will
+I
+live
+now
+and
+can
+I
+perform
+again
+and
+do
+my
+work
+I
+do
+not
+want
+to
+lose
+my
+beautiful
+form
+Dr
+You
+will
+never
+perform
+on
+the
+physical
+plane
+again
+Sp
+I
+hope
+to
+Alfred
+V
+bothered
+me
+so
+much
+but
+he
+is
+dead
+Dr
+Does
+he
+look
+as
+though
+he
+were
+dead
+Sp
+He
+seems
+to
+be
+very
+well
+but
+I
+thought
+I
+was
+dreaming
+Why
+here
+is
+John
+J
+A
+too
+They
+are
+both
+dead
+Dr
+So
+are
+you
+Sp
+When
+did
+I
+die
+Dr
+A
+short
+time
+ago
+Sp
+Alfred
+says
+that
+they
+do
+missionary
+work
+to
+wake
+up
+spirits
+But
+they
+do
+not
+believe
+in
+such
+things
+as
+spirits
+I
+don
+t
+want
+to
+die
+Dr
+Nobody
+actually
+dies
+Sp
+Of
+course
+they
+do
+The
+doctors
+said
+I
+could
+never
+get
+well
+I
+fought
+and
+fought
+to
+live
+I
+want
+to
+live
+I
+want
+to
+overcome
+my
+sickness
+and
+get
+well
+again
+and
+I
+want
+to
+retain
+my
+beautiful
+form
+Dr
+From
+now
+on
+you
+must
+try
+to
+develop
+a
+beautiful
+spirit
+Sp
+The
+two
+men
+want
+me
+to
+go
+with
+them
+to
+find
+understanding
+Dr
+They
+have
+found
+the
+truth
+through
+this
+little
+circle
+They
+were
+very
+poor
+spiritually
+before
+they
+came
+here
+but
+became
+rich
+through
+an
+understanding
+of
+a
+more
+beautiful
+life
+than
+they
+had
+here
+on
+earth
+Sp
+What
+is
+this
+place
+They
+say
+it
+is
+the
+Gate
+to
+the
+Understanding
+of
+Real
+Life
+The
+Gateway
+Noticing
+dress
+This
+dress
+does
+not
+fit
+well
+Touching
+neck
+and
+shoulders
+This
+is
+not
+my
+neck
+or
+face
+or
+form
+They
+say
+I
+am
+weak
+yet
+but
+I
+am
+to
+go
+with
+them
+and
+they
+will
+show
+me
+the
+way
+but
+that
+I
+have
+much
+to
+learn
+Dr
+Did
+you
+ever
+ask
+yourself
+What
+is
+Mind
+Sp
+No
+I
+just
+wanted
+my
+beautiful
+form
+If
+it
+were
+not
+for
+my
+beautiful
+form
+and
+acting
+I
+could
+not
+have
+attracted
+people
+to
+me
+and
+earned
+my
+living
+There
+are
+quite
+a
+few
+people
+here
+Spirits
+Alfred
+said
+if
+I
+came
+here
+he
+would
+bring
+me
+to
+my
+relations
+and
+to
+a
+beautiful
+home
+beyond
+the
+grave
+Dr
+What
+do
+they
+call
+that
+place
+Sp
+I
+do
+not
+like
+the
+name
+but
+they
+say
+The
+Spirit
+World
+They
+say
+that
+is
+the
+home
+beyond
+the
+grave
+They
+say
+I
+shall
+have
+to
+overcome
+my
+earthly
+condition
+before
+I
+can
+open
+my
+psychic
+eyes
+I
+do
+not
+know
+what
+they
+mean
+They
+say
+if
+I
+go
+with
+them
+I
+will
+find
+beautiful
+conditions
+after
+I
+have
+understanding
+but
+that
+I
+shall
+have
+to
+overcome
+a
+great
+deal
+of
+self
+and
+live
+for
+others
+Alfred
+says
+that
+we
+lived
+for
+society
+and
+ourselves
+and
+we
+have
+to
+suffer
+for
+it
+He
+says
+I
+must
+go
+but
+I
+cannot
+for
+I
+am
+very
+sick
+Dr
+Your
+body
+was
+sick
+but
+you
+have
+lost
+that
+body
+It
+is
+in
+the
+East
+Sp
+I
+feel
+better
+now
+than
+I
+did
+a
+while
+ago
+Dr
+My
+wife
+is
+a
+psychic
+sensitive
+and
+you
+are
+speaking
+through
+her
+body
+Alfred
+V
+and
+John
+J
+A
+at
+one
+time
+controlled
+her
+body
+as
+you
+are
+now
+doing
+Sp
+My
+bones
+are
+so
+sore
+Dr
+That
+is
+only
+in
+your
+mind
+Mind
+is
+not
+the
+body
+Mind
+is
+invisible
+We
+do
+not
+see
+you
+at
+all
+you
+are
+invisible
+to
+us
+Sp
+Touching
+face
+This
+is
+not
+my
+face
+and
+I
+don
+t
+want
+this
+form
+I
+want
+my
+beautiful
+form
+Dr
+It
+will
+be
+your
+duty
+to
+serve
+others
+in
+the
+spirit
+world
+Sp
+These
+people
+want
+me
+to
+go
+with
+them
+They
+took
+quite
+an
+interest
+in
+me
+and
+my
+work
+My
+pains
+seem
+to
+be
+leaving
+me
+Will
+you
+please
+tell
+me
+how
+I
+could
+come
+here
+when
+you
+are
+all
+strangers
+to
+me
+I
+do
+not
+know
+why
+I
+should
+be
+here
+tonight
+I
+feel
+so
+well
+now
+Dr
+We
+are
+carrying
+on
+experimental
+work
+to
+learn
+what
+becomes
+of
+the
+dead
+My
+wife
+is
+a
+psychic
+and
+you
+are
+controlling
+her
+body
+Sp
+Alfred
+says
+I
+must
+go
+I
+thought
+I
+had
+a
+dream
+and
+that
+I
+was
+going
+to
+die
+but
+I
+fought
+and
+fought
+for
+a
+long
+time
+I
+did
+not
+want
+to
+die
+so
+I
+used
+all
+my
+will
+power
+to
+live
+as
+long
+as
+I
+could
+One
+day
+I
+felt
+very
+weak
+and
+I
+went
+to
+sleep
+for
+quite
+a
+while
+but
+I
+woke
+up
+again
+as
+I
+wanted
+to
+live
+They
+thought
+I
+was
+dead
+but
+I
+was
+not
+I
+had
+only
+gone
+to
+sleep
+I
+wanted
+to
+live
+because
+life
+is
+dear
+to
+me
+but
+I
+was
+sick
+so
+long
+and
+suffered
+so
+severely
+I
+went
+to
+sleep
+again
+and
+I
+slept
+a
+long
+time
+and
+when
+I
+woke
+up
+it
+was
+all
+dark
+and
+I
+could
+not
+see
+anything
+at
+all
+Everything
+was
+dark
+dark
+dark
+I
+could
+not
+find
+any
+light
+and
+it
+was
+so
+dark
+I
+felt
+so
+distressed
+all
+dark
+I
+thought
+then
+I
+went
+to
+sleep
+again
+and
+as
+I
+slept
+I
+dreamed
+Alfred
+V
+and
+John
+J
+A
+came
+to
+me
+and
+said
+Anna
+wake
+up
+We
+are
+here
+to
+help
+you
+Come
+with
+us
+Come
+I
+thought
+I
+was
+waking
+up
+but
+I
+was
+so
+sick
+so
+sick
+that
+I
+could
+not
+go
+with
+them
+My
+crippled
+body
+was
+so
+sick
+They
+said
+We
+will
+take
+you
+to
+a
+place
+where
+you
+will
+have
+a
+new
+body
+and
+you
+will
+be
+well
+and
+strong
+Come
+with
+us
+to
+a
+more
+beautiful
+world
+than
+this
+Here
+I
+am
+all
+well
+and
+strong
+Will
+I
+not
+have
+those
+terrible
+pains
+again
+They
+are
+so
+hard
+on
+me
+I
+felt
+I
+must
+not
+eat
+too
+much
+or
+drink
+too
+much
+or
+I
+would
+not
+be
+able
+to
+retain
+my
+beautiful
+form
+I
+would
+not
+eat
+meat
+because
+I
+would
+get
+too
+fat
+and
+I
+must
+eat
+just
+enough
+to
+retain
+the
+roundness
+of
+my
+form
+What
+have
+I
+now
+Why
+did
+I
+not
+do
+more
+helpful
+things
+Life
+was
+so
+sweet
+I
+liked
+to
+be
+flattered
+and
+I
+liked
+to
+have
+admirers
+It
+is
+so
+hard
+to
+lose
+your
+admirers
+Dr
+Do
+Alfred
+V
+and
+J
+A
+flatter
+you
+now
+Sp
+No
+They
+do
+not
+look
+as
+they
+used
+to
+There
+is
+a
+seriousness
+about
+them
+They
+look
+so
+sincere
+that
+I
+feel
+different
+with
+them
+While
+to
+me
+they
+look
+much
+younger
+I
+know
+they
+are
+older
+They
+do
+not
+say
+to
+me
+as
+they
+did
+once
+Come
+along
+and
+have
+a
+good
+time
+Life
+was
+very
+sweet
+while
+I
+had
+admirers
+But
+I
+suffered
+for
+my
+vanity
+The
+doctors
+said
+if
+I
+had
+not
+laced
+so
+much
+I
+would
+not
+have
+been
+so
+sick
+I
+would
+not
+mind
+the
+doctors
+either
+They
+wanted
+me
+to
+eat
+to
+get
+strength
+but
+I
+was
+afraid
+if
+I
+lay
+there
+and
+ate
+and
+did
+not
+get
+my
+regular
+massage
+and
+baths
+I
+could
+not
+keep
+my
+form
+so
+I
+starved
+myself
+When
+I
+was
+in
+the
+dark
+Alfred
+came
+to
+me
+and
+said
+Come
+I
+will
+show
+you
+something
+far
+more
+beautiful
+than
+a
+beautiful
+form
+and
+selfishness
+and
+vanity
+They
+are
+only
+shadows
+Now
+come
+and
+we
+will
+show
+you
+why
+we
+should
+live
+for
+others
+You
+will
+be
+beautiful
+again
+when
+you
+have
+served
+others
+but
+you
+must
+forget
+self
+and
+overcome
+all
+selfishness
+Now
+I
+must
+serve
+and
+I
+must
+help
+Suddenly
+the
+spirit
+lost
+control
+and
+was
+gone
+Two
+years
+later
+after
+Anna
+H
+had
+brought
+the
+spirits
+of
+Olive
+T
+and
+Anna
+D
+to
+our
+circle
+she
+spoke
+to
+us
+again
+EXPERIENCE
+SEPTEMBER
+Spirit
+ANNA
+H
+Psychic
+MRS
+WICKLAND
+Good
+Evening
+I
+came
+here
+tonight
+to
+thank
+you
+for
+what
+you
+have
+done
+for
+me
+I
+am
+now
+very
+happy
+I
+only
+lived
+for
+myself
+and
+for
+my
+body
+and
+beauty
+I
+lived
+only
+for
+a
+good
+time
+When
+you
+live
+for
+a
+good
+time
+you
+are
+not
+really
+happy
+You
+are
+always
+afraid
+that
+some
+one
+will
+shine
+brighter
+than
+yourself
+or
+that
+some
+one
+will
+take
+your
+place
+and
+charm
+away
+your
+admirers
+Here
+in
+this
+room
+I
+found
+harmony
+when
+I
+was
+in
+such
+darkness
+I
+could
+not
+see
+anything
+except
+all
+the
+promises
+I
+had
+made
+and
+broken
+and
+I
+felt
+sad
+Now
+I
+have
+understanding
+of
+the
+real
+life
+The
+real
+life
+is
+to
+serve
+others
+to
+do
+good
+for
+others
+to
+help
+others
+then
+you
+yourself
+will
+have
+help
+This
+brings
+happiness
+which
+is
+Heaven
+it
+is
+the
+Heaven
+of
+Contentment
+When
+I
+first
+came
+here
+I
+was
+very
+sad
+and
+gloomy
+I
+had
+only
+thought
+of
+self
+with
+never
+a
+thought
+of
+God
+our
+Maker
+We
+should
+all
+think
+of
+Him
+and
+learn
+to
+know
+Him
+He
+is
+the
+one
+we
+should
+pray
+to
+and
+we
+should
+try
+to
+realize
+what
+life
+is
+We
+should
+learn
+to
+know
+not
+be
+satisfied
+with
+blind
+belief
+Learn
+to
+understand
+God
+in
+His
+truest
+sense
+I
+was
+once
+quite
+a
+church
+going
+girl
+I
+believed
+and
+believed
+and
+condemned
+others
+and
+thought
+if
+you
+did
+not
+do
+so
+and
+so
+you
+would
+be
+lost
+That
+is
+the
+reason
+many
+fall
+by
+the
+wayside
+People
+only
+have
+time
+for
+amusement
+They
+do
+not
+go
+to
+church
+Why
+are
+they
+not
+taught
+to
+understand
+the
+real
+Christ
+spirit
+Give
+them
+innocent
+amusement
+of
+one
+kind
+or
+another
+and
+do
+not
+keep
+them
+wrapped
+in
+gloom
+praying
+and
+praying
+all
+the
+time
+They
+fall
+They
+want
+to
+go
+to
+church
+and
+they
+want
+See
+Chap
+Pages
+Spirit
+Olive
+T
+to
+have
+a
+good
+time
+but
+they
+are
+taught
+that
+if
+they
+do
+not
+go
+to
+church
+and
+pray
+they
+will
+fall
+lower
+and
+lower
+and
+they
+will
+be
+condemned
+not
+by
+God
+but
+condemned
+by
+the
+people
+If
+a
+girl
+falls
+who
+will
+raise
+her
+up
+Does
+the
+church
+do
+this
+work
+No
+churches
+will
+not
+have
+anything
+to
+do
+with
+her
+because
+they
+say
+she
+is
+bad
+They
+say
+We
+do
+not
+want
+our
+daughters
+to
+go
+about
+with
+her
+or
+be
+seen
+in
+her
+company
+because
+she
+will
+make
+them
+bad
+Since
+churches
+teach
+the
+Gospel
+of
+Christ
+why
+should
+they
+not
+help
+such
+a
+soul
+to
+rise
+Christ
+did
+not
+accuse
+the
+fallen
+woman
+He
+said
+that
+he
+who
+was
+without
+sin
+should
+cast
+the
+first
+stone
+Because
+a
+woman
+had
+fallen
+accusers
+stood
+ready
+to
+throw
+stones
+at
+her
+When
+Christ
+spoke
+the
+accusers
+went
+away
+Then
+what
+did
+Christ
+do
+He
+took
+her
+hand
+lifted
+her
+up
+and
+said
+Where
+are
+your
+accusers
+Go
+and
+sin
+no
+more
+He
+meant
+she
+should
+try
+to
+enter
+a
+new
+life
+and
+do
+better
+But
+society
+will
+not
+have
+her
+The
+churches
+will
+not
+have
+her
+She
+is
+down
+Where
+will
+she
+go
+Where
+can
+she
+go
+She
+has
+not
+sinned
+against
+any
+one
+but
+herself
+Her
+own
+self
+accuses
+her
+for
+what
+she
+has
+done
+How
+can
+she
+rise
+If
+she
+goes
+to
+church
+she
+will
+not
+be
+helped
+there
+She
+can
+only
+go
+to
+the
+lowest
+condition
+where
+there
+is
+a
+good
+time
+and
+champagne
+and
+try
+to
+drown
+her
+conscience
+Suppose
+we
+tell
+the
+people
+that
+this
+unfortunate
+girl
+has
+fallen
+has
+had
+to
+go
+into
+a
+wild
+underworld
+has
+been
+bad
+has
+had
+no
+chance
+to
+rise
+and
+that
+her
+character
+has
+gone
+will
+they
+help
+her
+No
+they
+will
+not
+We
+should
+always
+try
+to
+help
+others
+especially
+the
+weak
+and
+fallen
+ones
+and
+try
+to
+raise
+them
+as
+Christ
+taught
+us
+Do
+not
+condemn
+but
+raise
+them
+to
+society
+again
+and
+help
+them
+to
+be
+honest
+and
+sincere
+Then
+we
+shall
+convert
+the
+world
+of
+men
+as
+well
+as
+women
+Men
+are
+also
+greatly
+to
+blame
+for
+trying
+to
+ruin
+poor
+innocent
+little
+girls
+Just
+because
+a
+girl
+has
+a
+beautiful
+face
+and
+has
+charms
+men
+should
+not
+praise
+and
+flatter
+They
+ruin
+the
+girl
+The
+man
+goes
+back
+to
+society
+but
+the
+girl
+goes
+lower
+and
+lower
+She
+cannot
+go
+back
+to
+her
+former
+life
+but
+has
+to
+remain
+where
+she
+is
+If
+you
+could
+see
+the
+lower
+life
+of
+Paris
+you
+would
+shudder
+and
+realize
+that
+that
+is
+hell
+People
+who
+go
+there
+have
+lost
+their
+pride
+their
+senses
+The
+women
+there
+have
+lost
+all
+modesty
+They
+do
+not
+believe
+in
+God
+they
+do
+not
+believe
+in
+the
+Christian
+religion
+any
+more
+because
+the
+Christian
+religion
+and
+its
+people
+have
+driven
+them
+to
+what
+they
+are
+They
+think
+there
+is
+no
+God
+and
+so
+they
+can
+do
+whatever
+they
+wish
+Let
+us
+try
+to
+help
+these
+unfortunates
+I
+am
+now
+working
+in
+the
+slums
+of
+earthbound
+spirits
+I
+am
+serving
+There
+was
+a
+time
+when
+I
+would
+not
+soil
+my
+hands
+to
+help
+anybody
+because
+I
+had
+to
+be
+waited
+on
+I
+had
+my
+maid
+and
+if
+I
+were
+not
+waited
+on
+at
+once
+just
+when
+I
+wanted
+things
+I
+scolded
+and
+was
+very
+irritable
+Now
+I
+wait
+on
+the
+lowest
+with
+the
+true
+spirit
+of
+Christ
+who
+taught
+us
+to
+serve
+others
+and
+love
+others
+as
+ourselves
+and
+God
+above
+all
+things
+When
+the
+one
+who
+has
+fallen
+by
+the
+wayside
+is
+given
+true
+understanding
+then
+that
+soul
+will
+serve
+and
+his
+love
+for
+his
+fellow
+man
+will
+be
+much
+stronger
+than
+that
+of
+the
+one
+who
+does
+not
+have
+that
+understanding
+One
+who
+has
+always
+had
+a
+good
+home
+gone
+to
+church
+and
+is
+pure
+and
+good
+knows
+nothing
+of
+evil
+Let
+us
+all
+understand
+our
+Maker
+the
+God
+of
+us
+all
+Our
+Maker
+is
+God
+for
+the
+one
+who
+has
+fallen
+just
+as
+much
+as
+for
+the
+pure
+God
+is
+Love
+When
+you
+have
+shining
+in
+your
+heart
+that
+light
+of
+love
+which
+is
+the
+love
+of
+God
+not
+love
+as
+people
+understand
+it
+lukewarm
+sentimental
+love
+but
+love
+which
+has
+suffered
+and
+which
+understands
+which
+does
+not
+ask
+anything
+which
+sacrifices
+and
+will
+serve
+from
+the
+lowest
+to
+the
+highest
+that
+is
+real
+true
+love
+When
+people
+are
+crushed
+we
+should
+raise
+them
+again
+with
+love
+and
+sympathy
+then
+we
+could
+not
+condemn
+any
+one
+God
+does
+not
+condemn
+Why
+should
+we
+God
+loves
+all
+his
+children
+He
+has
+given
+them
+all
+free
+will
+to
+go
+their
+own
+way
+for
+a
+while
+until
+they
+are
+ready
+to
+say
+Not
+my
+will
+any
+longer
+but
+Thine
+Each
+one
+of
+us
+has
+had
+experience
+in
+one
+way
+or
+another
+but
+let
+us
+all
+look
+to
+God
+and
+let
+the
+love
+of
+God
+and
+understanding
+so
+shine
+in
+our
+souls
+that
+each
+will
+he
+a
+part
+of
+that
+divine
+spirit
+of
+love
+No
+minister
+no
+one
+can
+reach
+you
+but
+you
+yourself
+will
+have
+to
+see
+and
+feel
+what
+God
+really
+is
+Then
+you
+will
+sin
+no
+more
+That
+is
+Heaven
+that
+is
+Bliss
+It
+is
+beautiful
+it
+is
+harmonious
+When
+each
+understands
+the
+other
+in
+God
+s
+love
+then
+there
+is
+peace
+and
+harmony
+but
+you
+will
+have
+to
+feel
+this
+beautiful
+condition
+which
+we
+call
+Heaven
+within
+you
+You
+cannot
+be
+contented
+in
+this
+beautiful
+condition
+unless
+you
+help
+others
+We
+stand
+by
+our
+brothers
+and
+sisters
+We
+call
+them
+so
+through
+love
+of
+God
+Say
+to
+those
+in
+misery
+Let
+me
+reach
+my
+hand
+down
+to
+you
+and
+I
+will
+help
+you
+to
+an
+understanding
+of
+the
+true
+love
+of
+God
+and
+you
+too
+will
+shine
+in
+this
+Heaven
+of
+Love
+From
+your
+own
+home
+in
+the
+spirit
+world
+you
+reach
+down
+to
+the
+lower
+plane
+and
+you
+see
+some
+here
+some
+there
+in
+all
+kinds
+of
+agony
+Some
+have
+taken
+their
+own
+lives
+because
+of
+disappointment
+in
+love
+Others
+are
+overcome
+by
+sickness
+Others
+are
+all
+crippled
+Others
+are
+being
+punished
+by
+conscience
+Through
+lack
+of
+understanding
+they
+pray
+and
+pray
+and
+sing
+They
+are
+only
+ignorant
+They
+pray
+to
+the
+personal
+God
+they
+believe
+in
+but
+the
+poor
+things
+do
+not
+understand
+the
+truth
+Others
+are
+earthbound
+because
+of
+their
+belief
+They
+do
+not
+want
+to
+talk
+to
+you
+because
+you
+do
+not
+belong
+to
+their
+church
+They
+say
+I
+do
+not
+want
+to
+have
+anything
+to
+do
+with
+you
+You
+stay
+there
+and
+I
+will
+stay
+here
+and
+the
+praying
+and
+singing
+goes
+on
+They
+do
+not
+know
+that
+they
+have
+passed
+out
+neither
+do
+they
+know
+of
+the
+wonderful
+God
+of
+Understanding
+When
+you
+have
+understanding
+the
+knowledge
+of
+God
+will
+shine
+in
+your
+heart
+I
+am
+in
+the
+spirit
+world
+now
+and
+it
+is
+all
+so
+beautiful
+but
+I
+would
+not
+have
+had
+all
+this
+happiness
+so
+soon
+had
+I
+not
+come
+here
+and
+been
+given
+understanding
+I
+would
+not
+have
+had
+it
+if
+I
+had
+not
+served
+I
+have
+brought
+many
+here
+who
+were
+crippled
+through
+lack
+of
+understanding
+and
+they
+received
+light
+These
+two
+young
+girls
+Olive
+T
+and
+her
+little
+friend
+Anna
+D
+who
+both
+took
+their
+own
+lives
+are
+ones
+whom
+I
+will
+look
+after
+I
+could
+do
+nothing
+with
+them
+because
+they
+knew
+I
+was
+dead
+Their
+fear
+of
+me
+kept
+me
+from
+them
+They
+shunned
+me
+I
+could
+not
+reach
+them
+I
+did
+not
+want
+them
+to
+go
+to
+any
+other
+place
+I
+did
+not
+want
+them
+to
+go
+to
+earth
+life
+and
+obsess
+some
+one
+I
+brought
+both
+of
+them
+here
+tonight
+and
+I
+shall
+take
+them
+to
+my
+home
+in
+the
+spirit
+world
+I
+will
+take
+care
+of
+them
+and
+help
+them
+to
+an
+understanding
+and
+some
+day
+they
+may
+come
+and
+thank
+you
+as
+I
+have
+come
+to
+thank
+you
+tonight
+Let
+us
+all
+have
+an
+understanding
+of
+truth
+Do
+not
+only
+believe
+Belief
+is
+all
+right
+but
+to
+your
+belief
+add
+knowledge
+and
+understanding
+of
+God
+s
+wonderful
+love
+Do
+not
+let
+others
+tell
+you
+they
+will
+save
+you
+because
+they
+cannot
+do
+it
+You
+will
+have
+to
+find
+the
+saving
+spirit
+within
+yourself
+When
+the
+love
+of
+understanding
+shines
+in
+your
+heart
+you
+will
+realize
+the
+wisdom
+of
+God
+Then
+you
+will
+not
+need
+to
+think
+that
+God
+is
+in
+His
+Heaven
+He
+is
+here
+there
+and
+everywhere
+He
+is
+in
+the
+drop
+of
+water
+He
+is
+in
+the
+flowers
+all
+are
+a
+part
+of
+His
+wonderful
+work
+Let
+us
+worship
+Him
+and
+let
+us
+see
+Him
+with
+open
+eyes
+and
+we
+will
+be
+happy
+Thank
+you
+for
+allowing
+me
+to
+come
+Goodbye
+In
+Chicago
+we
+had
+known
+two
+Jewish
+ladies
+Mrs
+Sr
+and
+Mrs
+Simons
+who
+were
+excellent
+friends
+although
+the
+latter
+was
+somewhat
+tyrannical
+in
+her
+exactions
+She
+particularly
+disapproved
+of
+the
+automatic
+writing
+which
+her
+friend
+was
+experimenting
+with
+declaring
+that
+Spiritualism
+was
+a
+fraud
+since
+after
+death
+everyone
+became
+a
+flower
+a
+bird
+or
+a
+tree
+Mrs
+Simons
+passed
+away
+in
+the
+presence
+of
+her
+friend
+suffering
+from
+dropsy
+and
+intense
+lumbago
+pains
+A
+number
+of
+years
+later
+when
+Mrs
+Sr
+was
+in
+California
+she
+developed
+melancholia
+and
+was
+afflicted
+so
+severely
+with
+pains
+in
+her
+back
+that
+she
+could
+not
+walk
+erectly
+After
+spending
+three
+weeks
+in
+the
+hospital
+without
+any
+improvement
+she
+came
+to
+us
+and
+after
+the
+following
+experience
+during
+a
+circle
+at
+which
+Mrs
+Sr
+was
+present
+she
+was
+entirely
+relieved
+EXPERIENCE
+OCTOBER
+Spirit
+MRS
+SIMONS
+Patient
+MRS
+SR
+Psychic
+MRS
+WICKLAND
+The
+controlling
+entity
+groaned
+and
+immediately
+placed
+hands
+on
+back
+apparently
+in
+great
+pain
+Doctor
+Are
+you
+in
+trouble
+Have
+you
+lost
+your
+body
+without
+understanding
+it
+Spirit
+I
+don
+t
+know
+Dr
+We
+can
+relieve
+your
+pain
+Tell
+us
+who
+you
+are
+Sp
+I
+don
+t
+know
+Dr
+Surely
+you
+know
+your
+own
+name
+Sp
+I
+cannot
+think
+Dr
+How
+long
+have
+you
+been
+dead
+Sp
+I
+don
+t
+know
+if
+I
+am
+dead
+Dr
+What
+did
+your
+friends
+call
+you
+Sp
+Mrs
+Simons
+Dr
+Where
+did
+you
+live
+Sp
+Chicago
+Dr
+Where
+did
+you
+live
+in
+Chicago
+Sp
+It
+s
+a
+long
+time
+ago
+and
+I
+don
+t
+know
+I
+have
+not
+felt
+just
+right
+Dr
+In
+what
+way
+Sp
+I
+felt
+so
+small
+and
+was
+so
+uncomfortable
+Dr
+Do
+you
+realize
+that
+you
+were
+interfering
+with
+some
+one
+Sp
+I
+know
+that
+I
+am
+in
+such
+a
+stupor
+I
+don
+t
+feel
+natural
+Dr
+Do
+you
+know
+the
+reason
+for
+that
+Sp
+No
+Dr
+You
+did
+not
+believe
+in
+spirits
+did
+you
+Sp
+No
+and
+I
+don
+t
+believe
+it
+yet
+Dr
+Then
+you
+do
+not
+believe
+in
+your
+own
+self
+do
+you
+You
+thought
+any
+one
+who
+believed
+in
+spirits
+was
+foolish
+Is
+it
+not
+foolish
+to
+be
+an
+earthbound
+spirit
+Do
+you
+realize
+that
+you
+have
+been
+one
+Mrs
+Sr
+Do
+you
+know
+me
+Sp
+I
+know
+that
+voice
+it
+belongs
+to
+a
+friend
+of
+mine
+Dr
+Where
+is
+she
+Sp
+In
+Chicago
+Dr
+What
+was
+her
+business
+Sp
+I
+don
+t
+know
+Everything
+is
+so
+dark
+and
+I
+cannot
+remember
+anything
+I
+know
+that
+voice
+but
+I
+cannot
+tell
+you
+who
+it
+belongs
+to
+I
+cannot
+remember
+her
+name
+at
+all
+but
+I
+knew
+her
+in
+Chicago
+She
+used
+to
+call
+and
+see
+me
+My
+friend
+was
+always
+like
+sunshine
+to
+me
+She
+helped
+me
+Dr
+What
+did
+she
+do
+Sp
+She
+always
+came
+with
+such
+a
+nice
+cheerful
+disposition
+but
+she
+got
+interested
+in
+Spiritualism
+once
+I
+told
+her
+not
+to
+bother
+with
+it
+because
+there
+was
+nothing
+in
+it
+I
+would
+not
+have
+anything
+to
+do
+with
+that
+I
+miss
+her
+so
+I
+only
+see
+her
+once
+in
+a
+while
+I
+feel
+so
+little
+and
+uncomfortable
+To
+save
+my
+life
+I
+cannot
+think
+of
+her
+name
+Dr
+What
+was
+her
+first
+name
+Sp
+It
+comes
+to
+me
+now
+It
+was
+R
+Something
+ails
+my
+memory
+and
+things
+are
+so
+queer
+to
+me
+Once
+in
+a
+while
+I
+get
+a
+glimpse
+of
+light
+then
+I
+feel
+I
+am
+locked
+up
+in
+a
+small
+place
+You
+know
+I
+am
+a
+big
+woman
+and
+in
+that
+little
+place
+aura
+of
+patient
+I
+was
+so
+crowded
+that
+I
+had
+no
+feeling
+Dr
+Did
+you
+get
+warmed
+up
+occasionally
+Sp
+Yes
+once
+in
+a
+while
+I
+do
+not
+know
+what
+is
+the
+matter
+but
+something
+burns
+me
+sometimes
+Static
+treatment
+given
+patient
+Now
+it
+is
+all
+dark
+dark
+I
+do
+not
+see
+a
+thing
+I
+do
+not
+know
+which
+is
+the
+best
+the
+fire
+or
+being
+crowded
+so
+that
+I
+got
+no
+breath
+I
+could
+not
+breathe
+I
+do
+not
+know
+why
+it
+is
+But
+I
+seemed
+to
+have
+gotten
+a
+shock
+Dr
+Did
+you
+die
+from
+a
+shock
+Sp
+I
+cannot
+tell
+that
+I
+am
+dead
+because
+I
+do
+not
+feel
+dead
+I
+have
+had
+fire
+and
+sometimes
+it
+was
+like
+thunder
+shooting
+pain
+Mrs
+Sr
+Do
+you
+remember
+Dr
+Wickland
+Sp
+Yes
+Mrs
+Sr
+Do
+you
+remember
+that
+machine
+he
+had
+Sp
+The
+one
+that
+shot
+fire
+Mrs
+Sr
+Yes
+and
+that
+is
+the
+fire
+you
+feel
+Sp
+Why
+I
+didn
+t
+take
+treatments
+from
+him
+Mrs
+Sr
+You
+have
+been
+bothering
+me
+all
+these
+years
+Sp
+Why
+did
+I
+bother
+you
+Mrs
+Sr
+Have
+Doctor
+explain
+it
+to
+you
+Dr
+It
+is
+not
+hard
+to
+explain
+You
+are
+now
+a
+spirit
+and
+have
+been
+hovering
+around
+your
+friend
+That
+is
+why
+you
+feel
+uncomfortable
+You
+are
+not
+in
+Chicago
+now
+you
+are
+in
+California
+You
+are
+in
+Los
+Angeles
+California
+Don
+t
+you
+remember
+Mrs
+Sr
+Sp
+Yes
+she
+was
+in
+Chicago
+Dr
+You
+are
+both
+in
+Los
+Angeles
+now
+Sp
+I
+was
+in
+Chicago
+I
+always
+had
+pains
+in
+my
+legs
+and
+very
+often
+in
+my
+head
+Mrs
+S
+You
+gave
+me
+those
+pains
+lately
+Dr
+You
+loaned
+Mrs
+Sr
+your
+pains
+Sp
+No
+you
+are
+mistaken
+in
+that
+Mrs
+Sr
+Do
+you
+remember
+Mrs
+Wickland
+of
+Chicago
+Dr
+Wickland
+s
+wife
+Do
+you
+remember
+she
+was
+a
+psychic
+Sp
+I
+don
+t
+seem
+to
+remember
+It
+is
+strange
+I
+don
+t
+know
+anything
+Mrs
+Sr
+You
+thought
+you
+knew
+so
+much
+Sp
+I
+supposed
+I
+knew
+You
+meddled
+with
+that
+foolish
+thing
+Spiritualism
+and
+I
+did
+not
+want
+to
+have
+anything
+to
+do
+with
+it
+Have
+you
+been
+fooling
+with
+it
+again
+Mrs
+Sr
+No
+you
+have
+been
+fooling
+with
+me
+Sp
+No
+I
+did
+not
+want
+to
+have
+anything
+to
+do
+with
+that
+there
+is
+nothing
+in
+it
+I
+didn
+t
+like
+that
+fire
+I
+could
+not
+stand
+it
+It
+chased
+me
+away
+I
+suffered
+terribly
+When
+I
+was
+chased
+out
+I
+was
+locked
+up
+in
+a
+new
+room
+Dr
+You
+were
+locked
+up
+in
+a
+room
+of
+ignorance
+Mrs
+Sr
+It
+is
+a
+long
+time
+since
+you
+died
+Sp
+I
+am
+not
+dead
+Dr
+Look
+at
+this
+hand
+Is
+that
+yours
+You
+are
+using
+another
+body
+now
+You
+are
+proving
+that
+what
+you
+thought
+was
+humbug
+is
+true
+Mrs
+Sr
+Do
+you
+know
+what
+year
+it
+is
+Mrs
+Simons
+Sp
+I
+don
+t
+know
+anything
+Where
+is
+my
+home
+Where
+is
+my
+girl
+Mrs
+Sr
+Your
+girl
+is
+not
+here
+You
+are
+in
+Los
+Angeles
+California
+Sp
+No
+now
+you
+are
+a
+little
+off
+Mrs
+Sr
+don
+t
+you
+know
+you
+are
+in
+Chicago
+Mrs
+Sr
+I
+have
+been
+here
+in
+California
+for
+six
+and
+one
+half
+years
+Sp
+We
+are
+in
+Chicago
+Such
+a
+foolish
+woman
+She
+is
+hypnotized
+and
+wants
+to
+have
+me
+believe
+such
+a
+story
+Dr
+Wouldn
+t
+you
+like
+to
+understand
+matters
+You
+have
+been
+dead
+a
+good
+many
+years
+and
+were
+hovering
+around
+your
+friend
+Mrs
+Sr
+You
+were
+driven
+away
+from
+her
+by
+electricity
+Now
+you
+are
+allowed
+to
+control
+my
+wife
+s
+body
+temporarily
+so
+you
+may
+acquire
+understanding
+Do
+you
+know
+anything
+about
+the
+purpose
+of
+life
+Did
+that
+ever
+interest
+you
+No
+therefore
+you
+think
+there
+could
+not
+be
+anything
+in
+a
+higher
+life
+You
+call
+yourself
+Mrs
+Simons
+This
+body
+belongs
+to
+Mrs
+Wickland
+and
+she
+is
+in
+Los
+Angeles
+California
+You
+claim
+you
+are
+in
+Chicago
+and
+we
+cannot
+convince
+you
+of
+the
+facts
+You
+have
+been
+obsessing
+Mrs
+Sr
+Sp
+I
+came
+to
+her
+because
+it
+was
+so
+dark
+It
+seems
+I
+had
+been
+sleeping
+for
+a
+while
+then
+I
+woke
+up
+I
+saw
+a
+light
+then
+I
+was
+here
+I
+could
+see
+just
+a
+little
+light
+if
+I
+could
+be
+with
+her
+Dr
+You
+got
+into
+her
+magnetic
+aura
+and
+made
+her
+suffer
+In
+order
+to
+get
+you
+out
+I
+applied
+electricity
+to
+her
+Mrs
+Sr
+Do
+you
+know
+what
+I
+told
+Doctor
+I
+told
+him
+to
+give
+you
+that
+electricity
+Sp
+You
+have
+no
+sympathy
+for
+a
+poor
+old
+lady
+like
+me
+Dr
+Would
+you
+have
+liked
+to
+have
+an
+earthbound
+spirit
+control
+your
+body
+SP
+I
+will
+not
+listen
+to
+you
+Dr
+You
+are
+willing
+to
+bother
+your
+friend
+Sp
+I
+do
+not
+know
+whether
+I
+have
+been
+bothering
+her
+I
+have
+only
+been
+around
+her
+to
+see
+light
+Dr
+Then
+how
+did
+you
+happen
+to
+get
+the
+electricity
+when
+I
+gave
+it
+to
+her
+I
+have
+never
+treated
+you
+Mrs
+Sr
+By
+right
+you
+ought
+to
+pay
+Dr
+Wickland
+for
+that
+treatment
+Mrs
+Simons
+Sp
+Tell
+me
+one
+thing
+how
+did
+I
+come
+here
+I
+do
+not
+think
+you
+are
+right
+Mrs
+Sr
+but
+if
+you
+should
+be
+how
+did
+you
+come
+to
+California
+Mrs
+Sr
+By
+paying
+my
+railroad
+fare
+I
+came
+here
+Did
+you
+pay
+anything
+Sp
+I
+never
+paid
+anything
+so
+how
+did
+I
+get
+here
+I
+don
+t
+believe
+it
+anyhow
+you
+cannot
+say
+that
+to
+me
+I
+am
+in
+Chicago
+and
+Mrs
+Sr
+was
+never
+in
+California
+Dr
+Do
+you
+hear
+that
+rumble
+That
+is
+a
+train
+leaving
+Los
+Angeles
+for
+Chicago
+Sp
+That
+is
+the
+Northwestern
+train
+Dr
+There
+is
+no
+Northwestern
+out
+here
+What
+do
+you
+gain
+by
+arguing
+When
+you
+understand
+the
+situation
+you
+will
+appreciate
+what
+I
+am
+trying
+to
+tell
+you
+What
+would
+you
+think
+of
+a
+person
+who
+refused
+to
+understand
+life
+who
+has
+been
+dead
+seven
+or
+eight
+years
+whose
+body
+is
+lost
+and
+in
+the
+grave
+and
+who
+is
+an
+ignorant
+spirit
+bothering
+one
+who
+was
+formerly
+a
+friend
+Sp
+I
+cannot
+see
+how
+that
+is
+Dr
+We
+are
+telling
+you
+facts
+Mrs
+Sr
+Your
+body
+was
+buried
+in
+Waltheim
+Cemetery
+six
+or
+eight
+years
+ago
+Sp
+I
+have
+been
+sleeping
+I
+woke
+up
+with
+very
+severe
+pains
+and
+I
+could
+not
+move
+very
+well
+and
+I
+felt
+so
+crowded
+Dr
+That
+was
+because
+Mrs
+Sr
+s
+body
+is
+smaller
+than
+yours
+and
+you
+have
+been
+obsessing
+her
+Sp
+How
+could
+I
+get
+in
+that
+body
+I
+felt
+I
+could
+hardly
+move
+I
+have
+to
+find
+out
+what
+you
+are
+talking
+about
+I
+don
+t
+believe
+it
+I
+want
+to
+know
+what
+object
+you
+have
+to
+say
+such
+things
+Dr
+Did
+you
+ever
+study
+Life
+at
+all
+Sp
+I
+studied
+trees
+and
+Nature
+Dr
+Did
+you
+ever
+observe
+how
+the
+tree
+grows
+It
+is
+wonderful
+God
+puts
+life
+into
+it
+and
+it
+grows
+What
+is
+life
+Sp
+God
+I
+suppose
+Dr
+Have
+you
+ever
+seen
+mind
+Sp
+Mind
+is
+mind
+Dr
+Have
+you
+ever
+seen
+mind
+Sp
+No
+you
+could
+not
+talk
+if
+you
+had
+no
+mind
+Dr
+Mind
+is
+invisible
+isn
+t
+it
+Sp
+I
+haven
+t
+seen
+it
+Dr
+Suppose
+we
+tell
+you
+that
+you
+are
+invisible
+to
+us
+When
+I
+speak
+to
+you
+I
+can
+see
+only
+my
+wife
+s
+body
+Sp
+Your
+wife
+s
+body
+Mrs
+Sr
+what
+is
+the
+matter
+Have
+I
+lost
+my
+body
+Mrs
+Sr
+Yes
+you
+have
+Dr
+Only
+your
+stubbornness
+keeps
+you
+in
+the
+dark
+Sp
+I
+haven
+t
+seen
+or
+heard
+anything
+There
+was
+a
+time
+I
+tell
+you
+when
+I
+walked
+on
+and
+on
+but
+always
+in
+the
+dark
+and
+it
+seemed
+like
+I
+never
+could
+get
+there
+I
+rested
+then
+I
+kept
+on
+walking
+At
+first
+I
+could
+see
+just
+a
+little
+light
+and
+it
+seems
+like
+it
+came
+to
+me
+in
+a
+flash
+Mrs
+Sr
+I
+thought
+Yes
+she
+was
+a
+friend
+of
+mine
+and
+then
+I
+could
+see
+her
+Dr
+You
+transferred
+yourself
+by
+thought
+Sp
+Then
+I
+had
+a
+terrible
+pain
+I
+thought
+I
+had
+lost
+all
+my
+pain
+for
+a
+little
+while
+I
+woke
+up
+and
+felt
+no
+pain
+at
+first
+but
+when
+I
+got
+to
+that
+light
+all
+the
+pain
+came
+back
+Dr
+You
+had
+pain
+when
+you
+had
+your
+body
+You
+must
+understand
+you
+are
+a
+spirit
+invisible
+to
+us
+When
+an
+earthbound
+spirit
+comes
+in
+touch
+with
+a
+mortal
+body
+he
+again
+has
+the
+pains
+he
+passed
+out
+with
+You
+got
+in
+touch
+with
+Mrs
+Sr
+and
+had
+your
+mortal
+pains
+again
+You
+have
+caused
+trouble
+You
+were
+selfish
+and
+you
+have
+not
+gained
+anything
+by
+it
+In
+the
+spirit
+world
+you
+will
+have
+to
+serve
+others
+Realize
+that
+you
+are
+now
+a
+spirit
+you
+no
+longer
+have
+a
+physical
+body
+Why
+did
+you
+not
+become
+a
+tree
+as
+you
+expected
+to
+Mrs
+Sr
+Your
+body
+is
+buried
+in
+Waltheim
+Cemetery
+Chicago
+Go
+to
+the
+cemetery
+and
+see
+if
+you
+have
+a
+tombstone
+there
+Sp
+I
+don
+t
+want
+to
+go
+and
+examine
+my
+tombstone
+in
+the
+cemetery
+Dr
+Did
+you
+go
+to
+church
+Sp
+I
+believed
+that
+when
+I
+died
+there
+was
+nothing
+more
+I
+didn
+t
+want
+to
+have
+such
+foolish
+thoughts
+as
+you
+had
+Mrs
+Sr
+I
+had
+my
+own
+ideas
+and
+did
+not
+need
+yours
+Dr
+God
+created
+the
+world
+but
+you
+did
+not
+investigate
+anything
+Sp
+In
+great
+excitement
+My
+God
+My
+God
+I
+see
+my
+mother
+Spirit
+Why
+she
+is
+in
+her
+grave
+yes
+many
+years
+ago
+It
+must
+be
+a
+ghost
+She
+looks
+so
+beautiful
+Dr
+She
+did
+not
+limit
+her
+mind
+as
+you
+did
+She
+did
+not
+want
+to
+be
+a
+tree
+You
+must
+be
+willing
+to
+learn
+Jesus
+said
+Except
+ye
+become
+as
+little
+children
+ye
+shall
+not
+enter
+into
+the
+kingdom
+of
+Heaven
+Sp
+Of
+Jewish
+faith
+I
+do
+not
+believe
+in
+Jesus
+Dr
+What
+you
+believe
+or
+what
+you
+do
+not
+believe
+has
+nothing
+to
+do
+with
+the
+fact
+of
+life
+Sp
+Mother
+is
+that
+really
+you
+Why
+look
+at
+that
+beautiful
+road
+with
+beautiful
+trees
+and
+flowers
+See
+that
+beautiful
+garden
+and
+those
+beautiful
+houses
+and
+my
+mother
+walking
+around
+Dr
+Your
+mother
+is
+not
+a
+tree
+is
+she
+Sp
+Now
+she
+is
+walking
+on
+that
+beautiful
+road
+She
+says
+Come
+this
+is
+my
+home
+Her
+home
+but
+not
+mine
+Can
+t
+I
+go
+with
+my
+mother
+Dr
+Ignorance
+cannot
+enter
+the
+Kingdom
+of
+Heaven
+Sp
+Look
+at
+that
+steep
+hill
+which
+I
+have
+to
+climb
+I
+cannot
+climb
+that
+hill
+with
+the
+big
+body
+I
+have
+Mother
+says
+No
+you
+cannot
+climb
+it
+with
+your
+body
+but
+you
+have
+to
+climb
+the
+hill
+of
+understanding
+and
+you
+must
+forget
+yourself
+Forget
+that
+you
+have
+existed
+in
+your
+selfishness
+You
+must
+serve
+I
+know
+I
+know
+Yes
+I
+was
+selfish
+Mother
+I
+will
+try
+but
+help
+me
+Help
+me
+up
+there
+I
+cannot
+do
+it
+alone
+Crying
+I
+cannot
+stay
+in
+this
+misery
+any
+longer
+Take
+me
+take
+me
+Mother
+with
+you
+Take
+me
+with
+you
+and
+show
+me
+She
+says
+I
+must
+work
+and
+not
+be
+lazy
+as
+I
+was
+in
+life
+and
+expect
+everybody
+to
+do
+something
+for
+me
+If
+they
+did
+not
+do
+what
+I
+wanted
+then
+I
+got
+angry
+My
+mother
+says
+Now
+you
+have
+to
+serve
+You
+have
+to
+work
+to
+climb
+this
+hill
+of
+understanding
+to
+a
+higher
+life
+You
+have
+now
+to
+learn
+the
+first
+lesson
+of
+life
+the
+lesson
+of
+understanding
+and
+you
+will
+have
+to
+go
+up
+that
+hill
+until
+you
+have
+gotten
+away
+from
+all
+selfishness
+jealousy
+and
+envy
+You
+must
+do
+that
+You
+must
+also
+ask
+forgiveness
+for
+what
+you
+have
+done
+to
+Your
+old
+friend
+You
+will
+have
+to
+do
+it
+my
+mother
+says
+You
+will
+have
+to
+be
+forgiven
+Crying
+No
+you
+must
+ask
+for
+forgiveness
+because
+you
+have
+been
+selfish
+very
+selfish
+All
+thoughts
+of
+self
+must
+be
+thrown
+away
+and
+you
+must
+live
+for
+others
+I
+am
+your
+mother
+but
+I
+cannot
+take
+you
+to
+my
+home
+yet
+because
+you
+must
+learn
+Doubtfully
+She
+says
+she
+is
+my
+mother
+but
+I
+do
+not
+know
+Yes
+I
+believe
+it
+must
+be
+but
+she
+looks
+so
+beautiful
+Dr
+That
+is
+because
+she
+is
+filled
+with
+the
+spirit
+of
+truth
+Sp
+Mrs
+Sr
+if
+I
+ask
+you
+to
+forgive
+me
+will
+you
+forgive
+me
+Mrs
+Sr
+I
+surely
+will
+You
+didn
+t
+know
+any
+better
+Sp
+You
+have
+helped
+me
+to
+light
+and
+it
+was
+because
+of
+you
+that
+I
+reached
+this
+understanding
+Mrs
+S
+You
+must
+thank
+the
+Wicklands
+for
+it
+Sp
+I
+don
+t
+feel
+like
+thanking
+them
+for
+it
+Mother
+says
+I
+must
+because
+I
+would
+still
+be
+in
+that
+terrible
+pain
+and
+agony
+but
+for
+them
+She
+says
+I
+got
+into
+your
+magnetic
+aura
+with
+a
+mind
+full
+of
+pain
+and
+selfishness
+and
+envy
+Love
+was
+not
+in
+me
+except
+selfish
+love
+and
+she
+says
+now
+I
+must
+have
+love
+for
+others
+and
+not
+self
+Forget
+self
+and
+work
+for
+others
+then
+she
+says
+I
+will
+be
+happy
+Dr
+Love
+is
+the
+fulfillment
+of
+the
+law
+Sp
+I
+don
+t
+know
+I
+didn
+t
+have
+much
+interest
+in
+those
+things
+I
+now
+see
+myself
+as
+I
+was
+I
+was
+a
+bundle
+of
+selfishness
+Mrs
+Sr
+I
+must
+also
+ask
+you
+to
+forgive
+me
+because
+many
+times
+I
+spoke
+to
+you
+in
+a
+very
+rude
+way
+and
+I
+was
+selfish
+I
+felt
+people
+should
+always
+come
+to
+see
+me
+and
+they
+had
+to
+do
+it
+I
+see
+now
+my
+selfishness
+Mrs
+Sr
+please
+forgive
+me
+I
+ask
+it
+now
+from
+my
+heart
+I
+see
+now
+but
+before
+I
+did
+not
+want
+to
+see
+it
+because
+that
+was
+putting
+my
+past
+life
+before
+me
+and
+how
+I
+had
+lived
+for
+self
+I
+do
+not
+want
+that
+evil
+ugly
+homely
+body
+of
+mine
+which
+they
+guiding
+intelligences
+show
+me
+That
+is
+not
+my
+body
+Dr
+That
+is
+your
+spiritual
+body
+for
+you
+have
+made
+no
+other
+You
+have
+made
+a
+spiritual
+body
+of
+only
+selfishness
+and
+jealousy
+Sp
+It
+is
+all
+crippled
+and
+wrinkled
+Dr
+You
+will
+have
+to
+alter
+it
+by
+your
+good
+acts
+for
+others
+You
+will
+have
+to
+wear
+the
+garment
+you
+made
+until
+you
+have
+earned
+another
+Sp
+To
+think
+I
+should
+have
+to
+wear
+such
+an
+ugly
+homely
+old
+fool
+thing
+That
+that
+spiritual
+body
+of
+mine
+just
+because
+I
+did
+not
+do
+anybody
+any
+good
+Dr
+You
+will
+have
+to
+wear
+that
+and
+be
+happy
+until
+you
+have
+learned
+how
+to
+earn
+another
+and
+to
+climb
+the
+hill
+of
+understanding
+and
+wisdom
+Sp
+So
+I
+have
+to
+live
+now
+in
+that
+awful
+body
+of
+mine
+I
+have
+to
+get
+in
+Dr
+Serve
+serve
+your
+fellow
+man
+Sp
+I
+will
+be
+brave
+and
+I
+will
+try
+because
+now
+I
+see
+what
+I
+should
+have
+done
+but
+I
+did
+not
+do
+it
+They
+say
+it
+is
+not
+too
+late
+and
+I
+will
+try
+to
+wear
+that
+body
+all
+wrinkled
+and
+so
+homely
+They
+tell
+me
+I
+can
+soon
+wear
+it
+out
+by
+good
+acts
+and
+each
+time
+I
+do
+some
+good
+act
+some
+wrinkles
+will
+be
+taken
+away
+and
+there
+will
+be
+a
+change
+for
+the
+better
+I
+will
+try
+to
+be
+happy
+It
+is
+hard
+Mrs
+Sr
+help
+me
+Dr
+We
+will
+all
+help
+you
+Sp
+Give
+me
+some
+little
+sympathy
+because
+I
+have
+to
+be
+in
+that
+terrible
+homely
+body
+of
+mine
+that
+I
+have
+made
+only
+by
+selfishness
+and
+hate
+I
+will
+wear
+it
+until
+I
+can
+do
+better
+I
+need
+help
+and
+strength
+so
+that
+I
+can
+stand
+it
+Mrs
+Sr
+forgive
+me
+They
+say
+I
+have
+done
+harm
+to
+you
+and
+that
+now
+I
+have
+to
+wear
+that
+homely
+body
+and
+have
+to
+serve
+you
+I
+will
+serve
+you
+and
+help
+you
+My
+first
+lesson
+will
+be
+how
+to
+be
+kind
+I
+will
+I
+will
+Dr
+You
+will
+find
+many
+good
+friends
+who
+will
+help
+you
+Ask
+the
+intelligent
+spirits
+to
+help
+you
+Will
+you
+ask
+them
+Sp
+Yes
+I
+will
+They
+say
+I
+must
+thank
+you
+for
+those
+thundershots
+Dr
+Do
+you
+believe
+in
+spirits
+now
+Sp
+I
+must
+I
+suppose
+Don
+t
+be
+like
+I
+was
+selfish
+but
+do
+what
+you
+can
+so
+that
+you
+will
+not
+have
+to
+get
+into
+a
+crippled
+up
+body
+like
+mine
+They
+say
+no
+one
+can
+help
+us
+to
+work
+out
+our
+own
+salvation
+Make
+your
+spirit
+body
+more
+beautiful
+than
+mine
+Now
+I
+will
+go
+and
+begin
+my
+work
+Goodby
+Miss
+F
+H
+a
+talented
+young
+musician
+of
+gentle
+disposition
+was
+a
+student
+in
+college
+when
+she
+suddenly
+became
+violent
+and
+destructive
+tore
+her
+clothes
+into
+shreds
+and
+struck
+every
+one
+who
+came
+near
+her
+She
+was
+finally
+placed
+in
+a
+sanitarium
+kept
+in
+a
+locked
+room
+for
+some
+time
+and
+her
+case
+diagnosed
+as
+dementia
+praecox
+When
+brought
+to
+our
+Institute
+she
+had
+become
+almost
+a
+skeleton
+At
+this
+time
+she
+declared
+constantly
+her
+name
+was
+not
+Miss
+H
+but
+that
+she
+was
+Margaret
+Young
+of
+England
+and
+had
+two
+children
+One
+noon
+as
+Miss
+H
+was
+seated
+at
+the
+table
+Mrs
+Wickland
+clairvoyantly
+saw
+the
+spirit
+of
+a
+newsboy
+take
+possession
+of
+the
+patient
+and
+reach
+eagerly
+for
+food
+exclaiming
+Gee
+whiz
+I
+m
+hungry
+I
+haven
+t
+had
+anything
+to
+eat
+for
+a
+long
+time
+His
+hunger
+satisfied
+the
+newsboy
+left
+and
+after
+this
+occurrence
+the
+spirit
+of
+Margaret
+Young
+ceased
+tormenting
+the
+patient
+Miss
+F
+H
+had
+with
+her
+as
+companion
+a
+younger
+sister
+Miss
+C
+H
+who
+understood
+obsession
+and
+was
+of
+great
+help
+to
+her
+One
+afternoon
+while
+Miss
+F
+H
+was
+seated
+at
+the
+piano
+she
+suddenly
+became
+controlled
+by
+a
+strange
+entity
+but
+the
+sister
+sharply
+ordered
+the
+intruder
+to
+leave
+and
+the
+patient
+again
+became
+herself
+This
+spirit
+controlled
+Mrs
+Wickland
+during
+a
+physic
+circle
+held
+that
+evening
+and
+after
+this
+the
+patient
+improved
+rapidly
+Within
+four
+months
+she
+returned
+to
+her
+home
+entirely
+well
+graduated
+from
+college
+and
+later
+took
+up
+music
+professionally
+EXPERIENCE
+OCTOBER
+Spirit
+ALICE
+Patient
+Miss
+F
+H
+PSYChiC
+MRS
+WICKLAND
+Doctor
+Where
+did
+you
+come
+from
+Spirit
+I
+came
+here
+as
+a
+visitor
+Dr
+Would
+you
+please
+introduce
+yourself
+Sp
+I
+must
+find
+out
+where
+I
+am
+I
+do
+not
+know
+any
+of
+you
+people
+Dr
+Will
+you
+please
+tell
+us
+who
+you
+are
+Sp
+I
+do
+not
+know
+whether
+I
+want
+to
+tell
+you
+who
+I
+am
+Dr
+Then
+tell
+us
+how
+long
+you
+have
+been
+dead
+Sp
+Dead
+Dr
+Do
+you
+understand
+your
+situation
+Why
+are
+you
+here
+Sp
+I
+do
+not
+know
+what
+I
+came
+here
+for
+Somebody
+told
+me
+to
+come
+in
+here
+but
+I
+do
+not
+see
+any
+object
+in
+coming
+Dr
+Perhaps
+we
+may
+learn
+something
+from
+you
+You
+could
+tell
+us
+about
+your
+life
+and
+present
+condition
+Tell
+us
+who
+you
+are
+introduce
+yourself
+Sp
+Oh
+I
+do
+not
+know
+Dr
+Who
+told
+you
+to
+come
+in
+here
+Do
+you
+know
+the
+party
+Sp
+No
+I
+was
+walking
+around
+trying
+to
+find
+some
+place
+Everything
+had
+been
+so
+dark
+and
+I
+have
+been
+walking
+such
+a
+long
+time
+and
+I
+am
+very
+tired
+I
+do
+not
+want
+to
+be
+talked
+to
+I
+want
+to
+rest
+Dr
+You
+cannot
+do
+that
+because
+you
+are
+a
+stranger
+here
+Are
+you
+a
+man
+or
+a
+woman
+Sp
+That
+s
+a
+very
+strange
+question
+to
+ask
+Dr
+It
+may
+seem
+so
+to
+you
+Sp
+Can
+t
+you
+see
+whether
+I
+am
+a
+man
+or
+woman
+Don
+t
+they
+dress
+differently
+Dr
+This
+is
+a
+lady
+s
+body
+in
+this
+chair
+Are
+you
+a
+lady
+Sp
+I
+most
+certainly
+am
+not
+a
+man
+Dr
+Were
+you
+a
+woman
+or
+a
+girl
+Sp
+I
+have
+not
+changed
+to
+a
+man
+I
+tell
+you
+Dr
+You
+evidently
+changed
+your
+bodily
+form
+If
+I
+tell
+you
+that
+this
+is
+the
+body
+of
+my
+wife
+you
+would
+be
+surprised
+Evidently
+you
+are
+still
+asleep
+Sp
+Asleep
+this
+time
+of
+day
+Dr
+Why
+not
+try
+to
+understand
+matters
+You
+know
+you
+are
+in
+a
+strange
+situation
+Try
+to
+understand
+it
+try
+to
+learn
+the
+reason
+This
+body
+is
+not
+your
+own
+Sp
+How
+you
+talk
+I
+came
+into
+this
+room
+and
+I
+certainly
+could
+not
+come
+in
+without
+a
+body
+I
+did
+not
+come
+in
+like
+a
+feather
+floating
+around
+Dr
+Do
+you
+recognize
+these
+hands
+Sp
+Those
+hands
+belong
+to
+me
+Dr
+I
+want
+you
+to
+understand
+that
+you
+are
+using
+some
+one
+s
+body
+temporarily
+You
+do
+not
+recognize
+these
+hands
+Sp
+I
+am
+not
+used
+to
+such
+treatment
+Haughtily
+I
+used
+to
+be
+in
+society
+General
+laughter
+Oh
+dear
+Everyone
+is
+laughing
+at
+me
+I
+do
+not
+know
+what
+to
+do
+it
+is
+so
+provoking
+Dr
+Did
+you
+have
+a
+great
+deal
+of
+wealth
+when
+you
+had
+your
+own
+body
+Sp
+Why
+should
+I
+tell
+you
+of
+my
+affairs
+Dr
+Were
+you
+only
+pretending
+to
+be
+aristocratic
+Sp
+I
+never
+heard
+such
+talk
+before
+Dr
+You
+are
+a
+spirit
+but
+do
+not
+understand
+your
+condition
+Sp
+I
+can
+t
+see
+how
+I
+happened
+to
+come
+here
+Struggling
+to
+leave
+Dr
+You
+must
+be
+sensible
+and
+listen
+to
+reason
+Sp
+Oh
+dear
+What
+shall
+I
+do
+Why
+should
+you
+hold
+my
+hands
+Dr
+I
+am
+not
+holding
+your
+hands
+I
+am
+holding
+my
+wife
+s
+hands
+Sp
+I
+am
+not
+your
+wife
+Dr
+Ask
+these
+persons
+if
+this
+is
+not
+my
+wife
+Sp
+I
+do
+not
+know
+these
+people
+and
+I
+do
+not
+care
+to
+Dr
+When
+you
+are
+ready
+to
+talk
+we
+will
+talk
+sensibly
+Sp
+You
+need
+not
+dictate
+to
+me
+Dr
+How
+long
+have
+you
+been
+dead
+Sp
+Dead
+What
+are
+you
+talking
+about
+I
+have
+never
+died
+Dr
+You
+have
+lost
+your
+physical
+body
+and
+have
+evidently
+been
+wandering
+around
+for
+a
+long
+time
+You
+are
+allowed
+to
+control
+my
+wife
+s
+body
+and
+you
+must
+behave
+sensibly
+Sp
+I
+do
+not
+like
+that
+girl
+with
+the
+yellow
+waist
+Miss
+C
+R
+the
+patient
+s
+sister
+She
+bothers
+me
+so
+very
+much
+She
+drove
+me
+away
+when
+I
+was
+getting
+along
+so
+nicely
+To
+Miss
+C
+H
+What
+right
+have
+you
+to
+do
+that
+to
+me
+I
+do
+not
+like
+you
+one
+bit
+Dr
+She
+probably
+drove
+out
+an
+earthbound
+spirit
+You
+do
+not
+realize
+your
+own
+condition
+Sp
+She
+chased
+me
+away
+and
+I
+don
+t
+like
+her
+Dr
+You
+were
+controlling
+her
+sister
+and
+she
+did
+not
+like
+it
+You
+are
+an
+earthbound
+spirit
+Sp
+I
+am
+no
+such
+thing
+Stamping
+Dr
+You
+are
+a
+spirit
+ignorant
+of
+your
+actual
+condition
+Sp
+You
+need
+not
+talk
+to
+me
+I
+will
+not
+listen
+to
+you
+Dr
+Do
+you
+realize
+that
+you
+are
+using
+another
+person
+s
+body
+Sp
+You
+certainly
+are
+crazy
+Dr
+Do
+you
+not
+wish
+to
+be
+helped
+Sp
+Do
+you
+think
+I
+need
+your
+help
+Why
+I
+came
+in
+here
+just
+to
+see
+what
+things
+were
+I
+have
+been
+walking
+so
+long
+and
+then
+there
+was
+a
+litle
+light
+aura
+of
+sensitive
+and
+that
+girl
+in
+the
+yellow
+waist
+talked
+to
+me
+as
+if
+she
+owned
+the
+whole
+earth
+Talking
+to
+me
+like
+that
+Dr
+Does
+it
+not
+seem
+strange
+to
+you
+that
+you
+are
+in
+the
+dark
+Sp
+I
+was
+lost
+and
+have
+been
+walking
+around
+for
+a
+long
+time
+It
+has
+been
+very
+dark
+and
+I
+have
+felt
+so
+badly
+I
+have
+not
+seen
+anything
+Dr
+Strive
+to
+understand
+why
+you
+are
+in
+the
+dark
+Sp
+I
+heard
+music
+patient
+at
+piano
+so
+I
+thought
+I
+would
+listen
+to
+it
+and
+then
+before
+I
+knew
+it
+I
+saw
+a
+light
+and
+then
+came
+this
+thing
+to
+me
+Miss
+C
+H
+and
+talked
+as
+if
+she
+owned
+the
+earth
+Dr
+Let
+me
+tell
+you
+something
+This
+girl
+s
+sister
+is
+a
+psychic
+sensitive
+and
+has
+been
+controlled
+by
+different
+spirits
+who
+have
+disturbed
+her
+life
+Today
+she
+was
+playing
+the
+piano
+you
+listened
+and
+got
+in
+touch
+with
+her
+magnetic
+aura
+Through
+that
+you
+saw
+a
+little
+light
+and
+then
+you
+controlled
+the
+girl
+Sp
+I
+have
+never
+seen
+you
+before
+today
+young
+lady
+To
+Miss
+F
+H
+Dr
+At
+the
+present
+time
+you
+are
+controlling
+my
+wife
+s
+body
+Sp
+I
+am
+sick
+and
+tired
+of
+hearing
+that
+Dr
+Can
+t
+you
+understand
+what
+I
+am
+telling
+you
+Sp
+I
+do
+not
+understand
+it
+one
+bit
+about
+controlling
+How
+can
+I
+control
+another
+body
+That
+is
+such
+nonsense
+Dr
+My
+wife
+is
+a
+psychic
+sensitive
+and
+allows
+spirits
+to
+control
+her
+body
+Sp
+Spiritualists
+then
+I
+suppose
+you
+are
+all
+Spiritualists
+I
+see
+I
+see
+They
+are
+all
+crazy
+all
+crazy
+Dr
+You
+are
+proving
+the
+fallacy
+of
+your
+thinking
+at
+the
+present
+moment
+You
+are
+a
+spirit
+and
+are
+using
+my
+wife
+s
+body
+Sp
+Keep
+still
+with
+that
+wife
+business
+I
+was
+never
+married
+and
+I
+certainly
+will
+not
+marry
+you
+Dr
+I
+said
+this
+is
+my
+wife
+s
+body
+Sp
+There
+you
+are
+again
+insinuating
+about
+the
+wife
+business
+This
+body
+belongs
+to
+me
+Dr
+For
+a
+little
+while
+only
+Sp
+Have
+you
+ever
+seen
+a
+person
+change
+bodies
+What
+are
+you
+talking
+about
+Dr
+Did
+you
+ever
+stop
+to
+consider
+what
+mind
+is
+Sp
+That
+belongs
+to
+the
+soul
+and
+the
+soul
+is
+part
+of
+the
+Divine
+God
+Dr
+That
+sounds
+very
+well
+Do
+you
+understand
+what
+God
+is
+I
+am
+trying
+to
+reach
+your
+understanding
+You
+have
+lost
+your
+body
+and
+are
+now
+a
+spirit
+absolutely
+invisible
+to
+us
+Sp
+Crazy
+crazy
+crazy
+You
+are
+the
+craziest
+person
+I
+ever
+saw
+Dr
+How
+would
+you
+explain
+the
+situation
+Sp
+That
+girl
+came
+to
+me
+with
+such
+force
+and
+told
+me
+to
+get
+out
+and
+before
+I
+knew
+it
+I
+was
+gone
+I
+stayed
+around
+and
+tried
+and
+tried
+to
+get
+back
+because
+I
+was
+not
+going
+to
+be
+driven
+out
+as
+she
+thought
+I
+have
+been
+watching
+for
+another
+chance
+to
+get
+in
+again
+and
+here
+I
+am
+and
+now
+you
+can
+t
+drive
+me
+out
+Dr
+Should
+not
+such
+an
+experience
+cause
+you
+to
+think
+Sp
+Why
+should
+I
+Dr
+You
+realize
+that
+you
+are
+in
+a
+strange
+condition
+You
+are
+very
+selfish
+you
+know
+that
+I
+am
+telling
+the
+truth
+Sp
+You
+have
+not
+told
+me
+any
+truth
+yet
+Dr
+Ask
+one
+of
+these
+gentlemen
+whose
+hands
+I
+am
+holding
+Ans
+The
+doctor
+is
+holding
+his
+wife
+s
+hands
+Dr
+You
+are
+a
+spirit
+and
+are
+invisible
+to
+us
+I
+am
+holding
+the
+hands
+of
+Mrs
+Wickland
+Sp
+How
+in
+the
+world
+am
+I
+Mrs
+Wickland
+Dr
+You
+are
+not
+Mrs
+Wickland
+You
+are
+only
+using
+her
+body
+Sp
+Now
+you
+know
+we
+cannot
+change
+bodies
+I
+know
+this
+Dr
+You
+have
+lost
+your
+own
+body
+and
+are
+a
+spirit
+Sp
+Then
+why
+did
+I
+lose
+it
+If
+I
+were
+dead
+and
+had
+lost
+my
+body
+how
+in
+the
+world
+could
+I
+have
+been
+walking
+around
+as
+I
+have
+been
+I
+was
+so
+hungry
+for
+a
+while
+and
+I
+wanted
+to
+get
+something
+to
+eat
+but
+that
+thing
+pointing
+to
+Miss
+C
+H
+chased
+me
+out
+I
+put
+up
+some
+fight
+because
+I
+was
+so
+hungry
+Dr
+It
+is
+your
+body
+that
+is
+dead
+you
+have
+lost
+that
+but
+you
+yourself
+are
+not
+dead
+Paul
+said
+There
+is
+a
+natural
+body
+and
+there
+is
+a
+spiritual
+body
+You
+have
+lost
+your
+natural
+body
+Sp
+When
+did
+I
+do
+that
+Dr
+I
+do
+not
+know
+After
+you
+stepped
+out
+of
+your
+physical
+body
+you
+continued
+to
+live
+in
+your
+spiritual
+body
+You
+were
+brought
+here
+to
+obtain
+an
+understanding
+of
+your
+condition
+When
+you
+have
+that
+you
+will
+not
+need
+to
+walk
+in
+the
+darkness
+any
+longer
+You
+will
+then
+have
+an
+understanding
+of
+the
+spirit
+life
+Sp
+I
+have
+been
+walking
+but
+I
+am
+on
+earth
+not
+in
+Heaven
+Dr
+What
+do
+you
+understand
+Heaven
+to
+be
+Sp
+That
+is
+where
+God
+is
+Dr
+The
+Bible
+says
+God
+is
+Love
+and
+Ye
+are
+the
+temple
+of
+God
+and
+the
+Spirit
+of
+God
+dweIleth
+in
+you
+If
+you
+have
+love
+in
+your
+heart
+then
+you
+are
+a
+part
+of
+God
+Sp
+I
+have
+always
+done
+the
+very
+best
+I
+could
+Dr
+Do
+you
+know
+what
+year
+it
+is
+It
+is
+Can
+you
+realize
+that
+you
+have
+been
+in
+the
+dark
+for
+some
+time
+Sp
+I
+have
+been
+in
+the
+dark
+and
+cannot
+remember
+things
+very
+well
+Dr
+That
+is
+because
+you
+have
+lost
+all
+physical
+contact
+and
+have
+no
+understanding
+of
+the
+higher
+life
+You
+have
+been
+brought
+here
+for
+the
+purpose
+of
+being
+helped
+You
+can
+only
+stay
+for
+a
+short
+time
+Sp
+But
+where
+will
+I
+go
+Dr
+To
+the
+spirit
+world
+What
+is
+your
+name
+Sp
+I
+do
+not
+know
+Miss
+C
+H
+You
+told
+it
+to
+me
+this
+afternoon
+You
+said
+your
+name
+was
+Mary
+Bulwer
+and
+that
+you
+were
+from
+Germany
+Sp
+I
+did
+not
+say
+that
+You
+were
+speaking
+to
+my
+friend
+at
+that
+time
+Another
+spirit
+controlling
+patient
+Dr
+Do
+you
+realize
+where
+you
+are
+now
+Do
+you
+know
+that
+you
+are
+in
+Los
+Angeles
+California
+Sp
+No
+Dr
+Where
+do
+you
+think
+you
+are
+Sp
+My
+friend
+and
+I
+were
+traveling
+on
+the
+railroad
+Dr
+Did
+something
+happen
+Sp
+We
+were
+going
+to
+now
+I
+can
+t
+remember
+where
+Oh
+Mary
+To
+a
+spirit
+Don
+t
+go
+You
+know
+you
+were
+my
+companion
+my
+traveling
+companion
+I
+always
+paid
+your
+way
+and
+you
+must
+not
+leave
+me
+now
+Dr
+What
+does
+she
+say
+she
+is
+going
+to
+do
+Sp
+Mary
+won
+t
+you
+please
+tell
+me
+my
+name
+Look
+Look
+at
+that
+fire
+The
+whole
+thing
+is
+on
+fire
+Dr
+You
+are
+again
+going
+through
+the
+condition
+under
+which
+you
+passed
+out
+Sp
+Mary
+Mary
+look
+at
+that
+fire
+Dr
+Were
+you
+in
+a
+railroad
+accident
+Sp
+Yes
+yes
+Dr
+That
+has
+all
+passed
+Sp
+Look
+at
+Mary
+She
+s
+dead
+She
+was
+crushed
+Dr
+They
+are
+revealing
+to
+you
+the
+conditions
+under
+which
+you
+passed
+out
+That
+is
+all
+in
+the
+past
+You
+must
+quiet
+yourself
+Sp
+I
+only
+got
+a
+glimpse
+of
+it
+for
+just
+a
+minute
+Dr
+What
+does
+Mary
+say
+Does
+she
+understand
+that
+she
+has
+passed
+out
+Sp
+She
+is
+lost
+and
+so
+am
+I
+We
+are
+both
+lost
+We
+lost
+our
+way
+Dr
+That
+is
+because
+you
+are
+ignorant
+of
+the
+real
+life
+If
+you
+had
+had
+understanding
+when
+you
+had
+your
+physical
+body
+you
+would
+not
+have
+been
+lost
+Sp
+I
+have
+been
+walking
+and
+Mary
+is
+dead
+Dr
+She
+is
+not
+really
+dead
+she
+only
+lost
+her
+physical
+body
+Mary
+is
+no
+more
+dead
+than
+you
+are
+You
+are
+both
+spirits
+Sp
+I
+died
+in
+that
+terrible
+fire
+Look
+at
+them
+all
+All
+those
+people
+are
+burning
+up
+Greatly
+excited
+Dr
+Forget
+the
+accident
+and
+collect
+yourself
+Try
+to
+calm
+yourself
+and
+forget
+the
+past
+Sp
+Agitated
+at
+sight
+of
+several
+spirits
+I
+don
+t
+want
+to
+see
+them
+any
+of
+them
+Look
+at
+that
+one
+He
+is
+coming
+he
+s
+coming
+I
+don
+t
+want
+to
+see
+you
+I
+don
+t
+want
+you
+and
+I
+told
+you
+I
+did
+not
+want
+you
+Dr
+You
+probably
+wronged
+these
+persons
+in
+life
+and
+are
+now
+having
+to
+meet
+the
+consequences
+Sp
+I
+just
+had
+a
+good
+time
+with
+you
+but
+I
+don
+t
+care
+for
+you
+I
+only
+wanted
+to
+see
+how
+much
+you
+loved
+me
+but
+I
+don
+t
+love
+you
+Now
+they
+say
+they
+come
+to
+accuse
+me
+I
+do
+not
+want
+any
+of
+them
+There
+are
+three
+Dr
+Men
+or
+women
+Sp
+I
+do
+not
+love
+a
+woman
+Why
+do
+they
+come
+here
+Dr
+What
+does
+your
+conscience
+tell
+you
+Sp
+Sneeringly
+He
+killed
+himself
+because
+I
+would
+not
+marry
+him
+the
+fool
+Dr
+Didn
+t
+you
+play
+vampire
+in
+the
+first
+place
+Sp
+That
+s
+my
+affair
+Dr
+You
+will
+now
+have
+to
+strive
+to
+do
+better
+Sp
+Let
+me
+remain
+in
+darkness
+it
+is
+far
+better
+than
+this
+There
+I
+just
+walked
+I
+did
+not
+see
+anything
+but
+I
+am
+tired
+of
+walking
+Dr
+What
+does
+your
+conscience
+tell
+you
+Sp
+Do
+not
+talk
+to
+me
+about
+conscience
+Dr
+Jesus
+said
+Except
+ye
+become
+as
+little
+children
+ye
+shall
+not
+enter
+into
+the
+kingdom
+of
+heaven
+You
+will
+have
+to
+start
+a
+new
+life
+you
+will
+have
+to
+develop
+a
+newness
+of
+spirit
+Sacrifice
+self
+You
+will
+have
+to
+sacrifice
+self
+and
+become
+as
+a
+little
+child
+you
+will
+have
+to
+correct
+your
+mistakes
+Sp
+To
+another
+spirit
+What
+have
+you
+to
+do
+with
+me
+now
+Dr
+You
+have
+wronged
+these
+men
+you
+speak
+of
+Sp
+There
+is
+a
+woman
+here
+too
+What
+have
+you
+to
+do
+with
+me
+I
+said
+No
+I
+never
+paid
+her
+for
+my
+dresses
+Accusing
+me
+just
+because
+I
+did
+not
+pay
+Dr
+Was
+that
+the
+right
+thing
+to
+do
+Your
+conscience
+told
+you
+what
+you
+should
+have
+done
+Now
+you
+will
+have
+to
+serve
+others
+Selfishness
+is
+the
+root
+of
+all
+evil
+Sp
+I
+was
+taught
+nothing
+except
+to
+have
+a
+good
+time
+and
+spend
+money
+Money
+was
+just
+what
+I
+was
+taught
+in
+my
+childhood
+to
+be
+proud
+of
+Not
+a
+serious
+thought
+for
+any
+one
+that
+was
+beneath
+me
+Why
+should
+I
+have
+been
+taught
+that
+and
+now
+have
+to
+suffer
+for
+it
+Dr
+Was
+truth
+in
+your
+heart
+Sp
+I
+was
+taught
+always
+to
+have
+the
+respect
+of
+others
+and
+to
+remember
+that
+I
+was
+rich
+and
+that
+I
+should
+have
+all
+the
+world
+could
+give
+me
+I
+wanted
+money
+and
+when
+I
+broke
+a
+heart
+it
+was
+good
+cheer
+to
+me
+To
+spirits
+I
+said
+Don
+t
+come
+don
+t
+come
+Dr
+You
+have
+been
+brought
+here
+for
+help
+lie
+quiet
+and
+listen
+to
+me
+You
+will
+now
+have
+to
+try
+to
+undo
+your
+mistakes
+Sp
+I
+could
+never
+do
+that
+Dr
+You
+can
+and
+you
+will
+Others
+are
+here
+to
+help
+you
+and
+they
+will
+show
+you
+a
+better
+way
+Don
+t
+be
+selfish
+Sp
+I
+am
+very
+selfish
+and
+I
+have
+always
+been
+very
+selfish
+was
+never
+taught
+anything
+else
+My
+mother
+was
+a
+proud
+woman
+and
+she
+was
+very
+pretty
+Dr
+Unfortunately
+for
+you
+You
+must
+quiet
+yourself
+you
+have
+been
+allowed
+to
+come
+here
+for
+help
+Do
+you
+see
+any
+one
+else
+you
+know
+Sp
+I
+do
+not
+care
+to
+look
+around
+any
+more
+I
+see
+only
+those
+whom
+I
+have
+wronged
+They
+are
+all
+standing
+here
+Oh
+Shrinking
+back
+Why
+should
+I
+suffer
+so
+Dr
+You
+created
+that
+suffering
+yourself
+There
+is
+help
+for
+you
+if
+you
+will
+be
+sincere
+Intelligent
+spirits
+will
+help
+you
+Sp
+I
+thought
+that
+I
+could
+live
+and
+have
+a
+good
+time
+I
+traveled
+everywhere
+I
+wanted
+to
+go
+I
+saw
+everything
+and
+had
+everything
+I
+wanted
+that
+money
+could
+buy
+Every
+wish
+I
+had
+was
+gratified
+Dr
+You
+stupified
+your
+soul
+You
+will
+now
+have
+to
+undo
+your
+own
+follies
+by
+kindness
+You
+will
+have
+to
+serve
+others
+Sp
+I
+cannot
+serve
+anybody
+They
+will
+have
+to
+serve
+me
+I
+have
+never
+done
+anything
+in
+my
+life
+I
+have
+always
+been
+waited
+on
+Dr
+Understand
+that
+unless
+you
+help
+these
+spirits
+you
+will
+continue
+to
+suffer
+You
+will
+have
+nothing
+but
+the
+torment
+of
+your
+own
+conscience
+until
+you
+ask
+for
+mercy
+and
+say
+I
+will
+serve
+Sp
+I
+never
+can
+wait
+on
+any
+one
+that
+would
+be
+a
+step
+beneath
+me
+What
+would
+my
+mother
+say
+if
+I
+should
+wait
+on
+any
+one
+beneath
+me
+Dr
+There
+is
+nobody
+beneath
+you
+Money
+does
+not
+make
+intelligence
+nor
+merit
+Sp
+Nobody
+beneath
+me
+Would
+I
+associate
+with
+my
+dressmaker
+Dr
+When
+you
+go
+to
+the
+spirit
+world
+you
+will
+probably
+find
+that
+your
+humblest
+servant
+has
+a
+higher
+position
+than
+you
+have
+You
+will
+often
+find
+that
+the
+people
+you
+think
+beneath
+you
+have
+the
+most
+beautiful
+homes
+in
+the
+spirit
+world
+You
+have
+much
+to
+do
+to
+overcome
+your
+own
+disposition
+There
+are
+many
+advanced
+spirits
+here
+who
+will
+help
+you
+Jesus
+taught
+us
+that
+we
+must
+humble
+ourselves
+Sp
+You
+do
+not
+know
+what
+that
+would
+mean
+to
+me
+Dr
+My
+wife
+allows
+spirits
+of
+all
+kinds
+to
+control
+her
+brain
+and
+body
+Would
+you
+be
+willing
+to
+sacrifice
+yourself
+as
+she
+does
+She
+allows
+you
+to
+control
+her
+body
+so
+we
+can
+help
+you
+to
+a
+better
+understanding
+Look
+around
+and
+you
+will
+find
+spirits
+here
+who
+will
+help
+you
+Sp
+Oh
+Rudolph
+Spirit
+I
+loved
+you
+but
+you
+know
+that
+my
+pride
+and
+my
+mother
+would
+not
+consent
+to
+our
+marriage
+I
+know
+you
+suffered
+but
+you
+did
+not
+know
+that
+I
+suffered
+also
+You
+know
+you
+could
+not
+give
+me
+the
+social
+standing
+I
+was
+used
+to
+I
+loved
+you
+and
+I
+love
+you
+yet
+Rudolph
+will
+you
+forgive
+me
+I
+would
+have
+liked
+to
+have
+married
+you
+Rudolph
+but
+I
+could
+not
+Dr
+Why
+should
+pride
+and
+money
+be
+obstacles
+to
+love
+Sp
+I
+was
+not
+happy
+but
+I
+had
+to
+crush
+that
+I
+did
+not
+dare
+go
+contrary
+to
+my
+mother
+I
+had
+to
+shine
+in
+society
+with
+a
+broken
+heart
+I
+had
+to
+smile
+at
+all
+those
+fools
+I
+had
+to
+be
+another
+person
+when
+my
+heart
+and
+love
+were
+with
+you
+Rudolph
+but
+forgive
+me
+I
+know
+you
+suffered
+I
+went
+to
+your
+funeral
+but
+mother
+did
+not
+know
+it
+I
+wished
+I
+were
+dead
+and
+could
+go
+with
+you
+but
+I
+had
+to
+close
+the
+door
+to
+love
+From
+the
+moment
+you
+had
+gone
+I
+said
+I
+would
+conquer
+and
+shut
+out
+love
+and
+sympathy
+and
+I
+would
+now
+live
+for
+selfishness
+and
+let
+others
+suffer
+as
+I
+had
+suffered
+for
+the
+love
+I
+had
+to
+shut
+out
+of
+my
+heart
+Rudolph
+forgive
+and
+help
+me
+You
+were
+such
+a
+good
+man
+but
+religion
+and
+money
+and
+mother
+stood
+between
+us
+and
+love
+You
+were
+poor
+but
+you
+were
+good
+He
+says
+if
+he
+could
+have
+been
+with
+me
+he
+could
+have
+taught
+me
+to
+be
+a
+good
+woman
+Yes
+Rudolph
+but
+the
+good
+influence
+you
+brought
+with
+you
+was
+shut
+out
+for
+me
+then
+I
+did
+not
+care
+what
+became
+of
+me
+I
+went
+into
+society
+and
+had
+a
+good
+time
+trying
+to
+drown
+my
+sorrow
+I
+tried
+to
+lead
+every
+man
+on
+so
+that
+I
+could
+get
+him
+down
+at
+my
+feet
+I
+did
+not
+care
+if
+I
+crushed
+men
+I
+wanted
+others
+to
+suffer
+as
+I
+had
+suffered
+Dr
+That
+was
+selfish
+Sp
+I
+was
+taught
+nothing
+but
+selfishness
+Dr
+What
+does
+Rudolph
+say
+Sp
+He
+says
+Alice
+come
+with
+me
+to
+the
+spirit
+world
+Crying
+He
+says
+in
+Heaven
+there
+is
+no
+pride
+to
+interfere
+all
+is
+love
+and
+harmony
+Dr
+We
+can
+help
+you
+Strive
+to
+understand
+When
+you
+realize
+the
+better
+life
+you
+will
+have
+much
+to
+do
+to
+correct
+your
+mistakes
+You
+can
+undo
+your
+mistakes
+by
+kindness
+to
+others
+You
+will
+have
+to
+work
+out
+your
+own
+salvation
+Sp
+Stooping
+forward
+Carl
+don
+t
+go
+I
+know
+you
+meant
+well
+but
+I
+could
+not
+love
+you
+when
+my
+heart
+was
+with
+another
+I
+knew
+I
+was
+at
+fault
+when
+you
+killed
+yourself
+See
+he
+just
+lies
+there
+Crying
+Dr
+He
+too
+will
+find
+understanding
+Others
+will
+help
+him
+Spirit
+is
+indestructible
+Sp
+Look
+there
+That
+cannot
+be
+My
+mother
+Look
+look
+how
+wrinkled
+and
+homely
+she
+is
+That
+cannot
+be
+my
+mother
+She
+says
+she
+is
+but
+it
+cannot
+be
+Oh
+she
+is
+so
+homely
+She
+was
+very
+lovely
+and
+beautiful
+That
+cannot
+be
+mother
+She
+is
+so
+homely
+so
+homely
+Mother
+what
+is
+the
+matter
+with
+you
+You
+had
+such
+a
+beautiful
+form
+now
+you
+are
+all
+shriveled
+Dr
+That
+is
+the
+spirit
+form
+which
+she
+developed
+by
+her
+selfishness
+Her
+spirit
+body
+is
+of
+her
+own
+making
+As
+a
+man
+thinketh
+in
+his
+heart
+so
+is
+he
+Sp
+Mother
+Mother
+what
+is
+the
+matter
+with
+you
+She
+says
+Alice
+I
+am
+at
+fault
+in
+the
+way
+I
+brought
+you
+up
+I
+am
+at
+fault
+for
+not
+bringing
+you
+up
+to
+be
+a
+better
+woman
+than
+you
+were
+I
+am
+at
+fault
+for
+breaking
+up
+that
+true
+love
+with
+Rudolph
+which
+probably
+would
+have
+brought
+out
+your
+better
+nature
+She
+says
+that
+she
+closed
+the
+door
+that
+she
+did
+not
+do
+any
+kind
+acts
+in
+life
+so
+her
+spirit
+body
+was
+all
+crippled
+because
+of
+her
+bad
+deeds
+She
+says
+she
+is
+now
+serving
+and
+when
+she
+does
+a
+good
+act
+some
+of
+her
+crippled
+condition
+disappears
+She
+is
+so
+crippled
+and
+she
+has
+ragged
+clothes
+on
+She
+says
+she
+is
+now
+serving
+with
+the
+body
+she
+earned
+when
+she
+was
+in
+earth
+life
+She
+is
+now
+showing
+me
+the
+body
+she
+has
+earned
+in
+spirit
+It
+is
+better
+than
+the
+other
+but
+her
+face
+is
+all
+wrinkled
+Dr
+Her
+face
+was
+her
+pride
+Sp
+She
+says
+she
+has
+to
+serve
+and
+help
+every
+one
+she
+wronged
+that
+she
+must
+do
+good
+acts
+many
+of
+them
+before
+her
+face
+will
+be
+beautiful
+She
+says
+Alice
+try
+to
+be
+different
+Here
+is
+your
+spirit
+body
+Alice
+Oh
+no
+Not
+that
+Rudolph
+come
+and
+help
+me
+You
+know
+how
+I
+feel
+Dr
+What
+is
+your
+name
+Ask
+your
+mother
+Sp
+My
+mother
+cannot
+tell
+me
+she
+cannot
+remember
+Dr
+Can
+you
+remember
+who
+is
+the
+President
+Sp
+McKinley
+Dr
+He
+was
+killed
+in
+Did
+you
+know
+he
+was
+dead
+He
+was
+shot
+in
+Buffalo
+in
+You
+must
+have
+been
+dead
+twenty
+years
+or
+more
+Sp
+Have
+I
+been
+walking
+all
+that
+time
+Dr
+You
+must
+have
+been
+Sp
+I
+was
+born
+in
+Milwaukee
+I
+wish
+I
+could
+tell
+more
+but
+I
+cannot
+The
+door
+is
+shut
+and
+I
+cannot
+even
+think
+Why
+cannot
+I
+get
+my
+name
+My
+memory
+is
+gone
+Please
+remember
+Alice
+Dr
+Your
+memory
+will
+come
+back
+to
+you
+Realize
+life
+as
+it
+is
+Think
+yourself
+with
+Rudolph
+now
+Sp
+I
+will
+I
+also
+want
+to
+thank
+you
+Goodbye
+Haughty
+superiority
+and
+pride
+of
+station
+had
+long
+kept
+the
+spirit
+of
+a
+cultured
+English
+lady
+in
+the
+earth
+sphere
+but
+with
+an
+understanding
+of
+life
+s
+higher
+purpose
+came
+spiritual
+discernment
+and
+progress
+EXPERIENCE
+OCTOBER
+Spirit
+ESTHER
+SUTHERLAND
+Psychic
+MRS
+WICKLAND
+The
+controlling
+intelligence
+was
+very
+arrogant
+and
+gazed
+disdainfully
+about
+Doctor
+Is
+your
+condition
+strange
+to
+you
+What
+has
+happened
+to
+you
+Spirit
+Many
+things
+have
+happened
+to
+me
+but
+that
+is
+not
+strange
+Dr
+We
+should
+like
+to
+know
+who
+you
+are
+and
+where
+you
+came
+from
+You
+are
+a
+stranger
+here
+Sp
+Condescendingly
+with
+marked
+English
+accent
+I
+fancy
+I
+am
+a
+stranger
+to
+you
+Dr
+May
+I
+ask
+to
+what
+nobility
+you
+belong
+Sp
+What
+sort
+of
+a
+gentleman
+are
+you
+to
+ask
+such
+personal
+questions
+Dr
+Do
+you
+not
+like
+this
+gathering
+Sp
+Greatly
+bored
+I
+do
+not
+know
+anything
+about
+you
+Dr
+Do
+you
+belong
+to
+royalty
+Sp
+Why
+are
+so
+many
+looking
+at
+me
+Some
+are
+standing
+some
+sitting
+Dr
+Some
+must
+be
+spirits
+Sp
+Spirits
+I
+fancy
+it
+is
+only
+imagination
+I
+see
+people
+sitting
+and
+standing
+It
+may
+be
+you
+have
+no
+glasses
+to
+see
+with
+I
+fancy
+you
+are
+of
+the
+more
+common
+class
+Dr
+We
+were
+not
+fortunate
+enough
+to
+be
+born
+in
+the
+upper
+class
+You
+have
+not
+introduced
+yourself
+to
+us
+yet
+Sp
+I
+would
+not
+care
+to
+have
+an
+introduction
+to
+any
+of
+you
+here
+Loftily
+I
+do
+not
+think
+you
+belong
+to
+the
+set
+I
+am
+used
+to
+going
+with
+Dr
+We
+are
+not
+particularly
+anxious
+to
+belong
+to
+that
+set
+but
+unless
+we
+know
+who
+you
+are
+we
+cannot
+pay
+you
+the
+honor
+due
+you
+Sp
+I
+do
+not
+know
+if
+I
+should
+like
+to
+have
+honor
+from
+you
+Dr
+We
+should
+like
+to
+treat
+you
+with
+proper
+respect
+Sp
+You
+have
+joked
+so
+rudely
+Dr
+Lady
+at
+least
+please
+tell
+us
+your
+name
+Sp
+I
+do
+not
+know
+if
+I
+should
+do
+so
+Looking
+her
+questioner
+over
+from
+head
+to
+foot
+through
+an
+imaginary
+lorgnette
+Dr
+It
+would
+not
+do
+you
+any
+harm
+you
+know
+Sp
+Pointing
+to
+reception
+room
+Who
+stands
+there
+Invisibles
+There
+are
+quite
+a
+few
+people
+here
+It
+seems
+like
+a
+meeting
+of
+some
+sort
+I
+do
+not
+know
+why
+I
+should
+have
+come
+here
+Dr
+Won
+t
+you
+please
+ask
+those
+people
+in
+the
+other
+room
+who
+they
+are
+I
+cannot
+see
+them
+Ask
+them
+why
+they
+are
+here
+Sp
+I
+fancy
+that
+is
+a
+select
+crowd
+and
+I
+think
+I
+had
+better
+go
+with
+them
+I
+fancy
+they
+are
+more
+my
+set
+Attempting
+to
+rise
+Dr
+Please
+remain
+seated
+and
+ask
+those
+people
+who
+they
+are
+Sp
+I
+do
+not
+see
+why
+I
+should
+ask
+them
+that
+Dr
+Introduce
+yourself
+to
+them
+Sp
+I
+do
+not
+think
+I
+should
+introduce
+myself
+We
+do
+not
+do
+that
+Dr
+You
+are
+a
+total
+stranger
+to
+us
+you
+might
+be
+an
+imposter
+Sp
+Turning
+frigidly
+away
+and
+speaking
+to
+the
+gentleman
+at
+her
+right
+Recently
+I
+have
+not
+been
+able
+to
+express
+my
+thoughts
+as
+well
+as
+I
+would
+care
+to
+Dr
+Just
+ask
+those
+people
+who
+they
+are
+Sp
+I
+told
+you
+I
+do
+not
+want
+to
+talk
+to
+them
+If
+you
+feel
+like
+talking
+to
+them
+you
+are
+welcome
+to
+go
+there
+and
+speak
+Dr
+But
+we
+cannot
+see
+anybody
+there
+How
+can
+we
+talk
+to
+them
+Sp
+I
+cannot
+help
+it
+I
+cannot
+help
+it
+Dr
+Ask
+them
+if
+they
+are
+spirits
+What
+do
+they
+do
+when
+I
+say
+they
+are
+spirits
+To
+the
+invisible
+assemblage
+Are
+you
+all
+spirits
+To
+controlling
+spirit
+What
+do
+they
+say
+Sp
+Some
+nod
+their
+heads
+Yes
+some
+do
+not
+answer
+but
+I
+cannot
+see
+why
+they
+should
+do
+that
+Most
+of
+them
+answer
+in
+the
+affirmative
+I
+see
+a
+soldier
+in
+uniform
+Dr
+That
+might
+be
+one
+of
+your
+relatives
+Are
+you
+of
+English
+descent
+Sp
+I
+am
+English
+Dr
+Do
+you
+know
+that
+Queen
+Victoria
+is
+dead
+Sp
+Queen
+Victoria
+was
+the
+English
+Queen
+She
+was
+a
+wonderful
+wonderful
+woman
+She
+died
+a
+long
+time
+ago
+Dr
+I
+think
+it
+was
+in
+Sp
+Yes
+I
+think
+it
+was
+was
+it
+not
+Dr
+King
+Edward
+is
+dead
+too
+Sp
+They
+used
+to
+say
+he
+was
+a
+wonderful
+King
+Everybody
+respected
+and
+loved
+him
+He
+was
+very
+much
+for
+everybody
+He
+mingled
+with
+the
+common
+herd
+as
+well
+as
+with
+fine
+society
+Dr
+That
+is
+a
+good
+suggestion
+for
+you
+You
+should
+feel
+more
+at
+home
+with
+the
+common
+herd
+Do
+you
+remember
+the
+Great
+War
+Sp
+What
+Great
+War
+Dr
+Do
+you
+know
+Lord
+Kitchener
+He
+died
+in
+the
+Great
+War
+Sp
+We
+had
+war
+with
+the
+Boers
+Dr
+That
+was
+about
+Did
+you
+know
+Lord
+Kitchener
+Sp
+He
+was
+a
+good
+man
+but
+not
+much
+in
+any
+war
+I
+do
+not
+know
+anything
+about
+the
+Great
+War
+you
+speak
+of
+Dr
+There
+were
+twenty
+three
+or
+four
+nations
+fighting
+each
+other
+England
+was
+fighting
+Germany
+Sp
+I
+fancy
+that
+is
+remarkable
+I
+do
+not
+know
+anything
+about
+that
+I
+used
+to
+read
+a
+great
+deal
+at
+one
+time
+Dr
+Do
+you
+remember
+the
+Kaiser
+Sp
+He
+was
+a
+strange
+man
+Dr
+Do
+you
+know
+that
+the
+Kaiser
+is
+deposed
+Do
+you
+know
+that
+the
+Czar
+and
+his
+family
+were
+killed
+Sp
+How
+Dr
+By
+the
+Bolshevists
+Sp
+What
+Who
+are
+they
+Dr
+They
+are
+the
+ones
+who
+upset
+the
+royalty
+business
+in
+Russia
+Sp
+No
+they
+did
+not
+call
+them
+that
+They
+called
+them
+what
+is
+that
+word
+I
+wish
+to
+say
+Ques
+Nihilist
+Sp
+Yes
+that
+is
+it
+They
+were
+sent
+to
+Siberia
+Dr
+The
+Czar
+was
+sent
+that
+way
+and
+then
+killed
+Sp
+Fancy
+that
+Dr
+Do
+you
+remember
+the
+Emperor
+of
+Austria
+He
+has
+passed
+on
+Sp
+Where
+have
+I
+been
+all
+this
+time
+not
+to
+know
+about
+the
+things
+of
+which
+you
+are
+talking
+Dr
+The
+Hapsburg
+House
+is
+no
+longer
+in
+power
+Sp
+No
+What
+is
+the
+world
+coming
+to
+Dr
+Coming
+to
+Democracy
+Sp
+All
+royalty
+gone
+Then
+the
+common
+herd
+is
+starting
+in
+to
+do
+wrong
+Dr
+There
+may
+be
+no
+aristocracy
+in
+time
+Sp
+We
+have
+noble
+blood
+in
+our
+veins
+Dr
+Suppose
+a
+commoner
+were
+made
+a
+King
+would
+that
+change
+his
+blood
+Do
+you
+remember
+that
+the
+King
+honored
+Napoleon
+and
+gave
+him
+a
+title
+That
+did
+not
+give
+him
+blue
+blood
+Sp
+I
+was
+born
+of
+noble
+blood
+and
+I
+will
+stick
+to
+that
+all
+my
+life
+Dr
+What
+is
+your
+name
+Were
+you
+a
+member
+of
+the
+English
+royal
+family
+Sp
+My
+name
+was
+in
+olden
+times
+well
+I
+have
+not
+had
+my
+name
+for
+a
+long
+time
+It
+seems
+to
+me
+yes
+my
+name
+was
+Esther
+Sutherland
+Ques
+Were
+you
+the
+Duchess
+of
+Sutherland
+Sp
+Indignantly
+No
+I
+was
+not
+the
+Duchess
+but
+one
+of
+the
+distant
+relatives
+They
+all
+had
+more
+money
+while
+I
+only
+had
+the
+title
+That
+is
+worth
+a
+great
+deal
+Ques
+Do
+you
+know
+you
+are
+in
+America
+Sp
+I
+am
+still
+in
+England
+Ques
+Do
+you
+see
+any
+of
+your
+old
+friends
+around
+here
+Dr
+Look
+in
+that
+crowd
+you
+spoke
+of
+can
+you
+find
+some
+one
+you
+know
+Sp
+I
+never
+knew
+that
+Kitchener
+had
+passed
+away
+as
+you
+state
+Dr
+He
+was
+drowned
+when
+a
+war
+vessel
+was
+torpedoed
+on
+the
+Scottish
+Coast
+Do
+you
+know
+him
+Sp
+Yes
+He
+is
+here
+and
+he
+says
+that
+I
+must
+try
+to
+understand
+my
+situation
+Dr
+That
+is
+why
+you
+were
+brought
+here
+Sp
+Pointing
+to
+further
+end
+of
+hall
+Why
+there
+s
+an
+old
+gentleman
+spirit
+lecturing
+that
+I
+heard
+many
+years
+ago
+Just
+fancy
+I
+never
+thought
+I
+would
+hear
+him
+again
+He
+is
+talking
+to
+a
+great
+many
+people
+Spirits
+It
+seems
+we
+have
+many
+here
+who
+just
+came
+to
+investigate
+what
+kind
+of
+a
+meeting
+this
+is
+and
+what
+is
+going
+on
+They
+all
+seem
+to
+be
+trying
+very
+hard
+to
+find
+out
+what
+they
+really
+are
+He
+is
+now
+standing
+on
+that
+platform
+He
+is
+lecturing
+just
+as
+he
+used
+to
+in
+England
+some
+years
+ago
+I
+went
+to
+hear
+him
+but
+he
+talked
+Spiritualism
+I
+did
+not
+really
+know
+what
+he
+meant
+He
+spoke
+well
+He
+said
+his
+name
+is
+Dr
+Peebles
+Famous
+lecturer
+on
+Spiritualism
+He
+said
+to
+me
+You
+go
+in
+there
+so
+I
+came
+He
+says
+I
+want
+you
+to
+get
+understanding
+and
+I
+do
+not
+no
+no
+what
+does
+he
+mean
+He
+says
+he
+does
+not
+want
+me
+to
+stay
+in
+the
+earth
+sphere
+but
+to
+lift
+my
+soul
+up
+to
+God
+and
+understand
+the
+real
+spiritual
+meaning
+of
+Him
+He
+has
+a
+big
+crowd
+around
+him
+some
+he
+is
+trying
+to
+lift
+up
+to
+higher
+things
+others
+he
+is
+trying
+to
+wake
+up
+so
+he
+tells
+me
+They
+are
+not
+sleeping
+are
+they
+Dr
+Yes
+mentally
+The
+Bible
+says
+Blessed
+is
+he
+that
+hath
+part
+in
+the
+first
+resurrection
+on
+such
+the
+second
+death
+has
+no
+power
+Sp
+What
+does
+that
+mean
+Dr
+It
+means
+that
+for
+those
+who
+have
+a
+spiritual
+understanding
+while
+in
+the
+body
+there
+is
+no
+death
+Sp
+Of
+course
+there
+is
+Dr
+No
+one
+ever
+dies
+The
+spirit
+or
+mind
+is
+not
+the
+body
+Sp
+It
+is
+not
+Dr
+You
+are
+dead
+to
+the
+world
+and
+your
+own
+relatives
+and
+evidently
+have
+been
+so
+for
+many
+years
+but
+we
+know
+that
+you
+yourself
+are
+not
+really
+dead
+Sp
+I
+have
+been
+walking
+about
+a
+great
+deal
+and
+I
+have
+traveled
+extensively
+but
+I
+have
+felt
+very
+strange
+Whenever
+I
+wanted
+to
+go
+anywhere
+all
+I
+had
+to
+do
+was
+to
+think
+and
+it
+seemed
+that
+I
+did
+not
+need
+a
+train
+or
+anything
+but
+I
+was
+there
+At
+times
+I
+felt
+I
+must
+be
+in
+America
+because
+I
+always
+heard
+they
+run
+their
+trains
+much
+faster
+than
+in
+England
+Dr
+You
+are
+in
+Los
+Angeles
+California
+Sp
+California
+How
+did
+I
+get
+here
+The
+old
+gentleman
+is
+talking
+to
+a
+big
+crowd
+He
+says
+he
+has
+to
+bring
+them
+here
+to
+get
+them
+to
+understand
+and
+to
+have
+them
+open
+their
+spiritual
+eyes
+to
+see
+Dr
+You
+are
+having
+yours
+opened
+now
+Sp
+Why
+should
+I
+come
+here
+and
+speak
+Why
+do
+the
+rest
+not
+speak
+The
+lecturer
+says
+he
+could
+take
+me
+quicker
+than
+any
+of
+the
+others
+Still
+I
+do
+not
+look
+different
+than
+they
+He
+says
+he
+could
+take
+me
+more
+quickly
+to
+control
+a
+psychic
+Dr
+He
+is
+right
+Sp
+What
+does
+he
+mean
+by
+that
+He
+said
+it
+was
+necessary
+to
+bring
+this
+crowd
+here
+He
+met
+most
+of
+them
+in
+England
+when
+he
+was
+lecturing
+there
+many
+years
+ago
+He
+says
+some
+will
+listen
+to
+his
+lecture
+but
+many
+he
+cannot
+reach
+nor
+even
+waken
+so
+he
+brought
+them
+here
+He
+says
+he
+did
+not
+bring
+me
+here
+to
+waken
+me
+but
+I
+had
+come
+with
+others
+in
+that
+room
+over
+there
+There
+are
+so
+many
+there
+Some
+are
+crippled
+and
+some
+cannot
+speak
+at
+all
+It
+seems
+as
+if
+he
+speaks
+and
+lifts
+them
+up
+and
+then
+they
+waken
+He
+has
+a
+wonderful
+power
+for
+healing
+Dr
+They
+are
+lifted
+up
+by
+his
+thought
+He
+makes
+them
+understand
+that
+their
+crippled
+bodies
+are
+in
+the
+grave
+Sp
+Now
+he
+says
+that
+I
+must
+thank
+you
+for
+the
+privilege
+of
+meeting
+you
+and
+of
+talking
+with
+you
+I
+do
+not
+see
+why
+I
+should
+do
+that
+He
+says
+also
+that
+I
+shall
+have
+to
+put
+all
+my
+pride
+aside
+Yes
+but
+the
+rest
+are
+the
+same
+as
+I
+Dr
+You
+might
+see
+Queen
+Victoria
+or
+King
+Edward
+in
+the
+crowd
+and
+I
+am
+told
+that
+you
+will
+find
+them
+very
+common
+now
+Sp
+Of
+Queen
+Victoria
+they
+always
+said
+she
+talked
+to
+spirits
+and
+everybody
+thought
+she
+was
+a
+little
+crazy
+on
+the
+subject
+Dr
+She
+was
+open
+minded
+Sp
+She
+had
+spirit
+communications
+very
+often
+Dr
+She
+is
+not
+a
+Queen
+any
+longer
+Sp
+Some
+said
+she
+had
+a
+medium
+with
+her
+a
+great
+deal
+to
+ask
+what
+things
+to
+do
+and
+what
+not
+to
+do
+His
+name
+was
+Brown
+I
+believe
+Dr
+Yes
+John
+Brown
+Sp
+She
+said
+she
+always
+had
+to
+ask
+her
+husband
+about
+things
+Dr
+What
+more
+does
+Dr
+Peebles
+say
+Sp
+He
+says
+I
+had
+better
+say
+Good
+Night
+to
+you
+all
+and
+he
+also
+says
+that
+he
+will
+take
+all
+the
+crowd
+away
+with
+him
+and
+that
+he
+will
+show
+them
+the
+spirit
+world
+and
+try
+to
+help
+them
+That
+is
+his
+work
+Dr
+He
+passed
+out
+about
+Six
+months
+ago
+Now
+he
+is
+active
+on
+the
+other
+side
+Sp
+I
+think
+I
+am
+growing
+weak
+I
+feel
+strange
+Dr
+You
+are
+losing
+control
+This
+body
+is
+not
+yours
+it
+is
+my
+wife
+s
+Sp
+What
+do
+you
+mean
+Dr
+She
+is
+a
+psychic
+through
+whom
+you
+are
+talking
+You
+are
+experiencing
+only
+a
+temporary
+sensation
+Sp
+There
+is
+my
+mother
+Spirit
+I
+have
+not
+seen
+her
+for
+many
+years
+Dr
+How
+does
+she
+look
+See
+Chap
+Page
+Spirit
+Lillian
+R
+Sp
+She
+looks
+very
+young
+Dr
+Ask
+her
+if
+she
+has
+understanding
+Sp
+She
+says
+Yes
+she
+was
+very
+much
+interested
+in
+Dr
+Peebles
+lectures
+and
+also
+she
+used
+to
+go
+and
+listen
+to
+Mrs
+Britten
+Dr
+She
+was
+a
+wonderful
+woman
+She
+is
+now
+showing
+object
+lessons
+in
+spirit
+life
+Sp
+Mother
+says
+she
+used
+to
+go
+and
+hear
+her
+quite
+often
+and
+also
+some
+man
+who
+lectured
+Dr
+Was
+his
+name
+Mr
+Wallis
+Sp
+Yes
+He
+was
+quite
+a
+young
+man
+at
+that
+time
+Dr
+He
+has
+also
+passed
+on
+They
+all
+pass
+along
+to
+the
+better
+land
+Sp
+With
+transfigured
+face
+gazing
+raptly
+upon
+some
+vision
+Look
+at
+that
+open
+door
+It
+is
+so
+beautifully
+engraved
+It
+has
+engraved
+on
+it
+The
+Door
+of
+Life
+Understanding
+of
+Life
+Understanding
+of
+God
+in
+the
+True
+Sense
+The
+door
+is
+opening
+very
+slowly
+and
+we
+look
+in
+What
+a
+beautiful
+Hall
+The
+altar
+in
+the
+front
+is
+so
+beautiful
+so
+beautiful
+On
+the
+altar
+in
+the
+center
+is
+a
+beautiful
+statue
+which
+represents
+Wisdom
+There
+is
+a
+statue
+of
+Truth
+one
+of
+Love
+one
+of
+Understanding
+one
+of
+Honesty
+one
+of
+Life
+and
+one
+of
+Modesty
+Wisdom
+is
+the
+center
+statue
+There
+are
+seven
+statues
+in
+all
+each
+holding
+a
+light
+each
+one
+of
+the
+seven
+colors
+Three
+on
+each
+side
+of
+Wisdom
+each
+with
+a
+light
+all
+blending
+into
+Wisdom
+the
+beautiful
+White
+Light
+Wisdom
+Truth
+Honesty
+Love
+Life
+Understanding
+Modesty
+From
+these
+colors
+come
+the
+seven
+musical
+notes
+Each
+note
+corresponds
+to
+a
+color
+and
+then
+goes
+toward
+the
+center
+and
+lends
+into
+Wisdom
+There
+the
+real
+truth
+of
+life
+and
+an
+understanding
+of
+God
+is
+learned
+Dr
+The
+Bible
+says
+God
+is
+Love
+and
+God
+is
+Spirit
+and
+they
+that
+worship
+Him
+must
+worship
+Him
+in
+spirit
+and
+in
+truth
+Sp
+That
+is
+beautiful
+See
+those
+colors
+blend
+They
+go
+on
+and
+on
+blending
+in
+all
+ways
+into
+all
+forms
+into
+all
+kinds
+of
+shapes
+into
+stars
+and
+flowers
+and
+then
+they
+become
+music
+Now
+they
+form
+into
+leaves
+buds
+and
+flowers
+music
+taking
+form
+and
+color
+The
+music
+itself
+I
+never
+heard
+such
+beautiful
+music
+Is
+that
+Heaven
+Dr
+You
+may
+call
+it
+Heaven
+or
+the
+spirit
+world
+Heaven
+is
+a
+condition
+of
+mind
+The
+Bible
+says
+Ye
+are
+the
+temple
+of
+God
+and
+the
+Spirit
+of
+God
+dwelleth
+in
+you
+God
+is
+Love
+and
+Wisdom
+Sp
+They
+say
+to
+me
+This
+is
+the
+Gateway
+to
+the
+Higher
+Life
+You
+have
+had
+a
+glimpse
+of
+it
+but
+you
+cannot
+be
+there
+Why
+cannot
+I
+go
+there
+Dr
+You
+are
+carrying
+a
+load
+of
+which
+you
+must
+rid
+yourself
+your
+pride
+and
+your
+ignorance
+of
+spiritual
+laws
+Sp
+There
+is
+one
+who
+says
+We
+have
+to
+learn
+our
+lessons
+to
+be
+humble
+to
+be
+charitable
+to
+serve
+Learn
+to
+be
+honest
+and
+sincere
+then
+you
+can
+enter
+that
+beautiful
+hall
+Take
+up
+the
+cross
+and
+follow
+me
+That
+cross
+represents
+the
+crucifying
+of
+self
+selfishness
+jealousy
+envy
+bigotry
+dogma
+creeds
+false
+belief
+and
+pride
+Take
+up
+your
+cross
+and
+follow
+me
+That
+means
+that
+I
+must
+crucify
+self
+learn
+to
+serve
+learn
+the
+lesson
+of
+life
+learn
+to
+love
+others
+better
+than
+myself
+Selfishness
+is
+the
+cause
+of
+all
+trouble
+Crucify
+self
+conceit
+Oh
+I
+have
+much
+of
+it
+I
+have
+much
+to
+crucify
+I
+must
+take
+up
+my
+cross
+and
+learn
+my
+lesson
+down
+there
+Pointing
+downward
+Dr
+Jesus
+said
+Except
+ye
+become
+as
+little
+children
+ye
+shall
+not
+enter
+into
+the
+kingdom
+of
+heaven
+Sp
+With
+meek
+humility
+and
+a
+beautiful
+expression
+of
+resignation
+hands
+uplifted
+Take
+me
+I
+am
+ready
+to
+serve
+and
+also
+to
+seek
+for
+truth
+I
+will
+begin
+here
+and
+now
+to
+do
+the
+will
+of
+Heaven
+Whatever
+is
+the
+will
+of
+God
+find
+me
+there
+doing
+it
+I
+must
+not
+go
+to
+church
+to
+find
+God
+I
+must
+find
+Him
+within
+if
+I
+wish
+the
+opening
+of
+the
+door
+to
+that
+beautiful
+Hall
+of
+Understanding
+Wisdom
+and
+Glory
+Now
+I
+have
+to
+start
+at
+the
+bottom
+at
+the
+very
+bottom
+to
+serve
+Is
+that
+to
+be
+my
+mission
+Is
+it
+Dr
+Yes
+every
+one
+must
+serve
+Sp
+Amongst
+all
+those
+crippled
+and
+blind
+people
+I
+am
+to
+show
+them
+the
+way
+The
+door
+was
+opened
+for
+me
+to
+have
+a
+glimpse
+of
+what
+I
+am
+to
+work
+for
+but
+it
+was
+closed
+again
+and
+I
+I
+have
+to
+serve
+I
+have
+never
+served
+It
+will
+be
+very
+hard
+for
+I
+have
+always
+been
+waited
+on
+I
+have
+never
+had
+to
+dress
+myself
+or
+comb
+my
+hair
+I
+never
+have
+done
+it
+in
+all
+my
+life
+never
+Now
+I
+have
+to
+serve
+and
+comb
+the
+matted
+hair
+of
+those
+cripples
+down
+there
+I
+but
+I
+have
+to
+do
+it
+Dr
+Jesus
+said
+My
+yoke
+is
+easy
+and
+my
+burden
+is
+light
+Sp
+Earnestly
+It
+is
+worth
+it
+to
+gain
+that
+crown
+of
+wisdom
+It
+is
+worth
+all
+I
+must
+go
+through
+with
+to
+enter
+that
+beautiful
+hall
+and
+listen
+to
+the
+wonders
+there
+I
+will
+serve
+yes
+I
+honestly
+will
+I
+will
+do
+that
+and
+more
+for
+all
+God
+help
+me
+in
+my
+great
+struggle
+Yes
+I
+promise
+I
+will
+serve
+and
+do
+all
+within
+my
+power
+I
+must
+go
+Good
+Night
+CHAPTER
+XIII
+Orthodoxy
+THE
+science
+of
+religion
+should
+teach
+an
+intelligent
+realization
+of
+the
+nature
+of
+God
+and
+the
+life
+hereafter
+but
+humanity
+is
+still
+kept
+in
+subjection
+by
+fear
+superstition
+dogmas
+and
+creeds
+and
+has
+not
+yet
+attained
+liberation
+through
+a
+full
+understanding
+of
+what
+becomes
+of
+the
+dead
+Passing
+through
+the
+change
+called
+death
+a
+great
+majority
+remain
+in
+entire
+ignorance
+of
+their
+condition
+and
+are
+bound
+for
+a
+time
+to
+the
+earth
+plane
+by
+their
+false
+doctrines
+These
+cling
+to
+their
+orthodox
+ideas
+often
+influencing
+those
+still
+in
+the
+body
+and
+the
+mental
+derangements
+which
+frequently
+follow
+in
+the
+train
+of
+revivals
+are
+examples
+of
+these
+obsessions
+as
+are
+the
+phenomena
+known
+as
+The
+Gift
+of
+Tongues
+and
+Seizure
+by
+The
+Power
+which
+accompany
+many
+revivals
+Religious
+exhortations
+readily
+lead
+to
+mental
+aberrations
+since
+invisible
+religious
+fanatics
+are
+always
+present
+who
+are
+unconscious
+of
+their
+transition
+and
+having
+found
+no
+higher
+life
+retain
+their
+mortal
+bigotry
+and
+by
+their
+presence
+add
+to
+the
+insane
+fervor
+These
+spirits
+often
+make
+themselves
+audible
+to
+excited
+sensitives
+for
+at
+such
+gatherings
+many
+are
+encouraged
+to
+listen
+to
+the
+still
+small
+voice
+supposedly
+of
+God
+During
+religious
+excitement
+the
+psychic
+faculty
+is
+highly
+sensitized
+giving
+mischievous
+spirits
+as
+well
+as
+fanatical
+spirits
+the
+proper
+opportunity
+to
+impress
+credulous
+persons
+with
+their
+whisperings
+Such
+entities
+for
+their
+own
+deceptive
+purposes
+may
+pretend
+to
+be
+angels
+the
+Holy
+Ghost
+or
+The
+Spirit
+of
+God
+and
+the
+thoughtless
+victims
+elated
+and
+unwilling
+to
+listen
+to
+reason
+heed
+these
+whisperings
+which
+so
+frequently
+lead
+to
+obsession
+and
+possession
+resulting
+in
+madness
+insanity
+and
+other
+psychoses
+The
+most
+difficult
+to
+enlighten
+of
+the
+earthbound
+spirits
+are
+the
+religious
+fanatics
+Dominated
+in
+earth
+life
+by
+one
+narrow
+fixed
+idea
+opposed
+to
+logical
+analysis
+and
+independent
+thinking
+they
+are
+found
+after
+passing
+out
+of
+the
+physical
+in
+a
+state
+of
+self
+hypnosis
+ceaselessly
+repeating
+their
+empty
+religious
+jargon
+Nothing
+exists
+for
+them
+but
+their
+dogmatic
+creed
+they
+are
+adamantly
+set
+in
+their
+self
+assurance
+and
+it
+is
+often
+many
+years
+before
+they
+can
+be
+brought
+to
+a
+semblance
+of
+sanity
+EXPERIENCE
+MARCH
+Spirit
+SARAH
+McDONALD
+Psychic
+MRS
+WicKLAND
+The
+spirit
+who
+assumed
+control
+of
+the
+psychic
+tonight
+was
+vigorously
+singing
+a
+religious
+hymn
+Doctor
+Have
+you
+been
+here
+before
+Spirit
+Let
+s
+sing
+some
+more
+Dr
+We
+are
+going
+to
+talk
+now
+Sp
+I
+think
+we
+d
+better
+sing
+another
+song
+Dr
+If
+we
+did
+you
+might
+become
+too
+enthusiastic
+Sp
+We
+are
+in
+church
+and
+you
+know
+you
+have
+to
+sing
+Sing
+Hallelujah
+Tell
+the
+story
+Dr
+We
+are
+going
+to
+be
+sensible
+Sp
+You
+have
+to
+sing
+You
+have
+to
+do
+that
+That
+belongs
+to
+church
+Let
+us
+pray
+in
+Jesus
+name
+for
+evermore
+Dr
+That
+would
+be
+very
+tiresome
+Sp
+Let
+us
+sing
+and
+pray
+to
+the
+Lord
+Hallelujah
+Jesus
+Christ
+Dr
+Now
+stop
+that
+is
+enough
+What
+is
+your
+name
+Sp
+Let
+s
+sing
+and
+pray
+Dr
+You
+must
+be
+sensible
+or
+leave
+Tell
+us
+who
+you
+are
+and
+where
+you
+came
+from
+Sp
+What
+church
+is
+this
+anyhow
+where
+you
+talk
+in
+this
+way
+Dr
+Be
+sensible
+otherwise
+you
+will
+have
+to
+go
+How
+long
+have
+you
+been
+dead
+You
+know
+something
+happened
+to
+you
+You
+have
+been
+hovering
+around
+the
+earth
+probably
+for
+years
+and
+have
+never
+gotten
+anywhere
+Be
+sensible
+Sp
+I
+am
+sensible
+I
+m
+not
+crazy
+Dr
+You
+are
+religiously
+insane
+Sp
+We
+all
+pray
+to
+God
+and
+the
+Holy
+Ghost
+Loudly
+Hallelujah
+Dr
+We
+do
+not
+need
+that
+shouting
+Sp
+I
+am
+doing
+work
+in
+the
+name
+of
+Jesus
+Christ
+Dr
+We
+have
+heard
+such
+talk
+before
+Sp
+Not
+from
+me
+you
+haven
+t
+I
+am
+working
+for
+the
+Lord
+Jesus
+Christ
+Dr
+This
+is
+not
+the
+place
+for
+such
+talk
+as
+that
+Sp
+Are
+you
+a
+sinner
+Dr
+Listen
+to
+me
+Whoever
+you
+are
+you
+have
+lost
+your
+body
+Sp
+What
+church
+is
+this
+Dr
+It
+is
+no
+church
+Sp
+I
+am
+glad
+of
+that
+because
+I
+thought
+the
+church
+must
+surely
+have
+changed
+Let
+me
+talk
+in
+Jesus
+name
+Dr
+You
+have
+been
+brought
+here
+by
+kind
+spirits
+so
+that
+you
+can
+understand
+your
+condition
+You
+are
+a
+spirit
+and
+probably
+have
+been
+for
+a
+long
+time
+You
+will
+not
+listen
+to
+any
+one
+who
+tries
+to
+enlighten
+you
+Sp
+Go
+ahead
+then
+and
+say
+what
+you
+have
+to
+say
+Then
+I
+can
+talk
+too
+Dr
+Understand
+your
+condition
+You
+are
+temporarily
+controlling
+this
+body
+Some
+friend
+brought
+you
+here
+for
+help
+Do
+you
+realize
+that
+something
+happened
+to
+you
+Sp
+No
+Dr
+You
+would
+if
+you
+were
+honest
+You
+know
+that
+you
+are
+in
+a
+strange
+condition
+You
+are
+not
+honest
+enough
+to
+pay
+any
+attention
+to
+it
+Do
+you
+know
+that
+you
+are
+in
+Los
+Angeles
+California
+Sp
+How
+did
+I
+get
+there
+I
+suppose
+I
+sang
+and
+prayed
+as
+a
+missionary
+A
+missionary
+must
+have
+taken
+me
+away
+Dr
+You
+were
+brought
+here
+because
+you
+are
+an
+ignorant
+spirit
+What
+did
+your
+mother
+call
+you
+Sp
+I
+don
+t
+know
+just
+now
+I
+can
+t
+think
+Dr
+You
+have
+lost
+your
+physical
+body
+Ignorant
+spirits
+often
+lose
+the
+memory
+of
+their
+earth
+lives
+You
+do
+not
+even
+remember
+your
+name
+Sp
+My
+name
+is
+Sarah
+in
+Jesus
+name
+Dr
+Sarah
+what
+Sp
+McDonald
+in
+Jesus
+name
+Dr
+You
+know
+that
+all
+that
+shouting
+is
+useless
+Do
+you
+not
+realize
+that
+you
+have
+been
+dead
+for
+some
+time
+Sp
+Hallelujah
+Dr
+You
+do
+not
+even
+know
+that
+you
+are
+dead
+You
+are
+only
+using
+this
+body
+for
+a
+short
+time
+Do
+you
+hear
+me
+Do
+you
+know
+what
+year
+it
+is
+Sp
+In
+Jesus
+name
+I
+do
+not
+care
+Dr
+Religious
+fanatics
+never
+care
+Sp
+I
+am
+a
+Christian
+woman
+in
+Jesus
+name
+Glory
+to
+God
+Hallelujah
+Dr
+Do
+you
+know
+what
+Jesus
+said
+Sp
+Yes
+He
+said
+God
+forgive
+them
+they
+do
+not
+know
+any
+better
+I
+will
+pray
+for
+you
+Dr
+We
+do
+not
+need
+your
+prayers
+Sp
+Glory
+to
+God
+Dr
+Do
+you
+know
+that
+you
+are
+dead
+Sp
+That
+doesn
+t
+interest
+me
+Dr
+You
+are
+controlling
+the
+body
+of
+a
+mortal
+sensitive
+Sp
+Jesus
+is
+my
+friend
+Glory
+Dr
+We
+carry
+on
+experimental
+work
+to
+learn
+what
+becomes
+of
+the
+dead
+We
+always
+find
+that
+the
+most
+ignorant
+stubborn
+spirits
+are
+the
+religious
+fanatics
+shouting
+and
+singing
+all
+the
+time
+Jesus
+said
+Know
+the
+truth
+and
+the
+truth
+shall
+make
+you
+free
+Sp
+God
+forgive
+them
+they
+don
+t
+know
+better
+I
+will
+pray
+for
+you
+all
+Dr
+You
+need
+not
+trouble
+yourself
+You
+do
+not
+understand
+your
+condition
+at
+all
+What
+you
+say
+is
+nothing
+but
+foolish
+talk
+In
+your
+heart
+you
+know
+you
+are
+a
+pretender
+Sp
+God
+forgive
+Let
+us
+pray
+Dr
+We
+do
+not
+need
+your
+hypocritical
+prayers
+Sp
+I
+never
+was
+in
+such
+a
+place
+before
+I
+never
+saw
+anything
+like
+this
+Crying
+I
+do
+not
+know
+what
+will
+become
+of
+me
+Dr
+Try
+to
+understand
+what
+I
+am
+saying
+to
+you
+Stop
+your
+foolish
+religious
+talk
+You
+say
+Jesus
+and
+Lord
+and
+you
+have
+no
+understanding
+of
+true
+religion
+Sp
+God
+help
+me
+God
+help
+me
+God
+forgive
+Dr
+He
+does
+not
+need
+to
+Listen
+to
+what
+I
+say
+Sp
+Drawling
+What
+more
+do
+you
+want
+Dr
+Why
+speak
+with
+such
+affectation
+Do
+you
+know
+that
+you
+are
+controlling
+a
+body
+that
+does
+not
+belong
+to
+you
+Aren
+t
+you
+ashamed
+of
+yourself
+You
+know
+that
+you
+are
+not
+sincere
+Tell
+us
+how
+long
+you
+have
+been
+dead
+You
+must
+realize
+that
+something
+has
+happened
+to
+you
+Intelligent
+spirits
+have
+brought
+you
+here
+and
+allowed
+you
+to
+control
+my
+wife
+s
+body
+and
+we
+are
+trying
+to
+help
+you
+understand
+your
+condition
+but
+that
+does
+not
+seem
+to
+interest
+you
+Sp
+I
+don
+t
+care
+Trying
+to
+bite
+The
+spirit
+would
+not
+listen
+to
+any
+line
+of
+reasoning
+and
+was
+forced
+to
+leave
+She
+was
+immediately
+followed
+by
+a
+little
+child
+who
+came
+in
+crying
+dismally
+EXPERIENCE
+MARCH
+Spirit
+MARY
+ANN
+McDONALD
+PSYCHIC
+MRS
+WICKLAND
+Doctor
+What
+is
+your
+trouble
+Don
+t
+cry
+We
+are
+going
+to
+help
+you
+Spirit
+Where
+is
+Mamma
+Dr
+Have
+you
+lost
+your
+mother
+We
+can
+help
+you
+find
+her
+Tell
+us
+who
+you
+are
+What
+is
+your
+name
+Sp
+Mary
+Ann
+McDonald
+Coughing
+choking
+and
+crying
+Dr
+You
+must
+not
+do
+that
+Why
+do
+you
+cry
+Sp
+What
+s
+the
+matter
+with
+my
+Mamma
+Dr
+Have
+you
+lost
+her
+Sp
+She
+s
+gone
+I
+don
+t
+know
+where
+she
+is
+now
+Dr
+We
+can
+help
+you
+What
+was
+your
+mother
+s
+name
+Sp
+Sarah
+McDonald
+Will
+you
+bring
+Mamma
+to
+me
+Dr
+We
+are
+going
+to
+help
+you
+Where
+was
+your
+home
+Sp
+I
+don
+t
+know
+I
+can
+t
+remember
+All
+my
+Mamma
+does
+is
+to
+pray
+and
+sing
+and
+she
+says
+if
+I
+do
+not
+do
+the
+same
+I
+will
+go
+straight
+to
+the
+devil
+Dr
+You
+will
+not
+go
+to
+the
+devil
+Sp
+I
+cannot
+pray
+and
+sing
+in
+my
+heart
+like
+they
+do
+Dr
+You
+do
+not
+have
+to
+pray
+and
+sing
+There
+is
+no
+religion
+in
+that
+We
+can
+help
+you
+our
+work
+is
+the
+helping
+of
+unfortunate
+spirits
+Sp
+I
+don
+t
+know
+what
+to
+do
+Dr
+You
+have
+lost
+your
+body
+just
+as
+your
+mother
+has
+lost
+hers
+We
+could
+not
+see
+your
+mother
+and
+we
+cannot
+see
+you
+You
+are
+using
+the
+body
+of
+another
+for
+a
+time
+Your
+mother
+was
+here
+and
+controlled
+this
+body
+before
+you
+came
+Sp
+Have
+I
+lost
+her
+Dr
+She
+is
+being
+taken
+care
+of
+She
+has
+been
+taken
+to
+a
+spirit
+hospital
+She
+is
+insane
+on
+religion
+and
+would
+not
+listen
+to
+what
+I
+said
+Sp
+She
+says
+if
+she
+does
+not
+pray
+and
+sing
+all
+the
+time
+God
+will
+not
+forgive
+her
+Dr
+There
+is
+no
+religion
+in
+that
+only
+insanity
+That
+is
+not
+what
+Jesus
+taught
+Sp
+Do
+you
+see
+that
+big
+fire
+Dr
+No
+we
+cannot
+see
+it
+Where
+is
+it
+Sp
+The
+whole
+house
+burned
+all
+up
+My
+mother
+was
+praying
+and
+singing
+I
+didn
+t
+know
+what
+was
+the
+matter
+I
+was
+sleeping
+and
+did
+not
+know
+anything
+about
+the
+house
+burning
+up
+Dr
+Don
+t
+worry
+about
+that
+Sp
+When
+I
+woke
+up
+I
+was
+all
+choked
+I
+couldn
+t
+breathe
+Dr
+That
+is
+all
+past
+now
+What
+town
+did
+you
+live
+in
+Sp
+I
+don
+t
+know
+Just
+wait
+a
+minute
+while
+I
+try
+to
+think
+I
+was
+so
+scared
+that
+my
+mind
+can
+t
+remember
+We
+prayed
+and
+sang
+all
+the
+time
+and
+I
+am
+so
+sick
+and
+tired
+of
+it
+that
+I
+don
+t
+know
+what
+to
+do
+We
+did
+not
+get
+anywhere
+We
+just
+prayed
+the
+same
+thing
+over
+and
+over
+again
+I
+do
+not
+know
+what
+will
+become
+of
+me
+because
+I
+cannot
+feel
+like
+my
+mother
+does
+at
+all
+Dr
+Our
+work
+is
+to
+help
+spirits
+who
+are
+in
+trouble
+and
+you
+will
+find
+happiness
+when
+you
+leave
+here
+Sp
+I
+will
+tell
+you
+The
+minister
+at
+the
+church
+we
+go
+to
+he
+says
+If
+you
+do
+not
+do
+so
+and
+so
+and
+pray
+every
+night
+and
+sacrifice
+everything
+you
+will
+go
+to
+hell
+He
+says
+we
+must
+not
+eat
+but
+must
+lay
+on
+the
+floor
+and
+torture
+our
+bodies
+for
+Christ
+s
+sake
+Dr
+That
+minister
+is
+insane
+Sp
+He
+said
+we
+must
+not
+eat
+anything
+except
+dry
+bread
+with
+water
+He
+said
+I
+had
+been
+a
+sinner
+and
+I
+must
+give
+all
+the
+money
+I
+make
+to
+the
+Lord
+and
+I
+must
+be
+His
+slave
+I
+asked
+him
+if
+the
+Lord
+was
+so
+poor
+that
+He
+needed
+all
+my
+money
+and
+he
+said
+that
+question
+was
+from
+the
+devil
+I
+worked
+very
+hard
+and
+Mamma
+took
+all
+my
+money
+away
+from
+me
+for
+the
+church
+I
+went
+out
+sewing
+in
+a
+shop
+but
+my
+Mamma
+took
+me
+to
+church
+every
+night
+All
+I
+got
+was
+a
+hard
+crust
+of
+bread
+and
+some
+water
+in
+Jesus
+name
+Dr
+How
+old
+are
+you
+Sp
+About
+sixteen
+or
+seventeen
+Dr
+What
+kind
+of
+a
+shop
+did
+you
+work
+in
+Sp
+I
+sewed
+overalls
+Dr
+In
+Chicago
+Sp
+No
+but
+we
+were
+in
+a
+big
+town
+I
+can
+t
+remember
+That
+minister
+preached
+and
+preached
+Dr
+That
+is
+all
+over
+now
+Sp
+Sometimes
+I
+asked
+Mamma
+why
+we
+had
+to
+sing
+and
+pray
+all
+the
+time
+It
+came
+to
+my
+heart
+that
+God
+is
+Love
+and
+we
+are
+His
+children
+so
+why
+does
+He
+let
+us
+work
+so
+hard
+and
+sacrifice
+our
+bodies
+so
+that
+we
+hardly
+have
+any
+strength
+then
+give
+all
+our
+money
+to
+Him
+Is
+He
+so
+poor
+Dr
+The
+Lord
+has
+nothing
+to
+do
+with
+any
+of
+that
+Only
+ignorant
+insane
+persons
+say
+such
+things
+Sp
+He
+is
+a
+minister
+Dr
+What
+church
+did
+you
+belong
+to
+Sp
+The
+minister
+said
+if
+we
+did
+not
+do
+as
+he
+told
+us
+to
+we
+would
+go
+to
+hell
+He
+talks
+and
+talks
+and
+we
+have
+to
+listen
+to
+him
+I
+don
+t
+know
+why
+but
+I
+haven
+t
+sewed
+since
+I
+was
+in
+that
+fire
+It
+seems
+like
+a
+fire
+and
+an
+earthquake
+I
+felt
+so
+bad
+because
+I
+choked
+and
+coughed
+My
+Mamma
+and
+I
+have
+not
+had
+any
+house
+to
+sleep
+in
+The
+minister
+told
+us
+we
+could
+sleep
+most
+anywhere
+but
+if
+we
+worked
+and
+gave
+all
+our
+money
+to
+the
+Lord
+we
+would
+be
+all
+right
+Sometimes
+I
+wanted
+a
+new
+dress
+awful
+bad
+I
+didn
+t
+earn
+so
+very
+much
+money
+but
+if
+I
+could
+have
+kept
+it
+I
+could
+have
+got
+a
+new
+dress
+sometime
+Mamma
+took
+it
+all
+She
+said
+Mary
+Ann
+you
+must
+sacrifice
+for
+the
+Lord
+Sometimes
+I
+said
+I
+may
+go
+to
+hell
+for
+it
+but
+I
+think
+it
+would
+be
+better
+to
+go
+to
+hell
+than
+to
+hear
+about
+the
+Lord
+all
+the
+time
+I
+don
+t
+know
+if
+it
+would
+be
+better
+but
+I
+thought
+it
+would
+be
+Dr
+All
+that
+fanaticism
+is
+wrong
+every
+bit
+of
+it
+God
+is
+Spirit
+and
+God
+is
+Love
+God
+has
+nothing
+to
+do
+with
+such
+fanatical
+talk
+He
+does
+not
+need
+any
+one
+s
+money
+Sp
+Then
+why
+do
+they
+give
+it
+to
+Him
+Dr
+God
+doesn
+t
+get
+it
+the
+ministers
+do
+God
+doesn
+t
+need
+it
+Sp
+Doesn
+t
+God
+need
+our
+money
+Dr
+No
+God
+is
+Spirit
+Spirit
+is
+invisible
+I
+am
+talking
+to
+you
+and
+you
+are
+talking
+to
+me
+but
+you
+are
+invisible
+to
+us
+We
+cannot
+see
+you
+Mind
+is
+invisible
+You
+see
+my
+body
+but
+not
+my
+mind
+God
+is
+invisible
+and
+He
+is
+not
+in
+a
+certain
+place
+as
+we
+are
+He
+is
+the
+Soul
+of
+all
+things
+Sp
+But
+the
+minister
+says
+He
+sits
+on
+a
+throne
+with
+Jesus
+on
+His
+right
+hand
+Why
+did
+he
+tell
+us
+that
+if
+it
+is
+not
+true
+Dr
+Because
+the
+truth
+is
+not
+in
+him
+He
+is
+not
+honest
+Sp
+But
+Jesus
+died
+for
+our
+sins
+Dr
+No
+he
+did
+not
+Sp
+He
+said
+Take
+up
+my
+cross
+and
+follow
+me
+and
+go
+to
+church
+every
+day
+Dr
+Jesus
+never
+mentioned
+going
+to
+church
+His
+teachings
+were
+about
+the
+higher
+life
+Sp
+Heaven
+Dr
+Not
+as
+you
+understand
+it
+Heaven
+is
+a
+happy
+mental
+condition
+If
+you
+could
+have
+had
+a
+new
+dress
+as
+you
+wished
+you
+would
+have
+been
+happy
+wouldn
+t
+you
+Sp
+Yes
+I
+should
+like
+to
+have
+a
+new
+dress
+I
+don
+t
+care
+so
+very
+much
+for
+fancy
+things
+Once
+in
+a
+while
+I
+wanted
+a
+nice
+new
+dress
+and
+not
+what
+the
+minister
+told
+us
+we
+should
+have
+But
+we
+had
+to
+give
+our
+money
+to
+the
+Lord
+Dr
+No
+you
+didn
+t
+You
+gave
+it
+to
+the
+minister
+Sp
+He
+gave
+us
+some
+old
+dresses
+that
+had
+been
+given
+to
+the
+church
+and
+my
+Mamma
+said
+we
+must
+sacrifice
+When
+I
+kicked
+Mamma
+said
+You
+will
+go
+to
+hell
+if
+you
+don
+t
+do
+what
+the
+Lord
+says
+you
+should
+do
+Dr
+There
+is
+no
+such
+place
+as
+hell
+Sp
+No
+hell
+Dr
+Of
+course
+not
+Sp
+Isn
+t
+hell
+a
+burning
+fire
+I
+have
+seen
+it
+burning
+and
+I
+see
+it
+yet
+Dr
+Possibly
+your
+mother
+in
+her
+religious
+insanity
+set
+fire
+to
+the
+house
+Sp
+No
+I
+don
+t
+think
+so
+It
+seems
+like
+there
+was
+an
+earthquake
+and
+then
+after
+that
+there
+was
+the
+fire
+Dr
+Who
+is
+President
+Sp
+I
+don
+t
+know
+I
+ll
+tell
+you
+I
+didn
+t
+have
+so
+very
+much
+school
+I
+went
+to
+work
+when
+I
+was
+nine
+years
+old
+Dr
+Did
+you
+have
+a
+father
+Sp
+I
+did
+not
+know
+my
+father
+Dr
+Your
+schooling
+does
+not
+make
+any
+difference
+You
+have
+lost
+your
+physical
+body
+and
+are
+now
+a
+spirit
+Sp
+I
+lost
+my
+physical
+body
+But
+I
+have
+a
+body
+Dr
+This
+is
+not
+your
+body
+it
+belongs
+to
+my
+wife
+Sp
+Where
+did
+I
+get
+these
+clothes
+from
+Dr
+They
+belong
+to
+my
+wife
+Sp
+But
+I
+should
+like
+to
+have
+my
+own
+clothes
+Dr
+You
+will
+have
+your
+own
+soon
+Sp
+I
+do
+not
+like
+to
+take
+them
+from
+your
+wife
+I
+am
+sorry
+but
+I
+must
+not
+wear
+them
+Dr
+Look
+at
+your
+shoes
+Sp
+I
+must
+be
+in
+Heaven
+Dr
+You
+feel
+better
+do
+you
+not
+than
+when
+you
+were
+praying
+all
+the
+time
+Sp
+I
+feel
+strong
+Did
+I
+get
+something
+to
+eat
+because
+I
+feel
+so
+strong
+Dr
+You
+are
+controlling
+a
+healthy
+body
+This
+is
+my
+wife
+s
+body
+Sp
+I
+don
+t
+like
+to
+have
+your
+wife
+s
+body
+Dr
+You
+will
+only
+stay
+here
+for
+a
+short
+time
+Sp
+Then
+where
+will
+I
+go
+I
+won
+t
+have
+to
+go
+back
+to
+that
+minister
+and
+hear
+all
+those
+crazy
+people
+sing
+all
+the
+time
+will
+I
+When
+the
+minister
+talked
+about
+hell
+and
+damnation
+I
+saw
+a
+big
+fire
+and
+I
+saw
+the
+devil
+with
+his
+pitchfork
+and
+he
+pushed
+people
+in
+Dr
+When
+that
+minister
+was
+preaching
+he
+was
+thinking
+of
+hell
+fire
+and
+made
+a
+picture
+which
+the
+rest
+of
+you
+saw
+and
+it
+appeared
+like
+a
+reality
+But
+it
+was
+only
+a
+phantasm
+which
+he
+created
+Sp
+He
+scared
+us
+with
+it
+Dr
+As
+he
+talked
+it
+would
+appear
+to
+you
+as
+a
+reality
+Sp
+But
+it
+looked
+like
+real
+I
+suppose
+they
+have
+those
+things
+in
+hell
+but
+I
+want
+to
+go
+to
+Heaven
+Dr
+Your
+mother
+and
+the
+minister
+are
+spirits
+but
+ignorant
+of
+the
+fact
+Sp
+Do
+you
+mean
+all
+those
+people
+are
+spirits
+There
+must
+be
+a
+thousand
+all
+singing
+and
+praying
+all
+the
+time
+Sometimes
+we
+got
+just
+bread
+and
+water
+and
+we
+lay
+down
+on
+boards
+We
+must
+be
+there
+all
+the
+time
+otherwise
+the
+minister
+is
+not
+pleased
+with
+us
+and
+he
+says
+if
+we
+do
+not
+get
+down
+on
+our
+knees
+we
+go
+into
+the
+fire
+Dr
+That
+is
+all
+nonsense
+All
+those
+people
+have
+lost
+their
+physical
+bodies
+and
+are
+in
+the
+outer
+darkness
+that
+the
+Bible
+speaks
+about
+They
+are
+in
+blind
+religious
+ignorance
+They
+will
+remain
+in
+that
+condition
+for
+a
+very
+long
+time
+if
+they
+do
+not
+change
+their
+way
+of
+thinking
+They
+are
+filled
+with
+religious
+fanaticism
+Your
+mother
+was
+brought
+here
+for
+understanding
+and
+controlled
+this
+same
+body
+Sp
+Someone
+pushed
+her
+in
+and
+then
+I
+could
+not
+talk
+to
+her
+any
+more
+The
+whole
+crowd
+down
+there
+will
+not
+listen
+to
+any
+body
+they
+just
+sing
+and
+pray
+Dr
+They
+can
+stay
+there
+for
+years
+and
+years
+and
+their
+Lord
+will
+not
+care
+anything
+about
+them
+Sp
+There
+that
+hell
+is
+not
+there
+any
+more
+Dr
+The
+minister
+thinks
+of
+hell
+and
+devils
+and
+creates
+phantasms
+which
+seem
+real
+to
+ignorant
+spirits
+Sp
+Will
+you
+help
+my
+mother
+Dr
+Intelligent
+spirits
+will
+take
+care
+of
+her
+It
+was
+they
+who
+pushed
+her
+in
+here
+to
+bring
+her
+to
+an
+understanding
+The
+difference
+between
+you
+and
+your
+mother
+is
+that
+you
+will
+listen
+and
+she
+would
+not
+Sp
+Then
+you
+do
+not
+think
+God
+would
+be
+angry
+with
+me
+I
+Dr
+Of
+course
+not
+Sp
+Sure
+Dr
+God
+knows
+everything
+He
+is
+All
+in
+All
+He
+is
+the
+Creator
+and
+Creation
+both
+Sp
+Don
+t
+we
+fall
+in
+sin
+Dr
+No
+never
+If
+you
+say
+we
+fall
+in
+sin
+you
+say
+God
+made
+a
+mistake
+when
+He
+created
+us
+He
+is
+All
+Wise
+All
+Powerful
+and
+everywhere
+present
+When
+such
+a
+God
+as
+that
+created
+the
+world
+and
+mankind
+He
+did
+not
+make
+a
+mistake
+allowing
+man
+to
+fall
+in
+sin
+Otherwise
+He
+would
+not
+be
+All
+Wise
+Sp
+Why
+do
+they
+say
+that
+then
+Dr
+People
+worship
+creed
+The
+truth
+is
+given
+allegorically
+in
+the
+Bible
+Sp
+Didn
+t
+Jesus
+die
+for
+our
+sins
+Dr
+Of
+course
+he
+did
+not
+Sp
+The
+minister
+said
+there
+is
+power
+in
+the
+blood
+Dr
+No
+there
+is
+not
+Some
+of
+those
+people
+you
+speak
+of
+have
+probably
+been
+dead
+a
+long
+time
+We
+cannot
+see
+them
+Sp
+Can
+t
+you
+see
+all
+those
+people
+over
+there
+Pointing
+Dr
+No
+they
+are
+spirits
+and
+have
+lost
+their
+bodies
+long
+ago
+They
+are
+blind
+to
+the
+higher
+life
+You
+are
+not
+satisfied
+to
+be
+with
+them
+and
+you
+ask
+questions
+therefore
+we
+can
+help
+you
+to
+an
+understanding
+We
+must
+add
+understanding
+to
+our
+faith
+You
+lost
+your
+own
+body
+perhaps
+many
+years
+ago
+Sp
+Everything
+was
+all
+mixed
+up
+I
+got
+hurt
+in
+the
+head
+Dr
+Don
+t
+you
+remember
+any
+of
+the
+streets
+in
+your
+city
+SP
+No
+I
+can
+t
+remember
+It
+seems
+like
+I
+was
+in
+San
+Francisco
+Ques
+By
+a
+former
+resident
+of
+San
+Francisco
+Did
+you
+go
+across
+the
+Bay
+to
+Oakland
+Sp
+Yes
+and
+we
+went
+to
+Oakland
+to
+the
+prayer
+meeting
+Ques
+Did
+you
+work
+at
+Strauss
+Brothers
+Overall
+Factory
+Was
+it
+on
+Mission
+Street
+Sp
+Mission
+Street
+I
+remember
+now
+We
+lived
+on
+Mission
+Street
+Ques
+Near
+Daly
+toward
+Golden
+Gate
+Park
+Sp
+No
+it
+was
+near
+the
+depot
+Ques
+Toward
+the
+Ferry
+Sp
+Near
+the
+Southern
+Pacific
+Station
+They
+had
+a
+Mission
+House
+on
+Mission
+Street
+Ques
+Was
+that
+toward
+the
+Bay
+Sp
+I
+don
+t
+know
+We
+lived
+in
+a
+little
+house
+we
+rented
+My
+mother
+went
+to
+the
+factory
+too
+but
+she
+got
+sick
+because
+she
+sang
+and
+prayed
+all
+the
+time
+I
+had
+to
+do
+her
+work
+too
+We
+did
+not
+get
+much
+just
+kept
+enough
+so
+we
+could
+live
+The
+minister
+said
+it
+was
+a
+sin
+to
+eat
+meat
+or
+milk
+or
+butter
+or
+eggs
+He
+said
+they
+cost
+too
+much
+and
+that
+we
+must
+sacrifice
+our
+bodies
+Dr
+Was
+your
+father
+dead
+Sp
+I
+think
+he
+died
+when
+I
+was
+a
+little
+girl
+I
+don
+t
+really
+know
+Dr
+Look
+around
+and
+see
+whether
+there
+is
+anyone
+here
+whom
+you
+know
+Other
+spirits
+are
+here
+who
+will
+help
+you
+and
+take
+you
+to
+the
+spirit
+world
+That
+is
+the
+invisible
+world
+around
+the
+physical
+world
+Sp
+I
+see
+such
+a
+pretty
+garden
+Look
+at
+those
+beautiful
+flowers
+just
+look
+at
+them
+I
+never
+saw
+anything
+so
+beautiful
+There
+s
+trees
+and
+flowers
+Hear
+the
+pretty
+birds
+how
+they
+sing
+Look
+at
+that
+beautiful
+lake
+and
+all
+the
+children
+swinging
+on
+the
+shore
+Dr
+That
+is
+the
+spirit
+world
+Sp
+It
+is
+so
+much
+better
+than
+over
+there
+where
+they
+sing
+and
+pray
+Sometimes
+I
+was
+so
+hungry
+that
+nothing
+satisfied
+me
+Isn
+t
+this
+different
+from
+those
+crazy
+singing
+people
+Can
+t
+you
+see
+them
+all
+Couldn
+t
+you
+help
+them
+to
+see
+this
+beautiful
+place
+Dr
+Your
+mother
+was
+here
+controlling
+this
+body
+but
+we
+could
+do
+nothing
+with
+her
+Sp
+Oh
+look
+at
+that
+nice
+little
+house
+over
+there
+It
+has
+two
+rooms
+and
+a
+beautiful
+garden
+full
+of
+flowers
+Dr
+Do
+you
+see
+any
+one
+around
+there
+Sp
+Somebody
+says
+my
+grandmother
+lives
+there
+and
+it
+s
+going
+to
+be
+my
+home
+too
+They
+say
+she
+is
+waiting
+for
+me
+I
+only
+know
+grandmother
+a
+little
+She
+visited
+us
+once
+but
+she
+could
+not
+stay
+because
+Mamma
+was
+carrying
+on
+so
+and
+grandmother
+didn
+t
+believe
+in
+it
+So
+she
+went
+far
+away
+I
+think
+East
+somewhere
+and
+after
+that
+she
+died
+Mamma
+got
+some
+money
+from
+grandma
+I
+don
+t
+know
+just
+how
+much
+but
+I
+think
+she
+said
+a
+little
+more
+than
+a
+thousand
+dollars
+I
+thought
+then
+I
+should
+get
+a
+new
+dress
+but
+the
+Lord
+got
+it
+all
+The
+minister
+said
+the
+next
+Sunday
+that
+she
+would
+go
+up
+into
+the
+Seventh
+Heaven
+because
+she
+gave
+the
+Lord
+all
+that
+money
+She
+would
+not
+eat
+one
+thing
+all
+that
+day
+I
+thought
+sure
+I
+would
+get
+a
+new
+dress
+but
+I
+didn
+t
+Can
+you
+hear
+that
+beautiful
+music
+Listen
+Dr
+We
+cannot
+hear
+it
+Sp
+I
+never
+heard
+anything
+so
+fine
+All
+the
+flowers
+bow
+to
+the
+music
+and
+when
+they
+hear
+it
+they
+look
+happy
+The
+music
+seems
+like
+colors
+and
+it
+seems
+to
+go
+with
+the
+flowers
+When
+the
+music
+changes
+the
+flowers
+have
+a
+different
+color
+Dr
+You
+will
+find
+many
+beautiful
+things
+when
+you
+leave
+here
+Sp
+There
+is
+a
+gentleman
+standing
+there
+and
+he
+looks
+at
+me
+and
+says
+Come
+little
+child
+We
+are
+many
+because
+each
+mother
+had
+her
+children
+that
+she
+took
+to
+church
+with
+her
+One
+time
+I
+ll
+tell
+you
+There
+was
+I
+and
+Bertha
+and
+Clara
+and
+Joe
+Joe
+s
+a
+boy
+we
+all
+went
+into
+a
+corner
+and
+we
+just
+sat
+there
+and
+talked
+The
+minister
+saw
+us
+and
+you
+don
+t
+know
+how
+mad
+he
+was
+He
+said
+he
+would
+have
+to
+punish
+us
+all
+and
+he
+did
+He
+said
+The
+Lord
+will
+punish
+you
+all
+but
+the
+minister
+did
+it
+and
+his
+hand
+was
+awful
+hard
+My
+grandmother
+is
+here
+and
+she
+says
+Mary
+Ann
+you
+can
+come
+with
+me
+and
+we
+will
+try
+all
+we
+can
+to
+help
+your
+mother
+This
+gentleman
+who
+stands
+there
+says
+he
+is
+my
+father
+Grandma
+was
+my
+father
+s
+mother
+Grandma
+says
+he
+died
+East
+Mother
+joined
+the
+Salvation
+Army
+but
+the
+Mission
+Friends
+got
+hold
+of
+her
+We
+came
+from
+Kansas
+when
+I
+was
+a
+little
+girl
+The
+money
+my
+grandma
+sent
+was
+to
+be
+given
+to
+me
+but
+my
+mother
+said
+we
+would
+put
+it
+in
+the
+Lord
+s
+keeping
+So
+the
+Lord
+kept
+it
+and
+I
+didn
+t
+get
+any
+new
+dress
+Dr
+The
+Lord
+did
+not
+get
+that
+money
+either
+Sp
+Whether
+he
+got
+it
+or
+not
+makes
+no
+difference
+now
+I
+will
+get
+my
+new
+dress
+I
+have
+one
+but
+that
+is
+not
+mine
+because
+you
+say
+this
+is
+not
+my
+body
+I
+will
+have
+a
+new
+dress
+but
+I
+don
+t
+want
+sackcloth
+I
+must
+not
+say
+that
+it
+isn
+t
+nice
+Dr
+Now
+you
+are
+going
+to
+serve
+others
+and
+be
+where
+there
+are
+trees
+and
+flowers
+and
+beautiful
+music
+Sp
+This
+gentleman
+comes
+he
+says
+he
+is
+my
+father
+but
+I
+don
+t
+remember
+him
+He
+says
+he
+will
+help
+me
+You
+know
+my
+father
+died
+or
+passed
+out
+Sometimes
+people
+say
+that
+Dr
+Passed
+out
+is
+right
+There
+is
+no
+actual
+death
+nobody
+ever
+dies
+Your
+father
+only
+lost
+his
+body
+Sp
+Isn
+t
+that
+dead
+Dr
+His
+mind
+or
+spirit
+being
+invisible
+while
+in
+the
+body
+is
+still
+invisible
+to
+mortals
+when
+he
+steps
+out
+of
+his
+body
+His
+body
+is
+only
+the
+house
+where
+his
+spirit
+lives
+and
+when
+the
+spirit
+leaves
+the
+body
+the
+body
+is
+placed
+in
+the
+grave
+But
+the
+spirit
+is
+not
+dead
+Sp
+Sometimes
+I
+prayed
+for
+my
+father
+because
+mother
+said
+he
+went
+to
+hell
+Father
+says
+there
+is
+no
+such
+place
+He
+looks
+awful
+nice
+and
+he
+s
+all
+dressed
+up
+I
+wish
+my
+mother
+would
+understand
+Dr
+Don
+t
+worry
+about
+your
+mother
+After
+spirits
+like
+she
+control
+this
+body
+they
+are
+placed
+in
+a
+spirit
+hospital
+Sp
+Can
+you
+talk
+to
+the
+Lord
+too
+I
+wish
+you
+would
+talk
+to
+Him
+because
+He
+takes
+too
+much
+money
+from
+the
+poor
+Dr
+The
+Lord
+does
+not
+do
+that
+it
+is
+the
+minister
+SP
+Why
+here
+comes
+a
+little
+Indian
+girl
+Spirit
+Dr
+Isn
+t
+she
+nice
+She
+will
+show
+you
+beautiful
+things
+Sp
+Can
+I
+go
+with
+her
+What
+is
+her
+name
+Dr
+Silver
+Star
+Sp
+Is
+that
+her
+name
+Will
+you
+play
+with
+me
+little
+girl
+and
+can
+I
+play
+with
+you
+She
+says
+yes
+and
+that
+she
+will
+takeme
+to
+her
+home
+and
+show
+me
+pretty
+things
+Won
+t
+I
+be
+happy
+I
+will
+have
+a
+new
+dress
+not
+this
+sackcloth
+but
+probably
+the
+Lord
+would
+not
+like
+that
+Dr
+Forget
+all
+about
+that
+Go
+with
+the
+intelligent
+spirits
+and
+they
+will
+help
+you
+and
+teach
+you
+Sp
+Silver
+Star
+says
+I
+should
+come
+with
+her
+and
+she
+will
+take
+me
+to
+my
+grandmother
+and
+my
+father
+and
+my
+brother
+Surprised
+Oh
+my
+brother
+I
+forgot
+all
+about
+Lawrence
+He
+was
+so
+little
+when
+he
+died
+Dr
+How
+old
+was
+he
+Sp
+I
+don
+t
+know
+He
+was
+only
+a
+little
+baby
+I
+don
+t
+know
+much
+because
+I
+couldn
+t
+go
+to
+school
+when
+I
+wanted
+to
+I
+had
+to
+work
+for
+the
+Lord
+Dr
+After
+you
+leave
+here
+you
+will
+learn
+many
+things
+Sp
+But
+my
+mother
+said
+the
+Lord
+did
+not
+want
+us
+to
+learn
+because
+we
+must
+sacrifice
+everything
+If
+you
+read
+and
+write
+you
+get
+away
+from
+the
+Lord
+Dr
+Just
+remember
+I
+said
+that
+was
+all
+wrong
+teaching
+Sp
+I
+will
+find
+it
+out
+and
+I
+will
+find
+out
+if
+the
+Lord
+gets
+all
+the
+money
+If
+that
+minister
+took
+all
+that
+money
+I
+will
+tell
+him
+he
+is
+not
+nice
+Dr
+You
+will
+find
+that
+belief
+about
+the
+Lord
+is
+not
+true
+Sp
+And
+I
+thought
+it
+was
+gospel
+truth
+They
+would
+not
+let
+me
+go
+to
+school
+I
+saw
+lots
+of
+children
+learn
+but
+I
+could
+not
+They
+said
+I
+would
+not
+go
+to
+Heaven
+if
+I
+learned
+I
+cried
+when
+I
+could
+not
+have
+a
+new
+dress
+and
+the
+minister
+told
+me
+I
+would
+go
+to
+hell
+Dr
+Now
+you
+will
+learn
+the
+truth
+You
+have
+been
+dead
+probably
+many
+years
+Have
+you
+seen
+Heaven
+Why
+are
+you
+not
+there
+Sp
+That
+s
+true
+Dr
+The
+Bible
+mentions
+the
+outer
+darkness
+you
+were
+in
+darkness
+but
+it
+was
+all
+of
+your
+own
+making
+Sp
+How
+can
+they
+sing
+and
+pray
+all
+the
+time
+when
+they
+are
+dead
+These
+people
+have
+churches
+Once
+in
+a
+while
+they
+go
+to
+other
+churches
+on
+earth
+when
+God
+wants
+them
+in
+some
+other
+church
+Sometimes
+before
+the
+minister
+mortal
+knows
+it
+the
+people
+in
+the
+church
+do
+something
+like
+that
+swaying
+motion
+of
+the
+body
+and
+every
+one
+gets
+up
+and
+jumps
+and
+sings
+The
+mortals
+having
+opened
+themselves
+through
+wild
+emotionalism
+to
+spirit
+obsession
+Their
+minister
+says
+that
+is
+the
+influence
+of
+the
+Holy
+Ghost
+Some
+of
+our
+crowd
+get
+into
+that
+other
+crowd
+and
+make
+them
+all
+jump
+Dr
+Spirits
+such
+as
+you
+speak
+of
+often
+go
+to
+churches
+on
+the
+physical
+side
+and
+unbalance
+the
+people
+making
+them
+demented
+Then
+the
+people
+say
+they
+are
+controlled
+by
+the
+Holy
+Ghost
+Sp
+Silver
+Star
+says
+she
+will
+take
+me
+along
+and
+that
+I
+will
+have
+a
+new
+dress
+Maybe
+it
+is
+not
+right
+but
+it
+feels
+good
+to
+know
+I
+will
+have
+one
+Silver
+Star
+says
+that
+I
+must
+thank
+all
+of
+you
+for
+being
+patient
+with
+me
+Some
+day
+I
+will
+come
+and
+tell
+you
+how
+I
+like
+things
+and
+then
+probably
+I
+can
+remember
+more
+If
+you
+do
+not
+come
+there
+then
+I
+will
+come
+to
+see
+you
+Mary
+Ann
+McDonald
+is
+my
+name
+I
+will
+see
+you
+some
+time
+I
+feel
+like
+saying
+God
+bless
+you
+but
+I
+suppose
+I
+shouldn
+t
+Dr
+That
+is
+all
+right
+Now
+go
+with
+Silver
+Star
+Sp
+All
+right
+Goodbye
+That
+conscientious
+church
+attendance
+faithful
+meeting
+of
+obligations
+and
+upright
+living
+do
+not
+in
+themselves
+insure
+spiritual
+enlightenment
+hereafter
+has
+often
+been
+evidenced
+EXPERIENCE
+JULY
+Spirit
+HENRY
+WILKINS
+Psychic
+MRS
+WICKLAND
+The
+controlling
+intelligence
+was
+apparently
+crippled
+with
+body
+bent
+over
+knees
+Doctor
+Can
+t
+you
+straighten
+yourself
+Wake
+up
+Spirit
+I
+m
+not
+sleeping
+Dr
+Why
+are
+you
+bent
+over
+Sp
+My
+back
+is
+broken
+Dr
+You
+are
+mistaken
+it
+is
+not
+broken
+Sp
+Oh
+yes
+it
+is
+Dr
+It
+may
+have
+been
+broken
+but
+it
+is
+not
+now
+Sp
+I
+tell
+you
+I
+cannot
+straighten
+up
+my
+back
+is
+broken
+Dr
+We
+can
+change
+that
+condition
+Sp
+Many
+times
+they
+told
+me
+that
+but
+they
+never
+could
+Dr
+But
+we
+are
+going
+to
+do
+it
+for
+you
+this
+time
+Sp
+I
+will
+give
+you
+ten
+dollars
+if
+you
+can
+straighten
+me
+out
+Dr
+Where
+is
+the
+money
+Sp
+When
+I
+can
+stand
+up
+I
+will
+give
+it
+to
+you
+If
+you
+can
+cure
+me
+it
+is
+worth
+all
+of
+ten
+dollars
+Dr
+Just
+think
+I
+can
+walk
+and
+you
+will
+be
+able
+to
+walk
+Sp
+You
+will
+have
+to
+show
+me
+Dr
+Move
+your
+legs
+and
+you
+can
+walk
+Sp
+I
+did
+that
+many
+times
+but
+it
+never
+helped
+Dr
+Nevertheless
+you
+can
+be
+cured
+Sp
+But
+I
+have
+no
+money
+I
+haven
+t
+had
+money
+for
+some
+time
+Every
+time
+I
+see
+money
+I
+grab
+it
+but
+it
+gets
+away
+just
+like
+it
+had
+life
+Dr
+I
+will
+explain
+Do
+you
+know
+that
+you
+are
+a
+spirit
+Do
+you
+know
+you
+are
+dead
+yes
+dead
+to
+the
+world
+Sp
+Then
+I
+don
+t
+know
+it
+and
+I
+haven
+t
+been
+in
+Heaven
+I
+was
+a
+good
+Methodist
+I
+went
+to
+church
+every
+Sunday
+and
+also
+to
+Sunday
+School
+I
+prayed
+and
+prayed
+that
+I
+might
+get
+well
+I
+was
+a
+shoemaker
+Dr
+Where
+did
+you
+live
+Sp
+Down
+in
+Texas
+Dr
+What
+is
+your
+name
+Sp
+My
+name
+is
+Henry
+Wilkins
+Dr
+How
+old
+are
+you
+Sp
+I
+am
+an
+old
+man
+in
+the
+sixties
+One
+time
+I
+was
+driving
+a
+horse
+and
+he
+ran
+away
+I
+fell
+off
+the
+wagon
+and
+broke
+my
+back
+I
+used
+to
+be
+a
+farmer
+After
+that
+I
+could
+do
+no
+farming
+At
+that
+time
+I
+was
+in
+the
+thirties
+After
+I
+was
+hurt
+all
+I
+could
+do
+was
+some
+cobbling
+I
+earned
+my
+living
+but
+it
+was
+surely
+hard
+sometimes
+Dr
+Have
+you
+any
+idea
+what
+year
+it
+is
+Sp
+I
+can
+t
+remember
+Dr
+Who
+was
+President
+Sp
+Let
+me
+think
+a
+little
+I
+ought
+to
+know
+that
+I
+think
+if
+I
+remember
+right
+it
+was
+Cleveland
+Dr
+What
+was
+the
+cause
+of
+your
+death
+Sp
+I
+did
+not
+die
+I
+did
+some
+work
+but
+I
+never
+got
+any
+money
+for
+it
+because
+as
+soon
+as
+I
+was
+going
+to
+take
+the
+money
+somebody
+else
+grabbed
+it
+I
+heard
+many
+times
+that
+my
+shop
+belonged
+to
+somebody
+else
+I
+have
+been
+working
+there
+a
+long
+time
+but
+the
+young
+fellow
+there
+he
+always
+takes
+the
+money
+all
+the
+time
+and
+I
+never
+get
+anything
+Dr
+Did
+you
+start
+the
+shop
+Sp
+Yes
+many
+years
+ago
+Some
+young
+fellow
+came
+to
+my
+shop
+and
+helped
+with
+the
+work
+but
+I
+had
+to
+show
+him
+how
+to
+do
+it
+and
+I
+had
+to
+teach
+him
+how
+to
+do
+lots
+of
+things
+He
+got
+all
+the
+money
+I
+never
+got
+a
+smell
+of
+it
+Dr
+The
+fact
+is
+my
+friend
+you
+have
+passed
+out
+and
+are
+so
+called
+dead
+Sp
+I
+have
+done
+nothing
+for
+some
+time
+except
+help
+that
+young
+fellow
+get
+rich
+Dr
+Now
+listen
+to
+me
+You
+lost
+your
+physical
+body
+probably
+while
+you
+had
+that
+shop
+and
+now
+the
+shop
+belongs
+to
+somebody
+else
+The
+young
+man
+did
+not
+know
+you
+were
+there
+but
+you
+may
+have
+impressed
+him
+how
+to
+do
+things
+He
+did
+not
+know
+you
+were
+there
+Sp
+He
+did
+not
+know
+because
+I
+did
+the
+work
+I
+sat
+there
+working
+and
+once
+in
+a
+while
+he
+would
+sit
+right
+on
+me
+I
+could
+not
+chase
+him
+out
+Dr
+Do
+you
+know
+what
+year
+it
+is
+Sp
+It
+is
+Dr
+That
+was
+thirty
+years
+ago
+Do
+you
+know
+where
+you
+are
+You
+are
+in
+Los
+Angeles
+California
+Sp
+California
+Dr
+Look
+at
+these
+clothes
+you
+are
+wearing
+Sp
+Who
+put
+these
+clothes
+on
+me
+I
+don
+t
+want
+to
+be
+dressed
+in
+a
+woman
+s
+clothes
+Dr
+Let
+me
+explain
+Sp
+Bring
+my
+pants
+please
+Dr
+Look
+at
+these
+hands
+Sp
+They
+do
+not
+belong
+to
+me
+I
+have
+a
+ring
+on
+but
+I
+never
+owned
+a
+ring
+Dr
+Suppose
+you
+sat
+here
+mending
+shoes
+Do
+you
+know
+what
+people
+would
+say
+They
+would
+say
+Why
+is
+Mrs
+Wickland
+sitting
+there
+mending
+shoes
+Mrs
+Wickland
+is
+my
+wife
+and
+you
+are
+using
+her
+body
+Sp
+I
+am
+no
+woman
+I
+am
+a
+man
+I
+was
+engaged
+to
+be
+married
+but
+when
+I
+had
+my
+accident
+and
+became
+a
+cripple
+the
+girl
+said
+she
+did
+not
+want
+to
+marry
+a
+cripple
+so
+she
+married
+some
+one
+else
+I
+told
+her
+I
+could
+earn
+just
+as
+much
+money
+by
+mending
+shoes
+as
+I
+did
+when
+a
+farmer
+but
+she
+said
+she
+would
+not
+marry
+a
+cripple
+I
+loved
+her
+just
+the
+same
+and
+I
+love
+her
+still
+Dr
+What
+was
+her
+name
+Sp
+Mary
+Hopkins
+She
+said
+she
+was
+ashamed
+of
+me
+I
+could
+not
+help
+my
+accident
+I
+felt
+that
+if
+she
+loved
+me
+she
+would
+have
+thought
+more
+of
+me
+because
+I
+needed
+her
+more
+Of
+course
+I
+did
+not
+look
+so
+nice
+I
+could
+not
+dance
+and
+do
+the
+things
+she
+wanted
+to
+do
+One
+day
+she
+said
+to
+me
+I
+am
+ashamed
+to
+go
+out
+with
+you
+all
+crippled
+up
+I
+felt
+so
+bad
+because
+I
+did
+not
+think
+she
+could
+be
+so
+cruel
+I
+suffered
+terribly
+It
+was
+not
+enough
+that
+I
+had
+a
+crippled
+body
+but
+my
+heart
+was
+broken
+as
+well
+From
+that
+time
+I
+said
+Women
+are
+all
+devils
+I
+had
+no
+use
+for
+them
+I
+hated
+them
+Dr
+There
+are
+many
+good
+women
+Sp
+Sometimes
+I
+felt
+there
+is
+no
+God
+because
+He
+would
+not
+have
+let
+me
+suffer
+such
+mental
+and
+physical
+pain
+I
+tried
+my
+very
+best
+to
+be
+patient
+Dr
+You
+will
+have
+your
+reward
+for
+it
+now
+Sp
+I
+gave
+money
+to
+the
+church
+They
+said
+I
+must
+give
+money
+because
+God
+needed
+it
+Sometimes
+they
+made
+me
+give
+so
+much
+that
+I
+hadn
+t
+enough
+left
+for
+bread
+and
+butter
+They
+said
+if
+I
+didn
+t
+I
+wouldn
+t
+go
+to
+Heaven
+Dr
+There
+is
+no
+such
+Heaven
+as
+the
+preachers
+teach
+Sp
+Then
+why
+should
+they
+preach
+that
+way
+Dr
+For
+a
+living
+Do
+you
+realize
+that
+the
+teachings
+of
+Jesus
+were
+wonderful
+God
+is
+Spirit
+Jesus
+said
+and
+we
+should
+worship
+Him
+in
+Spirit
+and
+in
+truth
+The
+orthodox
+Christians
+think
+Heaven
+is
+a
+place
+up
+in
+the
+sky
+Heaven
+is
+a
+mental
+condition
+not
+a
+visible
+place
+The
+fact
+is
+we
+are
+spiritual
+beings
+invisible
+while
+occupying
+the
+mortal
+body
+When
+we
+step
+out
+of
+the
+mortal
+body
+we
+are
+still
+spiritual
+beings
+and
+if
+we
+are
+free
+minded
+those
+gone
+before
+will
+meet
+us
+and
+will
+show
+us
+the
+way
+to
+the
+spirit
+world
+God
+is
+not
+a
+visible
+spirit
+but
+God
+is
+Spirit
+God
+is
+Love
+You
+say
+you
+loved
+a
+girl
+Did
+you
+ever
+see
+love
+Sp
+No
+but
+I
+have
+felt
+it
+Dr
+He
+that
+dwelleth
+in
+love
+dwelleth
+in
+God
+We
+are
+talking
+to
+you
+but
+we
+do
+not
+see
+you
+I
+do
+not
+see
+you
+I
+see
+only
+the
+face
+of
+my
+wife
+Sp
+I
+don
+t
+see
+why
+you
+keep
+calling
+me
+your
+wife
+You
+say
+we
+never
+die
+yet
+you
+tell
+me
+I
+am
+dead
+and
+I
+still
+have
+my
+crippled
+body
+Dr
+If
+you
+had
+had
+understanding
+you
+would
+not
+have
+been
+crippled
+all
+these
+years
+since
+your
+death
+Sp
+Could
+I
+have
+been
+well
+all
+these
+years
+Dr
+Yes
+if
+you
+had
+been
+taught
+the
+truth
+Jesus
+said
+The
+people
+honoreth
+me
+with
+their
+lips
+but
+their
+heart
+is
+far
+from
+me
+Sp
+People
+believe
+that
+Jesus
+died
+for
+our
+sins
+and
+that
+if
+we
+are
+good
+we
+will
+go
+to
+Heaven
+when
+we
+die
+I
+am
+not
+there
+Dr
+You
+will
+never
+go
+to
+any
+orthodox
+Heaven
+And
+if
+there
+were
+such
+a
+place
+you
+would
+be
+lonesome
+after
+you
+arrived
+there
+Heaven
+is
+a
+mental
+condition
+attained
+through
+understanding
+Think
+of
+the
+wonders
+of
+Nature
+and
+God
+s
+revelations
+Do
+you
+like
+music
+Sp
+I
+used
+to
+I
+used
+to
+sing
+in
+the
+choir
+My
+girl
+sang
+too
+We
+were
+so
+happy
+I
+always
+felt
+when
+we
+were
+singing
+there
+was
+such
+beautiful
+harmony
+but
+then
+the
+minister
+got
+up
+in
+church
+and
+condemned
+everybody
+that
+did
+not
+give
+enough
+money
+to
+the
+church
+He
+said
+we
+would
+go
+straight
+to
+hell
+I
+could
+never
+see
+the
+justice
+of
+that
+that
+when
+a
+man
+does
+the
+best
+he
+knows
+how
+and
+lives
+a
+clean
+life
+that
+he
+should
+go
+to
+hell
+if
+he
+does
+not
+give
+enough
+money
+to
+the
+church
+Dr
+Do
+you
+know
+who
+was
+the
+founder
+of
+the
+Methodist
+Church
+John
+Wesley
+He
+understood
+the
+real
+life
+on
+the
+other
+side
+and
+lectured
+on
+spirits
+and
+spirit
+communion
+He
+knew
+the
+truth
+he
+did
+not
+just
+believe
+and
+he
+wrote
+of
+it
+but
+his
+people
+do
+not
+follow
+the
+teachings
+of
+the
+founder
+of
+their
+own
+church
+Christians
+do
+not
+understand
+the
+teachings
+of
+Jesus
+They
+do
+not
+want
+to
+understand
+because
+that
+causes
+them
+to
+think
+It
+is
+easier
+to
+merely
+believe
+Spiritual
+things
+must
+be
+spiritually
+discerned
+Sp
+When
+I
+was
+in
+my
+shop
+once
+in
+a
+while
+I
+saw
+my
+father
+and
+mother
+but
+they
+are
+dead
+and
+I
+knew
+I
+could
+not
+be
+with
+them
+Dr
+Why
+not
+Sp
+Because
+I
+was
+in
+life
+cobbling
+in
+my
+shop
+Mother
+said
+to
+me
+Come
+along
+with
+me
+I
+could
+not
+go
+because
+I
+had
+my
+crippled
+body
+and
+I
+had
+to
+earn
+my
+living
+When
+I
+did
+not
+work
+I
+did
+not
+get
+anything
+to
+eat
+and
+I
+was
+awfully
+hungry
+Once
+in
+a
+while
+I
+got
+a
+smell
+from
+the
+restaurant
+but
+that
+was
+all
+unless
+I
+worked
+Dr
+You
+were
+a
+spirit
+so
+could
+not
+eat
+Your
+parents
+came
+to
+you
+because
+they
+are
+spirits
+All
+these
+years
+you
+stayed
+around
+your
+shop
+because
+that
+was
+your
+greatest
+interest
+You
+did
+not
+know
+the
+higher
+laws
+of
+life
+Sp
+I
+was
+taught
+that
+if
+I
+did
+not
+go
+to
+church
+I
+would
+go
+to
+hell
+and
+burn
+for
+ever
+and
+ever
+Dr
+There
+is
+no
+such
+thing
+as
+burning
+for
+ever
+Sp
+Thank
+God
+for
+that
+Dr
+Look
+around
+perhaps
+you
+will
+see
+somebody
+you
+know
+Sp
+I
+am
+sick
+and
+tired
+of
+mending
+shoes
+Dr
+After
+you
+leave
+here
+you
+will
+not
+have
+to
+mend
+any
+more
+shoes
+Sp
+I
+would
+like
+to
+play
+and
+sing
+I
+love
+music
+I
+was
+getting
+along
+very
+nicely
+with
+my
+singing
+lessons
+until
+I
+got
+crippled
+Dr
+Perhaps
+Mary
+is
+here
+now
+Sp
+Mary
+She
+gave
+me
+up
+and
+married
+but
+she
+was
+not
+happy
+She
+married
+a
+drunkard
+She
+suffered
+Seeing
+a
+spirit
+Oh
+there
+is
+my
+mother
+She
+was
+good
+to
+me
+Dr
+Does
+she
+speak
+to
+you
+Sp
+She
+says
+My
+son
+you
+need
+not
+be
+crippled
+any
+longer
+Why
+I
+have
+a
+new
+body
+Mother
+but
+oh
+Mother
+crying
+I
+am
+a
+woman
+now
+Such
+a
+foolish
+thing
+to
+be
+dressed
+up
+like
+a
+woman
+Dr
+You
+are
+only
+talking
+through
+my
+wife
+s
+body
+Sp
+Can
+I
+talk
+through
+another
+person
+s
+body
+Dr
+Yes
+My
+wife
+is
+a
+psychic
+instrument
+through
+whom
+spirits
+can
+talk
+She
+is
+entirely
+unconscious
+while
+you
+are
+speaking
+through
+her
+It
+is
+strange
+but
+true
+Did
+you
+ever
+ask
+yourself
+what
+life
+really
+is
+Sp
+No
+I
+had
+no
+time
+I
+had
+to
+use
+my
+mind
+to
+make
+shoes
+Dr
+That
+is
+no
+excuse
+at
+all
+Sp
+My
+mother
+says
+At
+this
+point
+the
+spirit
+was
+removed
+and
+his
+mother
+assumed
+control
+Spirit
+Henry
+life
+is
+real
+There
+are
+no
+mysterious
+things
+as
+we
+were
+taught
+I
+believed
+in
+the
+same
+church
+as
+you
+You
+know
+father
+never
+cared
+for
+church
+and
+do
+you
+know
+he
+progressed
+more
+rapidly
+than
+I
+in
+the
+spirit
+world
+My
+belief
+and
+dogma
+held
+me
+back
+You
+remember
+father
+studied
+and
+we
+called
+him
+crazy
+because
+once
+in
+a
+while
+he
+went
+to
+Spiritualist
+meetings
+but
+he
+was
+right
+You
+know
+he
+had
+that
+book
+Heaven
+and
+Hell
+by
+Swedenborg
+and
+we
+used
+to
+look
+at
+each
+other
+and
+think
+he
+was
+going
+out
+of
+his
+mind
+We
+went
+to
+church
+and
+he
+did
+not
+yet
+he
+was
+the
+one
+to
+open
+my
+eyes
+to
+see
+better
+things
+when
+I
+reached
+the
+spirit
+side
+of
+life
+If
+he
+had
+not
+opened
+my
+eyes
+I
+would
+still
+be
+bound
+in
+my
+former
+belief
+and
+that
+means
+I
+would
+be
+in
+the
+earth
+sphere
+I
+was
+always
+afraid
+if
+he
+died
+he
+would
+go
+to
+hell
+and
+I
+was
+in
+misery
+You
+remember
+father
+died
+before
+I
+He
+came
+to
+me
+after
+I
+passed
+out
+but
+I
+thought
+it
+was
+imagination
+He
+tried
+very
+hard
+to
+get
+me
+to
+understand
+I
+want
+to
+tell
+you
+that
+creeds
+and
+dogmas
+of
+the
+church
+cause
+many
+earthbound
+spirits
+These
+spirits
+do
+harm
+to
+mortals
+Henry
+the
+Bible
+says
+Where
+your
+treasure
+is
+there
+will
+your
+heart
+be
+also
+Your
+treasure
+was
+your
+workshop
+You
+have
+been
+in
+your
+shop
+helping
+that
+young
+fellow
+unknown
+to
+yourself
+We
+could
+not
+get
+you
+First
+you
+were
+crippled
+and
+we
+could
+not
+get
+you
+to
+realize
+that
+your
+spiritual
+body
+was
+not
+crippled
+but
+your
+mind
+was
+so
+set
+on
+your
+crippled
+body
+that
+you
+could
+think
+of
+nothing
+else
+We
+have
+been
+with
+you
+for
+some
+time
+trying
+to
+get
+you
+to
+come
+with
+us
+but
+we
+could
+not
+One
+day
+we
+were
+passing
+by
+this
+place
+and
+we
+heard
+singing
+so
+we
+came
+into
+the
+meeting
+We
+saw
+that
+spirits
+were
+made
+to
+understand
+when
+nobody
+could
+reach
+them
+otherwise
+so
+I
+said
+Let
+us
+bring
+Henry
+here
+That
+was
+a
+long
+time
+ago
+We
+had
+to
+wait
+our
+turn
+before
+we
+could
+bring
+you
+here
+Now
+Henry
+open
+your
+spirit
+eyes
+and
+see
+that
+your
+spirit
+body
+is
+fresh
+and
+new
+Don
+t
+think
+of
+your
+old
+crippled
+body
+because
+then
+you
+will
+be
+crippled
+Think
+of
+your
+young
+spirit
+body
+and
+you
+will
+be
+young
+You
+will
+be
+happy
+You
+were
+a
+good
+man
+You
+had
+your
+sorrows
+but
+you
+tried
+to
+do
+the
+best
+you
+could
+It
+was
+only
+ignorance
+false
+doctrine
+and
+belief
+that
+held
+you
+back
+Henry
+we
+have
+a
+beautiful
+home
+in
+the
+spirit
+world
+and
+I
+will
+take
+you
+there
+where
+you
+will
+have
+to
+learn
+many
+things
+The
+first
+thing
+is
+to
+throw
+away
+all
+selfishness
+ignorance
+self
+pity
+and
+jealousy
+Come
+with
+me
+with
+an
+open
+heart
+Open
+your
+heart
+to
+God
+in
+a
+spiritual
+way
+and
+you
+will
+find
+the
+Kingdom
+of
+Heaven
+within
+you
+You
+have
+much
+to
+learn
+When
+you
+are
+happy
+you
+will
+find
+that
+happiness
+and
+love
+are
+Heaven
+Selfishness
+and
+ignorance
+are
+hell
+darkness
+is
+hell
+People
+make
+hell
+for
+themselves
+and
+others
+Let
+us
+do
+all
+we
+can
+to
+help
+others
+and
+forget
+self
+If
+you
+think
+only
+of
+self
+when
+you
+pass
+to
+the
+spirit
+side
+of
+life
+you
+will
+find
+yourself
+shut
+up
+in
+a
+room
+alone
+and
+all
+you
+will
+see
+will
+be
+your
+ignorance
+and
+selfishness
+You
+will
+be
+kept
+in
+this
+condition
+until
+you
+cry
+out
+God
+help
+me
+to
+forget
+my
+selfishness
+Let
+us
+do
+the
+work
+that
+is
+always
+waiting
+for
+us
+to
+do
+We
+must
+say
+Get
+thee
+behind
+me
+Satan
+Satan
+or
+the
+devil
+as
+he
+is
+often
+called
+is
+not
+a
+man
+Satan
+is
+only
+selfishness
+ignorance
+and
+bigotry
+these
+are
+the
+devil
+I
+was
+a
+good
+woman
+but
+I
+had
+to
+suffer
+because
+I
+lived
+only
+for
+self
+I
+worshipped
+my
+church
+My
+husband
+was
+taken
+away
+from
+me
+I
+worshipped
+my
+family
+more
+than
+I
+did
+God
+I
+loved
+my
+church
+and
+when
+I
+passed
+away
+I
+clung
+to
+it
+I
+had
+a
+daughter
+and
+I
+got
+into
+her
+magnetic
+aura
+and
+clung
+to
+her
+and
+she
+was
+sent
+to
+the
+asylum
+I
+could
+not
+get
+away
+from
+her
+She
+died
+then
+she
+was
+free
+and
+so
+was
+I
+Then
+father
+came
+and
+told
+me
+what
+I
+had
+done
+by
+my
+selfish
+thoughts
+Then
+I
+had
+to
+serve
+All
+my
+work
+was
+with
+little
+children
+not
+my
+own
+children
+for
+they
+were
+taken
+away
+from
+me
+They
+told
+me
+I
+would
+have
+to
+develop
+as
+much
+love
+for
+other
+children
+as
+I
+had
+for
+my
+own
+and
+when
+I
+reached
+that
+point
+I
+was
+very
+happy
+Now
+I
+have
+children
+not
+my
+own
+but
+any
+child
+is
+mine
+because
+one
+child
+is
+as
+much
+God
+s
+child
+as
+another
+and
+we
+should
+love
+them
+all
+We
+should
+care
+for
+one
+as
+well
+as
+the
+other
+I
+have
+my
+reward
+now
+Every
+one
+loves
+me
+and
+I
+love
+them
+and
+my
+home
+always
+has
+a
+new
+child
+in
+it
+I
+take
+a
+new
+child
+one
+who
+has
+not
+known
+love
+I
+tell
+him
+of
+the
+life
+beyond
+I
+want
+him
+to
+have
+an
+understanding
+of
+God
+Love
+should
+govern
+all
+not
+one
+child
+but
+all
+The
+great
+Universal
+Love
+that
+is
+all
+everything
+One
+child
+should
+be
+loved
+just
+as
+much
+as
+another
+Therefore
+be
+very
+careful
+in
+concentrating
+your
+love
+on
+one
+child
+or
+just
+your
+own
+family
+Do
+not
+put
+your
+mind
+on
+one
+child
+because
+when
+you
+pass
+out
+you
+will
+be
+in
+hell
+You
+will
+stay
+around
+and
+disturb
+that
+child
+and
+sometimes
+as
+in
+my
+case
+the
+child
+goes
+insane
+My
+poor
+girl
+was
+called
+insane
+because
+I
+was
+with
+her
+and
+could
+not
+get
+away
+I
+was
+crying
+all
+the
+time
+because
+I
+wanted
+only
+my
+child
+I
+did
+not
+realize
+I
+was
+controlling
+her
+I
+could
+not
+see
+her
+They
+told
+her
+she
+was
+not
+married
+and
+that
+she
+had
+no
+child
+I
+was
+the
+one
+who
+was
+crying
+for
+my
+child
+my
+daughter
+Because
+she
+asked
+for
+her
+child
+when
+she
+had
+none
+they
+said
+she
+was
+crazy
+and
+sent
+her
+to
+the
+asylum
+So
+you
+see
+friends
+how
+necessary
+it
+is
+that
+we
+should
+all
+learn
+to
+know
+these
+things
+before
+we
+pass
+to
+the
+spirit
+side
+of
+life
+Let
+us
+be
+wise
+and
+learn
+all
+we
+can
+while
+here
+The
+more
+we
+learn
+here
+about
+the
+other
+side
+of
+life
+the
+better
+and
+happier
+we
+shall
+be
+The
+spirit
+body
+is
+only
+a
+counterpart
+of
+the
+physical
+body
+As
+we
+progress
+in
+mind
+we
+grow
+If
+we
+intended
+going
+abroad
+we
+would
+do
+all
+we
+could
+to
+find
+out
+about
+the
+places
+we
+were
+going
+to
+visit
+and
+what
+hotels
+to
+stop
+at
+How
+much
+more
+important
+it
+is
+that
+we
+should
+find
+out
+all
+we
+can
+about
+the
+next
+world
+You
+will
+all
+be
+there
+some
+day
+Find
+out
+all
+you
+can
+then
+when
+you
+are
+ready
+to
+go
+you
+will
+just
+say
+goodbye
+and
+wake
+up
+in
+the
+spirit
+world
+You
+only
+say
+goodbye
+to
+the
+physical
+body
+and
+find
+yourself
+in
+your
+spiritual
+body
+If
+you
+have
+lived
+only
+for
+self
+as
+I
+did
+you
+will
+stay
+right
+where
+you
+have
+been
+just
+where
+you
+left
+off
+as
+I
+did
+and
+suffer
+This
+is
+a
+lesson
+and
+you
+can
+profit
+by
+my
+experience
+Do
+not
+love
+and
+worship
+your
+own
+children
+more
+than
+others
+that
+is
+selfish
+love
+Many
+children
+have
+no
+mother
+Why
+not
+try
+to
+help
+them
+Divide
+your
+love
+with
+some
+child
+who
+has
+no
+mother
+I
+have
+over
+one
+hundred
+to
+care
+for
+now
+I
+have
+tried
+to
+bring
+them
+up
+and
+give
+them
+a
+mother
+s
+love
+They
+never
+knew
+the
+comfort
+of
+a
+home
+I
+have
+worked
+and
+worked
+for
+Henry
+because
+I
+loved
+him
+but
+I
+could
+not
+reach
+him
+My
+husband
+was
+not
+held
+down
+as
+I
+was
+so
+he
+has
+progressed
+much
+higher
+than
+I
+Some
+day
+I
+shall
+probably
+reach
+where
+he
+is
+He
+studied
+deeply
+while
+all
+I
+had
+was
+belief
+Friends
+take
+advantage
+of
+what
+I
+suffered
+and
+learn
+from
+it
+I
+thank
+you
+for
+allowing
+me
+to
+bring
+my
+son
+here
+I
+also
+have
+my
+daughter
+with
+me
+I
+have
+found
+the
+light
+and
+am
+now
+doing
+missionary
+work
+among
+the
+little
+children
+Remember
+do
+not
+be
+selfish
+enough
+to
+worship
+your
+own
+children
+but
+have
+a
+mother
+s
+love
+for
+all
+children
+and
+above
+all
+things
+worship
+God
+first
+Mrs
+A
+a
+patient
+from
+Chicago
+was
+unusually
+sensitive
+to
+psychic
+influences
+and
+her
+mother
+Mrs
+H
+W
+had
+for
+some
+time
+noticed
+in
+her
+daughter
+s
+actions
+a
+similarity
+to
+the
+mannerisms
+of
+a
+minister
+former
+pastor
+of
+a
+church
+which
+she
+had
+attended
+who
+had
+been
+killed
+by
+a
+train
+a
+number
+of
+years
+before
+Mrs
+H
+W
+had
+spoken
+to
+Mr
+A
+her
+daughter
+s
+husband
+of
+this
+similarity
+and
+both
+were
+in
+the
+psychic
+circle
+when
+the
+patient
+also
+present
+was
+concentrated
+for
+EXPERIENCE
+NOVEMBER
+Spirit
+J
+NELSON
+Patient
+MRS
+A
+Psychic
+MRS
+WICKLAND
+The
+controlling
+spirit
+was
+dazed
+and
+seemed
+to
+be
+suffering
+from
+severe
+chest
+pains
+Doctor
+Think
+strength
+and
+you
+will
+be
+able
+to
+talk
+Who
+are
+you
+Spirit
+I
+don
+t
+know
+Dr
+Where
+did
+you
+come
+from
+Sp
+I
+don
+t
+know
+that
+either
+Mr
+A
+Can
+t
+you
+tell
+us
+where
+you
+came
+from
+Sp
+I
+don
+t
+know
+but
+if
+I
+should
+say
+anything
+I
+would
+say
+that
+I
+came
+from
+hell
+Mr
+A
+What
+kind
+of
+hell
+Sp
+Real
+hell
+I
+was
+burning
+up
+Mr
+A
+What
+caused
+that
+Sp
+I
+don
+t
+know
+what
+it
+was
+but
+it
+came
+like
+fire
+Static
+treatment
+given
+patient
+which
+is
+felt
+much
+more
+keenly
+by
+the
+obsessing
+spirit
+than
+the
+patient
+Dr
+It
+woke
+you
+up
+all
+right
+Where
+did
+you
+come
+from
+Sp
+I
+don
+t
+know
+what
+I
+have
+been
+doing
+for
+a
+long
+time
+I
+think
+I
+must
+have
+slept
+and
+then
+I
+woke
+up
+in
+hell
+I
+saw
+all
+kinds
+of
+sparks
+I
+guess
+I
+did
+not
+pray
+enough
+Mr
+A
+What
+were
+you
+doing
+when
+you
+were
+living
+Sp
+I
+don
+t
+know
+I
+don
+t
+know
+what
+I
+did
+If
+I
+could
+only
+know
+what
+is
+the
+matter
+with
+me
+Mr
+A
+What
+were
+you
+doing
+the
+last
+you
+recall
+Sp
+I
+have
+such
+a
+pain
+here
+Rubbing
+the
+chest
+I
+feel
+as
+if
+I
+had
+been
+sick
+I
+can
+t
+remember
+yet
+what
+I
+have
+been
+doing
+Dr
+Your
+memory
+will
+soon
+return
+See
+Chap
+Page
+Paragraph
+Sp
+You
+know
+when
+a
+man
+walks
+and
+walks
+and
+does
+not
+know
+where
+he
+is
+going
+or
+what
+he
+is
+doing
+it
+s
+bad
+Dr
+Were
+you
+on
+a
+journey
+Sp
+I
+don
+t
+recall
+things
+yet
+I
+think
+I
+have
+been
+in
+a
+coma
+state
+for
+a
+long
+time
+When
+I
+was
+walking
+everything
+was
+so
+dark
+I
+couldn
+t
+see
+anything
+I
+have
+such
+pain
+here
+Placing
+hand
+on
+chest
+Now
+I
+remember
+something
+I
+got
+into
+a
+crowd
+and
+they
+pushed
+me
+and
+pushed
+me
+Earth
+sphere
+condition
+after
+death
+Then
+I
+saw
+just
+a
+little
+star
+of
+light
+Magnetic
+aura
+of
+psychic
+sensitive
+the
+patient
+he
+had
+been
+obsessing
+They
+seemed
+to
+be
+crowding
+me
+in
+and
+in
+until
+at
+last
+I
+got
+to
+hell
+The
+crowd
+was
+pushing
+me
+forward
+and
+I
+did
+not
+know
+where
+I
+was
+going
+then
+I
+got
+these
+sparks
+I
+always
+thought
+I
+had
+been
+chosen
+to
+save
+others
+and
+here
+I
+was
+in
+hell
+myself
+The
+fire
+was
+awful
+I
+had
+it
+for
+a
+while
+then
+I
+seemed
+to
+get
+lost
+again
+I
+don
+t
+know
+what
+is
+to
+become
+of
+me
+Dr
+What
+is
+your
+name
+Sp
+I
+do
+not
+know
+yet
+I
+am
+so
+dazed
+I
+can
+t
+recall
+anything
+I
+seem
+to
+be
+getting
+somewhere
+I
+must
+have
+gone
+through
+a
+very
+severe
+sickness
+People
+crowded
+me
+and
+they
+came
+after
+me
+and
+I
+felt
+I
+had
+not
+done
+right
+I
+was
+always
+sincere
+Mr
+A
+Did
+you
+believe
+in
+hell
+Sp
+Yes
+I
+did
+Mr
+A
+Did
+you
+believe
+in
+Jesus
+Sp
+Yes
+I
+was
+one
+chosen
+to
+save
+others
+but
+yet
+I
+went
+to
+hell
+and
+I
+was
+to
+save
+others
+Dr
+Now
+we
+will
+try
+to
+help
+you
+out
+of
+it
+Sp
+There
+are
+so
+many
+people
+around
+here
+They
+seem
+to
+want
+so
+much
+of
+me
+Dr
+They
+must
+be
+the
+people
+you
+tried
+to
+save
+but
+did
+not
+Sp
+They
+all
+ask
+me
+to
+save
+them
+now
+but
+I
+cannot
+save
+myself
+Mr
+A
+Did
+something
+happen
+to
+you
+Sp
+I
+think
+so
+My
+head
+hurts
+me
+so
+much
+and
+I
+have
+pains
+here
+Chest
+I
+don
+t
+know
+where
+I
+am
+I
+wish
+you
+could
+take
+away
+this
+dark
+gloom
+At
+times
+I
+have
+felt
+that
+I
+did
+not
+know
+anything
+Mr
+A
+Who
+are
+you
+Are
+you
+a
+man
+or
+a
+woman
+Sp
+I
+am
+a
+man
+and
+I
+do
+not
+know
+anything
+except
+that
+the
+crowd
+pushed
+me
+and
+I
+got
+to
+hell
+Mr
+A
+Did
+anything
+happen
+to
+you
+Sp
+I
+don
+t
+know
+Mr
+A
+Where
+did
+you
+live
+Sp
+In
+Chicago
+I
+think
+I
+seem
+to
+be
+blind
+and
+I
+feel
+so
+strange
+Mr
+A
+Were
+you
+going
+to
+any
+particular
+place
+while
+you
+were
+walking
+Sp
+I
+don
+t
+know
+but
+I
+see
+a
+train
+coming
+so
+fast
+and
+then
+I
+remember
+getting
+into
+a
+crowd
+Say
+do
+you
+think
+my
+name
+is
+Nelson
+Sometimes
+that
+seems
+to
+be
+my
+name
+and
+sometimes
+it
+doesn
+t
+Mr
+A
+Were
+you
+Pastor
+Nelson
+Were
+you
+a
+minister
+Sp
+It
+seems
+I
+was
+at
+times
+That
+s
+my
+name
+My
+name
+is
+Nelson
+Mrs
+H
+W
+Do
+you
+know
+me
+Sp
+I
+recall
+the
+voice
+Mr
+A
+Where
+did
+you
+know
+her
+Sp
+In
+Chicago
+I
+can
+see
+a
+train
+coming
+so
+fast
+and
+then
+everything
+got
+dark
+but
+I
+remember
+something
+hit
+me
+in
+the
+chest
+Didn
+t
+I
+have
+a
+wife
+Mr
+A
+Yes
+and
+several
+children
+Mrs
+H
+W
+Don
+t
+you
+know
+me
+Sp
+Yes
+you
+used
+to
+come
+to
+my
+church
+You
+were
+a
+good
+church
+member
+but
+you
+got
+away
+Dr
+Do
+you
+know
+that
+lady
+The
+patient
+Mrs
+A
+Sp
+No
+Dr
+Did
+you
+know
+L
+W
+The
+patient
+s
+maiden
+name
+Sp
+Yes
+Dr
+That
+is
+she
+Sp
+She
+was
+much
+younger
+Mr
+A
+Do
+you
+remember
+coming
+from
+Western
+Springs
+Sp
+Yes
+I
+had
+been
+preaching
+Mr
+A
+You
+were
+hit
+by
+a
+train
+and
+killed
+Sp
+I
+cannot
+recall
+that
+I
+am
+dead
+but
+I
+know
+I
+have
+been
+mixed
+up
+I
+am
+in
+such
+a
+crowd
+What
+is
+the
+matter
+with
+my
+head
+Mr
+A
+Do
+you
+know
+a
+Mrs
+Nelson
+who
+used
+to
+live
+on
+Foster
+Avenue
+Sp
+Yes
+that
+s
+my
+wife
+There
+was
+somebody
+else
+along
+with
+me
+when
+I
+came
+to
+the
+trains
+and
+they
+pushed
+me
+ahead
+of
+the
+train
+The
+train
+was
+coming
+this
+way
+and
+I
+was
+going
+over
+there
+Somebody
+got
+hold
+of
+me
+and
+then
+there
+was
+such
+a
+big
+crowd
+I
+remember
+the
+big
+crowd
+after
+I
+was
+hit
+by
+the
+train
+That
+big
+crowd
+has
+been
+after
+me
+all
+the
+time
+Spirits
+Dr
+That
+is
+because
+you
+did
+not
+teach
+them
+correctly
+Sp
+Somebody
+says
+These
+are
+your
+followers
+that
+you
+have
+misled
+in
+the
+wrong
+path
+Dr
+Why
+did
+you
+mislead
+them
+Sp
+I
+taught
+them
+God
+s
+truth
+Dr
+Possibly
+as
+far
+as
+you
+knew
+Sp
+I
+tried
+to
+save
+humanity
+from
+hell
+Dr
+And
+then
+you
+went
+there
+yourself
+Sp
+I
+was
+only
+in
+it
+for
+a
+little
+while
+but
+it
+was
+terrible
+I
+did
+not
+imagine
+it
+that
+way
+I
+thought
+hell
+would
+be
+different
+than
+pouring
+down
+fire
+fire
+and
+brimstone
+and
+it
+smarted
+like
+everything
+I
+cannot
+see
+why
+I
+should
+have
+been
+in
+hell
+Dr
+It
+must
+be
+because
+your
+teachings
+were
+wrong
+All
+these
+people
+accuse
+you
+of
+having
+misled
+them
+Sp
+I
+gave
+myself
+up
+to
+God
+Dr
+Did
+God
+ask
+you
+to
+do
+that
+Or
+did
+you
+do
+it
+for
+a
+living
+Sp
+I
+tried
+to
+save
+people
+from
+sin
+I
+suppose
+I
+did
+save
+some
+Dr
+You
+did
+not
+save
+yourself
+Sp
+That
+lady
+over
+there
+pointing
+to
+Mrs
+H
+W
+should
+go
+to
+hell
+She
+did
+not
+stick
+to
+the
+church
+as
+she
+should
+Dr
+You
+stuck
+to
+the
+church
+and
+yet
+you
+say
+you
+have
+been
+in
+hell
+Sp
+Yes
+that
+s
+so
+Dr
+Then
+how
+do
+you
+know
+your
+church
+and
+your
+teaching
+were
+right
+You
+were
+a
+Servant
+of
+God
+yet
+you
+went
+to
+hell
+You
+were
+supposed
+to
+be
+better
+than
+the
+congregation
+Sp
+Pointing
+Is
+that
+Mrs
+W
+Dr
+Yes
+Sp
+To
+Mrs
+H
+W
+Why
+don
+t
+you
+go
+to
+church
+Mrs
+H
+W
+I
+do
+sometimes
+Dr
+She
+doesn
+t
+want
+to
+go
+to
+hell
+where
+you
+say
+you
+have
+been
+You
+went
+to
+church
+and
+yet
+you
+went
+to
+hell
+You
+taught
+the
+wrong
+thing
+You
+do
+not
+want
+her
+to
+follow
+in
+your
+footsteps
+do
+you
+Sp
+I
+don
+t
+want
+her
+to
+go
+to
+hell
+where
+I
+have
+been
+Dr
+Then
+the
+church
+must
+be
+wrong
+Mr
+A
+Was
+your
+name
+Nelson
+J
+Nelson
+Your
+wife
+is
+living
+in
+the
+same
+house
+on
+Foster
+Avenue
+Sp
+Yes
+that
+s
+my
+name
+Now
+I
+remember
+Mr
+A
+You
+were
+killed
+eight
+years
+ago
+SP
+I
+have
+not
+seen
+my
+wife
+and
+children
+for
+a
+long
+time
+Dr
+You
+did
+not
+preach
+the
+truth
+when
+you
+were
+trying
+to
+save
+souls
+and
+you
+did
+not
+save
+your
+own
+For
+years
+you
+have
+been
+in
+the
+purgatory
+of
+ignorance
+Sp
+How
+is
+my
+wife
+She
+loved
+me
+Mr
+A
+She
+is
+well
+Sp
+How
+could
+my
+wife
+leave
+me
+as
+she
+did
+Mr
+A
+She
+did
+not
+leave
+you
+she
+buried
+your
+body
+in
+Graceland
+Do
+you
+know
+Graceland
+Cemetery
+Sp
+Yes
+Dr
+Do
+you
+believe
+in
+spirits
+Sp
+What
+do
+you
+mean
+Dr
+Ghosts
+Sp
+No
+Dr
+Doesn
+t
+the
+Bible
+speak
+of
+them
+Sp
+Not
+particularly
+Dr
+Yes
+it
+does
+Jesus
+used
+to
+cast
+out
+unclean
+spirits
+and
+the
+apostles
+did
+also
+Have
+you
+met
+Jesus
+Sp
+No
+I
+have
+not
+met
+any
+one
+I
+have
+been
+in
+the
+crowd
+and
+they
+have
+been
+pushing
+me
+all
+the
+time
+Dr
+Those
+were
+people
+whom
+you
+had
+taught
+falsely
+before
+they
+died
+Sp
+One
+day
+I
+saw
+a
+little
+light
+Dr
+You
+got
+into
+the
+aura
+of
+this
+lady
+Mrs
+A
+Mr
+A
+She
+is
+my
+wife
+Why
+are
+you
+bothering
+her
+Why
+don
+t
+you
+go
+to
+the
+Heaven
+you
+taught
+Why
+do
+you
+stay
+around
+the
+earth
+Sp
+Are
+you
+in
+hell
+too
+Mr
+A
+No
+we
+are
+on
+earth
+Your
+hell
+was
+static
+electricity
+that
+we
+gave
+you
+Dr
+That
+was
+the
+only
+way
+we
+could
+drive
+you
+away
+from
+this
+lady
+Mr
+A
+Why
+didn
+t
+you
+go
+the
+way
+you
+taught
+Sp
+I
+do
+not
+know
+Mr
+A
+Why
+didn
+t
+you
+teach
+the
+truth
+when
+you
+lived
+on
+earth
+Sp
+I
+taught
+the
+way
+I
+learned
+and
+the
+Bishop
+told
+me
+what
+to
+do
+I
+taught
+the
+religion
+taught
+on
+earth
+Dr
+That
+is
+a
+misconception
+You
+yourself
+have
+proven
+that
+it
+is
+a
+fallacy
+You
+have
+been
+dead
+eight
+years
+and
+yet
+you
+are
+an
+earthbound
+spirit
+Sp
+I
+certainly
+expected
+to
+be
+in
+Heaven
+Dr
+You
+did
+not
+teach
+the
+truth
+That
+lady
+Mrs
+H
+W
+will
+reach
+Heaven
+quicker
+than
+you
+will
+Sp
+She
+will
+How
+do
+you
+know
+that
+Dr
+She
+has
+learned
+the
+real
+truth
+the
+truth
+of
+the
+spirit
+world
+and
+spirit
+existence
+Paul
+taught
+about
+spirits
+Jesus
+cast
+out
+unclean
+spirits
+Sp
+We
+cannot
+compare
+ourselves
+with
+Jesus
+Jesus
+was
+the
+son
+of
+God
+Dr
+The
+Bible
+says
+Ye
+are
+all
+the
+children
+of
+God
+and
+Jesus
+said
+I
+and
+my
+Father
+are
+one
+Sp
+He
+was
+God
+s
+Beloved
+Son
+God
+sent
+Him
+to
+save
+us
+from
+sin
+Dr
+I
+will
+tell
+you
+who
+said
+that
+In
+the
+year
+A
+D
+at
+the
+Council
+of
+Nice
+Italy
+Constantine
+declared
+Jesus
+to
+be
+The
+Son
+of
+God
+and
+very
+God
+and
+his
+declaration
+was
+officially
+accepted
+by
+the
+Christian
+Church
+Sp
+Christ
+was
+God
+s
+Beloved
+Son
+and
+if
+we
+believe
+in
+Him
+we
+shall
+inherit
+salvation
+Dr
+Why
+didn
+t
+you
+do
+it
+Sp
+Jesus
+is
+God
+s
+Son
+and
+if
+you
+believe
+in
+Him
+you
+will
+be
+saved
+Dr
+Then
+where
+are
+you
+now
+Sp
+I
+don
+t
+quite
+understand
+it
+yet
+Dr
+But
+you
+said
+you
+had
+been
+in
+hell
+Does
+your
+conscience
+not
+tell
+you
+you
+were
+wrong
+I
+think
+it
+does
+Sp
+It
+accuses
+me
+Dr
+If
+you
+will
+listen
+carefully
+you
+will
+realize
+that
+you
+were
+wrong
+You
+never
+felt
+quite
+satisfied
+with
+the
+story
+of
+God
+s
+creation
+of
+the
+world
+did
+you
+Sp
+We
+should
+not
+argue
+about
+God
+God
+is
+perfect
+and
+we
+are
+His
+children
+and
+if
+we
+believe
+in
+Him
+we
+shall
+inherit
+salvation
+Dr
+You
+say
+God
+is
+perfect
+You
+say
+God
+created
+everything
+and
+that
+He
+knows
+everything
+therefore
+He
+must
+have
+known
+beforehand
+that
+His
+creation
+would
+be
+imperfect
+and
+that
+man
+would
+fall
+in
+sin
+Would
+you
+create
+a
+world
+and
+then
+destroy
+it
+Sp
+People
+fall
+in
+sin
+and
+God
+s
+Son
+came
+to
+save
+us
+Dr
+Did
+God
+know
+that
+the
+world
+would
+fall
+in
+sin
+Did
+He
+know
+it
+and
+yet
+create
+it
+Does
+that
+sound
+reasonable
+Did
+He
+know
+that
+fallen
+angels
+would
+obsess
+people
+Was
+He
+All
+Wise
+The
+preachers
+are
+at
+fault
+in
+their
+teachings
+Sp
+We
+were
+taught
+that
+When
+we
+are
+teachers
+of
+the
+Gospel
+we
+must
+live
+up
+to
+it
+and
+we
+must
+believe
+it
+Dr
+You
+did
+not
+use
+your
+reason
+or
+you
+would
+not
+have
+believed
+what
+you
+were
+taught
+The
+people
+who
+are
+crowding
+you
+now
+are
+evidently
+the
+very
+ones
+you
+tried
+to
+save
+and
+they
+too
+are
+in
+darkness
+They
+did
+not
+find
+Heaven
+What
+does
+the
+Bible
+say
+Ye
+are
+the
+temple
+of
+God
+and
+the
+Spirit
+of
+God
+dwelleth
+in
+you
+God
+is
+Love
+and
+he
+that
+dwelleth
+in
+Love
+dwelleth
+in
+God
+According
+to
+your
+teachings
+you
+should
+have
+found
+God
+before
+this
+But
+you
+have
+not
+The
+teachings
+of
+Jesus
+contain
+wonderful
+truths
+but
+they
+are
+not
+understood
+It
+is
+easier
+to
+teach
+that
+Jesus
+died
+for
+our
+sins
+and
+that
+we
+will
+be
+saved
+and
+everything
+will
+be
+all
+right
+Now
+you
+will
+have
+to
+obtain
+understanding
+Sp
+If
+I
+am
+dead
+then
+I
+should
+see
+God
+Dr
+You
+will
+never
+see
+God
+God
+is
+not
+a
+person
+on
+a
+throne
+God
+is
+Spirit
+and
+God
+is
+Intelligence
+Have
+you
+ever
+seen
+music
+Sp
+I
+have
+heard
+it
+Dr
+Did
+you
+love
+your
+wife
+and
+family
+Sp
+Yes
+I
+did
+Dr
+Have
+you
+ever
+seen
+that
+love
+If
+you
+understand
+the
+Love
+Principle
+in
+the
+higher
+sense
+you
+will
+understand
+that
+God
+is
+Love
+That
+was
+Jesus
+own
+teaching
+Sp
+We
+have
+to
+teach
+as
+I
+did
+Don
+t
+you
+think
+Mrs
+W
+that
+I
+did
+all
+right
+Dr
+She
+left
+your
+church
+Sp
+She
+went
+astray
+Dr
+You
+say
+you
+are
+a
+man
+and
+yet
+here
+you
+are
+controlling
+my
+wife
+s
+body
+Did
+you
+ever
+believe
+in
+mediumship
+Sp
+That
+is
+all
+humbug
+Dr
+There
+must
+be
+some
+truth
+in
+it
+You
+are
+proving
+it
+yourself
+Sp
+I
+didn
+t
+feel
+that
+anybody
+should
+give
+up
+church
+for
+that
+humbug
+Dr
+You
+yourself
+are
+proving
+that
+it
+is
+not
+a
+humbug
+for
+you
+are
+talking
+through
+a
+medium
+now
+Look
+at
+these
+hands
+and
+see
+if
+they
+belong
+to
+you
+Did
+you
+have
+a
+wedding
+ring
+Sp
+That
+s
+a
+woman
+s
+ring
+Dr
+You
+are
+using
+my
+wife
+s
+body
+Sp
+How
+did
+I
+get
+into
+it
+Dr
+You
+are
+an
+invisible
+spirit
+We
+do
+not
+see
+you
+You
+are
+talking
+through
+my
+wife
+s
+physical
+organs
+Now
+you
+see
+how
+little
+you
+really
+know
+of
+the
+laws
+of
+Life
+and
+Love
+and
+the
+Hereafter
+Sp
+Things
+seem
+so
+strange
+There
+was
+a
+time
+I
+recall
+now
+I
+am
+getting
+some
+of
+my
+memory
+back
+I
+recall
+I
+got
+hurt
+Dr
+When
+the
+train
+struck
+you
+you
+were
+driven
+from
+your
+body
+Sp
+I
+remember
+going
+home
+and
+I
+stayed
+at
+home
+but
+my
+wife
+didn
+t
+seem
+to
+notice
+me
+Dr
+Your
+wife
+did
+not
+know
+you
+were
+there
+You
+were
+invisible
+to
+her
+Sp
+I
+tried
+to
+talk
+to
+her
+and
+the
+children
+but
+they
+took
+n
+notice
+of
+me
+so
+I
+thought
+what
+s
+the
+use
+I
+prayed
+and
+prayed
+I
+went
+away
+from
+my
+wife
+and
+I
+could
+not
+get
+back
+I
+was
+parted
+from
+her
+and
+everything
+was
+so
+strange
+Then
+I
+got
+into
+this
+crowd
+and
+they
+followed
+me
+and
+again
+I
+tried
+to
+go
+home
+and
+after
+I
+got
+there
+I
+talked
+to
+my
+wife
+and
+children
+but
+it
+seemed
+as
+if
+no
+one
+cared
+for
+me
+because
+they
+would
+not
+talk
+to
+me
+and
+took
+no
+notice
+of
+me
+I
+put
+my
+hand
+on
+my
+wife
+and
+it
+seemed
+as
+if
+my
+hand
+went
+right
+through
+her
+I
+talked
+to
+my
+wife
+again
+but
+no
+response
+so
+I
+went
+out
+again
+and
+got
+into
+that
+crowd
+and
+I
+was
+with
+them
+until
+I
+got
+into
+hell
+There
+were
+so
+many
+in
+the
+crowd
+that
+we
+were
+like
+sardines
+One
+came
+after
+another
+and
+then
+I
+was
+pushed
+ahead
+Controlled
+the
+sensitive
+I
+saw
+a
+little
+light
+and
+after
+that
+there
+was
+fire
+and
+brimstone
+Dr
+You
+were
+in
+the
+magnetic
+aura
+of
+that
+lady
+Mrs
+A
+and
+obsessed
+her
+and
+finally
+controlled
+her
+body
+Sp
+How
+could
+I
+do
+that
+Dr
+I
+am
+going
+to
+answer
+your
+question
+in
+true
+Yankee
+style
+by
+asking
+another
+How
+could
+you
+control
+this
+body
+You
+see
+how
+little
+you
+know
+about
+the
+mysteries
+of
+God
+You
+preached
+only
+a
+doctrine
+but
+did
+not
+understand
+the
+truth
+Sp
+When
+you
+go
+to
+a
+Seminary
+and
+learn
+what
+they
+teach
+you
+you
+have
+to
+preach
+it
+whether
+you
+like
+it
+or
+not
+Dr
+You
+sinned
+against
+the
+Holy
+Ghost
+because
+your
+better
+judgment
+told
+you
+it
+was
+not
+right
+Jesus
+did
+not
+teach
+what
+you
+taught
+Sp
+I
+was
+not
+very
+successful
+in
+my
+ministry
+this
+statement
+was
+afterward
+confirmed
+as
+many
+others
+are
+not
+because
+it
+seemed
+as
+if
+the
+audience
+my
+followers
+did
+not
+stand
+by
+me
+and
+then
+I
+was
+discouraged
+and
+felt
+what
+was
+the
+use
+No
+one
+seemed
+to
+care
+for
+my
+preaching
+I
+was
+very
+discouraged
+I
+felt
+sometimes
+as
+if
+I
+should
+give
+up
+the
+whole
+thing
+Dr
+Why
+didn
+t
+you
+Sp
+If
+I
+should
+tell
+you
+the
+truth
+and
+tell
+you
+why
+I
+didn
+t
+I
+should
+say
+it
+was
+because
+I
+had
+a
+wife
+and
+family
+to
+support
+But
+I
+was
+not
+successful
+as
+a
+minister
+I
+wish
+I
+had
+never
+studied
+for
+the
+ministry
+but
+had
+been
+more
+of
+a
+mechanic
+I
+would
+have
+had
+a
+happier
+life
+It
+was
+later
+learned
+that
+during
+his
+earth
+life
+the
+spirit
+had
+made
+this
+same
+remark
+to
+a
+fellow
+minister
+I
+could
+not
+provide
+for
+my
+wife
+as
+I
+wanted
+to
+and
+she
+is
+a
+good
+woman
+My
+salary
+was
+small
+and
+when
+you
+have
+a
+family
+to
+support
+and
+have
+to
+get
+your
+salary
+by
+your
+mouth
+it
+is
+hard
+when
+you
+don
+t
+get
+any
+encouragement
+from
+your
+followers
+Some
+found
+fault
+with
+me
+I
+would
+go
+into
+the
+pulpit
+and
+my
+heart
+would
+not
+be
+in
+my
+work
+because
+I
+knew
+they
+did
+not
+like
+me
+I
+was
+not
+happy
+I
+wished
+that
+I
+had
+not
+studied
+in
+my
+younger
+days
+but
+had
+earned
+an
+honest
+living
+I
+see
+things
+now
+that
+I
+did
+not
+see
+before
+I
+was
+blind
+and
+I
+see
+now
+that
+I
+was
+greatly
+at
+fault
+I
+should
+not
+have
+followed
+in
+the
+path
+I
+did
+They
+found
+fault
+with
+me
+here
+and
+there
+and
+the
+Bishop
+sent
+a
+poor
+fellow
+from
+one
+place
+to
+another
+and
+sometimes
+it
+meant
+a
+whole
+month
+s
+salary
+Sometimes
+I
+had
+to
+borrow
+money
+so
+that
+I
+could
+move
+At
+last
+I
+got
+tired
+of
+being
+moved
+around
+I
+would
+get
+a
+few
+friends
+in
+one
+place
+then
+we
+would
+have
+to
+move
+and
+I
+got
+discouraged
+Finally
+I
+got
+a
+house
+and
+I
+said
+I
+was
+going
+to
+stay
+there
+and
+told
+them
+if
+they
+did
+not
+want
+me
+or
+they
+could
+not
+find
+anything
+for
+me
+to
+do
+I
+would
+go
+to
+work
+I
+never
+could
+get
+enough
+together
+to
+properly
+support
+my
+family
+because
+they
+changed
+me
+so
+often
+The
+Bishop
+would
+move
+me
+from
+one
+place
+to
+another
+That
+is
+not
+the
+right
+life
+to
+live
+I
+would
+not
+wish
+my
+worst
+enemy
+to
+be
+a
+minister
+It
+s
+pretty
+hard
+on
+a
+fellow
+Now
+I
+am
+in
+a
+worse
+condition
+that
+I
+was
+because
+I
+m
+blind
+Dr
+Before
+you
+leave
+here
+we
+will
+open
+your
+eyes
+and
+send
+you
+on
+your
+way
+rejoising
+First
+tell
+me
+if
+there
+is
+any
+cure
+for
+my
+blindness
+Dr
+We
+will
+open
+your
+eyes
+The
+Bible
+says
+Eyes
+have
+they
+but
+they
+see
+not
+they
+have
+ears
+but
+they
+hear
+not
+Yours
+is
+only
+spiritual
+blindness
+Sp
+I
+wish
+I
+could
+open
+those
+spiritual
+eyes
+Dr
+It
+is
+not
+the
+fault
+of
+Jesus
+teachings
+that
+you
+are
+spiritually
+blind
+It
+was
+wrong
+to
+teach
+as
+you
+taught
+That
+is
+the
+cause
+of
+your
+present
+condition
+If
+you
+say
+that
+God
+sent
+Jesus
+as
+a
+special
+Savior
+you
+infer
+that
+God
+made
+a
+mistake
+when
+He
+created
+man
+and
+He
+did
+not
+Sp
+Jesus
+was
+God
+s
+Beloved
+Son
+Dr
+That
+conception
+is
+wrong
+Jesus
+said
+I
+and
+my
+Father
+are
+one
+and
+we
+are
+told
+in
+the
+Bible
+Ye
+are
+all
+the
+children
+of
+God
+Are
+we
+not
+strangers
+to
+ourselves
+Sp
+We
+fall
+in
+sin
+Do
+you
+believe
+in
+the
+Devil
+Dr
+In
+the
+first
+place
+God
+is
+not
+a
+person
+He
+is
+Spirit
+All
+Wise
+All
+Powerful
+everywhere
+present
+We
+accept
+that
+as
+the
+first
+principle
+in
+the
+Universe
+God
+is
+All
+in
+All
+If
+God
+is
+All
+in
+All
+as
+the
+Bible
+says
+would
+He
+make
+the
+big
+mistake
+which
+Christianity
+implies
+he
+made
+when
+it
+asserts
+that
+God
+s
+creation
+was
+so
+imperfectly
+planned
+that
+man
+was
+doomed
+to
+fall
+in
+sin
+and
+that
+the
+sending
+of
+a
+Savior
+was
+the
+only
+means
+of
+rectifying
+this
+mistake
+The
+church
+teaches
+that
+some
+of
+the
+angels
+fell
+That
+means
+they
+became
+something
+inferior
+How
+could
+that
+be
+if
+they
+were
+created
+out
+of
+God
+s
+own
+substance
+That
+Something
+Supreme
+created
+the
+world
+and
+placed
+us
+here
+had
+He
+not
+forethought
+and
+foresight
+enough
+to
+see
+what
+would
+happen
+Sp
+We
+were
+born
+into
+this
+world
+and
+fell
+in
+sin
+Dr
+Didn
+t
+God
+know
+what
+would
+happen
+Sp
+I
+suppose
+so
+Dr
+I
+am
+showing
+you
+that
+the
+orthodox
+teaching
+is
+wrong
+Much
+of
+the
+Bible
+is
+simply
+a
+collection
+of
+allegories
+Jesus
+always
+spoke
+in
+parables
+Spiritual
+things
+must
+be
+spiritually
+discerned
+When
+Jesus
+wished
+to
+teach
+the
+people
+that
+they
+should
+love
+their
+fellow
+man
+as
+themselves
+what
+did
+He
+say
+He
+told
+them
+the
+story
+of
+The
+Good
+Samaritan
+the
+story
+of
+a
+certain
+man
+who
+went
+from
+Jerusalem
+to
+Jericho
+and
+fell
+among
+thieves
+who
+beat
+him
+and
+left
+him
+half
+dead
+A
+certain
+priest
+came
+that
+way
+and
+when
+he
+saw
+him
+he
+passed
+by
+on
+the
+other
+side
+Then
+a
+Levite
+came
+and
+he
+passed
+by
+on
+the
+other
+side
+But
+a
+certain
+Samaritan
+came
+and
+when
+he
+saw
+him
+he
+had
+compassion
+on
+him
+and
+bound
+up
+his
+wounds
+and
+brought
+him
+to
+an
+inn
+and
+cared
+for
+him
+And
+when
+he
+left
+the
+inn
+he
+paid
+the
+host
+to
+take
+care
+of
+the
+man
+Then
+Jesus
+asked
+the
+lawyer
+which
+one
+represented
+his
+fellow
+man
+and
+the
+lawyer
+answered
+He
+that
+showed
+mercy
+Sp
+But
+that
+is
+history
+Dr
+No
+that
+is
+allegory
+Sp
+How
+do
+you
+know
+Dr
+The
+very
+Bible
+tells
+us
+so
+Jesus
+told
+that
+story
+simply
+as
+a
+parable
+to
+show
+what
+The
+principle
+Your
+doctrine
+blinded
+you
+Sp
+Then
+don
+t
+you
+believe
+that
+really
+happened
+Dr
+No
+Jesus
+spoke
+in
+parables
+Sp
+I
+was
+not
+taught
+that
+way
+When
+I
+was
+not
+taught
+that
+way
+how
+could
+I
+know
+more
+than
+I
+did
+Ministers
+teach
+as
+I
+did
+all
+the
+time
+The
+way
+you
+say
+it
+is
+all
+new
+to
+me
+Dr
+That
+is
+the
+true
+teaching
+of
+Jesus
+Sp
+Don
+t
+you
+believe
+he
+died
+for
+our
+sins
+Dr
+No
+I
+do
+not
+Did
+Jesus
+die
+to
+please
+God
+Sp
+No
+he
+died
+to
+save
+us
+from
+sin
+Dr
+Do
+you
+mean
+to
+say
+that
+God
+created
+a
+special
+son
+for
+people
+to
+kill
+so
+they
+could
+be
+saved
+Sp
+We
+must
+not
+talk
+against
+God
+Dr
+I
+am
+talking
+against
+erroneous
+teachings
+Sp
+Do
+you
+believe
+in
+such
+things
+Mrs
+W
+Mrs
+H
+W
+I
+do
+now
+Dr
+Jesus
+said
+Except
+ye
+become
+as
+little
+children
+ye
+shall
+not
+enter
+into
+the
+kingdom
+of
+heaven
+What
+do
+children
+do
+They
+ask
+questions
+They
+want
+to
+know
+Did
+you
+seek
+to
+understand
+No
+You
+only
+tried
+to
+teach
+the
+doctrine
+of
+belief
+Did
+you
+ever
+understand
+flowers
+Sp
+They
+belong
+to
+Nature
+We
+must
+not
+worship
+Nature
+Dr
+God
+made
+Nature
+We
+must
+not
+worship
+Nature
+we
+must
+worship
+God
+But
+God
+is
+in
+Nature
+He
+speaks
+to
+us
+through
+Nature
+The
+corrected
+translations
+of
+the
+Bible
+tell
+us
+that
+Jesus
+said
+God
+is
+Spirit
+He
+did
+not
+say
+God
+is
+a
+Spirit
+but
+God
+is
+Spirit
+and
+they
+that
+worship
+Him
+must
+worship
+Him
+in
+Spirit
+and
+in
+truth
+Sp
+I
+never
+heard
+things
+explained
+like
+that
+before
+Dr
+We
+want
+to
+open
+your
+spiritual
+eyes
+so
+that
+you
+can
+see
+God
+is
+Love
+and
+he
+that
+dwelleth
+in
+Love
+dwelleth
+in
+God
+Where
+are
+you
+going
+to
+find
+God
+outside
+of
+yourself
+What
+is
+love
+What
+does
+love
+look
+like
+Sp
+I
+cannot
+describe
+how
+it
+looks
+You
+feel
+it
+Dr
+Love
+is
+the
+fulfillment
+of
+the
+law
+Thou
+shalt
+love
+thy
+neighbor
+as
+thyself
+Sp
+Are
+you
+a
+minister
+Dr
+Not
+as
+you
+understand
+the
+term
+I
+honor
+God
+but
+not
+dogma
+I
+realize
+that
+the
+Universe
+did
+not
+make
+itself
+God
+is
+Spirit
+Power
+the
+Soul
+of
+the
+Universe
+He
+is
+a
+Practical
+Something
+in
+which
+the
+heavenly
+bodies
+all
+move
+If
+we
+want
+to
+understand
+God
+we
+must
+understand
+ourselves
+We
+must
+try
+to
+understand
+why
+we
+are
+living
+beings
+What
+is
+the
+size
+and
+breadth
+of
+mind
+How
+large
+or
+small
+is
+mind
+Sp
+You
+say
+that
+I
+am
+a
+spirit
+and
+that
+I
+am
+talking
+through
+this
+lady
+s
+body
+How
+is
+that
+possible
+You
+also
+say
+that
+I
+bothered
+that
+other
+lady
+Mrs
+A
+Dr
+There
+is
+a
+psychic
+law
+whereby
+spirits
+can
+control
+mortals
+When
+correctly
+followed
+we
+have
+spirit
+communication
+of
+the
+highest
+order
+Perversion
+of
+this
+law
+results
+in
+obsession
+Mrs
+A
+is
+a
+natural
+psychic
+and
+you
+and
+other
+spirits
+came
+into
+her
+magnetic
+aura
+and
+interfered
+with
+her
+life
+She
+came
+to
+California
+to
+be
+helped
+She
+is
+in
+California
+now
+and
+so
+are
+you
+Sp
+California
+How
+did
+I
+get
+here
+Dr
+By
+another
+wonderful
+law
+You
+followed
+her
+The
+obsession
+of
+mortals
+by
+spirits
+is
+a
+fact
+that
+has
+been
+known
+in
+all
+ages
+Sp
+You
+do
+not
+mean
+that
+I
+have
+been
+bothering
+that
+lady
+Dr
+Yes
+and
+would
+have
+helped
+to
+ruin
+her
+life
+Sp
+How
+did
+I
+get
+to
+her
+Dr
+How
+did
+you
+come
+here
+How
+are
+you
+controlling
+the
+body
+of
+Mrs
+Wickland
+Sp
+I
+don
+t
+realize
+that
+I
+have
+ever
+done
+any
+wrong
+Dr
+We
+had
+to
+give
+the
+lady
+the
+electrical
+treatment
+we
+did
+in
+order
+to
+expel
+you
+from
+her
+aura
+You
+are
+not
+the
+only
+one
+that
+has
+been
+removed
+When
+many
+minds
+try
+to
+function
+through
+one
+body
+it
+creates
+a
+disturbance
+Others
+would
+say
+that
+my
+wife
+is
+insane
+just
+now
+because
+she
+is
+a
+woman
+and
+yet
+you
+speaking
+through
+her
+say
+you
+are
+a
+man
+and
+a
+minister
+Another
+mystery
+is
+that
+Mrs
+Wickland
+is
+entirely
+unconscious
+at
+this
+time
+Sp
+How
+did
+I
+come
+to
+this
+body
+Dr
+Spirit
+helpers
+brought
+you
+here
+and
+allowed
+you
+to
+control
+my
+wife
+because
+she
+is
+a
+psychic
+sensitive
+Sp
+I
+did
+not
+mean
+to
+do
+anybody
+harm
+I
+just
+followed
+the
+crowd
+and
+they
+pushed
+me
+in
+I
+did
+not
+know
+any
+one
+in
+particular
+in
+the
+crowd
+I
+was
+blind
+and
+could
+not
+see
+so
+I
+just
+kept
+with
+them
+Dr
+Do
+you
+know
+why
+you
+were
+blind
+You
+had
+lost
+your
+physical
+eyes
+but
+were
+not
+aware
+of
+the
+fact
+You
+were
+in
+the
+spirit
+world
+but
+you
+knew
+nothing
+of
+the
+spiritual
+laws
+You
+were
+in
+what
+the
+Bible
+calls
+outer
+darkness
+Sp
+Does
+outer
+darkness
+mean
+when
+you
+don
+t
+understand
+Dr
+Yes
+When
+you
+lost
+your
+physical
+body
+you
+lost
+your
+physical
+eyes
+but
+you
+did
+not
+know
+it
+and
+since
+you
+did
+not
+understand
+the
+higher
+life
+your
+spiritual
+vision
+was
+not
+open
+Sp
+I
+have
+had
+a
+body
+and
+I
+have
+had
+eyes
+Dr
+You
+have
+a
+spiritual
+body
+but
+you
+were
+mentally
+blind
+Do
+you
+remember
+that
+Paul
+spoke
+of
+a
+natural
+body
+and
+a
+spiritual
+body
+First
+that
+which
+is
+natural
+and
+afterward
+that
+which
+is
+spiritual
+Sp
+Do
+you
+mean
+to
+say
+that
+I
+was
+spiritually
+blind
+when
+I
+was
+a
+spiritual
+adviser
+Dr
+Yes
+When
+you
+have
+your
+spiritual
+eyes
+open
+you
+will
+realize
+what
+Jesus
+meant
+when
+He
+said
+I
+and
+my
+Father
+are
+one
+Jesus
+said
+Be
+ye
+therefore
+perfect
+even
+as
+your
+Father
+which
+is
+in
+Heaven
+is
+perfect
+The
+Bible
+says
+Add
+to
+your
+faith
+knowledge
+and
+Jesus
+said
+Know
+the
+truth
+and
+the
+truth
+shall
+make
+you
+free
+The
+Bible
+states
+Blessed
+is
+he
+that
+hath
+part
+in
+the
+first
+resurrection
+that
+is
+obtains
+understanding
+while
+in
+the
+body
+on
+such
+the
+second
+death
+hath
+no
+power
+meaning
+that
+when
+ignorance
+is
+replaced
+by
+understanding
+spiritual
+light
+is
+obtained
+Sp
+Do
+you
+mean
+to
+say
+that
+I
+had
+no
+real
+comprehension
+of
+the
+truth
+Dr
+You
+had
+faith
+but
+you
+did
+not
+have
+knowledge
+you
+only
+had
+orthodoxy
+Sp
+Then
+you
+mean
+that
+all
+my
+followers
+and
+the
+church
+people
+who
+came
+to
+hear
+me
+will
+all
+be
+spiritually
+blind
+Dr
+Many
+of
+them
+may
+be
+if
+they
+follow
+your
+teachings
+If
+you
+look
+you
+will
+probably
+see
+others
+here
+SP
+There
+is
+a
+big
+audience
+here
+and
+they
+are
+all
+listening
+During
+a
+psychic
+circle
+of
+this
+nature
+many
+earthbound
+spirits
+are
+brought
+to
+profit
+by
+the
+experience
+of
+the
+spirit
+who
+is
+controlling
+the
+psychic
+Dr
+It
+is
+our
+own
+stupidity
+that
+keeps
+us
+back
+We
+should
+use
+the
+wonderful
+mind
+that
+God
+gave
+us
+We
+have
+the
+marvelous
+universe
+to
+study
+and
+try
+to
+understand
+Did
+you
+ever
+stop
+to
+think
+how
+fruit
+grows
+You
+plant
+a
+seed
+in
+the
+ground
+it
+decomposes
+and
+out
+of
+it
+grows
+a
+tree
+Sp
+That
+belongs
+to
+Nature
+Dr
+Nature
+is
+the
+body
+of
+God
+God
+is
+All
+in
+All
+You
+taught
+that
+in
+church
+Sp
+I
+have
+said
+that
+many
+times
+but
+I
+did
+not
+see
+it
+as
+you
+do
+Dr
+If
+God
+is
+All
+in
+All
+would
+not
+creation
+itself
+be
+a
+part
+of
+God
+Sp
+I
+never
+thought
+of
+it
+in
+that
+light
+It
+seems
+strange
+that
+while
+I
+gave
+truth
+to
+my
+people
+I
+should
+find
+myself
+in
+this
+darkness
+Say
+are
+you
+a
+minister
+Dr
+No
+I
+am
+not
+but
+I
+try
+to
+understand
+God
+s
+wonders
+and
+the
+meaning
+of
+existence
+Sp
+You
+have
+studied
+the
+Bible
+pretty
+well
+You
+seem
+to
+know
+the
+Bible
+much
+better
+than
+I
+did
+myself
+Dr
+I
+regard
+its
+teachings
+differently
+Sp
+You
+seem
+to
+quote
+the
+Bible
+by
+heart
+I
+should
+like
+to
+have
+you
+write
+down
+all
+you
+have
+told
+me
+I
+should
+like
+to
+have
+your
+statements
+written
+down
+and
+if
+I
+could
+give
+it
+to
+the
+people
+as
+you
+have
+given
+it
+to
+me
+I
+should
+be
+very
+glad
+Dr
+Now
+your
+spiritual
+eyes
+will
+be
+opened
+and
+you
+will
+see
+others
+who
+will
+teach
+you
+the
+same
+things
+Advanced
+spirits
+will
+teach
+you
+how
+to
+progress
+in
+a
+rational
+way
+in
+the
+spirit
+world
+and
+you
+will
+be
+taught
+much
+more
+than
+I
+tell
+you
+You
+will
+not
+be
+in
+the
+dark
+any
+longer
+If
+you
+will
+look
+around
+you
+may
+see
+some
+one
+you
+know
+who
+has
+passed
+on
+Sp
+Should
+we
+call
+them
+back
+Dr
+Call
+them
+back
+from
+where
+Sp
+From
+Heaven
+Dr
+Jesus
+said
+The
+Kingdom
+of
+God
+is
+within
+you
+and
+in
+the
+Bible
+you
+will
+find
+Ye
+are
+the
+temple
+of
+God
+and
+the
+Spirit
+of
+God
+dwelleth
+in
+you
+Sp
+Don
+t
+you
+think
+we
+should
+all
+go
+to
+Heaven
+Dr
+Heaven
+is
+not
+a
+place
+Sp
+We
+must
+have
+some
+place
+to
+stay
+Dr
+Heaven
+is
+a
+condition
+of
+mind
+When
+you
+are
+happy
+is
+that
+not
+Heaven
+The
+more
+happiness
+you
+create
+around
+yourself
+the
+more
+Heaven
+you
+will
+have
+Happiness
+is
+Heaven
+Sp
+But
+we
+have
+to
+be
+in
+some
+place
+Dr
+You
+are
+in
+the
+spirit
+world
+I
+have
+told
+you
+that
+You
+can
+only
+attain
+Heaven
+or
+happiness
+as
+you
+develop
+Sp
+Where
+is
+that
+place
+the
+spirit
+world
+Dr
+It
+surrounds
+the
+physical
+world
+You
+will
+be
+taught
+all
+that
+Jesus
+said
+Seek
+and
+ye
+shall
+find
+knock
+and
+it
+shall
+be
+opened
+unto
+you
+Sp
+There
+are
+many
+people
+here
+Spirits
+Some
+are
+very
+happy
+and
+contented
+and
+they
+seem
+to
+be
+asking
+me
+to
+come
+to
+the
+home
+of
+understanding
+life
+happiness
+and
+the
+spirit
+world
+What
+is
+the
+spirit
+world
+Dr
+That
+is
+the
+world
+of
+the
+spirits
+who
+understand
+Nature
+s
+higher
+laws
+Sp
+Before
+I
+go
+with
+them
+I
+should
+so
+like
+to
+send
+a
+message
+to
+my
+wife
+Will
+somebody
+take
+it
+to
+her
+Mrs
+H
+W
+I
+will
+be
+glad
+to
+Sp
+Tell
+my
+wife
+I
+have
+found
+that
+life
+is
+more
+serious
+than
+I
+thought
+and
+we
+should
+try
+to
+understand
+more
+of
+God
+s
+wonders
+and
+not
+only
+believe
+Spiritual
+vision
+opening
+with
+a
+flood
+of
+understanding
+face
+upturned
+and
+arms
+outstretched
+I
+want
+to
+tell
+my
+wife
+that
+I
+have
+learned
+more
+about
+the
+wonderful
+world
+beyond
+than
+I
+ever
+knew
+before
+My
+spiritual
+eyes
+are
+open
+I
+wish
+so
+much
+that
+she
+could
+accept
+the
+proof
+that
+has
+been
+revealed
+to
+me
+All
+this
+time
+as
+you
+have
+told
+me
+I
+have
+been
+dead
+I
+have
+been
+in
+darkness
+but
+as
+this
+gentleman
+tells
+me
+it
+was
+a
+spiritual
+darkness
+My
+eyes
+are
+open
+and
+I
+can
+now
+see
+A
+beautiful
+world
+lies
+before
+me
+I
+want
+my
+wife
+to
+understand
+these
+things
+so
+that
+she
+will
+not
+be
+in
+the
+dark
+as
+I
+have
+been
+Tell
+her
+not
+to
+have
+belief
+alone
+Investigate
+and
+find
+out
+what
+the
+life
+beyond
+is
+I
+do
+wish
+I
+could
+teach
+about
+the
+beautiful
+land
+beyond
+as
+I
+see
+it
+before
+me
+There
+are
+wonderful
+landscapes
+and
+homes
+of
+all
+descriptions
+My
+eyes
+are
+open
+and
+now
+I
+see
+Here
+is
+one
+beautiful
+home
+and
+there
+another
+A
+man
+stands
+here
+and
+he
+says
+to
+me
+that
+the
+homes
+in
+the
+spirit
+world
+are
+not
+bought
+with
+money
+but
+are
+acquired
+by
+good
+acts
+done
+here
+on
+earth
+This
+man
+this
+teacher
+says
+Be
+unselfish
+and
+have
+love
+for
+others
+then
+you
+will
+have
+a
+beautiful
+home
+in
+the
+spirit
+world
+If
+you
+live
+for
+yourself
+alone
+you
+will
+have
+only
+a
+little
+shanty
+for
+you
+have
+done
+nothing
+to
+help
+your
+fellow
+man
+Give
+help
+to
+others
+and
+serve
+the
+ones
+who
+need
+help
+These
+are
+also
+the
+teachings
+of
+Jesus
+I
+see
+beautiful
+homes
+around
+but
+where
+is
+mine
+I
+have
+none
+I
+have
+not
+seen
+it
+yet
+Dr
+By
+helping
+and
+serving
+others
+you
+will
+soon
+have
+one
+Sp
+I
+want
+my
+wife
+to
+know
+that
+we
+should
+live
+so
+on
+earth
+that
+when
+we
+come
+to
+the
+beautiful
+world
+beyond
+we
+shall
+have
+a
+home
+We
+must
+do
+as
+our
+better
+nature
+tells
+us
+to
+do
+Dr
+Now
+you
+are
+preaching
+an
+excellent
+sermon
+Sp
+I
+am
+not
+preaching
+it
+This
+man
+spirit
+tells
+me
+that
+He
+stands
+right
+here
+by
+me
+He
+says
+The
+Bible
+states
+It
+is
+easier
+for
+a
+camel
+to
+go
+through
+the
+eye
+of
+a
+needle
+than
+for
+a
+rich
+man
+to
+enter
+into
+the
+Kingdom
+of
+God
+He
+says
+I
+will
+illustrate
+to
+you
+what
+a
+home
+would
+be
+if
+a
+man
+sells
+his
+soul
+for
+money
+and
+does
+not
+help
+others
+There
+is
+the
+home
+of
+a
+millionaire
+who
+has
+taken
+money
+from
+the
+poor
+people
+and
+grasped
+all
+he
+could
+In
+the
+spirit
+world
+his
+house
+will
+be
+a
+mere
+hovel
+in
+the
+ground
+for
+he
+could
+not
+enter
+one
+of
+those
+beautiful
+homes
+Those
+homes
+were
+built
+by
+good
+deeds
+done
+for
+others
+and
+not
+for
+self
+He
+will
+have
+to
+work
+through
+service
+to
+an
+understanding
+of
+a
+higher
+condition
+There
+are
+homes
+of
+all
+descriptions
+and
+castles
+too
+This
+teacher
+says
+that
+many
+times
+there
+are
+in
+these
+beautiful
+castles
+poor
+old
+widows
+and
+men
+who
+were
+outcasts
+but
+who
+lived
+for
+others
+and
+not
+for
+self
+Their
+acts
+were
+acts
+of
+kindness
+not
+selfishness
+They
+made
+many
+sacrifices
+There
+are
+many
+homes
+from
+castles
+down
+and
+down
+until
+they
+are
+made
+of
+dirt
+many
+surrounded
+by
+snakes
+a
+miserable
+condition
+through
+which
+the
+selfish
+must
+pass
+Now
+he
+points
+to
+a
+house
+and
+says
+This
+is
+yours
+this
+little
+tiny
+house
+You
+were
+honest
+in
+what
+you
+taught
+so
+you
+have
+a
+house
+even
+though
+small
+Some
+have
+none
+You
+did
+not
+seek
+for
+the
+truth
+you
+accepted
+things
+as
+they
+were
+presented
+to
+you
+Now
+you
+will
+have
+to
+work
+for
+others
+and
+make
+a
+home
+for
+your
+wife
+and
+children
+You
+must
+work
+now
+and
+try
+to
+help
+them
+realize
+the
+beauties
+of
+the
+life
+beyond
+Is
+it
+not
+more
+beautiful
+to
+see
+the
+spirit
+world
+in
+the
+true
+sense
+of
+life
+than
+to
+preach
+the
+gospel
+of
+condemnation
+Why
+should
+we
+not
+open
+our
+spiritual
+eyes
+and
+understand
+God
+as
+He
+is
+instead
+of
+picturing
+Him
+as
+a
+monster
+of
+cruelty
+He
+says
+Christians
+murder
+their
+fellow
+men
+The
+war
+has
+grown
+out
+of
+selfishness
+The
+churches
+will
+soon
+fall
+and
+there
+will
+be
+a
+new
+religion
+that
+will
+bring
+true
+understanding
+and
+all
+people
+on
+earth
+will
+open
+their
+eyes
+and
+see
+the
+real
+truth
+of
+God
+s
+wonderful
+manifestations
+Isn
+t
+it
+wonderful
+How
+I
+wish
+I
+could
+come
+back
+and
+tell
+people
+the
+truth
+as
+I
+see
+it
+now
+I
+would
+tell
+my
+people
+that
+I
+had
+not
+taught
+properly
+and
+so
+had
+not
+helped
+them
+Now
+I
+could
+give
+them
+the
+truth
+and
+help
+them
+I
+would
+not
+need
+to
+tell
+them
+that
+if
+they
+did
+not
+live
+the
+right
+kind
+of
+life
+they
+would
+go
+to
+hell
+Hell
+is
+only
+ignorance
+and
+selfishness
+If
+only
+I
+could
+give
+this
+truth
+to
+my
+followers
+How
+I
+wish
+I
+could
+go
+back
+and
+preach
+what
+I
+know
+now
+I
+would
+work
+to
+help
+them
+to
+a
+spiritual
+understanding
+and
+I
+would
+not
+teach
+condemnation
+as
+I
+sometimes
+did
+I
+would
+try
+to
+help
+them
+open
+their
+eyes
+and
+understand
+what
+life
+really
+is
+I
+wish
+that
+they
+could
+see
+the
+beautiful
+land
+and
+homes
+that
+I
+have
+seen
+I
+will
+work
+and
+work
+hard
+to
+make
+a
+home
+for
+my
+wife
+and
+children
+The
+home
+I
+want
+is
+not
+mine
+yet
+but
+I
+have
+a
+small
+beginning
+I
+will
+work
+to
+give
+my
+wife
+and
+children
+the
+home
+I
+have
+always
+wanted
+them
+to
+have
+What
+is
+this
+With
+great
+excitement
+This
+man
+says
+this
+is
+the
+lower
+sphere
+I
+see
+where
+ignorant
+spirits
+travel
+in
+darkness
+Here
+is
+another
+scene
+which
+is
+the
+result
+of
+my
+work
+How
+sick
+these
+spirits
+are
+and
+how
+crippled
+They
+are
+blind
+and
+grasping
+Dr
+They
+are
+showing
+you
+the
+lower
+earth
+sphere
+Sp
+This
+man
+says
+they
+are
+showing
+me
+the
+result
+of
+orthodox
+teaching
+Look
+at
+those
+drunkards
+and
+murderers
+Dr
+They
+are
+now
+showing
+you
+these
+scenes
+so
+when
+you
+leave
+this
+body
+and
+begin
+to
+progress
+you
+can
+better
+help
+others
+Sp
+He
+says
+this
+is
+a
+condition
+which
+false
+teachings
+and
+human
+selfishness
+have
+created
+These
+spirits
+look
+like
+snakes
+Look
+at
+the
+nails
+on
+their
+hands
+This
+is
+terrible
+Some
+are
+on
+their
+knees
+crawling
+and
+some
+are
+on
+all
+fours
+That
+and
+that
+and
+that
+is
+my
+work
+Oh
+God
+This
+is
+the
+result
+of
+wrong
+teaching
+It
+is
+terrible
+Now
+this
+man
+shows
+me
+an
+asylum
+of
+crazy
+people
+and
+there
+are
+crazy
+spirits
+around
+them
+all
+Oh
+that
+is
+hell
+hell
+They
+shout
+and
+howl
+What
+a
+sight
+what
+a
+horrible
+sight
+They
+are
+showing
+me
+the
+real
+things
+Here
+is
+a
+human
+being
+with
+three
+or
+four
+spirits
+crawling
+on
+him
+Now
+he
+shows
+me
+another
+place
+it
+is
+this
+place
+here
+Institute
+Hall
+There
+is
+a
+Spirit
+Home
+built
+within
+this
+room
+an
+Inner
+Hall
+There
+are
+many
+spirits
+here
+He
+says
+We
+take
+them
+from
+obsessed
+mortals
+and
+bring
+them
+into
+this
+Hall
+and
+keep
+them
+there
+until
+we
+can
+convert
+them
+Often
+we
+must
+have
+them
+control
+this
+psychic
+to
+bring
+them
+to
+an
+understanding
+By
+bringing
+one
+to
+an
+understanding
+the
+door
+is
+opened
+for
+many
+others
+One
+or
+two
+are
+allowed
+to
+control
+and
+the
+others
+see
+how
+they
+are
+enlightened
+and
+then
+they
+learn
+that
+they
+also
+must
+go
+with
+friendly
+spirits
+to
+the
+world
+beyond
+Let
+us
+preach
+the
+gospel
+of
+truth
+so
+there
+will
+not
+be
+this
+earthbound
+spirit
+condition
+caused
+by
+ignorance
+and
+selfishness
+If
+only
+I
+could
+return
+to
+help
+preach
+this
+great
+truth
+that
+I
+have
+found
+Dr
+Now
+you
+have
+been
+shown
+the
+way
+and
+you
+must
+go
+with
+these
+advanced
+spirits
+who
+will
+help
+you
+Sp
+Will
+I
+go
+with
+that
+man
+Dr
+Yes
+He
+will
+teach
+you
+many
+great
+truths
+Sp
+He
+says
+that
+it
+is
+false
+teaching
+of
+ministers
+which
+brings
+people
+to
+this
+hell
+He
+says
+I
+must
+go
+but
+before
+I
+go
+I
+want
+to
+thank
+you
+all
+for
+helping
+me
+to
+a
+home
+in
+the
+spirit
+world
+To
+Mr
+A
+He
+also
+wants
+me
+to
+ask
+you
+to
+please
+forgive
+me
+I
+meant
+no
+wrong
+to
+your
+wife
+it
+was
+only
+ignorance
+on
+my
+part
+To
+Mrs
+A
+I
+want
+to
+ask
+you
+to
+forgive
+me
+I
+will
+help
+you
+all
+I
+can
+but
+not
+before
+I
+know
+how
+I
+will
+do
+all
+within
+my
+power
+to
+help
+you
+become
+free
+from
+the
+condition
+you
+are
+in
+Now
+I
+see
+those
+around
+you
+Fight
+and
+we
+will
+help
+you
+win
+I
+also
+want
+to
+thank
+you
+Mrs
+W
+for
+helping
+me
+because
+this
+man
+says
+you
+helped
+me
+to
+an
+understanding
+God
+bless
+you
+and
+my
+dear
+wife
+Please
+bring
+this
+message
+to
+her
+Three
+years
+after
+the
+above
+experience
+when
+Mrs
+H
+W
+was
+again
+present
+in
+our
+circle
+the
+spirit
+of
+Pastor
+Nelson
+returned
+and
+spoke
+through
+the
+psychic
+EXPERIENCE
+MARCH
+Spirit
+J
+NELSON
+PSYCHIC
+MRS
+WICKLAND
+I
+have
+come
+here
+tonight
+to
+thank
+you
+all
+for
+the
+help
+I
+received
+in
+this
+little
+circle
+You
+gave
+me
+the
+truth
+and
+I
+also
+learned
+that
+I
+had
+unconsciously
+been
+obsessing
+some
+one
+I
+wish
+all
+could
+understand
+and
+know
+the
+laws
+that
+govern
+the
+spirit
+conditions
+on
+this
+earth
+life
+I
+was
+not
+a
+bad
+spirit
+but
+I
+was
+ignorant
+of
+the
+laws
+I
+should
+have
+been
+much
+more
+enlightened
+because
+I
+used
+to
+preach
+to
+people
+and
+try
+to
+help
+them
+understand
+the
+real
+life
+but
+how
+few
+ministers
+who
+stand
+in
+the
+pulpit
+today
+give
+out
+the
+truth
+They
+all
+know
+there
+is
+a
+life
+after
+this
+but
+they
+cling
+to
+the
+old
+orthodox
+belief
+Some
+are
+ready
+to
+grasp
+the
+truth
+and
+some
+are
+not
+I
+thank
+you
+for
+helping
+me
+I
+felt
+like
+saying
+I
+was
+in
+hell
+because
+of
+those
+electric
+sparks
+for
+I
+thought
+the
+devil
+himself
+was
+after
+me
+but
+I
+was
+brought
+to
+a
+realization
+of
+what
+I
+should
+have
+done
+when
+in
+life
+and
+that
+I
+should
+not
+obsess
+any
+one
+To
+Mrs
+H
+W
+I
+also
+want
+to
+thank
+you
+Mrs
+W
+for
+helping
+me
+and
+to
+ask
+your
+forgiveness
+for
+having
+obsessed
+your
+daughter
+But
+I
+assure
+you
+I
+did
+it
+unconsciously
+I
+did
+not
+realize
+the
+laws
+that
+govern
+I
+was
+not
+taught
+myself
+I
+thought
+I
+was
+teaching
+my
+people
+about
+the
+real
+life
+but
+I
+was
+not
+I
+preached
+about
+Christ
+dying
+for
+our
+sins
+that
+you
+must
+believe
+and
+faith
+will
+make
+you
+free
+That
+is
+not
+so
+To
+faith
+we
+must
+add
+knowledge
+and
+that
+will
+make
+us
+free
+so
+the
+Good
+Book
+says
+I
+did
+not
+preach
+that
+I
+taught
+to
+faith
+add
+belief
+and
+you
+will
+be
+saved
+How
+very
+little
+ministers
+do
+to
+help
+uplift
+people
+or
+to
+give
+them
+a
+right
+understanding
+of
+God
+We
+always
+tell
+them
+to
+believe
+believe
+We
+do
+not
+want
+people
+to
+have
+knowledge
+because
+then
+they
+begin
+to
+ask
+questions
+that
+we
+cannot
+answer
+so
+we
+tell
+them
+to
+believe
+and
+have
+patience
+and
+they
+will
+be
+saved
+Why
+should
+we
+not
+teach
+them
+the
+real
+truth
+and
+have
+them
+understand
+God
+and
+life
+in
+the
+true
+sense
+The
+time
+is
+coming
+when
+the
+ministers
+cannot
+preach
+the
+old
+dogmas
+to
+the
+people
+They
+will
+have
+to
+change
+if
+they
+want
+the
+people
+to
+fill
+their
+churches
+I
+know
+I
+was
+not
+a
+good
+minister
+I
+mean
+I
+was
+not
+popular
+I
+could
+never
+hold
+my
+people
+because
+I
+did
+not
+have
+my
+whole
+heart
+and
+soul
+in
+the
+work
+I
+felt
+that
+we
+should
+believe
+but
+at
+times
+a
+strong
+power
+came
+to
+me
+and
+I
+felt
+that
+I
+should
+have
+more
+real
+knowledge
+of
+the
+life
+hereafter
+but
+I
+shut
+the
+door
+to
+it
+Now
+I
+am
+sorry
+that
+I
+did
+not
+try
+to
+investigate
+more
+When
+I
+went
+out
+of
+my
+body
+I
+went
+so
+quickly
+that
+I
+did
+not
+realize
+the
+change
+You
+know
+Mrs
+W
+there
+was
+quite
+a
+company
+of
+us
+and
+we
+were
+all
+rushing
+to
+get
+home
+I
+stepped
+over
+to
+the
+other
+track
+and
+another
+train
+which
+I
+did
+not
+see
+coming
+killed
+me
+I
+did
+not
+even
+realize
+that
+I
+was
+hurt
+When
+the
+rest
+of
+them
+went
+home
+I
+went
+with
+them
+I
+went
+to
+my
+home
+but
+I
+did
+not
+realize
+that
+anything
+unusual
+had
+taken
+place
+I
+could
+not
+understand
+things
+I
+went
+first
+to
+one
+then
+another
+but
+nobody
+seemed
+to
+notice
+me
+It
+was
+very
+queer
+I
+did
+not
+know
+what
+to
+do
+Where
+should
+I
+go
+where
+could
+I
+go
+I
+went
+to
+my
+church
+and
+stayed
+there
+still
+I
+did
+not
+realize
+that
+I
+had
+passed
+out
+One
+day
+Mrs
+W
+you
+came
+to
+church
+In
+your
+thoughts
+of
+me
+I
+saw
+a
+light
+because
+I
+was
+in
+darkness
+I
+did
+not
+feel
+sick
+but
+I
+did
+not
+feel
+quite
+myself
+so
+I
+followed
+you
+to
+see
+if
+I
+could
+get
+an
+explanation
+When
+you
+reached
+home
+suddenly
+I
+seemed
+to
+be
+closed
+up
+in
+a
+room
+and
+I
+was
+in
+very
+close
+quarters
+Obsessing
+Mrs
+W
+s
+daughter
+Mrs
+A
+After
+a
+while
+I
+went
+to
+sleep
+I
+slept
+in
+a
+way
+and
+still
+I
+felt
+weak
+and
+had
+such
+a
+strange
+sensation
+There
+were
+several
+others
+with
+me
+but
+I
+cannot
+describe
+the
+condition
+except
+to
+say
+that
+we
+seemed
+to
+be
+in
+a
+room
+too
+small
+for
+us
+We
+were
+all
+packed
+in
+like
+sardines
+I
+could
+hardly
+get
+my
+breath
+Then
+I
+fell
+asleep
+and
+I
+slept
+for
+a
+long
+time
+I
+did
+not
+realize
+anything
+after
+that
+until
+I
+got
+fire
+all
+over
+my
+body
+Static
+electricity
+given
+patient
+There
+seemed
+to
+be
+fire
+all
+over
+me
+and
+I
+could
+not
+realize
+what
+it
+was
+All
+I
+could
+see
+was
+this
+fire
+and
+how
+it
+thundered
+At
+first
+I
+thought
+I
+was
+really
+dead
+and
+in
+hell
+because
+I
+could
+not
+imagine
+anything
+else
+I
+thought
+I
+a
+minister
+trying
+to
+save
+people
+from
+hell
+and
+here
+I
+am
+right
+in
+it
+myself
+Then
+I
+woke
+up
+and
+there
+was
+more
+fire
+but
+before
+I
+knew
+it
+I
+was
+alive
+again
+and
+I
+could
+talk
+which
+I
+could
+not
+do
+before
+Having
+been
+transferred
+to
+Mrs
+Wickland
+While
+I
+did
+not
+know
+I
+was
+dead
+yet
+I
+felt
+I
+had
+to
+come
+to
+life
+again
+I
+found
+I
+had
+been
+brought
+to
+this
+little
+circle
+for
+help
+and
+I
+want
+to
+thank
+you
+all
+for
+waking
+me
+up
+I
+have
+no
+grudge
+against
+you
+for
+having
+given
+me
+that
+hell
+fire
+It
+helped
+me
+from
+hell
+to
+Heaven
+or
+as
+we
+like
+to
+call
+it
+the
+spirit
+world
+I
+found
+the
+hereafter
+very
+different
+from
+anything
+I
+ever
+dreamed
+of
+What
+do
+we
+think
+we
+ministers
+I
+want
+to
+say
+that
+we
+do
+not
+think
+at
+all
+We
+preach
+but
+we
+do
+not
+practice
+We
+do
+not
+realize
+what
+we
+are
+doing
+when
+we
+try
+to
+save
+people
+save
+them
+from
+what
+Since
+I
+left
+you
+and
+you
+gave
+me
+the
+true
+understanding
+of
+life
+as
+it
+is
+I
+have
+seen
+much
+I
+have
+learned
+much
+In
+the
+three
+years
+since
+I
+woke
+up
+I
+do
+not
+say
+three
+years
+since
+I
+passed
+out
+because
+the
+rest
+of
+the
+time
+I
+was
+in
+a
+dream
+state
+but
+in
+the
+three
+years
+since
+I
+have
+had
+an
+understanding
+of
+life
+everything
+has
+been
+so
+beautiful
+and
+I
+have
+been
+very
+happy
+and
+busy
+I
+have
+my
+hands
+full
+with
+my
+work
+My
+mission
+is
+to
+go
+to
+the
+religious
+fanatics
+in
+the
+spirit
+world
+and
+preach
+to
+them
+the
+truth
+They
+are
+in
+darkness
+They
+pray
+and
+sing
+and
+they
+think
+that
+Christ
+died
+for
+their
+sins
+All
+they
+do
+is
+to
+pray
+and
+sing
+and
+they
+do
+not
+get
+anywhere
+There
+are
+many
+people
+on
+the
+earth
+plane
+who
+go
+insane
+but
+they
+are
+only
+controlled
+by
+crazy
+spirits
+who
+are
+religious
+fanatics
+and
+all
+they
+do
+is
+sing
+and
+pray
+They
+are
+wild
+Some
+I
+cannot
+reach
+some
+I
+can
+turn
+to
+an
+understanding
+of
+the
+higher
+life
+I
+hope
+the
+time
+will
+come
+when
+the
+ministers
+who
+preach
+the
+gospel
+will
+preach
+a
+true
+interpretation
+of
+the
+Bible
+not
+the
+one
+Orthodoxy
+teaches
+Mrs
+W
+I
+want
+you
+to
+tell
+the
+Pastor
+of
+your
+church
+that
+I
+said
+he
+must
+not
+hide
+his
+light
+under
+a
+bushel
+but
+must
+teach
+the
+truth
+He
+must
+study
+and
+learn
+the
+true
+lesson
+of
+life
+He
+must
+give
+out
+the
+truth
+to
+his
+people
+Tell
+him
+I
+said
+he
+can
+give
+it
+out
+little
+by
+little
+and
+before
+he
+knows
+it
+he
+will
+have
+given
+them
+the
+whole
+truth
+and
+he
+will
+have
+many
+more
+people
+attending
+his
+church
+than
+he
+has
+now
+People
+do
+not
+believe
+now
+in
+the
+old
+dogmas
+but
+they
+want
+something
+the
+truth
+Tell
+him
+that
+I
+wanted
+you
+to
+say
+this
+to
+him
+I
+have
+found
+my
+home
+in
+the
+spirit
+world
+and
+am
+happy
+but
+I
+have
+a
+great
+deal
+to
+do
+I
+have
+to
+undo
+the
+wrong
+teaching
+I
+gave
+to
+the
+people
+when
+I
+was
+on
+earth
+I
+taught
+dogma
+and
+now
+I
+have
+to
+give
+them
+the
+truth
+Mrs
+W
+please
+forgive
+me
+for
+having
+obsessed
+your
+daughter
+I
+had
+no
+intention
+of
+doing
+what
+I
+did
+for
+I
+did
+it
+unconsciously
+Before
+I
+go
+I
+want
+to
+ask
+a
+favor
+of
+you
+Mrs
+W
+and
+that
+is
+tell
+Rev
+W
+to
+study
+and
+look
+into
+the
+truth
+before
+he
+comes
+to
+the
+spirit
+world
+so
+he
+will
+not
+be
+in
+darkness
+as
+I
+was
+Tell
+him
+he
+can
+give
+the
+truth
+to
+his
+people
+because
+the
+majority
+are
+ready
+for
+it
+It
+is
+very
+monotonous
+to
+sit
+and
+listen
+to
+the
+old
+time
+dogmas
+over
+and
+over
+again
+Tell
+him
+I
+said
+if
+he
+does
+not
+do
+this
+people
+will
+leave
+his
+church
+He
+is
+a
+good
+speaker
+and
+a
+good
+man
+and
+if
+he
+teaches
+the
+real
+truth
+as
+he
+will
+find
+it
+if
+he
+studies
+he
+will
+have
+many
+followers
+but
+if
+he
+keeps
+on
+with
+the
+old
+doctrine
+he
+will
+not
+have
+many
+attending
+his
+church
+If
+he
+interests
+his
+congregation
+and
+has
+a
+revival
+meeting
+to
+tell
+them
+he
+has
+found
+the
+real
+truth
+he
+will
+see
+things
+will
+soon
+be
+different
+Nearly
+every
+one
+in
+his
+church
+has
+been
+to
+some
+Spiritualist
+meeting
+They
+want
+the
+truth
+so
+tell
+him
+to
+give
+it
+to
+them
+Tell
+him
+the
+old
+people
+in
+the
+Home
+should
+be
+rightly
+taught
+because
+they
+will
+soon
+come
+to
+the
+spirit
+side
+of
+life
+and
+it
+is
+better
+that
+they
+should
+know
+about
+the
+land
+they
+are
+going
+to
+The
+young
+men
+of
+the
+present
+day
+do
+not
+want
+to
+be
+orthodox
+ministers
+They
+want
+other
+doctrines
+They
+know
+the
+old
+dogma
+is
+not
+the
+real
+truth
+and
+they
+do
+not
+want
+to
+preach
+contrary
+to
+their
+knowledge
+There
+are
+not
+many
+applications
+for
+the
+ministry
+now
+Tell
+Rev
+W
+if
+he
+will
+preach
+the
+truth
+he
+will
+have
+many
+young
+people
+in
+his
+church
+Tell
+him
+to
+present
+the
+ideas
+of
+the
+founder
+of
+his
+church
+John
+Wesley
+the
+founder
+of
+the
+Methodist
+Church
+lectured
+on
+spirit
+phenomena
+All
+he
+has
+to
+do
+is
+to
+present
+Wesley
+s
+doctrine
+Now
+I
+must
+go
+Good
+Night
+CHAPTER
+XIV
+Christian
+Science
+THE
+domination
+of
+any
+one
+fixed
+opinion
+to
+the
+exclusion
+of
+further
+mental
+growth
+holds
+the
+spirit
+in
+a
+state
+of
+nonprogression
+as
+has
+been
+attested
+by
+intelligences
+who
+on
+earth
+had
+held
+strongly
+to
+the
+Christian
+Science
+teaching
+regarding
+the
+non
+existence
+of
+matter
+and
+who
+have
+told
+of
+the
+difficulties
+encountered
+in
+freeing
+themselves
+A
+friend
+of
+ours
+had
+been
+a
+deep
+student
+of
+Christian
+Science
+and
+at
+the
+same
+time
+an
+investigator
+of
+the
+facts
+concerning
+spirit
+return
+Shortly
+after
+he
+had
+passed
+away
+he
+was
+brought
+to
+our
+circle
+to
+be
+awakened
+through
+controlling
+Mrs
+Wickland
+and
+has
+since
+told
+us
+something
+of
+the
+conditions
+in
+the
+spirit
+world
+EXPERIENCE
+JANUARY
+spirit
+MR
+H
+M
+Psychic
+MRS
+WICKLAND
+I
+am
+pleased
+to
+come
+here
+again
+I
+felt
+that
+I
+must
+take
+advantage
+of
+this
+evening
+to
+say
+something
+to
+my
+dear
+wife
+present
+in
+the
+circle
+I
+am
+so
+glad
+I
+can
+talk
+to
+her
+as
+we
+always
+talked
+I
+am
+happy
+she
+is
+here
+God
+bless
+you
+my
+wife
+We
+were
+so
+happy
+together
+I
+would
+not
+care
+to
+come
+back
+here
+at
+all
+if
+it
+were
+not
+that
+she
+is
+still
+on
+earth
+This
+world
+is
+only
+a
+school
+where
+we
+gain
+understanding
+through
+experience
+In
+the
+spirit
+world
+we
+go
+on
+and
+on
+progressing
+but
+before
+we
+can
+progress
+we
+must
+have
+understanding
+of
+the
+spiritual
+laws
+If
+we
+have
+not
+the
+right
+understanding
+then
+we
+remain
+in
+darkness
+and
+hover
+around
+the
+earth
+plane
+I
+am
+pleased
+that
+I
+had
+even
+a
+little
+knowledge
+of
+the
+higher
+life
+for
+when
+I
+reached
+there
+my
+spiritual
+eyes
+were
+open
+and
+I
+could
+see
+and
+realize
+the
+beauties
+of
+the
+spirit
+world
+I
+have
+met
+many
+of
+my
+dear
+friends
+on
+the
+spirit
+side
+of
+life
+Many
+whom
+I
+knew
+are
+still
+in
+darkness
+and
+I
+have
+tried
+to
+help
+them
+understand
+their
+transition
+If
+I
+could
+only
+express
+the
+conditions
+on
+the
+spirit
+side
+of
+life
+so
+that
+you
+would
+get
+the
+full
+meaning
+There
+is
+such
+beauty
+such
+harmony
+I
+have
+to
+thank
+little
+Silver
+Star
+one
+of
+Mrs
+Wickland
+s
+guides
+for
+having
+awakened
+me
+when
+I
+reached
+the
+other
+side
+Even
+with
+my
+knowledge
+of
+the
+other
+world
+I
+might
+have
+slept
+a
+long
+time
+because
+when
+I
+passed
+out
+I
+was
+in
+a
+heavy
+sleep
+from
+an
+opiate
+which
+was
+given
+me
+on
+account
+of
+the
+nature
+of
+my
+sickness
+But
+this
+little
+Indian
+girl
+called
+me
+by
+name
+and
+woke
+me
+up
+and
+brought
+me
+to
+the
+spirit
+world
+You
+know
+I
+had
+been
+sick
+for
+a
+long
+time
+and
+I
+was
+very
+sick
+before
+I
+passed
+out
+I
+made
+my
+mistake
+in
+trying
+for
+so
+long
+to
+cure
+myself
+Christian
+Science
+says
+we
+should
+overcome
+matter
+We
+cannot
+overcome
+matter
+by
+will
+When
+we
+are
+in
+the
+physical
+body
+and
+the
+body
+needs
+certain
+forces
+of
+which
+it
+is
+made
+if
+we
+do
+not
+get
+them
+in
+our
+food
+we
+must
+get
+them
+through
+medicine
+and
+so
+build
+up
+the
+body
+because
+will
+cannot
+conquer
+substance
+God
+has
+given
+us
+a
+will
+to
+use
+as
+a
+force
+in
+Nature
+and
+we
+should
+use
+it
+rightly
+When
+as
+Scientists
+we
+refuse
+to
+do
+this
+we
+must
+suffer
+the
+consequences
+I
+was
+an
+example
+of
+such
+a
+consequence
+I
+went
+into
+Science
+with
+full
+will
+power
+and
+full
+faith
+that
+there
+is
+no
+such
+thing
+as
+matter
+and
+that
+we
+should
+overcome
+it
+I
+tried
+and
+failed
+Mrs
+Eddy
+is
+suffering
+now
+for
+advancing
+that
+idea
+When
+you
+have
+a
+dress
+that
+is
+wearing
+out
+you
+try
+to
+get
+some
+material
+of
+the
+same
+color
+and
+quality
+with
+which
+to
+mend
+the
+dress
+We
+do
+not
+do
+that
+with
+our
+bodies
+We
+think
+the
+body
+should
+develop
+the
+substance
+it
+needs
+when
+it
+wears
+out
+I
+did
+not
+get
+enough
+elements
+in
+my
+food
+to
+build
+up
+my
+physical
+body
+my
+organs
+became
+atrophied
+and
+sluggish
+and
+were
+inactive
+because
+I
+did
+not
+take
+the
+right
+food
+to
+give
+them
+proper
+activity
+I
+should
+have
+gone
+to
+a
+physician
+to
+have
+them
+put
+in
+normal
+condition
+but
+instead
+I
+tried
+to
+use
+my
+will
+to
+make
+them
+work
+I
+tried
+by
+intelligence
+to
+overcome
+and
+build
+up
+the
+weak
+part
+of
+my
+body
+That
+is
+just
+as
+if
+one
+refused
+to
+mend
+a
+worn
+place
+in
+a
+dress
+insisting
+that
+no
+hole
+could
+come
+in
+that
+dress
+I
+was
+just
+as
+foolish
+about
+my
+body
+and
+I
+had
+to
+suffer
+the
+results
+When
+the
+body
+needs
+toning
+up
+we
+must
+do
+something
+to
+tone
+it
+up
+and
+to
+get
+the
+electric
+forces
+set
+right
+I
+passed
+out
+because
+I
+wore
+out
+my
+body
+with
+my
+mind
+and
+did
+not
+feed
+it
+or
+take
+sufficient
+care
+of
+it
+God
+gave
+us
+our
+bodies
+and
+He
+also
+gave
+us
+minds
+to
+take
+care
+of
+them
+If
+we
+become
+one
+sided
+and
+think
+mind
+is
+all
+then
+we
+get
+into
+trouble
+I
+took
+good
+care
+of
+my
+clothes
+but
+how
+little
+I
+took
+care
+of
+my
+body
+If
+I
+had
+paid
+half
+as
+much
+attention
+to
+my
+body
+as
+I
+did
+to
+my
+clothes
+I
+feel
+that
+I
+would
+have
+been
+on
+earth
+today
+Probably
+some
+day
+things
+will
+be
+so
+understood
+that
+there
+will
+be
+no
+death
+I
+mean
+that
+we
+will
+merely
+step
+out
+of
+the
+physical
+body
+into
+the
+spirit
+world
+If
+one
+would
+prepare
+himself
+for
+passing
+out
+of
+the
+body
+as
+he
+does
+for
+a
+journey
+he
+would
+be
+able
+to
+say
+Now
+I
+am
+ready
+to
+go
+I
+am
+through
+with
+this
+world
+It
+is
+time
+for
+me
+to
+go
+and
+I
+want
+to
+go
+to
+the
+spirit
+side
+of
+life
+Then
+there
+would
+be
+no
+dread
+Many
+Christian
+Scientists
+ruin
+their
+bodies
+by
+lack
+of
+right
+care
+and
+often
+go
+as
+far
+as
+I
+did
+they
+use
+will
+no
+reason
+and
+take
+improper
+nourishment
+or
+not
+enough
+I
+knew
+about
+ten
+years
+ago
+that
+I
+should
+attend
+to
+my
+inactive
+organs
+If
+I
+had
+had
+them
+attended
+to
+I
+would
+not
+have
+suffered
+as
+I
+did
+I
+suffered
+a
+great
+deal
+and
+I
+used
+my
+will
+to
+make
+inactive
+parts
+act
+I
+should
+have
+liked
+to
+remain
+on
+earth
+long
+enough
+to
+do
+the
+work
+I
+felt
+I
+should
+do
+but
+I
+will
+do
+the
+work
+on
+the
+spirit
+side
+of
+life
+and
+when
+my
+wife
+comes
+we
+will
+work
+together
+My
+dear
+wife
+if
+I
+had
+thought
+less
+of
+mental
+or
+Christian
+Science
+and
+given
+more
+thought
+to
+the
+material
+side
+of
+things
+then
+you
+would
+be
+in
+a
+better
+position
+than
+you
+are
+now
+I
+really
+lost
+all
+thought
+of
+things
+material
+and
+I
+guess
+I
+thought
+we
+could
+live
+on
+air
+and
+I
+always
+thought
+conditions
+would
+change
+some
+time
+I
+did
+not
+realize
+I
+was
+so
+hypnotized
+in
+my
+work
+that
+I
+hardly
+lived
+in
+the
+material
+world
+If
+it
+had
+not
+been
+for
+my
+wife
+I
+think
+that
+sometimes
+I
+would
+have
+forgotten
+that
+I
+should
+eat
+at
+all
+I
+thank
+God
+she
+was
+not
+so
+deeply
+interested
+in
+the
+work
+as
+I
+because
+then
+there
+might
+be
+two
+dead
+people
+Before
+leaving
+I
+must
+tell
+you
+of
+a
+little
+experience
+When
+I
+passed
+out
+I
+was
+awakened
+by
+hearing
+somebody
+say
+How
+do
+you
+do
+I
+listened
+and
+once
+again
+I
+heard
+the
+quaint
+voice
+of
+my
+little
+friend
+Silver
+Star
+Then
+I
+thought
+I
+must
+be
+in
+California
+because
+I
+remembered
+that
+Dr
+Wickland
+and
+his
+wife
+were
+there
+and
+I
+thought
+that
+Silver
+Star
+was
+speaking
+through
+Mrs
+Wickland
+Nobody
+says
+How
+do
+you
+do
+like
+Silver
+Star
+I
+did
+not
+realize
+that
+I
+had
+passed
+out
+of
+my
+body
+Again
+I
+heard
+Silver
+Star
+say
+How
+do
+you
+do
+in
+her
+strange
+way
+and
+then
+I
+began
+to
+wonder
+where
+I
+was
+All
+at
+once
+I
+seemed
+to
+be
+alive
+again
+Then
+I
+felt
+better
+I
+thought
+I
+must
+have
+gone
+through
+the
+crisis
+of
+my
+sickness
+and
+now
+I
+am
+feeling
+better
+and
+am
+waking
+up
+That
+was
+the
+time
+Silver
+Star
+brought
+me
+in
+to
+control
+Mrs
+Wickland
+I
+realized
+that
+I
+was
+weak
+from
+my
+sickness
+but
+having
+no
+pain
+I
+thought
+I
+was
+getting
+better
+I
+felt
+so
+light
+and
+strong
+that
+my
+first
+thought
+was
+that
+I
+could
+finish
+my
+book
+but
+when
+I
+really
+came
+to
+myself
+I
+heard
+Dr
+Wickland
+talking
+to
+me
+Then
+I
+thought
+Well
+how
+did
+I
+get
+to
+California
+How
+did
+I
+get
+here
+I
+must
+be
+dreaming
+It
+was
+some
+time
+before
+I
+realized
+where
+I
+was
+I
+did
+not
+even
+then
+realize
+that
+I
+was
+controlling
+Doctor
+asked
+me
+who
+I
+was
+I
+thought
+it
+strange
+that
+he
+did
+not
+know
+me
+but
+I
+told
+him
+that
+I
+was
+Mr
+M
+and
+asked
+whether
+he
+did
+not
+know
+me
+Doctor
+was
+very
+much
+surprised
+and
+explained
+as
+gently
+as
+he
+could
+that
+I
+had
+passed
+out
+of
+my
+mortal
+body
+a
+week
+before
+and
+was
+now
+a
+spirit
+That
+was
+the
+first
+time
+I
+realized
+that
+I
+had
+passed
+out
+of
+my
+physical
+body
+into
+a
+spiritual
+body
+It
+was
+very
+pleasant
+to
+think
+that
+I
+had
+wakened
+in
+a
+mortal
+body
+instead
+of
+in
+darkness
+Afterwards
+I
+saw
+many
+of
+my
+friends
+and
+I
+felt
+that
+there
+is
+no
+death
+Doctor
+talked
+to
+me
+for
+a
+while
+and
+then
+my
+father
+mother
+sister
+and
+brother
+all
+came
+to
+me
+and
+they
+brought
+many
+relatives
+and
+friends
+and
+we
+had
+a
+happy
+reunion
+one
+that
+can
+never
+be
+forgotten
+Only
+I
+wanted
+you
+my
+wife
+to
+be
+with
+me
+when
+I
+met
+all
+my
+relatives
+and
+friends
+When
+I
+realized
+that
+I
+was
+using
+an
+earthly
+body
+I
+felt
+sick
+again
+and
+my
+will
+power
+seemed
+to
+fail
+me
+I
+began
+to
+feel
+very
+weak
+and
+a
+sensation
+of
+sickness
+came
+over
+me
+I
+at
+once
+thought
+of
+my
+little
+friend
+Silver
+Star
+and
+she
+said
+I
+must
+throw
+away
+my
+old
+clothes
+because
+I
+had
+no
+use
+for
+my
+old
+body
+for
+I
+had
+new
+clothes
+now
+When
+I
+thought
+of
+my
+spiritual
+body
+I
+arose
+I
+felt
+I
+had
+new
+clothes
+and
+I
+received
+strength
+and
+left
+the
+physical
+altogether
+The
+magnetic
+current
+was
+cut
+and
+I
+dropped
+my
+old
+clothes
+entirely
+I
+was
+then
+lifted
+bodily
+so
+it
+seemed
+and
+I
+felt
+I
+was
+floating
+and
+we
+went
+through
+conditions
+of
+all
+kinds
+I
+felt
+so
+strange
+and
+saw
+so
+much
+that
+I
+grew
+fearful
+so
+they
+told
+me
+to
+shut
+my
+eyes
+and
+keep
+them
+shut
+which
+I
+did
+I
+did
+not
+know
+anything
+after
+that
+until
+they
+placed
+me
+on
+a
+beautiful
+bed
+I
+was
+very
+tired
+and
+all
+I
+wanted
+was
+to
+rest
+just
+rest
+When
+I
+awoke
+from
+that
+sleep
+of
+rest
+my
+relatives
+and
+friends
+were
+around
+me
+Somebody
+said
+Now
+you
+are
+well
+and
+strong
+and
+we
+will
+take
+a
+journey
+to
+our
+home
+in
+the
+spirit
+world
+We
+went
+to
+many
+of
+their
+homes
+Each
+had
+a
+little
+home
+We
+were
+united
+and
+happy
+for
+here
+only
+harmony
+exists
+We
+traveled
+from
+one
+place
+to
+another
+When
+I
+had
+been
+to
+visit
+quite
+a
+few
+friends
+they
+said
+Now
+you
+have
+seen
+the
+spirit
+side
+of
+life
+Here
+we
+are
+not
+idle
+This
+is
+not
+a
+world
+in
+which
+one
+is
+idle
+it
+is
+a
+world
+of
+busy
+minds
+It
+is
+each
+one
+s
+duty
+to
+work
+Now
+you
+are
+strong
+and
+we
+will
+take
+another
+journey
+to
+earth
+I
+wanted
+to
+see
+my
+wife
+so
+much
+You
+were
+in
+my
+mind
+so
+much
+my
+wife
+and
+I
+wanted
+to
+see
+you
+We
+passed
+through
+the
+spirit
+world
+and
+earth
+sphere
+to
+matter
+again
+The
+earth
+is
+a
+little
+globe
+The
+globe
+has
+a
+sphere
+around
+it
+The
+distance
+between
+the
+spirit
+world
+and
+the
+world
+of
+matter
+is
+about
+sixty
+miles
+This
+sphere
+is
+the
+world
+of
+the
+spirits
+in
+darkness
+Christ
+went
+to
+the
+spirits
+in
+darkness
+and
+prison
+the
+prison
+of
+ignorance
+We
+passed
+through
+conditions
+that
+cannot
+be
+described
+the
+most
+hideous
+the
+most
+fiendish
+so
+ugly
+that
+I
+cannot
+describe
+them
+It
+made
+me
+shudder
+to
+see
+the
+condition
+of
+the
+crippled
+minds
+the
+selfish
+minds
+the
+jealous
+minds
+Each
+had
+the
+countenance
+of
+his
+mind
+They
+were
+dressed
+as
+when
+on
+earth
+but
+only
+because
+of
+their
+minds
+They
+were
+like
+vermin
+They
+were
+like
+a
+lot
+of
+worms
+stirred
+up
+and
+crawling
+over
+one
+another
+Talk
+about
+hell
+that
+surely
+was
+hell
+They
+told
+me
+that
+was
+the
+earthbound
+sphere
+Then
+we
+came
+to
+matter
+again
+We
+saw
+the
+people
+walking
+around
+in
+a
+life
+of
+matter
+each
+one
+in
+some
+kind
+of
+business
+It
+looked
+like
+a
+world
+of
+ants
+and
+each
+one
+seemed
+to
+have
+some
+of
+these
+evil
+minded
+spirits
+clinging
+to
+him
+They
+are
+like
+the
+barnacles
+on
+boats
+some
+are
+shaken
+off
+but
+others
+come
+on
+I
+cannot
+describe
+the
+sight
+I
+have
+been
+with
+you
+my
+wife
+You
+have
+felt
+me
+I
+could
+not
+impress
+you
+because
+I
+was
+not
+strong
+enough
+to
+use
+my
+mind
+for
+that
+purpose
+but
+still
+you
+have
+felt
+me
+It
+has
+only
+been
+a
+little
+because
+I
+had
+not
+strength
+enough
+to
+come
+closer
+I
+am
+with
+you
+a
+great
+deal
+After
+I
+learn
+in
+spirit
+how
+to
+overcome
+matter
+then
+I
+can
+come
+to
+you
+and
+help
+you
+I
+will
+build
+a
+home
+for
+you
+in
+the
+spirit
+world
+and
+when
+that
+home
+is
+finished
+and
+your
+work
+here
+is
+done
+then
+I
+shall
+be
+the
+one
+to
+meet
+you
+and
+we
+will
+have
+a
+real
+home
+I
+want
+to
+thank
+you
+all
+for
+the
+privilege
+of
+coming
+to
+your
+little
+circle
+and
+would
+like
+to
+come
+again
+some
+other
+time
+An
+extract
+from
+another
+communication
+from
+Mr
+H
+M
+follows
+the
+same
+line
+of
+thought
+as
+the
+previous
+remarks
+EXPERIENCE
+NOVEMBER
+Spirit
+MR
+H
+M
+Psychic
+MRS
+WICKLAND
+I
+wish
+that
+I
+had
+had
+less
+belief
+that
+I
+could
+cure
+myself
+by
+thought
+Everything
+that
+God
+has
+put
+in
+Nature
+is
+for
+man
+to
+use
+not
+misuse
+We
+should
+not
+condemn
+anything
+that
+God
+has
+given
+the
+world
+to
+use
+but
+we
+have
+so
+many
+beliefs
+and
+creeds
+that
+we
+forget
+the
+principle
+of
+our
+Maker
+If
+we
+would
+understand
+His
+wonderful
+work
+through
+Nature
+we
+would
+love
+others
+better
+than
+we
+do
+Do
+not
+condemn
+anything
+but
+teach
+men
+and
+women
+to
+love
+each
+other
+teach
+them
+to
+know
+what
+their
+duties
+are
+in
+this
+mundane
+sphere
+Those
+on
+earth
+have
+so
+many
+creeds
+and
+fads
+that
+they
+drown
+themselves
+in
+their
+faith
+forgetting
+that
+it
+is
+their
+duty
+to
+help
+the
+weak
+ones
+instead
+of
+stepping
+on
+their
+feet
+So
+it
+is
+also
+with
+the
+body
+God
+gave
+us
+to
+take
+care
+of
+and
+not
+misuse
+For
+my
+part
+I
+should
+have
+done
+more
+to
+learn
+what
+was
+the
+matter
+with
+me
+instead
+of
+only
+thinking
+there
+was
+nothing
+the
+matter
+that
+I
+only
+imagined
+it
+and
+that
+there
+was
+no
+such
+thing
+as
+sickness
+If
+I
+had
+not
+hypnotized
+myself
+in
+that
+belief
+of
+Mrs
+Eddy
+s
+that
+mind
+should
+overcome
+matter
+and
+that
+it
+is
+only
+our
+mortal
+mind
+that
+is
+so
+called
+sick
+and
+we
+have
+not
+the
+right
+understanding
+if
+I
+had
+tried
+to
+find
+out
+what
+was
+the
+matter
+with
+me
+and
+called
+on
+some
+physician
+one
+who
+had
+studied
+anatomy
+and
+the
+philosophy
+of
+life
+one
+who
+had
+spent
+years
+in
+studying
+human
+nature
+and
+the
+human
+body
+I
+should
+have
+been
+better
+off
+Christian
+Scientists
+condemn
+physicians
+yet
+physicians
+have
+devoted
+their
+lives
+through
+centuries
+to
+the
+study
+and
+control
+of
+all
+sickness
+Should
+we
+condemn
+them
+and
+say
+there
+is
+no
+such
+thing
+as
+sickness
+Why
+should
+anybody
+condemn
+another
+who
+has
+devoted
+his
+whole
+life
+to
+study
+Christian
+Science
+says
+there
+is
+no
+such
+thing
+as
+sickness
+and
+that
+you
+are
+not
+in
+the
+understanding
+Suppose
+that
+in
+olden
+times
+we
+had
+held
+the
+theory
+that
+there
+is
+no
+matter
+How
+about
+Harvey
+He
+discovered
+the
+circulation
+of
+the
+blood
+Poor
+man
+He
+was
+killed
+because
+of
+his
+discovery
+he
+was
+killed
+by
+ignorant
+people
+who
+did
+not
+believe
+the
+truth
+So
+one
+thing
+after
+another
+has
+been
+discovered
+in
+human
+anatomy
+Yet
+Christian
+Scientists
+discard
+that
+altogether
+and
+also
+say
+that
+there
+is
+no
+such
+thing
+as
+the
+body
+I
+did
+not
+take
+care
+of
+the
+body
+that
+God
+gave
+me
+I
+thought
+mind
+should
+overcome
+it
+If
+I
+had
+consulted
+a
+physician
+I
+might
+even
+be
+with
+you
+today
+Do
+not
+let
+yourselves
+be
+hypnotized
+by
+ideas
+Every
+theory
+has
+some
+good
+in
+it
+but
+let
+us
+take
+the
+good
+and
+discard
+the
+rest
+As
+Mrs
+Eddy
+now
+sees
+these
+things
+she
+wishes
+she
+could
+correct
+many
+of
+her
+statements
+She
+now
+has
+to
+suffer
+for
+her
+mistakes
+and
+it
+is
+very
+hard
+for
+her
+Her
+followers
+come
+to
+the
+spirit
+side
+of
+life
+and
+expect
+to
+find
+things
+as
+she
+taught
+them
+Mrs
+Eddy
+herself
+has
+spoken
+in
+our
+circle
+several
+times
+and
+has
+brought
+invisible
+audiences
+which
+she
+endeavored
+to
+free
+from
+the
+misconceptions
+acquired
+from
+her
+teachings
+relating
+to
+the
+problems
+of
+life
+and
+matter
+EXPERIENCE
+FEBRUARY
+Spirit
+MARY
+BAKER
+EDDY
+Psychic
+MRS
+WICKLAND
+I
+am
+here
+again
+and
+I
+feel
+so
+sad
+Do
+not
+doubt
+me
+do
+not
+doubt
+me
+Why
+will
+people
+doubt
+me
+Help
+me
+God
+help
+me
+I
+am
+in
+a
+terrible
+condition
+I
+knew
+about
+the
+wonderful
+truth
+of
+the
+life
+beyond
+I
+knew
+it
+well
+while
+in
+life
+but
+I
+shut
+the
+door
+because
+I
+wanted
+a
+religion
+of
+my
+own
+Spiritualism
+belonged
+to
+the
+past
+days
+I
+wanted
+something
+new
+something
+higher
+something
+better
+than
+spirit
+return
+I
+taught
+that
+you
+must
+not
+let
+any
+entities
+control
+you
+or
+influence
+you
+or
+give
+you
+any
+inspiration
+but
+that
+you
+must
+be
+Yourself
+and
+develop
+yourself
+and
+be
+one
+with
+the
+Infinite
+Shut
+the
+door
+to
+the
+spirit
+world
+and
+be
+selfish
+that
+was
+I
+I
+had
+the
+truth
+of
+healing
+the
+sick
+I
+was
+a
+medium
+and
+in
+my
+younger
+days
+my
+childhood
+I
+was
+obsessed
+As
+I
+grew
+older
+no
+one
+knew
+what
+was
+the
+matter
+with
+me
+for
+I
+had
+such
+queer
+spells
+Now
+I
+know
+what
+it
+was
+an
+influence
+was
+controlling
+me
+whenever
+I
+had
+the
+spells
+I
+was
+of
+a
+very
+nervous
+temperament
+and
+I
+was
+cured
+of
+those
+spells
+by
+Dr
+Quimby
+He
+believed
+in
+the
+work
+of
+obsession
+I
+took
+some
+of
+his
+doctrine
+and
+used
+it
+for
+my
+own
+The
+doctrine
+would
+have
+been
+all
+right
+if
+I
+had
+not
+denied
+the
+finer
+forces
+in
+Nature
+I
+denied
+matter
+but
+friends
+as
+I
+told
+you
+one
+time
+I
+had
+a
+vision
+and
+I
+saw
+how
+they
+treated
+patients
+in
+the
+other
+world
+but
+at
+that
+time
+I
+thought
+it
+was
+a
+dream
+They
+were
+teaching
+the
+spirits
+that
+there
+is
+no
+such
+thing
+as
+matter
+They
+said
+Forget
+it
+is
+is
+only
+imagination
+You
+are
+not
+sick
+you
+just
+imagine
+it
+That
+belongs
+to
+matter
+That
+is
+only
+your
+mortal
+mind
+You
+should
+overcome
+and
+develop
+the
+spirit
+within
+you
+I
+thought
+that
+this
+vision
+meant
+that
+I
+was
+to
+teach
+that
+on
+earth
+and
+I
+set
+to
+work
+Now
+I
+see
+my
+mistake
+because
+there
+is
+matter
+and
+so
+long
+as
+you
+live
+on
+the
+material
+plane
+you
+will
+have
+to
+recognize
+matter
+When
+you
+reach
+the
+spirit
+side
+of
+life
+your
+mind
+has
+to
+be
+taught
+to
+overcome
+matter
+not
+cling
+to
+it
+because
+spirits
+in
+darkness
+are
+clinging
+to
+matter
+as
+much
+as
+we
+cling
+to
+matter
+when
+we
+have
+our
+physical
+bodies
+I
+took
+this
+and
+taught
+it
+and
+started
+on
+my
+work
+It
+was
+so
+misunderstood
+because
+I
+could
+not
+myself
+explain
+why
+matter
+was
+not
+If
+only
+I
+could
+get
+people
+to
+recognize
+matter
+and
+recognize
+the
+truth
+of
+life
+after
+this
+If
+I
+could
+only
+go
+back
+to
+my
+Church
+and
+teach
+the
+truth
+the
+genuine
+Truth
+of
+God
+God
+is
+the
+Spirit
+of
+the
+Universe
+and
+we
+are
+a
+part
+of
+that
+Great
+Spirit
+Understanding
+this
+we
+can
+overcome
+matter
+You
+are
+in
+the
+material
+body
+and
+you
+become
+sick
+You
+become
+sick
+because
+there
+is
+a
+lack
+of
+something
+in
+your
+body
+which
+you
+must
+have
+some
+element
+that
+helps
+in
+some
+way
+or
+another
+But
+your
+mind
+can
+help
+to
+overcome
+If
+I
+had
+taught
+that
+instead
+of
+denying
+matter
+altogether
+it
+would
+have
+been
+so
+much
+better
+I
+wanted
+money
+and
+we
+concentrated
+to
+have
+the
+grandest
+churches
+in
+the
+world
+My
+aim
+was
+to
+have
+churches
+of
+my
+own
+teaching
+all
+over
+the
+universe
+I
+lost
+the
+opportunity
+to
+develop
+people
+s
+finer
+nature
+the
+finer
+nature
+of
+men
+and
+women
+because
+I
+shut
+the
+door
+of
+love
+and
+sympathy
+Do
+not
+doubt
+who
+this
+is
+do
+not
+doubt
+me
+I
+am
+here
+I
+am
+here
+I
+am
+no
+more
+than
+any
+human
+being
+Mine
+was
+a
+life
+which
+did
+not
+do
+what
+it
+ought
+I
+want
+to
+be
+helped
+My
+people
+come
+to
+me
+and
+want
+help
+and
+I
+need
+help
+myself
+They
+cling
+to
+me
+and
+hold
+me
+down
+and
+I
+shut
+the
+door
+for
+their
+happiness
+We
+have
+only
+one
+mind
+You
+understand
+where
+I
+got
+the
+mortal
+mind
+part
+from
+I
+thought
+that
+should
+be
+taught
+here
+but
+it
+should
+only
+be
+taught
+beyond
+the
+grave
+beyond
+the
+veil
+and
+only
+to
+the
+earthbound
+spirits
+who
+are
+in
+darkness
+and
+cling
+to
+matter
+That
+should
+be
+taught
+on
+the
+spirit
+side
+of
+life
+and
+not
+on
+the
+earth
+plane
+Have
+love
+and
+sympathy
+and
+do
+the
+very
+best
+you
+know
+how
+for
+others
+I
+could
+not
+leave
+this
+matter
+alone
+and
+I
+do
+not
+feel
+that
+I
+should
+because
+it
+crushes
+me
+so
+I
+came
+to
+this
+circle
+because
+so
+many
+have
+been
+helped
+here
+I
+go
+from
+one
+place
+to
+another
+and
+you
+will
+hear
+of
+me
+at
+different
+intervals
+because
+I
+can
+explain
+to
+a
+few
+at
+each
+place
+and
+in
+that
+way
+people
+will
+wake
+up
+We
+cannot
+do
+much
+yet
+but
+will
+you
+allow
+me
+to
+come
+here
+once
+in
+a
+while
+when
+I
+see
+I
+can
+be
+helped
+You
+know
+I
+have
+so
+many
+people
+who
+hold
+me
+down
+and
+say
+Why
+did
+you
+teach
+this
+Why
+did
+you
+shut
+the
+door
+for
+us
+Give
+us
+light
+give
+us
+light
+and
+understanding
+So
+many
+people
+are
+here
+but
+they
+cling
+to
+matter
+So
+many
+of
+my
+people
+are
+here
+and
+in
+talking
+with
+you
+I
+talk
+to
+them
+You
+understand
+I
+knew
+the
+real
+truth
+but
+I
+shut
+the
+door
+I
+cannot
+open
+the
+door
+to
+many
+of
+my
+followers
+because
+I
+shut
+the
+door
+for
+them
+and
+closed
+the
+door
+for
+myself
+and
+when
+they
+pass
+out
+the
+door
+is
+closed
+They
+want
+me
+to
+help
+them
+and
+when
+I
+explain
+things
+to
+them
+in
+the
+true
+light
+they
+doubt
+me
+and
+say
+that
+I
+am
+not
+Mrs
+Eddy
+because
+she
+did
+not
+preach
+such
+lessons
+I
+thank
+you
+for
+giving
+me
+this
+little
+time
+Tonight
+many
+of
+my
+followers
+came
+with
+me
+and
+through
+my
+talk
+to
+you
+they
+will
+be
+helped
+Their
+subconsciousness
+which
+is
+asleep
+must
+be
+awakened
+Question
+Is
+the
+little
+pamphlet
+recently
+published
+called
+Confession
+by
+Mrs
+Eddy
+from
+the
+Spirit
+World
+authentic
+Spirit
+Certainly
+it
+is
+I
+am
+trying
+through
+every
+avenue
+to
+speak
+I
+am
+not
+going
+to
+stop
+here
+I
+will
+take
+advantage
+of
+every
+chance
+there
+is
+for
+me
+to
+tell
+the
+truth
+and
+reach
+my
+people
+You
+may
+hear
+from
+others
+that
+I
+have
+talked
+with
+them
+I
+will
+bring
+up
+the
+above
+subject
+here
+and
+there
+People
+doubt
+me
+now
+but
+I
+shall
+keep
+on
+I
+will
+not
+rest
+We
+will
+have
+centers
+for
+the
+work
+I
+want
+you
+here
+to
+help
+me
+spread
+the
+news
+not
+much
+just
+a
+little
+thought
+now
+and
+then
+will
+help
+I
+will
+get
+my
+people
+together
+and
+bring
+them
+here
+and
+talk
+to
+them
+if
+I
+may
+come
+once
+in
+a
+while
+for
+I
+can
+reach
+them
+more
+easily
+when
+I
+control
+a
+mortal
+body
+God
+bless
+you
+all
+and
+again
+I
+thank
+you
+for
+the
+privilege
+of
+having
+this
+opportunity
+of
+speaking
+to
+some
+of
+my
+people
+and
+helping
+them
+Further
+evidence
+of
+the
+fact
+that
+Mrs
+Eddy
+when
+on
+earth
+knew
+the
+truth
+regarding
+the
+spirit
+side
+of
+life
+and
+the
+earthbound
+condition
+is
+found
+in
+one
+of
+the
+early
+editions
+of
+the
+Christian
+Science
+text
+book
+in
+the
+chapter
+on
+The
+Science
+of
+Being
+If
+the
+Principle
+rule
+and
+demonstration
+of
+Being
+are
+not
+in
+the
+least
+understood
+before
+what
+is
+termed
+death
+overtakes
+mortals
+they
+will
+rise
+no
+higher
+in
+the
+scale
+of
+existence
+at
+that
+single
+point
+of
+experience
+but
+will
+remain
+as
+material
+as
+before
+the
+transition
+still
+seeking
+happiness
+through
+a
+material
+instead
+of
+through
+a
+spiritual
+sense
+of
+Life
+and
+from
+selfish
+and
+inferior
+motives
+So
+long
+as
+the
+error
+or
+belief
+lasts
+that
+life
+and
+mind
+are
+finite
+and
+physical
+and
+are
+manifested
+through
+brain
+and
+nerves
+so
+long
+the
+penalty
+of
+sickness
+sin
+and
+death
+will
+continue
+To
+the
+other
+the
+spiritual
+class
+relates
+the
+scripture
+On
+such
+the
+second
+death
+hath
+no
+power
+A
+spirit
+who
+had
+become
+fanatical
+over
+the
+Christian
+Science
+teachings
+was
+brought
+in
+by
+Mrs
+Eddy
+as
+an
+example
+of
+the
+difficulties
+which
+she
+encountered
+in
+the
+work
+of
+enlightening
+her
+followers
+EXPERIENCE
+JUNE
+Spirit
+NAME
+UNKNOWN
+Psychic
+MRS
+WICKLAND
+Spirit
+What
+kind
+of
+a
+meeting
+is
+this
+Doctor
+This
+meeting
+is
+held
+for
+the
+purpose
+of
+helping
+ignorant
+spirits
+spirits
+in
+darkness
+Sp
+We
+should
+not
+sing
+so
+much
+as
+we
+do
+for
+that
+belongs
+to
+the
+mortal
+mind
+We
+should
+be
+quiet
+and
+concentrate
+our
+minds
+to
+understand
+Dr
+To
+understand
+what
+Sp
+The
+true
+understanding
+Dr
+What
+is
+that
+Sp
+The
+Spirit
+of
+God
+Dr
+And
+what
+is
+that
+Sp
+If
+you
+do
+not
+know
+then
+you
+had
+better
+study
+and
+understand
+Dr
+If
+you
+can
+tell
+us
+something
+about
+God
+or
+Spirit
+we
+should
+all
+be
+glad
+to
+hear
+it
+Sp
+God
+is
+All
+in
+All
+and
+we
+are
+a
+part
+of
+that
+great
+Divinity
+We
+should
+concentrate
+and
+put
+our
+mind
+toward
+the
+Great
+Spirit
+We
+should
+develop
+the
+finer
+forces
+within
+us
+but
+I
+am
+not
+here
+to
+talk
+to
+any
+one
+Dr
+Should
+you
+not
+like
+to
+enlighten
+us
+Sp
+I
+do
+not
+know
+if
+you
+belong
+to
+The
+Church
+Dr
+Did
+you
+not
+say
+that
+God
+is
+All
+in
+All
+Then
+we
+are
+a
+part
+of
+Him
+also
+Sp
+If
+you
+have
+the
+right
+understanding
+you
+are
+If
+you
+do
+not
+have
+that
+understanding
+then
+you
+are
+not
+you
+are
+more
+of
+the
+mortal
+mind
+Dr
+Are
+we
+not
+a
+part
+of
+God
+if
+God
+is
+All
+in
+All
+Sp
+I
+do
+not
+care
+to
+answer
+your
+questions
+Dr
+Is
+the
+mortal
+mind
+also
+of
+God
+What
+happens
+to
+people
+after
+death
+Sp
+I
+have
+nothing
+to
+do
+with
+death
+Dr
+Have
+you
+found
+God
+Sp
+God
+is
+within
+you
+when
+you
+have
+the
+right
+understanding
+of
+His
+wonderful
+works
+Dr
+How
+is
+it
+with
+yourself
+Sp
+I
+am
+one
+with
+that
+Great
+Spirit
+because
+I
+have
+understanding
+Dr
+Understanding
+of
+what
+Sp
+God
+and
+how
+to
+develop
+your
+own
+self
+Dr
+As
+far
+as
+I
+can
+tell
+you
+have
+developed
+selfishness
+Sp
+That
+all
+belongs
+to
+the
+mortal
+mind
+Dr
+What
+happens
+to
+people
+when
+they
+lose
+their
+bodies
+Sp
+They
+go
+back
+to
+the
+Infinite
+Dr
+Where
+do
+they
+go
+Sp
+Don
+t
+you
+know
+I
+know
+but
+I
+do
+not
+care
+to
+speak
+of
+it
+I
+do
+not
+argue
+I
+know
+myself
+but
+I
+do
+not
+like
+to
+teach
+I
+am
+one
+of
+His
+Elect
+Dr
+Then
+you
+do
+not
+like
+to
+teach
+ignorant
+people
+Sp
+No
+I
+do
+not
+Dr
+What
+church
+do
+you
+belong
+to
+Sp
+I
+belong
+to
+The
+Church
+of
+Understanding
+Dr
+Where
+does
+it
+exist
+Sp
+It
+is
+the
+church
+that
+should
+be
+all
+over
+the
+world
+the
+church
+where
+the
+people
+understand
+and
+know
+they
+can
+overcome
+matter
+and
+overcome
+mortal
+mind
+and
+be
+one
+with
+the
+Infinite
+Dr
+Are
+you
+a
+Christian
+Scientist
+Sp
+Yes
+Why
+do
+I
+have
+to
+come
+down
+to
+such
+mortalminded
+people
+Dr
+Don
+t
+you
+think
+you
+must
+have
+made
+some
+misstep
+which
+brought
+you
+down
+to
+such
+people
+as
+we
+are
+Don
+t
+you
+think
+if
+you
+had
+read
+and
+studied
+the
+Bible
+and
+had
+acquired
+an
+understanding
+of
+the
+real
+mystery
+of
+life
+it
+would
+have
+given
+you
+more
+peace
+of
+mind
+Isn
+t
+it
+strange
+that
+you
+should
+come
+down
+to
+such
+common
+clay
+as
+we
+are
+Sp
+I
+suppose
+I
+have
+come
+here
+to
+do
+some
+missionary
+work
+among
+you
+I
+suppose
+I
+came
+to
+teach
+you
+to
+forget
+mortal
+mind
+You
+should
+all
+be
+loving
+and
+kind
+one
+with
+the
+Infinite
+You
+are
+not
+in
+the
+understanding
+I
+may
+have
+come
+to
+lead
+you
+up
+to
+God
+to
+the
+right
+understanding
+I
+must
+help
+you
+all
+to
+understand
+You
+must
+take
+the
+first
+step
+and
+read
+Mrs
+Eddy
+s
+books
+then
+you
+will
+be
+one
+with
+the
+Infinite
+and
+leave
+all
+mortal
+mind
+behind
+You
+go
+on
+and
+on
+You
+have
+to
+go
+through
+a
+great
+deal
+to
+get
+understanding
+You
+can
+be
+led
+up
+to
+the
+Infinite
+God
+if
+you
+read
+and
+study
+You
+have
+not
+understanding
+of
+the
+Infinite
+Dr
+What
+does
+that
+Infinite
+Understanding
+call
+you
+Sp
+I
+do
+not
+care
+to
+talk
+or
+argue
+with
+you
+Dr
+What
+did
+they
+call
+you
+when
+you
+had
+a
+mortal
+mind
+Sp
+Call
+me
+Names
+belong
+to
+the
+mortal
+mind
+and
+I
+have
+nothing
+to
+do
+with
+that
+It
+degrades
+one
+and
+drags
+one
+down
+I
+came
+to
+teach
+you
+regarding
+the
+Infinite
+the
+Spirit
+within
+you
+Dr
+Do
+we
+have
+to
+give
+you
+two
+dollars
+for
+your
+teaching
+Sp
+That
+belongs
+to
+the
+mortal
+mind
+Develop
+the
+Spark
+of
+the
+Divine
+within
+you
+then
+you
+will
+rise
+to
+the
+Infinite
+God
+Dr
+Do
+you
+suppose
+we
+could
+ever
+climb
+so
+high
+Sp
+Yes
+by
+studying
+and
+studying
+It
+is
+the
+only
+salvation
+for
+you
+Dr
+You
+seem
+to
+have
+gone
+so
+far
+that
+you
+cannot
+join
+in
+anything
+with
+us
+Sp
+I
+have
+passed
+beyond
+mortal
+mind
+and
+we
+do
+not
+need
+to
+go
+back
+we
+go
+forward
+Dr
+It
+hurts
+to
+come
+down
+to
+mortal
+mind
+again
+doesn
+t
+it
+There
+is
+an
+old
+saying
+that
+What
+goes
+up
+must
+come
+down
+Sp
+What
+kind
+of
+people
+are
+you
+Dr
+We
+are
+just
+common
+sense
+people
+just
+mortal
+mind
+people
+Sp
+Then
+I
+must
+raise
+you
+to
+a
+higher
+level
+Dr
+What
+is
+your
+name
+Sp
+Just
+call
+me
+Infinite
+Dr
+Christ
+went
+among
+sinners
+Are
+you
+better
+than
+He
+Sp
+I
+am
+one
+with
+the
+Infinite
+God
+myself
+Dr
+Have
+you
+seen
+God
+Sp
+God
+is
+within
+you
+You
+are
+a
+part
+of
+the
+Infinite
+You
+are
+happy
+with
+Him
+the
+God
+of
+the
+Universe
+just
+beautiful
+Bliss
+and
+Harmony
+Dr
+How
+did
+you
+happen
+to
+come
+here
+Sp
+I
+suppose
+I
+came
+to
+be
+your
+teacher
+Dr
+You
+spoke
+of
+going
+forward
+and
+that
+God
+is
+All
+in
+All
+Is
+He
+within
+you
+Sp
+I
+am
+one
+with
+the
+Infinite
+I
+am
+in
+love
+with
+the
+Lord
+and
+the
+Infinite
+You
+people
+here
+are
+still
+in
+your
+mortal
+caskets
+You
+do
+not
+know
+anything
+Dr
+That
+is
+a
+very
+elaborate
+statement
+Sp
+We
+have
+to
+overcome
+it
+is
+just
+an
+error
+Dr
+On
+your
+part
+or
+ours
+Sp
+I
+must
+help
+you
+to
+climb
+higher
+I
+came
+to
+be
+a
+teacher
+to
+you
+all
+to
+help
+you
+to
+understand
+and
+become
+one
+with
+the
+Infinite
+Dr
+Probably
+an
+exchange
+of
+ideas
+might
+be
+helpful
+SP
+I
+do
+not
+need
+any
+teaching
+I
+am
+one
+with
+the
+All
+in
+All
+Dr
+What
+do
+scientists
+think
+will
+happen
+when
+they
+die
+SP
+They
+shall
+be
+a
+part
+of
+the
+Divine
+I
+was
+a
+follower
+in
+one
+of
+the
+churches
+of
+Christian
+Science
+I
+belonged
+to
+the
+Mother
+Church
+in
+Boston
+I
+am
+one
+of
+the
+Elect
+Dr
+Did
+you
+ever
+see
+Mrs
+Eddy
+Sp
+Mrs
+Eddy
+is
+Christ
+Himself
+She
+is
+my
+Christ
+she
+is
+God
+Himself
+She
+is
+the
+most
+wonderful
+woman
+on
+earth
+and
+she
+is
+the
+one
+we
+should
+worship
+Dr
+How
+long
+have
+you
+been
+so
+radical
+on
+that
+subject
+Sp
+I
+will
+not
+answer
+you
+Dr
+How
+long
+has
+Mrs
+Eddy
+been
+dead
+Sp
+I
+do
+not
+care
+to
+argue
+with
+you
+Dr
+Who
+died
+first
+you
+or
+Mrs
+Eddy
+Sp
+With
+asperity
+I
+will
+not
+answer
+your
+questions
+Dr
+I
+did
+not
+think
+you
+had
+so
+much
+malicious
+magnetism
+Sp
+Mrs
+Eddy
+never
+died
+She
+never
+will
+because
+she
+is
+the
+Teacher
+of
+the
+Infinite
+Spirit
+Dr
+Have
+you
+ever
+seen
+Mrs
+Eddy
+Sp
+She
+is
+in
+Boston
+Dr
+She
+is
+dead
+Sp
+She
+is
+not
+dead
+and
+she
+never
+will
+die
+Dr
+Mrs
+Eddy
+died
+several
+years
+ago
+Sp
+Her
+teachings
+were
+that
+she
+would
+never
+die
+She
+will
+go
+from
+the
+mortal
+casket
+into
+the
+Infinite
+Dr
+How
+long
+is
+it
+since
+you
+died
+Sp
+I
+did
+not
+die
+I
+only
+left
+my
+mortal
+casket
+I
+was
+a
+fine
+practitioner
+Dr
+How
+did
+you
+come
+to
+Los
+Angeles
+California
+Sp
+I
+am
+not
+in
+Los
+Angeles
+I
+am
+in
+Boston
+Dr
+Some
+intelligent
+spirits
+have
+brought
+you
+here
+to
+be
+helped
+But
+the
+entity
+was
+so
+wrapped
+in
+her
+own
+ideas
+that
+she
+would
+not
+listen
+to
+anything
+else
+and
+was
+taken
+away
+after
+which
+Mrs
+Eddy
+came
+EXPERIENCE
+JUNE
+Spirit
+MARY
+BAKER
+EDDY
+Psychic
+MRS
+WICKLAND
+Good
+Evening
+I
+am
+Mrs
+Eddy
+Mary
+Baker
+Eddy
+I
+wanted
+to
+come
+back
+here
+again
+to
+give
+you
+one
+demonstration
+of
+what
+I
+have
+had
+to
+deal
+with
+Referring
+to
+preceding
+spirit
+I
+cannot
+do
+anything
+with
+people
+when
+they
+are
+like
+that
+until
+they
+contact
+matter
+again
+I
+feel
+so
+sad
+and
+sorry
+for
+I
+shut
+the
+door
+myself
+I
+want
+you
+to
+let
+me
+come
+here
+and
+extend
+help
+to
+a
+great
+number
+of
+spirits
+by
+speaking
+through
+the
+psychic
+to
+an
+invisible
+audience
+that
+have
+the
+same
+understanding
+of
+my
+doctrine
+If
+I
+had
+only
+opened
+the
+door
+of
+the
+real
+spiritual
+understanding
+and
+taught
+the
+real
+truth
+on
+earth
+things
+would
+be
+different
+I
+knew
+I
+had
+the
+truth
+We
+should
+unite
+and
+be
+one
+strong
+body
+because
+I
+know
+there
+is
+power
+in
+concentration
+and
+I
+only
+wish
+that
+I
+could
+have
+the
+whole
+world
+understand
+this
+doctrine
+If
+I
+could
+only
+come
+back
+and
+tell
+my
+people
+what
+I
+now
+have
+to
+do
+You
+saw
+the
+demonstration
+you
+had
+here
+tonight
+I
+asked
+the
+Band
+of
+Mercy
+to
+bring
+one
+of
+my
+followers
+in
+to
+show
+what
+I
+have
+to
+deal
+with
+With
+this
+one
+we
+could
+probably
+demonstrate
+to
+a
+hundred
+similar
+spirits
+the
+folly
+of
+the
+mortal
+mind
+idea
+Concentrate
+your
+mind
+over
+and
+over
+again
+and
+again
+round
+and
+round
+and
+read
+and
+read
+that
+was
+the
+way
+I
+taught
+one
+was
+to
+reach
+understanding
+I
+said
+my
+followers
+should
+read
+my
+books
+and
+read
+them
+and
+read
+them
+until
+they
+became
+second
+nature
+When
+you
+are
+in
+matter
+the
+mind
+has
+to
+have
+some
+food
+But
+when
+my
+people
+pass
+to
+the
+spirit
+side
+of
+life
+and
+matter
+is
+no
+more
+and
+they
+have
+thrown
+off
+the
+mortal
+error
+you
+see
+just
+where
+they
+are
+What
+can
+I
+do
+with
+them
+How
+much
+could
+you
+do
+with
+them
+under
+similar
+circumstances
+There
+is
+my
+work
+and
+more
+is
+coming
+Every
+day
+there
+are
+more
+and
+more
+people
+coming
+I
+try
+to
+help
+them
+because
+I
+taught
+mortal
+error
+and
+did
+not
+teach
+the
+truth
+I
+feel
+so
+sad
+and
+I
+do
+wish
+I
+could
+tell
+them
+to
+open
+the
+door
+for
+the
+spirit
+of
+understanding
+and
+not
+keep
+on
+just
+reading
+and
+reading
+and
+concentrating
+In
+every
+church
+all
+over
+the
+United
+States
+where
+we
+have
+churches
+they
+use
+the
+same
+lesson
+on
+the
+same
+Sunday
+They
+form
+a
+circle
+round
+and
+round
+and
+you
+must
+know
+they
+form
+a
+very
+strong
+magnet
+and
+draw
+people
+into
+the
+same
+condition
+When
+they
+come
+here
+they
+cling
+to
+me
+cling
+to
+me
+so
+closely
+and
+what
+am
+I
+to
+do
+If
+I
+tell
+them
+the
+common
+sense
+things
+I
+should
+have
+taught
+them
+they
+will
+not
+believe
+I
+knew
+I
+had
+the
+real
+truth
+and
+I
+had
+power
+but
+I
+was
+selfish
+I
+wanted
+to
+have
+a
+religion
+of
+my
+own
+I
+wanted
+one
+that
+the
+whole
+world
+should
+know
+What
+have
+I
+now
+When
+my
+people
+pass
+to
+the
+spirit
+side
+of
+life
+the
+door
+is
+closed
+and
+I
+cannot
+open
+it
+What
+progress
+could
+you
+make
+with
+the
+spirit
+you
+had
+here
+tonight
+I
+thank
+the
+Mercy
+Band
+and
+all
+of
+you
+here
+because
+through
+this
+experience
+we
+took
+this
+spirit
+to
+the
+spirit
+world
+and
+they
+will
+teach
+her
+through
+object
+lessons
+There
+were
+many
+Scientists
+here
+tonight
+and
+they
+saw
+how
+foolish
+it
+all
+is
+their
+eyes
+were
+opened
+and
+the
+spirit
+friends
+took
+them
+away
+with
+them
+The
+one
+here
+we
+could
+not
+do
+much
+with
+but
+she
+was
+an
+object
+lesson
+to
+teach
+the
+others
+and
+in
+time
+she
+will
+be
+helped
+My
+people
+read
+and
+read
+and
+the
+majority
+come
+over
+here
+without
+any
+understanding
+I
+closed
+the
+door
+for
+my
+people
+and
+it
+is
+hard
+It
+is
+easy
+for
+them
+so
+long
+as
+they
+are
+in
+the
+mortal
+body
+but
+when
+they
+have
+lost
+the
+mortal
+body
+they
+see
+nothing
+For
+them
+there
+is
+no
+spirit
+world
+it
+is
+all
+Infinite
+I
+taught
+them
+to
+close
+the
+door
+to
+the
+spirit
+world
+and
+I
+taught
+them
+to
+read
+only
+my
+books
+I
+wanted
+a
+religion
+of
+my
+own
+I
+was
+a
+trance
+medium
+and
+I
+gave
+readings
+but
+I
+must
+confess
+I
+felt
+that
+was
+too
+common
+I
+wanted
+to
+reach
+more
+intelligent
+people
+because
+I
+found
+that
+Spiritualism
+would
+not
+reach
+the
+people
+I
+wanted
+to
+reach
+so
+I
+took
+Quimby
+s
+doctrine
+and
+also
+as
+I
+told
+you
+previously
+the
+vision
+I
+had
+of
+mortal
+mind
+in
+the
+spirit
+world
+and
+combined
+the
+two
+I
+want
+it
+understood
+that
+I
+used
+to
+give
+readings
+in
+Boston
+I
+was
+very
+selfish
+and
+wanted
+to
+be
+somebody
+and
+have
+some
+kind
+of
+a
+religion
+where
+I
+could
+have
+a
+following
+I
+wished
+once
+that
+on
+my
+birthday
+church
+bells
+all
+over
+the
+United
+States
+would
+ring
+and
+before
+I
+died
+I
+had
+that
+wish
+I
+wanted
+to
+be
+one
+that
+would
+be
+looked
+up
+to
+I
+was
+brought
+up
+in
+such
+orthodoxy
+that
+I
+would
+not
+have
+anything
+to
+do
+with
+any
+of
+the
+churches
+I
+went
+into
+Spiritualism
+first
+and
+found
+that
+was
+much
+better
+than
+Orthodoxy
+so
+I
+followed
+it
+for
+some
+years
+but
+I
+felt
+I
+could
+not
+get
+very
+far
+with
+it
+and
+in
+the
+end
+I
+was
+obsessed
+What
+I
+saw
+in
+visions
+I
+put
+in
+Science
+and
+Health
+That
+book
+was
+written
+through
+the
+visions
+I
+had
+It
+was
+not
+from
+my
+own
+brain
+If
+only
+with
+that
+I
+had
+given
+the
+truth
+which
+my
+brother
+wanted
+me
+to
+he
+was
+in
+the
+spirit
+world
+but
+I
+would
+not
+I
+did
+things
+Albert
+brother
+said
+I
+should
+not
+do
+and
+I
+closed
+the
+door
+for
+him
+During
+the
+last
+of
+my
+days
+I
+was
+not
+myself
+very
+much
+All
+through
+life
+I
+was
+back
+and
+forth
+on
+the
+invisible
+plane
+You
+know
+I
+was
+a
+psychic
+and
+I
+could
+have
+been
+a
+very
+good
+one
+and
+have
+done
+more
+good
+to
+the
+world
+through
+my
+psychic
+power
+than
+I
+did
+At
+the
+last
+I
+was
+too
+obsessed
+to
+be
+responsible
+for
+all
+I
+was
+doing
+If
+I
+had
+used
+my
+psychic
+power
+I
+could
+have
+helped
+thousands
+Now
+I
+have
+to
+deal
+with
+what
+you
+saw
+here
+tonight
+So
+long
+as
+my
+people
+are
+in
+the
+mortal
+body
+they
+are
+all
+right
+but
+once
+the
+body
+is
+lost
+things
+go
+round
+and
+round
+My
+followers
+are
+in
+just
+as
+bad
+a
+condition
+as
+are
+those
+who
+followed
+orthodoxy
+When
+they
+pass
+out
+of
+the
+body
+everything
+they
+see
+is
+mortal
+mind
+Possibly
+you
+felt
+sorry
+you
+did
+not
+convert
+the
+spirit
+you
+had
+here
+tonight
+but
+while
+not
+successful
+with
+her
+hundreds
+of
+others
+were
+converted
+through
+seeing
+how
+foolish
+it
+all
+is
+and
+were
+helped
+through
+your
+talk
+This
+room
+was
+crowded
+with
+people
+and
+I
+hope
+you
+will
+all
+be
+liberal
+enough
+to
+never
+shut
+the
+door
+for
+the
+beautiful
+truth
+of
+spirit
+return
+I
+bless
+you
+all
+and
+give
+you
+my
+solid
+support
+and
+help
+and
+I
+hope
+you
+will
+allow
+me
+to
+bring
+more
+unfortunate
+ones
+sometime
+I
+thank
+you
+for
+keeping
+the
+door
+open
+for
+me
+to
+come
+I
+am
+only
+mortal
+and
+I
+am
+not
+of
+the
+Real
+Infinite
+either
+We
+all
+have
+our
+ups
+and
+downs
+here
+as
+well
+as
+on
+the
+other
+side
+of
+life
+People
+think
+that
+they
+change
+their
+condition
+when
+they
+die
+but
+they
+do
+not
+My
+people
+are
+especially
+fixed
+because
+everything
+with
+them
+outside
+of
+themselves
+is
+mortal
+mind
+and
+their
+own
+mind
+is
+Infinite
+Many
+who
+were
+followers
+of
+my
+Church
+have
+gone
+into
+New
+Thought
+From
+New
+Thought
+they
+come
+into
+a
+more
+spiritual
+understanding
+New
+Thought
+is
+more
+liberal
+In
+New
+Thought
+they
+branch
+out
+and
+being
+liberal
+will
+look
+into
+spirit
+return
+They
+are
+more
+liberal
+in
+their
+reading
+of
+books
+I
+forbade
+my
+people
+to
+read
+anything
+but
+Science
+books
+That
+was
+because
+of
+my
+selfishness
+I
+wanted
+a
+church
+of
+my
+own
+with
+my
+people
+under
+my
+thumb
+How
+I
+do
+wish
+I
+had
+taught
+obsession
+which
+I
+knew
+was
+true
+but
+I
+did
+not
+When
+I
+used
+to
+go
+into
+trances
+I
+wrote
+a
+great
+deal
+and
+when
+I
+came
+to
+myself
+I
+would
+deny
+what
+I
+got
+I
+was
+obsessed
+by
+some
+spirit
+who
+wanted
+me
+to
+do
+such
+work
+and
+I
+could
+not
+really
+help
+myself
+If
+I
+had
+written
+the
+books
+as
+they
+were
+given
+to
+me
+and
+credited
+their
+source
+I
+might
+have
+revolutionized
+the
+world
+I
+again
+want
+to
+thank
+you
+and
+hope
+I
+can
+come
+another
+time
+I
+also
+want
+to
+thank
+you
+lady
+Mrs
+M
+mentioned
+in
+the
+first
+experience
+of
+this
+chapter
+because
+your
+husband
+helped
+me
+in
+the
+very
+beginning
+In
+the
+spirit
+world
+He
+was
+one
+that
+helped
+me
+to
+a
+better
+understanding
+and
+brought
+me
+here
+where
+I
+could
+get
+help
+I
+hope
+you
+will
+have
+all
+the
+success
+you
+wish
+Concentrate
+your
+mind
+on
+success
+and
+have
+no
+fear
+that
+you
+will
+not
+succeed
+and
+all
+over
+the
+world
+will
+spread
+this
+wonderful
+truth
+of
+spirit
+return
+and
+obsession
+and
+through
+your
+obsession
+work
+you
+will
+cure
+many
+more
+people
+than
+I
+did
+In
+our
+work
+often
+when
+a
+healing
+was
+instantaneous
+it
+was
+an
+obsession
+being
+relieved
+You
+understand
+also
+that
+all
+the
+healers
+are
+in
+the
+circle
+of
+concentration
+with
+the
+power
+of
+the
+whole
+church
+to
+aid
+them
+and
+that
+power
+of
+concentration
+is
+so
+strong
+that
+an
+obsession
+cannot
+live
+in
+that
+atmosphere
+Many
+I
+cured
+were
+obsessed
+but
+they
+concentrated
+that
+they
+were
+not
+sick
+How
+are
+they
+helped
+I
+will
+tell
+you
+The
+average
+doctor
+tells
+a
+patient
+that
+he
+has
+such
+and
+such
+a
+sickness
+He
+creates
+a
+fear
+in
+his
+mind
+Let
+us
+take
+a
+case
+of
+gall
+stones
+It
+is
+very
+hard
+to
+diagnose
+such
+a
+case
+correctly
+The
+doctor
+says
+the
+patient
+has
+gall
+stones
+sometimes
+he
+operates
+when
+that
+should
+not
+be
+done
+Sometimes
+the
+patient
+gets
+well
+without
+an
+operation
+That
+is
+due
+to
+his
+mind
+He
+concentrates
+his
+mind
+on
+gall
+stones
+gall
+stones
+until
+he
+can
+think
+of
+nothing
+else
+You
+understand
+you
+have
+in
+your
+mind
+a
+creative
+power
+We
+have
+a
+spark
+of
+the
+Infinite
+within
+us
+In
+that
+Divine
+spark
+God
+created
+the
+world
+all
+in
+it
+and
+you
+as
+a
+part
+Each
+of
+us
+has
+much
+of
+that
+creative
+power
+and
+when
+you
+set
+your
+mind
+working
+with
+that
+power
+you
+create
+your
+condition
+When
+you
+go
+to
+one
+of
+my
+practitioners
+the
+first
+thing
+that
+is
+done
+is
+to
+take
+your
+mind
+off
+your
+sickness
+You
+are
+given
+absent
+treatment
+to
+get
+rid
+of
+fear
+You
+have
+the
+same
+creative
+power
+within
+yourself
+In
+a
+case
+of
+diphtheria
+the
+mind
+can
+help
+but
+we
+cannot
+kill
+germs
+There
+are
+many
+things
+we
+fail
+in
+but
+we
+have
+success
+with
+chronic
+cases
+We
+have
+more
+success
+because
+so
+many
+are
+obsessed
+When
+you
+have
+fear
+you
+are
+negative
+I
+will
+be
+with
+you
+to
+teach
+obsession
+to
+the
+world
+Teach
+the
+real
+truth
+and
+do
+not
+care
+for
+people
+s
+opinions
+If
+only
+I
+could
+go
+to
+my
+Mother
+Church
+and
+teach
+them
+the
+truth
+Thank
+you
+each
+and
+every
+one
+of
+you
+and
+sometime
+I
+shall
+come
+again
+That
+the
+mind
+has
+power
+to
+create
+the
+condition
+in
+which
+a
+spirit
+finds
+itself
+after
+transition
+is
+illustrated
+in
+the
+following
+experience
+A
+former
+patient
+of
+ours
+Mrs
+Anna
+R
+who
+had
+at
+one
+time
+been
+under
+our
+care
+and
+had
+been
+entirely
+restored
+to
+health
+many
+years
+later
+left
+her
+home
+to
+care
+for
+a
+sister
+in
+law
+Mrs
+Jessie
+R
+who
+was
+very
+ill
+The
+latter
+was
+a
+Christian
+Scientist
+and
+denied
+that
+spirit
+obsession
+had
+been
+the
+cause
+of
+the
+former
+illness
+of
+her
+sisterin
+law
+claiming
+that
+Christian
+Science
+and
+her
+own
+concentration
+had
+cured
+her
+She
+was
+a
+masculine
+type
+a
+very
+large
+woman
+preferring
+to
+assist
+her
+husband
+with
+his
+oil
+station
+rather
+than
+care
+for
+her
+home
+After
+a
+long
+illness
+she
+died
+in
+the
+arms
+of
+Mrs
+Anna
+R
+who
+then
+remained
+in
+the
+house
+to
+care
+for
+the
+widower
+and
+also
+keep
+house
+for
+him
+She
+occupied
+the
+room
+and
+bed
+of
+her
+sister
+in
+law
+and
+not
+only
+attended
+to
+all
+household
+duties
+but
+spent
+much
+time
+working
+in
+the
+garden
+until
+her
+strength
+failed
+when
+she
+became
+negative
+and
+was
+again
+disturbed
+by
+spirit
+interference
+She
+acted
+in
+a
+masculine
+manner
+and
+a
+brother
+Mr
+Herman
+M
+realizing
+that
+some
+spirit
+had
+taken
+possession
+of
+his
+sister
+at
+first
+thought
+the
+entity
+was
+a
+man
+But
+Mrs
+Anna
+R
+began
+to
+talk
+as
+though
+she
+were
+Mrs
+Jessie
+R
+and
+authoritatively
+ordered
+everyone
+to
+leave
+the
+house
+Mr
+M
+urged
+his
+sister
+to
+come
+to
+us
+for
+treatment
+but
+this
+she
+refused
+to
+do
+insisting
+under
+control
+of
+the
+obsessing
+entity
+that
+Christian
+Science
+cured
+me
+the
+last
+time
+Mr
+M
+then
+telephoned
+us
+regarding
+the
+situation
+and
+attended
+a
+seance
+in
+our
+home
+mentally
+commanding
+the
+spirit
+that
+was
+troubling
+his
+sister
+to
+come
+with
+him
+We
+concentrated
+for
+the
+patient
+and
+when
+Mrs
+Wickland
+became
+entranced
+a
+corroborative
+conversation
+with
+the
+controlling
+spirit
+ensued
+Spirit
+MRS
+JESSIE
+R
+Patient
+MRS
+ANNA
+R
+PSYCHIC
+MRS
+WICKLAND
+Doctor
+Can
+you
+tell
+us
+something
+about
+yourself
+Touching
+arm
+Spirit
+Leave
+me
+alone
+Dr
+We
+want
+to
+enlighten
+you
+Sp
+I
+am
+enlightened
+enough
+They
+thought
+they
+were
+going
+to
+get
+me
+but
+they
+got
+left
+Intelligent
+spirits
+Dr
+To
+whom
+do
+you
+refer
+Sp
+Those
+people
+I
+don
+t
+want
+you
+to
+hold
+my
+arm
+You
+have
+no
+right
+to
+touch
+me
+Dr
+I
+have
+a
+right
+to
+touch
+the
+arm
+of
+my
+wife
+Sp
+Struggling
+I
+don
+t
+want
+to
+be
+held
+down
+Mr
+G
+Be
+a
+nice
+fellow
+Sp
+Fellow
+I
+m
+not
+a
+man
+I
+m
+a
+woman
+Can
+t
+you
+see
+that
+Dr
+When
+I
+look
+at
+you
+I
+see
+my
+wife
+Sp
+I
+don
+t
+care
+There
+must
+be
+something
+the
+matter
+with
+you
+They
+all
+think
+they
+are
+smart
+Evidently
+referring
+to
+intelligent
+spirits
+who
+had
+been
+endeavoring
+to
+free
+patient
+from
+influence
+of
+this
+entity
+I
+tell
+them
+they
+can
+t
+fool
+me
+I
+don
+t
+want
+to
+talk
+to
+any
+of
+you
+Dr
+To
+whom
+are
+you
+talking
+Sp
+Flourishing
+hand
+I
+m
+talking
+to
+all
+of
+you
+This
+is
+my
+house
+and
+my
+home
+Dr
+Can
+you
+tell
+us
+your
+name
+Sp
+I
+don
+t
+think
+I
+need
+to
+tell
+you
+my
+name
+Mr
+G
+The
+gentleman
+on
+your
+left
+is
+Dr
+Wickland
+Sp
+Oh
+so
+that
+s
+it
+Dramatically
+Now
+you
+can
+all
+get
+out
+of
+here
+This
+is
+my
+home
+and
+I
+m
+going
+to
+stay
+right
+here
+Dr
+Just
+now
+you
+are
+in
+our
+home
+Do
+you
+know
+me
+Sp
+Yes
+I
+knew
+you
+some
+years
+ago
+When
+visiting
+the
+patient
+Mrs
+Anna
+R
+who
+had
+been
+restored
+to
+health
+while
+under
+our
+care
+But
+I
+never
+believed
+in
+you
+I
+was
+a
+good
+Christian
+Scientist
+Now
+all
+of
+you
+get
+right
+out
+of
+here
+This
+is
+my
+home
+What
+right
+have
+any
+of
+you
+here
+Mr
+G
+You
+speak
+as
+if
+you
+were
+omnipotent
+Sp
+I
+am
+not
+God
+but
+I
+am
+next
+to
+Him
+When
+you
+are
+a
+true
+Christian
+Scientist
+you
+come
+next
+to
+God
+Dr
+What
+about
+the
+lady
+whom
+you
+have
+been
+bothering
+Sp
+She
+can
+go
+to
+the
+dickens
+When
+I
+get
+well
+I
+ll
+show
+her
+That
+s
+my
+home
+Dr
+Did
+you
+buy
+it
+Sp
+I
+worked
+and
+helped
+pay
+for
+it
+Now
+others
+are
+occupying
+my
+home
+but
+when
+I
+get
+well
+I
+ll
+chase
+them
+out
+Dr
+Who
+is
+occupying
+it
+Sp
+My
+husband
+is
+there
+for
+one
+Dr
+Do
+you
+want
+him
+to
+leave
+Sp
+I
+want
+everybody
+to
+get
+out
+Dr
+Did
+you
+pass
+out
+Sp
+Oh
+no
+you
+ll
+find
+out
+that
+I
+m
+not
+dead
+yet
+I
+scared
+one
+woman
+Dr
+Who
+was
+that
+Sp
+She
+laid
+down
+on
+my
+bed
+but
+I
+made
+her
+get
+up
+I
+scared
+her
+Mrs
+N
+W
+Remembering
+that
+upon
+a
+recent
+visit
+to
+the
+patient
+s
+home
+she
+had
+lain
+down
+to
+rest
+upon
+the
+bed
+which
+had
+belonged
+to
+the
+former
+mistress
+of
+the
+house
+but
+had
+been
+unable
+to
+remain
+there
+because
+of
+an
+unpleasant
+influence
+I
+wasn
+t
+at
+all
+frightened
+Sp
+Just
+the
+same
+I
+made
+you
+get
+up
+Dr
+What
+satisfaction
+do
+you
+find
+in
+staying
+around
+the
+house
+Don
+t
+you
+realize
+you
+are
+a
+spirit
+Sp
+I
+don
+t
+believe
+in
+spirits
+and
+never
+did
+Several
+years
+ago
+you
+talked
+spirits
+to
+me
+but
+I
+didn
+t
+believe
+you
+and
+would
+not
+listen
+to
+you
+This
+had
+been
+the
+case
+Mr
+M
+Do
+we
+know
+you
+Sp
+I
+am
+Jessie
+R
+Sister
+in
+law
+of
+patient
+Mrs
+Anna
+R
+You
+thought
+you
+would
+chase
+me
+out
+Herm
+but
+you
+got
+left
+Mr
+M
+I
+think
+we
+succeeded
+in
+getting
+you
+away
+You
+are
+at
+Dr
+Wickland
+s
+home
+now
+Sp
+All
+of
+you
+tried
+to
+chase
+me
+out
+but
+you
+got
+left
+Dr
+No
+they
+didn
+t
+because
+you
+are
+now
+at
+our
+home
+Sp
+I
+never
+liked
+you
+You
+believe
+in
+spirits
+and
+I
+don
+t
+Dr
+You
+believe
+in
+the
+continuation
+of
+life
+don
+t
+you
+What
+are
+spirits
+but
+those
+who
+have
+passed
+on
+to
+a
+continued
+existence
+Sp
+Angrily
+I
+tell
+you
+I
+have
+not
+passed
+on
+I
+live
+in
+my
+home
+and
+I
+want
+everybody
+chased
+out
+Dr
+Christian
+Scientists
+die
+just
+as
+other
+persons
+do
+Sp
+Not
+if
+they
+are
+in
+the
+understanding
+Dr
+Mrs
+Eddy
+died
+Where
+does
+a
+Christian
+Scientist
+expect
+to
+go
+when
+he
+loses
+the
+physical
+body
+Sp
+Body
+The
+body
+is
+only
+imagination
+Dr
+Then
+why
+do
+you
+object
+when
+I
+touch
+your
+arm
+Sp
+Because
+I
+feel
+tied
+up
+I
+was
+a
+big
+fat
+woman
+and
+here
+I
+am
+with
+a
+little
+body
+I
+have
+told
+you
+before
+I
+don
+t
+like
+you
+and
+I
+never
+did
+Dr
+Why
+Sp
+Because
+you
+always
+talked
+about
+spirits
+Dr
+Yes
+we
+often
+talked
+about
+the
+subject
+You
+are
+now
+proving
+the
+fact
+of
+spirit
+return
+Sp
+Addressing
+patient
+s
+brother
+Mr
+Herman
+M
+Herm
+why
+did
+you
+bring
+me
+here
+Mr
+M
+I
+thought
+you
+needed
+a
+little
+education
+You
+were
+not
+doing
+the
+right
+thing
+where
+you
+were
+Dr
+Did
+you
+come
+here
+in
+an
+auto
+Sp
+I
+don
+t
+know
+how
+I
+came
+Herm
+made
+me
+come
+with
+him
+Dr
+Did
+you
+bring
+anyone
+else
+with
+you
+Referring
+to
+spirits
+obsessing
+the
+patient
+Sp
+Three
+of
+us
+came
+They
+help
+me
+They
+are
+all
+good
+Christian
+Scientists
+They
+don
+t
+associate
+with
+anybody
+but
+their
+own
+people
+because
+it
+causes
+cross
+currents
+I
+was
+the
+leader
+Laughing
+They
+all
+thought
+I
+was
+a
+man
+I
+did
+a
+man
+s
+work
+so
+why
+shouldn
+t
+I
+have
+the
+honor
+of
+being
+a
+man
+My
+husband
+was
+sick
+but
+he
+is
+well
+now
+Just
+as
+soon
+as
+Anna
+came
+he
+braced
+up
+Dr
+Because
+your
+sister
+in
+law
+took
+proper
+care
+of
+him
+Sp
+What
+business
+had
+they
+to
+bring
+me
+here
+I
+said
+I
+would
+never
+go
+to
+Wicklands
+again
+Patient
+had
+made
+similar
+statements
+the
+day
+before
+although
+normally
+very
+friendly
+Mr
+M
+I
+heard
+last
+Sunday
+that
+the
+Christian
+Scientists
+take
+the
+credit
+for
+curing
+Anna
+some
+years
+ago
+when
+the
+Wicklands
+straightened
+her
+out
+and
+got
+rascal
+spirits
+away
+from
+her
+Sp
+To
+Mr
+M
+I
+will
+get
+you
+yet
+Mr
+M
+Don
+t
+worry
+about
+me
+You
+had
+better
+try
+to
+get
+understanding
+Dr
+This
+body
+belongs
+to
+Mrs
+Wickland
+Sp
+I
+used
+to
+talk
+to
+you
+folks
+when
+I
+came
+to
+your
+house
+to
+see
+Anna
+but
+I
+had
+no
+use
+for
+you
+If
+you
+had
+become
+Christian
+Scientists
+I
+would
+have
+been
+interested
+in
+you
+Dr
+You
+are
+controlling
+the
+body
+of
+Mrs
+Wickland
+and
+she
+is
+unconscious
+while
+you
+talk
+through
+her
+You
+claim
+you
+are
+Jessie
+R
+but
+when
+I
+look
+at
+you
+I
+see
+the
+face
+of
+my
+wife
+hence
+you
+are
+a
+spirit
+Sp
+How
+could
+I
+get
+in
+this
+little
+body
+when
+I
+am
+a
+big
+fat
+woman
+Dr
+You
+are
+a
+spirit
+and
+spirit
+does
+not
+need
+a
+big
+body
+You
+must
+realize
+you
+are
+a
+spirit
+and
+understand
+your
+situation
+When
+spirits
+are
+ignorant
+of
+their
+condition
+they
+often
+cause
+much
+trouble
+The
+spirit
+of
+Mrs
+Eddy
+has
+spoken
+through
+this
+same
+instrument
+several
+times
+and
+she
+has
+always
+expressed
+regret
+that
+she
+failed
+to
+include
+in
+her
+teachings
+the
+truth
+of
+spirit
+communication
+which
+she
+knew
+from
+her
+own
+experience
+to
+be
+a
+fact
+Sp
+Where
+is
+Wes
+Wesley
+R
+her
+husband
+Dr
+On
+the
+ranch
+because
+that
+is
+his
+home
+Sp
+He
+likes
+it
+there
+much
+better
+now
+than
+he
+used
+to
+Why
+is
+Mel
+R
+bothering
+me
+Referring
+to
+spirit
+husband
+of
+patient
+He
+is
+here
+now
+He
+says
+I
+have
+no
+business
+to
+bother
+his
+wife
+Dr
+Ask
+him
+whether
+you
+are
+so
+called
+dead
+Sp
+He
+says
+Yes
+and
+that
+everything
+you
+have
+said
+is
+true
+He
+bothers
+me
+all
+the
+time
+Dr
+He
+is
+not
+in
+the
+physical
+we
+cannot
+see
+him
+You
+know
+that
+he
+has
+passed
+out
+You
+say
+he
+bothers
+you
+Sp
+Yes
+He
+is
+here
+and
+he
+says
+I
+shall
+not
+stay
+around
+the
+house
+but
+must
+keep
+away
+and
+leave
+my
+husband
+and
+Anna
+alone
+Dr
+Does
+any
+one
+ever
+talk
+to
+you
+Sp
+No
+they
+take
+no
+notice
+of
+me
+and
+that
+s
+what
+makes
+me
+so
+mad
+Listening
+to
+some
+invisible
+You
+tell
+Anna
+that
+I
+feel
+sorry
+for
+what
+I
+have
+done
+to
+her
+Her
+husband
+spirit
+has
+opened
+my
+eyes
+I
+am
+also
+sorry
+for
+Wes
+Dr
+You
+must
+acquire
+understanding
+Sp
+Pray
+for
+me
+Tell
+Anna
+how
+sorry
+I
+am
+that
+I
+have
+disturbed
+her
+I
+did
+not
+have
+a
+proper
+understanding
+and
+I
+was
+angry
+I
+had
+a
+quick
+temper
+Herm
+you
+know
+that
+Dr
+It
+was
+wrong
+to
+upset
+Mrs
+R
+She
+thought
+a
+great
+deal
+of
+you
+Sp
+Penitently
+I
+can
+see
+how
+selfish
+I
+have
+been
+My
+Christian
+Science
+belief
+was
+only
+a
+cloak
+Dr
+The
+higher
+ideals
+of
+Christian
+Science
+are
+excellent
+but
+should
+include
+the
+whole
+of
+life
+Sp
+Help
+Anna
+Dr
+Are
+there
+any
+more
+spirits
+troubling
+her
+Sp
+Yes
+there
+are
+Mr
+M
+Isn
+t
+Mel
+trying
+to
+get
+them
+away
+Sp
+He
+chased
+me
+all
+the
+time
+and
+I
+didn
+t
+like
+it
+Dr
+He
+wanted
+you
+to
+realize
+your
+condition
+and
+leave
+his
+wife
+alone
+SP
+Will
+you
+help
+her
+Doctor
+Dr
+That
+is
+what
+we
+are
+trying
+to
+do
+Sp
+I
+liked
+my
+home
+very
+much
+I
+was
+taken
+very
+sick
+and
+I
+went
+to
+sleep
+died
+and
+after
+awhile
+when
+I
+woke
+up
+things
+were
+changed
+Anna
+was
+taking
+care
+of
+my
+home
+and
+I
+stood
+it
+for
+awhile
+then
+I
+wanted
+my
+place
+as
+I
+had
+always
+had
+it
+I
+commenced
+to
+bother
+Anna
+Poor
+girl
+I
+wouldn
+t
+let
+her
+come
+here
+Please
+help
+her
+and
+help
+me
+too
+Dr
+Yes
+we
+will
+but
+you
+must
+also
+help
+yourself
+Sp
+They
+spirits
+tell
+me
+I
+have
+to
+go
+but
+where
+I
+don
+t
+know
+Dr
+Mrs
+R
+s
+husband
+and
+other
+spirits
+will
+take
+care
+of
+you
+and
+teach
+you
+how
+to
+progress
+in
+your
+new
+life
+Forget
+the
+past
+You
+must
+broaden
+your
+mind
+Realize
+there
+is
+a
+spirit
+world
+We
+are
+all
+spirits
+whether
+in
+the
+body
+or
+out
+of
+it
+My
+wife
+allows
+spirits
+to
+control
+her
+body
+in
+order
+that
+we
+may
+enlighten
+them
+and
+learn
+the
+facts
+If
+the
+future
+life
+were
+more
+clearly
+understood
+such
+conditions
+as
+yours
+would
+not
+exist
+If
+you
+had
+understood
+the
+truth
+of
+spirit
+existence
+spirits
+could
+have
+helped
+you
+at
+the
+time
+you
+passed
+on
+But
+your
+mind
+was
+on
+the
+earth
+plane
+Now
+you
+have
+an
+opportunity
+to
+learn
+and
+advance
+Sp
+Clint
+is
+here
+Spirit
+a
+brother
+of
+the
+patient
+He
+says
+I
+should
+come
+with
+him
+I
+had
+him
+on
+one
+side
+and
+Mel
+on
+the
+other
+you
+can
+imagine
+how
+I
+have
+been
+bothered
+Where
+shall
+I
+go
+when
+I
+leave
+here
+Dr
+These
+spirit
+friends
+will
+take
+care
+of
+you
+Sp
+Addressing
+Mr
+M
+in
+audience
+Will
+you
+forgive
+me
+Mr
+M
+Surely
+we
+know
+you
+did
+not
+understand
+Sp
+Tell
+Anna
+I
+will
+do
+the
+best
+I
+can
+to
+help
+her
+when
+I
+learn
+how
+I
+bothered
+her
+because
+I
+did
+not
+like
+the
+way
+things
+had
+been
+changed
+in
+the
+house
+then
+all
+at
+once
+I
+lost
+myself
+Obsessed
+patient
+Doctor
+I
+never
+liked
+you
+because
+you
+believed
+in
+spirits
+but
+now
+I
+have
+to
+thank
+you
+for
+helping
+me
+Dr
+Be
+open
+minded
+think
+yourself
+with
+your
+spirit
+friends
+and
+you
+will
+be
+with
+them
+Sp
+Goodbye
+The
+following
+day
+a
+sister
+of
+Mrs
+R
+telephoned
+that
+a
+noticeable
+change
+had
+taken
+place
+in
+the
+patient
+and
+that
+the
+latter
+had
+that
+morning
+said
+I
+want
+to
+go
+to
+Dr
+Wickland
+for
+treatment
+Upon
+her
+arrival
+Mrs
+R
+was
+extremely
+exhausted
+and
+between
+static
+treatments
+slept
+for
+two
+days
+but
+upon
+the
+third
+day
+awoke
+clear
+in
+mind
+Further
+records
+of
+statements
+made
+by
+the
+founder
+of
+Christian
+Science
+follow
+EXPERIENCE
+DECEMBER
+Spirit
+MARY
+BAKER
+EDDY
+Psychic
+MRS
+WICKLAND
+I
+wanted
+to
+come
+again
+to
+speak
+of
+the
+work
+you
+are
+doing
+What
+a
+blessing
+it
+is
+to
+humanity
+to
+help
+the
+mortals
+here
+on
+earth
+and
+the
+spirit
+who
+has
+passed
+on
+in
+ignorance
+with
+no
+knowledge
+of
+the
+life
+beyond
+I
+closed
+the
+door
+I
+should
+have
+opened
+wide
+to
+give
+my
+knowledge
+to
+the
+world
+I
+had
+the
+power
+and
+gift
+that
+God
+gave
+me
+to
+do
+work
+to
+help
+humanity
+and
+to
+teach
+humanity
+that
+there
+is
+a
+life
+after
+this
+I
+was
+a
+medium
+and
+could
+have
+helped
+open
+the
+door
+from
+the
+spirit
+world
+to
+earth
+life
+but
+I
+closed
+it
+because
+of
+my
+selfishness
+Also
+I
+liked
+to
+have
+something
+new
+that
+was
+not
+known
+before
+and
+to
+establish
+a
+religion
+of
+my
+own
+I
+taught
+the
+wrong
+religion
+of
+life
+and
+I
+denied
+the
+truth
+of
+spirit
+return
+and
+tried
+to
+give
+out
+other
+things
+which
+suited
+my
+own
+fancy
+my
+own
+self
+again
+I
+shut
+the
+door
+for
+myself
+and
+for
+my
+followers
+hereafter
+If
+you
+could
+only
+help
+me
+to
+open
+the
+door
+again
+to
+tell
+them
+that
+I
+am
+trying
+my
+very
+best
+to
+open
+the
+eyes
+of
+my
+followers
+Tell
+them
+not
+to
+shut
+the
+door
+to
+the
+truth
+Truth
+will
+stand
+wherever
+you
+find
+it
+but
+do
+not
+deny
+it
+when
+you
+find
+it
+I
+denied
+it
+and
+so
+I
+suffer
+Here
+are
+my
+followers
+coming
+to
+me
+one
+by
+one
+Every
+day
+there
+are
+some
+coming
+over
+to
+the
+spirit
+side
+of
+life
+and
+I
+am
+trying
+to
+tell
+them
+of
+the
+beautiful
+spirit
+world
+But
+they
+say
+No
+you
+are
+not
+Mrs
+Eddy
+because
+she
+did
+not
+teach
+that
+when
+she
+was
+on
+earth
+You
+are
+only
+a
+false
+person
+And
+then
+they
+go
+away
+You
+see
+what
+I
+have
+to
+deal
+with
+and
+I
+cannot
+progress
+until
+I
+can
+help
+all
+these
+to
+open
+their
+eyes
+We
+should
+not
+deny
+God
+s
+wonderful
+manifestation
+of
+matter
+It
+is
+real
+not
+imagination
+You
+could
+not
+live
+without
+matter
+You
+could
+not
+have
+manifestations
+without
+matter
+I
+denied
+the
+wonderful
+manifestation
+of
+matter
+and
+called
+it
+only
+imagination
+and
+error
+We
+have
+only
+one
+mind
+the
+mind
+that
+God
+gave
+to
+every
+mortal
+being
+Matter
+belongs
+to
+material
+things
+Still
+we
+have
+matter
+in
+the
+spirit
+world
+but
+more
+ethereal
+I
+denied
+it
+What
+is
+my
+spiritual
+body
+now
+It
+is
+in
+a
+very
+crippled
+condition
+because
+my
+mind
+was
+so
+closed
+and
+I
+denied
+the
+truth
+I
+prayed
+to
+God
+and
+I
+said
+that
+God
+was
+All
+in
+All
+and
+His
+manifestations
+beautiful
+and
+said
+that
+we
+should
+look
+up
+to
+Him
+Where
+is
+God
+What
+is
+God
+I
+said
+to
+my
+people
+that
+God
+is
+Love
+and
+Love
+is
+God
+but
+that
+phrase
+became
+only
+empty
+talk
+with
+my
+followers
+We
+must
+realize
+God
+and
+where
+God
+is
+God
+is
+Life
+God
+is
+Electricity
+because
+electricity
+is
+life
+Electricity
+is
+only
+one
+part
+of
+God
+s
+wonderful
+manifestation
+Flowers
+and
+colors
+of
+all
+kinds
+are
+manifestations
+of
+His
+wonders
+Go
+into
+chemistry
+go
+into
+the
+wonderful
+mystery
+of
+life
+go
+into
+the
+microscopical
+world
+These
+I
+denied
+entirely
+I
+denied
+there
+was
+such
+a
+thing
+as
+disease
+and
+denied
+the
+existence
+of
+germs
+When
+you
+get
+into
+the
+microscopical
+world
+you
+will
+find
+a
+world
+in
+itself
+and
+a
+very
+wonderful
+one
+Now
+I
+am
+talking
+of
+what
+I
+have
+learned
+Body
+and
+spirit
+are
+the
+nearest
+to
+His
+wonderful
+manifestation
+yet
+a
+little
+microbe
+can
+kill
+the
+body
+but
+not
+the
+spirit
+Why
+should
+we
+not
+be
+powerful
+enough
+to
+overcome
+a
+little
+microbe
+I
+denied
+God
+by
+denying
+matter
+Let
+us
+go
+into
+chemistry
+and
+see
+the
+wonderful
+things
+there
+That
+is
+matter
+Did
+I
+go
+into
+it
+No
+I
+did
+not
+It
+is
+easy
+to
+say
+there
+is
+no
+such
+thing
+as
+matter
+that
+it
+is
+only
+mortal
+error
+Let
+us
+study
+Anything
+that
+is
+in
+matter
+study
+in
+every
+phase
+I
+have
+my
+eyes
+open
+now
+I
+wish
+I
+could
+come
+back
+to
+teach
+my
+people
+the
+wonders
+of
+Nature
+and
+the
+wonders
+we
+can
+do
+to
+help
+humanity
+and
+the
+spirits
+that
+are
+in
+darkness
+I
+am
+here
+myself
+I
+have
+to
+serve
+for
+what
+I
+have
+done
+and
+I
+speak
+not
+here
+alone
+but
+everywhere
+I
+came
+to
+tell
+you
+this
+Let
+everyone
+open
+the
+door
+to
+the
+spirit
+world
+when
+he
+has
+once
+found
+it
+Do
+not
+deny
+it
+do
+not
+deny
+it
+Christ
+said
+do
+not
+hide
+your
+light
+under
+a
+bushel
+Let
+it
+shine
+for
+others
+Christ
+said
+I
+am
+the
+light
+of
+the
+world
+he
+that
+followeth
+me
+shall
+not
+walk
+in
+darkness
+Christ
+was
+the
+Truth
+When
+you
+find
+the
+truth
+do
+not
+deny
+it
+but
+give
+it
+out
+to
+the
+world
+I
+shut
+the
+door
+I
+wanted
+to
+keep
+the
+people
+under
+my
+control
+and
+I
+did
+I
+am
+now
+suffering
+for
+what
+I
+did
+Tonight
+I
+feel
+so
+happy
+to
+think
+I
+can
+be
+of
+help
+to
+earthbound
+spirits
+that
+are
+doing
+very
+much
+mischief
+to
+humanity
+If
+you
+could
+only
+see
+how
+many
+spirits
+there
+are
+in
+darkness
+who
+cling
+to
+human
+bodies
+and
+obsess
+people
+and
+send
+them
+to
+the
+asylums
+or
+to
+the
+spirit
+world
+by
+shortening
+their
+lives
+There
+is
+so
+much
+work
+to
+be
+done
+Let
+us
+all
+join
+hands
+and
+work
+together
+to
+spread
+the
+truth
+of
+the
+life
+hereafter
+and
+also
+to
+help
+the
+earthbound
+spirits
+Do
+not
+cast
+them
+away
+and
+say
+they
+are
+devils
+They
+are
+only
+ignorant
+spirits
+like
+myself
+I
+wanted
+to
+be
+something
+in
+the
+world
+and
+sold
+my
+soul
+for
+money
+Let
+us
+all
+join
+together
+and
+pray
+to
+God
+to
+open
+the
+hearts
+of
+all
+my
+people
+to
+look
+into
+the
+higher
+life
+of
+spirits
+If
+all
+my
+churches
+could
+be
+turned
+into
+sanitariums
+for
+earthbound
+spirits
+what
+great
+good
+could
+be
+done
+We
+could
+empty
+the
+asylums
+and
+help
+people
+out
+of
+their
+misery
+Let
+us
+help
+the
+unfortunate
+ones
+instead
+of
+sending
+them
+to
+the
+asylums
+where
+they
+are
+mistreated
+for
+it
+is
+not
+understood
+that
+the
+poor
+ones
+who
+are
+obsessed
+have
+to
+suffer
+because
+of
+the
+spirits
+who
+control
+them
+Let
+us
+try
+to
+do
+all
+we
+can
+to
+spread
+the
+truth
+and
+help
+every
+one
+who
+is
+obsessed
+God
+bless
+you
+all
+Goodbye
+EXPERIENCE
+AUGUST
+Spirit
+MARY
+BAKER
+EDDY
+Psychic
+MRS
+WICKLAND
+I
+wish
+all
+could
+realize
+and
+understand
+how
+beautiful
+and
+simple
+conditions
+are
+if
+people
+would
+only
+open
+their
+eyes
+to
+see
+them
+I
+mean
+they
+should
+open
+the
+soul
+eyes
+but
+they
+are
+so
+material
+And
+everything
+that
+is
+being
+taught
+is
+only
+matter
+People
+cannot
+grasp
+spiritual
+things
+The
+Bible
+is
+a
+beautiful
+book
+if
+it
+is
+read
+spiritually
+not
+taken
+literally
+and
+not
+as
+history
+I
+wanted
+to
+study
+and
+learn
+what
+is
+in
+life
+what
+is
+the
+aim
+of
+life
+here
+on
+earth
+If
+you
+would
+only
+stop
+to
+think
+and
+study
+yourself
+a
+little
+you
+would
+see
+how
+wonderfully
+God
+has
+manifested
+in
+you
+First
+there
+is
+your
+material
+body
+how
+beautifully
+and
+wonderfully
+it
+is
+constructed
+But
+how
+much
+more
+wonderful
+your
+mind
+is
+How
+few
+understand
+the
+real
+meaning
+of
+life
+it
+is
+always
+theory
+or
+dogma
+It
+seems
+hard
+to
+get
+people
+to
+understand
+When
+they
+get
+a
+little
+glimpse
+of
+light
+they
+add
+dogma
+and
+theories
+of
+various
+kinds
+If
+they
+would
+only
+be
+natural
+and
+look
+at
+Nature
+Everywhere
+you
+look
+it
+is
+so
+simple
+to
+understand
+There
+is
+no
+dogma
+or
+theory
+in
+Nature
+s
+finer
+forces
+These
+forces
+are
+hidden
+but
+they
+are
+for
+you
+to
+discover
+It
+is
+for
+you
+to
+find
+God
+s
+wonderful
+manifestation
+in
+Nature
+Let
+us
+worship
+God
+in
+that
+way
+Let
+us
+worship
+Him
+in
+that
+wonderful
+spirit
+which
+is
+everywhere
+Let
+us
+send
+out
+love
+to
+His
+children
+We
+are
+all
+children
+of
+God
+not
+just
+my
+child
+or
+your
+child
+but
+all
+Do
+not
+think
+there
+is
+no
+one
+for
+you
+but
+your
+own
+child
+That
+attitude
+is
+a
+sin
+and
+very
+selfish
+for
+it
+is
+all
+only
+for
+self
+Let
+us
+give
+out
+love
+as
+God
+gives
+it
+to
+us
+all
+Let
+the
+sun
+shine
+every
+day
+on
+us
+and
+on
+everybody
+not
+one
+or
+two
+but
+all
+Let
+the
+sun
+of
+understanding
+bring
+out
+beautiful
+thoughts
+of
+love
+I
+want
+to
+know
+the
+real
+life
+I
+have
+had
+many
+difficulties
+and
+I
+still
+have
+because
+I
+wanted
+to
+shine
+and
+I
+wanted
+to
+be
+a
+light
+I
+wanted
+to
+be
+known
+as
+one
+of
+The
+Teachers
+I
+had
+my
+difficulties
+before
+I
+attained
+my
+ambition
+I
+followed
+studies
+of
+various
+kinds
+but
+most
+of
+all
+the
+secret
+of
+suggestion
+If
+you
+knew
+how
+to
+apply
+and
+concentrate
+Get
+one
+thing
+in
+mind
+and
+do
+not
+let
+anything
+else
+come
+into
+your
+mind
+just
+concentrate
+your
+thoughts
+on
+that
+very
+thing
+Suggest
+and
+suggest
+and
+concentrate
+then
+you
+will
+gain
+strength
+and
+power
+When
+you
+talk
+try
+to
+suggest
+things
+keep
+them
+in
+your
+mind
+and
+hold
+them
+because
+you
+have
+power
+over
+them
+There
+are
+meetings
+of
+various
+kinds
+but
+in
+a
+meeting
+for
+concentration
+and
+suggestion
+there
+is
+power
+and
+strength
+A
+man
+can
+hold
+his
+audience
+by
+his
+hypnotic
+power
+and
+you
+follow
+along
+and
+presently
+you
+get
+strength
+and
+power
+I
+studied
+that
+because
+I
+wanted
+to
+have
+such
+power
+and
+I
+got
+it
+I
+got
+that
+but
+another
+much
+more
+important
+thing
+I
+did
+not
+get
+which
+was
+to
+study
+Nature
+s
+finer
+forces
+instead
+of
+clothing
+myself
+with
+one
+idea
+and
+just
+circling
+around
+and
+around
+I
+held
+people
+in
+that
+circle
+and
+did
+not
+let
+them
+get
+out
+If
+I
+had
+only
+done
+what
+was
+first
+given
+to
+me
+in
+a
+vision
+That
+is
+what
+I
+should
+have
+done
+but
+I
+closed
+the
+door
+because
+I
+wanted
+to
+hold
+my
+people
+through
+suggestion
+I
+felt
+that
+I
+had
+the
+power
+to
+conquer
+everything
+even
+the
+world
+I
+did
+a
+great
+deal
+but
+selfishness
+crept
+in
+I
+meant
+well
+in
+the
+beginning
+and
+I
+did
+well
+but
+I
+was
+selfish
+I
+thought
+I
+had
+it
+all
+Others
+had
+power
+before
+me
+and
+others
+will
+have
+it
+after
+me
+in
+the
+same
+way
+but
+I
+felt
+I
+had
+it
+all
+and
+that
+I
+had
+found
+it
+all
+I
+was
+not
+true
+I
+should
+have
+said
+I
+had
+found
+the
+truth
+and
+I
+should
+have
+given
+it
+to
+others
+as
+it
+was
+given
+to
+me
+but
+I
+did
+not
+I
+called
+it
+my
+own
+and
+I
+closed
+the
+door
+for
+the
+real
+truth
+I
+found
+the
+truth
+in
+the
+beginning
+but
+I
+clung
+to
+theory
+and
+that
+is
+the
+way
+with
+all
+of
+us
+who
+try
+to
+be
+leading
+lights
+We
+are
+always
+clinging
+to
+theories
+and
+not
+to
+the
+truth
+Theories
+seem
+to
+hold
+the
+people
+better
+than
+does
+the
+truth
+We
+do
+not
+teach
+it
+as
+we
+should
+The
+truth
+would
+always
+stand
+if
+we
+did
+not
+deny
+it
+All
+leaders
+want
+a
+little
+theory
+of
+their
+own
+and
+want
+to
+gather
+the
+people
+around
+them
+and
+hold
+them
+They
+succeed
+for
+a
+while
+only
+for
+truth
+will
+spring
+up
+and
+spread
+Do
+not
+be
+afraid
+of
+the
+truth
+do
+not
+be
+ashamed
+of
+it
+Some
+day
+or
+other
+every
+one
+will
+have
+an
+understanding
+of
+truth
+It
+is
+there
+and
+it
+will
+blossom
+Do
+not
+clothe
+it
+with
+dogma
+and
+theory
+If
+I
+had
+taught
+the
+truth
+I
+should
+be
+so
+much
+happier
+and
+it
+would
+have
+been
+so
+much
+better
+for
+my
+Church
+I
+thank
+you
+for
+what
+you
+have
+done
+in
+publishing
+my
+little
+article
+It
+will
+shed
+a
+little
+light
+here
+and
+there
+People
+may
+say
+No
+and
+scoff
+but
+they
+cannot
+do
+so
+truthfully
+because
+my
+spirit
+will
+be
+there
+and
+impress
+the
+truth
+upon
+them
+I
+never
+felt
+that
+I
+was
+a
+little
+woman
+I
+felt
+that
+I
+had
+the
+power
+to
+conquer
+the
+world
+You
+can
+have
+that
+power
+too
+if
+fear
+does
+not
+interfere
+with
+you
+Concentrate
+and
+shut
+the
+door
+to
+fear
+Do
+not
+let
+fear
+come
+in
+If
+you
+feel
+fear
+say
+No
+no
+no
+I
+am
+not
+afraid
+I
+shall
+conquer
+and
+you
+will
+be
+surprised
+at
+your
+power
+In
+a
+moment
+you
+will
+feel
+you
+are
+a
+giant
+Shut
+the
+door
+to
+fear
+and
+open
+the
+door
+to
+spiritual
+power
+and
+the
+strength
+of
+God
+will
+flow
+in
+and
+give
+you
+strength
+and
+power
+to
+conquer
+You
+can
+never
+accomplish
+anything
+when
+you
+have
+fear
+Take
+five
+minutes
+each
+day
+and
+concentrate
+on
+fear
+Say
+Published
+in
+the
+magazine
+Reason
+I
+shall
+never
+be
+afraid
+I
+can
+conquer
+and
+keep
+on
+and
+on
+and
+you
+will
+be
+surprised
+at
+the
+result
+There
+is
+always
+worry
+and
+fear
+Worry
+is
+the
+sister
+to
+fear
+When
+you
+have
+conquered
+these
+two
+you
+will
+have
+strength
+and
+power
+and
+you
+can
+help
+in
+healing
+You
+can
+help
+everybody
+by
+just
+speaking
+a
+word
+to
+them
+When
+I
+had
+conquered
+fear
+and
+worry
+I
+sent
+my
+thoughts
+for
+strength
+and
+health
+to
+the
+persons
+who
+were
+sick
+That
+was
+power
+and
+removed
+the
+fear
+of
+sickness
+from
+them
+When
+you
+treat
+persons
+the
+first
+thing
+is
+to
+take
+away
+fear
+and
+worry
+Let
+them
+forget
+themselves
+Forget
+self
+and
+you
+will
+be
+surprised
+how
+strong
+and
+well
+you
+will
+be
+That
+is
+the
+secret
+of
+health
+It
+takes
+time
+to
+conquer
+do
+not
+be
+discouraged
+If
+it
+looks
+dark
+overcome
+fear
+and
+worry
+When
+you
+once
+have
+conquered
+you
+will
+be
+well
+You
+will
+be
+well
+and
+you
+will
+do
+well
+in
+every
+way
+Now
+I
+will
+say
+just
+a
+few
+words
+about
+my
+experience
+in
+the
+spirit
+world
+In
+the
+first
+place
+when
+I
+passed
+into
+the
+spirit
+side
+of
+life
+it
+was
+in
+one
+way
+surprising
+to
+me
+because
+I
+had
+concentrated
+that
+I
+should
+live
+forever
+and
+had
+gotten
+the
+idea
+in
+my
+mind
+that
+I
+would
+not
+die
+I
+had
+the
+idea
+that
+there
+is
+no
+death
+and
+that
+I
+would
+never
+die
+I
+took
+it
+literally
+I
+thought
+my
+body
+would
+never
+die
+and
+that
+I
+would
+stay
+on
+earth
+forever
+There
+is
+no
+death
+when
+you
+have
+understanding
+we
+only
+change
+the
+physical
+body
+for
+the
+spiritual
+My
+body
+began
+to
+grow
+old
+I
+concentrated
+and
+suggested
+but
+I
+used
+too
+much
+energy
+in
+my
+work
+and
+I
+wore
+out
+Finally
+I
+lost
+out
+and
+another
+stepped
+in
+at
+the
+last
+I
+was
+obsessed
+Of
+course
+my
+people
+did
+not
+know
+it
+but
+there
+were
+times
+when
+I
+was
+not
+myself
+I
+thought
+I
+would
+never
+die
+but
+I
+had
+to
+go
+just
+the
+same
+Now
+I
+can
+see
+how
+ridiculous
+the
+thing
+was
+You
+know
+I
+did
+not
+believe
+in
+matter
+There
+was
+no
+such
+thing
+as
+matter
+still
+my
+body
+was
+placed
+in
+a
+casket
+and
+sealed
+so
+well
+that
+my
+body
+could
+never
+get
+out
+of
+the
+casket
+It
+was
+sealed
+in
+many
+ways
+so
+nobody
+could
+get
+it
+If
+there
+is
+no
+matter
+why
+should
+all
+that
+money
+have
+been
+used
+to
+put
+my
+body
+into
+the
+grave
+That
+was
+against
+my
+teachings
+but
+we
+are
+material
+nevertheless
+When
+I
+woke
+up
+to
+life
+remember
+I
+say
+life
+because
+that
+was
+the
+real
+life
+I
+had
+a
+spirit
+body
+In
+my
+visions
+I
+had
+been
+to
+the
+spirit
+world
+many
+times
+and
+had
+always
+returned
+to
+earth
+This
+time
+I
+felt
+that
+I
+could
+go
+back
+again
+but
+my
+body
+was
+not
+there
+It
+had
+been
+interred
+Still
+I
+did
+not
+realize
+the
+change
+because
+I
+had
+closed
+the
+door
+for
+spirit
+return
+I
+did
+not
+want
+to
+teach
+it
+I
+knew
+it
+because
+I
+was
+a
+medium
+in
+my
+early
+days
+I
+gave
+readings
+in
+Boston
+for
+some
+time
+and
+I
+gave
+lectures
+as
+well
+but
+after
+a
+while
+I
+denied
+it
+all
+the
+truth
+was
+not
+in
+me
+When
+I
+woke
+up
+in
+my
+spirit
+body
+I
+still
+did
+not
+realize
+that
+it
+was
+not
+my
+material
+body
+It
+was
+very
+hard
+for
+me
+to
+understand
+that
+I
+had
+gone
+through
+the
+change
+called
+death
+because
+I
+had
+concentrated
+and
+concentrated
+that
+I
+should
+never
+die
+The
+realization
+took
+much
+time
+Then
+I
+had
+much
+to
+do
+and
+many
+difficulties
+to
+overcome
+First
+of
+all
+came
+my
+brother
+Albert
+When
+he
+came
+I
+felt
+that
+I
+did
+not
+want
+to
+have
+anything
+to
+do
+with
+spirits
+You
+see
+I
+said
+in
+my
+book
+that
+there
+is
+no
+such
+thing
+as
+spirit
+return
+I
+had
+so
+hypnotized
+myself
+with
+that
+theory
+that
+it
+was
+real
+to
+me
+Albert
+came
+and
+told
+me
+that
+I
+had
+not
+taught
+the
+whole
+truth
+There
+was
+a
+time
+when
+I
+was
+a
+medium
+and
+he
+talked
+through
+me
+but
+after
+a
+while
+I
+refused
+to
+allow
+this
+Now
+he
+came
+to
+me
+again
+and
+said
+Come
+I
+will
+show
+you
+that
+what
+you
+have
+taught
+is
+not
+true
+and
+that
+you
+did
+not
+tell
+the
+truth
+After
+that
+my
+first
+husband
+came
+He
+understood
+me
+better
+than
+the
+rest
+He
+showed
+me
+the
+way
+One
+by
+one
+many
+friends
+came
+Then
+came
+Quimby
+he
+said
+You
+took
+my
+theory
+Why
+did
+you
+not
+give
+me
+a
+little
+credit
+for
+the
+help
+I
+gave
+you
+Then
+I
+saw
+how
+selfish
+I
+had
+been
+I
+was
+accused
+I
+was
+helped
+but
+had
+not
+given
+credit
+for
+it
+I
+was
+obsessed
+when
+I
+was
+a
+young
+child
+and
+often
+had
+spells
+of
+obsession
+For
+many
+years
+those
+obsession
+spells
+came
+over
+me
+Quimby
+helped
+me
+he
+took
+the
+spirits
+away
+and
+taught
+me
+the
+true
+religion
+He
+taught
+me
+to
+know
+myself
+He
+taught
+me
+spirit
+return
+but
+I
+did
+not
+listen
+After
+he
+had
+gone
+I
+took
+his
+theory
+as
+my
+own
+In
+the
+spirit
+world
+I
+had
+to
+go
+through
+a
+great
+deal
+to
+over
+come
+selfishness
+I
+had
+to
+serve
+and
+learn
+the
+lesson
+of
+life
+as
+a
+little
+child
+I
+had
+to
+be
+taught
+about
+God
+in
+a
+different
+way
+Mental
+healing
+is
+something
+we
+should
+all
+learn
+It
+is
+of
+great
+importance
+Let
+us
+all
+learn
+to
+overcome
+by
+suggestion
+and
+concentration
+Get
+your
+mind
+centered
+and
+learn
+the
+art
+of
+concentration
+Take
+some
+object
+say
+that
+table
+concentrate
+and
+concentrate
+and
+try
+to
+hold
+your
+mind
+on
+that
+table
+nothing
+else
+for
+five
+minutes
+You
+cannot
+do
+it
+Try
+try
+very
+hard
+and
+after
+a
+while
+you
+will
+succeed
+That
+is
+the
+secret
+of
+health
+concentration
+is
+the
+secret
+of
+power
+You
+must
+be
+able
+to
+concentrate
+your
+mind
+on
+one
+object
+for
+five
+minutes
+This
+will
+require
+a
+long
+long
+time
+of
+practice
+It
+does
+not
+come
+to
+you
+at
+once
+because
+as
+soon
+as
+you
+try
+to
+concentrate
+and
+keep
+your
+mind
+absolutely
+on
+the
+table
+there
+will
+be
+a
+dozen
+other
+thoughts
+coming
+into
+your
+mind
+Keep
+them
+out
+and
+keep
+your
+mind
+on
+the
+object
+and
+you
+will
+find
+in
+time
+that
+I
+am
+right
+When
+you
+can
+concentrate
+your
+mind
+for
+even
+one
+or
+two
+minutes
+you
+have
+gained
+much
+Say
+to
+yourself
+I
+can
+concentrate
+for
+I
+have
+no
+fear
+or
+worry
+and
+keep
+on
+concentrating
+Shut
+other
+things
+out
+and
+keep
+on
+shutting
+them
+out
+and
+before
+you
+know
+it
+you
+will
+have
+strength
+and
+you
+will
+feel
+powerful
+because
+you
+have
+a
+part
+of
+life
+itself
+God
+When
+you
+have
+gained
+that
+power
+you
+can
+say
+to
+a
+sick
+person
+I
+send
+you
+power
+and
+you
+will
+have
+strength
+and
+health
+and
+you
+will
+be
+surprised
+how
+quickly
+recovery
+follows
+Before
+you
+try
+to
+send
+out
+that
+power
+concentrate
+your
+mind
+on
+one
+object
+for
+fifteen
+minutes
+Do
+not
+think
+Now
+I
+have
+the
+power
+in
+my
+hands
+and
+I
+can
+heal
+for
+you
+cannot
+heal
+if
+your
+mind
+is
+not
+there
+For
+that
+reason
+many
+healers
+are
+not
+successful
+The
+mind
+must
+be
+centered
+on
+one
+object
+before
+you
+can
+heal
+That
+is
+the
+secret
+of
+healing
+Now
+learn
+the
+lesson
+and
+conquer
+When
+you
+are
+sick
+or
+you
+go
+into
+a
+sick
+room
+concentrate
+your
+mind
+on
+some
+object
+Hold
+your
+mind
+on
+that
+object
+for
+a
+while
+and
+you
+will
+feel
+that
+you
+have
+great
+power
+and
+that
+you
+can
+heal
+because
+you
+will
+receive
+strength
+from
+God
+to
+heal
+That
+is
+another
+secret
+We
+should
+all
+understand
+it
+By
+concentration
+without
+fear
+and
+worry
+you
+can
+all
+heal
+but
+remember
+settle
+your
+mind
+first
+before
+you
+begin
+to
+heal
+for
+otherwise
+it
+will
+be
+of
+no
+use
+Now
+I
+have
+taken
+up
+too
+much
+of
+your
+time
+but
+I
+wanted
+to
+say
+a
+few
+words
+and
+to
+thank
+you
+for
+having
+my
+article
+published
+It
+will
+awaken
+some
+people
+and
+teach
+them
+to
+think
+and
+understand
+that
+the
+real
+life
+is
+on
+the
+other
+side
+Do
+not
+try
+to
+lean
+on
+others
+but
+stand
+by
+your
+own
+self
+and
+conquer
+self
+then
+you
+can
+help
+others
+and
+bring
+them
+together
+in
+one
+circle
+of
+harmony
+and
+you
+will
+have
+true
+happiness
+This
+is
+Mary
+Baker
+Eddy
+Thank
+you
+for
+letting
+me
+come
+Good
+Night
+CHAPTER
+XV
+Theosophy
+THAT
+the
+belief
+in
+reincarnation
+on
+earth
+is
+a
+fallacious
+one
+and
+prevents
+progression
+to
+higher
+spiritual
+realms
+after
+transition
+has
+been
+frequently
+declared
+by
+advanced
+spirits
+while
+numerous
+cases
+of
+obsession
+which
+have
+come
+under
+our
+care
+have
+been
+due
+to
+spirits
+who
+in
+endeavoring
+to
+reincarnate
+in
+children
+have
+found
+themselves
+imprisoned
+in
+the
+magnetic
+aura
+causing
+great
+suffering
+to
+both
+their
+victims
+and
+themselves
+A
+little
+boy
+in
+Chicago
+Jack
+T
+had
+been
+normal
+until
+the
+age
+of
+five
+when
+he
+began
+to
+manifest
+precocious
+tendencies
+and
+acted
+strangely
+Formerly
+he
+had
+had
+the
+natural
+disposition
+of
+a
+child
+but
+began
+to
+fret
+about
+things
+ordinarily
+foreign
+to
+a
+child
+s
+mind
+and
+acted
+in
+many
+ways
+like
+an
+adult
+He
+worried
+over
+trifles
+lay
+awake
+at
+night
+with
+strange
+mutterings
+and
+presentiments
+and
+at
+times
+had
+an
+uncontrollable
+temper
+He
+was
+a
+boy
+of
+good
+appearance
+but
+talked
+constantly
+of
+being
+old
+homely
+and
+ugly
+looking
+and
+was
+so
+intractable
+that
+efforts
+at
+reprimand
+and
+correction
+proved
+of
+no
+avail
+This
+condition
+became
+so
+aggravated
+that
+his
+family
+despaired
+of
+restoring
+the
+boy
+s
+reason
+A
+relative
+who
+knew
+of
+our
+experimental
+work
+in
+abnormal
+psychology
+wrote
+to
+the
+Institute
+requesting
+us
+to
+concentrate
+for
+the
+boy
+This
+was
+done
+and
+an
+entity
+whose
+actions
+and
+expressions
+were
+in
+every
+way
+like
+those
+of
+the
+boy
+was
+attracted
+to
+the
+psychic
+Mrs
+Wickland
+This
+entity
+said
+his
+name
+was
+Charlie
+Herrman
+he
+was
+aware
+of
+having
+died
+and
+declared
+he
+was
+a
+very
+homely
+man
+with
+ugly
+features
+and
+a
+face
+covered
+with
+pock
+marks
+Nobody
+had
+cared
+for
+him
+and
+this
+fact
+preyed
+on
+his
+mind
+Someone
+had
+once
+told
+him
+that
+after
+death
+individuals
+could
+reincarnate
+and
+become
+whatever
+they
+wished
+to
+be
+Since
+his
+only
+desire
+was
+to
+be
+good
+looking
+so
+that
+others
+would
+not
+shun
+him
+he
+decided
+to
+try
+and
+reincarnate
+As
+a
+result
+he
+became
+entangled
+in
+the
+magnetic
+aura
+of
+a
+small
+boy
+and
+was
+unable
+to
+free
+himself
+See
+Chap
+Page
+Spirit
+John
+Edwards
+Finding
+that
+he
+was
+helplessly
+imprisoned
+and
+incapable
+of
+making
+himself
+understood
+he
+had
+outbursts
+of
+temper
+and
+felt
+like
+flying
+to
+pieces
+They
+called
+me
+Jack
+at
+times
+but
+I
+am
+not
+Jack
+That
+was
+not
+my
+name
+and
+I
+could
+not
+understand
+Our
+concentration
+for
+the
+boy
+had
+freed
+the
+spirit
+and
+for
+this
+he
+was
+very
+grateful
+After
+instructions
+were
+given
+regarding
+spiritual
+progression
+and
+he
+had
+been
+assured
+that
+he
+need
+no
+longer
+be
+homely
+if
+he
+would
+discard
+old
+ideas
+from
+his
+mind
+forget
+self
+and
+strive
+to
+help
+others
+he
+expressed
+great
+eagerness
+to
+go
+with
+the
+spirits
+who
+he
+stated
+had
+come
+to
+help
+him
+In
+a
+letter
+written
+a
+few
+days
+later
+by
+the
+boy
+s
+mother
+we
+were
+informed
+that
+a
+remarkable
+change
+had
+occurred
+in
+the
+child
+Jack
+is
+now
+a
+boy
+again
+and
+has
+been
+very
+good
+this
+week
+really
+like
+he
+used
+to
+be
+He
+remained
+normal
+and
+received
+excellent
+grades
+in
+school
+where
+his
+progress
+from
+that
+time
+on
+was
+unusually
+rapid
+At
+one
+time
+we
+concentrated
+for
+a
+crippled
+child
+in
+Hollywood
+with
+interesting
+results
+EXPERIENCE
+NOVEMBER
+Spirit
+WILLIAM
+STANLEY
+Psychic
+MRS
+WICKLAND
+Spirit
+Is
+it
+really
+true
+that
+I
+am
+well
+now
+Can
+I
+talk
+Can
+I
+move
+my
+arms
+and
+feet
+Then
+reincarnation
+is
+true
+because
+before
+I
+could
+neither
+talk
+nor
+walk
+How
+did
+I
+get
+out
+of
+the
+child
+Doctor
+Intelligent
+spirits
+brought
+you
+here
+for
+help
+Sp
+I
+wanted
+to
+come
+back
+and
+reincarnate
+in
+a
+child
+and
+I
+got
+in
+and
+could
+not
+get
+out
+I
+was
+so
+paralyzed
+that
+I
+could
+not
+express
+myself
+and
+I
+was
+in
+an
+awful
+state
+I
+was
+a
+Theosophist
+and
+I
+wanted
+to
+reincarnate
+to
+be
+great
+I
+got
+into
+a
+child
+s
+body
+and
+crippled
+it
+and
+also
+crippled
+my
+mind
+and
+that
+of
+the
+child
+I
+stayed
+in
+the
+child
+because
+I
+did
+not
+know
+how
+to
+get
+out
+I
+acted
+as
+a
+child
+and
+I
+could
+not
+talk
+I
+know
+I
+passed
+out
+of
+my
+mortal
+body
+some
+years
+ago
+far
+away
+in
+India
+but
+I
+do
+not
+realize
+when
+it
+took
+place
+I
+wanted
+so
+much
+to
+reincarnate
+and
+to
+come
+back
+to
+this
+earth
+life
+to
+live
+my
+other
+Karma
+Do
+not
+hold
+on
+to
+the
+thought
+of
+coming
+back
+but
+look
+for
+something
+higher
+for
+the
+state
+I
+was
+in
+was
+the
+worst
+torture
+anybody
+could
+have
+I
+lived
+in
+Calcutta
+and
+wanted
+to
+learn
+to
+be
+a
+Master
+and
+go
+through
+my
+Karma
+but
+instead
+I
+am
+as
+you
+see
+me
+to
+be
+I
+reincarnated
+in
+a
+child
+and
+became
+crippled
+and
+I
+also
+got
+into
+the
+vibration
+of
+the
+mother
+It
+was
+very
+hard
+and
+I
+want
+to
+warn
+others
+never
+to
+come
+back
+and
+try
+to
+reincarnate
+through
+a
+little
+child
+Leave
+reincarnation
+alone
+because
+it
+is
+only
+a
+mistake
+but
+the
+philosophy
+of
+Theosophy
+is
+very
+fine
+Look
+upward
+don
+t
+think
+of
+the
+astral
+shells
+for
+they
+are
+of
+no
+use
+I
+was
+very
+selfish
+and
+wanted
+to
+come
+back
+to
+earth
+life
+just
+to
+be
+something
+great
+but
+instead
+I
+got
+into
+a
+very
+low
+state
+I
+had
+intended
+to
+show
+the
+Theosophists
+that
+I
+could
+come
+back
+and
+reincarnate
+in
+a
+child
+Madam
+Blavatsky
+should
+have
+taught
+differently
+Pointing
+to
+an
+invisible
+I
+will
+tell
+you
+Madam
+you
+are
+the
+one
+who
+is
+to
+blame
+for
+the
+condition
+I
+am
+in
+today
+Madam
+Blavatsky
+stands
+here
+trying
+to
+help
+me
+now
+She
+is
+the
+one
+who
+gave
+me
+the
+teachings
+and
+thoughts
+of
+reincarnation
+and
+now
+she
+is
+trying
+to
+show
+me
+the
+right
+way
+and
+states
+there
+is
+no
+such
+thing
+as
+reincarnation
+One
+gets
+all
+mixed
+up
+trying
+to
+enter
+another
+s
+body
+for
+reincarnation
+Dr
+What
+is
+your
+name
+Sp
+I
+cannot
+recall
+my
+name
+just
+now
+Madam
+Blavatsky
+was
+in
+India
+and
+taught
+Theosophy
+had
+many
+followers
+and
+I
+was
+with
+her
+I
+have
+also
+met
+Anna
+Kingsford
+and
+Dr
+Hartmann
+and
+he
+also
+was
+to
+blame
+for
+my
+condition
+They
+pushed
+me
+in
+here
+that
+I
+might
+be
+taught
+and
+freed
+I
+am
+so
+pleased
+that
+I
+can
+talk
+again
+that
+is
+something
+I
+have
+not
+been
+able
+to
+do
+for
+years
+Madam
+Blavatsky
+Anna
+Kingsford
+and
+the
+Judge
+were
+all
+great
+lights
+and
+now
+they
+have
+found
+out
+their
+big
+mistakes
+They
+are
+all
+working
+to
+get
+their
+victims
+free
+and
+so
+they
+brought
+me
+to
+this
+place
+for
+instruction
+and
+guidance
+I
+was
+in
+India
+having
+been
+there
+for
+many
+years
+My
+father
+was
+an
+officer
+in
+the
+Army
+I
+spent
+most
+of
+my
+time
+in
+Calcutta
+where
+I
+met
+all
+the
+great
+lights
+of
+Theosophy
+and
+I
+joined
+the
+Theosophical
+Society
+I
+liked
+Colonel
+Olcott
+he
+was
+a
+great
+fellow
+I
+remember
+being
+very
+sick
+in
+India
+for
+some
+time
+I
+have
+no
+desire
+to
+reincarnate
+again
+because
+reincarnation
+is
+a
+wrong
+doctrine
+It
+creates
+a
+selfishness
+to
+come
+back
+One
+can
+learn
+without
+being
+reincarnated
+What
+I
+suppose
+did
+I
+learn
+in
+my
+last
+reincarnation
+in
+the
+child
+What
+did
+I
+learn
+I
+believed
+in
+Theosophy
+and
+my
+Karma
+and
+I
+thought
+I
+had
+to
+go
+through
+with
+it
+Colonel
+Olcott
+belonged
+to
+the
+Great
+Masters
+He
+belonged
+to
+the
+spirit
+of
+Fire
+and
+Water
+I
+mean
+the
+elementals
+of
+Fire
+and
+Water
+Dr
+Have
+you
+ever
+heard
+of
+mediums
+Sp
+They
+are
+only
+astral
+shells
+Madam
+Blavatsky
+says
+we
+must
+all
+help
+those
+who
+try
+to
+reincarnate
+She
+and
+the
+others
+have
+come
+to
+say
+they
+are
+trying
+to
+help
+and
+for
+that
+purpose
+have
+formed
+a
+big
+society
+I
+thought
+I
+had
+come
+to
+life
+when
+I
+came
+here
+and
+that
+I
+could
+reincarnate
+and
+talk
+to
+them
+as
+I
+did
+in
+life
+I
+did
+not
+know
+they
+had
+passed
+over
+Teaching
+as
+they
+did
+why
+did
+they
+not
+reincarnate
+the
+same
+as
+I
+Madam
+Blavatsky
+was
+a
+great
+missionary
+as
+you
+know
+She
+says
+she
+is
+now
+trying
+to
+make
+all
+her
+victims
+understand
+about
+the
+life
+after
+this
+as
+it
+really
+is
+She
+says
+that
+she
+was
+a
+medium
+at
+one
+time
+but
+that
+she
+did
+not
+want
+anybody
+to
+control
+her
+She
+thought
+you
+should
+develop
+your
+own
+self
+and
+mental
+faculties
+and
+go
+through
+yourKarma
+I
+should
+not
+have
+been
+taught
+the
+falseness
+I
+was
+Madam
+tells
+me
+that
+I
+should
+listen
+to
+this
+gentleman
+Dr
+W
+and
+that
+he
+will
+explain
+things
+Explanations
+were
+given
+regarding
+life
+on
+the
+earth
+plane
+the
+preparation
+for
+the
+life
+that
+is
+to
+follow
+and
+the
+fact
+that
+the
+knowledge
+and
+wisdom
+gained
+here
+will
+be
+the
+light
+of
+understanding
+each
+one
+carries
+to
+the
+other
+side
+of
+life
+The
+spirit
+finally
+gave
+the
+name
+of
+William
+Stanley
+and
+departed
+grateful
+for
+the
+enlightenment
+he
+had
+received
+J
+A
+a
+listless
+crippled
+boy
+of
+seven
+years
+with
+an
+adult
+manner
+of
+speech
+was
+a
+patient
+from
+Chicago
+who
+suffered
+from
+convulsions
+and
+a
+slow
+hesitant
+stammering
+was
+notional
+about
+his
+food
+and
+subject
+to
+violent
+attacks
+of
+temper
+Through
+concentration
+a
+spirit
+was
+dislodged
+from
+him
+a
+superficial
+Theosophist
+who
+was
+peculiarly
+self
+hypnotized
+EXPERIENCE
+APRIL
+Spirit
+EDWARD
+JACKSON
+Patient
+J
+A
+PSYChiC
+MRS
+WICKLAND
+Doctor
+Have
+you
+been
+here
+before
+Spirit
+Slowly
+Myself
+do
+not
+know
+Dr
+How
+old
+are
+you
+Sp
+Drawling
+Me
+do
+not
+know
+Dr
+Where
+did
+you
+come
+from
+Sp
+Where
+they
+shot
+fire
+at
+me
+Static
+treatment
+given
+patient
+Dr
+How
+old
+are
+you
+Sp
+Myself
+do
+not
+know
+Dr
+Don
+t
+you
+understand
+that
+you
+have
+lost
+your
+physical
+body
+and
+are
+a
+spirit
+Listen
+to
+intelligent
+spirits
+who
+will
+help
+you
+Sp
+Me
+does
+not
+know
+anything
+about
+spirits
+Dr
+Don
+t
+you
+want
+to
+know
+something
+about
+them
+Where
+did
+you
+expect
+to
+go
+after
+death
+Sp
+Me
+does
+not
+know
+Dr
+Would
+you
+like
+to
+know
+anything
+Sp
+That
+takes
+care
+of
+itself
+Dr
+If
+you
+had
+been
+more
+concerned
+about
+the
+facts
+of
+life
+you
+would
+not
+be
+in
+this
+condition
+you
+would
+be
+in
+the
+spirit
+world
+Do
+you
+know
+anything
+about
+the
+spirit
+world
+Sp
+No
+Dr
+Would
+you
+care
+to
+know
+Sp
+I
+do
+not
+know
+Dr
+You
+must
+want
+to
+know
+You
+have
+lost
+your
+mortal
+body
+and
+do
+not
+understand
+it
+Sp
+I
+don
+t
+care
+Dr
+You
+will
+have
+to
+care
+Are
+you
+happy
+in
+your
+present
+condition
+Sp
+No
+Dr
+Were
+you
+sick
+Sp
+I
+was
+Dr
+What
+was
+the
+matter
+with
+you
+Sp
+Crippled
+Dr
+Where
+did
+you
+live
+Sp
+I
+don
+t
+know
+It
+is
+a
+long
+time
+since
+I
+was
+born
+Dr
+Were
+you
+a
+man
+or
+a
+woman
+Sp
+I
+suppose
+I
+am
+a
+man
+Dr
+Were
+you
+married
+Sp
+No
+Dr
+Why
+Sp
+No
+one
+likes
+a
+cripple
+and
+I
+stuttered
+and
+stuttered
+a
+great
+deal
+I
+also
+studied
+Dr
+What
+did
+you
+study
+Sp
+All
+kinds
+of
+books
+that
+came
+my
+way
+Dr
+On
+religion
+Sp
+Why
+yes
+Dr
+Were
+you
+orthodox
+Sp
+No
+thank
+God
+Dr
+Did
+you
+have
+any
+fixed
+opinions
+at
+all
+Sp
+Once
+for
+a
+time
+I
+studied
+Then
+I
+was
+shut
+up
+in
+one
+place
+one
+time
+and
+another
+place
+another
+time
+It
+is
+the
+fourth
+time
+I
+have
+been
+reincarnated
+Obsessed
+sensitives
+Twice
+I
+got
+in
+a
+cripple
+Dr
+Were
+you
+a
+cripple
+in
+the
+first
+place
+Sp
+I
+do
+not
+remember
+anything
+about
+it
+People
+told
+me
+to
+remember
+about
+my
+lives
+but
+I
+do
+not
+I
+know
+I
+was
+once
+a
+cripple
+and
+then
+I
+got
+into
+somebody
+and
+was
+more
+crippled
+But
+I
+got
+out
+I
+do
+not
+know
+how
+I
+got
+out
+I
+feel
+stronger
+now
+than
+I
+have
+before
+I
+thought
+when
+I
+reincarnated
+I
+should
+be
+a
+nice
+young
+man
+but
+instead
+I
+got
+crippled
+because
+I
+suppose
+my
+mind
+was
+crippled
+Dr
+What
+did
+they
+call
+you
+when
+you
+were
+a
+cripple
+Sp
+I
+had
+so
+many
+names
+but
+you
+know
+I
+liked
+the
+last
+time
+I
+liked
+it
+very
+much
+to
+be
+a
+rich
+man
+s
+son
+so
+I
+did
+not
+need
+to
+work
+I
+had
+my
+father
+to
+work
+for
+me
+I
+had
+a
+good
+time
+Dr
+Did
+you
+become
+a
+rich
+man
+s
+son
+Sp
+In
+a
+way
+yes
+and
+in
+another
+way
+no
+Dr
+What
+is
+your
+name
+Sp
+My
+name
+was
+once
+upon
+a
+time
+I
+do
+not
+know
+Some
+time
+ago
+when
+I
+was
+studying
+Theosophy
+I
+was
+a
+cripple
+born
+Some
+friends
+brought
+some
+books
+to
+me
+about
+Madam
+Blavatsky
+They
+called
+me
+Edward
+Jackson
+Dr
+What
+other
+names
+did
+you
+have
+Sp
+The
+other
+was
+J
+Dr
+Was
+J
+a
+grown
+man
+or
+a
+boy
+Sp
+I
+do
+not
+like
+that
+fire
+shooting
+and
+someone
+talking
+all
+kinds
+of
+things
+Why
+cannot
+I
+reincarnate
+and
+not
+be
+a
+cripple
+all
+the
+time
+Dr
+I
+suppose
+when
+you
+found
+yourself
+in
+a
+rich
+man
+s
+family
+and
+thought
+of
+reincarnation
+you
+believed
+you
+were
+experiencing
+your
+former
+condition
+again
+Sp
+It
+is
+Karma
+to
+develop
+one
+s
+highest
+self
+so
+the
+Theosophists
+say
+They
+chased
+me
+out
+so
+I
+tried
+again
+because
+I
+wanted
+to
+know
+if
+that
+theory
+is
+true
+or
+not
+Dr
+It
+is
+very
+true
+in
+one
+way
+earthbound
+spirits
+can
+control
+mortal
+sensitives
+That
+is
+very
+true
+Sp
+They
+must
+live
+out
+their
+Karma
+which
+has
+been
+put
+out
+for
+them
+it
+is
+the
+only
+way
+Dr
+Where
+did
+you
+come
+from
+SP
+Chicago
+I
+was
+going
+to
+be
+a
+rich
+man
+s
+son
+but
+I
+was
+turned
+out
+Dr
+Did
+you
+like
+that
+Sp
+I
+was
+fighting
+and
+when
+I
+get
+mad
+I
+do
+not
+care
+what
+I
+say
+and
+I
+get
+mad
+once
+in
+a
+while
+Sometimes
+I
+get
+so
+mad
+because
+I
+shall
+be
+a
+cripple
+all
+my
+life
+When
+I
+reincarnated
+I
+got
+into
+the
+same
+crippled
+state
+again
+Dr
+Don
+t
+you
+think
+you
+had
+better
+stop
+trying
+to
+reincarnate
+Sp
+I
+must
+live
+out
+my
+Karma
+and
+must
+not
+interfere
+with
+it
+Dr
+Then
+you
+must
+continue
+suffering
+because
+of
+your
+foolishness
+Sp
+I
+was
+trying
+to
+get
+to
+Devachan
+I
+was
+not
+well
+educated
+but
+I
+read
+up
+on
+Devachan
+which
+is
+the
+resting
+place
+where
+they
+reincarnate
+again
+Dr
+You
+came
+back
+too
+soon
+Sp
+Theosophy
+appealed
+to
+my
+mind
+and
+then
+I
+wanted
+to
+have
+a
+good
+time
+You
+must
+not
+interfere
+with
+your
+Karma
+You
+can
+choose
+your
+life
+and
+I
+was
+going
+to
+have
+plenty
+of
+money
+but
+I
+got
+crippled
+again
+But
+my
+mind
+was
+good
+They
+said
+you
+should
+not
+think
+of
+your
+former
+life
+Dr
+Who
+told
+you
+that
+Sp
+They
+said
+you
+should
+progress
+and
+not
+interfere
+with
+your
+Karma
+then
+you
+would
+get
+to
+Devachan
+I
+suppose
+I
+must
+be
+an
+astral
+shell
+I
+did
+not
+study
+enough
+Dr
+Would
+you
+like
+to
+use
+a
+little
+discrimination
+and
+progress
+in
+the
+right
+way
+to
+the
+spirit
+life
+Sp
+I
+want
+to
+go
+to
+Devachan
+that
+is
+the
+best
+place
+for
+me
+Then
+you
+can
+be
+a
+Master
+Dr
+You
+should
+become
+a
+Master
+of
+your
+own
+destiny
+Sp
+I
+want
+to
+be
+a
+Great
+Master
+Then
+I
+would
+not
+be
+a
+cripple
+and
+would
+have
+lived
+out
+my
+Karma
+Dr
+How
+were
+you
+crippled
+Sp
+In
+my
+legs
+Dr
+Could
+you
+not
+walk
+Sp
+No
+my
+knees
+were
+too
+weak
+and
+my
+ankles
+were
+weak
+I
+am
+crippled
+all
+over
+now
+Dr
+Could
+you
+think
+and
+talk
+SP
+Yes
+Dr
+Do
+you
+like
+corn
+meal
+mush
+An
+especial
+aversion
+of
+the
+patient
+Sp
+I
+don
+t
+know
+what
+you
+mean
+Dr
+Are
+you
+particular
+about
+eating
+Sp
+I
+will
+not
+eat
+meat
+and
+not
+much
+fish
+I
+like
+to
+have
+some
+raw
+vegetables
+I
+want
+my
+food
+more
+sun
+kissed
+I
+want
+to
+go
+to
+Devachan
+and
+be
+a
+Master
+Dr
+Master
+of
+what
+Sp
+Master
+of
+Higher
+Things
+I
+want
+to
+be
+a
+Master
+Dr
+Madam
+Blavatsky
+denies
+reincarnation
+now
+and
+says
+it
+is
+folly
+Sp
+She
+doesn
+t
+know
+what
+she
+is
+talking
+about
+Dr
+Do
+you
+want
+to
+be
+perfectly
+well
+again
+Sp
+Then
+I
+have
+to
+reincarnate
+again
+Dr
+Now
+wake
+up
+and
+be
+sensible
+Understand
+you
+are
+a
+spirit
+You
+are
+now
+controlling
+the
+body
+of
+my
+wife
+Sp
+I
+did
+not
+reincarnate
+in
+another
+person
+s
+body
+I
+thought
+next
+time
+I
+would
+reincarnate
+differently
+You
+say
+I
+am
+a
+woman
+now
+I
+do
+not
+want
+to
+be
+a
+girl
+I
+want
+to
+be
+a
+man
+Dr
+You
+are
+using
+a
+woman
+s
+body
+just
+now
+Sp
+I
+have
+to
+be
+born
+again
+even
+if
+I
+am
+crippled
+Dr
+Don
+t
+be
+foolish
+Realize
+you
+are
+no
+longer
+crippled
+Sp
+How
+can
+you
+tell
+any
+one
+not
+to
+be
+a
+cripple
+when
+they
+are
+Dr
+You
+are
+now
+a
+free
+spirit
+temporarily
+controlling
+a
+woman
+s
+body
+Sp
+I
+do
+not
+understand
+what
+you
+are
+talking
+about
+Dr
+Your
+Devachan
+does
+not
+work
+at
+all
+You
+did
+not
+study
+thoroughly
+Sp
+Yes
+I
+did
+but
+I
+disregarded
+it
+Dr
+Do
+not
+talk
+such
+nonsense
+It
+makes
+nice
+earthbound
+spirits
+Sp
+We
+have
+to
+reincarnate
+to
+learn
+and
+get
+all
+kinds
+of
+experiences
+Dr
+I
+suppose
+you
+could
+not
+progress
+to
+Devachan
+if
+you
+did
+not
+have
+all
+the
+different
+experiences
+Sp
+You
+have
+to
+come
+back
+and
+learn
+them
+Dr
+Do
+you
+know
+what
+you
+have
+been
+doing
+You
+have
+been
+controlling
+different
+persons
+and
+disturbing
+their
+lives
+An
+ignorant
+spirit
+ruins
+the
+life
+of
+a
+mortal
+sensitive
+by
+clinging
+to
+him
+You
+have
+been
+brought
+here
+for
+help
+and
+are
+now
+controlling
+my
+wife
+s
+body
+Sp
+I
+have
+to
+reincarnate
+in
+your
+wife
+No
+I
+must
+reincarnate
+in
+a
+child
+and
+be
+born
+again
+Dr
+This
+is
+not
+your
+body
+It
+belongs
+to
+my
+wife
+and
+you
+are
+using
+it
+temporarily
+Sp
+Then
+I
+have
+to
+reincarnate
+in
+your
+wife
+Dr
+You
+are
+controlling
+her
+body
+for
+a
+short
+time
+only
+Look
+at
+this
+hand
+do
+you
+know
+it
+Sp
+I
+have
+reincarnated
+again
+in
+your
+wife
+s
+body
+No
+you
+must
+reincarnate
+again
+in
+a
+child
+and
+be
+born
+again
+Dr
+You
+do
+not
+know
+what
+you
+are
+talking
+about
+If
+you
+understood
+the
+truth
+you
+would
+not
+talk
+as
+you
+do
+You
+are
+an
+earthbound
+spirit
+making
+cripples
+of
+children
+Sp
+That
+is
+my
+Karma
+I
+have
+to
+so
+live
+until
+I
+get
+Devachan
+Dr
+You
+live
+so
+only
+because
+of
+your
+ignorance
+Sp
+When
+you
+have
+a
+chance
+to
+reincarnate
+why
+should
+you
+not
+do
+it
+Dr
+When
+you
+have
+a
+chance
+to
+take
+possession
+of
+the
+body
+of
+another
+and
+ruin
+his
+life
+is
+it
+right
+to
+do
+so
+Sp
+I
+would
+just
+as
+soon
+be
+that
+spirit
+in
+that
+body
+Dr
+The
+asylums
+are
+full
+of
+people
+who
+are
+controlled
+by
+earthbound
+spirits
+like
+you
+You
+have
+been
+ruining
+the
+lives
+of
+children
+Evidently
+you
+have
+come
+from
+a
+boy
+we
+know
+When
+we
+applied
+static
+sparks
+to
+the
+boy
+we
+got
+you
+out
+Now
+you
+are
+allowed
+to
+control
+my
+wife
+s
+body
+temporarily
+and
+we
+are
+trying
+to
+make
+you
+understand
+your
+condition
+Sp
+That
+has
+nothing
+to
+do
+with
+my
+Karma
+Dr
+You
+have
+lost
+your
+physical
+body
+a
+long
+time
+ago
+Do
+you
+realize
+that
+you
+are
+controlling
+my
+wife
+s
+body
+Sp
+It
+is
+my
+Karma
+and
+I
+don
+t
+care
+Dr
+You
+have
+been
+bothering
+a
+little
+boy
+and
+you
+should
+now
+listen
+to
+what
+is
+being
+told
+you
+Sp
+I
+know
+the
+only
+truth
+is
+reincarnation
+I
+have
+reincarnated
+and
+I
+will
+again
+Dr
+You
+will
+have
+to
+leave
+at
+once
+if
+you
+cannot
+be
+sensible
+Sp
+You
+cannot
+frighten
+me
+out
+I
+am
+reincarnated
+Dr
+Where
+is
+your
+mother
+Sp
+She
+is
+in
+Devachan
+She
+is
+ready
+to
+reincarnate
+again
+Dr
+You
+will
+soon
+see
+spirits
+who
+will
+show
+you
+something
+different
+Sp
+They
+are
+only
+astral
+shells
+Dr
+They
+will
+put
+you
+in
+a
+dark
+dungeon
+You
+do
+not
+know
+the
+A
+B
+C
+of
+Theosophy
+You
+do
+not
+want
+to
+know
+Sp
+You
+cannot
+stop
+my
+talking
+if
+I
+want
+to
+talk
+I
+am
+reincarnated
+again
+I
+am
+going
+to
+live
+out
+this
+Karma
+If
+I
+am
+a
+woman
+now
+I
+will
+live
+it
+out
+If
+I
+get
+killed
+that
+is
+part
+of
+my
+Karma
+I
+will
+just
+have
+to
+study
+and
+get
+in
+the
+Inner
+Circle
+and
+know
+that
+God
+is
+my
+Creator
+I
+have
+reincarnated
+and
+I
+will
+reincarnate
+again
+then
+go
+to
+Devachan
+and
+be
+happy
+I
+will
+finish
+my
+Karma
+Dr
+You
+get
+out
+and
+take
+your
+Karma
+with
+you
+Sp
+You
+think
+you
+are
+going
+to
+take
+away
+what
+is
+my
+Karma
+but
+you
+will
+not
+I
+am
+happy
+and
+I
+am
+going
+Smiling
+beatifically
+the
+spirit
+departed
+Several
+extracts
+are
+given
+from
+remarks
+made
+in
+our
+circle
+at
+various
+times
+by
+the
+spirit
+of
+Ralph
+S
+son
+in
+law
+of
+a
+lady
+who
+attended
+our
+circles
+He
+and
+his
+wife
+in
+former
+years
+had
+been
+deeply
+interested
+in
+Theosophy
+and
+when
+he
+reached
+the
+spirit
+world
+he
+had
+found
+it
+difficult
+to
+free
+himself
+from
+preconceived
+ideas
+EXPERIENCE
+MARCH
+Spirit
+RALPH
+S
+Psychic
+MRS
+WICKLAND
+Spirit
+I
+have
+been
+here
+before
+and
+I
+was
+so
+anxious
+to
+come
+again
+Doctor
+Who
+are
+you
+friend
+Sp
+Don
+t
+you
+know
+who
+I
+am
+I
+am
+Ralph
+S
+I
+studied
+a
+great
+deal
+about
+Theosophy
+and
+the
+law
+of
+developing
+myself
+regarding
+the
+higher
+things
+but
+forgot
+to
+study
+the
+truth
+My
+wife
+and
+I
+studied
+to
+develop
+ourselves
+aiming
+for
+the
+highest
+but
+we
+forgot
+to
+learn
+the
+simple
+lesson
+of
+life
+everlasting
+How
+little
+we
+know
+of
+the
+world
+beyond
+How
+I
+do
+wish
+we
+had
+both
+understood
+more
+of
+life
+There
+is
+so
+much
+dogma
+Now
+I
+have
+so
+much
+to
+unlearn
+so
+much
+to
+overcome
+Dr
+Love
+is
+the
+fulfillment
+of
+the
+law
+Sp
+Yes
+we
+have
+to
+serve
+Ques
+Are
+you
+happy
+Sp
+In
+one
+way
+yes
+but
+not
+in
+another
+If
+only
+the
+door
+were
+not
+closed
+Ques
+Which
+door
+Sp
+The
+door
+of
+communication
+My
+wife
+would
+be
+afraid
+if
+I
+tried
+to
+manifest
+myself
+to
+her
+It
+hurts
+me
+We
+studied
+and
+studied
+so
+much
+and
+it
+was
+very
+hard
+to
+find
+that
+when
+I
+reached
+the
+spirit
+side
+of
+life
+I
+knew
+so
+little
+and
+was
+in
+darkness
+I
+am
+pleased
+to
+know
+Mother
+that
+you
+are
+not
+ashamed
+to
+stand
+for
+the
+truth
+Give
+it
+to
+others
+as
+much
+as
+you
+can
+for
+it
+will
+help
+you
+in
+return
+EXPERIENCE
+APRIL
+Spirit
+RALPH
+S
+Psychic
+MRS
+WICKLAND
+Here
+I
+am
+again
+This
+is
+Ralph
+Mother
+I
+want
+to
+come
+to
+my
+wife
+but
+cannot
+as
+the
+door
+is
+shut
+I
+know
+it
+is
+as
+much
+my
+fault
+as
+it
+is
+my
+wife
+s
+The
+door
+is
+shut
+for
+me
+and
+will
+be
+for
+some
+time
+because
+of
+the
+dogma
+and
+creed
+there
+is
+in
+the
+mind
+If
+only
+my
+wife
+would
+realize
+the
+truth
+it
+is
+so
+simple
+but
+the
+simple
+truth
+is
+always
+rejected
+Something
+mysterious
+is
+always
+accepted
+We
+thought
+that
+by
+working
+out
+our
+Karma
+everything
+would
+be
+all
+right
+but
+we
+developed
+selfishness
+It
+is
+selfish
+to
+shut
+yourself
+up
+and
+try
+to
+be
+a
+Master
+Master
+of
+what
+We
+should
+try
+to
+master
+ourselves
+try
+to
+learn
+about
+all
+things
+look
+up
+to
+all
+things
+because
+God
+is
+in
+all
+things
+and
+is
+Love
+and
+Wisdom
+We
+should
+not
+feel
+that
+because
+of
+a
+little
+learning
+we
+are
+better
+than
+others
+merely
+because
+we
+studied
+to
+be
+Great
+Masters
+We
+speak
+of
+things
+of
+which
+we
+do
+not
+realize
+the
+full
+import
+and
+we
+make
+ourselves
+sensitive
+and
+become
+obsessed
+I
+realize
+now
+how
+dangerous
+the
+doctrine
+of
+Reincarnation
+is
+According
+to
+that
+doctrine
+this
+would
+be
+the
+time
+for
+me
+to
+reincarnate
+Should
+I
+reincarnate
+and
+obsess
+a
+child
+and
+tie
+both
+of
+us
+up
+in
+one
+body
+until
+such
+time
+as
+the
+child
+leaves
+the
+mortal
+The
+two
+made
+an
+agreement
+that
+should
+one
+pass
+out
+the
+other
+would
+not
+try
+to
+establish
+communication
+considering
+this
+to
+be
+a
+hinderance
+to
+the
+ego
+In
+its
+progression
+to
+Devachan
+body
+Why
+should
+I
+reincarnate
+and
+make
+a
+child
+become
+an
+idiot
+All
+creeds
+should
+be
+set
+aside
+and
+we
+should
+seek
+the
+simple
+truth
+of
+life
+Love
+God
+above
+all
+things
+and
+your
+neighbor
+as
+yourself
+There
+would
+be
+great
+rejoicing
+if
+everybody
+tried
+to
+live
+up
+to
+that
+teaching
+then
+there
+would
+be
+true
+happiness
+Creeds
+and
+dogmas
+interfere
+and
+make
+us
+selfish
+and
+selfishness
+is
+the
+root
+of
+all
+evil
+I
+am
+to
+blame
+for
+the
+present
+conditions
+surrounding
+my
+wife
+Her
+refusal
+to
+receive
+spirit
+communications
+My
+work
+now
+is
+to
+come
+down
+to
+earth
+to
+help
+the
+ones
+who
+believe
+in
+the
+same
+theory
+as
+I
+did
+and
+are
+engaged
+in
+the
+same
+study
+I
+was
+I
+have
+to
+work
+hard
+trying
+to
+bring
+them
+to
+realize
+the
+truth
+I
+must
+also
+work
+to
+try
+to
+bring
+my
+wife
+to
+the
+realization
+that
+she
+must
+not
+go
+into
+that
+dogma
+any
+further
+If
+she
+does
+she
+will
+become
+more
+psychic
+and
+will
+be
+obsessed
+by
+some
+theory
+or
+other
+I
+do
+not
+mean
+obsessed
+by
+spirits
+but
+ideas
+I
+was
+more
+deeply
+steeped
+in
+the
+dogma
+of
+reincarnation
+than
+my
+wife
+because
+I
+was
+further
+advanced
+in
+my
+studies
+I
+went
+into
+the
+subject
+deeper
+than
+she
+We
+were
+both
+so
+selfish
+in
+our
+theory
+that
+we
+could
+not
+see
+anything
+else
+and
+we
+condemned
+all
+other
+theories
+We
+felt
+we
+were
+better
+than
+many
+others
+because
+we
+lived
+to
+sacrifice
+Having
+adhered
+to
+a
+restricted
+diet
+a
+supposed
+requirement
+for
+spiritual
+attainment
+The
+body
+is
+only
+a
+dress
+for
+the
+spirit
+We
+should
+eat
+what
+comes
+before
+us
+Let
+us
+not
+put
+our
+minds
+on
+eating
+and
+drinking
+We
+should
+not
+sacrifice
+our
+bodies
+and
+crucify
+the
+flesh
+to
+become
+more
+spiritual
+That
+was
+never
+meant
+to
+be
+Take
+care
+of
+your
+body
+but
+do
+not
+rob
+it
+of
+its
+needs
+God
+gave
+it
+to
+you
+to
+take
+care
+of
+Keep
+it
+in
+a
+healthy
+condition
+so
+the
+spirit
+can
+work
+through
+it
+to
+the
+best
+advantage
+It
+does
+not
+make
+us
+spiritual
+to
+abstain
+from
+certain
+foods
+We
+need
+specific
+elements
+for
+the
+body
+so
+let
+us
+strive
+our
+utmost
+to
+take
+care
+of
+it
+My
+wife
+is
+hard
+to
+reach
+We
+had
+agreed
+not
+to
+try
+to
+call
+each
+other
+back
+after
+death
+We
+were
+hypnotized
+by
+our
+theosophical
+theory
+that
+we
+must
+go
+on
+and
+clear
+our
+Karma
+and
+that
+we
+cannot
+open
+the
+door
+to
+the
+higher
+life
+unless
+we
+go
+very
+slowly
+This
+makes
+it
+much
+harder
+for
+me
+I
+am
+to
+blame
+as
+much
+as
+she
+is
+I
+shut
+the
+door
+for
+her
+as
+much
+as
+she
+shut
+the
+door
+for
+me
+I
+condemned
+Spiritualism
+because
+I
+thought
+the
+theory
+we
+held
+was
+the
+real
+one
+and
+that
+everything
+else
+was
+false
+Of
+course
+there
+is
+some
+deception
+in
+Spiritualism
+but
+there
+is
+good
+as
+well
+as
+bad
+in
+every
+movement
+Let
+us
+not
+be
+carried
+away
+by
+anything
+let
+us
+use
+reason
+in
+all
+things
+EXPERIENCE
+NOVEMBER
+Spirit
+RALPH
+S
+Psychic
+MRS
+WICKLAND
+It
+will
+soon
+be
+three
+years
+since
+I
+passed
+away
+but
+in
+those
+three
+years
+I
+have
+learned
+a
+great
+deal
+I
+did
+not
+find
+conditions
+as
+I
+had
+believed
+them
+I
+am
+sorry
+that
+I
+was
+so
+set
+in
+my
+mind
+on
+the
+theory
+of
+Theosophy
+that
+we
+must
+come
+back
+again
+and
+again
+in
+order
+to
+reach
+the
+higher
+plane
+Since
+I
+have
+come
+to
+the
+spirit
+side
+of
+life
+I
+have
+not
+had
+any
+thought
+of
+coming
+back
+except
+to
+help
+my
+dear
+wife
+We
+both
+studied
+to
+learn
+about
+life
+but
+after
+I
+came
+here
+I
+tried
+to
+impress
+her
+that
+there
+was
+nothing
+more
+to
+learn
+about
+the
+religion
+we
+had
+both
+studied
+because
+it
+is
+not
+the
+true
+religion
+If
+I
+came
+back
+I
+could
+not
+reincarnate
+as
+I
+thought
+I
+would
+rather
+come
+back
+to
+help
+my
+wife
+and
+learn
+all
+I
+can
+about
+spirit
+return
+than
+to
+come
+and
+stay
+in
+one
+state
+for
+a
+certain
+time
+then
+come
+back
+again
+as
+a
+baby
+I
+had
+said
+to
+my
+wife
+that
+I
+would
+not
+come
+back
+to
+her
+because
+I
+wanted
+to
+go
+on
+and
+be
+a
+Master
+We
+think
+a
+Master
+is
+one
+who
+is
+very
+highly
+developed
+and
+cannot
+do
+anything
+but
+be
+holy
+You
+do
+not
+want
+to
+become
+such
+a
+Master
+the
+greatest
+masters
+serve
+The
+more
+we
+learn
+in
+the
+spirit
+world
+the
+more
+we
+want
+to
+serve
+Here
+we
+want
+to
+help
+to
+learn
+to
+teach
+others
+Christ
+is
+worshipped
+as
+a
+Master
+Did
+He
+come
+back
+He
+went
+among
+the
+poor
+and
+lowly
+trying
+to
+teach
+and
+serve
+people
+and
+to
+help
+them
+to
+a
+higher
+life
+and
+understanding
+Learn
+the
+truth
+give
+it
+to
+others
+and
+serve
+others
+Be
+a
+master
+in
+learning
+but
+humble
+in
+serving
+When
+we
+have
+learned
+to
+serve
+others
+we
+have
+learned
+the
+lesson
+Christ
+taught
+When
+we
+have
+reached
+that
+state
+we
+can
+love
+our
+enemies
+as
+ourselves
+and
+God
+above
+all
+things
+Then
+we
+are
+masters
+That
+does
+not
+mean
+that
+we
+are
+so
+high
+that
+we
+cannot
+come
+back
+to
+serve
+to
+teach
+to
+help
+others
+It
+means
+that
+we
+must
+all
+be
+masters
+of
+ourselves
+and
+conquer
+all
+desires
+In
+a
+little
+talk
+given
+one
+evening
+by
+one
+whose
+writings
+were
+well
+known
+to
+many
+reincarnation
+was
+also
+mentioned
+EXPERIENCE
+JANUARY
+Spirit
+ELLA
+WHEELER
+WILCOX
+Psychic
+MRS
+WICKLAND
+Good
+Evening
+I
+have
+not
+been
+here
+before
+But
+I
+heard
+of
+you
+while
+I
+was
+on
+earth
+and
+I
+also
+heard
+of
+your
+work
+and
+had
+read
+your
+pamphlet
+We
+should
+all
+try
+to
+understand
+the
+true
+meaning
+of
+God
+but
+how
+few
+try
+to
+understand
+the
+actual
+truth
+Truth
+is
+always
+crucified
+Truth
+should
+be
+known
+and
+not
+clothed
+with
+all
+sorts
+of
+creeds
+When
+I
+was
+in
+earth
+life
+I
+was
+once
+a
+bond
+servant
+with
+wrong
+ideas
+and
+foolish
+thoughts
+of
+truth
+but
+toward
+the
+last
+the
+simple
+truth
+and
+an
+understanding
+of
+the
+real
+life
+beyond
+were
+shown
+to
+me
+and
+I
+accepted
+them
+The
+truth
+had
+to
+come
+to
+me
+through
+sorrow
+We
+do
+not
+seek
+for
+truth
+until
+we
+have
+had
+a
+deep
+sorrow
+such
+as
+losing
+a
+dear
+husband
+or
+friend
+then
+the
+heart
+seeks
+after
+the
+truth
+and
+will
+not
+let
+dogmas
+and
+creeds
+stand
+in
+the
+way
+We
+are
+hungry
+to
+know
+about
+the
+life
+beyond
+and
+to
+learn
+if
+our
+dear
+ones
+and
+friends
+are
+with
+us
+to
+guide
+and
+help
+I
+felt
+the
+loss
+of
+my
+dear
+husband
+so
+keenly
+that
+I
+was
+brokenhearted
+I
+could
+not
+think
+that
+I
+would
+not
+be
+with
+him
+and
+near
+him
+again
+but
+the
+light
+of
+truth
+and
+the
+understanding
+that
+there
+is
+no
+death
+came
+to
+me
+and
+I
+felt
+him
+around
+me
+This
+beautiful
+truth
+will
+come
+to
+everyone
+who
+earnestly
+seeks
+after
+it
+and
+after
+finding
+it
+we
+must
+stand
+for
+it
+in
+all
+honesty
+and
+sincerity
+because
+if
+we
+do
+not
+doubt
+will
+come
+in
+and
+fear
+and
+shut
+the
+door
+for
+our
+dear
+ones
+who
+have
+only
+gone
+ahead
+to
+prepare
+our
+home
+everlasting
+How
+we
+mortals
+are
+clothed
+with
+doubt
+and
+when
+the
+truth
+of
+continued
+existence
+is
+presented
+to
+us
+even
+then
+we
+doubt
+The
+Bible
+is
+full
+of
+the
+beautiful
+truth
+which
+is
+revealed
+to
+us
+but
+still
+we
+all
+doubt
+When
+I
+found
+the
+truth
+I
+wanted
+to
+teach
+it
+to
+the
+world
+but
+my
+physical
+body
+was
+not
+strong
+enough
+to
+do
+what
+I
+should
+have
+liked
+I
+tried
+to
+tell
+it
+to
+the
+soldiers
+because
+I
+knew
+that
+to
+them
+the
+truth
+would
+be
+a
+Godsend
+because
+they
+were
+here
+today
+and
+tomorrow
+there
+Should
+I
+not
+when
+I
+had
+found
+the
+truth
+give
+them
+the
+understanding
+that
+there
+is
+no
+death
+They
+then
+felt
+that
+they
+could
+go
+right
+on
+and
+fight
+because
+they
+realized
+that
+death
+was
+not
+the
+end
+of
+life
+It
+would
+only
+be
+the
+clothing
+the
+body
+which
+would
+be
+destroyed
+How
+courageous
+and
+how
+happy
+they
+were
+when
+I
+said
+to
+them
+that
+there
+is
+no
+death
+only
+a
+transition
+to
+a
+happier
+and
+more
+beautiful
+state
+and
+I
+wished
+so
+much
+that
+I
+could
+give
+them
+more
+I
+spent
+my
+life
+in
+dogmas
+all
+my
+life
+in
+trying
+to
+do
+good
+I
+did
+good
+but
+my
+thoughts
+were
+clothed
+with
+dogmas
+of
+different
+kinds
+At
+last
+I
+found
+the
+truth
+Oh
+my
+dear
+Robert
+had
+to
+go
+to
+open
+the
+door
+before
+I
+could
+realize
+what
+was
+awaiting
+me
+I
+did
+some
+good
+after
+I
+found
+the
+truth
+let
+us
+all
+do
+the
+same
+People
+will
+scoff
+at
+you
+at
+times
+but
+never
+mind
+never
+mind
+By
+so
+doing
+you
+will
+become
+stronger
+and
+you
+will
+find
+that
+it
+will
+help
+you
+to
+grow
+in
+understanding
+I
+found
+the
+truth
+but
+by
+a
+dangerous
+method
+I
+had
+to
+struggle
+as
+well
+with
+that
+The
+Ouija
+Board
+is
+a
+dangerous
+thing
+and
+I
+found
+it
+out
+It
+greatly
+weakened
+me
+Be
+very
+guarded
+in
+seeking
+for
+the
+truth
+for
+it
+is
+a
+dangerous
+road
+You
+must
+learn
+the
+way
+in
+order
+to
+have
+help
+and
+guidance
+I
+had
+struggles
+with
+others
+because
+I
+went
+into
+the
+midst
+of
+earthbound
+spirits
+as
+well
+as
+the
+soldiers
+If
+you
+could
+only
+realize
+the
+dreadful
+pressure
+around
+the
+soldiers
+They
+wanted
+light
+on
+one
+side
+as
+well
+as
+on
+the
+other
+Spirits
+yet
+in
+ignorance
+of
+the
+higher
+life
+It
+was
+too
+much
+pressure
+on
+my
+physical
+body
+and
+I
+gave
+out
+I
+could
+not
+stand
+it
+or
+the
+thoughts
+that
+were
+centered
+on
+me
+I
+taught
+the
+truth
+to
+the
+soldiers
+on
+earth
+but
+I
+did
+not
+realize
+how
+many
+I
+lectured
+to
+who
+had
+gone
+before
+The
+strain
+was
+too
+great
+for
+me
+so
+I
+came
+home
+not
+weak
+in
+spirit
+but
+in
+body
+Still
+I
+feel
+happy
+that
+I
+was
+enabled
+to
+help
+I
+found
+the
+world
+of
+spirits
+where
+I
+could
+be
+with
+my
+dear
+one
+whom
+I
+loved
+the
+most
+You
+wonder
+where
+the
+real
+life
+is
+The
+real
+life
+is
+on
+the
+other
+side
+of
+the
+grave
+as
+you
+call
+it
+This
+life
+is
+only
+a
+temporary
+school
+the
+school
+of
+learning
+to
+know
+ourselves
+and
+for
+what
+object
+we
+are
+here
+People
+think
+that
+when
+they
+die
+they
+will
+see
+God
+but
+how
+few
+realize
+what
+God
+means
+God
+is
+the
+Life
+of
+all
+things
+How
+little
+people
+think
+of
+this
+earth
+plane
+and
+what
+it
+really
+is
+It
+is
+only
+an
+infinitesimal
+part
+of
+the
+Universe
+Once
+I
+thought
+of
+reincarnation
+I
+was
+at
+one
+time
+a
+Theosophist
+Theosophy
+is
+all
+right
+so
+far
+as
+it
+goes
+the
+thoughts
+and
+teachings
+are
+beautiful
+but
+why
+should
+we
+reincarnate
+on
+this
+little
+planet
+I
+would
+not
+care
+to
+come
+back
+to
+the
+earth
+plane
+except
+to
+tell
+you
+of
+the
+higher
+and
+real
+life
+which
+lies
+before
+you
+I
+would
+not
+like
+to
+come
+back
+to
+this
+earth
+plane
+again
+to
+be
+a
+little
+baby
+and
+I
+do
+not
+see
+why
+I
+should
+for
+what
+would
+I
+learn
+Could
+souls
+like
+we
+come
+back
+into
+children
+again
+and
+feel
+satisfied
+After
+you
+have
+learned
+the
+higher
+things
+of
+life
+you
+do
+not
+care
+to
+come
+back
+to
+matter
+another
+time
+You
+want
+to
+learn
+while
+here
+and
+gain
+sufficient
+knowledge
+so
+that
+when
+you
+pass
+on
+you
+will
+not
+want
+to
+come
+back
+and
+learn
+it
+over
+You
+can
+learn
+much
+about
+the
+other
+side
+of
+life
+while
+here
+and
+when
+you
+pass
+over
+there
+you
+will
+learn
+more
+and
+more
+of
+things
+which
+you
+could
+not
+learn
+while
+here
+because
+you
+could
+not
+understand
+them
+Oh
+the
+world
+of
+worlds
+If
+you
+could
+only
+travel
+to
+the
+beautiful
+worlds
+beyond
+and
+see
+the
+grandeur
+there
+We
+also
+have
+to
+serve
+to
+bring
+others
+to
+the
+same
+harmony
+we
+enjoy
+We
+cannot
+return
+and
+be
+babies
+again
+but
+we
+step
+down
+to
+earth
+life
+to
+help
+our
+loved
+ones
+and
+friends
+There
+was
+a
+time
+when
+I
+thought
+I
+had
+reincarnated
+because
+when
+I
+would
+write
+I
+felt
+that
+I
+had
+been
+here
+before
+but
+I
+find
+that
+it
+was
+only
+spirits
+who
+sent
+the
+thoughts
+to
+my
+mind
+and
+gave
+me
+strength
+to
+write
+and
+in
+that
+way
+I
+felt
+that
+I
+had
+been
+here
+before
+It
+was
+only
+another
+s
+mind
+reflecting
+on
+my
+mind
+The
+work
+you
+are
+doing
+here
+is
+one
+I
+wish
+I
+had
+known
+about
+and
+could
+have
+helped
+with
+because
+it
+is
+so
+much
+needed
+So
+many
+need
+help
+and
+enlightenment
+We
+cannot
+reach
+many
+from
+our
+side
+of
+life
+because
+they
+are
+bond
+servants
+to
+creeds
+and
+desires
+of
+different
+kinds
+which
+attract
+them
+to
+this
+earth
+plane
+We
+must
+have
+stations
+like
+this
+where
+we
+can
+bring
+them
+and
+open
+their
+spiritual
+eyes
+that
+they
+may
+see
+Then
+they
+will
+see
+us
+and
+we
+can
+help
+them
+to
+a
+better
+understanding
+Let
+us
+all
+try
+to
+concentrate
+for
+training
+schools
+where
+earthbound
+spirits
+can
+be
+brought
+for
+enlightenment
+You
+may
+be
+surprised
+to
+think
+I
+came
+tonight
+I
+have
+tried
+to
+come
+through
+Ouija
+Boards
+and
+I
+have
+tried
+to
+come
+other
+ways
+but
+here
+I
+can
+step
+in
+and
+talk
+as
+you
+talk
+It
+is
+like
+talking
+through
+a
+telephone
+and
+I
+feel
+strong
+I
+feel
+now
+that
+I
+am
+amongst
+you
+really
+in
+body
+and
+in
+spirit
+We
+must
+all
+unite
+and
+do
+all
+we
+can
+to
+further
+this
+work
+because
+we
+want
+stations
+like
+this
+here
+there
+and
+everywhere
+In
+time
+you
+will
+have
+receivers
+which
+will
+record
+messages
+from
+our
+side
+of
+life
+It
+will
+not
+be
+long
+before
+a
+message
+will
+come
+over
+this
+receiver
+from
+the
+other
+world
+that
+will
+awaken
+the
+people
+from
+their
+creeds
+It
+will
+awaken
+the
+churches
+Churches
+will
+be
+empty
+but
+it
+will
+only
+be
+for
+a
+short
+time
+because
+a
+new
+religion
+will
+spring
+up
+a
+religion
+which
+will
+be
+founded
+on
+the
+truth
+of
+spirit
+return
+and
+not
+on
+dogma
+People
+will
+live
+for
+others
+and
+will
+not
+grasp
+all
+for
+themselves
+The
+churches
+will
+be
+for
+the
+people
+and
+not
+for
+creeds
+People
+will
+pay
+money
+to
+the
+church
+but
+it
+will
+be
+to
+further
+the
+work
+of
+the
+beautiful
+truth
+of
+the
+life
+beyond
+There
+will
+not
+be
+any
+salvation
+but
+you
+will
+learn
+to
+know
+that
+we
+are
+with
+you
+There
+will
+be
+churches
+which
+will
+have
+open
+doors
+for
+the
+spirits
+as
+well
+as
+the
+mortals
+I
+wanted
+to
+come
+to
+California
+to
+see
+your
+work
+while
+I
+was
+on
+earth
+as
+I
+had
+heard
+of
+you
+and
+was
+very
+much
+interested
+in
+your
+pamphlet
+and
+your
+work
+I
+wrote
+a
+little
+about
+it
+but
+I
+thought
+I
+could
+do
+more
+if
+I
+could
+see
+you
+in
+person
+However
+I
+went
+to
+the
+spirit
+life
+before
+I
+could
+meet
+you
+Now
+I
+am
+here
+to
+see
+your
+work
+If
+you
+could
+only
+realize
+what
+vast
+numbers
+invisibles
+there
+are
+outside
+the
+door
+who
+are
+waiting
+for
+a
+chance
+to
+come
+in
+to
+learn
+the
+truth
+of
+life
+and
+how
+they
+are
+crowding
+each
+other
+for
+help
+Now
+I
+cannot
+take
+more
+of
+your
+time
+but
+I
+do
+thank
+you
+for
+letting
+me
+come
+I
+am
+glad
+if
+I
+can
+be
+of
+some
+service
+to
+you
+in
+your
+work
+Have
+courage
+People
+refuse
+to
+recognize
+the
+fact
+of
+obsession
+because
+they
+think
+it
+hurts
+the
+cause
+spirit
+return
+I
+believed
+in
+it
+thoroughly
+because
+it
+is
+true
+and
+I
+knew
+it
+I
+am
+Ella
+Wheeler
+Wilcox
+I
+wanted
+to
+come
+here
+to
+give
+you
+encouragement
+in
+your
+work
+Go
+on
+with
+the
+work
+of
+obsession
+because
+it
+is
+so
+much
+needed
+and
+we
+will
+give
+you
+help
+from
+this
+side
+of
+life
+Please
+understand
+I
+would
+have
+been
+here
+in
+your
+concentration
+circle
+before
+but
+the
+door
+is
+crowded
+with
+people
+who
+are
+waiting
+for
+an
+opportunity
+to
+come
+We
+have
+to
+come
+one
+by
+one
+This
+evening
+I
+am
+very
+happy
+to
+say
+was
+my
+turn
+This
+work
+is
+so
+much
+needed
+to
+help
+humanity
+There
+is
+only
+one
+other
+that
+I
+know
+of
+who
+has
+such
+concentration
+circles
+where
+the
+medium
+allows
+earthbound
+spirits
+to
+control
+There
+are
+very
+few
+indeed
+who
+will
+allow
+earthbound
+spirits
+to
+come
+in
+and
+control
+For
+my
+part
+I
+know
+only
+one
+other
+and
+I
+have
+been
+hunting
+for
+some
+time
+to
+see
+where
+the
+work
+could
+be
+done
+The
+work
+of
+obsession
+as
+carried
+on
+by
+you
+should
+be
+done
+in
+every
+town
+and
+city
+Every
+medium
+should
+be
+willing
+to
+do
+this
+line
+of
+work
+The
+time
+will
+come
+when
+every
+minister
+will
+speak
+regarding
+the
+philosophy
+of
+life
+and
+spirit
+return
+and
+all
+isms
+will
+be
+done
+away
+with
+I
+cannot
+stay
+any
+longer
+but
+I
+thank
+you
+very
+much
+for
+the
+privilege
+of
+coming
+and
+shall
+come
+again
+some
+time
+I
+hope
+A
+venerable
+family
+friend
+Dr
+J
+M
+Peebles
+former
+Consul
+to
+Turkey
+world
+traveler
+and
+for
+sixty
+years
+an
+international
+lecturer
+on
+psychic
+science
+passed
+on
+at
+the
+age
+of
+ninety
+nine
+and
+has
+since
+spoken
+through
+Mrs
+Wickland
+upon
+various
+occasions
+sometimes
+bringing
+earthbound
+spirits
+for
+enlightenment
+EXPERIENCE
+OCTOBER
+Spirit
+DR
+J
+M
+PEEBLES
+Psychic
+MRS
+WICKLAND
+Spirit
+Good
+Evening
+my
+friends
+I
+thank
+you
+for
+opening
+the
+door
+so
+I
+could
+bring
+in
+the
+ones
+that
+are
+in
+misery
+and
+have
+them
+find
+understanding
+I
+like
+to
+be
+here
+with
+you
+and
+I
+like
+to
+help
+you
+with
+your
+work
+Doctor
+Whoever
+you
+are
+you
+are
+very
+welcome
+Sp
+You
+know
+who
+I
+am
+you
+know
+This
+is
+Dr
+Peebles
+I
+am
+young
+now
+I
+was
+always
+young
+in
+spirit
+but
+my
+body
+commenced
+to
+grow
+old
+and
+I
+could
+not
+always
+do
+as
+I
+wished
+I
+should
+very
+much
+have
+liked
+to
+live
+to
+be
+one
+hundred
+years
+old
+but
+I
+could
+not
+I
+had
+a
+most
+beautiful
+celebration
+on
+my
+hundredth
+birthday
+in
+the
+spirit
+world
+among
+friends
+I
+was
+very
+glad
+to
+go
+When
+I
+reached
+the
+spirit
+world
+I
+was
+glad
+to
+find
+such
+glory
+and
+happiness
+and
+beauty
+I
+understood
+about
+the
+spirit
+world
+but
+it
+cannot
+be
+described
+I
+cannot
+tell
+you
+how
+it
+is
+when
+we
+have
+understanding
+Even
+though
+I
+had
+been
+a
+Spiritualist
+for
+many
+many
+years
+still
+I
+clung
+to
+dogma
+as
+well
+I
+was
+a
+Spiritualist
+on
+one
+side
+but
+I
+could
+not
+give
+up
+the
+dogma
+of
+the
+Christian
+religion
+it
+was
+my
+hoodoo
+I
+traveled
+around
+the
+world
+five
+times
+saw
+many
+conditions
+of
+life
+and
+heard
+many
+different
+lectures
+on
+the
+Great
+Truth
+Let
+us
+not
+have
+beliefs
+Let
+us
+only
+learn
+to
+understand
+the
+grandeur
+of
+God
+Realize
+that
+this
+little
+earth
+is
+only
+a
+grammar
+school
+It
+is
+not
+a
+University
+not
+even
+a
+High
+School
+it
+is
+only
+the
+first
+lesson
+of
+life
+Many
+do
+not
+learn
+in
+that
+school
+Dr
+Who
+had
+been
+discussing
+reincarnation
+with
+a
+member
+of
+the
+circle
+jestingly
+They
+reincarnate
+again
+Sp
+Earnestly
+No
+they
+do
+not
+Why
+should
+you
+want
+to
+come
+back
+again
+Why
+should
+you
+go
+back
+to
+be
+confined
+in
+a
+small
+body
+and
+have
+no
+will
+of
+your
+own
+In
+the
+spirit
+world
+you
+are
+free
+to
+travel
+everywhere
+you
+do
+not
+need
+a
+physical
+body
+Why
+go
+back
+into
+that
+prison
+again
+Why
+should
+a
+child
+ready
+to
+enter
+High
+School
+go
+back
+to
+the
+Sixth
+Seventh
+or
+Eighth
+grade
+Those
+of
+you
+who
+are
+here
+at
+the
+present
+time
+when
+you
+have
+learned
+the
+primary
+lesson
+of
+life
+would
+you
+like
+to
+go
+back
+into
+a
+small
+body
+and
+know
+nothing
+When
+you
+travel
+you
+learn
+You
+can
+learn
+in
+one
+day
+here
+what
+it
+takes
+ten
+or
+twelve
+years
+to
+learn
+on
+earth
+If
+you
+feel
+like
+seeing
+things
+you
+travel
+During
+my
+life
+I
+studied
+Reincarnation
+and
+also
+Mrs
+Cora
+Richmond
+s
+Re
+embodiment
+Ques
+What
+is
+Re
+embodiment
+Dr
+It
+is
+a
+projection
+of
+self
+into
+the
+physical
+to
+acquire
+certain
+experiences
+Sp
+She
+believed
+you
+had
+to
+have
+many
+experiences
+that
+you
+had
+to
+be
+a
+murderer
+a
+thief
+a
+salesman
+a
+tailor
+that
+you
+must
+learn
+all
+the
+trades
+and
+professions
+Why
+can
+t
+you
+learn
+these
+experiences
+through
+others
+If
+you
+come
+in
+contact
+with
+a
+man
+you
+do
+not
+need
+to
+be
+perfect
+to
+profit
+by
+his
+experience
+You
+can
+learn
+by
+object
+lessons
+We
+teach
+children
+by
+object
+lessons
+and
+so
+it
+is
+through
+life
+In
+the
+spirit
+world
+if
+you
+wish
+to
+see
+a
+big
+factory
+making
+all
+sorts
+of
+machinery
+you
+can
+as
+a
+spirit
+go
+there
+by
+thinking
+and
+can
+learn
+all
+about
+it
+If
+you
+want
+to
+learn
+what
+they
+are
+doing
+in
+other
+parts
+of
+the
+world
+in
+Russia
+Germany
+England
+Indian
+Australia
+think
+and
+you
+are
+there
+and
+so
+learn
+your
+lessons
+Should
+you
+then
+be
+born
+again
+All
+you
+learn
+in
+life
+is
+only
+like
+a
+day
+in
+spirit
+I
+do
+not
+mean
+you
+grasp
+it
+all
+at
+once
+You
+have
+nothing
+to
+hold
+you
+when
+you
+are
+free
+remember
+a
+free
+spirit
+free
+and
+open
+to
+learn
+Dr
+For
+instance
+here
+when
+we
+want
+to
+know
+what
+is
+in
+a
+book
+we
+have
+to
+go
+through
+it
+In
+the
+spirit
+world
+I
+presume
+you
+sense
+the
+contents
+Sp
+Yes
+you
+sense
+it
+by
+feeling
+When
+you
+are
+in
+the
+body
+you
+have
+to
+act
+through
+the
+brain
+and
+it
+is
+difficult
+but
+in
+the
+spirit
+world
+you
+are
+free
+You
+have
+no
+brain
+to
+interfere
+Life
+is
+everlasting
+Everything
+you
+have
+learned
+through
+life
+that
+belongs
+to
+the
+soul
+is
+stored
+in
+your
+memory
+but
+so
+long
+as
+you
+live
+in
+the
+material
+body
+the
+cells
+clog
+up
+You
+lose
+your
+memory
+because
+the
+spirit
+cannot
+work
+on
+the
+brain
+cells
+as
+well
+in
+old
+age
+as
+in
+youth
+The
+cells
+are
+not
+so
+active
+and
+there
+are
+times
+when
+memory
+is
+shut
+out
+There
+are
+times
+when
+you
+feel
+like
+a
+drowning
+man
+everything
+stands
+before
+you
+things
+which
+have
+been
+forgotten
+As
+spirits
+we
+have
+our
+memory
+but
+when
+we
+come
+back
+and
+control
+a
+medium
+sometimes
+even
+our
+names
+are
+forgotten
+We
+get
+into
+another
+body
+very
+much
+like
+obsession
+Dr
+That
+must
+be
+a
+form
+of
+obsession
+Sp
+No
+it
+is
+not
+When
+obsession
+takes
+place
+the
+spirit
+clings
+to
+that
+body
+and
+it
+is
+hard
+to
+let
+go
+I
+would
+say
+that
+there
+is
+not
+one
+person
+on
+earth
+who
+is
+not
+obsessed
+in
+one
+way
+or
+another
+You
+know
+in
+olden
+times
+when
+I
+was
+a
+young
+boy
+life
+was
+very
+different
+from
+what
+it
+is
+now
+We
+did
+not
+hurry
+because
+there
+was
+nothing
+to
+hurry
+for
+Now
+life
+is
+all
+hurry
+People
+are
+living
+too
+rapid
+a
+life
+If
+a
+man
+does
+not
+work
+fast
+they
+say
+Quit
+him
+if
+he
+does
+not
+do
+that
+and
+that
+Quit
+him
+Nowadays
+people
+have
+to
+be
+so
+keen
+that
+the
+nervous
+system
+fails
+and
+they
+lose
+themselves
+then
+the
+spirits
+step
+in
+If
+you
+were
+a
+clairvoyant
+and
+walked
+down
+some
+busy
+street
+You
+would
+be
+surprised
+to
+find
+how
+many
+persons
+have
+invisible
+company
+Very
+few
+people
+on
+entering
+the
+spirit
+side
+of
+life
+even
+among
+the
+Spiritualists
+who
+preach
+it
+understand
+the
+condition
+of
+the
+higher
+life
+Dr
+They
+usually
+care
+only
+for
+phenomena
+they
+do
+not
+care
+for
+philosophy
+Sp
+Tonight
+I
+brought
+about
+one
+hundred
+spirits
+here
+At
+first
+I
+lectured
+to
+them
+and
+tried
+to
+waken
+them
+but
+could
+not
+Then
+I
+saw
+the
+English
+lady
+spirit
+who
+preceded
+him
+in
+controlling
+psychic
+and
+from
+her
+actions
+I
+thought
+she
+would
+listen
+but
+she
+would
+not
+So
+she
+was
+allowed
+to
+control
+Mrs
+Wickland
+and
+served
+as
+an
+object
+lesson
+The
+other
+spirits
+were
+watching
+her
+as
+they
+thought
+she
+acted
+so
+strangely
+They
+were
+curious
+so
+they
+roused
+themselves
+and
+woke
+up
+then
+I
+could
+talk
+You
+may
+think
+that
+sometimes
+we
+bring
+in
+strange
+spirits
+but
+it
+is
+to
+help
+many
+others
+as
+well
+as
+to
+give
+the
+controlling
+spirit
+an
+understanding
+of
+spiritual
+things
+Forget
+Reincarnation
+because
+it
+is
+a
+sandbag
+around
+your
+neck
+You
+will
+have
+that
+so
+centered
+in
+your
+mind
+that
+you
+will
+think
+and
+think
+about
+only
+that
+and
+then
+you
+will
+stay
+just
+where
+you
+are
+You
+cannot
+progress
+because
+your
+mind
+will
+always
+revert
+to
+the
+earth
+again
+and
+that
+Gate
+which
+was
+opened
+for
+the
+English
+lady
+could
+never
+be
+opened
+to
+any
+one
+who
+believed
+in
+reincarnation
+The
+thought
+of
+it
+is
+so
+self
+hypnotizing
+and
+so
+self
+satisfying
+that
+there
+is
+nothing
+in
+your
+mind
+except
+coming
+back
+and
+those
+are
+real
+selfish
+thoughts
+You
+wrap
+yourself
+in
+those
+thoughts
+and
+you
+remain
+just
+where
+you
+are
+You
+cannot
+reincarnate
+I
+have
+seen
+the
+effect
+of
+such
+thoughts
+and
+have
+also
+talked
+with
+people
+who
+believed
+in
+reincarnation
+Ques
+What
+does
+Madam
+Blavatsky
+think
+about
+reincarnation
+now
+Sp
+We
+had
+some
+dispute
+about
+it
+when
+I
+was
+on
+earth
+and
+we
+have
+had
+more
+since
+I
+came
+here
+She
+does
+not
+believe
+in
+it
+now
+She
+has
+had
+her
+lesson
+It
+took
+a
+very
+long
+time
+but
+now
+all
+she
+would
+like
+to
+come
+back
+for
+would
+be
+to
+correct
+her
+mistakes
+Dr
+That
+is
+hard
+to
+do
+Sp
+I
+had
+my
+hobby
+I
+thought
+I
+should
+see
+Christ
+I
+have
+not
+seen
+Him
+and
+never
+will
+Christ
+is
+the
+Principle
+of
+God
+Christ
+is
+the
+Principle
+of
+Life
+Jesus
+is
+Truth
+and
+Christ
+is
+Enlightenment
+and
+Understanding
+When
+you
+have
+found
+See
+Chap
+Page
+M
+Spirit
+Esther
+Sutherland
+yourself
+and
+learn
+to
+be
+one
+with
+your
+Maker
+that
+is
+At
+OneMent
+with
+God
+Through
+Jesus
+you
+find
+the
+Truth
+and
+Jesus
+has
+to
+be
+crucified
+that
+Christ
+may
+live
+We
+must
+overcome
+earthly
+things
+Crucify
+selfishness
+and
+jealousy
+on
+the
+cross
+Truth
+cannot
+be
+selfish
+or
+jealous
+selfishness
+and
+jealousy
+belong
+to
+the
+lower
+part
+of
+man
+Do
+not
+become
+hypnotized
+in
+any
+way
+by
+dogma
+creed
+or
+belief
+but
+find
+God
+within
+yourself
+and
+be
+free
+Ask
+to
+hear
+to
+see
+to
+feel
+and
+to
+know
+God
+then
+your
+eyes
+will
+be
+opened
+to
+spiritual
+things
+and
+you
+will
+not
+want
+to
+come
+back
+to
+this
+earth
+life
+again
+You
+could
+not
+live
+on
+earth
+more
+than
+once
+no
+no
+You
+cannot
+light
+again
+a
+candle
+that
+has
+burned
+out
+Life
+is
+progression
+not
+retrogression
+You
+go
+from
+one
+degree
+to
+another
+and
+so
+on
+and
+on
+In
+the
+spirit
+world
+your
+time
+is
+so
+taken
+up
+with
+duties
+that
+you
+have
+no
+time
+to
+think
+of
+coming
+back
+You
+want
+to
+see
+your
+friends
+and
+you
+want
+to
+travel
+because
+you
+can
+see
+all
+you
+want
+to
+when
+you
+are
+free
+and
+have
+understanding
+Many
+ask
+How
+about
+children
+who
+have
+passed
+out
+and
+have
+not
+had
+earth
+life
+experience
+They
+have
+it
+The
+spirit
+of
+the
+mother
+s
+love
+brings
+the
+children
+to
+her
+often
+they
+are
+around
+her
+and
+in
+this
+way
+learn
+of
+earth
+life
+They
+are
+also
+taught
+We
+have
+in
+the
+spirit
+world
+teachers
+of
+higher
+things
+and
+they
+teach
+by
+object
+lessons
+We
+take
+children
+to
+schools
+of
+various
+kinds
+and
+teach
+them
+God
+s
+wonders
+There
+they
+learn
+the
+real
+life
+not
+merely
+reading
+and
+writing
+They
+learn
+the
+real
+lessons
+anatomy
+astrology
+astronomy
+and
+many
+other
+subjects
+Those
+are
+the
+studies
+of
+the
+children
+and
+the
+masters
+therein
+are
+teaching
+the
+lessons
+Our
+schools
+teach
+progression
+to
+a
+higher
+life
+I
+wish
+you
+could
+open
+your
+eyes
+to
+see
+how
+rapidly
+the
+children
+progress
+by
+object
+lessons
+I
+want
+to
+tell
+you
+that
+I
+am
+with
+you
+in
+your
+work
+I
+want
+you
+to
+understand
+that
+I
+have
+not
+left
+you
+People
+are
+lost
+for
+lack
+of
+a
+real
+understanding
+of
+life
+Obsession
+is
+very
+very
+bad
+Insane
+asylums
+are
+filled
+and
+the
+doctors
+do
+not
+know
+what
+to
+do
+to
+stop
+insanity
+Let
+us
+have
+more
+love
+for
+each
+other
+let
+us
+all
+help
+the
+weak
+ones
+and
+reach
+the
+point
+where
+all
+are
+brothers
+and
+sisters
+When
+that
+time
+comes
+everybody
+will
+work
+just
+half
+the
+time
+they
+do
+now
+they
+will
+have
+more
+time
+for
+themselves
+and
+will
+have
+more
+pleasures
+Now
+half
+the
+people
+are
+idle
+and
+are
+a
+detriment
+to
+themselves
+and
+the
+world
+at
+large
+If
+all
+would
+work
+for
+others
+and
+not
+have
+such
+unrest
+it
+would
+be
+better
+for
+everybody
+Now
+I
+must
+not
+say
+any
+more
+but
+must
+go
+Good
+Night
+Very
+unexpectedly
+we
+had
+a
+visit
+from
+the
+one
+whose
+teachings
+and
+writings
+have
+made
+world
+wide
+the
+theory
+of
+Reincarnation
+EXPERIENCE
+NOVEMBER
+Spirit
+MADAM
+BLAVATSKY
+Psychic
+MRS
+WICKLAND
+I
+wanted
+to
+come
+to
+you
+this
+evening
+I
+believe
+in
+the
+work
+this
+little
+circle
+is
+doing
+and
+I
+am
+very
+pleased
+with
+the
+work
+you
+are
+carrying
+on
+I
+wish
+there
+were
+more
+to
+help
+us
+to
+meet
+us
+on
+a
+half
+way
+basis
+to
+understand
+there
+is
+no
+death
+I
+do
+wish
+I
+had
+taught
+this
+truth
+more
+and
+also
+that
+I
+had
+tried
+to
+look
+further
+into
+it
+I
+knew
+about
+it
+I
+also
+had
+many
+manifestations
+I
+do
+not
+know
+why
+but
+when
+truth
+comes
+to
+us
+we
+shut
+it
+out
+Truth
+is
+always
+hidden
+We
+have
+to
+search
+to
+find
+it
+Theories
+and
+dogmas
+seem
+to
+have
+more
+chance
+in
+the
+world
+than
+truth
+Every
+one
+has
+some
+manifestations
+but
+hides
+them
+instead
+of
+acknowledging
+them
+I
+wanted
+to
+be
+a
+leader
+in
+some
+way
+or
+another
+Now
+I
+want
+to
+bring
+the
+truth
+to
+the
+world
+I
+knew
+of
+spirit
+manifestations
+and
+I
+had
+them
+myself
+I
+did
+a
+great
+deal
+in
+my
+early
+days
+along
+this
+line
+but
+I
+commenced
+to
+investigate
+Theosophy
+Philosophy
+and
+Theosophy
+should
+go
+hand
+in
+hand
+To
+me
+came
+Reincarnation
+It
+appealed
+to
+me
+for
+a
+time
+I
+could
+not
+see
+the
+truth
+clearly
+I
+felt
+that
+it
+was
+very
+unjust
+some
+should
+be
+rich
+and
+have
+such
+good
+times
+and
+that
+others
+should
+be
+poor
+and
+have
+so
+much
+trouble
+Others
+did
+not
+get
+enough
+earth
+experience
+at
+least
+so
+I
+felt
+I
+studied
+Reincarnation
+and
+I
+thought
+there
+was
+truth
+and
+justice
+in
+the
+theory
+that
+we
+come
+back
+and
+learn
+and
+have
+more
+experiences
+I
+taught
+it
+and
+wanted
+to
+bring
+it
+out
+to
+the
+world
+and
+its
+peoples
+I
+felt
+that
+I
+remembered
+far
+back
+in
+my
+past
+I
+felt
+I
+knew
+all
+about
+my
+past
+but
+I
+was
+mistaken
+Memories
+of
+past
+lives
+are
+caused
+by
+spirits
+that
+bring
+such
+thoughts
+and
+represent
+the
+lives
+they
+lived
+A
+spirit
+impresses
+you
+with
+the
+experiences
+of
+its
+life
+and
+these
+are
+implanted
+in
+your
+mind
+as
+your
+own
+You
+then
+think
+you
+remember
+your
+past
+When
+you
+study
+especially
+when
+you
+study
+Theosophy
+you
+develop
+your
+mind
+and
+live
+in
+an
+atmosphere
+of
+mind
+You
+remove
+yourself
+as
+much
+as
+possible
+from
+the
+physical
+Naturally
+you
+become
+sensitive
+and
+naturally
+you
+feel
+the
+spirits
+around
+you
+They
+speak
+to
+you
+by
+impressions
+and
+their
+past
+will
+be
+like
+a
+panorama
+You
+feel
+it
+and
+you
+live
+over
+the
+past
+of
+spirits
+and
+you
+make
+the
+mistake
+of
+taking
+this
+for
+the
+memory
+of
+former
+incarnations
+I
+did
+not
+know
+this
+when
+I
+lived
+I
+took
+it
+for
+granted
+that
+these
+memories
+were
+true
+but
+when
+I
+came
+to
+the
+spirit
+side
+of
+life
+I
+learned
+differently
+I
+studied
+a
+great
+deal
+Theosophy
+is
+the
+best
+and
+highest
+philosophy
+of
+life
+intrinsically
+but
+let
+us
+study
+the
+truth
+let
+us
+live
+up
+to
+the
+truth
+of
+it
+and
+forget
+theories
+Let
+us
+develop
+the
+truth
+within
+us
+find
+ourselves
+Do
+not
+let
+us
+look
+far
+away
+do
+not
+let
+us
+look
+in
+the
+past
+do
+not
+let
+us
+look
+into
+the
+future
+but
+let
+us
+find
+ourselves
+in
+our
+present
+condition
+and
+let
+us
+be
+true
+to
+ourselves
+Let
+us
+forget
+all
+theories
+and
+dogmas
+Let
+us
+know
+and
+feel
+the
+nearness
+of
+God
+Reincarnation
+is
+not
+true
+I
+did
+not
+want
+to
+believe
+that
+They
+told
+me
+here
+in
+the
+spirit
+world
+that
+I
+could
+not
+reincarnate
+I
+have
+tried
+and
+tried
+to
+come
+back
+to
+be
+somebody
+else
+but
+I
+could
+not
+We
+cannot
+reincarnate
+We
+progress
+we
+do
+not
+come
+back
+Why
+should
+you
+come
+back
+to
+live
+another
+life
+when
+you
+have
+gained
+experience
+and
+an
+understanding
+while
+you
+were
+here
+and
+furthermore
+since
+this
+is
+only
+a
+preliminary
+school
+on
+earth
+Let
+us
+learn
+to
+find
+ourselves
+While
+I
+am
+sorry
+to
+say
+many
+have
+not
+found
+themselves
+let
+all
+of
+us
+here
+acquire
+knowledge
+so
+that
+when
+we
+go
+to
+the
+spirit
+side
+of
+life
+we
+shall
+go
+on
+to
+a
+higher
+life
+In
+earth
+life
+you
+have
+your
+material
+body
+to
+hinder
+you
+If
+you
+want
+to
+write
+a
+book
+you
+have
+to
+look
+up
+data
+here
+and
+there
+and
+go
+to
+the
+library
+to
+find
+some
+book
+that
+contains
+what
+you
+wish
+to
+know
+You
+may
+have
+to
+go
+from
+one
+place
+to
+another
+and
+yet
+not
+find
+it
+It
+all
+takes
+time
+and
+time
+is
+limited
+You
+are
+hindered
+In
+the
+spirit
+world
+if
+we
+want
+data
+on
+a
+certain
+thing
+we
+think
+of
+it
+and
+it
+is
+all
+before
+us
+There
+is
+no
+time
+no
+matter
+to
+hinder
+In
+the
+spirit
+world
+if
+we
+want
+earthly
+experience
+do
+you
+think
+we
+have
+to
+reincarnate
+to
+get
+that
+experience
+No
+we
+do
+not
+For
+illustration
+say
+one
+wants
+to
+know
+more
+about
+medicine
+He
+then
+goes
+to
+a
+school
+as
+a
+student
+hears
+everything
+sees
+everything
+and
+comes
+in
+contact
+with
+everything
+learning
+it
+much
+quicker
+than
+he
+could
+grasp
+it
+on
+earth
+and
+he
+has
+it
+much
+clearer
+in
+his
+mind
+In
+earth
+life
+you
+have
+to
+study
+for
+years
+and
+then
+you
+do
+not
+get
+it
+as
+clearly
+as
+we
+do
+Suppose
+you
+want
+experience
+in
+the
+spirit
+world
+with
+machinery
+or
+anything
+else
+you
+can
+get
+it
+easily
+We
+have
+everything
+in
+the
+spirit
+world
+because
+everything
+that
+is
+invented
+on
+earth
+has
+first
+been
+invented
+in
+the
+spirit
+world
+Suppose
+an
+inventor
+passes
+on
+before
+completion
+of
+his
+invention
+He
+will
+not
+give
+it
+up
+He
+studies
+it
+on
+the
+spirit
+side
+of
+life
+because
+it
+is
+easier
+to
+study
+there
+as
+he
+has
+more
+time
+When
+he
+has
+everything
+ready
+he
+finds
+some
+sensitive
+and
+impresses
+the
+invention
+on
+his
+mind
+Then
+that
+one
+commences
+on
+it
+perfects
+it
+and
+gives
+it
+to
+the
+world
+If
+I
+impress
+a
+sensitive
+with
+an
+idea
+in
+one
+sense
+I
+reincarnate
+not
+in
+his
+body
+but
+by
+impressing
+him
+with
+what
+I
+want
+done
+In
+this
+way
+we
+come
+and
+go
+if
+we
+are
+attracted
+to
+earth
+life
+and
+want
+to
+be
+here
+When
+you
+have
+once
+reached
+the
+spirit
+world
+where
+all
+are
+congenial
+where
+all
+is
+life
+where
+all
+is
+bliss
+where
+there
+is
+no
+jealousy
+no
+envy
+where
+all
+is
+one
+grand
+harmony
+do
+you
+think
+for
+one
+moment
+that
+you
+would
+want
+to
+leave
+that
+beautiful
+condition
+to
+come
+back
+to
+earth
+and
+be
+a
+little
+baby
+restricted
+in
+mind
+and
+knowing
+nothing
+nothing
+whatever
+Furthermore
+you
+might
+get
+into
+a
+sickly
+crippled
+body
+and
+be
+worse
+than
+you
+were
+before
+No
+reincarnation
+is
+not
+true
+I
+believed
+it
+I
+taught
+it
+and
+I
+was
+sure
+that
+I
+should
+come
+back
+and
+be
+somebody
+else
+But
+I
+will
+not
+I
+can
+do
+far
+more
+good
+now
+If
+I
+want
+to
+do
+some
+missionary
+work
+or
+some
+good
+I
+go
+down
+to
+the
+earth
+sphere
+the
+earthbound
+sphere
+where
+the
+spirits
+are
+in
+all
+kinds
+of
+misery
+I
+preach
+to
+them
+and
+teach
+them
+I
+try
+to
+rescue
+them
+So
+I
+find
+my
+work
+Why
+should
+we
+go
+down
+from
+the
+harmony
+in
+the
+spirit
+world
+to
+what
+I
+might
+call
+hell
+Here
+we
+have
+one
+group
+singing
+and
+praying
+and
+praising
+God
+from
+early
+morning
+until
+night
+and
+they
+are
+so
+selfhypnotized
+that
+we
+cannot
+talk
+to
+them
+We
+go
+to
+another
+group
+and
+there
+we
+find
+the
+misers
+They
+are
+so
+busy
+counting
+money
+money
+which
+is
+their
+God
+that
+we
+cannot
+reach
+them
+We
+go
+to
+others
+who
+have
+been
+ruined
+in
+life
+they
+are
+bitter
+and
+jealous
+they
+have
+nothing
+but
+revenge
+in
+their
+minds
+They
+have
+no
+love
+or
+kindness
+They
+are
+like
+sponges
+which
+have
+been
+dipped
+in
+muddy
+water
+you
+would
+not
+even
+know
+they
+were
+sponges
+Their
+love
+has
+turned
+to
+hate
+and
+they
+cannot
+be
+taught
+love
+and
+kindness
+They
+will
+spit
+at
+you
+they
+will
+laugh
+at
+you
+for
+they
+feel
+that
+there
+is
+no
+God
+no
+kindness
+no
+love
+but
+all
+is
+jealousy
+and
+selfishness
+But
+we
+are
+not
+disappointed
+our
+mission
+is
+to
+turn
+these
+souls
+to
+better
+things
+We
+may
+have
+a
+hard
+time
+We
+cannot
+go
+there
+and
+pray
+for
+them
+no
+no
+They
+would
+shut
+the
+door
+and
+say
+they
+did
+not
+want
+us
+and
+so
+we
+cannot
+go
+there
+and
+talk
+and
+lecture
+You
+may
+ask
+how
+it
+is
+possible
+to
+reach
+them
+First
+we
+try
+to
+concentrate
+on
+them
+Then
+we
+have
+music
+Sometimes
+we
+have
+to
+play
+very
+softly
+so
+they
+can
+hardly
+hear
+it
+then
+we
+play
+a
+little
+louder
+No
+matter
+how
+evil
+how
+mean
+how
+low
+souls
+have
+been
+they
+will
+listen
+to
+music
+When
+they
+have
+given
+their
+attention
+to
+the
+music
+we
+concentrate
+on
+them
+to
+waken
+and
+look
+up
+to
+higher
+things
+Artists
+then
+paint
+pictures
+of
+the
+higher
+life
+for
+them
+object
+lessons
+little
+stories
+Their
+life
+history
+can
+be
+seen
+by
+us
+and
+we
+put
+this
+in
+pictures
+one
+by
+one
+and
+let
+them
+see
+the
+mistakes
+they
+have
+made
+Presently
+they
+ask
+questions
+and
+then
+we
+come
+a
+little
+closer
+to
+them
+After
+that
+we
+take
+them
+to
+the
+higher
+life
+In
+another
+group
+are
+those
+who
+are
+self
+hypnotized
+They
+have
+gone
+to
+sleep
+They
+were
+taught
+that
+death
+is
+a
+sleep
+and
+that
+they
+will
+sleep
+until
+the
+Last
+Day
+when
+God
+will
+sit
+on
+His
+throne
+and
+judge
+them
+They
+are
+difficult
+to
+reach
+especially
+if
+they
+have
+put
+themselves
+into
+an
+actual
+death
+sleep
+Sometimes
+we
+have
+to
+bring
+them
+to
+control
+a
+medium
+and
+waken
+them
+in
+that
+way
+When
+we
+cannot
+reach
+the
+earthbound
+spirits
+at
+all
+we
+have
+to
+bring
+them
+to
+earth
+life
+to
+a
+circle
+like
+this
+where
+they
+get
+understanding
+through
+matter
+In
+one
+sense
+you
+can
+call
+this
+reincarnation
+because
+we
+have
+to
+bring
+them
+to
+matter
+to
+find
+themselves
+I
+wish
+we
+could
+have
+more
+circles
+like
+this
+to
+waken
+these
+spirits
+and
+make
+them
+understand
+about
+the
+life
+beyond
+Some
+may
+say
+this
+is
+not
+Madam
+Blavatsky
+but
+do
+not
+doubt
+it
+is
+They
+may
+say
+She
+would
+not
+say
+so
+and
+so
+she
+would
+not
+talk
+so
+and
+so
+but
+it
+is
+Madam
+Blavatsky
+If
+you
+have
+any
+questions
+you
+would
+like
+to
+ask
+I
+will
+try
+to
+answer
+them
+Ques
+Will
+you
+tell
+us
+about
+the
+Masters
+What
+do
+you
+think
+of
+them
+by
+now
+Sp
+We
+talk
+of
+Masters
+yes
+We
+are
+all
+masters
+when
+we
+try
+to
+study
+higher
+things
+but
+a
+Master
+as
+we
+understand
+it
+in
+Theosophy
+is
+some
+big
+and
+great
+mind
+A
+master
+is
+one
+who
+can
+master
+matter
+can
+overcome
+matter
+one
+who
+can
+live
+a
+pure
+and
+good
+life
+and
+master
+the
+conditions
+of
+life
+Learn
+the
+lessons
+of
+Nature
+learn
+how
+to
+progress
+I
+am
+sorry
+to
+say
+that
+most
+of
+those
+who
+want
+to
+be
+Masters
+on
+earth
+fall
+It
+is
+not
+they
+themselves
+who
+fall
+but
+they
+become
+so
+sensitive
+so
+psychic
+that
+although
+they
+do
+not
+know
+they
+are
+on
+the
+borderland
+earthbound
+spirits
+step
+in
+control
+them
+and
+they
+fall
+We
+should
+master
+matter
+first
+before
+we
+try
+to
+master
+new
+ideas
+Take
+myself
+what
+did
+I
+really
+do
+that
+was
+good
+for
+humanity
+Ans
+You
+led
+many
+out
+of
+orthodoxy
+Sp
+Yes
+but
+I
+only
+gave
+them
+more
+theory
+I
+could
+have
+done
+oh
+so
+much
+more
+if
+I
+had
+stayed
+with
+my
+mediumship
+and
+worked
+to
+bring
+this
+world
+and
+the
+other
+together
+I
+was
+a
+medium
+and
+I
+could
+have
+done
+a
+great
+work
+but
+I
+became
+obsessed
+I
+am
+sorry
+to
+say
+that
+Theosophists
+are
+breaking
+up
+You
+live
+now
+in
+a
+time
+when
+things
+are
+breaking
+up
+there
+is
+a
+general
+restlessness
+All
+theories
+will
+go
+down
+and
+philosophy
+will
+rise
+Dr
+There
+should
+be
+more
+simplicity
+in
+life
+Sp
+That
+is
+a
+very
+good
+word
+to
+apply
+You
+have
+found
+the
+truth
+You
+have
+good
+workers
+on
+the
+other
+side
+connected
+with
+this
+medium
+You
+have
+no
+theories
+no
+mysterious
+things
+as
+Theosophists
+have
+They
+think
+the
+more
+mysterious
+they
+are
+the
+greater
+Masters
+they
+are
+Where
+are
+they
+Where
+are
+they
+I
+am
+sorry
+to
+say
+that
+they
+are
+so
+self
+hypnotized
+that
+their
+imagination
+runs
+away
+with
+them
+One
+may
+look
+back
+and
+say
+I
+was
+Julius
+Caesar
+He
+has
+probably
+read
+some
+book
+about
+Julius
+Caesar
+and
+become
+so
+wrapped
+up
+in
+it
+that
+he
+feels
+he
+has
+lived
+in
+that
+time
+Then
+he
+receives
+spirit
+impressions
+and
+is
+sure
+that
+this
+was
+his
+former
+life
+You
+can
+make
+people
+believe
+almost
+anything
+They
+do
+not
+build
+their
+houses
+on
+the
+rock
+of
+reason
+for
+a
+storm
+will
+blow
+them
+down
+All
+denominations
+have
+some
+truth
+You
+have
+heard
+the
+story
+of
+the
+elephant
+Of
+the
+blind
+men
+who
+examined
+an
+elephant
+and
+each
+declared
+that
+an
+elephant
+was
+like
+that
+part
+which
+he
+had
+touched
+like
+the
+trunk
+the
+leg
+or
+the
+tail
+Every
+one
+had
+the
+truth
+but
+none
+the
+whole
+truth
+We
+do
+not
+seek
+for
+the
+whole
+truth
+so
+one
+hangs
+on
+to
+the
+tail
+another
+to
+the
+trunk
+and
+so
+on
+Let
+us
+all
+join
+together
+then
+we
+will
+find
+the
+whole
+elephant
+and
+we
+will
+all
+be
+together
+in
+one
+great
+truth
+Ques
+Will
+there
+be
+psychics
+to
+carry
+on
+further
+investigations
+Sp
+When
+the
+time
+comes
+and
+the
+people
+are
+ready
+the
+psychics
+will
+be
+ready
+also
+We
+can
+all
+join
+together
+then
+and
+there
+will
+be
+psychic
+circles
+in
+every
+church
+Ques
+Why
+are
+there
+not
+more
+inspirational
+speakers
+to
+teach
+the
+truth
+Sp
+The
+public
+lecture
+work
+will
+be
+inspirational
+Lecturers
+and
+politicians
+often
+think
+they
+are
+going
+to
+say
+what
+they
+have
+written
+down
+but
+before
+they
+know
+it
+they
+speak
+of
+something
+altogether
+different
+They
+are
+speaking
+inspirationally
+for
+there
+are
+always
+those
+on
+the
+spirit
+side
+of
+life
+who
+are
+interested
+in
+this
+life
+and
+are
+ready
+to
+inspire
+a
+speaker
+Ques
+Will
+a
+psychic
+be
+protected
+Sp
+One
+should
+always
+be
+positive
+in
+ordinary
+life
+cure
+disappointment
+never
+let
+anything
+disturb
+one
+No
+anger
+or
+sorrow
+may
+creep
+in
+because
+anger
+comes
+from
+the
+other
+side
+the
+lower
+sphere
+Everyone
+must
+be
+positive
+When
+we
+open
+the
+door
+to
+the
+spirit
+side
+of
+life
+there
+are
+crowds
+of
+earthbound
+spirits
+who
+want
+to
+see
+the
+light
+which
+they
+can
+see
+through
+a
+mortal
+body
+Having
+lost
+their
+physical
+sight
+they
+are
+blind
+for
+there
+is
+no
+material
+light
+in
+the
+earth
+sphere
+and
+without
+an
+understanding
+they
+have
+no
+spiritual
+light
+Ques
+Should
+not
+a
+psychic
+be
+well
+informed
+on
+all
+subjects
+Sp
+Suppose
+a
+great
+musician
+had
+to
+play
+on
+a
+poor
+piano
+He
+could
+not
+bring
+out
+the
+shading
+of
+the
+music
+in
+any
+way
+He
+must
+have
+a
+fine
+instrument
+So
+it
+is
+with
+a
+psychic
+A
+psychic
+should
+be
+informed
+on
+all
+topics
+regarding
+the
+world
+An
+uncultured
+psychic
+cannot
+be
+used
+to
+speak
+properly
+on
+scientific
+subjects
+Ques
+What
+becomes
+of
+the
+spirit
+of
+a
+psychic
+while
+another
+spirit
+is
+controlling
+Sp
+You
+understand
+that
+in
+spirit
+we
+can
+be
+large
+or
+small
+as
+we
+think
+The
+spirit
+of
+Mrs
+Wickland
+at
+the
+present
+time
+is
+in
+her
+magnetic
+aura
+There
+can
+be
+a
+number
+of
+spirits
+in
+one
+aura
+Some
+come
+and
+some
+go
+but
+only
+one
+can
+control
+at
+a
+time
+Mrs
+Wickland
+just
+now
+is
+in
+a
+coma
+state
+She
+does
+not
+function
+on
+the
+mental
+plane
+She
+is
+the
+live
+wire
+she
+is
+the
+battery
+She
+is
+the
+motor
+and
+we
+have
+many
+lines
+from
+that
+motor
+If
+she
+left
+we
+would
+not
+have
+the
+electrical
+force
+to
+control
+In
+this
+case
+the
+psychic
+is
+the
+battery
+through
+which
+we
+work
+Ques
+Theosophy
+teaches
+that
+during
+sleep
+one
+develops
+mentally
+and
+spiritually
+that
+the
+body
+will
+stay
+at
+rest
+but
+the
+soul
+will
+leave
+the
+body
+connected
+only
+by
+a
+slender
+thread
+And
+gain
+experience
+on
+the
+mental
+or
+astral
+plane
+Is
+that
+true
+Sp
+Yes
+it
+is
+When
+you
+sleep
+you
+often
+dream
+Some
+dreams
+are
+meaningless
+others
+are
+real
+experiences
+When
+you
+study
+Yoga
+you
+learn
+to
+leave
+the
+body
+Hindus
+study
+Yoga
+and
+leave
+the
+body
+at
+will
+Most
+persons
+do
+not
+know
+that
+they
+leave
+the
+body
+and
+travel
+in
+the
+spirit
+world
+Ques
+Would
+it
+be
+desirable
+to
+have
+continuous
+consciousness
+Sp
+If
+humanity
+had
+continuous
+consciousness
+it
+would
+be
+a
+big
+factor
+in
+the
+welfare
+of
+this
+world
+God
+is
+All
+in
+All
+even
+to
+the
+little
+microscopic
+things
+He
+is
+all
+Life
+If
+all
+were
+taught
+this
+simple
+truth
+earth
+life
+would
+become
+ideal
+There
+is
+no
+death
+only
+progression
+All
+should
+be
+taught
+that
+Selfishness
+ignorance
+and
+jealousy
+would
+be
+gone
+then
+doubt
+would
+be
+buried
+Love
+and
+charity
+would
+rule
+Suppose
+you
+go
+out
+of
+your
+body
+You
+pass
+through
+the
+first
+strata
+what
+do
+you
+find
+Selfishness
+You
+have
+to
+pass
+through
+this
+first
+strata
+before
+you
+can
+reach
+the
+higher
+Ignorance
+selfishness
+and
+jealousy
+must
+be
+passed
+through
+before
+you
+can
+reach
+the
+better
+life
+It
+is
+a
+case
+of
+development
+The
+Hindus
+have
+peace
+and
+harmony
+They
+live
+for
+higher
+things
+although
+I
+do
+not
+mean
+every
+one
+in
+India
+does
+this
+But
+when
+the
+more
+advanced
+leave
+their
+bodies
+no
+one
+can
+get
+in
+and
+disturb
+them
+What
+I
+want
+to
+say
+tonight
+is
+that
+we
+should
+study
+life
+as
+it
+it
+Let
+the
+dreamers
+and
+thinkers
+of
+the
+past
+take
+care
+of
+themselves
+I
+see
+now
+that
+I
+had
+many
+earthbound
+spirits
+around
+me
+I
+never
+saw
+so
+many
+religions
+in
+one
+city
+as
+in
+Los
+Angeles
+People
+go
+from
+one
+church
+to
+another
+and
+they
+do
+not
+know
+where
+they
+are
+at
+Cranks
+and
+others
+sing
+and
+pray
+and
+everybody
+loves
+Jesus
+Jesus
+is
+the
+Truth
+Read
+Anna
+Kingsford
+s
+works
+and
+you
+will
+find
+many
+interesting
+things
+there
+She
+was
+not
+a
+crank
+We
+read
+many
+books
+together
+She
+was
+a
+wonderful
+woman
+Dr
+Wasn
+t
+she
+opposed
+to
+mediumship
+Sp
+She
+was
+a
+medium
+herself
+Her
+writings
+were
+not
+her
+own
+Writers
+have
+a
+hard
+time
+When
+they
+think
+they
+are
+getting
+along
+very
+nicely
+their
+thoughts
+suddenly
+change
+They
+are
+influenced
+by
+some
+spirit
+writer
+All
+Anna
+Kingsford
+s
+writings
+were
+inspirational
+Ques
+What
+about
+Olcott
+Sp
+Olcott
+has
+found
+the
+truth
+Let
+us
+be
+sensible
+and
+learn
+not
+to
+be
+foolish
+Let
+us
+find
+the
+simple
+truth
+I
+have
+greatly
+enjoyed
+this
+talk
+with
+all
+of
+you
+and
+I
+will
+certainly
+come
+again
+Do
+all
+you
+can
+to
+further
+this
+noble
+work
+This
+room
+is
+full
+of
+spirits
+who
+have
+listened
+to
+what
+was
+said
+tonight
+Many
+have
+been
+helped
+and
+will
+go
+with
+us
+to
+the
+spirit
+side
+of
+life
+May
+strength
+and
+power
+be
+with
+you
+all
+Let
+God
+s
+light
+shine
+in
+your
+soul
+and
+go
+on
+with
+this
+good
+work
+Good
+Night
+CHAPTER
+XVI
+Philosophy
+THE
+philosophy
+of
+life
+and
+descriptions
+of
+conditions
+in
+the
+higher
+realms
+have
+been
+given
+by
+spirits
+who
+have
+attained
+enlightenment
+and
+are
+desirous
+of
+helping
+humanity
+to
+an
+understanding
+of
+the
+spiritual
+laws
+A
+friend
+of
+many
+years
+standing
+formerly
+a
+Methodist
+minister
+had
+followed
+our
+work
+with
+great
+interest
+and
+had
+been
+a
+constant
+attendant
+at
+our
+circles
+in
+which
+his
+daughter
+took
+an
+active
+part
+Five
+days
+after
+he
+passed
+away
+he
+controlled
+Mrs
+Wickland
+and
+several
+months
+later
+spoke
+to
+us
+again
+telling
+of
+his
+experiences
+in
+spirit
+life
+EXPERIENCE
+OCTOBER
+Spirit
+WM
+Y
+SR
+PSYCHIC
+MRS
+WICKLAND
+Well
+I
+am
+here
+again
+I
+have
+been
+here
+before
+many
+times
+Do
+you
+know
+who
+I
+am
+I
+am
+Doctor
+Y
+I
+am
+glad
+that
+I
+can
+be
+with
+you
+here
+tonight
+and
+I
+am
+pleased
+this
+circle
+is
+continuing
+We
+are
+here
+every
+time
+you
+have
+a
+meeting
+and
+I
+wish
+you
+could
+see
+the
+spirits
+who
+are
+waiting
+to
+come
+in
+for
+an
+understanding
+of
+life
+Life
+is
+a
+great
+problem
+to
+the
+world
+I
+wish
+people
+would
+study
+life
+and
+its
+existence
+in
+matter
+It
+is
+a
+shame
+to
+send
+so
+many
+spirits
+out
+of
+their
+bodies
+into
+the
+darkness
+of
+ignorance
+They
+only
+believe
+they
+sing
+and
+praise
+God
+and
+we
+cannot
+reach
+them
+They
+are
+so
+self
+hypnotized
+by
+their
+religion
+in
+the
+first
+place
+that
+they
+do
+not
+know
+they
+are
+dead
+and
+in
+the
+second
+place
+by
+their
+praising
+of
+God
+and
+singing
+that
+we
+cannot
+reach
+them
+with
+the
+understanding
+that
+they
+must
+praise
+God
+in
+a
+different
+way
+We
+must
+act
+we
+must
+work
+for
+humanity
+We
+must
+learn
+the
+first
+lesson
+that
+Christ
+taught
+to
+serve
+others
+and
+to
+love
+God
+above
+all
+things
+and
+our
+neighbor
+as
+ourselves
+How
+many
+do
+really
+love
+God
+They
+pray
+and
+sing
+but
+they
+do
+not
+do
+what
+the
+Bible
+teaches
+I
+understood
+a
+great
+deal
+about
+the
+other
+world
+and
+still
+I
+was
+like
+a
+child
+regarding
+that
+understanding
+because
+I
+had
+not
+learned
+to
+control
+matter
+and
+the
+conditions
+that
+surround
+us
+When
+we
+pass
+through
+the
+material
+sphere
+of
+ether
+the
+sphere
+around
+this
+world
+we
+pass
+through
+the
+sphere
+in
+which
+are
+most
+of
+the
+spirits
+of
+darkness
+which
+we
+call
+earthbound
+spirits
+There
+all
+is
+selfishness
+and
+ignorance
+These
+spirits
+must
+serve
+to
+help
+themselves
+to
+a
+higher
+understanding
+for
+they
+have
+not
+served
+but
+have
+been
+served
+in
+their
+earth
+lives
+They
+do
+not
+know
+what
+it
+is
+to
+live
+and
+do
+for
+others
+they
+have
+lived
+only
+for
+self
+They
+are
+waiting
+to
+be
+served
+Their
+minds
+have
+not
+been
+developed
+to
+do
+for
+others
+I
+wish
+I
+could
+take
+you
+to
+the
+sphere
+of
+suicides
+the
+sphere
+of
+the
+churches
+the
+sphere
+of
+the
+slums
+the
+sphere
+of
+the
+misers
+and
+so
+on
+Here
+they
+are
+in
+darkness
+crying
+for
+help
+Many
+of
+them
+do
+not
+know
+what
+to
+do
+They
+go
+to
+mortals
+and
+try
+to
+control
+them
+upsetting
+their
+lives
+and
+they
+are
+ignorant
+of
+what
+they
+are
+doing
+Frank
+and
+Charles
+relatives
+in
+the
+spirit
+world
+have
+taken
+me
+to
+all
+those
+places
+and
+shown
+me
+many
+things
+If
+you
+could
+actually
+realize
+what
+that
+means
+I
+wish
+I
+could
+make
+a
+picture
+for
+you
+of
+all
+those
+conditions
+and
+the
+agony
+of
+despair
+the
+spirits
+are
+in
+They
+will
+have
+to
+find
+themselves
+and
+waken
+to
+a
+realization
+that
+they
+must
+not
+look
+for
+God
+outside
+but
+within
+themselves
+When
+you
+find
+this
+wonderful
+understanding
+of
+life
+and
+realize
+what
+the
+object
+of
+life
+is
+that
+is
+glory
+No
+one
+can
+do
+this
+for
+you
+others
+can
+only
+teach
+you
+but
+you
+have
+to
+work
+for
+yourself
+There
+is
+no
+time
+in
+the
+spirit
+world
+you
+have
+all
+the
+time
+in
+eternity
+to
+find
+yourself
+and
+as
+soon
+as
+you
+understand
+God
+in
+His
+glory
+you
+will
+have
+happiness
+Then
+your
+spiritual
+eyes
+will
+be
+opened
+and
+you
+will
+awaken
+to
+a
+world
+of
+grandeur
+You
+will
+awaken
+and
+realize
+harmony
+and
+glory
+But
+this
+is
+not
+Heaven
+Heaven
+must
+be
+found
+within
+you
+There
+is
+a
+world
+of
+spirits
+and
+there
+is
+a
+future
+life
+everlasting
+There
+you
+have
+your
+homes
+as
+you
+have
+made
+them
+while
+here
+Nearest
+to
+the
+earth
+is
+the
+City
+of
+Ignorance
+and
+the
+conditions
+in
+which
+many
+awaken
+No
+matter
+how
+good
+you
+have
+been
+nor
+how
+well
+you
+have
+lived
+your
+life
+that
+alone
+is
+not
+sufficient
+If
+you
+are
+ignorant
+of
+the
+life
+and
+system
+of
+the
+other
+side
+you
+are
+in
+darkness
+for
+the
+time
+being
+until
+you
+awaken
+and
+realize
+that
+there
+is
+a
+life
+after
+this
+Each
+has
+a
+home
+in
+the
+spirit
+world
+made
+by
+service
+to
+others
+during
+earth
+life
+As
+you
+have
+made
+it
+here
+so
+you
+will
+have
+it
+there
+If
+you
+have
+done
+good
+acts
+and
+lived
+a
+pure
+upright
+life
+doing
+the
+best
+you
+know
+how
+your
+home
+is
+beautiful
+But
+you
+will
+not
+know
+how
+to
+reach
+that
+home
+if
+you
+are
+ignorant
+of
+the
+laws
+governing
+the
+spirit
+world
+If
+you
+have
+lived
+a
+life
+of
+selfishness
+and
+lived
+only
+and
+entirely
+for
+self
+your
+home
+is
+a
+little
+place
+that
+you
+can
+hardly
+creep
+into
+and
+you
+see
+nothing
+but
+self
+You
+have
+no
+company
+but
+your
+own
+self
+You
+have
+your
+thoughts
+of
+self
+you
+have
+lived
+for
+self
+and
+you
+have
+to
+live
+in
+that
+state
+of
+mind
+until
+you
+ask
+God
+for
+help
+and
+say
+Not
+my
+will
+any
+longer
+but
+Thy
+will
+Give
+me
+help
+Then
+your
+spirit
+comprehends
+the
+results
+of
+your
+actions
+during
+earth
+life
+You
+go
+back
+to
+the
+earth
+plane
+again
+and
+there
+you
+have
+to
+serve
+those
+whom
+you
+have
+harmed
+through
+your
+selfishness
+If
+they
+are
+still
+in
+earth
+life
+you
+have
+to
+watch
+and
+help
+them
+all
+you
+can
+and
+you
+will
+have
+to
+serve
+them
+until
+you
+have
+atoned
+for
+the
+harm
+you
+have
+done
+them
+while
+you
+were
+on
+earth
+If
+they
+have
+passed
+out
+and
+are
+in
+the
+dark
+you
+will
+have
+to
+find
+them
+and
+help
+bring
+them
+to
+an
+understanding
+of
+life
+and
+you
+will
+have
+to
+serve
+them
+until
+you
+have
+paid
+your
+debt
+After
+you
+have
+done
+that
+you
+step
+out
+of
+that
+sphere
+into
+a
+higher
+sphere
+where
+your
+home
+is
+Your
+home
+is
+given
+to
+you
+after
+you
+have
+earned
+it
+Then
+your
+friends
+come
+to
+you
+and
+help
+you
+and
+there
+is
+a
+reunion
+like
+which
+there
+is
+nothing
+on
+earth
+because
+that
+reunion
+with
+your
+relatives
+and
+friends
+is
+a
+reunion
+in
+reality
+All
+are
+like
+one
+all
+are
+in
+tune
+all
+are
+in
+harmony
+with
+each
+other
+Just
+to
+be
+able
+to
+say
+I
+live
+in
+the
+hearts
+of
+my
+friends
+is
+great
+happiness
+The
+reunion
+that
+they
+had
+for
+me
+at
+the
+time
+I
+passed
+out
+and
+came
+to
+an
+understanding
+of
+life
+can
+never
+be
+described
+Many
+of
+my
+friends
+I
+met
+later
+and
+I
+have
+been
+helping
+to
+waken
+them
+to
+the
+glory
+of
+understanding
+Let
+us
+not
+believe
+but
+let
+us
+act
+Let
+us
+all
+do
+our
+duty
+while
+we
+are
+here
+and
+let
+us
+understand
+the
+wonders
+of
+Nature
+and
+the
+wonders
+of
+God
+We
+could
+not
+worship
+more
+than
+God
+for
+God
+is
+everything
+You
+are
+one
+part
+of
+His
+grand
+work
+the
+flowers
+are
+another
+part
+of
+His
+grand
+work
+the
+animals
+another
+part
+so
+how
+could
+you
+be
+outside
+God
+Why
+should
+you
+not
+worship
+His
+manifestations
+in
+every
+way
+You
+are
+in
+the
+very
+midst
+of
+Him
+When
+you
+are
+one
+with
+God
+you
+have
+great
+glory
+I
+want
+to
+say
+Hallelujah
+A
+favorite
+expression
+in
+earth
+life
+That
+is
+grand
+that
+is
+beautiful
+This
+is
+a
+step
+every
+one
+has
+to
+take
+every
+one
+has
+to
+pass
+through
+this
+I
+learned
+my
+first
+step
+in
+a
+few
+months
+When
+I
+woke
+up
+from
+the
+sleep
+of
+death
+we
+call
+it
+a
+sleep
+of
+transition
+I
+was
+really
+awake
+I
+had
+understanding
+I
+was
+told
+about
+the
+grand
+things
+in
+spirit
+but
+I
+never
+could
+have
+imagined
+it
+as
+grand
+as
+I
+found
+it
+Let
+us
+visit
+the
+churches
+of
+the
+earth
+sphere
+the
+place
+of
+the
+spirits
+who
+pass
+out
+with
+religious
+belief
+and
+dogma
+These
+gather
+in
+a
+group
+and
+do
+not
+try
+to
+waken
+to
+the
+realization
+that
+they
+are
+still
+sleeping
+spiritually
+because
+they
+have
+never
+asked
+Who
+am
+I
+Where
+did
+I
+come
+from
+Where
+do
+I
+go
+Where
+is
+the
+real
+life
+They
+are
+self
+hypnotized
+by
+their
+belief
+in
+Jesus
+Christ
+and
+in
+God
+sitting
+on
+a
+throne
+with
+Christ
+at
+His
+right
+side
+judging
+the
+people
+good
+and
+bad
+Some
+they
+think
+have
+to
+go
+to
+a
+burning
+hell
+and
+some
+will
+go
+in
+glory
+to
+God
+in
+Heaven
+That
+is
+the
+belief
+they
+have
+and
+although
+dead
+the
+majority
+of
+those
+who
+only
+believe
+are
+still
+on
+earth
+going
+to
+church
+They
+want
+to
+be
+on
+earth
+singing
+the
+same
+songs
+and
+praying
+the
+same
+prayers
+They
+think
+that
+all
+they
+have
+to
+do
+is
+to
+sing
+and
+pray
+Many
+do
+not
+know
+they
+have
+passed
+out
+They
+do
+not
+even
+stop
+to
+think
+that
+their
+relatives
+and
+friends
+do
+not
+talk
+to
+them
+as
+they
+did
+formerly
+We
+have
+a
+very
+hard
+time
+to
+reach
+them
+Some
+sing
+and
+pray
+others
+walk
+alone
+trying
+to
+find
+out
+what
+is
+the
+matter
+at
+other
+times
+they
+become
+attached
+to
+mortals
+and
+hypnotize
+them
+so
+by
+their
+belief
+that
+the
+mortals
+become
+obsessed
+and
+are
+sent
+to
+the
+asylum
+for
+religious
+mania
+It
+is
+a
+great
+pity
+that
+men
+cannot
+understand
+God
+When
+they
+have
+that
+understanding
+they
+cannot
+live
+for
+themselves
+they
+will
+want
+to
+work
+for
+others
+and
+give
+every
+one
+of
+their
+happiness
+I
+have
+still
+to
+see
+the
+depth
+of
+misery
+to
+which
+the
+wretched
+ones
+go
+because
+of
+hate
+and
+selfishness
+These
+hate
+all
+humanity
+That
+is
+the
+worst
+condition
+They
+are
+so
+crippled
+that
+you
+can
+hardly
+believe
+they
+are
+persons
+They
+have
+to
+be
+taught
+to
+realize
+but
+how
+can
+they
+be
+reached
+They
+are
+afraid
+of
+themselves
+and
+they
+have
+to
+remain
+in
+that
+condition
+until
+they
+pray
+in
+all
+earnestness
+to
+be
+freed
+I
+have
+learned
+this
+in
+the
+few
+months
+I
+have
+been
+on
+the
+spirit
+side
+of
+life
+I
+have
+a
+very
+nice
+home
+in
+the
+spirit
+world
+I
+have
+my
+relatives
+and
+friends
+but
+everything
+is
+very
+different
+here
+from
+there
+I
+have
+to
+help
+many
+of
+my
+friends
+because
+even
+though
+some
+passed
+out
+long
+before
+I
+they
+are
+still
+in
+darkness
+regarding
+an
+understanding
+of
+the
+real
+life
+The
+teaching
+of
+children
+should
+be
+very
+different
+from
+what
+it
+is
+Children
+should
+be
+taught
+about
+God
+in
+Nature
+taught
+that
+God
+is
+Love
+If
+they
+were
+properly
+taught
+you
+would
+not
+have
+any
+crime
+They
+would
+love
+Nature
+they
+would
+love
+animals
+they
+would
+love
+humanity
+at
+large
+But
+they
+are
+taught
+not
+to
+worship
+Nature
+How
+could
+you
+worship
+God
+more
+beautifully
+than
+to
+worship
+Him
+through
+His
+manifestation
+I
+am
+glad
+to
+be
+with
+you
+tonight
+and
+I
+want
+you
+all
+to
+go
+on
+with
+your
+work
+If
+you
+could
+only
+see
+every
+evening
+when
+you
+have
+your
+meeting
+how
+many
+crippled
+and
+unfortunate
+spirits
+listen
+and
+try
+to
+get
+help
+so
+they
+can
+pass
+into
+the
+life
+beyond
+Humanity
+should
+rouse
+itself
+and
+not
+send
+so
+many
+ignorant
+spirits
+to
+the
+other
+side
+because
+these
+only
+stay
+near
+the
+earth
+and
+do
+harm
+to
+those
+who
+are
+here
+on
+earth
+Humanity
+will
+have
+a
+difficult
+time
+for
+a
+little
+while
+because
+of
+crime
+and
+selfishness
+All
+that
+people
+live
+for
+now
+is
+money
+and
+self
+They
+will
+have
+to
+change
+their
+viewpoint
+some
+time
+Then
+peace
+will
+go
+over
+the
+earth
+Now
+it
+is
+war
+war
+with
+everybody
+but
+when
+peace
+and
+harmony
+prevail
+you
+will
+find
+a
+glorious
+condition
+I
+say
+Hallelujah
+Let
+that
+time
+come
+as
+quickly
+as
+possible
+Just
+now
+it
+is
+fighting
+and
+laws
+Unless
+this
+is
+changed
+people
+will
+rise
+because
+they
+want
+freedom
+but
+God
+speed
+the
+day
+when
+the
+peace
+spirit
+will
+come
+over
+all
+Frank
+is
+a
+good
+fellow
+to
+be
+with
+and
+he
+is
+not
+afraid
+to
+make
+inquiries
+At
+times
+I
+feel
+like
+saying
+No
+I
+can
+t
+do
+that
+but
+he
+says
+there
+is
+nothing
+which
+can
+harm
+you
+if
+you
+are
+not
+afraid
+Fear
+is
+what
+we
+must
+avoid
+we
+must
+develop
+power
+When
+you
+develop
+fear
+you
+create
+conditions
+of
+fear
+around
+you
+You
+should
+develop
+within
+yourself
+the
+power
+of
+God
+the
+power
+to
+conquer
+the
+power
+of
+Love
+Then
+you
+will
+conquer
+no
+matter
+what
+comes
+I
+wish
+you
+could
+all
+understand
+God
+not
+as
+a
+person
+but
+as
+the
+Life
+of
+the
+whole
+Universe
+and
+realize
+that
+there
+is
+no
+life
+without
+God
+He
+is
+the
+Divine
+in
+everything
+but
+we
+are
+clothed
+with
+selfishness
+jealousy
+and
+ignorance
+If
+you
+are
+troubled
+by
+obsession
+say
+to
+yourself
+I
+am
+master
+over
+my
+own
+body
+and
+I
+shall
+be
+Repeat
+it
+over
+and
+over
+again
+and
+you
+will
+find
+that
+you
+have
+power
+Do
+not
+send
+out
+thoughts
+of
+evil
+because
+they
+only
+hinder
+your
+own
+self
+They
+create
+more
+thoughts
+of
+anger
+and
+you
+will
+not
+have
+gained
+anything
+Develop
+within
+yourself
+power
+and
+strength
+to
+conquer
+Say
+to
+yourself
+over
+and
+over
+again
+I
+am
+master
+and
+nobody
+else
+can
+interfere
+When
+you
+do
+that
+you
+will
+be
+free
+Do
+not
+think
+of
+the
+other
+one
+obsessing
+spirit
+who
+is
+trying
+to
+bother
+you
+Send
+out
+a
+kind
+thought
+to
+him
+Doctor
+I
+want
+to
+thank
+you
+and
+your
+wife
+for
+that
+nice
+little
+party
+funeral
+I
+had
+that
+is
+what
+I
+call
+it
+It
+was
+a
+nice
+little
+party
+at
+the
+time
+I
+passed
+to
+the
+spirit
+world
+I
+do
+not
+think
+there
+was
+one
+in
+that
+little
+church
+who
+thought
+it
+was
+a
+funeral
+It
+was
+a
+party
+I
+was
+with
+them
+during
+the
+service
+I
+do
+not
+think
+any
+one
+thought
+of
+the
+coffin
+I
+thank
+you
+all
+for
+letting
+the
+service
+be
+held
+in
+that
+fine
+little
+church
+and
+also
+for
+suggesting
+that
+they
+all
+wear
+white
+That
+was
+glory
+and
+I
+felt
+like
+shouting
+Hallelujah
+I
+wish
+all
+funerals
+could
+be
+like
+that
+Sadness
+and
+sorrow
+bring
+to
+the
+spirits
+sadness
+and
+sorrow
+and
+gloom
+They
+cannot
+get
+out
+of
+that
+gloom
+for
+years
+Now
+I
+must
+go
+Another
+old
+friend
+a
+physician
+and
+metaphysician
+who
+had
+been
+a
+lecturer
+among
+the
+Spiritualists
+during
+his
+earth
+life
+visits
+with
+us
+occasionally
+EXPERIENCE
+OCTOBER
+Spirit
+DR
+ADAMS
+Psychic
+MRS
+WICKLAND
+I
+am
+heart
+and
+soul
+in
+this
+work
+I
+was
+in
+this
+work
+when
+in
+life
+not
+so
+much
+doing
+the
+obsession
+work
+as
+does
+Doctor
+but
+I
+was
+in
+the
+work
+of
+spreading
+the
+truth
+that
+there
+is
+a
+life
+after
+this
+It
+is
+a
+real
+life
+not
+an
+imaginary
+one
+it
+is
+a
+life
+of
+understanding
+not
+a
+life
+of
+belief
+If
+you
+only
+believe
+you
+will
+be
+in
+darkness
+with
+a
+closed
+door
+because
+you
+have
+only
+belief
+not
+knowledge
+of
+the
+other
+world
+The
+Bible
+teaches
+so
+much
+and
+if
+people
+would
+only
+understand
+it
+as
+it
+was
+really
+meant
+not
+take
+it
+literally
+or
+historically
+it
+would
+be
+so
+much
+better
+You
+must
+understand
+that
+at
+the
+time
+the
+Bible
+was
+written
+the
+people
+were
+not
+as
+enlightened
+as
+they
+are
+today
+and
+there
+was
+so
+much
+selfishness
+When
+the
+first
+church
+was
+formed
+it
+was
+the
+church
+of
+the
+understanding
+of
+life
+and
+the
+teaching
+was
+to
+live
+for
+high
+thoughts
+and
+to
+sacrifice
+self
+for
+others
+When
+you
+study
+and
+study
+deeply
+earth
+conditions
+have
+no
+existence
+for
+you
+Religion
+is
+often
+used
+as
+a
+whip
+for
+ignorant
+people
+The
+leaders
+say
+We
+want
+these
+people
+to
+obey
+us
+we
+want
+them
+to
+do
+as
+we
+tell
+them
+to
+do
+we
+want
+them
+to
+be
+slaves
+Look
+back
+in
+history
+and
+you
+will
+find
+that
+people
+were
+easygoing
+very
+lazy
+did
+not
+care
+they
+did
+not
+care
+to
+do
+anything
+The
+women
+were
+the
+ones
+who
+did
+the
+work
+they
+did
+the
+farming
+for
+the
+men
+were
+too
+lazy
+The
+women
+had
+to
+do
+the
+work
+and
+be
+the
+slaves
+Then
+along
+came
+a
+shrewd
+man
+who
+thought
+We
+will
+make
+these
+men
+work
+and
+the
+leaders
+got
+up
+a
+scheme
+to
+scare
+people
+They
+told
+them
+that
+if
+they
+did
+not
+do
+so
+and
+so
+the
+devil
+would
+get
+hold
+of
+them
+when
+they
+die
+and
+they
+would
+go
+to
+hell
+and
+damnation
+Then
+they
+painted
+hell
+in
+the
+worst
+condition
+they
+could
+They
+painted
+it
+as
+a
+big
+oven
+burning
+There
+were
+skeletons
+here
+and
+there
+and
+hot
+fire
+and
+the
+one
+that
+put
+people
+in
+the
+fire
+was
+the
+devil
+and
+he
+put
+them
+in
+with
+his
+pitchfork
+That
+made
+the
+men
+wake
+up
+That
+picture
+gave
+them
+energy
+strength
+and
+power
+They
+were
+afraid
+afraid
+they
+would
+get
+into
+that
+hell
+when
+they
+died
+Humanity
+tried
+to
+do
+everything
+possible
+to
+escape
+that
+hell
+and
+the
+leaders
+were
+able
+to
+make
+the
+people
+do
+whatever
+they
+told
+them
+One
+conceived
+the
+idea
+that
+he
+wanted
+to
+be
+leader
+then
+another
+wanted
+to
+be
+the
+leader
+but
+how
+could
+both
+be
+leaders
+in
+one
+circle
+Then
+another
+conceived
+the
+idea
+that
+religion
+would
+be
+better
+if
+he
+had
+a
+little
+clique
+of
+his
+own
+so
+he
+preached
+in
+his
+way
+and
+called
+it
+whatever
+he
+pleased
+Along
+came
+another
+and
+he
+had
+his
+idea
+because
+he
+wanted
+to
+be
+leader
+so
+he
+gathered
+some
+people
+into
+his
+corner
+and
+preached
+in
+his
+way
+So
+we
+had
+one
+group
+here
+and
+another
+there
+One
+wanted
+to
+rule
+the
+world
+but
+along
+came
+another
+sect
+and
+they
+called
+themselves
+by
+a
+new
+name
+and
+felt
+they
+wanted
+to
+rule
+They
+fought
+and
+had
+wars
+Then
+followed
+other
+religions
+and
+all
+had
+adherents
+Each
+tried
+to
+be
+a
+greater
+leader
+than
+the
+other
+Some
+were
+more
+crabbed
+but
+all
+tried
+to
+get
+the
+people
+together
+and
+hold
+them
+some
+by
+the
+picture
+I
+spoke
+of
+regarding
+hell
+They
+could
+not
+get
+them
+together
+much
+in
+the
+beginning
+unless
+they
+held
+them
+in
+bondage
+That
+has
+gone
+on
+for
+years
+and
+years
+but
+now
+there
+has
+come
+a
+new
+era
+and
+all
+will
+be
+at
+least
+partially
+broken
+up
+There
+will
+be
+a
+different
+condition
+Nowadays
+some
+of
+the
+people
+believe
+and
+some
+do
+not
+and
+some
+think
+they
+do
+not
+want
+to
+have
+anything
+to
+do
+with
+religion
+and
+so
+we
+have
+a
+state
+of
+turmoil
+They
+are
+all
+fighting
+and
+fighting
+Each
+one
+fights
+to
+see
+if
+he
+cannot
+get
+the
+best
+of
+others
+The
+idea
+is
+to
+get
+all
+the
+money
+you
+can
+all
+the
+power
+you
+can
+and
+then
+be
+the
+leader
+People
+want
+to
+get
+all
+they
+can
+now
+as
+this
+is
+the
+time
+to
+make
+money
+and
+they
+say
+they
+will
+make
+it
+regardless
+of
+the
+method
+They
+have
+become
+so
+selfish
+in
+their
+money
+making
+that
+their
+true
+citizenship
+is
+lost
+Things
+are
+very
+different
+now
+from
+what
+they
+were
+when
+I
+was
+a
+boy
+It
+will
+be
+very
+hard
+for
+some
+time
+because
+capital
+wants
+to
+rule
+and
+labor
+wants
+to
+rule
+so
+we
+have
+friction
+and
+trouble
+The
+churches
+are
+trying
+to
+make
+people
+go
+to
+church
+but
+if
+they
+continue
+to
+keep
+people
+down
+there
+will
+in
+time
+be
+a
+war
+that
+will
+be
+terrible
+because
+holding
+people
+down
+kills
+the
+better
+nature
+in
+them
+People
+get
+all
+they
+can
+from
+each
+other
+The
+spirit
+of
+the
+day
+is
+to
+get
+all
+you
+can
+no
+matter
+how
+you
+get
+it
+When
+I
+lived
+on
+this
+earth
+plane
+it
+was
+an
+honor
+to
+do
+your
+work
+well
+and
+to
+be
+faithful
+to
+your
+employer
+Now
+if
+the
+employer
+does
+not
+like
+your
+work
+he
+can
+easily
+get
+another
+man
+to
+take
+your
+place
+How
+can
+you
+expect
+such
+people
+to
+feel
+right
+when
+they
+pass
+out
+of
+their
+bodies
+They
+leave
+their
+bodies
+and
+take
+possession
+of
+any
+one
+they
+can
+reach
+on
+the
+earth
+plane
+and
+therefore
+we
+have
+insanity
+and
+all
+kinds
+of
+suicides
+They
+had
+war
+for
+four
+years
+and
+killed
+thousands
+and
+thousands
+of
+people
+These
+left
+the
+world
+they
+loved
+filled
+with
+hatred
+and
+they
+come
+back
+and
+try
+to
+crush
+this
+world
+The
+time
+will
+come
+when
+conditions
+will
+be
+very
+serious
+but
+after
+that
+things
+will
+be
+better
+People
+will
+reach
+a
+better
+understanding
+and
+will
+learn
+through
+sorrows
+and
+try
+to
+comprehend
+the
+mystery
+of
+life
+There
+will
+be
+great
+inventions
+which
+will
+be
+remarkable
+At
+this
+time
+people
+are
+being
+crushed
+but
+after
+a
+while
+there
+will
+be
+an
+awakening
+It
+is
+said
+The
+mills
+of
+the
+gods
+grind
+slowly
+but
+they
+grind
+exceeding
+fine
+and
+that
+is
+what
+the
+world
+is
+going
+through
+now
+The
+time
+will
+come
+when
+people
+will
+know
+that
+we
+are
+not
+dead
+when
+we
+pass
+to
+the
+spirit
+side
+of
+life
+but
+that
+we
+live
+We
+are
+trying
+to
+help
+and
+guide
+you
+all
+and
+we
+hope
+to
+have
+more
+sincerity
+among
+the
+people
+Death
+will
+only
+be
+like
+a
+journey
+which
+they
+take
+to
+another
+country
+where
+they
+will
+be
+with
+their
+loved
+ones
+if
+they
+have
+understanding
+You
+have
+flying
+machines
+now
+but
+after
+a
+few
+years
+you
+will
+have
+air
+inventions
+that
+are
+not
+dreamed
+of
+at
+this
+time
+This
+is
+only
+the
+beginning
+You
+will
+use
+more
+electricity
+and
+atmospheric
+conditions
+will
+be
+used
+as
+power
+You
+will
+get
+power
+from
+the
+sun
+which
+will
+be
+of
+great
+benefit
+to
+humanity
+then
+the
+capitalists
+cannot
+buy
+things
+as
+they
+do
+now
+They
+crush
+the
+poor
+people
+now
+because
+they
+can
+buy
+everything
+and
+the
+others
+cannot
+have
+it
+They
+say
+God
+did
+not
+give
+it
+to
+you
+He
+gave
+it
+to
+me
+Machinery
+will
+run
+by
+that
+power
+Any
+one
+with
+a
+little
+instruction
+will
+be
+able
+to
+use
+it
+and
+can
+take
+all
+the
+power
+he
+wants
+from
+the
+atmosphere
+Selfishness
+will
+then
+be
+done
+away
+with
+and
+people
+will
+learn
+to
+live
+and
+love
+as
+Christ
+taught
+them
+They
+will
+not
+live
+a
+life
+of
+belief
+as
+they
+have
+during
+the
+past
+centuries
+In
+the
+future
+people
+will
+know
+that
+if
+they
+do
+not
+do
+right
+they
+will
+suffer
+for
+it
+They
+have
+already
+taken
+away
+most
+of
+the
+pictures
+of
+burning
+hell
+and
+therefore
+the
+churches
+no
+longer
+have
+the
+control
+of
+the
+people
+they
+had
+in
+the
+past
+When
+ministers
+teach
+the
+truth
+regarding
+the
+life
+after
+this
+they
+will
+have
+their
+churches
+full
+People
+will
+then
+go
+to
+church
+to
+worship
+and
+will
+not
+only
+believe
+We
+all
+make
+mistakes
+and
+we
+should
+learn
+through
+those
+mistakes
+God
+wants
+us
+to
+be
+wise
+and
+understand
+Him
+It
+is
+not
+that
+God
+made
+a
+mistake
+and
+did
+not
+know
+what
+He
+was
+doing
+He
+has
+given
+you
+power
+you
+are
+a
+part
+of
+Him
+and
+after
+you
+learn
+to
+understand
+God
+in
+all
+His
+wonders
+you
+will
+be
+in
+the
+happy
+state
+that
+we
+call
+Bliss
+and
+that
+is
+Heaven
+You
+have
+to
+search
+for
+that
+understanding
+People
+should
+gather
+together
+and
+unite
+and
+be
+in
+harmony
+Always
+selfishness
+and
+jealousy
+creep
+in
+Let
+us
+try
+to
+conquer
+them
+and
+put
+them
+away
+and
+have
+love
+in
+our
+hearts
+If
+only
+people
+would
+understand
+what
+love
+means
+They
+talk
+it
+with
+their
+lips
+but
+they
+never
+practice
+it
+I
+had
+a
+very
+hard
+time
+of
+it
+when
+I
+was
+on
+earth
+because
+I
+believed
+in
+a
+life
+after
+this
+and
+preached
+it
+They
+called
+me
+crazy
+they
+said
+I
+would
+go
+to
+hell
+They
+said
+there
+is
+no
+such
+thing
+as
+the
+spirit
+world
+when
+we
+die
+we
+go
+to
+the
+grave
+and
+stay
+there
+until
+the
+last
+day
+Then
+we
+shall
+be
+awakened
+and
+God
+will
+sit
+on
+His
+throne
+and
+call
+the
+sinners
+on
+one
+side
+and
+the
+good
+on
+another
+One
+lot
+will
+go
+to
+hell
+and
+damnation
+and
+the
+others
+will
+be
+in
+Heaven
+and
+glory
+Isn
+t
+that
+terrible
+They
+say
+God
+made
+them
+all
+some
+to
+be
+condemned
+and
+others
+to
+go
+to
+glory
+Imagine
+some
+going
+to
+Heaven
+and
+seeing
+the
+others
+lie
+in
+hell
+and
+burn
+I
+had
+many
+struggles
+and
+troubles
+in
+life
+Of
+course
+I
+was
+a
+physician
+but
+I
+also
+practiced
+magnetism
+and
+I
+taught
+the
+truth
+of
+the
+life
+hereafter
+because
+I
+felt
+it
+was
+my
+duty
+I
+did
+all
+I
+could
+to
+build
+up
+the
+church
+of
+Spiritualism
+and
+I
+worked
+very
+hard
+I
+wanted
+to
+preach
+the
+philosophy
+of
+spirit
+return
+not
+phenomena
+Do
+all
+you
+can
+to
+open
+the
+door
+to
+the
+unseen
+but
+always
+with
+understanding
+of
+the
+governing
+laws
+The
+average
+Spiritualists
+of
+today
+have
+not
+even
+studied
+the
+philosophy
+of
+life
+and
+do
+not
+know
+the
+laws
+that
+govern
+between
+this
+world
+and
+the
+next
+Spiritualism
+is
+the
+Science
+of
+the
+Bible
+The
+Bible
+says
+The
+letter
+killeth
+but
+the
+spirit
+giveth
+life
+If
+you
+understand
+the
+Bible
+it
+becomes
+a
+grand
+book
+Many
+go
+blindly
+to
+church
+only
+believing
+and
+have
+no
+knowledge
+or
+understanding
+I
+shall
+be
+glad
+when
+all
+phenomena
+will
+be
+buried
+and
+philosophy
+will
+take
+its
+place
+and
+preachers
+will
+preach
+the
+true
+gospel
+of
+God
+not
+of
+the
+Savior
+but
+God
+the
+Divine
+the
+Life
+in
+each
+of
+us
+We
+must
+understand
+God
+better
+and
+learn
+to
+know
+Him
+as
+we
+have
+the
+power
+to
+do
+Do
+not
+let
+us
+condemn
+anything
+through
+ignorance
+selfishness
+and
+jealousy
+These
+we
+should
+crush
+under
+our
+feet
+and
+we
+should
+live
+up
+to
+the
+best
+of
+our
+Love
+Wisdom
+and
+Understanding
+of
+our
+Maker
+Good
+Night
+Many
+years
+ago
+Mrs
+Wickland
+had
+an
+intimate
+friend
+Mrs
+Lackmund
+whose
+little
+girl
+at
+the
+age
+of
+two
+and
+a
+half
+became
+an
+imbecile
+after
+one
+sudden
+convulsion
+The
+mother
+was
+convinced
+that
+this
+condition
+was
+caused
+by
+spirit
+obsession
+and
+together
+with
+Mrs
+Wickland
+began
+to
+investigate
+the
+subject
+Mrs
+Lackmund
+and
+Mrs
+Wickland
+had
+made
+an
+agreement
+that
+whichever
+one
+of
+them
+should
+first
+pass
+to
+the
+spirit
+side
+of
+life
+would
+try
+to
+return
+and
+communicate
+with
+the
+other
+saying
+as
+a
+test
+Spirit
+return
+is
+true
+A
+year
+after
+this
+Mrs
+Lackmund
+died
+and
+two
+weeks
+later
+during
+the
+night
+appeared
+to
+Mrs
+Wickland
+so
+life
+like
+that
+the
+latter
+did
+not
+realize
+she
+was
+a
+spirit
+Mrs
+Lackmund
+touched
+her
+friend
+lightly
+on
+the
+cheek
+and
+Mrs
+Wickland
+sat
+up
+exclaiming
+Mrs
+Lackmund
+Then
+Mrs
+Lackmund
+spoke
+Anna
+spirit
+return
+is
+true
+I
+will
+develop
+you
+Go
+on
+with
+the
+work
+of
+obsession
+Shortly
+after
+this
+she
+appeared
+to
+Mrs
+Wickland
+again
+at
+a
+materialization
+seance
+giving
+unmistakable
+proof
+of
+her
+identity
+and
+repeated
+her
+former
+words
+Spirit
+return
+is
+true
+Go
+on
+with
+the
+work
+of
+obsession
+I
+will
+develop
+you
+Subsequently
+she
+joined
+the
+band
+of
+invisibles
+who
+guard
+Mrs
+Wickland
+and
+since
+then
+has
+very
+often
+spoken
+through
+the
+latter
+EXPERIENCE
+SEPTEMBER
+Spirit
+MRS
+LACKMUND
+Psychic
+MRS
+WICKLAND
+How
+few
+people
+understand
+life
+or
+God
+in
+the
+right
+way
+Instead
+of
+believing
+in
+God
+and
+using
+His
+name
+so
+much
+and
+calling
+on
+Him
+to
+do
+what
+they
+should
+do
+themselves
+they
+should
+realize
+that
+God
+is
+Love
+and
+the
+Light
+of
+Understanding
+How
+can
+we
+live
+and
+not
+understand
+Him
+in
+the
+right
+way
+If
+people
+would
+only
+understand
+God
+as
+it
+was
+meant
+they
+should
+understand
+Him
+they
+would
+not
+have
+so
+much
+selfishness
+worry
+or
+fighting
+because
+people
+would
+have
+more
+love
+for
+each
+other
+and
+not
+think
+so
+much
+of
+self
+They
+would
+worship
+God
+not
+money
+People
+think
+the
+more
+money
+they
+have
+the
+happier
+they
+will
+be
+They
+do
+not
+know
+what
+happiness
+means
+they
+do
+not
+know
+what
+true
+happiness
+is
+They
+think
+they
+will
+be
+happy
+when
+they
+have
+plenty
+of
+money
+to
+get
+things
+things
+to
+eat
+and
+things
+to
+drink
+and
+live
+a
+life
+of
+injury
+to
+the
+body
+These
+are
+the
+things
+most
+thought
+of
+at
+present
+In
+time
+however
+the
+world
+will
+understand
+God
+The
+churches
+will
+soon
+waken
+and
+teach
+the
+true
+gospel
+of
+God
+teach
+people
+not
+to
+believe
+but
+to
+understand
+to
+understand
+His
+wondrous
+works
+to
+understand
+Him
+and
+how
+He
+manifests
+in
+everything
+Every
+flower
+is
+a
+manifestation
+of
+God
+The
+odor
+of
+a
+beautiful
+flower
+is
+God
+and
+He
+sends
+it
+out
+to
+everyone
+that
+His
+presence
+may
+be
+felt
+You
+can
+see
+God
+s
+manifestation
+through
+the
+beautiful
+spirit
+of
+the
+odor
+that
+shines
+I
+call
+it
+so
+through
+that
+flower
+You
+do
+not
+need
+to
+touch
+it
+If
+you
+were
+blind
+you
+would
+know
+there
+must
+be
+a
+flower
+because
+of
+the
+odor
+for
+it
+permeates
+the
+atmosphere
+Shall
+you
+not
+worship
+God
+and
+see
+how
+wonderfully
+He
+manifests
+Himself
+to
+you
+in
+the
+exquisite
+odor
+of
+flowers
+that
+make
+you
+feel
+happier
+for
+having
+them
+around
+you
+See
+the
+Master
+s
+work
+in
+one
+flower
+and
+another
+Can
+you
+make
+them
+as
+they
+are
+Can
+you
+paint
+them
+with
+their
+odor
+In
+your
+garden
+you
+plant
+one
+flower
+here
+and
+another
+flower
+there
+why
+do
+they
+not
+mix
+Why
+do
+not
+green
+leaves
+grow
+among
+the
+petals
+of
+the
+red
+flower
+The
+green
+leaves
+take
+from
+the
+atmosphere
+what
+they
+need
+and
+the
+red
+flower
+takes
+what
+it
+needs
+and
+colors
+itself
+The
+flowers
+clothe
+themselves
+from
+the
+colors
+of
+the
+sun
+One
+is
+purple
+one
+red
+another
+yellow
+another
+blue
+and
+each
+has
+its
+place
+in
+the
+beautiful
+Nature
+of
+God
+All
+is
+perfect
+in
+God
+s
+Nature
+When
+you
+go
+from
+the
+kingdom
+of
+flowers
+and
+vegetables
+to
+the
+animals
+you
+will
+find
+something
+that
+you
+do
+not
+often
+find
+in
+men
+and
+women
+faithful
+love
+Men
+and
+women
+should
+be
+the
+crown
+of
+God
+s
+creation
+but
+they
+are
+bound
+by
+doubt
+and
+creed
+Many
+think
+themselves
+holy
+but
+the
+holiness
+is
+only
+superficial
+They
+make
+no
+effort
+to
+be
+honest
+in
+their
+every
+day
+life
+They
+go
+to
+church
+on
+Sunday
+pray
+to
+God
+and
+tell
+Him
+how
+good
+they
+are
+then
+condemn
+another
+man
+who
+does
+not
+go
+to
+church
+at
+all
+but
+who
+tries
+sincerely
+to
+live
+the
+right
+kind
+of
+life
+as
+best
+he
+knows
+how
+Probably
+the
+latter
+is
+nearer
+God
+in
+his
+way
+than
+the
+one
+who
+worships
+outwardly
+and
+does
+not
+live
+a
+sincere
+life
+Earthbound
+spirits
+who
+torment
+mortals
+by
+obsessing
+them
+are
+man
+made
+devils
+Selfishness
+has
+made
+them
+what
+they
+are
+They
+go
+out
+of
+the
+physical
+in
+ignorance
+of
+the
+real
+life
+full
+of
+hatred
+because
+they
+were
+crushed
+in
+one
+way
+or
+another
+They
+have
+hatred
+for
+all
+mankind
+and
+the
+first
+persons
+they
+can
+attach
+themselves
+to
+they
+try
+to
+harm
+and
+there
+you
+have
+obsession
+You
+must
+all
+be
+on
+your
+guard
+you
+must
+every
+one
+of
+you
+try
+to
+fight
+obsession
+Humanity
+is
+fighting
+sickness
+but
+does
+not
+fight
+the
+actual
+cause
+of
+insanity
+Insanity
+is
+nothing
+but
+obsession
+by
+spirits
+who
+are
+sent
+to
+the
+spirit
+side
+of
+life
+without
+understanding
+the
+truth
+of
+God
+Christ
+taught
+us
+to
+love
+God
+above
+all
+things
+and
+our
+neighbor
+as
+ourselves
+People
+do
+not
+love
+their
+neighbors
+as
+they
+should
+Teach
+children
+the
+right
+way
+of
+living
+teach
+them
+the
+right
+understanding
+of
+God
+and
+of
+the
+teachings
+of
+Christ
+Teach
+them
+to
+live
+according
+to
+high
+principles
+not
+to
+worship
+Christ
+as
+a
+person
+but
+as
+the
+True
+Understanding
+and
+the
+Light
+of
+Life
+Then
+you
+will
+not
+send
+earthbound
+spirits
+to
+the
+spirit
+side
+of
+life
+to
+obsess
+sensitives
+who
+have
+to
+be
+sent
+to
+the
+asylums
+People
+do
+not
+know
+what
+to
+do
+with
+the
+insane
+They
+are
+sent
+to
+the
+asylum
+but
+that
+is
+all
+They
+are
+given
+morphine
+closed
+up
+in
+a
+room
+and
+left
+there
+This
+is
+done
+only
+to
+protect
+humanity
+so
+that
+the
+insane
+will
+not
+harm
+themselves
+or
+others
+Instead
+of
+that
+they
+should
+be
+taught
+the
+Golden
+Rule
+and
+be
+given
+an
+opportunity
+to
+develop
+higher
+ideals
+This
+is
+Mrs
+Lackmund
+Good
+Night
+In
+the
+first
+years
+of
+Mrs
+Wickland
+s
+psychic
+work
+a
+friend
+Mrs
+Case
+was
+deeply
+interested
+in
+the
+furtherance
+of
+the
+same
+Recently
+this
+friend
+came
+as
+a
+spirit
+to
+review
+those
+early
+days
+EXPERIENCE
+MARCH
+Spirit
+MRS
+CASE
+Psychic
+MRS
+WICKLAND
+You
+do
+not
+know
+me
+personally
+but
+I
+feel
+that
+I
+am
+one
+of
+you
+I
+knew
+Mrs
+Wickland
+before
+she
+was
+married
+and
+as
+Miss
+Anna
+Anderson
+she
+first
+convinced
+me
+of
+the
+truth
+of
+spirit
+return
+I
+had
+investigated
+the
+subject
+slightly
+and
+had
+read
+one
+of
+Dr
+Hartmann
+s
+books
+as
+well
+as
+some
+theosophical
+writings
+I
+was
+interested
+in
+various
+studies
+but
+not
+set
+in
+any
+One
+evening
+in
+during
+a
+circle
+which
+I
+attended
+in
+Minneapolis
+Miss
+Anderson
+became
+entranced
+by
+the
+spirit
+of
+my
+daughter
+Alice
+My
+daughter
+Alice
+and
+son
+Willie
+and
+my
+husband
+had
+all
+died
+in
+one
+month
+Alice
+came
+over
+to
+me
+and
+throwing
+herself
+in
+my
+arms
+said
+Oh
+Mamma
+Oh
+Mamma
+I
+am
+so
+glad
+that
+I
+can
+come
+to
+you
+This
+is
+Alice
+I
+was
+greatly
+astonished
+but
+very
+delighted
+and
+after
+we
+had
+talked
+with
+each
+other
+for
+a
+little
+while
+Alice
+said
+Mamma
+Willie
+is
+also
+here
+and
+he
+wants
+to
+say
+a
+few
+words
+to
+you
+Then
+my
+son
+spoke
+to
+me
+This
+surprising
+experience
+converted
+me
+and
+from
+that
+time
+I
+was
+eager
+to
+know
+more
+regarding
+the
+truth
+My
+daughter
+Mrs
+Z
+and
+I
+often
+had
+little
+seances
+in
+my
+home
+with
+Miss
+Anderson
+and
+had
+many
+delightful
+visits
+with
+our
+spirit
+friends
+my
+mother
+an
+aunt
+and
+several
+others
+I
+was
+anxious
+that
+Miss
+Anderson
+should
+bring
+her
+work
+out
+to
+the
+world
+but
+she
+was
+very
+modest
+regarding
+her
+mediumship
+I
+wanted
+people
+to
+know
+this
+great
+truth
+so
+I
+went
+to
+Stillwater
+Minnesota
+and
+rented
+an
+opera
+house
+intending
+to
+lecture
+on
+the
+subject
+of
+spirit
+return
+and
+then
+have
+Miss
+Anderson
+give
+demonstrations
+We
+advertised
+widely
+and
+many
+people
+were
+present
+at
+the
+meeting
+I
+had
+my
+lecture
+prepared
+but
+at
+the
+last
+moment
+lost
+my
+courage
+and
+could
+not
+face
+the
+audience
+We
+could
+not
+have
+the
+meeting
+a
+failure
+so
+I
+insisted
+that
+Miss
+Anderson
+go
+into
+a
+trance
+and
+let
+the
+Russians
+spirits
+give
+their
+drama
+She
+consented
+and
+the
+play
+was
+well
+given
+Then
+Pretty
+Girl
+guide
+came
+and
+the
+evening
+was
+quite
+a
+success
+This
+was
+how
+Miss
+Anderson
+now
+Mrs
+Wickland
+was
+first
+brought
+before
+the
+public
+When
+I
+became
+very
+sick
+Miss
+Anderson
+was
+with
+me
+a
+great
+deal
+Through
+her
+I
+spoke
+often
+to
+my
+spirit
+friends
+and
+asked
+them
+when
+I
+would
+go
+to
+my
+home
+in
+the
+spirit
+world
+See
+Chap
+Page
+I
+was
+told
+that
+I
+could
+not
+live
+much
+longer
+but
+that
+it
+would
+be
+some
+time
+before
+I
+passed
+to
+the
+other
+side
+I
+was
+taken
+sick
+before
+Thanksgiving
+and
+on
+the
+of
+February
+I
+left
+my
+earthly
+body
+for
+my
+spirit
+body
+I
+went
+to
+sleep
+about
+o
+clock
+Saturday
+night
+and
+passed
+out
+Monday
+at
+o
+clock
+in
+the
+afternoon
+At
+the
+time
+my
+daughter
+sat
+watching
+me
+and
+the
+sun
+was
+shining
+brightly
+in
+the
+room
+I
+felt
+and
+knew
+I
+was
+going
+and
+my
+daughter
+Carrie
+saw
+my
+soul
+leaving
+my
+body
+My
+spirit
+children
+Alice
+and
+Willie
+came
+to
+my
+bedside
+and
+my
+daughter
+saw
+them
+take
+me
+away
+When
+there
+is
+understanding
+there
+is
+no
+death
+You
+only
+go
+to
+sleep
+in
+your
+earthly
+body
+and
+wake
+up
+in
+your
+spirit
+body
+with
+your
+friends
+about
+you
+It
+is
+a
+very
+pleasant
+sensation
+I
+was
+very
+happy
+to
+think
+I
+had
+had
+such
+a
+peaceful
+transition
+I
+merely
+went
+to
+sleep
+and
+woke
+up
+in
+the
+spirit
+world
+with
+my
+relatives
+and
+friends
+around
+me
+But
+my
+husband
+was
+not
+there
+When
+I
+asked
+Why
+is
+my
+husband
+not
+here
+with
+the
+rest
+I
+was
+told
+that
+he
+had
+been
+drawn
+back
+to
+earth
+life
+where
+the
+children
+and
+I
+were
+His
+home
+was
+his
+attraction
+We
+had
+not
+been
+able
+to
+see
+him
+there
+and
+he
+did
+not
+know
+how
+to
+speak
+through
+a
+medium
+so
+he
+had
+remained
+in
+a
+stupor
+I
+went
+with
+my
+spirit
+relatives
+to
+find
+my
+husband
+and
+when
+we
+woke
+him
+we
+were
+both
+very
+happy
+We
+went
+back
+to
+my
+daughter
+Carrie
+to
+tell
+her
+that
+we
+were
+reunited
+and
+she
+saw
+us
+clairvoyantly
+and
+was
+very
+pleased
+After
+that
+I
+often
+came
+back
+and
+talked
+to
+my
+children
+through
+Miss
+Anderson
+until
+she
+married
+and
+left
+Minneapolis
+for
+Chicago
+but
+I
+have
+retained
+my
+interest
+in
+Mrs
+Wickland
+and
+am
+one
+of
+the
+Mercy
+Band
+Mrs
+Wickland
+s
+work
+has
+grown
+very
+much
+she
+has
+developed
+and
+has
+had
+a
+great
+many
+experiences
+She
+is
+doing
+a
+noble
+work
+for
+humanity
+This
+work
+has
+helped
+many
+in
+earth
+life
+but
+many
+many
+more
+on
+the
+other
+side
+Every
+one
+who
+has
+been
+converted
+goes
+into
+the
+Mercy
+Band
+as
+a
+helper
+and
+helps
+here
+as
+well
+as
+on
+the
+other
+side
+If
+only
+there
+were
+more
+on
+earth
+who
+would
+carry
+on
+the
+work
+of
+obsession
+Humanity
+wants
+to
+have
+more
+knowledge
+and
+is
+looking
+for
+the
+truth
+Later
+on
+instruments
+will
+be
+invented
+through
+which
+spirits
+can
+speak
+Spirit
+philosophy
+will
+come
+to
+the
+front
+for
+the
+spirit
+world
+is
+helping
+to
+bring
+the
+truth
+before
+humanity
+Those
+who
+have
+passed
+out
+as
+children
+continue
+their
+development
+in
+the
+spirit
+world
+and
+often
+acquire
+earth
+experience
+by
+contacting
+mortals
+as
+their
+protectors
+One
+of
+Mrs
+Wickland
+s
+guides
+Pretty
+Girl
+came
+to
+her
+as
+a
+gay
+playful
+child
+spirit
+and
+has
+since
+become
+a
+discerning
+philosopher
+with
+a
+practical
+knowledge
+of
+the
+principles
+that
+govern
+life
+EXPERIENCE
+MARCH
+Spirit
+PRETTY
+GIRL
+Psychic
+MRS
+WICKLAND
+I
+was
+five
+years
+old
+when
+I
+passed
+out
+of
+earth
+life
+and
+had
+been
+eight
+years
+in
+the
+spirit
+world
+when
+I
+was
+appointed
+as
+a
+controlling
+spirit
+to
+protect
+Mrs
+Wickland
+through
+life
+against
+mischievous
+spirits
+A
+guide
+is
+a
+teacher
+and
+I
+am
+a
+guide
+now
+but
+then
+I
+was
+only
+a
+control
+At
+that
+time
+Mrs
+Wickland
+was
+often
+asked
+to
+give
+help
+and
+advice
+to
+persons
+who
+came
+to
+her
+in
+trouble
+and
+she
+saved
+many
+from
+suicide
+by
+urging
+them
+to
+be
+more
+cheerful
+and
+to
+search
+for
+the
+bright
+side
+of
+life
+instead
+of
+the
+gloomy
+one
+I
+was
+sent
+as
+control
+and
+adviser
+because
+I
+myself
+had
+seen
+the
+dark
+side
+of
+earth
+life
+and
+could
+sympathize
+more
+fully
+with
+persons
+who
+were
+in
+trouble
+than
+could
+one
+who
+had
+never
+known
+sorrow
+I
+was
+born
+in
+London
+in
+the
+Whitechapel
+district
+on
+the
+of
+August
+My
+parents
+were
+drunkards
+and
+many
+times
+when
+they
+came
+home
+I
+had
+to
+hide
+otherwise
+I
+would
+have
+had
+a
+whipping
+My
+father
+and
+mother
+swore
+at
+me
+and
+called
+me
+all
+kinds
+of
+names
+and
+most
+of
+the
+time
+I
+was
+playing
+on
+the
+streets
+I
+had
+light
+curly
+hair
+and
+blue
+eyes
+and
+passers
+by
+used
+to
+pat
+me
+on
+the
+head
+and
+say
+Pretty
+little
+girl
+pretty
+girl
+Those
+are
+the
+only
+kind
+words
+I
+remember
+from
+my
+earth
+life
+and
+I
+heard
+Pretty
+Girl
+so
+often
+I
+thought
+that
+was
+my
+name
+A
+neighbor
+lady
+was
+the
+only
+person
+who
+ever
+helped
+me
+she
+was
+very
+kind
+and
+took
+care
+of
+me
+When
+I
+was
+five
+years
+old
+I
+died
+Eight
+years
+later
+in
+I
+came
+to
+be
+Mrs
+Wickland
+s
+control
+because
+I
+needed
+further
+earth
+experience
+and
+because
+a
+youthful
+spirit
+brings
+to
+a
+psychic
+a
+feeling
+of
+youth
+and
+strength
+It
+is
+often
+asked
+why
+mediums
+usually
+have
+children
+or
+young
+people
+as
+guides
+When
+a
+spirit
+who
+has
+lived
+to
+an
+old
+age
+on
+earth
+acts
+as
+guide
+through
+his
+contact
+with
+matter
+he
+is
+apt
+to
+sense
+his
+last
+physical
+condition
+and
+this
+often
+leaves
+an
+old
+and
+tired
+feeling
+with
+the
+medium
+while
+children
+bring
+a
+youthful
+magnetism
+For
+this
+reason
+many
+mediums
+have
+children
+as
+guides
+Then
+also
+the
+children
+learn
+earthly
+conditions
+and
+through
+this
+experience
+progress
+in
+the
+spirit
+world
+They
+do
+not
+need
+to
+reincarnate
+because
+they
+gain
+earth
+experience
+through
+contact
+with
+mortals
+Advanced
+spirits
+say
+such
+as
+Abraham
+Lincoln
+do
+not
+need
+to
+come
+to
+earth
+for
+further
+experience
+They
+do
+their
+duty
+in
+the
+spirit
+world
+often
+helping
+earthbound
+spirits
+and
+giving
+lectures
+on
+the
+spirit
+side
+of
+life
+If
+a
+medium
+in
+earth
+life
+should
+happen
+to
+be
+properly
+tuned
+in
+as
+a
+radio
+such
+a
+lecture
+may
+be
+received
+and
+delivered
+In
+such
+instances
+the
+medium
+often
+thinks
+the
+advanced
+spirit
+is
+his
+guide
+But
+a
+spirit
+like
+Lincoln
+is
+a
+guide
+to
+no
+one
+he
+does
+not
+need
+to
+return
+to
+control
+a
+medium
+in
+order
+to
+progress
+If
+mediums
+are
+in
+tune
+they
+may
+receive
+and
+repeat
+lectures
+given
+in
+the
+spirit
+world
+but
+they
+are
+only
+receiving
+instruments
+and
+are
+speaking
+inspirationally
+The
+first
+time
+I
+controlled
+Mrs
+Wickland
+I
+thought
+I
+had
+come
+to
+life
+again
+I
+acted
+as
+a
+girl
+of
+the
+street
+with
+no
+knowledge
+of
+anything
+I
+was
+very
+jolly
+and
+boisterous
+and
+the
+people
+in
+the
+circle
+told
+me
+if
+I
+did
+not
+behave
+myself
+I
+could
+not
+come
+again
+So
+I
+tried
+to
+behave
+and
+do
+my
+very
+best
+I
+wanted
+to
+learn
+so
+that
+after
+a
+while
+I
+could
+be
+a
+teacher
+helper
+and
+adviser
+I
+went
+to
+school
+on
+the
+spirit
+side
+of
+life
+to
+learn
+the
+lessons
+of
+earth
+and
+these
+lessons
+I
+gave
+many
+times
+to
+persons
+in
+earth
+life
+When
+Mrs
+Wickland
+first
+developed
+her
+mediumship
+she
+also
+studied
+Theosophy
+Christian
+Science
+and
+Psychology
+She
+questioned
+whether
+during
+her
+trance
+condition
+a
+spirit
+was
+actually
+speaking
+or
+whether
+it
+was
+her
+own
+subconscious
+mind
+Wishing
+to
+learn
+the
+facts
+she
+took
+up
+the
+study
+of
+Astrology
+and
+had
+Dr
+Wickland
+ask
+me
+what
+my
+birth
+date
+birth
+place
+general
+appearance
+last
+sickness
+and
+date
+of
+death
+were
+Then
+Mrs
+Wickland
+cast
+my
+horoscope
+which
+indicated
+that
+a
+person
+born
+on
+the
+date
+given
+would
+have
+light
+curly
+hair
+blue
+eyes
+and
+a
+happy
+sunny
+disposition
+which
+I
+had
+She
+also
+found
+that
+five
+years
+after
+birth
+this
+person
+had
+Saturn
+Uranus
+and
+Mars
+in
+Taurus
+the
+sign
+that
+rules
+the
+throat
+which
+indicated
+death
+at
+that
+time
+from
+throat
+disease
+I
+had
+died
+from
+diphtheria
+This
+proved
+to
+Mrs
+Wickland
+that
+it
+was
+not
+her
+subconscious
+mind
+speaking
+for
+she
+was
+much
+older
+than
+I
+and
+she
+also
+learned
+that
+what
+I
+had
+said
+previously
+was
+true
+Everyone
+in
+earth
+life
+is
+guided
+by
+a
+spirit
+But
+sometimes
+an
+earthbound
+spirit
+steps
+in
+and
+takes
+control
+and
+then
+there
+is
+obsession
+or
+possession
+Mortals
+live
+in
+the
+slum
+of
+earthbound
+spirits
+Few
+realize
+what
+is
+on
+the
+other
+side
+How
+many
+try
+to
+learn
+where
+they
+will
+go
+after
+they
+pass
+out
+The
+majority
+after
+leaving
+the
+body
+remain
+for
+some
+time
+just
+where
+they
+have
+been
+during
+earth
+life
+It
+makes
+no
+difference
+whether
+they
+are
+intelligent
+or
+ignorant
+if
+they
+have
+no
+knowledge
+of
+the
+other
+side
+they
+stay
+just
+where
+they
+have
+passed
+out
+Many
+are
+in
+a
+heavy
+sleep
+or
+in
+a
+coma
+state
+following
+the
+use
+of
+narcotics
+and
+will
+remain
+so
+for
+some
+time
+unless
+some
+relative
+or
+friend
+in
+the
+spirit
+world
+finds
+them
+and
+wakens
+them
+or
+someone
+from
+either
+side
+sends
+a
+messenger
+by
+thought
+waves
+to
+rouse
+them
+Some
+have
+hypnotized
+themselves
+into
+a
+coma
+condition
+by
+a
+religious
+belief
+that
+they
+will
+stay
+in
+the
+grave
+until
+the
+Last
+Day
+or
+by
+thinking
+that
+death
+is
+the
+end
+There
+are
+many
+with
+various
+religious
+beliefs
+who
+do
+not
+know
+they
+are
+dead
+they
+go
+about
+preaching
+and
+singing
+because
+they
+have
+not
+found
+Jesus
+and
+they
+gather
+around
+the
+churches
+on
+earth
+and
+continue
+to
+sing
+and
+pray
+There
+may
+be
+persons
+in
+the
+churches
+who
+are
+sensitives
+or
+of
+nervous
+temperament
+some
+of
+the
+spirits
+take
+control
+of
+them
+and
+pray
+and
+sing
+until
+those
+persons
+are
+called
+insane
+and
+sent
+to
+asylums
+Other
+spirits
+exert
+a
+bad
+influence
+on
+humanity
+They
+may
+want
+revenge
+and
+they
+hypnotize
+or
+obsess
+sensitive
+persons
+and
+influence
+them
+to
+commit
+murder
+or
+suicide
+Often
+a
+murderer
+knows
+nothing
+about
+the
+crime
+of
+which
+he
+is
+accused
+for
+the
+deed
+was
+done
+by
+a
+revengeful
+spirit
+What
+right
+have
+the
+wise
+men
+of
+earth
+such
+as
+the
+judges
+and
+lawyers
+to
+condemn
+that
+person
+and
+take
+his
+life
+The
+person
+who
+is
+executed
+goes
+out
+of
+earth
+life
+filled
+with
+hatred
+and
+comes
+back
+for
+revenge
+impressing
+others
+to
+kill
+or
+commit
+suicide
+The
+judges
+and
+lawyers
+should
+ascertain
+whether
+the
+accused
+person
+is
+actually
+guilty
+or
+influenced
+by
+some
+revengeful
+spirit
+who
+has
+acted
+through
+him
+Jesus
+said
+He
+that
+is
+without
+sin
+among
+you
+let
+him
+first
+cast
+a
+stone
+Instead
+of
+condemning
+criminals
+the
+judges
+the
+lawyers
+and
+the
+ministers
+should
+teach
+them
+teach
+them
+higher
+truths
+and
+bring
+out
+their
+better
+nature
+If
+those
+in
+prison
+knew
+that
+when
+they
+are
+released
+people
+would
+help
+them
+and
+give
+them
+a
+chance
+they
+would
+be
+greatly
+encouraged
+to
+do
+better
+Many
+call
+themselves
+Christians
+but
+will
+not
+help
+those
+in
+need
+as
+Christ
+would
+have
+done
+When
+an
+employer
+learns
+that
+a
+man
+has
+been
+in
+prison
+he
+will
+not
+have
+anything
+to
+do
+with
+him
+The
+man
+cannot
+get
+work
+Where
+can
+he
+go
+Nowhere
+but
+back
+to
+crime
+When
+we
+go
+to
+the
+lowest
+sphere
+to
+help
+we
+try
+to
+reach
+the
+better
+nature
+of
+men
+and
+women
+We
+give
+them
+object
+lessons
+and
+when
+their
+love
+and
+sympathy
+are
+won
+they
+become
+true
+friends
+no
+matter
+how
+low
+they
+have
+been
+When
+those
+who
+have
+lived
+only
+for
+self
+and
+for
+enjoyment
+reach
+the
+spirit
+side
+of
+life
+they
+have
+to
+serve
+others
+Serving
+is
+progression
+in
+the
+spirit
+world
+Because
+of
+their
+simplicity
+of
+life
+and
+religion
+and
+their
+knowledge
+of
+the
+laws
+of
+Nature
+the
+American
+Indians
+are
+seldom
+bound
+in
+spirit
+after
+leaving
+the
+earth
+plane
+and
+are
+often
+sent
+as
+was
+Silver
+Star
+Mrs
+Wickland
+s
+Indian
+guide
+to
+guard
+sensitive
+mortals
+EXPERIENCE
+MARCH
+Spirit
+SILVER
+STAR
+Psychic
+MRS
+WICKLAND
+Mediums
+so
+often
+have
+Indians
+as
+controls
+guides
+and
+helpers
+because
+Indians
+have
+no
+beliefs
+or
+dogmas
+to
+overcome
+when
+they
+pass
+to
+the
+spirit
+world
+From
+early
+infancy
+they
+are
+taught
+regarding
+The
+Great
+Spirit
+and
+The
+Happy
+Hunting
+Ground
+They
+believe
+in
+The
+Great
+Spirit
+of
+all
+Things
+and
+the
+Medicine
+Man
+has
+taught
+them
+how
+to
+control
+Nature
+We
+Indians
+are
+sent
+to
+earth
+to
+guard
+mortals
+because
+we
+know
+the
+law
+of
+protection
+and
+so
+we
+are
+often
+the
+doorkeepers
+to
+protect
+mediums
+from
+earthbound
+spirits
+The
+pale
+faces
+die
+from
+all
+kinds
+of
+diseases
+but
+the
+Indians
+do
+not
+There
+is
+little
+sickness
+among
+the
+Indians
+they
+live
+in
+Nature
+and
+they
+die
+a
+natural
+death
+So
+when
+they
+come
+back
+to
+control
+they
+bring
+an
+influence
+of
+strength
+and
+health
+Indian
+spirits
+seldom
+obsess
+people
+they
+do
+not
+make
+people
+crazy
+because
+they
+know
+the
+laws
+governing
+the
+control
+of
+a
+mortal
+I
+am
+a
+Chippewa
+Indian
+and
+was
+born
+near
+Shell
+Lake
+in
+on
+an
+Indian
+Reservation
+in
+Northern
+Wisconsin
+I
+was
+four
+and
+a
+half
+years
+old
+when
+I
+was
+hurt
+on
+the
+head
+by
+a
+fall
+and
+passed
+to
+the
+spirit
+side
+of
+life
+and
+when
+Mrs
+Wickland
+cast
+a
+horoscope
+for
+me
+she
+found
+that
+death
+resulting
+from
+an
+injury
+was
+shown
+I
+came
+to
+Mrs
+Wickland
+in
+at
+Eau
+Claire
+Wisconsin
+I
+am
+the
+Doorkeeper
+When
+I
+first
+controlled
+Mrs
+Wickland
+I
+could
+only
+talk
+the
+Chippewa
+language
+and
+what
+English
+I
+know
+I
+have
+learned
+while
+being
+in
+control
+of
+Mrs
+Wickland
+Different
+persons
+in
+the
+circles
+have
+taught
+me
+English
+Some
+people
+think
+Indians
+do
+not
+know
+anything
+because
+they
+have
+not
+had
+much
+schooling
+but
+they
+have
+true
+love
+for
+The
+Great
+Spirit
+and
+a
+true
+love
+for
+helping
+others
+Of
+course
+there
+are
+evil
+Indians
+as
+well
+as
+good
+Indians
+but
+the
+bad
+ones
+are
+only
+those
+who
+have
+no
+understanding
+of
+The
+Great
+Spirit
+and
+most
+of
+their
+bad
+habits
+are
+acquired
+from
+the
+pale
+faces
+Before
+the
+pale
+faces
+came
+to
+America
+there
+was
+no
+fear
+among
+the
+Indians
+The
+Indians
+of
+different
+tribes
+fought
+with
+each
+other
+but
+were
+fearless
+Then
+the
+pale
+faces
+came
+and
+hunted
+them
+down
+like
+animals
+Fear
+and
+anger
+crept
+into
+the
+hearts
+of
+the
+Indians
+and
+then
+came
+trouble
+and
+war
+Many
+pale
+faces
+wanted
+Indian
+land
+and
+some
+stole
+the
+land
+from
+the
+Indians
+and
+then
+the
+Indians
+got
+angry
+and
+fought
+They
+thought
+all
+the
+pale
+faces
+were
+the
+same
+and
+then
+came
+trouble
+If
+the
+pale
+faces
+had
+treated
+the
+Indians
+kindly
+in
+the
+beginning
+they
+would
+never
+have
+had
+wars
+with
+them
+Treat
+an
+Indian
+with
+kindness
+and
+he
+will
+do
+much
+for
+you
+The
+Medicine
+Men
+are
+those
+who
+study
+Nature
+s
+forces
+and
+have
+power
+over
+them
+and
+the
+Indians
+are
+often
+able
+to
+make
+rain
+When
+they
+pray
+they
+use
+the
+higher
+forces
+of
+life
+They
+do
+not
+do
+what
+the
+pale
+faces
+often
+do
+pray
+with
+the
+mouth
+and
+only
+talk
+They
+say
+little
+but
+dance
+around
+in
+a
+big
+circle
+and
+concentrate
+Sometimes
+they
+have
+a
+Snake
+Dance
+They
+have
+learned
+to
+charm
+snakes
+so
+they
+will
+not
+bite
+because
+the
+Indians
+have
+no
+fear
+If
+the
+pale
+faces
+would
+overcome
+fear
+they
+could
+do
+wonderful
+things
+In
+olden
+times
+the
+pale
+faces
+had
+no
+fear
+but
+they
+were
+scared
+by
+the
+stories
+of
+hell
+and
+the
+devil
+and
+this
+fear
+grew
+so
+that
+the
+people
+lost
+control
+of
+Nature
+s
+finer
+forces
+There
+are
+no
+religions
+in
+the
+spirit
+world
+all
+are
+brothers
+and
+sisters
+in
+Truth
+All
+are
+alike
+in
+the
+Higher
+Life
+after
+they
+have
+an
+understanding
+of
+The
+Great
+Spirit
+Another
+one
+of
+Mrs
+Wickland
+s
+guiding
+spirits
+is
+Movilia
+an
+Esquimo
+who
+brings
+strength
+and
+power
+to
+the
+circle
+He
+lived
+in
+Greenland
+and
+was
+a
+traveling
+lecturer
+doctor
+and
+entertainer
+a
+Medicine
+Man
+of
+high
+order
+with
+a
+profound
+knowledge
+of
+Nature
+He
+journeyed
+among
+his
+people
+as
+an
+organizer
+and
+a
+philosopher
+accompanied
+by
+his
+wife
+a
+poetess
+and
+singer
+and
+his
+children
+who
+danced
+symbolical
+dances
+Some
+of
+the
+Esquimo
+songs
+when
+given
+through
+Mrs
+Wickland
+by
+Movilia
+and
+his
+wife
+have
+been
+recognized
+by
+an
+Alaskan
+traveler
+as
+being
+a
+part
+of
+certain
+Esquimo
+ceremonies
+These
+Esquimos
+do
+not
+speak
+English
+but
+one
+evening
+Movilia
+brought
+another
+Esquimo
+who
+acted
+as
+interpreter
+for
+him
+and
+told
+us
+something
+of
+the
+Esquimo
+religion
+EXPERIENCE
+MAY
+Spirit
+ESOVILIA
+CHEVILIA
+speaking
+for
+MOVILIA
+AND
+WIFE
+Psychic
+MRS
+WICKLAND
+My
+name
+is
+Esovilia
+Chevilia
+Esquimo
+and
+the
+ones
+for
+whom
+I
+talk
+are
+Movilia
+and
+his
+wife
+We
+believe
+in
+the
+Great
+Spirit
+of
+Love
+Wisdom
+and
+Knowledge
+and
+that
+we
+are
+a
+part
+of
+that
+Great
+Spirit
+and
+that
+when
+we
+pray
+from
+our
+hearts
+we
+shall
+receive
+what
+we
+ask
+for
+The
+Medicine
+Man
+is
+the
+one
+who
+knows
+the
+Secret
+of
+the
+Universe
+the
+Secret
+of
+Love
+the
+Secret
+of
+Knowledge
+and
+the
+Secret
+of
+Wisdom
+and
+Truth
+It
+is
+in
+that
+Spirit
+we
+live
+and
+each
+tries
+to
+do
+the
+best
+he
+knows
+how
+Sometimes
+there
+comes
+a
+missionary
+who
+thinks
+we
+are
+not
+Christians
+and
+that
+we
+do
+not
+live
+right
+and
+does
+not
+think
+we
+love
+God
+as
+they
+call
+The
+Great
+Spirit
+We
+love
+the
+Great
+Spirit
+of
+Love
+the
+Great
+Spirit
+of
+Truth
+The
+Great
+Spirit
+and
+we
+worship
+Him
+We
+do
+not
+believe
+we
+know
+We
+know
+the
+truth
+and
+we
+know
+that
+we
+are
+a
+part
+of
+that
+Divine
+Spirit
+that
+is
+within
+us
+and
+when
+we
+are
+in
+contact
+with
+that
+Great
+Spirit
+of
+Truth
+we
+have
+much
+in
+our
+hearts
+We
+can
+understand
+His
+meaning
+of
+Life
+His
+meaning
+of
+Love
+for
+His
+children
+here
+on
+earth
+Some
+of
+the
+missionaries
+who
+come
+to
+us
+say
+that
+Christ
+died
+for
+our
+sins
+Dear
+friends
+we
+do
+not
+have
+sins
+for
+Christ
+to
+die
+for
+for
+God
+is
+Love
+and
+Power
+He
+is
+Wisdom
+Knowledge
+and
+Truth
+We
+are
+a
+part
+of
+that
+wonderful
+Being
+When
+we
+are
+a
+part
+of
+that
+wonderful
+spirit
+how
+could
+we
+be
+full
+of
+sin
+We
+could
+not
+fall
+away
+from
+Him
+because
+we
+are
+a
+part
+of
+Him
+we
+live
+in
+Him
+and
+are
+a
+part
+of
+Him
+We
+could
+not
+get
+away
+from
+Him
+because
+He
+is
+every
+where
+He
+is
+the
+whole
+Universe
+the
+whole
+Love
+the
+whole
+Life
+of
+everything
+How
+can
+anyone
+think
+we
+could
+believe
+in
+such
+a
+doctrine
+that
+He
+the
+Great
+Spirit
+that
+knows
+everything
+is
+everywhere
+and
+knows
+the
+past
+present
+and
+future
+could
+in
+all
+His
+power
+and
+greatness
+let
+us
+go
+down
+and
+down
+and
+fall
+in
+sin
+How
+could
+He
+The
+missionary
+says
+we
+must
+be
+born
+in
+His
+image
+and
+must
+believe
+in
+Him
+that
+He
+died
+for
+our
+sins
+and
+if
+we
+believe
+that
+we
+will
+go
+to
+Heaven
+when
+we
+die
+We
+pray
+to
+the
+wonderful
+Spirit
+that
+you
+call
+God
+You
+have
+dogmas
+and
+dogmas
+and
+creeds
+and
+beliefs
+We
+put
+ourselves
+in
+rapport
+with
+that
+Great
+Spirit
+and
+we
+believe
+in
+His
+power
+We
+try
+to
+get
+the
+power
+from
+the
+Great
+Spirit
+for
+healing
+and
+for
+other
+purposes
+We
+have
+Hope
+in
+that
+power
+we
+have
+Wisdom
+in
+that
+power
+The
+Christians
+believe
+and
+believe
+that
+they
+fall
+in
+sin
+and
+that
+somebody
+must
+raise
+them
+up
+If
+you
+step
+outside
+of
+the
+Law
+you
+know
+what
+will
+happen
+If
+you
+put
+your
+hand
+in
+the
+fire
+you
+know
+you
+have
+broken
+the
+Law
+and
+must
+suffer
+If
+you
+have
+the
+belief
+that
+you
+have
+fallen
+in
+sin
+you
+have
+transgressed
+the
+Law
+and
+you
+will
+suffer
+We
+must
+find
+the
+Great
+Spirit
+within
+not
+look
+outside
+Find
+ourselves
+and
+we
+will
+find
+Him
+for
+we
+are
+a
+part
+of
+that
+wonderful
+Mind
+that
+wonderful
+Power
+Let
+us
+all
+try
+to
+get
+in
+rapport
+with
+Him
+in
+His
+wonderful
+wonderful
+glory
+When
+you
+are
+in
+rapport
+with
+the
+Great
+Spirit
+you
+will
+feel
+happy
+You
+have
+then
+learned
+your
+lesson
+and
+will
+go
+on
+your
+way
+and
+not
+overstep
+the
+Law
+You
+will
+get
+out
+of
+your
+ignorance
+You
+travel
+on
+the
+pathway
+of
+Life
+if
+you
+walk
+out
+of
+the
+pathway
+you
+may
+remain
+as
+long
+as
+you
+wish
+but
+you
+must
+finally
+get
+back
+on
+the
+road
+again
+What
+made
+you
+go
+from
+the
+pathway
+You
+overstepped
+the
+law
+of
+Nature
+You
+finally
+get
+so
+weary
+of
+breaking
+the
+laws
+of
+Nature
+that
+you
+will
+ask
+What
+am
+I
+here
+for
+and
+where
+am
+I
+going
+Then
+you
+will
+find
+you
+are
+a
+Truth
+Seeker
+you
+will
+knock
+and
+the
+door
+will
+be
+opened
+You
+will
+look
+within
+instead
+of
+as
+before
+without
+You
+have
+been
+living
+in
+the
+material
+with
+all
+its
+dogmas
+here
+one
+here
+another
+And
+then
+there
+is
+so
+much
+condemning
+You
+are
+all
+Christians
+and
+yet
+you
+condemn
+and
+fight
+and
+fight
+each
+other
+and
+you
+have
+so
+much
+turmoil
+This
+condition
+will
+continue
+until
+you
+ask
+yourself
+What
+is
+it
+all
+about
+Then
+you
+will
+try
+to
+find
+out
+When
+you
+seek
+for
+things
+from
+your
+heart
+you
+will
+find
+Ask
+God
+to
+reveal
+Himself
+to
+you
+Ask
+God
+to
+manifest
+Himself
+in
+your
+heart
+before
+you
+leave
+the
+broad
+road
+of
+Experience
+for
+the
+narrow
+road
+of
+Reason
+When
+you
+get
+on
+the
+narrow
+road
+you
+will
+feel
+happy
+and
+contented
+and
+you
+come
+into
+the
+Glory
+of
+the
+Infinite
+There
+all
+is
+beautiful
+There
+is
+no
+selfishness
+The
+narrow
+road
+is
+only
+for
+Love
+Kindness
+Knowledge
+and
+Wisdom
+of
+God
+The
+Christians
+look
+for
+God
+outside
+we
+look
+for
+God
+within
+ourselves
+Within
+ourselves
+we
+look
+for
+the
+Great
+Spirit
+We
+do
+not
+have
+so
+many
+creeds
+and
+dogmas
+and
+so
+many
+religious
+speculations
+We
+do
+not
+have
+to
+speculate
+for
+we
+know
+One
+gets
+the
+truth
+one
+way
+one
+another
+and
+so
+they
+go
+all
+divided
+nothing
+definite
+People
+must
+change
+for
+they
+have
+had
+enough
+of
+dogmas
+Let
+them
+get
+more
+of
+the
+Wisdom
+of
+God
+on
+the
+narrow
+road
+of
+Reason
+and
+find
+themselves
+When
+they
+have
+found
+themselves
+they
+will
+have
+no
+sorrow
+and
+no
+unhappiness
+because
+they
+will
+be
+happy
+with
+the
+Love
+of
+God
+When
+they
+love
+God
+they
+will
+love
+others
+for
+they
+cannot
+keep
+it
+to
+themselves
+You
+want
+your
+friends
+to
+love
+God
+with
+you
+You
+want
+them
+to
+see
+the
+glory
+of
+God
+We
+never
+saw
+such
+a
+thing
+as
+you
+Christians
+call
+The
+Devil
+we
+call
+it
+Selfishness
+and
+Ignorance
+Find
+yourself
+now
+If
+you
+do
+not
+you
+will
+have
+to
+stop
+here
+there
+and
+everywhere
+When
+you
+have
+that
+beautiful
+knowledge
+all
+is
+happiness
+You
+must
+experience
+this
+feeling
+within
+yourself
+before
+you
+can
+teach
+it
+to
+others
+This
+is
+the
+Religion
+of
+the
+Esquimos
+I
+was
+a
+Medicine
+Man
+on
+earth
+and
+I
+was
+also
+a
+teacher
+Esquimo
+Movilia
+was
+the
+one
+that
+came
+to
+me
+and
+wanted
+me
+to
+say
+to
+you
+what
+he
+wishes
+to
+say
+I
+have
+only
+repeated
+what
+he
+told
+me
+to
+say
+We
+have
+no
+wars
+We
+try
+to
+live
+as
+near
+Nature
+and
+the
+Great
+Spirit
+as
+we
+can
+We
+are
+not
+a
+pretty
+people
+and
+we
+do
+not
+have
+so
+much
+changing
+as
+you
+do
+in
+dress
+We
+have
+our
+beauty
+within
+us
+Prettiness
+is
+only
+skin
+deep
+so
+we
+do
+not
+care
+The
+Christian
+has
+to
+be
+awakened
+through
+suffering
+and
+trouble
+Then
+you
+begin
+to
+look
+for
+what
+is
+called
+the
+truth
+You
+think
+that
+Jesus
+died
+for
+your
+sins
+He
+could
+not
+and
+He
+did
+not
+The
+sins
+that
+are
+committed
+now
+are
+many
+more
+than
+when
+He
+was
+on
+earth
+Many
+things
+have
+been
+discovered
+that
+were
+not
+known
+then
+so
+how
+could
+he
+die
+for
+something
+that
+was
+not
+known
+I
+think
+that
+is
+very
+strange
+God
+made
+us
+and
+He
+knew
+When
+you
+find
+God
+within
+yourself
+you
+cannot
+do
+wrong
+You
+sing
+and
+are
+happy
+and
+happiness
+is
+something
+we
+all
+want
+We
+had
+one
+man
+come
+to
+us
+and
+preach
+He
+took
+away
+with
+him
+one
+of
+the
+best
+men
+we
+had
+and
+tried
+to
+bring
+him
+up
+with
+your
+Christians
+He
+returned
+to
+us
+a
+ruined
+man
+full
+of
+diseases
+We
+do
+not
+have
+such
+diseases
+because
+we
+live
+up
+to
+the
+highest
+laws
+of
+Nature
+He
+came
+back
+and
+told
+us
+how
+you
+who
+call
+yourselves
+Christians
+live
+We
+all
+felt
+so
+horrified
+to
+know
+that
+the
+Christians
+were
+so
+diseased
+in
+mind
+and
+body
+That
+is
+what
+the
+Christians
+did
+for
+our
+fellow
+Esquimo
+So
+I
+felt
+that
+I
+wanted
+to
+come
+and
+tell
+you
+of
+our
+religion
+Let
+all
+in
+this
+little
+circle
+find
+themselves
+and
+God
+because
+you
+and
+God
+are
+one
+Here
+is
+a
+big
+light
+say
+a
+candle
+which
+stands
+in
+the
+center
+Around
+it
+are
+smaller
+candles
+but
+they
+are
+all
+a
+part
+of
+the
+same
+material
+as
+the
+larger
+candle
+You
+take
+the
+smaller
+candles
+and
+light
+them
+from
+the
+big
+one
+then
+you
+have
+the
+spark
+of
+Life
+Can
+you
+then
+understand
+what
+is
+meant
+by
+being
+a
+spark
+of
+God
+When
+you
+die
+as
+the
+Christians
+call
+it
+you
+only
+blow
+out
+the
+candle
+The
+tallow
+has
+gone
+back
+to
+the
+elements
+Find
+God
+within
+you
+then
+you
+have
+Power
+Strength
+and
+Love
+and
+are
+learning
+to
+get
+Wisdom
+Then
+you
+have
+learned
+to
+get
+strength
+and
+conquer
+material
+to
+conquer
+sorrow
+and
+sickness
+You
+cannot
+be
+sick
+for
+you
+have
+the
+light
+of
+understanding
+and
+the
+more
+understanding
+you
+have
+the
+more
+strength
+you
+have
+All
+of
+you
+here
+are
+a
+part
+of
+that
+Universal
+Light
+and
+you
+must
+all
+have
+that
+light
+from
+the
+candle
+Do
+not
+worship
+the
+candle
+but
+worship
+the
+Light
+of
+Understanding
+and
+God
+Do
+not
+let
+anyone
+come
+in
+your
+way
+and
+make
+you
+think
+you
+cannot
+reach
+God
+The
+Christians
+do
+not
+truly
+understand
+God
+They
+must
+have
+somebody
+to
+talk
+for
+them
+their
+Savior
+as
+they
+call
+him
+They
+worship
+Christ
+Christ
+is
+Truth
+and
+when
+you
+find
+Truth
+that
+is
+Christ
+Worship
+God
+When
+you
+understand
+how
+to
+worship
+God
+you
+will
+have
+strength
+and
+power
+and
+success
+will
+be
+yours
+We
+say
+Find
+God
+within
+your
+heart
+and
+all
+else
+will
+come
+to
+YOU
+We
+do
+not
+believe
+we
+know
+Have
+the
+true
+knowledge
+of
+God
+in
+your
+heart
+and
+you
+will
+be
+happy
+Good
+Night
+From
+the
+time
+Mrs
+Wickland
+first
+developed
+as
+a
+psychic
+she
+has
+been
+especially
+under
+the
+protection
+of
+the
+spirit
+Dr
+Root
+who
+has
+fostered
+this
+obsession
+work
+and
+urged
+us
+to
+bring
+it
+before
+the
+public
+He
+has
+come
+often
+to
+speak
+with
+encouragement
+and
+to
+lecture
+to
+invisible
+as
+well
+as
+visible
+audiences
+on
+the
+higher
+philosophy
+of
+life
+EXPERIENCE
+DECEMBER
+spirit
+DR
+Root
+PSYCHIC
+MRS
+WICKLAND
+As
+we
+are
+gathered
+together
+in
+this
+little
+hall
+I
+wish
+you
+could
+open
+your
+psychic
+eyes
+to
+see
+the
+many
+spirits
+who
+have
+come
+here
+for
+an
+understanding
+of
+the
+life
+hereafter
+There
+has
+never
+been
+real
+happiness
+on
+earth
+and
+there
+will
+not
+be
+so
+long
+as
+people
+are
+kept
+in
+ignorance
+of
+the
+truth
+of
+religion
+In
+all
+times
+there
+have
+been
+many
+different
+kinds
+of
+religion
+and
+always
+there
+has
+been
+selfishness
+You
+now
+live
+in
+the
+Twentieth
+Century
+and
+since
+this
+is
+an
+enlightened
+age
+why
+should
+not
+people
+be
+more
+intelligent
+and
+know
+more
+about
+the
+world
+here
+and
+the
+world
+beyond
+People
+worship
+the
+Golden
+Calf
+more
+than
+they
+worship
+God
+The
+churches
+are
+falling
+to
+pieces
+because
+they
+cannot
+make
+people
+believe
+as
+they
+used
+to
+in
+olden
+times
+People
+now
+want
+knowledge
+not
+belief
+and
+if
+the
+churches
+would
+teach
+true
+religion
+people
+would
+be
+better
+Many
+ministers
+know
+in
+their
+hearts
+that
+people
+do
+not
+believe
+the
+old
+stories
+It
+is
+the
+Golden
+Calf
+again
+they
+worship
+money
+and
+they
+stand
+in
+the
+pulpit
+and
+talk
+against
+their
+better
+nature
+Some
+day
+this
+world
+will
+conquer
+selfishness
+but
+I
+am
+sorry
+to
+say
+that
+at
+present
+most
+of
+the
+people
+are
+insane
+regarding
+money
+making
+They
+seem
+not
+to
+be
+able
+to
+get
+money
+enough
+There
+is
+little
+honor
+only
+money
+money
+There
+is
+little
+sympathy
+all
+want
+only
+what
+they
+can
+get
+from
+others
+through
+money
+making
+schemes
+In
+time
+this
+money
+scheme
+will
+fall
+to
+pieces
+We
+should
+study
+the
+other
+side
+of
+life
+as
+well
+as
+this
+when
+we
+are
+on
+earth
+If
+you
+want
+to
+become
+a
+minister
+doctor
+lawyer
+or
+lecturer
+you
+have
+to
+study
+to
+acquire
+knowledge
+Why
+should
+we
+not
+study
+ourselves
+It
+is
+very
+important
+that
+All
+on
+earth
+should
+know
+where
+they
+are
+going
+after
+passing
+out
+of
+the
+physical
+for
+they
+will
+then
+go
+to
+the
+right
+place
+and
+will
+not
+stay
+in
+the
+homes
+they
+have
+left
+Without
+this
+knowledge
+many
+do
+not
+realize
+they
+are
+dead
+and
+they
+remain
+in
+their
+earthly
+homes
+Some
+one
+of
+the
+family
+may
+be
+sensitive
+and
+may
+become
+obsessed
+Then
+the
+doctors
+will
+declare
+that
+person
+insane
+and
+send
+him
+to
+the
+asylum
+for
+there
+is
+no
+pity
+for
+one
+who
+is
+controlled
+by
+earthbound
+spirits
+People
+should
+be
+taught
+the
+truth
+then
+when
+they
+pass
+out
+they
+will
+look
+for
+the
+spirit
+world
+and
+a
+happy
+place
+beyond
+instead
+of
+a
+fictitious
+Heaven
+Heaven
+or
+hell
+is
+only
+a
+condition
+within
+yourself
+and
+Heaven
+must
+be
+found
+within
+before
+you
+can
+be
+happy
+in
+the
+spirit
+world
+Some
+say
+What
+is
+the
+spirit
+world
+The
+spirit
+world
+is
+a
+counterpart
+of
+this
+with
+only
+one
+exception
+here
+you
+are
+thrown
+together
+with
+every
+sort
+of
+person
+while
+there
+you
+cannot
+go
+anywhere
+unless
+you
+have
+understanding
+of
+where
+you
+are
+going
+The
+spirit
+side
+of
+life
+is
+like
+a
+school
+you
+progress
+by
+degrees
+There
+is
+no
+belief
+You
+learn
+where
+you
+belong
+and
+where
+you
+are
+going
+It
+takes
+time
+to
+understand
+but
+there
+is
+plenty
+of
+time
+in
+eternity
+to
+study
+and
+learn
+The
+time
+is
+not
+far
+distant
+when
+people
+will
+open
+their
+eyes
+and
+see
+and
+the
+churches
+will
+have
+circles
+and
+try
+to
+understand
+life
+This
+is
+Dr
+Root
+I
+wish
+you
+all
+happiness
+and
+success
+in
+your
+work
+Good
+Night
+EXPERIENCE
+MARCH
+Spirit
+DR
+ROOT
+Psychic
+MRS
+WICKLAND
+I
+am
+glad
+I
+can
+be
+with
+you
+tonight
+to
+tell
+you
+of
+the
+beautiful
+conditions
+we
+have
+on
+the
+spirit
+side
+The
+greater
+number
+think
+that
+when
+death
+comes
+they
+will
+go
+to
+a
+certain
+place
+and
+stay
+there
+until
+the
+last
+of
+this
+earth
+The
+Last
+Day
+is
+every
+day
+that
+you
+throw
+away
+selfishness
+and
+ignorance
+That
+is
+Death
+Life
+is
+Love
+and
+Wisdom
+Let
+us
+die
+daily
+to
+our
+ignorance
+and
+selfishness
+Let
+us
+awaken
+to
+the
+truth
+and
+an
+understanding
+of
+God
+who
+has
+given
+us
+that
+truth
+and
+who
+has
+sent
+forth
+His
+messengers
+to
+tell
+us
+what
+life
+is
+on
+the
+other
+side
+It
+is
+a
+life
+which
+is
+more
+spiritual
+more
+congenial
+and
+more
+beautiful
+in
+every
+respect
+than
+the
+one
+on
+earth
+When
+you
+have
+Truth
+in
+your
+heart
+you
+are
+happy
+When
+you
+have
+selfishness
+and
+ignorance
+in
+your
+heart
+you
+are
+sorrowful
+Sorrow
+will
+follow
+you
+until
+you
+say
+Not
+my
+will
+but
+Thine
+When
+others
+come
+in
+your
+way
+and
+try
+to
+keep
+you
+down
+rise
+and
+say
+No
+I
+will
+be
+firm
+and
+I
+will
+conquer
+and
+then
+you
+can
+create
+happiness
+and
+contentment
+in
+your
+soul
+and
+you
+will
+have
+happiness
+around
+you
+When
+you
+think
+only
+of
+selfishness
+and
+creeds
+you
+have
+sadness
+and
+sorrow
+and
+you
+will
+have
+to
+burn
+these
+out
+by
+suffering
+and
+say
+Not
+my
+will
+any
+longer
+but
+Thy
+will
+Let
+us
+pray
+to
+God
+because
+He
+is
+All
+in
+All
+He
+is
+with
+you
+all
+We
+could
+not
+live
+one
+minute
+without
+that
+wonderful
+power
+Do
+not
+let
+us
+pray
+to
+anyone
+else
+because
+God
+is
+within
+ourselves
+You
+do
+not
+need
+to
+go
+anywhere
+except
+your
+own
+heart
+to
+pray
+to
+Him
+Have
+communion
+with
+God
+in
+your
+heart
+and
+you
+do
+not
+need
+to
+take
+communion
+outside
+When
+you
+have
+learned
+the
+truth
+then
+communion
+is
+within
+you
+You
+do
+not
+need
+to
+be
+reminded
+to
+take
+communion
+with
+God
+because
+you
+know
+He
+is
+there
+to
+help
+you
+You
+have
+opened
+your
+heart
+to
+God
+and
+He
+has
+heard
+you
+and
+you
+can
+then
+commune
+with
+Him
+Communion
+is
+not
+understood
+as
+it
+should
+be
+You
+take
+communion
+It
+is
+only
+a
+reminder
+that
+you
+should
+be
+united
+with
+God
+When
+you
+have
+learned
+and
+have
+progressed
+higher
+and
+higher
+you
+do
+not
+need
+a
+physical
+reminder
+because
+you
+understand
+When
+you
+have
+communion
+with
+God
+you
+do
+not
+need
+bread
+and
+wine
+You
+cannot
+go
+anywhere
+without
+God
+God
+is
+in
+the
+air
+He
+is
+everywhere
+You
+cannot
+walk
+on
+the
+earth
+without
+stepping
+on
+His
+creation
+and
+you
+should
+try
+to
+understand
+His
+work
+There
+has
+been
+so
+much
+theorizing
+One
+has
+one
+theory
+someone
+else
+another
+One
+goes
+into
+this
+corner
+another
+into
+that
+corner
+and
+one
+says
+this
+is
+the
+proper
+way
+and
+the
+other
+says
+that
+is
+the
+proper
+way
+one
+has
+one
+creed
+and
+one
+has
+another
+They
+go
+around
+in
+a
+little
+circle
+and
+forget
+they
+are
+in
+the
+midst
+of
+life
+of
+God
+Himself
+When
+you
+do
+a
+kind
+act
+to
+another
+you
+do
+it
+unto
+God
+because
+he
+is
+one
+part
+of
+God
+and
+you
+another
+We
+only
+serve
+God
+when
+we
+serve
+others
+Live
+to
+serve
+and
+do
+all
+you
+can
+for
+others
+then
+you
+will
+progress
+in
+understanding
+To
+go
+to
+church
+to
+serve
+God
+is
+only
+to
+remind
+you
+of
+what
+you
+should
+actually
+do
+Act
+and
+do
+good
+to
+those
+who
+are
+in
+trouble
+Why
+should
+you
+go
+to
+any
+place
+to
+worship
+Enter
+into
+thy
+closet
+and
+pray
+to
+thy
+Father
+which
+is
+in
+secret
+Pray
+earnestly
+and
+your
+prayers
+will
+be
+heard
+Do
+not
+pray
+idly
+but
+pray
+earnestly
+Live
+so
+that
+people
+will
+know
+you
+have
+done
+your
+duty
+in
+life
+On
+the
+spirit
+side
+we
+find
+it
+is
+difficult
+to
+open
+the
+spiritual
+eyes
+of
+many
+They
+are
+all
+so
+blinded
+by
+creeds
+and
+dogmas
+that
+we
+have
+to
+do
+all
+within
+our
+power
+to
+help
+them
+understand
+that
+God
+did
+not
+make
+dogmas
+and
+creeds
+but
+that
+God
+made
+the
+Universe
+and
+the
+people
+in
+it
+should
+worship
+Him
+alone
+without
+any
+creed
+or
+dogma
+When
+we
+understand
+and
+realize
+love
+not
+what
+people
+call
+love
+here
+but
+the
+love
+which
+springs
+out
+everywhere
+then
+love
+is
+like
+the
+sun
+When
+there
+is
+love
+in
+your
+heart
+you
+are
+like
+a
+sun
+to
+others
+You
+have
+found
+God
+in
+your
+heart
+and
+this
+shines
+forth
+just
+as
+the
+sun
+shines
+on
+all
+Those
+who
+have
+only
+creed
+dogma
+and
+selfishness
+and
+are
+ignorant
+feel
+gloomy
+they
+have
+a
+fear
+of
+God
+a
+fear
+of
+everything
+around
+them
+They
+have
+not
+opened
+their
+souls
+eyes
+to
+ask
+for
+the
+light
+for
+understanding
+of
+God
+These
+come
+to
+the
+spirit
+side
+of
+life
+in
+darkness
+and
+gather
+together
+one
+group
+here
+another
+there
+all
+in
+deep
+gloom
+They
+pray
+and
+sing
+and
+moan
+from
+morning
+until
+night
+year
+after
+year
+It
+is
+very
+difficult
+to
+make
+them
+understand
+that
+they
+have
+passed
+to
+the
+spirit
+side
+of
+life
+very
+hard
+for
+them
+to
+wake
+up
+and
+see
+the
+mistake
+they
+made
+in
+accepting
+dogmas
+and
+creeds
+They
+have
+clothed
+themselves
+with
+gloom
+and
+have
+shut
+out
+the
+light
+that
+should
+have
+been
+shining
+throughout
+their
+lives
+If
+you
+love
+God
+in
+the
+sense
+I
+have
+spoken
+of
+then
+you
+will
+be
+happy
+This
+is
+Dr
+Root
+Good
+Night
+Another
+extract
+is
+taken
+from
+a
+lecture
+recently
+given
+by
+Dr
+Root
+to
+a
+gathering
+of
+earthbound
+spirits
+as
+well
+as
+to
+our
+circle
+EXPERIENCE
+JANUARY
+Spirit
+DR
+ROOT
+Psychic
+MRS
+WICKLAND
+Let
+us
+concentrate
+for
+happiness
+and
+contentment
+for
+the
+betterment
+of
+the
+world
+Let
+us
+never
+look
+backward
+but
+forward
+Let
+us
+all
+try
+to
+do
+the
+best
+we
+can
+and
+help
+others
+If
+little
+groups
+such
+as
+this
+one
+would
+concentrate
+in
+an
+effort
+to
+cheer
+the
+world
+the
+world
+would
+be
+better
+This
+little
+light
+of
+concentration
+does
+not
+seem
+much
+but
+it
+will
+do
+much
+good
+for
+the
+ones
+in
+darkness
+and
+those
+in
+trouble
+If
+all
+the
+churches
+would
+have
+concentration
+circles
+to
+help
+the
+people
+and
+would
+give
+them
+cheer
+and
+courage
+and
+try
+to
+help
+them
+into
+a
+brighter
+condition
+instead
+of
+condemning
+them
+and
+telling
+them
+they
+are
+lost
+forever
+if
+they
+do
+not
+believe
+a
+certain
+doctrine
+the
+world
+would
+be
+much
+happier
+and
+better
+You
+must
+find
+yourselves
+within
+before
+you
+can
+find
+yourselves
+without
+You
+must
+be
+born
+again
+not
+in
+Jesus
+Christ
+no
+you
+must
+realize
+your
+own
+self
+and
+that
+you
+are
+a
+part
+of
+God
+God
+gave
+you
+light
+and
+understanding
+Go
+out
+and
+help
+the
+people
+in
+trouble
+and
+those
+who
+have
+not
+awakened
+to
+an
+understanding
+of
+God
+Do
+not
+merely
+believe
+in
+God
+but
+find
+Him
+within
+yourselves
+then
+you
+will
+not
+need
+belief
+Belief
+and
+faith
+are
+only
+the
+key
+If
+you
+have
+the
+key
+in
+your
+hand
+and
+do
+not
+know
+where
+it
+belongs
+do
+not
+know
+which
+door
+it
+opens
+if
+you
+have
+only
+faith
+and
+belief
+and
+nothing
+more
+you
+only
+hold
+the
+key
+but
+do
+not
+use
+it
+Seek
+for
+knowledge
+until
+you
+can
+open
+the
+door
+of
+Wisdom
+and
+Understanding
+Most
+people
+have
+the
+key
+but
+they
+only
+hold
+it
+in
+their
+hands
+and
+do
+not
+use
+it
+They
+say
+If
+I
+believe
+in
+God
+and
+Jesus
+Christ
+I
+will
+be
+saved
+When
+the
+time
+comes
+for
+them
+to
+pass
+to
+the
+spirit
+side
+of
+life
+they
+merely
+hold
+that
+key
+they
+have
+only
+belief
+and
+they
+find
+themselves
+in
+darkness
+because
+they
+have
+not
+used
+the
+key
+of
+understanding
+that
+God
+gave
+them
+with
+which
+to
+investigate
+and
+find
+God
+within
+themselves
+You
+do
+not
+need
+to
+go
+anywhere
+you
+must
+open
+the
+door
+of
+your
+own
+heart
+Find
+God
+and
+find
+that
+you
+are
+a
+part
+of
+that
+wonderful
+power
+When
+you
+open
+the
+door
+you
+have
+power
+and
+strength
+and
+health
+you
+have
+everything
+and
+the
+strength
+of
+God
+s
+power
+will
+flow
+in
+and
+you
+will
+do
+wonderful
+things
+Christ
+was
+a
+great
+teacher
+but
+do
+people
+carry
+out
+His
+teachings
+They
+believe
+but
+they
+do
+not
+do
+what
+he
+told
+them
+Each
+one
+is
+a
+part
+of
+God
+and
+when
+you
+do
+what
+you
+can
+for
+others
+you
+love
+God
+and
+worship
+Him
+by
+so
+doing
+The
+people
+and
+the
+churches
+should
+unite
+as
+one
+power
+and
+help
+each
+other
+and
+try
+to
+conquer
+selfishness
+Spread
+the
+truth
+find
+God
+within
+yourself
+and
+open
+your
+heart
+to
+Him
+through
+understanding
+You
+have
+power
+so
+far
+as
+your
+mind
+has
+developed
+If
+you
+try
+to
+develop
+for
+more
+power
+you
+will
+have
+it
+Widen
+out
+and
+try
+to
+know
+God
+s
+wonderful
+mystery
+in
+the
+world
+Let
+us
+find
+God
+in
+Nature
+everywhere
+Look
+at
+a
+snowflake
+it
+is
+wonderful
+It
+has
+many
+beautiful
+designs
+Who
+made
+it
+It
+is
+so
+natural
+that
+people
+do
+not
+realize
+its
+beauty
+They
+say
+It
+is
+just
+snow
+When
+individuals
+step
+out
+of
+the
+physical
+the
+worst
+hindrance
+they
+have
+is
+desire
+which
+must
+be
+overcome
+Creeds
+and
+dogmas
+hold
+them
+down
+they
+are
+not
+free
+They
+are
+as
+Jesus
+said
+bond
+servants
+and
+will
+be
+held
+down
+They
+think
+when
+they
+pass
+to
+the
+spirit
+side
+of
+life
+they
+will
+go
+to
+Heaven
+Stop
+to
+think
+where
+is
+Heaven
+Christ
+said
+the
+kingdom
+of
+Heaven
+is
+within
+you
+if
+God
+dwells
+there
+The
+majority
+believe
+that
+what
+you
+call
+death
+is
+a
+long
+sleep
+and
+many
+who
+have
+not
+learned
+the
+lesson
+of
+life
+go
+to
+sleep
+Some
+will
+sleep
+for
+years
+because
+they
+are
+self
+hypnotized
+They
+think
+I
+am
+dying
+and
+I
+will
+go
+to
+the
+grave
+and
+stay
+there
+until
+the
+Last
+Day
+and
+then
+will
+be
+awakened
+Others
+pass
+to
+the
+spirit
+side
+of
+life
+believing
+in
+certain
+creeds
+and
+dogmas
+They
+go
+to
+certain
+places
+in
+the
+earth
+sphere
+where
+they
+sing
+and
+pray
+and
+do
+not
+progress
+any
+further
+They
+go
+over
+and
+over
+the
+same
+things
+It
+is
+only
+mouth
+prayers
+they
+offer
+Sometimes
+they
+remain
+in
+that
+sphere
+for
+years
+Sometimes
+they
+go
+about
+in
+the
+earth
+sphere
+and
+try
+to
+convert
+people
+They
+attach
+themselves
+to
+some
+mortal
+and
+that
+mortal
+will
+be
+called
+insane
+on
+religion
+What
+is
+done
+then
+The
+victims
+are
+sent
+to
+the
+insane
+asylum
+and
+left
+there
+for
+the
+rest
+of
+their
+lives
+They
+will
+not
+be
+free
+from
+the
+obsessing
+spirits
+until
+the
+body
+dies
+Then
+those
+spirits
+often
+attach
+themselves
+to
+other
+mortals
+Let
+us
+understand
+the
+truth
+Let
+us
+do
+what
+we
+can
+to
+help
+ourselves
+and
+others
+to
+an
+understanding
+of
+God
+Worship
+Him
+everywhere
+Let
+us
+look
+at
+the
+sky
+and
+see
+the
+beautiful
+planets
+and
+stars
+If
+this
+earth
+disappeared
+tomorrow
+the
+suns
+and
+stars
+in
+the
+heavens
+would
+be
+just
+the
+same
+This
+earth
+would
+not
+be
+missed
+Do
+you
+think
+God
+sits
+on
+this
+earth
+and
+controls
+nothing
+more
+No
+let
+us
+think
+and
+understand
+and
+study
+Let
+us
+all
+worship
+God
+in
+His
+whole
+Universe
+There
+is
+Life
+everywhere
+The
+grandeur
+of
+the
+heavens
+cannot
+be
+described
+the
+wonderful
+stars
+in
+the
+heavens
+the
+planets
+and
+all
+the
+Universe
+Look
+through
+the
+microscope
+and
+you
+will
+find
+you
+are
+in
+another
+world
+You
+will
+see
+germs
+one
+or
+two
+of
+which
+will
+kill
+a
+big
+body
+They
+are
+all
+under
+one
+power
+God
+Some
+say
+Why
+did
+God
+make
+all
+these
+germs
+to
+torment
+humanity
+They
+must
+be
+in
+order
+to
+have
+you
+realize
+and
+think
+and
+overcome
+When
+you
+have
+trouble
+and
+try
+to
+overcome
+you
+become
+strong
+A
+child
+that
+is
+protected
+constantly
+by
+its
+parents
+and
+sent
+into
+the
+country
+grows
+up
+in
+a
+fine
+atmosphere
+He
+is
+good
+because
+he
+has
+had
+no
+temptation
+But
+he
+has
+no
+knowledge
+that
+he
+is
+good
+A
+boy
+from
+the
+slums
+who
+has
+had
+trouble
+will
+more
+readily
+develop
+into
+a
+man
+who
+can
+conquer
+than
+the
+one
+who
+has
+been
+protected
+He
+will
+be
+strong
+and
+able
+to
+help
+others
+Let
+us
+find
+ourselves
+Let
+us
+all
+concentrate
+and
+try
+to
+help
+and
+give
+light
+to
+every
+one
+we
+find
+needing
+help
+Worship
+God
+in
+His
+true
+sense
+and
+not
+in
+a
+little
+narrow
+belief
+Let
+us
+add
+knowledge
+to
+our
+faith
+You
+are
+the
+bond
+servants
+that
+Christ
+speaks
+of
+He
+was
+a
+wonderful
+teacher
+but
+you
+believe
+in
+His
+blood
+and
+not
+in
+his
+teachings
+Who
+killed
+Christ
+The
+very
+ones
+that
+belonged
+to
+the
+church
+They
+did
+not
+believe
+in
+Him
+Christ
+is
+an
+allegory
+He
+is
+the
+Truth
+Christ
+is
+born
+within
+you
+when
+you
+have
+attained
+understanding
+Then
+you
+will
+see
+and
+know
+and
+realize
+God
+When
+you
+pass
+to
+the
+spirit
+side
+of
+life
+you
+will
+have
+knowledge
+and
+you
+will
+go
+into
+a
+world
+that
+is
+far
+more
+beautiful
+than
+this
+You
+can
+then
+reach
+the
+spirit
+world
+You
+do
+not
+need
+to
+call
+it
+spirit
+world
+some
+object
+to
+that
+name
+Every
+one
+is
+a
+spiritual
+being
+You
+may
+call
+it
+the
+Higher
+Sphere
+you
+may
+call
+it
+Heaven
+but
+Heaven
+is
+not
+a
+place
+If
+you
+think
+you
+are
+going
+to
+Heaven
+you
+will
+have
+to
+take
+it
+with
+you
+because
+it
+is
+a
+condition
+When
+you
+have
+suffering
+you
+are
+in
+hell
+and
+many
+have
+a
+hard
+struggle
+to
+get
+out
+of
+that
+hell
+When
+you
+are
+happy
+you
+are
+in
+Heaven
+the
+Heaven
+within
+yourself
+You
+have
+trouble
+and
+sickness
+but
+everything
+is
+to
+help
+you
+learn
+to
+find
+yourself
+When
+you
+have
+found
+yourself
+within
+yourself
+you
+can
+conquer
+all
+conditions
+from
+without
+You
+say
+I
+am
+very
+sick
+You
+attract
+those
+forces
+unto
+you
+and
+after
+a
+while
+your
+own
+mind
+has
+created
+your
+condition
+You
+are
+a
+part
+of
+God
+the
+wonderful
+Creator
+What
+you
+think
+you
+create
+You
+have
+power
+and
+you
+can
+use
+it
+for
+good
+or
+evil
+If
+you
+have
+trouble
+disease
+or
+suffering
+and
+have
+not
+learned
+to
+throw
+it
+off
+you
+hold
+it
+to
+yourself
+Then
+you
+become
+sensitive
+and
+after
+a
+time
+you
+draw
+influences
+around
+you
+and
+these
+in
+turn
+throw
+disease
+and
+bad
+thoughts
+on
+you
+and
+you
+are
+bound
+First
+find
+God
+within
+yourself
+then
+you
+will
+have
+power
+to
+rise
+Trouble
+sorrow
+sickness
+obsession
+everything
+can
+be
+conquered
+after
+you
+find
+the
+truth
+Christ
+is
+born
+in
+you
+and
+you
+can
+conquer
+When
+you
+have
+found
+Christ
+within
+yourself
+you
+will
+still
+have
+struggles
+Others
+will
+say
+Do
+this
+or
+this
+and
+you
+will
+be
+wise
+Some
+will
+say
+Overcome
+the
+world
+overcome
+There
+will
+be
+a
+cross
+because
+there
+is
+a
+tempter
+You
+have
+found
+yourself
+but
+the
+tempter
+speaks
+to
+you
+Do
+this
+Come
+with
+me
+and
+I
+will
+show
+you
+the
+world
+and
+happiness
+Here
+is
+the
+cross
+which
+shows
+Christ
+is
+born
+within
+you
+Jesus
+the
+Son
+of
+Man
+must
+be
+crucified
+on
+the
+cross
+of
+matter
+that
+Christ
+enlightenment
+may
+live
+When
+you
+have
+reached
+that
+stage
+you
+see
+everything
+as
+good
+You
+cannot
+see
+bad
+When
+you
+look
+back
+you
+see
+that
+what
+you
+thought
+bad
+only
+taught
+you
+to
+understand
+God
+Should
+you
+condemn
+it
+No
+If
+you
+had
+not
+had
+that
+experience
+you
+would
+not
+be
+where
+you
+are
+now
+You
+must
+teach
+others
+and
+help
+them
+to
+rise
+with
+you
+If
+every
+one
+would
+do
+that
+the
+world
+would
+be
+happier
+Let
+us
+send
+out
+thoughts
+that
+all
+may
+conquer
+and
+that
+they
+may
+understand
+You
+should
+strive
+to
+gain
+knowledge
+of
+God
+s
+finer
+forces
+Find
+yourself
+and
+you
+will
+find
+God
+Before
+I
+go
+I
+want
+to
+say
+that
+we
+have
+a
+room
+full
+of
+earthbound
+spirits
+I
+often
+talk
+to
+them
+to
+help
+them
+This
+group
+we
+have
+here
+tonight
+are
+spirits
+we
+could
+not
+waken
+because
+they
+could
+not
+see
+us
+A
+spirit
+in
+ignorance
+cannot
+see
+an
+intelligent
+spirit
+So
+we
+have
+to
+bring
+them
+here
+I
+talk
+through
+this
+body
+and
+they
+hear
+me
+but
+they
+could
+not
+hear
+me
+from
+the
+spirit
+side
+of
+life
+because
+they
+had
+no
+understanding
+Every
+time
+you
+have
+circles
+here
+we
+have
+more
+spirits
+present
+than
+we
+have
+mortals
+When
+they
+see
+an
+earthbound
+spirit
+control
+they
+learn
+their
+first
+lesson
+and
+then
+we
+can
+take
+them
+to
+the
+spirit
+side
+of
+life
+and
+help
+them
+find
+happiness
+We
+are
+never
+idle
+in
+the
+spirit
+world
+Mind
+cannot
+stand
+still
+God
+s
+wonderful
+thoughts
+go
+on
+Planets
+do
+not
+stand
+still
+All
+is
+development
+Mind
+is
+never
+inactive
+so
+long
+as
+one
+tries
+to
+develop
+This
+is
+Dr
+Root
+Good
+Night
+For
+many
+years
+upon
+various
+occasions
+a
+symbolical
+morality
+play
+has
+been
+given
+through
+Mrs
+Wickland
+by
+a
+group
+of
+spirit
+actors
+They
+are
+twelve
+in
+number
+eleven
+actors
+and
+a
+director
+all
+of
+whom
+were
+Russian
+Slavonic
+when
+in
+earth
+life
+Under
+the
+direction
+of
+the
+stage
+manager
+they
+successively
+assume
+control
+of
+Mrs
+Wickland
+with
+such
+ease
+and
+rapidity
+that
+the
+change
+is
+scarcely
+noticeable
+The
+play
+is
+given
+in
+the
+Russian
+Slavonic
+tongue
+a
+language
+which
+Mrs
+Wickland
+herself
+has
+never
+heard
+but
+which
+is
+spoken
+perfectly
+through
+her
+by
+these
+actors
+as
+has
+been
+stated
+by
+different
+persons
+witnessing
+the
+play
+who
+are
+familiar
+with
+the
+language
+The
+costumes
+worn
+by
+the
+spirit
+actors
+and
+unseen
+by
+the
+average
+mortal
+audience
+have
+been
+described
+by
+clairvoyants
+as
+being
+authentically
+Russian
+Slavonic
+and
+very
+beautiful
+These
+actors
+with
+one
+of
+Mrs
+Wickland
+s
+guides
+as
+interpreter
+have
+given
+the
+following
+account
+of
+The
+Morality
+Play
+and
+its
+purpose
+We
+are
+twelve
+actors
+controlling
+this
+psychic
+sensitive
+in
+order
+to
+prove
+spirit
+return
+and
+spirit
+control
+and
+that
+we
+can
+act
+as
+we
+acted
+while
+in
+the
+body
+We
+come
+to
+help
+people
+understand
+that
+we
+are
+still
+living
+that
+we
+are
+not
+dead
+but
+are
+just
+as
+active
+as
+we
+were
+when
+in
+earth
+life
+We
+give
+this
+play
+in
+the
+spirit
+world
+for
+the
+earthbound
+spirits
+many
+of
+whom
+do
+not
+realize
+they
+are
+dead
+to
+their
+earth
+life
+We
+find
+them
+in
+the
+sphere
+next
+to
+the
+earth
+often
+in
+a
+semi
+sleep
+Preceding
+the
+play
+we
+have
+music
+by
+excellent
+musicians
+this
+wakens
+the
+earthbound
+spirits
+one
+after
+the
+other
+They
+rise
+slowly
+not
+realizing
+where
+they
+are
+but
+the
+music
+brings
+them
+a
+little
+understanding
+of
+the
+higher
+life
+We
+then
+play
+our
+drama
+as
+a
+lesson
+to
+these
+spirits
+Each
+character
+is
+symbolical
+showing
+that
+selfish
+trivial
+and
+debasing
+attributes
+must
+be
+overcome
+before
+spirits
+can
+progress
+The
+leading
+lady
+represents
+Love
+the
+leading
+man
+her
+lover
+personifies
+Truth
+The
+ruffian
+typifies
+Selfishness
+the
+elderly
+maiden
+lady
+depicts
+Frivolity
+the
+officer
+represents
+Justice
+and
+the
+Judge
+Wisdom
+The
+witnesses
+in
+the
+court
+trial
+portray
+Knowledge
+Drunkenness
+Misery
+Sickness
+Miserliness
+and
+Robbery
+Love
+the
+young
+maiden
+cherishes
+a
+true
+deep
+affection
+for
+the
+hero
+she
+dwells
+in
+the
+same
+abode
+with
+Frivolity
+who
+entertains
+an
+unrequited
+love
+sentiment
+for
+Selfishness
+Here
+is
+shown
+the
+close
+association
+in
+life
+of
+the
+True
+and
+False
+Truth
+enters
+and
+proposes
+to
+Love
+who
+accepts
+him
+he
+then
+departs
+and
+is
+followed
+by
+Selfishness
+who
+desires
+Love
+for
+himself
+When
+his
+advances
+are
+rejected
+Frivolity
+with
+her
+most
+fascinating
+coquetries
+endeavors
+to
+charm
+the
+Ruffian
+Selfishness
+from
+Love
+to
+herself
+This
+angers
+him
+and
+he
+threatens
+her
+with
+death
+then
+leaves
+in
+a
+rage
+swearing
+to
+kill
+his
+rival
+Truth
+Love
+writes
+a
+frantic
+note
+of
+warning
+to
+her
+lover
+and
+hastily
+sends
+her
+servant
+to
+deliver
+the
+message
+but
+the
+servant
+arrives
+too
+late
+for
+Selfishness
+has
+attacked
+Truth
+by
+the
+wayside
+and
+fatally
+wounded
+him
+in
+a
+sword
+duel
+Truth
+dies
+a
+lingering
+death
+representing
+the
+murder
+of
+man
+s
+higher
+nature
+by
+selfishness
+The
+servant
+hurries
+back
+to
+his
+mistress
+with
+the
+news
+of
+the
+death
+of
+her
+lover
+She
+rushes
+to
+the
+place
+of
+the
+attack
+and
+finding
+Truth
+dead
+falls
+on
+her
+knees
+beside
+him
+With
+a
+prayer
+she
+draws
+her
+dagger
+and
+stabbing
+herself
+dies
+When
+Selfishness
+sees
+that
+Love
+as
+well
+as
+Truth
+is
+dead
+he
+becomes
+infuriated
+declares
+there
+is
+no
+God
+and
+swears
+that
+he
+will
+have
+fullest
+revenge
+An
+officer
+Justice
+arrives
+and
+handcuffing
+the
+murderer
+takes
+him
+into
+custody
+after
+which
+follows
+the
+funeral
+of
+the
+lovers
+Justice
+brings
+selfishness
+before
+the
+Judge
+Wisdom
+and
+at
+the
+trial
+the
+witnesses
+Knowledge
+Drunkenness
+Misery
+Sickness
+Miserliness
+and
+Robbery
+all
+testify
+that
+had
+it
+not
+been
+for
+Selfishness
+Love
+and
+Truth
+had
+not
+died
+Wisdom
+then
+banishes
+Selfishness
+from
+the
+land
+During
+a
+psychic
+circle
+held
+at
+our
+Institute
+in
+May
+at
+which
+Sir
+Arthur
+Conan
+Doyle
+and
+Lady
+Doyle
+were
+present
+this
+play
+was
+given
+and
+later
+in
+his
+book
+Our
+Second
+American
+Adventure
+Sir
+Arthur
+briefly
+described
+the
+play
+commenting
+further
+It
+was
+certainly
+a
+most
+extraordinary
+performance
+and
+left
+us
+all
+in
+a
+state
+of
+amazed
+admiration
+I
+have
+seen
+all
+the
+greatest
+actresses
+of
+my
+generation
+Modjeska
+Bernhardt
+Duse
+Terry
+but
+I
+do
+not
+think
+that
+any
+one
+of
+them
+could
+have
+played
+these
+eleven
+parts
+without
+a
+stage
+or
+a
+costume
+in
+so
+convincing
+a
+way
+The
+spirits
+own
+account
+is
+that
+they
+are
+a
+band
+of
+players
+on
+the
+other
+side
+who
+represent
+this
+play
+before
+the
+undeveloped
+dead
+in
+order
+to
+teach
+them
+the
+moral
+and
+that
+they
+use
+the
+wonderful
+mediumship
+of
+Mrs
+Wickland
+in
+order
+to
+demonstrate
+their
+power
+to
+us
+mortals
+It
+was
+very
+impressive
+Recently
+these
+invisible
+performers
+have
+presented
+through
+Mrs
+Wickland
+another
+drama
+The
+Soul
+s
+Passion
+Play
+symbolical
+of
+the
+development
+of
+the
+soul
+In
+The
+Morality
+Play
+Selfishness
+kills
+Truth
+and
+causes
+the
+death
+of
+Love
+while
+in
+The
+Soul
+s
+Passion
+Play
+Truth
+and
+Love
+conquer
+Selfishness
+The
+Soul
+s
+Passion
+Play
+represents
+the
+contest
+of
+the
+Soul
+with
+opposing
+principles
+and
+symbolizes
+the
+victory
+of
+Truth
+and
+Love
+over
+Selfishness
+through
+Understanding
+and
+the
+attainment
+of
+Bliss
+Dwelling
+in
+the
+Home
+of
+Happiness
+with
+Obedience
+as
+the
+servant
+are
+Kindness
+and
+Friendship
+father
+and
+mother
+of
+the
+maiden
+Love
+Truth
+a
+young
+man
+admires
+Love
+while
+Selfishness
+another
+maiden
+who
+is
+found
+in
+the
+same
+society
+with
+Love
+but
+whose
+father
+and
+mother
+are
+Hatred
+and
+Envy
+living
+in
+the
+Home
+of
+Unhappiness
+boldly
+attempts
+to
+attract
+the
+young
+man
+to
+herself
+Truth
+finally
+wins
+Love
+and
+they
+are
+united
+in
+marriage
+after
+having
+sent
+Selfishness
+away
+from
+the
+Home
+of
+Happiness
+Selfishness
+overcome
+by
+jealousy
+and
+humiliation
+goes
+to
+seek
+some
+means
+of
+revenge
+in
+the
+slums
+where
+in
+the
+Home
+of
+Misery
+lives
+the
+villain
+Revenge
+with
+his
+father
+and
+mother
+Temptation
+and
+Evil
+Together
+as
+time
+goes
+on
+they
+plot
+that
+Selfishness
+shall
+return
+to
+the
+Home
+of
+Happiness
+and
+pretending
+repentance
+wait
+for
+an
+opportunity
+to
+steal
+the
+child
+Victory
+which
+has
+been
+born
+to
+Love
+and
+Truth
+The
+child
+is
+to
+be
+given
+to
+Evil
+who
+will
+bring
+him
+up
+in
+squalor
+and
+sordidness
+forcing
+him
+to
+commit
+crimes
+and
+finally
+become
+imprisoned
+Selfishness
+will
+then
+go
+to
+Love
+and
+Truth
+tell
+them
+of
+the
+disgrace
+of
+Victory
+and
+with
+Revenge
+gloat
+over
+the
+ruin
+of
+the
+Home
+of
+Happiness
+Selfishness
+succeeds
+in
+stealing
+Victory
+who
+for
+some
+years
+is
+cruelly
+mistreated
+by
+Evil
+and
+Temptation
+but
+is
+at
+last
+discovered
+by
+his
+parents
+and
+taken
+away
+from
+the
+Home
+of
+Misery
+Enraged
+at
+her
+defeat
+Selfishness
+becomes
+insane
+through
+anger
+and
+dies
+a
+violent
+death
+Truth
+and
+Love
+bring
+Victory
+back
+into
+the
+Home
+of
+Happiness
+and
+there
+with
+Selfishness
+vanquished
+they
+dwell
+together
+in
+Bliss
+CHAPTER
+XVII
+Conclusion
+DEONSTRATIVE
+evidence
+clearly
+indicates
+that
+much
+which
+now
+seems
+mysterious
+can
+be
+brought
+to
+light
+by
+appropriate
+research
+The
+supernatural
+is
+only
+the
+natural
+not
+yet
+understood
+Psychical
+research
+should
+be
+placed
+on
+a
+scientific
+basis
+and
+made
+safe
+and
+sane
+by
+eliminating
+the
+dwellers
+on
+the
+threshold
+of
+the
+unseen
+who
+through
+deception
+and
+falsehood
+frequently
+pervert
+the
+truth
+which
+the
+enlightened
+spirit
+intelligences
+are
+constantly
+endeavoring
+to
+convey
+to
+humanity
+Advanced
+intelligences
+on
+the
+invisible
+side
+continually
+urge
+that
+broad
+minded
+investigators
+on
+the
+physical
+plane
+co
+operate
+with
+them
+in
+establishing
+research
+centers
+in
+asylums
+churches
+universities
+and
+other
+institutions
+It
+is
+imperative
+that
+psychical
+research
+should
+be
+in
+the
+hands
+of
+men
+of
+science
+men
+who
+are
+willing
+to
+set
+aside
+prejudice
+and
+with
+unbiased
+minds
+weigh
+the
+evidence
+and
+classify
+findings
+In
+the
+Chicago
+Daily
+Tribune
+March
+the
+late
+Dr
+I
+K
+Funk
+of
+New
+York
+urged
+that
+inquiry
+be
+made
+into
+cases
+of
+mental
+phenomena
+and
+after
+reviewing
+the
+work
+which
+we
+were
+carrying
+on
+in
+obsession
+concluded
+with
+an
+appeal
+to
+the
+press
+for
+further
+investigation
+Let
+us
+remember
+he
+said
+a
+single
+scientifically
+demonstrated
+fact
+of
+the
+existence
+of
+even
+an
+evil
+discarnate
+spirit
+will
+do
+more
+to
+prove
+the
+continuance
+of
+life
+after
+death
+than
+all
+the
+sermons
+on
+immortality
+that
+have
+been
+preached
+in
+the
+last
+ten
+years
+That
+single
+demonstration
+would
+be
+the
+death
+knell
+of
+materialism
+Genuine
+cases
+wherever
+occurring
+should
+be
+searched
+for
+by
+the
+press
+more
+than
+if
+they
+were
+lumps
+of
+gold
+and
+should
+be
+verified
+if
+possible
+to
+the
+minutest
+incident
+and
+given
+not
+jocosely
+but
+seriously
+to
+the
+world
+Why
+will
+not
+the
+press
+soberly
+take
+up
+this
+matter
+Rightly
+handled
+there
+is
+sensation
+in
+it
+worthy
+of
+the
+most
+royal
+purple
+journalism
+Gladstone
+was
+right
+when
+in
+his
+membership
+letter
+to
+the
+Society
+for
+Psychical
+Research
+he
+said
+that
+this
+work
+of
+investigation
+is
+the
+most
+important
+work
+which
+is
+being
+done
+in
+the
+world
+by
+far
+the
+most
+important
+Scientific
+bodies
+willing
+to
+thoroughly
+master
+and
+observe
+the
+governing
+laws
+could
+readily
+obtain
+evidence
+similar
+to
+that
+presented
+in
+this
+volume
+Especially
+could
+such
+evidence
+be
+obtained
+in
+Institutions
+for
+the
+Insane
+as
+most
+inmates
+of
+the
+same
+are
+potential
+psychics
+who
+could
+be
+developed
+into
+instruments
+for
+psychical
+research
+After
+having
+dislodged
+the
+ignorant
+obsessing
+spirits
+the
+psychic
+faculties
+of
+the
+sensitive
+could
+be
+developed
+by
+attracting
+intelligent
+spirits
+who
+are
+always
+willing
+to
+co
+operate
+from
+the
+invisible
+side
+and
+who
+will
+protect
+the
+instrument
+against
+untoward
+results
+Psychic
+research
+circles
+formed
+to
+learn
+the
+truth
+of
+life
+and
+spirit
+existence
+should
+be
+of
+inestimable
+value
+to
+churches
+for
+such
+investigation
+would
+prove
+positively
+the
+continued
+existence
+of
+the
+soul
+and
+convert
+mere
+faith
+and
+belief
+in
+a
+life
+hereafter
+into
+definite
+knowledge
+The
+practice
+of
+calling
+for
+specific
+or
+particular
+spirits
+should
+not
+be
+indulged
+in
+as
+this
+may
+lead
+to
+deception
+by
+mischievous
+spirits
+who
+may
+step
+in
+and
+attempt
+to
+impersonate
+the
+spirit
+called
+for
+It
+should
+be
+left
+to
+the
+guiding
+intelligences
+to
+bring
+whatever
+spirit
+is
+suitable
+for
+demonstration
+and
+interesting
+information
+will
+be
+given
+from
+time
+to
+time
+by
+the
+advanced
+spirits
+clearly
+showing
+the
+difference
+between
+intelligent
+and
+ignorant
+entities
+As
+a
+nucleus
+for
+more
+comprehensive
+investigation
+the
+National
+Psychological
+Institute
+was
+organized
+and
+incorporated
+in
+Los
+Angeles
+California
+for
+the
+purpose
+of
+placing
+these
+problems
+on
+a
+rational
+scientific
+basis
+This
+Institute
+a
+Spiritual
+Clearing
+House
+has
+no
+interest
+in
+cult
+or
+ism
+of
+any
+kind
+but
+is
+striving
+only
+to
+obtain
+data
+in
+the
+hope
+of
+encouraging
+other
+institutions
+to
+take
+up
+similar
+work
+as
+an
+enormous
+field
+for
+research
+has
+been
+opened
+by
+our
+experiences
+It
+is
+not
+presumed
+or
+held
+that
+this
+avenue
+of
+research
+is
+a
+panacea
+for
+or
+a
+full
+explanation
+of
+all
+mental
+aberrations
+or
+obscure
+mortal
+vagaries
+but
+indicative
+of
+the
+need
+for
+fuller
+knowledge
+of
+the
+role
+which
+the
+invisible
+world
+plays
+in
+human
+problems
+End
diff --git a/libstdc++-v3/testsuite/ext/pb_assoc/example/basic_map.cc b/libstdc++-v3/testsuite/ext/pb_assoc/example/basic_map.cc
deleted file mode 100644
index cf9c9962db0..00000000000
--- a/libstdc++-v3/testsuite/ext/pb_assoc/example/basic_map.cc
+++ /dev/null
@@ -1,122 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file basic_multimap_example.cpp
- * A basic example showing how to use maps.
- */
-
-// For various associative containers.
-#include <ext/pb_assoc/assoc_cntnr.hpp>
-// For cout, endl.
-#include <iostream>
-// For assert.
-#include <cassert>
-
-template<class Cntnr>
-void
-some_op_sequence(Cntnr c)
-{
-  assert(c.empty());
-  assert(c.size() == 0);
-
-  c.insert(std::make_pair(1, 'a'));
-
-  c[2] = 'b';
-
-  assert(!c.empty());
-  assert(c.size() == 2);
-
-  std::cout << "Key 1 is mapped to " << c[1] << std::endl;
-  std::cout << "Key 2 is mapped to " << c[2] << std::endl;
-
-  std::cout << std::endl << "All value types in the container:" << std::endl;
-  for (typename Cntnr::const_iterator it = c.begin(); it != c.end();
-       ++it)
-    std::cout << it->first << " -> " << it->second << std::endl;
-
-  std::cout << std::endl;
-
-  c.clear();
-
-  assert(c.empty());
-  assert(c.size() == 0);
-}
-
-int
-main()
-{
-  /*
-   * Perform operations on a collision-chaining hash set.
-   */
-  some_op_sequence(pb_assoc::cc_hash_assoc_cntnr<int, char>());
-
-  /*
-   * Perform operations on a general-probing hash set.
-   */
-  some_op_sequence(pb_assoc::gp_hash_assoc_cntnr<int, char>());
-
-  /*
-   * Perform operations on a red-black tree set.
-   */
-  some_op_sequence(pb_assoc::tree_assoc_cntnr<int, char>());
-
-  /*
-   * Perform operations on a splay tree set.
-   */
-  some_op_sequence(pb_assoc::tree_assoc_cntnr<
-		   int,
-		   char,
-		   std::less<int>,
-		   pb_assoc::splay_tree_ds_tag>());
-
-  /*
-   * Perform operations on a splay tree set.
-   */
-  some_op_sequence(pb_assoc::tree_assoc_cntnr<
-		   int,
-		   char,
-		   std::less<int>,
-		   pb_assoc::ov_tree_ds_tag>());
-
-  /*
-   * Perform operations on a list-update set.
-   */
-  some_op_sequence(pb_assoc::lu_assoc_cntnr<int, char>());
-}
diff --git a/libstdc++-v3/testsuite/ext/pb_assoc/example/basic_multimap.cc b/libstdc++-v3/testsuite/ext/pb_assoc/example/basic_multimap.cc
deleted file mode 100644
index 2ad028db31c..00000000000
--- a/libstdc++-v3/testsuite/ext/pb_assoc/example/basic_multimap.cc
+++ /dev/null
@@ -1,110 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file basic_multimap_example.cpp
- * A basic example showing how to use multimaps.
- */
-
-// For cout, endl
-#include <iostream>
-// For various associative containers.
-#include <ext/pb_assoc/assoc_cntnr.hpp>
-// For compound_data_type and null_data_type.
-#include <ext/pb_assoc/data_type.hpp>
-// For assert
-#include <cassert>
-
-template<class Cntnr>
-void
-some_op_sequence(Cntnr c)
-{
-  assert(c.empty());
-  assert(c.size() == 0);
-
-  c[1].insert('a');
-
-  c[2].insert('b');
-  c[2].insert('c');
-
-  assert(!c.empty());
-  assert(c.size() == 2);
-
-  std::cout << "Key 1 is mapped to " <<
-    static_cast<unsigned long>(c[1].size()) << " entries." << std::endl;
-
-  std::cout << "Key 2 is mapped to " <<
-    static_cast<unsigned long>(c[2].size()) << " entries." << std::endl;
-
-  std::cout << std::endl << "All values in the container:" << std::endl;
-
-  for (typename Cntnr::const_iterator it = c.begin(); it != c.end();
-       ++it)
-    {
-      std::cout << it->first << "->{ ";
-
-      for (typename Cntnr::data_type::const_iterator it_ = it->second.begin();
-	   it_  != it->second.end(); ++it_)
-	std::cout <<* it_ << " ";
-
-      std::cout << "}" << std::endl;
-    }
-
-  std::cout << std::endl;
-
-  c.clear();
-
-  assert(c.empty());
-  assert(c.size() == 0);
-}
-
-int
-main()
-{
-  /*
-   * Perform operations on a collision-chaining hash-table of of
-   *	red-black trees.
-   */
-  some_op_sequence(pb_assoc::cc_hash_assoc_cntnr<
-		   int,
-		   pb_assoc::compound_data_type<
-		   pb_assoc::tree_assoc_cntnr<
-		   char,
-		   pb_assoc::null_data_type> > >());
-}
diff --git a/libstdc++-v3/testsuite/ext/pb_assoc/example/basic_set.cc b/libstdc++-v3/testsuite/ext/pb_assoc/example/basic_set.cc
deleted file mode 100644
index 242ee7b8678..00000000000
--- a/libstdc++-v3/testsuite/ext/pb_assoc/example/basic_set.cc
+++ /dev/null
@@ -1,120 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file basic_set_example.cpp
- * A basic example showing how to use sets.
- */
-
-// For various associative containers.
-#include <ext/pb_assoc/assoc_cntnr.hpp>
-// For null_data_type
-#include <ext/pb_assoc/data_type.hpp>
-// For cout, endl
-#include <iostream>
-// For assert
-#include <cassert>
-
-template<class Cntnr>
-void
-some_op_sequence(Cntnr c)
-{
-  assert(c.empty());
-  assert(c.size() == 0);
-
-  c.insert(1);
-  c.insert(2);
-
-  assert(!c.empty());
-  assert(c.size() == 2);
-
-  std::cout << "All value types in the container:" << std::endl;
-  for (typename Cntnr::const_iterator it = c.begin(); it != c.end();
-       ++it)
-    std::cout <<* it << " ";
-
-  std::cout << std::endl;
-
-  c.clear();
-
-  assert(c.empty());
-  assert(c.size() == 0);
-}
-
-int
-main()
-{
-  /*
-   * Perform operations on a collision-chaining hash set.
-   */
-  some_op_sequence(pb_assoc::cc_hash_assoc_cntnr<int, pb_assoc::null_data_type>());
-
-  /*
-   * Perform operations on a general-probing hash set.
-   */
-  some_op_sequence(pb_assoc::gp_hash_assoc_cntnr<int, pb_assoc::null_data_type>());
-
-  /*
-   * Perform operations on a red-black tree set.
-   */
-  some_op_sequence(pb_assoc::tree_assoc_cntnr<int, pb_assoc::null_data_type>());
-
-  /*
-   * Perform operations on a splay tree set.
-   */
-  some_op_sequence(pb_assoc::tree_assoc_cntnr<
-		   int,
-		   pb_assoc::null_data_type,
-		   std::less<int>,
-		   pb_assoc::splay_tree_ds_tag>());
-
-  /*
-   * Perform operations on a splay tree set.
-   */
-  some_op_sequence(pb_assoc::tree_assoc_cntnr<
-		   int,
-		   pb_assoc::null_data_type,
-		   std::less<int>,
-		   pb_assoc::ov_tree_ds_tag>());
-
-  /*
-   * Perform operations on a list-update set.
-   */
-  some_op_sequence(pb_assoc::lu_assoc_cntnr<int, pb_assoc::null_data_type>());
-}
diff --git a/libstdc++-v3/testsuite/ext/pb_assoc/example/ds_traits.cc b/libstdc++-v3/testsuite/ext/pb_assoc/example/ds_traits.cc
deleted file mode 100644
index 45b4cae16b3..00000000000
--- a/libstdc++-v3/testsuite/ext/pb_assoc/example/ds_traits.cc
+++ /dev/null
@@ -1,262 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file ds_traits_example.cpp
- * A basic example showing how to use ds_traits for querying container types
- *	for their behavior.
- */
-
-// For various associative containers.
-#include <ext/pb_assoc/assoc_cntnr.hpp>
-// For ds_traits.
-#include <ext/pb_assoc/ds_trait.hpp>
-// For cout, endl.
-#include <iostream>
-
-template<class DS_Category>
-void
-print_ds_category(DS_Category);
-
-template<>
-void
-print_ds_category(pb_assoc::cc_hash_ds_tag)
-{
-  std::cout << "Collision-chaining hash based associative-container:" <<
-    std::endl;
-}
-
-template<>
-void
-print_ds_category(pb_assoc::gp_hash_ds_tag)
-{
-  std::cout << "Probing hash based associative-container:" <<
-    std::endl;
-}
-
-template<>
-void
-print_ds_category(pb_assoc::rb_tree_ds_tag)
-{
-  std::cout << "Red-black tree associative-container:" <<
-    std::endl;
-}
-
-template<>
-void
-print_ds_category(pb_assoc::splay_tree_ds_tag)
-{
-  std::cout << "Splay tree associative-container:" <<
-    std::endl;
-}
-
-template<>
-void
-print_ds_category(pb_assoc::ov_tree_ds_tag)
-{
-  std::cout << "Ordered-vector tree associative-container:" <<
-    std::endl;
-}
-
-template<>
-void
-print_ds_category(pb_assoc::lu_ds_tag)
-{
-  std::cout << "List-based associative-container:" <<
-    std::endl;
-}
-
-void
-print_erase_can_throw(bool can)
-{
-  if (can)
-    {
-      std::cout << "Erase can throw" << std::endl;
-
-      return;
-    }
-
-  std::cout << "Erase cannot throw" << std::endl;
-}
-
-void
-print_order_preserving(bool does)
-{
-  if (does)
-    {
-      std::cout << "Preserves order" << std::endl;
-
-      return;
-    }
-
-  std::cout << "Does not preserve order" << std::endl;
-}
-
-void
-print_erase_iterators(bool can)
-{
-  if (can)
-    {
-      std::cout << "Can erase iterators" << std::endl;
-
-      return;
-    }
-
-  std::cout << "Cannot erase iterators" << std::endl;
-}
-
-template<class Invalidation_Guarantee>
-void
-print_invalidation_guarantee(Invalidation_Guarantee);
-
-template<>
-void
-print_invalidation_guarantee(pb_assoc::basic_invalidation_guarantee)
-{
-  std::cout << "Guarantees only that found references, pointers, and "
-    "iterators are valid as long as the container object is not "
-    "modified" << std::endl;
-}
-
-template<>
-void
-print_invalidation_guarantee(pb_assoc::find_invalidation_guarantee)
-{
-  std::cout << "Guarantees that found references, pointers, and "
-    "find_iterators are valid even if the container object "
-    "is modified" << std::endl;
-}
-
-template<>
-void
-print_invalidation_guarantee(pb_assoc::range_invalidation_guarantee)
-{
-  std::cout << "Guarantees that iterators remain valid even if the "
-    "container object is modified" << std::endl;
-}
-
-void
-print_reverse_iteration(bool does)
-{
-  if (does)
-    {
-      std::cout << "Supports reverse iteration" << std::endl;
-
-      return;
-    }
-
-  std::cout << "Does not support reverse iteration" << std::endl;
-}
-
-void
-print_split_join(bool does)
-{
-  if (does)
-    {
-      std::cout << "Supports split and join" << std::endl;
-
-      return;
-    }
-
-  std::cout << "Does not support split and join" << std::endl;
-}
-
-template<class Cntnr>
-void
-print_container_attributes()
-{
-  // First print out the data-structure category.
-
-  print_ds_category(typename Cntnr::ds_category());
-
-  // Next is the data-structure traits class of the container.
-
-  typedef pb_assoc::ds_traits< Cntnr> traits;
-
-  // Now print the attributes of the container.
-
-  print_erase_can_throw(traits::erase_can_throw);
-
-  print_order_preserving(traits::order_preserving);
-
-  print_erase_iterators(traits::erase_iterators);
-
-  print_invalidation_guarantee(typename traits::invalidation_guarantee());
-
-  print_reverse_iteration(traits::reverse_iteration);
-
-  print_split_join(traits::split_join);
-
-  std::cout << std::endl << std::endl;
-}
-
-int
-main()
-{
-  print_container_attributes<pb_assoc::cc_hash_assoc_cntnr<int, char> >();
-
-  print_container_attributes<pb_assoc::gp_hash_assoc_cntnr<int, char> >();
-
-  print_container_attributes<pb_assoc::tree_assoc_cntnr<int, char> >();
-
-  print_container_attributes<pb_assoc::tree_assoc_cntnr<
-    int,
-    char,
-    std::less<int>,
-    pb_assoc::splay_tree_ds_tag> >();
-
-  print_container_attributes<pb_assoc::tree_assoc_cntnr<
-    int,
-    char,
-    std::less<int>,
-    pb_assoc::ov_tree_ds_tag> >();
-
-  print_container_attributes<pb_assoc::lu_assoc_cntnr<int, char> >();
-
-  typedef
-    pb_assoc::lu_assoc_cntnr<
-    int,
-    pb_assoc::compound_data_type<
-    pb_assoc::gp_hash_assoc_cntnr<
-    char,
-    pb_assoc::null_data_type> > >
-    mmap_t;
-
-  print_container_attributes<mmap_t>();
-}
diff --git a/libstdc++-v3/testsuite/ext/pb_assoc/example/erase_if.cc b/libstdc++-v3/testsuite/ext/pb_assoc/example/erase_if.cc
deleted file mode 100644
index 4bafbb93f9c..00000000000
--- a/libstdc++-v3/testsuite/ext/pb_assoc/example/erase_if.cc
+++ /dev/null
@@ -1,133 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file erase_if_example.cpp
- * A basic example showing how to use erase_if.
- */
-
-// For various associative containers.
-#include <ext/pb_assoc/assoc_cntnr.hpp>
-// For cout, endl.
-#include <iostream>
-// For assert.
-#include <cassert>
-
-struct between : public std::unary_function<
-  std::pair<const int, char>,
-		 bool>
-{
-  between(int b, int e) : m_b(b),
-			  m_e(e)
-  { }
-
-  inline bool
-  operator()(std::pair<const int, char>& r_val)
-  {
-    return (r_val.first >= m_b&&  r_val.first < m_e);
-  }
-
-private:
-  const int m_b;
-  const int m_e;
-};
-
-template<class Cntnr>
-void
-some_op_sequence(Cntnr c)
-{
-  assert(c.empty());
-  assert(c.size() == 0);
-
-  for (int i = 0; i < 100; ++i)
-    c.insert(std::make_pair(i, static_cast<char>(i)));
-
-  assert(c.size() == 100);
-
-  /* Erase all values whose key is between 10 (inclusive)
-   * and 90 (non-inclusive).
-   */
-  c.erase_if(between(10 , 90));
-
-  assert(!c.empty());
-  assert(c.size() == 20);
-}
-
-int
-main()
-{
-
-  /*
-   * Perform operations on a list-update set.
-   */
-  some_op_sequence(pb_assoc::lu_assoc_cntnr<int, char>());
-
-  /*
-   * Perform operations on a collision-chaining hash set.
-   */
-  some_op_sequence(pb_assoc::cc_hash_assoc_cntnr<int, char>());
-
-  /*
-   * Perform operations on a general-probing hash set.
-   */
-  some_op_sequence(pb_assoc::gp_hash_assoc_cntnr<int, char>());
-
-  /*
-   * Perform operations on a red-black tree set.
-   */
-  some_op_sequence(pb_assoc::tree_assoc_cntnr<int, char>());
-
-  /*
-   * Perform operations on a splay tree set.
-   */
-  some_op_sequence(pb_assoc::tree_assoc_cntnr<
-		   int,
-		   char,
-		   std::less<int>,
-		   pb_assoc::splay_tree_ds_tag>());
-
-  /*
-   * Perform operations on a splay tree set.
-   */
-  some_op_sequence(pb_assoc::tree_assoc_cntnr<
-		   int,
-		   char,
-		   std::less<int>,
-		   pb_assoc::ov_tree_ds_tag>());
-}
diff --git a/libstdc++-v3/testsuite/ext/pb_assoc/example/extract_key.cc b/libstdc++-v3/testsuite/ext/pb_assoc/example/extract_key.cc
deleted file mode 100644
index 9371a2c8905..00000000000
--- a/libstdc++-v3/testsuite/ext/pb_assoc/example/extract_key.cc
+++ /dev/null
@@ -1,132 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file extract_key_example.cpp
- * An example of extracting keys from values.
- */
-
-// For various associative containers
-#include <ext/pb_assoc/assoc_cntnr.hpp>
-// For binary_function
-#include <functional>
-// For assert
-#include <cassert>
-
-using namespace std;
-
-/*
- * A functor for checking whether two tables share exactly the
- *	same keys.
- */
-template<class Cntnr0, class Cntnr1>
-struct compare_keys : public std::binary_function<
-  Cntnr0,
-  Cntnr1,
-  bool>
-{
-  bool
-  operator()(const Cntnr0& r_c0, const Cntnr1& r_c1)
-  {
-    // If the tables' sizes differ, they cannot share the same keys.
-    if (r_c0.size() != r_c1.size())
-      return (false);
-
-    // Loop and check each key.
-    for (typename Cntnr0::const_iterator it = r_c0.begin();
-	 it != r_c0.end(); ++it)
-      if (r_c1.find(r_c0.extract_key(*it)) == r_c1.end())
-	return (false);
-
-    return (true);
-  };
-};
-
-template<class Cntnr0, class Cntnr1>
-bool
-key_equiv(const Cntnr0& r_c0, const Cntnr1& r_c1)
-{
-  return (compare_keys<Cntnr0, Cntnr1>()(r_c0, r_c1));
-}
-
-int
-main()
-{
-  /*
-   * A collision-chaining hash-based associative container
-   * 	mapping integers to characters.
-   */
-  pb_assoc::cc_hash_assoc_cntnr<int, char> c0;
-
-  /*
-   * A red-black tree-based associative container
-   * 	mapping integers to doubles.
-   */
-  pb_assoc::tree_assoc_cntnr<int, double> c1;
-
-  /*
-   * A list-update associative container storing integers.
-   */
-  pb_assoc::lu_assoc_cntnr<int, pb_assoc::null_data_type> c2;
-
-  /*
-   * Since the objects are initially empty, they
-   *	should all be equivalent.
-   **/
-
-  assert(key_equiv(c0, c0));
-  assert(key_equiv(c0, c1));
-  assert(key_equiv(c0, c2));
-
-  // Insert some entries.
-
-  c0.insert(std::make_pair(1, 'a'));
-
-  c1.insert(std::make_pair(1, 'a'));
-  c1.insert(std::make_pair(2, 'b'));
-
-  c2.insert(1);
-
-  // Only c0 and c2 contain a single key with value 1.
-
-  assert(key_equiv(c0, c0));
-  assert(key_equiv(c0, c1) == false);
-  assert(key_equiv(c0, c2));
-}
-
diff --git a/libstdc++-v3/testsuite/ext/pb_assoc/example/hash_find_neg.cc b/libstdc++-v3/testsuite/ext/pb_assoc/example/hash_find_neg.cc
deleted file mode 100644
index 596c96960a0..00000000000
--- a/libstdc++-v3/testsuite/ext/pb_assoc/example/hash_find_neg.cc
+++ /dev/null
@@ -1,73 +0,0 @@
-// { dg-do compile }
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file bad_find_example.cpp
- * A basic example showing how *not* to use unordered containers.
- */
-
-// For cc_hash_assoc_cntnr.
-#include <ext/pb_assoc/assoc_cntnr.hpp>
-// For pair.
-#include <utility>
-
-int
-main()
-{
-  /*
-   * A collision-chaining hash table mapping ints to chars.
-   */
-  typedef pb_assoc::cc_hash_assoc_cntnr< int, char> map_t;
-
-  // An map_t object.
-  map_t h;
-
-  // Insert a value mapping the int 1 to the char 'a'.
-  h.insert(std::make_pair(1, 'a'));
-
-  /*
-   * Find the entry of the key '1' the* wrong* way.
-   * The following line will not compile, since map_t::find
-   *	returns a find_iterator, which, by design, is not convertible
-   *	to map_t::iterator.
-   */
-  map_t::iterator it = h.find(1); // { dg-error "conversion from" }
-}
-
diff --git a/libstdc++-v3/testsuite/ext/pb_assoc/example/hash_illegal_resize.cc b/libstdc++-v3/testsuite/ext/pb_assoc/example/hash_illegal_resize.cc
deleted file mode 100644
index 404c9f983f4..00000000000
--- a/libstdc++-v3/testsuite/ext/pb_assoc/example/hash_illegal_resize.cc
+++ /dev/null
@@ -1,148 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file hash_illegal_resize_example.cpp
- * An example of externally resizing a hash-based container object.
- */
-
-// For gp_hash_assoc_cntnr
-#include <ext/pb_assoc/assoc_cntnr.hpp>
-// For hash-related policies.
-#include <ext/pb_assoc/hash_policy.hpp>
-// For cannot_resize
-#include <ext/pb_assoc/exception.hpp>
-// For assert
-#include <cassert>
-
-/*
- * A simple hash functor.
- *	std::hash could serve instead of this functor,
- *	but it is not yet standard everywhere.
- */
-struct int_hash : public std::unary_function<
-  int,
-	     size_t>
-{
-  inline size_t
-  operator()(const int& r_i) const
-  {
-    return (r_i);
-  }
-};
-
-int
-main()
-{
-  /*
-   * A probing hash table mapping ints to chars.
-   */
-  typedef
-    pb_assoc::gp_hash_assoc_cntnr<
-    int,
-    int,
-    int_hash,
-    std::equal_to<
-    int>,
-    // Combining function.
-    pb_assoc::direct_mod_range_hashing<>,
-    // Probe function.
-    pb_assoc::quadratic_probe_fn<
-    const int& >,
-    // Resize policy.
-    pb_assoc::hash_standard_resize_policy<
-    pb_assoc::hash_prime_size_policy,
-    pb_assoc::hash_load_check_resize_trigger<>,
-    /* Allow external access to size.
-     *	Without setting this to true, external resizing
-     *	is not possible.
-     */
-    true> >
-    map_t;
-
-  map_t g;
-
-  /*
-   * Check the actual size of the container object.
-   *	This should be at least
-   *	the initial size given by the size policy object.
-   **/
-  assert(g.get_actual_size() > 8);
-
-  // Insert some elements.
-
-  int i;
-
-  for (i = 0; i < 1000; ++i)
-    g[i] = 2*  i;
-
-  // Check all ok.
-
-  assert(g.size() == 1000);
-
-  for (i = 0; i < 1000; ++i)
-    assert(g.find(i) != g.end()&&  g.find(i)->second == 2*  i);
-
-  // Now attempt to resize the table to 200 (impossible).
-
-  bool ex_thrown = false;
-
-  try
-    {
-      g.resize(200);
-    }
-  catch(pb_assoc::cannot_resize& )
-    {
-      ex_thrown = true;
-    }
-
-  /*
-   * Assert an exception was thrown. A probing table cannot contain
-   *	1000 entries in less than 1000 places.
-   */
-  assert(ex_thrown);
-
-  // Check all ok.
-
-  assert(g.size() == 1000);
-
-  for (i = 0; i < 1000; ++i)
-    assert(g.find(i) != g.end()&&  g.find(i)->second == 2*  i);
-}
-
diff --git a/libstdc++-v3/testsuite/ext/pb_assoc/example/hash_initial_size.cc b/libstdc++-v3/testsuite/ext/pb_assoc/example/hash_initial_size.cc
deleted file mode 100644
index fcd05795e29..00000000000
--- a/libstdc++-v3/testsuite/ext/pb_assoc/example/hash_initial_size.cc
+++ /dev/null
@@ -1,122 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file gp_ht_map_resize_example.cpp
- * An example of setting an initial size for a container object.
- */
-
-// For gp_hash_assoc_cntnr
-#include <ext/pb_assoc/assoc_cntnr.hpp>
-// For hash-related policies.
-#include <ext/pb_assoc/hash_policy.hpp>
-// For assert
-#include <cassert>
-
-/*
- * A simple hash functor.
- *	std::hash could serve instead of this functor,
- *	but it is not yet standard everywhere.
- */
-struct int_hash : public std::unary_function<
-  int,
-	     size_t>
-{
-  inline size_t
-  operator()(const int& r_i) const
-  {
-    return (r_i);
-  }
-};
-
-int
-main()
-{
-  // Resize policy type.
-  typedef
-    pb_assoc::hash_standard_resize_policy<
-    // Size-policy type.
-    pb_assoc::hash_exponential_size_policy<>,
-    // Trigger-policy type.
-    pb_assoc::hash_load_check_resize_trigger<>,
-    /* Allow external access to size.
-     *	This is just used in this example for using the
-     *	get_actual_size method (which won't be accessible without
-     *	this flag.
-     */
-    true>
-    resize_policy_t;
-
-  /*
-   * A collision-probing hash table mapping ints to chars.
-   */
-  typedef
-    pb_assoc::gp_hash_assoc_cntnr<
-    int,
-    char,
-    int_hash,
-    std::equal_to<
-    int>,
-    // Combining function.
-    pb_assoc::direct_mask_range_hashing<>,
-    // Probe function.
-    pb_assoc::linear_probe_fn<
-    const int& >,
-    // Resize policy.
-    resize_policy_t>
-    map_t;
-
-  // A resize-policy object with suggested initial size 256.
-  resize_policy_t res(pb_assoc::hash_exponential_size_policy<>(256));
-
-  map_t g(int_hash(),
-	  std::equal_to<int>(),
-	  pb_assoc::direct_mask_range_hashing<>(),
-	  pb_assoc::linear_probe_fn<const int& >(),
-	  res);
-
-  /*
-   * Check the actual size of the container object. In this case,
-   *	this should be the initial size given by the size policy object.
-   **/
-  assert(g.get_actual_size() >= 256);
-
-  assert(g.size() == 0);
-}
-
diff --git a/libstdc++-v3/testsuite/ext/pb_assoc/example/hash_load_set_change.cc b/libstdc++-v3/testsuite/ext/pb_assoc/example/hash_load_set_change.cc
deleted file mode 100644
index 7c55c7a2e7d..00000000000
--- a/libstdc++-v3/testsuite/ext/pb_assoc/example/hash_load_set_change.cc
+++ /dev/null
@@ -1,152 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file hash_load_set_change_example.cpp
- * An example of setting and changing the load factor of a hash-based
- *	container object.
- */
-
-// For cc_hash_assoc_cntnr.
-#include <ext/pb_assoc/assoc_cntnr.hpp>
-/*
- * For hash_standard_resize_policy, hash_exponential_size_policy,
- *	and direct_mask_range_hashing.
- */
-#include <ext/pb_assoc/hash_policy.hpp>
-// For unary_function.
-#include <functional>
-// For assert
-#include <cassert>
-
-/*
- * A simple hash functor.
- *	std::hash could serve instead of this functor,
- *	but it is not yet standard everywhere.
- */
-struct int_hash : public std::unary_function<
-  int,
-	     size_t>
-{
-  inline size_t
-  operator()(int i) const
-  {
-    return (i);
-  }
-};
-
-int
-main()
-{
-  // A trigger policy type.
-  typedef pb_assoc::hash_load_check_resize_trigger< true> trigger_t;
-
-  // A resize policy type.
-  typedef
-    pb_assoc::hash_standard_resize_policy<
-    pb_assoc::hash_exponential_size_policy<>,
-    // Trigger type.
-    trigger_t,
-    /* Allow external access to size.
-     *	This is not necessary for setting the load factor,
-     *	but it allows to call get_actual_size.
-     */
-    true>
-    resize_t;
-
-  /*
-   * A collision-chaining hash table mapping ints to chars.
-   */
-  typedef
-    pb_assoc::cc_hash_assoc_cntnr<
-    int,
-    char,
-    int_hash,
-    std::equal_to<int>,
-    // Combining function.
-    pb_assoc::direct_mask_range_hashing<>,
-    // Resize policy.
-    resize_t>
-    map_t;
-
-  // A trigger policy object with load between 0.3 and 0.8.
-  trigger_t trigger(static_cast<float>(0.3), static_cast<float>(0.8));
-
-  // A resize policy object with the above trigger.
-  resize_t resize(pb_assoc::hash_exponential_size_policy<>(),
-		  trigger);
-
-  map_t c(int_hash(),
-	  std::equal_to<int>(),
-	  pb_assoc::direct_mask_range_hashing<>(),
-	  resize);
-
-  c[1] = 'a';
-
-  // Check the loads and sizes.
-
-  assert(c.get_loads().first == static_cast<float>(0.3));
-  assert(c.get_loads().second == static_cast<float>(0.8));
-
-  assert(c.get_actual_size() == 8);
-
-  assert(c.size() == 1);
-
-  /*
-   * Note that there is a discrepancy between the loads of the policy
-   *	object and the actual size of the container object. This is
-   *	because the container's construction performs an implicit external
-   *	resize.
-   */
-
-  c[2] = 'b';
-  c[3] = 'c';
-  c[4] = 'd';
-
-  assert(c.get_actual_size() == 8);
-
-  // Change the loads. This causes (potentially) a resize.
-  c.set_loads(std::make_pair(
-			     static_cast<float>(0.01),
-			     static_cast<float>(0.05)));
-
-  // The loads actually changed.
-  assert(c.get_actual_size() > 8);
-}
-
diff --git a/libstdc++-v3/testsuite/ext/pb_assoc/example/hash_mod.cc b/libstdc++-v3/testsuite/ext/pb_assoc/example/hash_mod.cc
deleted file mode 100644
index 70f7af2c997..00000000000
--- a/libstdc++-v3/testsuite/ext/pb_assoc/example/hash_mod.cc
+++ /dev/null
@@ -1,89 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file hash_mod_example.cpp
- * An example showing how to use a mod range-hasing function
- */
-
-// For cc_hash_assoc_cntnr.
-#include <ext/pb_assoc/assoc_cntnr.hpp>
-// For direct_mask_range_hashing and hash_standard_resize_policy.
-#include <ext/pb_assoc/hash_policy.hpp>
-// For unary_function, binary_function.
-#include <functional>
-/*
- * A simple hash functor.
- *	std::hash could serve instead of this functor,
- *	but it is not yet standard everywhere.
- */
-struct int_hash : public std::unary_function<
-  int,
-	     size_t>
-{
-  inline size_t
-  operator()(int i) const
-  {
-    return (i);
-  }
-};
-
-int
-main()
-{
-  /*
-   * A collision-chaining hash table mapping ints to chars.
-   */
-  typedef
-    pb_assoc::cc_hash_assoc_cntnr<
-    int,
-    char,
-    int_hash,
-    std::equal_to<int>,
-    // Combining function.
-    pb_assoc::direct_mod_range_hashing<> >
-    map_t;
-
-  map_t c;
-
-  c[32] = 'b';
-  c[1024] = 'c';
-  c[4096] = 'd';
-}
-
diff --git a/libstdc++-v3/testsuite/ext/pb_assoc/example/hash_resize.cc b/libstdc++-v3/testsuite/ext/pb_assoc/example/hash_resize.cc
deleted file mode 100644
index b5db5948bd9..00000000000
--- a/libstdc++-v3/testsuite/ext/pb_assoc/example/hash_resize.cc
+++ /dev/null
@@ -1,146 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file hash_resize_example.cpp
- * An example of externally resizing a map.
- */
-
-// For gp_hash_assoc_cntnr.
-#include <ext/pb_assoc/assoc_cntnr.hpp>
-// For hash-related policies.
-#include <ext/pb_assoc/hash_policy.hpp>
-// For unary_function.
-#include <functional>
-// For assert
-#include <cassert>
-
-/*
- * A simple hash functor.
- *	std::hash could serve instead of this functor,
- *	but it is not yet standard everywhere.
- */
-struct int_hash : public std::unary_function<
-  int,
-	     size_t>
-{
-  inline size_t
-  operator()(const int& r_i) const
-  {
-    return (r_i);
-  }
-};
-
-int
-main()
-{
-  /*
-   * A probing hash table mapping ints to chars.
-   */
-  typedef
-    pb_assoc::gp_hash_assoc_cntnr<
-    int,
-    char,
-    int_hash,
-    std::equal_to<
-    int>,
-    // Combining function.
-    pb_assoc::direct_mask_range_hashing<>,
-    // Probe function.
-    pb_assoc::linear_probe_fn<
-    int>,
-    // Resize policy.
-    pb_assoc::hash_standard_resize_policy<
-    pb_assoc::hash_exponential_size_policy<>,
-    pb_assoc::hash_load_check_resize_trigger<>,
-    /* Allow external access to size.
-     *	Without setting this to true, external resizing
-     *	is not possible.
-     */
-    true> >
-    map_t;
-
-  map_t g;
-
-  /*
-   * Check the actual size of the container object. In this case,
-   *	this should be the initial size given by the size policy object.
-   **/
-  assert(g.get_actual_size() == 8);
-
-  // Insert some elements.
-
-  g[1] = 'a';
-  g[2] = 'b';
-  g[3] = 'c';
-
-  // Now resize the table upward.
-
-  g.resize(200);
-
-  /*
-   * Check the actual size of the container object.
-   *	For the policy used in this example, the
-   *	nearest larger size than 200 is 256.
-   **/
-  assert(g.get_actual_size() == 256);
-
-  g[67] = 'g';
-  g[22] = 'f';
-
-  // Regardless of the internal size, the logical size should be 5.
-  assert(g.size() == 5);
-
-  // Now resize the table downward.
-
-  g.resize(106);
-
-  /*
-   * Check the actual size of the container object.
-   *	For the policy used in this example, the
-   *	nearest larger size than 106 is 128.
-   **/
-  assert(g.get_actual_size() == 128);
-
-  g[37] = 'f';
-
-  // Regardless of the internal size, the logical size should be 5.
-  assert(g.size() == 6);
-}
-
diff --git a/libstdc++-v3/testsuite/ext/pb_assoc/example/hash_resize_neg.cc b/libstdc++-v3/testsuite/ext/pb_assoc/example/hash_resize_neg.cc
deleted file mode 100644
index fae6298a682..00000000000
--- a/libstdc++-v3/testsuite/ext/pb_assoc/example/hash_resize_neg.cc
+++ /dev/null
@@ -1,73 +0,0 @@
-// { dg-do compile }
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file hash_bad_resize_example.cpp
- * An example showing how *not* to resize a hash-based container.
- */
-
-// For cc_hash_assoc_cntnr
-#include <ext/pb_assoc/assoc_cntnr.hpp>
-// For assert
-#include <cassert>
-
-int
-main()
-{
-  /*
-   * A collision-chaining hash table mapping ints to chars.
-   */
-  typedef pb_assoc::cc_hash_assoc_cntnr< int, char> map_t;
-
-  // An map_t object.
-  map_t h;
-
-  /*
-   * Following line won't compile. The resize policy needs to be configured
-   *to allow external resize (by default, this is not available).
-   */
-  h.resize(20); 
-}
-
-// { dg-error "instantiated" "" { target *-*-* } 66 }
-// { dg-error "no matching function" "" { target *-*-* } 263 }
-// { dg-error "candidates are" "" { target *-*-* } 261 }
-// { dg-error "void" "" { target *-*-* } 269 }
-// { dg-excess-errors "" { target *-*-* } }
diff --git a/libstdc++-v3/testsuite/ext/pb_assoc/example/hash_shift_mask.cc b/libstdc++-v3/testsuite/ext/pb_assoc/example/hash_shift_mask.cc
deleted file mode 100644
index 4d829e7f9cf..00000000000
--- a/libstdc++-v3/testsuite/ext/pb_assoc/example/hash_shift_mask.cc
+++ /dev/null
@@ -1,130 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file hash_shift_mask_example.cpp
- * An example showing how to write a range-hasing functor.
- */
-
-// For cc_hash_assoc_cntnr.
-#include <ext/pb_assoc/assoc_cntnr.hpp>
-// For hash-related policies.
-#include <ext/pb_assoc/hash_policy.hpp>
-// For unary_function and binary_function
-#include <functional>
-
-/*
- * A simple hash functor.
- *	std::hash could serve instead of this functor,
- *	but it is not yet standard everywhere.
- */
-struct simple_int_hash : public std::unary_function<
-  int,
-	     size_t>
-{
-  inline size_t
-  operator()(int i) const
-  {
-    return (i);
-  }
-};
-
-// A range-hashing function which shifts 2 bits right and then masks.
-class shift_two_mask_range_hashing : private pb_assoc::direct_mask_range_hashing<>
-{
-public:
-  typedef size_t size_type;
-
-public:
-  /*
-   * Swaps with a different instant.
-   */
-  void
-  swap(shift_two_mask_range_hashing& r_other)
-  {
-    pb_assoc::direct_mask_range_hashing<>::swap(r_other);
-  }
-
-  /*
-   * Called by the container when internally resized.
-   */
-  void
-  notify_resized(size_type size)
-  {
-    pb_assoc::direct_mask_range_hashing<>::notify_resized(size);
-  }
-
-  /*
-   * Given a hash value, returns a number in the range of the
-   *	internal size of the container.
-   */
-  inline size_type
-  operator()(size_type hash) const
-  {
-    return (pb_assoc::direct_mask_range_hashing<>::operator()(
-							      hash >> 2));
-  }
-};
-
-int
-main()
-{
-  /*
-   * A collision-chaining hash table mapping ints to chars.
-   */
-  typedef
-    pb_assoc::cc_hash_assoc_cntnr<
-    int,
-    char,
-    // Hash function.
-    simple_int_hash,
-    std::equal_to<int>,
-    // Range hashing function.
-    shift_two_mask_range_hashing>
-    map_t;
-
-  map_t h;
-
-  // Use normally.
-
-  h[16] = 'a';
-  h[256] = 'e';
-  h[4] = 'z';
-}
-
diff --git a/libstdc++-v3/testsuite/ext/pb_assoc/example/mapping_level.cc b/libstdc++-v3/testsuite/ext/pb_assoc/example/mapping_level.cc
deleted file mode 100644
index 9e0689a3ae4..00000000000
--- a/libstdc++-v3/testsuite/ext/pb_assoc/example/mapping_level.cc
+++ /dev/null
@@ -1,150 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file mapping_level_example.cpp
- * A basic example showing how to use different mapping levels.
- */
-
-// For cout, endl.
-#include <iostream>
-// For various associative containers.
-#include <ext/pb_assoc/assoc_cntnr.hpp>
-// For compound_data_type.
-#include <ext/pb_assoc/data_type.hpp>
-// For sting.
-#include <string>
-// For assert.
-#include <cassert>
-// For unary_function.
-#include <functional>
-
-typedef std::string user_name;
-
-typedef unsigned long machine_id;
-
-typedef std::string process_name;
-
-typedef float running_time;
-
-typedef
-pb_assoc::lu_assoc_cntnr<
-  process_name,
-  running_time>
-pr_name_rn_time_map;
-
-typedef
-pb_assoc::lu_assoc_cntnr<
-  machine_id,
-  pb_assoc::compound_data_type<
-  pr_name_rn_time_map> >
-machine_pr_map;
-
-typedef
-pb_assoc::lu_assoc_cntnr<
-  user_name,
-  pb_assoc::compound_data_type<
-  machine_pr_map> >
-user_machine_pr_map;
-
-typedef user_machine_pr_map::rebind<2>::other l2_t;
-
-typedef user_machine_pr_map::rebind<1>::other l1_t;
-
-struct is_same_proc : public std::unary_function<
-  l1_t::iterator::const_reference,
-		      bool>
-{
-  is_same_proc(const process_name& r_proc) : m_proc(r_proc)
-  {
-
-  };
-
-  bool
-  operator()(l1_t::iterator::const_reference r_val)
-  {
-    return (r_val.first.second == m_proc);
-  }
-
-private:
-  process_name m_proc;
-};
-
-int main()
-{
-  user_machine_pr_map m;
-
-  /**
-   * Following shows different ways to insert into a user_machine_pr_map object.
-   **/
-
-  // Josh launches on machine 1 firefox at time 1000.
-
-  m["Josh"][1]["firefox"] = 1000;
-
-  // Ben launches on machine 1 python at time 1003.
-  ((l1_t& )m)[std::make_pair(
-			     std::make_pair("Ben", 1),
-			     "python")] = 1003;
-
-  // Josh launches on machine 2 buggy at time 1004.
-
-  m.find("Josh")->second[2]["buggy"] = 1004;
-
-  // Sarah launches on machine 3 kdevelop at time 1010.
-
-  m["Sarah"][2].insert(std::make_pair("kdevelop", 1010));
-
-  // Iterate over all users running applications.
-
-  {
-    std::cout << "All users running applications:" << std::endl;
-
-    user_machine_pr_map::const_iterator it = m.begin();
-
-    while (it != m.end())
-      std::cout << (it++)->first << std::endl;
-  }
-
-  // Sarah has terminated kdevelop
-  ((l1_t& )m).erase(std::make_pair(
-				   std::make_pair("Sarah", 2),
-				   "kdevelop"));
-}
-
diff --git a/libstdc++-v3/testsuite/ext/pb_assoc/example/mapping_level_neg.cc b/libstdc++-v3/testsuite/ext/pb_assoc/example/mapping_level_neg.cc
deleted file mode 100644
index c8fa40c3201..00000000000
--- a/libstdc++-v3/testsuite/ext/pb_assoc/example/mapping_level_neg.cc
+++ /dev/null
@@ -1,83 +0,0 @@
-// { dg-do compile }
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file bad_mapping_level_example.cpp
- * An example how not to use mapping levels.
- */
-
-// For cout, endl.
-#include <iostream>
-// For various associative containers.
-#include <ext/pb_assoc/assoc_cntnr.hpp>
-// For compound_data_type.
-#include <ext/pb_assoc/data_type.hpp>
-
-int
-main()
-{
-  typedef
-    pb_assoc::tree_assoc_cntnr<
-    int,
-    pb_assoc::compound_data_type<
-    pb_assoc::tree_assoc_cntnr<
-    char,
-    pb_assoc::null_data_type> > >
-    t_0;
-
-  typedef t_0::rebind<1>::other t_0_rebound;
-
-  typedef
-    pb_assoc::tree_assoc_cntnr<
-    int,
-    pb_assoc::tree_assoc_cntnr<
-    char,
-    pb_assoc::null_data_type> >
-    t_1;
-
-  /*
-   * Following line will not compile.
-   * t1 is a "map" type, and cannot be rebound.
-   **/
-
-  typedef t_1::rebind<1>::other t_1_rebound; // { dg-error "expected" }
-}
-
-
diff --git a/libstdc++-v3/testsuite/ext/pb_assoc/example/ms_traits.cc b/libstdc++-v3/testsuite/ext/pb_assoc/example/ms_traits.cc
deleted file mode 100644
index 8db49e7687d..00000000000
--- a/libstdc++-v3/testsuite/ext/pb_assoc/example/ms_traits.cc
+++ /dev/null
@@ -1,121 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file ms_traits_example.cpp
- * A basic example showing how to use ms_traits for querying container types
- *	for their behavior.
- */
-
-// For various associative containers.
-#include <ext/pb_assoc/assoc_cntnr.hpp>
-// For ms_traits.
-#include <ext/pb_assoc/ms_trait.hpp>
-// For cout, endl.
-#include <iostream>
-
-void
-print_has_data_compound_data(bool has_data, bool has_compound_data)
-{
-  if (!has_data)
-    {
-      std::cout << "Does not have data." << std::endl;
-
-      return;
-    }
-
-  if (!has_compound_data)
-    {
-      std::cout << "Has data." << std::endl;
-
-      return;
-    }
-
-  std::cout << "Has compound data." << std::endl;
-}
-
-void
-print_mapping_level(unsigned int mapping_level)
-{
-  std::cout << "Mapping level = " << mapping_level << std::endl;
-}
-
-template<class Cntnr>
-void
-print_mapping_attributes()
-{
-  typedef pb_assoc::ms_traits< Cntnr> traits;
-
-  print_has_data_compound_data(traits::has_data, traits::has_compound_data);
-
-  print_mapping_level(traits::mapping_level);
-
-  std::cout << std::endl << std::endl;
-}
-
-int
-main()
-{
-  std::cout << "\"Set\"-type container:" << std::endl;
-
-  print_mapping_attributes<
-    pb_assoc::cc_hash_assoc_cntnr<int, pb_assoc::null_data_type> >();
-
-  std::cout << "\"Map\"-type container:" << std::endl;
-
-  print_mapping_attributes<
-    pb_assoc::cc_hash_assoc_cntnr<int, char> >();
-
-  typedef
-    pb_assoc::cc_hash_assoc_cntnr<
-    int,
-    pb_assoc::compound_data_type<
-    pb_assoc::tree_assoc_cntnr<
-    char,
-    pb_assoc::null_data_type> > >
-    mmap_t;
-
-  std::cout << "\"Multimap\"-type container:" << std::endl;
-
-  print_mapping_attributes<mmap_t>();
-
-  std::cout << "Rebound \"Multimap\"-type container:" << std::endl;
-
-  print_mapping_attributes<mmap_t::rebind<1>::other>();
-}
diff --git a/libstdc++-v3/testsuite/ext/pb_assoc/example/ranged_hash.cc b/libstdc++-v3/testsuite/ext/pb_assoc/example/ranged_hash.cc
deleted file mode 100644
index 365c6f06f7a..00000000000
--- a/libstdc++-v3/testsuite/ext/pb_assoc/example/ranged_hash.cc
+++ /dev/null
@@ -1,193 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file ranged_hash_example.cpp
- * A basic example showing how to write a ranged-hash functor.
- */
-
-// For cc_hash_assoc_cntnr.
-#include <ext/pb_assoc/assoc_cntnr.hpp>
-// For hash-related policies.
-#include <ext/pb_assoc/hash_policy.hpp>
-// For unary_function and binary_function.
-#include <functional>
-// For assert.
-#include <cassert>
-// For string.
-#include <string>
-
-/**
- * A (somewhat simplistic) ranged-hash function for strings.
- *	It uses the size of the container object to determine
- *	the hashing method. For smaller sizes it uses a simple hash function;
- *	for larger sizes it uses a more complicated hash function.
- */
-class simple_string_ranged_hash_fn : public std::unary_function<
-  std::string,
-				     size_t>
-{
-public:
-  typedef size_t size_type;
-
-  // Default constructor.
-  simple_string_ranged_hash_fn();
-
-  // Called to notify that the size has changed.
-  void
-  notify_resized(size_t size);
-
-  /*
-   * Called for hashing a string into a size_t in a
-   *	given range.
-   */
-  size_t
-  operator()(const std::string& r_string);
-
-  // Swaps content.
-  void
-  swap(simple_string_ranged_hash_fn& r_other);
-
-private:
-  // Records the size of the container object.
-  size_t m_container_size;
-};
-
-simple_string_ranged_hash_fn::
-simple_string_ranged_hash_fn() :
-  m_container_size(0)
-{
-
-}
-
-void
-simple_string_ranged_hash_fn::
-notify_resized(size_t size)
-{
-  m_container_size = size;
-}
-
-size_t
-simple_string_ranged_hash_fn::
-operator()(const std::string& r_string)
-{
-  /*
-   * This (simplified) hash algorithm decides that if there are
-   *	fewer than 100 strings in the container it will hash
-   *	a string by summing its characters; otherwise, it will
-   *	perform a more complicated operation in order to produce
-   *	hash values with fewer collisions.
-   */
-
-  std::string::const_iterator it = r_string.begin();
-
-  size_t hash = 0;
-
-  if (m_container_size < 100)
-    {
-      // For this size, perform an std::accumulate type of operation.
-
-      while (it != r_string.end())
-	hash += static_cast<size_t>(*it++);
-    }
-  else
-    {
-      // For this size, perform a different operation.
-
-      while (it != r_string.end())
-	{
-	  hash += static_cast<size_t>(*it++);
-
-	  hash *= 5;
-	}
-    }
-
-  /*
-   * The function must, by whatever means, return
-   *	a size in the range 0 to m_container_size.
-   */
-  return (hash % m_container_size);
-}
-
-void
-simple_string_ranged_hash_fn::
-swap(simple_string_ranged_hash_fn& r_other)
-{
-  std::swap(m_container_size, r_other.m_container_size);
-}
-
-int
-main()
-{
-  /*
-   * A collision-chaining hash table storing strings.
-   */
-  typedef
-    pb_assoc::cc_hash_assoc_cntnr<
-    std::string,
-    pb_assoc::null_data_type,
-    // Null hash function
-    pb_assoc::null_hash_fn,
-    // Equivalence function.
-    std::equal_to<
-    std::string>,
-    // Range hashing function.
-    simple_string_ranged_hash_fn >
-    set_t;
-
-  /*
-   * Note that in the above, the library determines a resize policy
-   *	appropriate for direct_mod_range_hashing.
-   */
-
-  set_t h;
-
-  // Use the table normally.
-
-  h.insert("Hello, ");
-  h.insert("world");
-
-  assert(h.size() == 2);
-
-  assert(h.find("Hello, ") != h.end());
-  assert(h.find("world") != h.end());
-
-  assert(h.find("Goodbye, oh cruel world!") == h.end());
-}
-
diff --git a/libstdc++-v3/testsuite/ext/pb_assoc/example/store_hash.cc b/libstdc++-v3/testsuite/ext/pb_assoc/example/store_hash.cc
deleted file mode 100644
index bad050049a1..00000000000
--- a/libstdc++-v3/testsuite/ext/pb_assoc/example/store_hash.cc
+++ /dev/null
@@ -1,111 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file hash_mod_example.cpp
- * An example showing how to use cc_ht_map with alternative policies.
- */
-
-// For cc_hash_assoc_cntnr.
-#include <ext/pb_assoc/assoc_cntnr.hpp>
-// For direct_mask_range_hashing and hash_standard_resize_policy.
-#include <ext/pb_assoc/hash_policy.hpp>
-// For unary_function, binary_function.
-#include <functional>
-// For string.
-#include <string>
-
-/*
- * A string hash functor
- */
-struct string_hash : public std::unary_function<
-  std::string,
-		     size_t>
-{
-  inline size_t
-  operator()(std::string str) const
-  {
-    std::string::const_iterator b = str.begin();
-
-    std::string::const_iterator e = str.end();
-
-    size_t hash = 0;
-
-    while (b != e)
-      {
-	hash *= 5;
-
-	hash += static_cast<size_t>(*b);
-
-	++b;
-      }
-
-    return (hash);
-  }
-};
-
-int
-main()
-{
-  /*
-   * A collision-chaining hash table mapping strings to ints.
-   */
-  typedef
-    pb_assoc::cc_hash_assoc_cntnr<
-    std::string,
-    int,
-    // Hash function.
-    string_hash,
-    // Equivalence function.
-    std::equal_to<
-    std::string>,
-    // Range hashing function.
-    pb_assoc::direct_mask_range_hashing<>,
-    // Resize policy.
-    pb_assoc::hash_standard_resize_policy<>,
-    // Store the hash value with each entry.
-    true>
-    map_t;
-
-  map_t h;
-
-  h["Hello, "] = 0;
-  h["world"] = 1;
-}
-
diff --git a/libstdc++-v3/testsuite/ext/pb_assoc/example/tree_intervals.cc b/libstdc++-v3/testsuite/ext/pb_assoc/example/tree_intervals.cc
deleted file mode 100644
index dbc9430a64e..00000000000
--- a/libstdc++-v3/testsuite/ext/pb_assoc/example/tree_intervals.cc
+++ /dev/null
@@ -1,260 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/*
- * @file tree_set_intervals_example.cpp
- * An example showing how to augment a trees to support operations involving
- *	line intervals.
- */
-
-// For ov_tree_set
-#include <ext/pb_assoc/assoc_cntnr.hpp>
-// For assert
-#include <cassert>
-// For NULL
-#include <cstdlib>
-
-/*
- * Following are definitions of line intervals and functors operating on them.
- *	As the purpose of this example is node invariants, and not
- *	computational-geometry algorithms per-se, some simplifications are made
- *(e.g., intervals are defined by unsigned integers, and not by*a parameterized type, data members are public, etc.).
- */
-
-/*
- * An interval of unsigned integers.
- **/
-struct interval
-{
-  /*
-   * Constructor.
-   * @param start [i] - Start point.
-   * @param end [i] - End point.
-   */
-  interval(unsigned int start, unsigned int end) : m_start(start),
-						   m_end(end)
-  {
-    assert(start <= end);
-  }
-
-  /*
-   * Comparison predicate.
-   * @param r_rhs [i] - Right-hand object with which to compare.
-   **/
-  bool
-  operator<(const interval& r_rhs) const
-  {
-    if (m_start != r_rhs.m_start)
-      return (m_start < r_rhs.m_start);
-
-    return (m_end < r_rhs.m_end);
-  }
-
-  /*
-   * Start point.
-   */
-  unsigned int m_start;
-
-  /*
-   * End point.
-   **/
-  unsigned int m_end;
-};
-
-struct intervals_node_updator;
-
-template<class Cntnr>
-bool
-overlaps(const Cntnr& r_c, const interval& r_interval);
-
-/*
- * The entry of the set. It includes an interval and the
- *	maximal endpoint of the intervals in its subtree.
- */
-struct entry
-{
-  // Constructor. The maximal endpoint is set to the endpoint
-  explicit entry(unsigned int start, unsigned int end) : m_interval(start, end),
-							 m_max_endpoint(end)
-  { }
-
-  // Compares two entries by their intervals.
-  inline bool
-  operator<(const entry& r_rhs) const
-  {
-    return (m_interval < r_rhs.m_interval);
-  }
-
-  // An interval
-  interval m_interval;
-
-private:
-  // The maximal endpoint of the intervals in its subtree.
-  mutable unsigned int m_max_endpoint;
-
-  friend struct intervals_node_updator;
-
-  template<class Cntnr>
-  friend bool
-  overlaps(const Cntnr& r_c, const interval& r_interval);
-
-};
-
-/*
- * Functor updating maximal endpoints of entries.
- *	Algorithm taken from "Introduction to Algorithms" by Cormen, Leiserson,
- *	and Rivest.
- */
-struct intervals_node_updator
-{
-  inline void
-  operator()(const entry* p_entry, const entry* p_l_child_entry, const entry* p_r_child_entry)
-  {
-    /* The left maximal endpoint is 0 if there is no left child.
-     */
-    const unsigned int l_max_endpoint =(p_l_child_entry == NULL)? 0 : p_l_child_entry->m_max_endpoint;
-
-    /* The right maximal endpoint is 0 if there is no right child.
-     */
-    const unsigned int r_max_endpoint =(p_r_child_entry == NULL)? 0 : p_r_child_entry->m_max_endpoint;
-
-    p_entry->m_max_endpoint = std::max(p_entry->m_interval.m_end,
-				       std::max<unsigned int>(l_max_endpoint, r_max_endpoint));
-  }
-};
-
-/*
- * Checks whether a set of intervals contains at least one interval
- *	overlapping some interval.
- *	Algorithm taken from "Introduction to Algorithms" by Cormen, Leiserson,
- *	and Rivest.
- **/
-template<class Cntnr>
-bool
-overlaps(const Cntnr& r_c, const interval& r_interval)
-{
-  typedef typename Cntnr::const_iterator intr_set_const_it;
-
-  typedef typename Cntnr::const_node_iterator intr_set_const_node_it;
-
-  intr_set_const_node_it node_it = r_c.node_begin();
-
-  while (node_it != r_c.node_end())
-    {
-      // Check whether r_interval overlaps the current interval.
-
-      intr_set_const_it it =* node_it;
-
-      if (r_interval.m_end >= it->m_interval.m_start&& 
-	  r_interval.m_start <= it->m_interval.m_end)
-	return (true);
-
-      intr_set_const_node_it l_node_it = node_it.l_child();
-
-      const unsigned int l_max_endpoint =(l_node_it == r_c.node_end())?
-	0 : (*l_node_it)->m_max_endpoint;
-
-      if (l_max_endpoint >= r_interval.m_start)
-	node_it = l_node_it;
-      else
-	node_it = node_it.r_child();
-    }
-
-  return (false);
-}
-
-template<class Cntnr>
-void
-some_op_sequence(Cntnr c)
-{
-  // Insert some entries.
-
-  c.insert(entry(0, 100));
-  c.insert(entry(150, 160));
-  c.insert(entry(300, 1000));
-  c.insert(entry(10000, 100000));
-  c.insert(entry(200, 100200));
-
-  // Test overlaps.
-
-  // Overlaps 150 - 160
-  assert(overlaps(c, interval(145, 165)) == true);
-  // Overlaps 150 - 160
-  assert(overlaps(c, interval(145, 155)) == true);
-  assert(overlaps(c, interval(165, 175)) == false);
-  assert(overlaps(c, interval(100201, 100203)) == false);
-
-  // Erase an entry.
-
-  entry e(150, 160);
-
-  c.erase(e);
-
-  // Test overlaps again.
-
-  assert(overlaps(c, interval(145, 165)) == false);
-  assert(overlaps(c, interval(165, 175)) == false);
-  assert(overlaps(c, interval(0, 300000)) == true);
-}
-
-int
-main()
-{
-  some_op_sequence(pb_assoc::tree_assoc_cntnr<
-		   entry,
-		   pb_assoc::null_data_type,
-		   std::less<entry>,
-		   pb_assoc::ov_tree_ds_tag,
-		   intervals_node_updator>());
-
-  some_op_sequence(pb_assoc::tree_assoc_cntnr<
-		   entry,
-		   pb_assoc::null_data_type,
-		   std::less<entry>,
-		   pb_assoc::rb_tree_ds_tag,
-		   intervals_node_updator>());
-
-  some_op_sequence(pb_assoc::tree_assoc_cntnr<
-		   entry,
-		   pb_assoc::null_data_type,
-		   std::less<entry>,
-		   pb_assoc::splay_tree_ds_tag,
-		   intervals_node_updator>());
-}
-
diff --git a/libstdc++-v3/testsuite/ext/pb_assoc/example/tree_join.cc b/libstdc++-v3/testsuite/ext/pb_assoc/example/tree_join.cc
deleted file mode 100644
index 1c7c76581dd..00000000000
--- a/libstdc++-v3/testsuite/ext/pb_assoc/example/tree_join.cc
+++ /dev/null
@@ -1,127 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file tree_join_example.cpp.cpp
- * An example showing how to join splay_tree_map objects.
- *	The code in the example is relevant to red-black trees as well.
- */
-
-// For tree_assoc_cntnr
-#include <ext/pb_assoc/assoc_cntnr.hpp>
-// For cannot_join exception.
-#include <ext/pb_assoc/exception.hpp>
-// For assert
-#include <cassert>
-
-int
-main()
-{
-  /*
-   * A splay tree table mapping ints to chars.
-   */
-  typedef
-    pb_assoc::tree_assoc_cntnr<
-    int,
-    char,
-    std::less<
-    int>,
-    pb_assoc::splay_tree_ds_tag>
-    map_t;
-
-  // Two map_t object.
-  map_t h0, h1;
-
-  // Insert some values into the first table.
-  for (int i0 = 0; i0 < 100; ++i0)
-    h0.insert(std::make_pair(i0, 'a'));
-
-  // Insert some values into the second table.
-  for (int i1 = 0; i1 < 100; ++i1)
-    h1.insert(std::make_pair(1000 + i1, 'b'));
-
-  /*
-   * Since all the elements in h0 are smaller than those in h1,
-   *	it is possible to join the two tables. This is exception free.
-   */
-
-  h0.join(h1);
-
-  // h0 should now contain all entries, and h1 should be empty.
-
-  assert(h0.size() == 200);
-  assert(h1.empty());
-
-  // Now perform an illegal join.
-
-  // Two other map_t objects.
-  map_t h2, h3;
-
-  h2[1] = 'a';
-  h2[3] = 'c';
-
-  h3[2] = 'b';
-
-  /*
-   * It is not true that all elements in h2 are smaller than those
-   *	in h3, nor is it true that they are all larger. Hence, attempting
-   *	to join h2, and h3 should result in an exception.
-   */
-
-  bool exception_thrown = false;
-
-  try
-    {
-      h2.join(h3);
-    }
-  catch(pb_assoc::cannot_join& )
-    {
-      exception_thrown = true;
-    }
-
-  assert(exception_thrown);
-
-  // Since the operation was not performed, the tables should be unaltered.
-
-  assert(h2.size() == 2);
-  assert(h3[2] == 'b');
-
-  return (0);
-}
-
diff --git a/libstdc++-v3/testsuite/ext/pb_assoc/example/tree_order_statistics.cc b/libstdc++-v3/testsuite/ext/pb_assoc/example/tree_order_statistics.cc
deleted file mode 100644
index b461429ea69..00000000000
--- a/libstdc++-v3/testsuite/ext/pb_assoc/example/tree_order_statistics.cc
+++ /dev/null
@@ -1,133 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/*
- * @file tree_order_statistics_example.cpp
- * An example showing how to use functors for order-statistics
- *	in tree-based containers.
- */
-
-// For tree_assoc_cntnr
-#include <ext/pb_assoc/assoc_cntnr.hpp>
-// For order-statistics related policies
-#include <ext/pb_assoc/tree_policy.hpp>
-// For assert
-#include <cassert>
-
-/*
- * A red-black tree table storing ints and their order statistics.
- */
-typedef
-pb_assoc::tree_assoc_cntnr<
-  pb_assoc::order_statistics_key<int>,
-  pb_assoc::null_data_type,
-  pb_assoc::order_statistics_key_cmp<std::less<int> >,
-  pb_assoc::rb_tree_ds_tag,
-  pb_assoc::order_statistics_node_updator<int> >
-set_t;
-
-int
-main()
-{
-  set_t s;
-
-  typedef pb_assoc::order_statistics_key< int> int_order_statistics_key;
-
-  // Insert some entries into s.
-
-  s.insert(int_order_statistics_key(12));
-  s.insert(int_order_statistics_key(505));
-  s.insert(int_order_statistics_key(30));
-  s.insert(int_order_statistics_key(1000));
-  s.insert(int_order_statistics_key(10000));
-  s.insert(int_order_statistics_key(100));
-
-  // The order of the keys should be: 12, 30, 100, 505, 1000, 10000.
-
-  pb_assoc::find_by_order<set_t> by_order;
-
-  assert(*by_order(s, 0) == 12);
-  assert(*by_order(s, 1) == 30);
-  assert(*by_order(s, 2) == 100);
-  assert(*by_order(s, 3) == 505);
-  assert(*by_order(s, 4) == 1000);
-  assert(*by_order(s, 5) == 10000);
-  assert(by_order(s, 6) == s.end());
-
-  // The order of the keys should be: 12, 30, 100, 505, 1000, 10000.
-
-  pb_assoc::order_by_key<set_t> by_key;
-
-  assert(by_key(s, 10) == 0);
-  assert(by_key(s, 12) == 0);
-  assert(by_key(s, 15) == 1);
-  assert(by_key(s, 30) == 1);
-  assert(by_key(s, 99) == 2);
-  assert(by_key(s, 100) == 2);
-  assert(by_key(s, 505) == 3);
-  assert(by_key(s, 1000) == 4);
-  assert(by_key(s, 10000) == 5);
-  assert(by_key(s, 9999999) == 6);
-
-  // Erase an entry.
-  s.erase(int_order_statistics_key(30));
-
-  // The order of the keys should be: 12, 100, 505, 1000, 10000.
-
-  assert(*by_order(s, 0) == 12);
-  assert(*by_order(s, 1) == 100);
-  assert(*by_order(s, 2) == 505);
-  assert(*by_order(s, 3) == 1000);
-  assert(*by_order(s, 4) == 10000);
-  assert(by_order(s, 5) == s.end());
-
-  // The order of the keys should be: 12, 100, 505, 1000, 10000.
-
-  assert(by_key(s, 10) == 0);
-  assert(by_key(s, 12) == 0);
-  assert(by_key(s, 100) == 1);
-  assert(by_key(s, 505) == 2);
-  assert(by_key(s, 707) == 3);
-  assert(by_key(s, 1000) == 3);
-  assert(by_key(s, 1001) == 4);
-  assert(by_key(s, 10000) == 4);
-  assert(by_key(s, 100000) == 5);
-  assert(by_key(s, 9999999) == 5);
-}
-
diff --git a/libstdc++-v3/testsuite/ext/pb_assoc/example/tree_order_statistics_join.cc b/libstdc++-v3/testsuite/ext/pb_assoc/example/tree_order_statistics_join.cc
deleted file mode 100644
index 2287f49de1f..00000000000
--- a/libstdc++-v3/testsuite/ext/pb_assoc/example/tree_order_statistics_join.cc
+++ /dev/null
@@ -1,106 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file splay_tree_map_order_statistics_example.cpp
- * An example showing how to augment a splay tree to support order statistics.
- */
-
-// For trees.
-#include <ext/pb_assoc/assoc_cntnr.hpp>
-// For order_statistics_key
-#include <ext/pb_assoc/tree_policy.hpp>
-// For assert
-#include <cassert>
-
-/**
- * A splay tree table mapping ints to chars and storing the ints order statistics.
- */
-typedef
-pb_assoc::tree_assoc_cntnr<
-  pb_assoc::order_statistics_key<int>,
-  char,
-  pb_assoc::order_statistics_key_cmp<std::less<int> >,
-  pb_assoc::splay_tree_ds_tag,
-  pb_assoc::order_statistics_node_updator<int> >
-map_type;
-
-int
-main()
-{
-  typedef pb_assoc::order_statistics_key< int> int_order_statistics_key;
-
-  map_type s0;
-
-  // Insert some entries into s0.
-
-  s0.insert(make_pair(int_order_statistics_key(12), 'a'));
-  s0.insert(make_pair(int_order_statistics_key(505), 'b'));
-  s0.insert(make_pair(int_order_statistics_key(30), 'c'));
-
-  // The order of the keys should be: 12, 30, 505.
-
-  pb_assoc::find_by_order<map_type> by_order;
-
-  assert(by_order(s0, 0)->first == 12);
-  assert(by_order(s0, 1)->first == 30);
-  assert(by_order(s0, 2)->first == 505);
-
-  map_type s1;
-
-  // Insert some entries into s1.
-
-  s1.insert(make_pair(int_order_statistics_key(506), 'a'));
-  s1.insert(make_pair(int_order_statistics_key(1222), 'b'));
-  s1.insert(make_pair(int_order_statistics_key(3004), 'c'));
-
-  // Now join s0 and s1.
-
-  s0.join(s1);
-
-  // The order of the keys should be: 12, 30, 505.
-
-  assert(by_order(s0, 0)->first == 12);
-  assert(by_order(s0, 1)->first == 30);
-  assert(by_order(s0, 2)->first == 505);
-  assert(by_order(s0, 3)->first == 506);
-  assert(by_order(s0, 4)->first == 1222);
-  assert(by_order(s0, 5)->first == 3004);
-}
-
diff --git a/libstdc++-v3/testsuite/ext/pb_assoc/example/tree_split.cc b/libstdc++-v3/testsuite/ext/pb_assoc/example/tree_split.cc
deleted file mode 100644
index eb4e8a5cb20..00000000000
--- a/libstdc++-v3/testsuite/ext/pb_assoc/example/tree_split.cc
+++ /dev/null
@@ -1,90 +0,0 @@
-// -*- C++ -*-
-
-// Copyright (C) 2005 Free Software Foundation, Inc.
-//
-// This file is part of the GNU ISO C++ Library.  This library is free
-// software; you can redistribute it and/or modify it under the
-// terms of the GNU General Public License as published by the
-// Free Software Foundation; either version 2, or (at your option)
-// any later version.
-
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License along
-// with this library; see the file COPYING.  If not, write to the Free
-// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
-// USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction.  Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License.  This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
-
-// 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.
-
-/**
- * @file tree_split_example.cpp
- * A basic example showing how to split tree-based container objects.
- */
-
-// For rb_tree_assoc_cntnr.
-#include <ext/pb_assoc/assoc_cntnr.hpp>
-// For assert
-#include <cassert>
-
-int
-main()
-{
-  /*
-   * A red-black tree table mapping ints to chars.
-   */
-  typedef pb_assoc::tree_assoc_cntnr< int, char> map_t;
-
-  // A map_t object.
-  map_t r;
-
-  // Inserts some entries into r.
-
-  for (int i = 0; i < 100; ++ i)
-    r.insert(std::make_pair(i, 'a'));
-
-  // Now split r into a different map_t object.
-
-  // larger_r will hold the larger values following the split.
-  map_t larger_r;
-
-  // Split all elements larger than 1000 into larger_r. This is exception free.
-  r.split(1000, larger_r);
-
-  /*
-   * Since there were no elements larger than 1000, r
-   *	should be unchanged.
-   **/
-
-  assert(r.size() == 100);
-  assert(r.begin()->first == 0);
-
-  // Now perform a split which actually changes the content of r.
-
-  // Split all elements larger than 3 into larger_r.
-  r.split(3, larger_r);
-
-  assert(r.size() == 4);
-  assert(larger_r.begin()->first == 4);
-}
-
diff --git a/libstdc++-v3/testsuite/ext/pb_ds/example/assoc_container_traits.cc b/libstdc++-v3/testsuite/ext/pb_ds/example/assoc_container_traits.cc
new file mode 100644
index 00000000000..4946155a66e
--- /dev/null
+++ b/libstdc++-v3/testsuite/ext/pb_ds/example/assoc_container_traits.cc
@@ -0,0 +1,241 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file assoc_container_traits_example.cpp
+ * A basic example showing how to use container_traits for querying container types
+ *    for their behavior.
+ */
+
+/**
+ * The following example shows how to use container_traits in order to print
+ * out information on an associative container's behavior, e.g., its underlying
+ * data structure, or whether its objects guarantee storing entries sorted
+ * by key order.
+ */
+
+#include <iostream>
+#include <ext/pb_ds/assoc_container.hpp>
+#include <ext/pb_ds/tag_and_trait.hpp>
+
+using namespace std;
+using namespace pb_ds;
+using namespace pb_ds;
+
+template<class DS_Category>
+void
+print_container_category(DS_Category);
+
+template<>
+void
+print_container_category(cc_hash_tag)
+{
+  cout << "Collision-chaining hash based associative-container:" << endl;
+}
+
+template<>
+void
+print_container_category(gp_hash_tag)
+{
+  cout << "Probing hash based associative-container:" << endl;
+}
+
+template<>
+void
+print_container_category(rb_tree_tag)
+{
+  cout << "Red-black tree associative-container:" << endl;
+}
+
+template<>
+void
+print_container_category(splay_tree_tag)
+{
+  cout << "Splay tree associative-container:" << endl;
+}
+
+template<>
+void
+print_container_category(ov_tree_tag)
+{
+  cout << "Ordered-vector tree associative-container:" << endl;
+}
+
+template<>
+void
+print_container_category(list_update_tag)
+{
+  cout << "List-based associative-container:" << endl;
+}
+
+void
+print_erase_can_throw(bool can)
+{
+  if (can)
+    {
+      cout << "Erase can throw" << endl;
+      return;
+    }
+  cout << "Erase cannot throw" << endl;
+}
+
+void
+print_order_preserving(bool does)
+{
+  if (does)
+    {
+      cout << "Preserves order" << endl;
+      return;
+    }
+  cout << "Does not preserve order" << endl;
+}
+
+template<class Invalidation_Guarantee>
+void
+print_invalidation_guarantee(Invalidation_Guarantee);
+
+template<>
+void
+print_invalidation_guarantee(basic_invalidation_guarantee)
+{
+  cout << "Guarantees only that found references, pointers, and "
+    "iterators are valid as long as the container object is not "
+    "modified" << endl;
+}
+
+template<>
+void
+print_invalidation_guarantee(point_invalidation_guarantee)
+{
+  cout << "Guarantees that found references, pointers, and "
+    "point_iterators are valid even if the container object "
+    "is modified" << endl;
+}
+
+template<>
+void
+print_invalidation_guarantee(range_invalidation_guarantee)
+{
+  cout << "Guarantees that iterators remain valid even if the "
+    "container object is modified" << endl;
+}
+
+void
+print_reverse_iteration(bool does)
+{
+  if (does)
+    {
+      cout << "Supports reverse iteration" << endl;
+      return;
+    }
+  cout << "Does not support reverse iteration" << endl;
+}
+
+template<class DS_Traits>
+void
+print_container_attributes()
+{
+  // First print out the data structure category.
+  print_container_category(typename DS_Traits::container_category());
+
+  // Now print the attributes of the container.
+  print_erase_can_throw(DS_Traits::erase_can_throw);
+  print_order_preserving(DS_Traits::order_preserving);
+  print_invalidation_guarantee(typename DS_Traits::invalidation_guarantee());
+  print_reverse_iteration(DS_Traits::reverse_iteration);
+
+  cout << endl << endl;
+}
+
+int
+main()
+{
+  {
+    // Print the attributes of a collision-chaining hash table.
+    typedef cc_hash_table< int, char> t;
+    print_container_attributes<container_traits<t> >();
+  }
+
+  {
+    // Print the attributes of a (general) probing hash table.
+    typedef gp_hash_table< int, char> t;
+    print_container_attributes<container_traits<t> >();
+  }
+
+  {
+    // Print the attributes of a red-black tree.
+    typedef tree< int, char> t;
+    print_container_attributes<container_traits<t> >();
+  }
+
+  {
+    // Print the attributes of a splay tree.
+    typedef
+      tree<
+      int,
+      char,
+      less<int>,
+      splay_tree_tag>
+      t;
+
+    print_container_attributes<container_traits<t> >();
+  }
+
+  {
+    // Print the attributes of an ordered-vector tree.
+    typedef
+      tree<
+      int,
+      char,
+      less<int>,
+      ov_tree_tag>
+      t;
+    print_container_attributes<container_traits<t> >();
+  }
+
+  {
+    // Print the attributes of an list-based container.
+    typedef list_update< int, char> t;
+    print_container_attributes<container_traits<t> >();
+  }
+
+  return 0;
+}
diff --git a/libstdc++-v3/testsuite/ext/pb_ds/example/basic_map.cc b/libstdc++-v3/testsuite/ext/pb_ds/example/basic_map.cc
new file mode 100644
index 00000000000..cc3bbe3c352
--- /dev/null
+++ b/libstdc++-v3/testsuite/ext/pb_ds/example/basic_map.cc
@@ -0,0 +1,130 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file basic_map_example.cpp
+ * A basic example showing how to use maps.
+ */
+
+/**
+ * This example shows how to use "maps". It defines a
+ * function performing a sequence of operations on
+ * a generic container. It then calls this function with some containers.
+ */
+
+#include <iostream>
+#include <cassert>
+#include <ext/pb_ds/assoc_container.hpp>
+
+using namespace std;
+using namespace pb_ds;
+using namespace pb_ds;
+
+// The following function performs a sequence of operations on an
+// associative container object mapping integers to characters.
+template<class Cntnr>
+void
+some_op_sequence(Cntnr& r_c)
+{
+  assert(r_c.empty());
+  assert(r_c.size() == 0);
+
+  r_c.insert(make_pair(1, 'a'));
+
+  r_c[2] = 'b';
+
+  assert(!r_c.empty());
+  assert(r_c.size() == 2);
+
+  cout << "Key 1 is mapped to " << r_c[1] << endl;
+  cout << "Key 2 is mapped to " << r_c[2] << endl;
+
+  cout << endl << "All value types in the container:" << endl;
+
+  typedef typename Cntnr::const_iterator const_iterator;
+  for (const_iterator it = r_c.begin(); it != r_c.end(); ++it)
+    cout << it->first << " -> " << it->second << endl;
+  cout << endl;
+
+  r_c.clear();
+
+  assert(r_c.empty());
+  assert(r_c.size() == 0);
+}
+
+int main()
+{
+  {
+    // Perform operations on a collision-chaining hash map.
+    cc_hash_table<int, char> c;
+    some_op_sequence(c);
+  }
+
+  {
+    // Perform operations on a general-probing hash map.
+    gp_hash_table<int, char> c;
+    some_op_sequence(c);
+  }
+
+  {
+    // Perform operations on a red-black tree map.
+    tree<int, char> c;
+    some_op_sequence(c);
+  }
+
+  {
+    // Perform operations on a splay tree map.
+    tree<int, char, less<int>, splay_tree_tag> c;
+    some_op_sequence(c);
+  }
+
+  {
+    // Perform operations on an ov tree map.
+    tree<int, char, less<int>, ov_tree_tag> c;
+    some_op_sequence(c);
+  }
+
+  {
+    // Perform operations on a list-update map.
+    list_update<int, char> c;
+    some_op_sequence(c);
+  }
+}
diff --git a/libstdc++-v3/testsuite/ext/pb_ds/example/basic_multimap.cc b/libstdc++-v3/testsuite/ext/pb_ds/example/basic_multimap.cc
new file mode 100644
index 00000000000..77390809bb2
--- /dev/null
+++ b/libstdc++-v3/testsuite/ext/pb_ds/example/basic_multimap.cc
@@ -0,0 +1,162 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file basic_multimap_example.cpp
+ * A basic example showing how to use multimaps.
+ */
+
+/**
+ * This example shows how to use "multimaps" in the context of a simple
+ * bank account application. Each customer holds a bank account
+ * (or more than one) which holds some balance.
+ */
+
+#include <iostream>
+#include <string>
+#include <cassert>
+#include <ext/pb_ds/assoc_container.hpp>
+
+using namespace std;
+using namespace pb_ds;
+
+// A simple hash functor.
+// hash could serve instead of this functor, but it is not yet
+// standard everywhere.
+struct string_hash : public unary_function<string, size_t>
+{
+  inline size_t
+  operator()(const string& r_s) const
+  {
+    size_t ret = 0;
+    string::const_iterator b = r_s.begin();
+    string::const_iterator e = r_s.end();
+    while (b != e)
+      {
+	ret *= 5;
+	ret += static_cast<size_t>(*(b++));
+      }
+    return ret;
+  }
+};
+
+int main()
+{
+  // Each customer is identified by a string.
+  typedef string customer;
+
+  // Each account is identified by an unsigned long.
+  typedef unsigned long account_id;
+
+  // The balance in the account is a floating point.
+  typedef float balance_t;
+
+  /*
+   *  This is the data structure type used for storing information
+   *  about accounts. In this case the primary key is the customer,
+   *  and the secondary key is the account id.
+   *
+   *  A hash-based container maps each customer to a list-based
+   *  container that maps each account to the balance it holds.
+   *
+   *  Note that we could use any combination of primary and secondary
+   *  associative-containers. In this case we choose a hash-based
+   *  container for the primary keys, since we do not need to store
+   *  customers in a sorted order; we choos a list-based container for
+   *  the secondary keys, since we expect that the average number of
+   *  accounts per customer will be small.
+   */
+  typedef
+    cc_hash_table<
+    customer,
+    list_update<
+    account_id,
+    balance_t>,
+    string_hash>
+    accounts_t;
+
+  // This object will hold all information.
+  accounts_t acc;
+
+  // Customer "a" opens empty account 12.
+  acc["a"][12] = 0;
+
+  // Customer "a" deposits 45 into account 12.
+  acc["a"][12] += 45;
+
+  // Customer "b" opens account 13 with balance 12.3.
+  acc["b"][13] = 12.3;
+
+  // Customer "c" opens empty account 14.
+  acc["c"][14] = 0;
+
+  // Customer "a" opens account 160 with balance 142.
+  // Note that "a" already holds account 12.
+  acc["a"][160] = 142;
+
+  // Verify the number of accounts that "a" holds.
+  accounts_t::const_point_iterator it = acc.find("a");
+  assert(it != acc.end());
+  assert(it->second.size() == 2);
+
+  // The begining of the month has arrived. We need to give a 3%
+  // interest to all accounts with a positive balance.
+
+  // First we loop over all customers.
+  accounts_t::iterator cust_it;
+  for (cust_it = acc.begin(); cust_it != acc.end(); ++cust_it)
+    {
+      // For each customer, we loop over the customer's accounts.
+      accounts_t::mapped_type::iterator it;
+      for (it = cust_it->second.begin(); it != cust_it->second.end(); ++it)
+	if (it->second > 0)
+	  it->second *= 1.03;
+    }
+
+  // Customer "a" closes all accounts.
+  acc.erase("a");
+
+  // The bank now has only 2 customers.
+  assert(acc.size() == 2);
+
+  return 0;
+}
+
diff --git a/libstdc++-v3/testsuite/ext/pb_ds/example/basic_multiset.cc b/libstdc++-v3/testsuite/ext/pb_ds/example/basic_multiset.cc
new file mode 100644
index 00000000000..9b5d0aa069d
--- /dev/null
+++ b/libstdc++-v3/testsuite/ext/pb_ds/example/basic_multiset.cc
@@ -0,0 +1,175 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file basic_multiset_example.cpp
+ * A basic example showing how to use multisets.
+ */
+
+
+// This example shows how to use "multisets".
+
+// In this example we build a very simple priority queue that also can
+// be queried if an entry contains (i.e., it is slightly similar to an
+// associative container as well as a priority queue). The priority
+// queue adapts a "multiset".
+
+// (Note that there are more efficient ways for implementing this than
+// by adapting an associative container. This is just an example for
+// "multisets".)
+
+#include <iostream>
+#include <cassert>
+#include <ext/pb_ds/assoc_container.hpp>
+
+using namespace std;
+using namespace pb_ds;
+
+// A simple priority queue that also supports an "contains" query.
+class contains_pq
+{
+public:
+  // Pushes an integer.
+  void
+  push(int i);
+
+  // Pops the largest integer and returns it.
+  int
+  pop();
+
+  // Returns true iff i is contained in the container.
+  bool
+  contains(int i) const
+  { return m_tree.find(i) != m_tree.end(); }
+
+  // Returns true iff empty.
+  bool
+  empty() const
+  { return m_tree.empty(); }
+
+private:
+  // This is the container type we adapt - a "multiset".
+  // It maps each integer to the number of times it logically appears.
+  typedef
+  tree<
+  int,
+  size_t,
+  greater<
+  int> >
+  tree_t;
+
+private:
+  tree_t m_tree;
+};
+
+void
+contains_pq::
+push(int i)
+{
+  // To push i, we insert to the "multiset" that i appears 0 times
+  // (which is a no-op if i already is contained), then increment the
+  // number of times i is contained by 1.
+  ++m_tree.insert(make_pair(i, 0)).first->second;
+}
+
+int
+contains_pq::
+pop()
+{
+  assert(!empty());
+
+  // The element we need to pop must be the first one, since tree_t is
+  // an ordered container.
+  tree_t::iterator it = m_tree.begin();
+
+  const int i = it->first;
+
+  // Decrease the number of times the popped element appears in the
+  // container object. If it is 0 - we erase it.
+  if (--it->second == 0)
+    m_tree.erase(it);
+
+  return i;
+}
+
+int main()
+{
+  contains_pq cpq;
+
+  // First we push some elements.
+  cpq.push(4);
+  cpq.push(3);
+  cpq.push(2);
+  cpq.push(1);
+  cpq.push(4);
+
+  // Note that logically, 4 appears 2 times, and each of 1, 2, and 3
+  // appear once.
+  assert(cpq.contains(4));
+  assert(cpq.contains(3));
+  assert(cpq.contains(2));
+  assert(cpq.contains(1));
+
+  // Now pop the topmost element - it should be 4.
+  assert(cpq.pop() == 4);
+
+  // Now logically, each of 1, 2, 3, and 4 appear once.
+  assert(cpq.contains(4));
+
+  // We pop the topmost element - it should be 4.
+  assert(cpq.pop() == 4);
+
+  // 4 should not be contained any more.
+  assert(!cpq.contains(4));
+
+  assert(cpq.contains(3));
+  assert(cpq.contains(2));
+  assert(cpq.contains(1));
+
+  assert(cpq.pop() == 3);
+  assert(cpq.pop() == 2);
+  assert(cpq.pop() == 1);
+
+  assert(cpq.empty());
+
+  return 0;
+}
+
diff --git a/libstdc++-v3/testsuite/ext/pb_ds/example/basic_priority_queue.cc b/libstdc++-v3/testsuite/ext/pb_ds/example/basic_priority_queue.cc
new file mode 100644
index 00000000000..cc7641c2405
--- /dev/null
+++ b/libstdc++-v3/testsuite/ext/pb_ds/example/basic_priority_queue.cc
@@ -0,0 +1,130 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file basic_priority_queue_example.cpp
+ * A basic example showing how to use priority queues.
+ */
+
+/**
+ * This example shows how to use priority queues. It defines a
+ * function performing a sequence of operations on
+ * a generic container. It then calls this function with some containers.
+ */
+
+#include <cassert>
+#include <iostream>
+#include <ext/pb_ds/priority_queue.hpp>
+
+using namespace std;
+using namespace pb_ds;
+using namespace pb_ds;
+
+// The following function performs a sequence of operations on a
+// priority queue object storing integers.
+template<class Cntnr>
+void
+some_op_sequence(Cntnr& r_c)
+{
+  assert(r_c.empty());
+  assert(r_c.size() == 0);
+
+  for (size_t i = 0; i < 10; ++i)
+    r_c.push(i);
+  cout << endl << "All values in the container:" << endl;
+
+  typedef typename Cntnr::const_iterator const_iterator;
+  for (const_iterator it = r_c.begin(); it != r_c.end();  ++it)
+    cout <<* it << endl;
+  assert(!r_c.empty());
+  assert(r_c.size() == 10);
+
+  cout << "Popping all values: " << endl;
+  while (!r_c.empty())
+    {
+      cout << r_c.top() << endl;
+      r_c.pop();
+    }
+  assert(r_c.empty());
+  assert(r_c.size() == 0);
+
+  cout << endl;
+}
+
+int main()
+{
+  {
+    // Perform operations on a pairing-heap queue.
+    cout << "Pairing heap" << endl;
+    pb_ds::priority_queue<int, less<int>, pairing_heap_tag> c;
+    some_op_sequence(c);
+  }
+
+  {
+    // Perform operations on a binomial-heap queue.
+    cout << "Binomial heap" << endl;
+    pb_ds::priority_queue<int, less<int>, binomial_heap_tag> c;
+    some_op_sequence(c);
+  }
+
+  {
+    // Perform operations on a binomial-heap queue.
+    cout << "Redundant-counter binomial heap" << endl;
+    pb_ds::priority_queue<int, less<int>, rc_binomial_heap_tag> c;
+    some_op_sequence(c);
+  }
+
+  {
+    // Perform operations on a binomial-heap queue.
+    cout << "Binary heap" << endl;
+    pb_ds::priority_queue<int, less<int>, binary_heap_tag> c;
+    some_op_sequence(c);
+  }
+
+  {
+    // Perform operations on a thin-heap queue.
+    cout << "Thin heap" << endl;
+    pb_ds::priority_queue<int, less<int>, thin_heap_tag> c;
+    some_op_sequence(c);
+  }
+
+  return 0;
+}
diff --git a/libstdc++-v3/testsuite/ext/pb_ds/example/basic_set.cc b/libstdc++-v3/testsuite/ext/pb_ds/example/basic_set.cc
new file mode 100644
index 00000000000..733dca311d0
--- /dev/null
+++ b/libstdc++-v3/testsuite/ext/pb_ds/example/basic_set.cc
@@ -0,0 +1,137 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file basic_set_example.cpp
+ * A basic example showing how to use sets.
+ */
+
+/**
+ * This example shows how to use "sets". It defines a
+ * function performing a sequence of operations on
+ * a generic container. It then calls this function with some containers.
+ */
+
+#include <iostream>
+#include <cassert>
+#include <ext/pb_ds/assoc_container.hpp>
+#include <ext/pb_ds/tag_and_trait.hpp>
+
+using namespace std;
+using namespace pb_ds;
+using namespace pb_ds;
+
+// The following function performs a sequence of operations on an
+// associative container object storing integers.
+template<class Cntnr>
+void
+some_op_sequence(Cntnr& r_c)
+{
+  assert(r_c.empty());
+  assert(r_c.size() == 0);
+
+  r_c.insert(1);
+  r_c.insert(2);
+
+  assert(!r_c.empty());
+  assert(r_c.size() == 2);
+
+  cout << "All value types in the container:" << endl;
+  for (typename Cntnr::const_iterator it = r_c.begin(); it != r_c.end();
+       ++it)
+    cout <<* it << " ";
+
+  cout << endl;
+
+  r_c.clear();
+
+  assert(r_c.empty());
+  assert(r_c.size() == 0);
+}
+
+int main()
+{
+  {
+    // Perform operations on a collision-chaining hash set.
+    cc_hash_table<int, null_mapped_type> c;
+    some_op_sequence(c);
+  }
+
+  {
+    // Perform operations on a general-probing hash set.
+    gp_hash_table<int, null_mapped_type> c;
+    some_op_sequence(c);
+  }
+
+  {
+    // Perform operations on a red-black tree set.
+    tree<int, null_mapped_type> c;
+    some_op_sequence(c);
+  }
+
+  {
+    // Perform operations on a splay tree set.
+    tree<
+      int,
+      null_mapped_type,
+      less<int>,
+      splay_tree_tag> c;
+    some_op_sequence(c);
+  }
+
+  {
+    // Perform operations on a splay tree set.
+    tree<
+      int,
+      null_mapped_type,
+      less<int>,
+      ov_tree_tag> c;
+    some_op_sequence(c);
+  }
+
+  {
+    // Perform operations on a list-update set.
+    list_update<int, null_mapped_type> c;
+    some_op_sequence(c);
+  }
+
+  return 0;
+}
diff --git a/libstdc++-v3/testsuite/ext/pb_ds/example/erase_if.cc b/libstdc++-v3/testsuite/ext/pb_ds/example/erase_if.cc
new file mode 100644
index 00000000000..9142bd48377
--- /dev/null
+++ b/libstdc++-v3/testsuite/ext/pb_ds/example/erase_if.cc
@@ -0,0 +1,133 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file erase_if_example.cpp
+ * A basic example showing how to use erase_if.
+ */
+
+/**
+ * The following example shows how to use a conditional-erase
+ * method of associative containers to erase some of their entries.
+ */
+
+#include <iostream>
+#include <cassert>
+#include <ext/pb_ds/assoc_container.hpp>
+
+using namespace std;
+using namespace pb_ds;
+using namespace pb_ds;
+
+// The following functor takes a map's value-type object and returns
+// whether its key is between two numbers.
+struct between : public unary_function<pair<const int, char>, bool>
+{
+  // Constructor taking two numbers determining a range.
+  between(int b, int e) : m_b(b), m_e(e)
+  { assert(m_b < m_e); }
+
+  // Operator determining whether a value-type object's key is within
+  // the range.
+  inline bool
+  operator()(const pair<const int, char>& r_val)
+  { return r_val.first >= m_b&&  r_val.first < m_e; }
+
+private:
+  const int m_b;
+  const int m_e;
+};
+
+/**
+ * The following function performs a sequence of operations on an
+ * associative container object mapping integers to characters. Specifically
+ * it inserts 100 values and then uses a conditional-erase method to erase
+ * the values whose key is between 10 and 90.
+ */
+template<class Cntnr>
+void
+some_op_sequence(Cntnr r_c)
+{
+  assert(r_c.empty());
+  assert(r_c.size() == 0);
+
+  for (int i = 0; i < 100; ++i)
+    r_c.insert(make_pair(i, static_cast<char>(i)));
+  assert(r_c.size() == 100);
+
+  // Erase all values whose key is between 10 (inclusive) and 90
+  // (non-inclusive).
+  r_c.erase_if(between(10 , 90));
+
+  assert(!r_c.empty());
+  assert(r_c.size() == 20);
+}
+
+int main()
+{
+  // Perform operations on a list-update set.
+  some_op_sequence(list_update<int, char>());
+
+  // Perform operations on a collision-chaining hash set.
+  some_op_sequence(cc_hash_table<int, char>());
+
+  // Perform operations on a general-probing hash set.
+  some_op_sequence(gp_hash_table<int, char>());
+
+  // Perform operations on a red-black tree set.
+  some_op_sequence(tree<int, char>());
+
+  // Perform operations on a splay tree set.
+  some_op_sequence(tree<
+		   int,
+		   char,
+		   less<int>,
+		   splay_tree_tag>());
+
+  // Perform operations on a splay tree set.
+  some_op_sequence(tree<
+		   int,
+		   char,
+		   less<int>,
+		   ov_tree_tag>());
+
+  return 0;
+}
diff --git a/libstdc++-v3/testsuite/ext/pb_ds/example/hash_find_neg.cc b/libstdc++-v3/testsuite/ext/pb_ds/example/hash_find_neg.cc
new file mode 100644
index 00000000000..a38c7fb6b3f
--- /dev/null
+++ b/libstdc++-v3/testsuite/ext/pb_ds/example/hash_find_neg.cc
@@ -0,0 +1,79 @@
+// { dg-do compile }
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file hash_bad_find_example.cpp
+ * An example showing how *not* to use unordered containers.
+ */
+
+/**
+ * This non-compiling example shows wrong use of unordered
+ * associative-containers. These types of containers have distinct
+ * point-type and range-type iterator types.
+ **/
+
+#include <utility>
+#include <ext/pb_ds/assoc_container.hpp>
+
+using namespace std;
+using namespace pb_ds;
+
+int main()
+{
+  // A collision-chaining hash table mapping ints to chars.
+  typedef cc_hash_table<int, char> map_t;
+
+  // A map_t object.
+  map_t h;
+
+  // Insert a value mapping the int 1 to the char 'a'.
+  h.insert(make_pair(1, 'a'));
+
+  // Find the entry of the key '1' the* wrong* way.
+  // The following line will not compile, since map_t::find returns a
+  // point-iterator, which, by design, is not convertible to a
+  // range-iterator.
+  map_t::iterator it = h.find(1); // { dg-error "conversion from" }
+
+  return 0;
+}
+
diff --git a/libstdc++-v3/testsuite/ext/pb_ds/example/hash_illegal_resize.cc b/libstdc++-v3/testsuite/ext/pb_ds/example/hash_illegal_resize.cc
new file mode 100644
index 00000000000..9b3e7747488
--- /dev/null
+++ b/libstdc++-v3/testsuite/ext/pb_ds/example/hash_illegal_resize.cc
@@ -0,0 +1,137 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file hash_illegal_resize_example.cpp
+ * An example of illegally
+ *    externally resizing a hash-based container object.
+ */
+
+/**
+ * This example shows the case where a hash-based container object is
+ * resized to a value which it cannot accomodate at runtime. Illegal
+ * runtime resizes cause an exception.
+ */
+
+#include <ext/pb_ds/assoc_container.hpp>
+#include <ext/pb_ds/hash_policy.hpp>
+#include <ext/pb_ds/exception.hpp>
+#include <cassert>
+
+using namespace std;
+using namespace pb_ds;
+
+// A simple hash functor.
+// hash could serve instead of this functor, but it is not yet
+// standard everywhere.
+struct int_hash : public unary_function<int, size_t>
+{
+  inline size_t
+  operator()(const int& r_i) const
+  { return r_i; }
+};
+
+
+int main()
+{
+  // A probing hash table mapping ints to chars.
+  typedef
+    gp_hash_table<
+    int,
+    int,
+    int_hash,
+    equal_to<
+    int>,
+    // Combining function.
+    direct_mod_range_hashing<>,
+    // Probe function.
+    quadratic_probe_fn<>,
+    // Resize policy.
+    hash_standard_resize_policy<
+    hash_prime_size_policy,
+    hash_load_check_resize_trigger<>,
+    /* Allow external access to size.
+     *     Without setting this to true, external resizing
+     *     is not possible.
+     */
+    true> >
+    map_t;
+
+  map_t g;
+
+  // Insert some elements.
+  int i;
+
+  for (i = 0; i < 1000; ++i)
+    g[i] = 2*  i;
+
+  // Check all ok.
+  assert(g.size() == 1000);
+  for (i = 0; i < 1000; ++i)
+    assert(g.find(i) != g.end()&&  g.find(i)->second == 2*  i);
+
+  // Now attempt to resize the table to 200 (impossible).
+  bool ex_thrown = false;
+
+  try
+    {
+      g.resize(200);
+    }
+  catch(pb_ds::resize_error& )
+    {
+      ex_thrown = true;
+    }
+
+  // Assert an exception was thrown. A probing table cannot contain
+  // 1000 entries in less than 1000 places.
+  assert(ex_thrown);
+
+  // Irrespective of the fact that the resize was not successful, the
+  // container object should still be in a valid state; the following
+  // checks this.
+  // Check all ok.
+  assert(g.size() == 1000);
+  for (i = 0; i < 1000; ++i)
+    assert(g.find(i) != g.end()&&  g.find(i)->second == 2*  i);
+
+  return 0;
+}
+
diff --git a/libstdc++-v3/testsuite/ext/pb_ds/example/hash_initial_size.cc b/libstdc++-v3/testsuite/ext/pb_ds/example/hash_initial_size.cc
new file mode 100644
index 00000000000..5107657dac6
--- /dev/null
+++ b/libstdc++-v3/testsuite/ext/pb_ds/example/hash_initial_size.cc
@@ -0,0 +1,120 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file hash_initial_size_example.cpp
+ * An example of setting an initial size for a container object.
+ */
+
+/**
+ * This example shows how to set the initial size of a hash-based
+ * container object through its resize-policy object.
+ */
+
+#include <cassert>
+#include <ext/pb_ds/assoc_container.hpp>
+#include <ext/pb_ds/hash_policy.hpp>
+
+using namespace std;
+using namespace pb_ds;
+
+// A simple hash functor.
+// hash could serve instead of this functor, but it is not yet
+// standard everywhere.
+struct int_hash : public unary_function<int, size_t>
+{
+  inline size_t
+  operator()(const int& r_i) const
+  { return r_i; }
+};
+
+int main()
+{
+  // Resize policy type.
+  typedef
+    hash_standard_resize_policy<
+    // Size-policy type.
+    hash_exponential_size_policy<>,
+    // Trigger-policy type.
+    hash_load_check_resize_trigger<>,
+    /* Allow external access to size.
+     *     This is just used in this example for using the
+     *     get_actual_size method (which won't be accessible without
+     *     this flag.
+     */
+    true>
+    resize_policy_t;
+
+  // A collision-probing hash table mapping ints to chars.
+  typedef
+    gp_hash_table<
+    int,
+    char,
+    int_hash,
+    equal_to<
+    int>,
+    // Combining function.
+    direct_mask_range_hashing<>,
+    // Probe function.
+    linear_probe_fn<>,
+    // Resize policy.
+    resize_policy_t>
+    map_t;
+
+  // A resize-policy object with suggested initial size 256.
+  resize_policy_t res(hash_exponential_size_policy<>(256));
+
+  map_t g(int_hash(),
+	  equal_to<int>(),
+	  direct_mask_range_hashing<>(),
+	  linear_probe_fn<>(),
+	  res);
+
+  // Check the actual size of the container object. In this case, this
+  // should be the initial size given by the size policy object.
+  assert(g.get_actual_size() == 256);
+
+  // The logical size of g, though is 0 (it does not contain any elements).
+  assert(g.size() == 0);
+
+  return 0;
+}
+
diff --git a/libstdc++-v3/testsuite/ext/pb_ds/example/hash_load_set_change.cc b/libstdc++-v3/testsuite/ext/pb_ds/example/hash_load_set_change.cc
new file mode 100644
index 00000000000..f8132e8e8db
--- /dev/null
+++ b/libstdc++-v3/testsuite/ext/pb_ds/example/hash_load_set_change.cc
@@ -0,0 +1,141 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file hash_load_set_change_example.cpp
+ * An example of setting and changing the load factor of a hash-based
+ *    container object.
+ */
+
+/**
+ * This example shows how to set and change the load-factor of
+ * a hash-based container object through its resize-policy object.
+ */
+
+#include <functional>
+#include <cassert>
+#include <ext/pb_ds/assoc_container.hpp>
+#include <ext/pb_ds/hash_policy.hpp>
+
+using namespace std;
+using namespace pb_ds;
+
+// A simple hash functor.
+// hash could serve instead of this functor, but it is not yet
+// standard everywhere.
+struct int_hash : public unary_function<int, size_t>
+{
+  inline size_t
+  operator()(int i) const
+  { return i; }
+};
+
+int main()
+{
+  // A trigger policy type.
+  typedef hash_load_check_resize_trigger< true> trigger_t;
+
+  // A resize policy type.
+  typedef
+    hash_standard_resize_policy<
+    hash_exponential_size_policy<>,
+    // Trigger type.
+    trigger_t,
+    /* Allow external access to size.
+     * This is not necessary for setting the load factor,
+     * but it allows to call get_actual_size.
+     */
+    true>
+    resize_t;
+
+  // A collision-chaining hash table mapping ints to chars.
+  typedef
+    cc_hash_table<
+    int,
+    char,
+    int_hash,
+    equal_to<int>,
+    // Combining function.
+    direct_mask_range_hashing<>,
+    // Resize policy.
+    resize_t>
+    map_t;
+
+  // A trigger policy object with load between 0.3 and 0.8.
+  trigger_t trigger(static_cast<float>(0.3), static_cast<float>(0.8));
+
+  // A resize policy object with the above trigger.
+  resize_t resize(hash_exponential_size_policy<>(),
+		  trigger);
+
+  map_t r_c(int_hash(),
+	    equal_to<int>(),
+	    direct_mask_range_hashing<>(),
+	    resize);
+
+  r_c[1] = 'a';
+
+  // Check the loads and sizes.
+  assert(r_c.get_loads().first == static_cast<float>(0.3));
+  assert(r_c.get_loads().second == static_cast<float>(0.8));
+  assert(r_c.get_actual_size() == 8);
+  assert(r_c.size() == 1);
+
+  // Note that there is a discrepancy between the loads of the policy
+  // object and the actual size of the container object. This is
+  // because the container's construction performs an implicit
+  // external resize.
+  r_c[2] = 'b';
+  r_c[3] = 'c';
+  r_c[4] = 'd';
+
+  assert(r_c.get_actual_size() == 8);
+
+  // Change the loads. This causes (potentially) a resize.
+  r_c.set_loads(make_pair(static_cast<float>(0.01),
+			  static_cast<float>(0.05)));
+
+  // The actual size should really change in this case.
+  assert(r_c.get_actual_size() > 8);
+
+  return 0;
+}
+
diff --git a/libstdc++-v3/testsuite/ext/pb_ds/example/hash_mod.cc b/libstdc++-v3/testsuite/ext/pb_ds/example/hash_mod.cc
new file mode 100644
index 00000000000..500ed44724d
--- /dev/null
+++ b/libstdc++-v3/testsuite/ext/pb_ds/example/hash_mod.cc
@@ -0,0 +1,96 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file hash_mod_example.cpp
+ * An example showing how to use a mod range-hasing function
+ */
+
+/**
+ * This example shows how to use a hash-based container employing
+ * a modulo-based range-hashing function.
+ */
+
+#include <functional>
+#include <ext/pb_ds/assoc_container.hpp>
+#include <ext/pb_ds/hash_policy.hpp>
+
+using namespace std;
+using namespace pb_ds;
+
+// A simple hash functor.
+// hash could serve instead of this functor, but it is not yet
+// standard everywhere.
+struct int_hash : public unary_function<int, size_t>
+{
+  inline size_t
+  operator()(int i) const
+  { return i; }
+};
+
+int main()
+{
+  // In this case, we are worried that the key distribution will be
+  // skewed. We wish to use a more robust combining function.
+
+  // A collision-chaining hash table mapping ints to chars.
+  typedef
+    cc_hash_table<
+    int,
+    char,
+    int_hash,
+    equal_to<int>,
+    // Combining function.
+    direct_mod_range_hashing<> >
+    map_t;
+
+  map_t r_c;
+
+  // Use regularly.
+  r_c[32] = 'b';
+  r_c[1024] = 'c';
+  r_c[4096] = 'd';
+
+  // The above keys are all powers of 2. A mask combining function
+  // would hamper performance in such a case.
+  return 0;
+}
+
diff --git a/libstdc++-v3/testsuite/ext/pb_ds/example/hash_resize.cc b/libstdc++-v3/testsuite/ext/pb_ds/example/hash_resize.cc
new file mode 100644
index 00000000000..b6421bdaf99
--- /dev/null
+++ b/libstdc++-v3/testsuite/ext/pb_ds/example/hash_resize.cc
@@ -0,0 +1,135 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file hash_resize_example.cpp
+ * An example of externally resizing a map.
+ */
+
+/**
+ * This example shows how to externally manipulate the size of a hash-based
+ * container object throught its resize-policy object.
+ **/
+
+#include <functional>
+#include <cassert>
+#include <ext/pb_ds/assoc_container.hpp>
+#include <ext/pb_ds/hash_policy.hpp>
+
+using namespace std;
+using namespace pb_ds;
+
+// A simple hash functor.
+// hash could serve instead of this functor, but it is not yet
+// standard everywhere.
+struct int_hash : public unary_function<int, size_t>
+{
+  inline size_t
+  operator()(const int& r_i) const
+  { return r_i; }
+};
+
+int main()
+{
+  // A probing hash table mapping ints to chars.
+  typedef
+    gp_hash_table<
+    int,
+    char,
+    int_hash,
+    equal_to<
+    int>,
+    // Combining function.
+    direct_mask_range_hashing<>,
+    // Probe function.
+    linear_probe_fn<>,
+    // Resize policy.
+    hash_standard_resize_policy<
+    hash_exponential_size_policy<>,
+    hash_load_check_resize_trigger<>,
+    /* Allow external access to size.
+     * Without setting this to true, external resizing
+     * is not possible.
+     */
+    true> >
+    map_t;
+
+  map_t g;
+
+  // Check the actual size of the container object. In this case, this
+  // should be the initial size given by the size policy object.
+  assert(g.get_actual_size() == 8);
+
+  // Insert some elements.
+  g[1] = 'a';
+  g[2] = 'b';
+  g[3] = 'c';
+
+  // Now resize the table upward.
+  g.resize(200);
+
+  // Check the actual size of the container object. 
+  // For the policy used in this example, the nearest larger size than
+  // 200 is 256.
+  assert(g.get_actual_size() == 256);
+
+  g[67] = 'g';
+  g[22] = 'f';
+
+  // Regardless of the internal size, the logical size should be 5.
+  assert(g.size() == 5);
+
+  // Now resize the table downward.
+  g.resize(106);
+
+  // Check the actual size of the container object. 
+  // For the policy used in this example, the nearest larger size than
+  // 106 is 128.
+  assert(g.get_actual_size() == 128);
+
+  g[37] = 'f';
+
+  // Regardless of the internal size, the logical size should be 5.
+  assert(g.size() == 6);
+
+  return 0;
+}
+
diff --git a/libstdc++-v3/testsuite/ext/pb_ds/example/hash_resize_neg.cc b/libstdc++-v3/testsuite/ext/pb_ds/example/hash_resize_neg.cc
new file mode 100644
index 00000000000..908675cad1c
--- /dev/null
+++ b/libstdc++-v3/testsuite/ext/pb_ds/example/hash_resize_neg.cc
@@ -0,0 +1,74 @@
+// { dg-do compile }
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file hash_bad_resize_example.cpp
+ * An example showing how *not* to resize a hash-based container.
+ */
+
+/**
+ * This non-compiling example shows wrong use of hash-based
+ * containers. By default, resize policies don't allow external size
+ * access.
+ **/
+
+#include <ext/pb_ds/assoc_container.hpp>
+
+using namespace std;
+using namespace pb_ds;
+
+int main()
+{
+  // A collision-chaining hash table mapping ints to chars.
+  typedef cc_hash_table< int, char> map_t;
+
+  // A map_t object.
+  map_t h;
+
+  // The following line won't compile. The resize policy needs to be
+  // configured to allow external resize (by default, this is not
+  // available).
+  h.resize(20); // { dg-error "instantiated from" }
+}
+
+// { dg-error "invalid" "" { target *-*-* } 236 } 
+// { dg-excess-errors "member function" } 
diff --git a/libstdc++-v3/testsuite/ext/pb_ds/example/hash_shift_mask.cc b/libstdc++-v3/testsuite/ext/pb_ds/example/hash_shift_mask.cc
new file mode 100644
index 00000000000..33d00120d44
--- /dev/null
+++ b/libstdc++-v3/testsuite/ext/pb_ds/example/hash_shift_mask.cc
@@ -0,0 +1,118 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file hash_shift_mask_example.cpp
+ * An example showing how to write a range-hasing functor.
+ */
+
+/**
+ * In some rare cases, advance knowledge of the distribution of keys allows
+ * writing more efficient hash-related policies.
+ * In the rather simplistic case of the example, it is known in advance that
+ * all keys have 0 two lowest bits. The example shows how to write
+ * a range-hashing function disregarding the two lowest bits of the hash value.
+ */
+
+#include <functional>
+#include <ext/pb_ds/assoc_container.hpp>
+#include <ext/pb_ds/hash_policy.hpp>
+
+using namespace std;
+using namespace pb_ds;
+
+// A simple hash functor. hash could serve instead of this functor,
+// but it is not yet standard everywhere.
+struct simple_int_hash : public unary_function<int, size_t>
+{
+  inline size_t
+  operator()(int i) const
+  { return i; }
+};
+
+// A range-hashing function which shifts 2 bits right and then masks.
+class shift_two_mask_range_hashing : private direct_mask_range_hashing<>
+{
+public:
+  typedef size_t size_type;
+
+  // Swaps with a different instant.
+  void
+  swap(shift_two_mask_range_hashing& other)
+  { direct_mask_range_hashing<>::swap(other); }
+
+  // Called by the container when internally resized.
+  void
+  notify_resized(size_type size)
+  { direct_mask_range_hashing<>::notify_resized(size); }
+
+  // Given a hash value, returns a number in the range of the internal
+  // size of the container.
+  inline size_type
+  operator()(size_type hash) const
+  { return direct_mask_range_hashing<>::operator()(hash >> 2); }
+};
+
+int
+main()
+{
+  // A collision-chaining hash table mapping ints to chars.
+  typedef
+    cc_hash_table<
+    int,
+    char,
+    // Hash function.
+    simple_int_hash,
+    equal_to<int>,
+    // Range hashing function.
+    shift_two_mask_range_hashing>
+    map_t;
+
+  map_t h;
+
+  // Use normally.
+  h[16] = 'a';
+  h[256] = 'e';
+  h[4] = 'z';
+
+  return 0;
+}
+
diff --git a/libstdc++-v3/testsuite/ext/pb_ds/example/priority_queue_container_traits.cc b/libstdc++-v3/testsuite/ext/pb_ds/example/priority_queue_container_traits.cc
new file mode 100644
index 00000000000..f2f0e3b4280
--- /dev/null
+++ b/libstdc++-v3/testsuite/ext/pb_ds/example/priority_queue_container_traits.cc
@@ -0,0 +1,211 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file priority_queue_container_traits_example.cpp
+ * A basic example showing how to use container_traits for querying container types
+ *    for their behavior.
+ */
+
+/**
+ * The following example shows how to use container_traits in order to print
+ * out information on an priority queue's behavior, e.g., its underlying
+ * data structure.
+ */
+
+#include <iostream>
+#include <ext/pb_ds/priority_queue.hpp>
+#include <ext/pb_ds/tag_and_trait.hpp>
+
+using namespace std;
+using namespace pb_ds;
+using namespace pb_ds;
+
+template<class DS_Category>
+void
+print_container_category(DS_Category);
+
+template<>
+void
+print_container_category(binary_heap_tag)
+{ cout << "Binary heap:" << endl; }
+
+template<>
+void
+print_container_category(binomial_heap_tag)
+{ cout << "Binomial heap:" << endl; }
+
+template<>
+void
+print_container_category(rc_binomial_heap_tag)
+{ cout << "Redundant-counter binomial heap:" << endl; }
+
+template<>
+void
+print_container_category(pairing_heap_tag)
+{ cout << "Pairing heap:" << endl; }
+
+template<>
+void
+print_container_category(thin_heap_tag)
+{ cout << "Thin heap:" << endl; }
+
+template<class Invalidation_Guarantee>
+void
+print_invalidation_guarantee(Invalidation_Guarantee);
+
+template<>
+void
+print_invalidation_guarantee(basic_invalidation_guarantee)
+{
+  cout << "Guarantees only that found references, pointers, and "
+    "iterators are valid as long as the container object is not "
+    "modified" << endl;
+}
+
+template<>
+void
+print_invalidation_guarantee(point_invalidation_guarantee)
+{
+  cout << "Guarantees that found references, pointers, and "
+    "point_iterators are valid even if the container object "
+    "is modified" << endl;
+}
+
+template<>
+void
+print_invalidation_guarantee(range_invalidation_guarantee)
+{
+  cout << "Guarantees that iterators remain valid even if the "
+    "container object is modified" << endl;
+}
+
+void
+print_split_join_can_throw(bool can)
+{
+  if (can)
+    {
+      cout << "Can throw exceptions if split or joined" << endl;
+      return;
+    }
+  cout << "Cannot throw exceptions if split or joined" << endl;
+}
+
+template<class DS_Traits>
+void
+print_container_attributes()
+{
+  // First print out the data structure category.
+  print_container_category(typename DS_Traits::container_category());
+
+  // Now print the attributes of the container.
+  print_invalidation_guarantee(typename DS_Traits::invalidation_guarantee());
+  print_split_join_can_throw(DS_Traits::split_join_can_throw);
+  cout << endl << endl;
+}
+
+int main()
+{
+  {
+    // Print the attributes of a binary heap.
+    typedef
+      pb_ds::priority_queue<
+      int,
+      std::less<int>,
+      binary_heap_tag>
+      t;
+
+    print_container_attributes<container_traits<t> >();
+  }
+
+  {
+    // Print the attributes of a binomial heap.
+    typedef
+      pb_ds::priority_queue<
+      int,
+      std::less<int>,
+      binomial_heap_tag>
+      t;
+
+    print_container_attributes<container_traits<t> >();
+  }
+
+  {
+    // Print the attributes of a redundant-counter binomial heap.
+    typedef
+      pb_ds::priority_queue<
+      int,
+      std::less<int>,
+      rc_binomial_heap_tag>
+      t;
+
+    print_container_attributes<container_traits<t> >();
+  }
+
+  {
+    // Print the attributes of a pairing heap.
+    typedef
+      pb_ds::priority_queue<
+      int,
+      std::less<int>,
+      pairing_heap_tag>
+      t;
+
+    print_container_attributes<container_traits<t> >();
+  }
+
+  {
+    /**
+     *  Print the attributes of a thin heap.
+     */
+
+    typedef
+      pb_ds::priority_queue<
+      int,
+      std::less<int>,
+      thin_heap_tag>
+      t;
+
+    print_container_attributes<container_traits<t> >();
+  }
+
+  return 0;
+}
diff --git a/libstdc++-v3/testsuite/ext/pb_ds/example/priority_queue_dijkstra.cc b/libstdc++-v3/testsuite/ext/pb_ds/example/priority_queue_dijkstra.cc
new file mode 100644
index 00000000000..53a788d5d55
--- /dev/null
+++ b/libstdc++-v3/testsuite/ext/pb_ds/example/priority_queue_dijkstra.cc
@@ -0,0 +1,164 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file priority_queue_dijkstra_example.cpp
+ * A basic example showing how to cross reference a vector and a
+ * priority-queue for modify.
+ */
+
+/**
+ * This example shows how to cross-reference priority queues
+ * and a vector. I.e., using a vector to
+ * map keys to entries in a priority queue, and using the priority
+ * queue to map entries to the vector. The combination
+ * can be used for fast modification of keys.
+ *
+ * As an example, a very simple form of Diskstra's algorithm is used. The graph
+ * is represented by an adjacency matrix. Nodes and vertices are size_ts, and
+ * it is assumed that the minimal path between any two nodes is less than 1000.
+ */
+
+
+
+#include <vector>
+#include <iostream>
+#include <ext/pb_ds/priority_queue.hpp>
+
+using namespace std;
+using namespace pb_ds;
+using namespace pb_ds;
+
+// The value type of the priority queue.
+// The first entry is the node's id, and the second is the distance.
+typedef std::pair<size_t, size_t> pq_value;
+
+// Comparison functor used to compare priority-queue value types.
+struct pq_value_cmp : public binary_function<pq_value, pq_value, bool>
+{
+  inline bool
+  operator()(const pq_value& r_lhs, const pq_value& r_rhs) const
+  {
+    // Note that a value is considered smaller than a different value
+    // if its distance is* larger*. This is because by STL
+    // conventions, "larger" entries are nearer the top of the
+    // priority queue.
+    return r_rhs.second < r_lhs.second;
+  }
+};
+
+int main()
+{
+  enum
+    {
+      // Number of vertices is hard-coded in this example.
+      num_vertices = 5,
+      // "Infinity".
+      graph_inf = 1000
+    };
+
+  // The edge-distance matrix.
+  // For example, the distance from node 0 to node 1 is 5, and the
+  // distance from node 1 to node 0 is 2.
+  const size_t a_a_edge_legnth[num_vertices][num_vertices] =
+    {
+      {0, 5, 3, 7, 6},
+      {2, 0, 2, 8, 9},
+      {2, 1, 0, 8, 0},
+      {1, 8, 3, 0, 2},
+      {2, 3, 4, 2, 0}
+    };
+
+  // The priority queue type.
+  typedef pb_ds::priority_queue< pq_value, pq_value_cmp> pq_t;
+
+  // The priority queue object.
+  pq_t p;
+
+  // This vector contains for each node, a find-iterator into the
+  // priority queue.
+  vector<pq_t::point_iterator> a_it;
+
+  // First we initialize the data structures.
+
+  // For each node, we push into the priority queue a value
+  // identifying it with a distance of infinity.
+  for (size_t i = 0; i < num_vertices; ++i)
+    a_it.push_back(p.push(pq_value(i, graph_inf)));
+
+  // Now we take the initial node, in this case 0, and modify its
+  // distance to 0.
+  p.modify(a_it[0], pq_value(0, 0));
+
+  // The priority queue contains all vertices whose final distance has
+  // not been determined, so to finish the algorithm, we must loop
+  // until it is empty.
+  while (!p.empty())
+    {
+      // First we find the node whose distance is smallest.
+      const pq_value& r_v = p.top();
+      const size_t node_id = r_v.first;
+      const size_t dist = r_v.second;
+
+      // This is the node's final distance, so we can print it out.
+      cout << "The distance from 0 to " << node_id 
+	   << " is " << dist << endl;
+
+      // Now we go over the node's neighbors and "relax" the
+      // distances, if applicable.
+      for (size_t neighbor_i = 0; neighbor_i < num_vertices; ++neighbor_i)
+        {
+	  // Potentially, the distance to the neighbor is the distance
+	  // to the currently-considered node + the distance from this
+	  // node to the neighbor.
+	  const size_t pot_dist = dist + a_a_edge_legnth[node_id][neighbor_i];
+
+	  // "Relax" the distance (if appropriate) through modify.
+	  if (pot_dist < a_it[neighbor_i]->second)
+	    p.modify(a_it[neighbor_i], pq_value(neighbor_i, pot_dist));
+        }
+
+      // Done with the node, so we pop it.
+      p.pop();
+    }
+
+  return 0;
+}
diff --git a/libstdc++-v3/testsuite/ext/pb_ds/example/priority_queue_erase_if.cc b/libstdc++-v3/testsuite/ext/pb_ds/example/priority_queue_erase_if.cc
new file mode 100644
index 00000000000..b67c8aed5d9
--- /dev/null
+++ b/libstdc++-v3/testsuite/ext/pb_ds/example/priority_queue_erase_if.cc
@@ -0,0 +1,78 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file priority_queue_erase_if.cpp
+ * Example showing how to conditionally erase values from a priority queue.
+ */
+
+/**
+ * This example shows how to erase from a priority queue using erase_if.
+ */
+
+#include <functional>
+#include <iostream>
+#include <cassert>
+#include <ext/pb_ds/priority_queue.hpp>
+
+using namespace std;
+using namespace pb_ds;
+using namespace pb_ds;
+
+int
+main()
+{
+  pb_ds::priority_queue<int> p;
+
+  // First we insert some values into the container.
+  for (int i = 0; i < 1000; ++i)
+    p.push(i);
+
+  assert(p.top() == 999);
+
+  // Now we erase all values that satisfy some predicate, in this case
+  // one that returns true for all those larger than 500.
+  p.erase_if(bind1st(less<int>(), 500));
+
+  // The largest value should be now 500.
+  assert(p.top() == 500);
+}
+
diff --git a/libstdc++-v3/testsuite/ext/pb_ds/example/priority_queue_split_join.cc b/libstdc++-v3/testsuite/ext/pb_ds/example/priority_queue_split_join.cc
new file mode 100644
index 00000000000..e59cb34918d
--- /dev/null
+++ b/libstdc++-v3/testsuite/ext/pb_ds/example/priority_queue_split_join.cc
@@ -0,0 +1,135 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file priority_queue_split_join_example.cpp
+ * A basic example showing how to split and join priority queues.
+ */
+
+/**
+ * This example shows how to split and join priority queues.
+ */
+
+#include <functional>
+#include <iostream>
+#include <cassert>
+#include <ext/pb_ds/priority_queue.hpp>
+
+using namespace std;
+using namespace pb_ds;
+using namespace pb_ds;
+
+int
+main()
+{
+  // Two priority queue objects.
+  pb_ds::priority_queue<int> even_p, odd_p;
+
+  // First we insert some values: even ones into even_p, and odd ones
+  // into odd_p.
+  for (size_t i = 0; i < 10; ++i)
+    {
+      even_p.push(2*  i);
+      odd_p.push(2*  i + 1);
+    }
+
+  // Check that each one contains the appropriate 10 values.
+  assert(even_p.size() == 10);
+  assert(even_p.top() == 18);
+
+  // Print out the values.
+  cout << "Initial values in even priority queue:" << endl;
+  pb_ds::priority_queue<int>::const_iterator it;
+  for (it = even_p.begin(); it != even_p.end(); ++it)
+    cout <<* it << endl;
+
+  assert(odd_p.size() == 10);
+  assert(odd_p.top() == 19);
+
+  // Print out the values.
+  cout << "Initial values in odd priority queue:" << endl;
+  for (it = odd_p.begin(); it != odd_p.end(); ++it)
+    cout <<* it << endl;
+
+  // Now join the queues.
+  even_p.join(odd_p);
+
+  // Check that each one contains the appropriate values.
+
+  assert(even_p.size() == 20);
+  assert(even_p.top() == 19);
+
+  // Print out the values.
+  cout << "After-join values in even priority queue:" << endl;
+  for (it = even_p.begin(); it != even_p.end(); ++it)
+    cout <<* it << endl;
+
+  assert(odd_p.size() == 0);
+
+  // Print out the values.
+  cout << "After-join values in odd priority queue:" << endl;
+  for (it = odd_p.begin(); it != odd_p.end(); ++it)
+    cout <<* it << endl;
+
+  // Now split the queues.
+  even_p.split(bind2nd(modulus<int>(), 2), odd_p);
+
+  // Check that each one contains the appropriate 10 values.
+
+  assert(even_p.size() == 10);
+  assert(even_p.top() == 18);
+
+  // Print out the values.
+  cout << "After-split values in even priority queue:" << endl;
+  for (it = even_p.begin(); it != even_p.end(); ++it)
+    cout <<* it << endl;
+
+  assert(odd_p.size() == 10);
+  assert(odd_p.top() == 19);
+
+  // Print out the values.
+  cout << "After-split values in odd priority queue:" << endl;
+  for (it = odd_p.begin(); it != odd_p.end(); ++it)
+    cout <<* it << endl;
+
+  return 0;
+}
+
diff --git a/libstdc++-v3/testsuite/ext/pb_ds/example/priority_queue_xref.cc b/libstdc++-v3/testsuite/ext/pb_ds/example/priority_queue_xref.cc
new file mode 100644
index 00000000000..c718d1f86ff
--- /dev/null
+++ b/libstdc++-v3/testsuite/ext/pb_ds/example/priority_queue_xref.cc
@@ -0,0 +1,221 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file priority_queue_xref_example.cpp
+ * A basic example showing how to cross-reference priority queues and other
+ *    containers for erase.
+ */
+
+/**
+ * This example shows how to cross-reference priority queues
+ * and other containers. I.e., using an associative container to
+ * map keys to entries in a priority queue, and using the priority
+ * queue to map entries to the associative container. The combination
+ * can be used for fast operations involving both priorities and
+ * arbitrary keys.
+ *
+ * The most useful examples of this technique are usually from the
+ * field of graph algorithms (where erasing or modifying an arbitrary
+ * entry of a priority queue is sometimes necessary), but a full-blown
+ * example would be too long. Instead, this example shows a very simple
+ * version of Dijkstra's
+ */
+
+#include <iostream>
+#include <cassert>
+#include <ext/pb_ds/priority_queue.hpp>
+#include <ext/pb_ds/assoc_container.hpp>
+
+using namespace std;
+using namespace pb_ds;
+using namespace pb_ds;
+
+// A priority queue of integers, which supports fast pushes,
+// duplicated-int avoidance, and arbitrary-int erases.
+class mapped_priority_queue
+{
+public:
+
+  // Pushes an int into the container. If the key is already in, this
+  // is a no-op.
+  void
+  push(const int& r_str);
+
+  // Returns a const reference to the largest int in the container.
+  const int
+  top() const
+  {
+    assert(!empty());
+    return m_pq.top();
+  }
+
+  // Erases the largest int in the container.
+  void
+  pop();
+
+  // Erases an arbitrary int. If the int is not in the container, this
+  // is a no-op, and the return value is false.
+  bool
+  erase(const int& r_str);
+
+  bool
+  empty() const
+  { return m_pq.empty(); }
+
+  size_t
+  size() const
+  { return m_pq.size(); }
+
+private:
+  // A priority queue of strings.
+  typedef pb_ds::priority_queue< int> pq_t;
+
+  // A hash-table mapping strings to point_iterators inside the
+  // priority queue.
+  typedef cc_hash_table< int, pq_t::point_iterator> map_t;
+
+  pq_t m_pq;
+  map_t m_map;
+};
+
+void
+mapped_priority_queue::
+push(const int& r_str)
+{
+  // First check if the int is already in the container. If so, just return.
+  if (m_map.find(r_str) != m_map.end())
+    return;
+
+  // Push the int into the priority queue, and store a point_iterator to it.
+  pq_t::point_iterator pq_it = m_pq.push(r_str);
+
+  try
+    {
+      // Now make the map associate the int to the point_iterator.
+      m_map[r_str] = pq_it;
+    }
+  catch(...)
+    {
+      // If the above failed, we need to remove the int from the
+      // priority queue as well.
+      m_pq.erase(pq_it);
+      throw;
+    }
+}
+
+void
+mapped_priority_queue::
+pop()
+{
+  assert(!empty());
+
+  // Erase the int from the map.
+  m_map.erase(m_pq.top());
+
+  // ...then from the priority queue.
+  m_pq.pop();
+}
+
+bool
+mapped_priority_queue::
+erase(const int& r_str)
+{
+  map_t::point_iterator map_it = m_map.find(r_str);
+
+  // If the int is not in the map, this is a no-op.
+  if (map_it == m_map.end())
+    return false;
+
+  // Otherwise, we erase it from the priority queue.
+  m_pq.erase(map_it->second);
+
+  // ...then from the map.
+  m_map.erase(r_str);
+
+  return true;
+}
+
+int main()
+{
+  // Push some values into the container object.
+  mapped_priority_queue m;
+  m.push(1);
+  m.push(2);
+
+  // The following four operations are no-ops: 2 and 1 are already in
+  // the container.
+  m.push(2);
+  m.push(2);
+  m.push(2);
+  m.push(1);
+
+  m.push(10);
+  m.push(11);
+  m.push(12);
+
+  // The size should be 5, since m contains the set {1, 2, 10, 11, 12}.
+  assert(m.size() == 5);
+
+  // The largest value should be 12.
+  assert(m.top() == 12);
+
+  // Now erase some values.
+
+  // Erasing 1 actually erases a value.
+  assert(m.erase(1));
+
+  // ...but erasing 1 again is a no-op.
+  assert(!m.erase(1));
+
+  // The size should be 5, since m contains the set {2, 10, 11, 12}.
+  assert(m.size() == 4);
+
+  // Now print the values in the container.
+  while (!m.empty())
+    {
+      cout << m.top() << endl;
+      m.pop();
+    }
+
+  return 0;
+}
+
diff --git a/libstdc++-v3/testsuite/ext/pb_ds/example/ranged_hash.cc b/libstdc++-v3/testsuite/ext/pb_ds/example/ranged_hash.cc
new file mode 100644
index 00000000000..4dc3721ad91
--- /dev/null
+++ b/libstdc++-v3/testsuite/ext/pb_ds/example/ranged_hash.cc
@@ -0,0 +1,162 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file ranged_hash_example.cpp
+ * A basic example showing how to write a ranged-hash functor.
+ */
+
+/**
+ * In some cases it is beneficial to write a hash function which determines
+ * hash values based on the size of the container object.
+ * The example shows an example of a string-hashing function which
+ * uses a fast method for hashing strings when the number of strings
+ * in the container object is small, and a slower but more careful method
+ * for hashing strings when the number of strings in the container object
+ * is large.
+ */
+
+#include <functional>
+#include <cassert>
+#include <string>
+#include <ext/pb_ds/assoc_container.hpp>
+#include <ext/pb_ds/hash_policy.hpp>
+
+using namespace std;
+using namespace pb_ds;
+using namespace pb_ds;
+
+/**
+ * A (somewhat simplistic) ranged-hash function for strings.
+ * It uses the size of the container object to determine
+ * the hashing method. For smaller sizes it uses a simple hash function;
+ * for larger sizes it uses a more complicated hash function.
+ */
+class simple_string_ranged_hash_fn 
+  : public unary_function<string, size_t>
+{
+public:
+  typedef size_t size_type;
+
+  simple_string_ranged_hash_fn() : m_container_size(0) { }
+
+  // Called to notify that the size has changed.
+  void
+  notify_resized(size_t size)
+  { m_container_size = size; }
+
+  // Called for hashing a string into a size_t in a given range.
+  size_t
+  operator()(const string& r_string)
+  {
+    /*
+     *  This (simplified) hash algorithm decides that if there are
+     *  fewer than 100 strings in the container it will hash
+     *  a string by summing its characters; otherwise, it will
+     *  perform a more complicated operation in order to produce
+     *  hash values with fewer collisions.
+     */
+    string::const_iterator it = r_string.begin();
+    size_t hash = 0;
+    if (m_container_size < 100)
+      {
+	// For this size, perform an accumulate type of operation.
+	while (it != r_string.end())
+	  hash += static_cast<size_t>(*it++);
+      }
+    else
+      {
+	// For this size, perform a different operation.
+	while (it != r_string.end())
+	  {
+	    hash += static_cast<size_t>(*it++);
+	    hash *= 5;
+	  }
+      }
+
+    // The function must, by whatever means, return a size in the
+    // range 0 to m_container_size.
+    return hash % m_container_size;
+  }
+
+  // Swaps content.
+  void
+  swap(simple_string_ranged_hash_fn& other)
+  {
+    std::swap(m_container_size, other.m_container_size);
+  }
+
+private:
+  // Records the size of the container object.
+  size_t m_container_size;
+};
+
+int
+main()
+{
+  // A collision-chaining hash table storing strings.
+  typedef
+    cc_hash_table<
+    string,
+    null_mapped_type,
+    null_hash_fn,
+    equal_to<string>,
+    simple_string_ranged_hash_fn>
+    set_t;
+
+  // Note that in the above, the library determines a resize policy
+  // appropriate for modulo-based range hashing.
+  set_t h;
+
+  // Use the table normally.
+  h.insert("Hello, ");
+  h.insert("world");
+
+  assert(h.size() == 2);
+
+  assert(h.find("Hello, ") != h.end());
+  assert(h.find("world") != h.end());
+
+  assert(h.find("Goodbye, oh cruel world!") == h.end());
+
+  return 0;
+}
+
diff --git a/libstdc++-v3/testsuite/ext/pb_ds/example/store_hash.cc b/libstdc++-v3/testsuite/ext/pb_ds/example/store_hash.cc
new file mode 100644
index 00000000000..11ef830cf7c
--- /dev/null
+++ b/libstdc++-v3/testsuite/ext/pb_ds/example/store_hash.cc
@@ -0,0 +1,107 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file store_hash_example.cpp
+ * An example showing how to store hash-values with
+ *     each entry in a hash-based container.
+ */
+
+/**
+ * This example shows how to configure a hash-based container to store
+ * the hash value of each key along with each entry. This technique
+ * is useful for complex keys (e.g., strings in this example), since
+ * it lowers the cost of collisions. For simpler types (e.g., integers),
+ * where the cost of comparing keys is of the same order as the cost
+ * of comparing hash values, this technique adds unnecessary overhead.
+ */
+
+#include <functional>
+#include <string>
+#include <ext/pb_ds/assoc_container.hpp>
+#include <ext/pb_ds/hash_policy.hpp>
+
+using namespace std;
+using namespace pb_ds;
+
+// A string hash functor.
+struct string_hash : public unary_function<string, size_t>
+{
+  inline size_t
+  operator()(string str) const
+  {
+    string::const_iterator b = str.begin();
+    string::const_iterator e = str.end();
+
+    size_t hash = 0;
+    while (b != e)
+      {
+	hash *= 5;
+	hash += static_cast<size_t>(*b);
+	++b;
+      }
+    return hash;
+  }
+};
+
+int main()
+{
+  // A collision-chaining hash table mapping strings to ints.
+  typedef
+    cc_hash_table<
+    string,
+    int,
+    string_hash,
+    equal_to<string>,
+    direct_mask_range_hashing<>,
+    hash_standard_resize_policy<>,
+    true>
+    map_t;
+
+  map_t h;
+
+  // Use regularly.
+  h["Hello, "] = 0;
+  h["world"] = 1;
+
+  return 0;
+}
+
diff --git a/libstdc++-v3/testsuite/ext/pb_ds/example/tree_intervals.cc b/libstdc++-v3/testsuite/ext/pb_ds/example/tree_intervals.cc
new file mode 100644
index 00000000000..e82150de2b4
--- /dev/null
+++ b/libstdc++-v3/testsuite/ext/pb_ds/example/tree_intervals.cc
@@ -0,0 +1,223 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file tree_intervals_example.cpp
+ * An example showing how to augment a trees to support operations involving
+ *    line intervals.
+ */
+
+/**
+ * In some cases tree structure can be used for various purposes other
+ * than storing entries by key order.  This example shows how a
+ * tree-based container can be used for geometric-line intersection
+ * determination. That is, the key of the container is a pair of
+ * numbers representing a line interval. The container object can be
+ * used to query whether a line interval intersects any line interval
+ * it currently stores.
+ *
+ * This type of problem arises not only in geometric applications, but
+ * also sometimes in distributed filesystems. Assume that "leases" are
+ * taken for parts of files or LUNs. When a new lease is requested, it
+ * is necessary to check that it does not conflict with a lease
+ * already taken. In this case a file or LUN can be envisioned as a
+ * line segment; leases requested and granted for contiguous parts of
+ * the file or LUN can be represented as line intervals as well.
+ */
+
+#include <cassert>
+#include <cstdlib>
+#include <ext/pb_ds/assoc_container.hpp>
+
+using namespace std;
+using namespace pb_ds;
+using namespace pb_ds;
+
+// Following are definitions of line intervals and functors operating
+// on them. As the purpose of this example is node invariants, and not
+// computational-geometry algorithms per-se, some simplifications are
+// made (e.g., intervals are defined by unsigned integers, and not by
+// a parameterized type, data members are public, etc.).
+
+// An interval of unsigned integers.
+typedef pair< unsigned int, unsigned int> interval;
+
+// Functor updating maximal endpoints of entries. Algorithm taken from
+// "Introduction to Algorithms" by Cormen, Leiserson, and Rivest.
+template<class Const_Node_Iterator,
+	 class Node_Iterator,
+	 class Cmp_Fn,
+	 class Allocator>
+struct intervals_node_update
+{
+public:
+  // The metadata that each node stores is the largest endpoint of an
+  // interval in its subtree. In this case, this is an unsigned int.
+  typedef unsigned int metadata_type;
+
+  // Checks whether a set of intervals contains at least one interval
+  // overlapping some interval. Algorithm taken from "Introduction to
+  // Algorithms" by Cormen, Leiserson, and Rivest.
+  bool
+  overlaps(const interval& r_interval)
+  {
+    Const_Node_Iterator nd_it = node_begin();
+    Const_Node_Iterator end_it = node_end();
+
+    while (nd_it != end_it)
+      {
+	// Check whether r_interval overlaps the current interval.
+	if (r_interval.second >= (*nd_it)->first&&
+	    r_interval.first <= (*nd_it)->second)
+	  return true;
+
+	// Get the const node iterator of the node's left child.
+	Const_Node_Iterator l_nd_it = nd_it.get_l_child();
+
+	// Calculate the maximal endpoint of the left child. If the
+	// node has no left child, then this is the node's maximal
+	// endpoint.
+	const unsigned int l_max_endpoint =(l_nd_it == end_it)?
+	  0 : l_nd_it.get_metadata();
+
+	// Now use the endpoint to determine which child to choose.
+	if (l_max_endpoint >= r_interval.first)
+	  nd_it = l_nd_it;
+	else
+	  nd_it = nd_it.get_r_child();
+      }
+
+    return false;
+  }
+
+protected:
+  // Update predicate: nd_it is a node iterator to the node currently
+  // updated; end_nd_it is a const node iterator to a just-after leaf
+  // node.
+  inline void
+  operator()(Node_Iterator nd_it, Const_Node_Iterator end_nd_it)
+  {
+    // The left maximal endpoint is 0 if there is no left child.
+    const unsigned int l_max_endpoint =(nd_it.get_l_child() == end_nd_it)?
+      0 : nd_it.get_l_child().get_metadata();
+
+    // The right maximal endpoint is 0 if there is no right child.
+    const unsigned int r_max_endpoint =(nd_it.get_r_child() == end_nd_it)?
+      0 : nd_it.get_r_child().get_metadata();
+
+    // The maximal endpoint is the endpoint of the node's interval,
+    // and the maximal endpoints of its children.
+    const_cast<unsigned int&>(nd_it.get_metadata()) =
+      max((*nd_it)->second, max<unsigned int>(l_max_endpoint, r_max_endpoint));
+  }
+
+  virtual Const_Node_Iterator
+  node_begin() const = 0;
+
+  virtual Const_Node_Iterator
+  node_end() const = 0;
+
+  virtual
+  ~intervals_node_update()
+  { }
+};
+
+// The following function performs some operation sequence on a
+// generic associative container supporting order statistics. It
+// inserts some intervals, and checks for overlap.
+template<class Cntnr>
+void
+some_op_sequence(Cntnr r_c)
+{
+  // Insert some entries.
+  r_c.insert(make_pair(0, 100));
+  r_c.insert(make_pair(150, 160));
+  r_c.insert(make_pair(300, 1000));
+  r_c.insert(make_pair(10000, 100000));
+  r_c.insert(make_pair(200, 100200));
+
+  // Test overlaps.
+
+  // Overlaps 150 - 160
+  assert(r_c.overlaps(make_pair(145, 165)) == true);
+  // Overlaps 150 - 160
+  assert(r_c.overlaps(make_pair(145, 155)) == true);
+  assert(r_c.overlaps(make_pair(165, 175)) == false);
+  assert(r_c.overlaps(make_pair(100201, 100203)) == false);
+
+  // Erase an interval
+  r_c.erase(make_pair(150, 160));
+
+  // Test overlaps again.
+  assert(r_c.overlaps(make_pair(145, 165)) == false);
+  assert(r_c.overlaps(make_pair(165, 175)) == false);
+  assert(r_c.overlaps(make_pair(0, 300000)) == true);
+}
+
+int main()
+{
+  // Test a red-black tree.
+  some_op_sequence(tree<
+		   interval,
+		   null_mapped_type,
+		   less<interval>,
+		   rb_tree_tag,
+		   intervals_node_update>());
+
+  // Test an ordered-vector tree.
+  some_op_sequence(tree<
+		   interval,
+		   null_mapped_type,
+		   less<interval>,
+		   ov_tree_tag,
+		   intervals_node_update>());
+
+  // Test a splay tree.
+  some_op_sequence(tree<
+		   interval,
+		   null_mapped_type,
+		   less<interval>,
+		   splay_tree_tag,
+		   intervals_node_update>());
+
+  return 0;
+}
+
diff --git a/libstdc++-v3/testsuite/ext/pb_ds/example/tree_join.cc b/libstdc++-v3/testsuite/ext/pb_ds/example/tree_join.cc
new file mode 100644
index 00000000000..795456ab6d5
--- /dev/null
+++ b/libstdc++-v3/testsuite/ext/pb_ds/example/tree_join.cc
@@ -0,0 +1,129 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file tree_join_example.cpp
+ * An example showing how to join splay_tree_map objects.
+ *    The code in the example is relevant to red-black trees as well.
+ */
+
+/**
+ * This example shows how to join tree based containers, i.e., taking two
+ *     objects with non-overlapping sets of keys and combining them into
+ *    a single object.
+ */
+
+// For tree
+#include <ext/pb_ds/assoc_container.hpp>
+// For join_error exception.
+#include <ext/pb_ds/exception.hpp>
+// For assert
+#include <cassert>
+
+using namespace std;
+using namespace pb_ds;
+using namespace pb_ds;
+
+int main()
+{
+  /*
+   *  
+   */
+  // A splay tree table mapping ints to chars.
+  typedef
+    tree<
+    int,
+    char,
+    less<
+    int>,
+    splay_tree_tag>
+    map_t;
+
+  // Two map_t object.
+  map_t h0, h1;
+
+  // Insert some values into the first table.
+  for (int i0 = 0; i0 < 100; ++i0)
+    h0.insert(make_pair(i0, 'a'));
+
+  // Insert some values into the second table.
+  for (int i1 = 0; i1 < 100; ++i1)
+    h1.insert(make_pair(1000 + i1, 'b'));
+
+  // Since all the elements in h0 are smaller than those in h1, it is
+  // possible to join the two tables. This is exception free.
+  h0.join(h1);
+
+  // Check that h0 should now contain all entries, and h1 should be empty.
+  assert(h0.size() == 200);
+  assert(h1.empty());
+
+
+  // Two other map_t objects.
+  map_t h2, h3;
+
+  h2[1] = 'a';
+  h2[3] = 'c';
+
+  h3[2] = 'b';
+
+  // Now perform an illegal join.
+  // It is not true that all elements in h2 are smaller than those in
+  // h3, nor is it true that they are all larger. Hence, attempting to
+  // join h2, and h3 should result in an exception.
+  bool exception_thrown = false;
+  try
+    {
+      h2.join(h3);
+    }
+  catch (pb_ds::join_error& )
+    {
+      exception_thrown = true;
+    }
+  assert(exception_thrown);
+
+  // Since the operation was not performed, the tables should be unaltered.
+  assert(h2.size() == 2);
+  assert(h3[2] == 'b');
+
+  return 0;
+}
+
diff --git a/libstdc++-v3/testsuite/ext/pb_ds/example/tree_order_statistics.cc b/libstdc++-v3/testsuite/ext/pb_ds/example/tree_order_statistics.cc
new file mode 100644
index 00000000000..30ae3091224
--- /dev/null
+++ b/libstdc++-v3/testsuite/ext/pb_ds/example/tree_order_statistics.cc
@@ -0,0 +1,135 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file tree_order_statistics_example.cpp
+ * An example showing how to use functors for order-statistics
+ *    in tree-based containers.
+ */
+
+/**
+ * In some cases tree structure can be used for various purposes asides
+ *    from storing entries by key order.
+ *    This example shows how a tree-based container can be used for
+ *    order-statistics, i.e., for determining the order of each key
+ *     in the (ordered) sequence of keys stored within the container object.
+ */
+
+#include <cassert>
+#include <ext/pb_ds/assoc_container.hpp>
+#include <ext/pb_ds/tree_policy.hpp>
+
+using namespace std;
+using namespace pb_ds;
+using namespace pb_ds;
+
+// A red-black tree table storing ints and their order
+// statistics. Note that since the tree uses
+// tree_order_statistics_node_update as its update policy, then it
+// includes its methods by_order and order_of_key.
+typedef
+tree<
+  int,
+  null_mapped_type,
+  less<int>,
+  rb_tree_tag,
+  // This policy updates nodes' metadata for order statistics.
+  tree_order_statistics_node_update>
+set_t;
+
+int main()
+{
+  // Insert some entries into s.
+  set_t s;
+  s.insert(12);
+  s.insert(505);
+  s.insert(30);
+  s.insert(1000);
+  s.insert(10000);
+  s.insert(100);
+
+  // The order of the keys should be: 12, 30, 100, 505, 1000, 10000.
+  assert(*s.find_by_order(0) == 12);
+  assert(*s.find_by_order(1) == 30);
+  assert(*s.find_by_order(2) == 100);
+  assert(*s.find_by_order(3) == 505);
+  assert(*s.find_by_order(4) == 1000);
+  assert(*s.find_by_order(5) == 10000);
+  assert(s.find_by_order(6) == s.end());
+
+  // The order of the keys should be: 12, 30, 100, 505, 1000, 10000.
+  assert(s.order_of_key(10) == 0);
+  assert(s.order_of_key(12) == 0);
+  assert(s.order_of_key(15) == 1);
+  assert(s.order_of_key(30) == 1);
+  assert(s.order_of_key(99) == 2);
+  assert(s.order_of_key(100) == 2);
+  assert(s.order_of_key(505) == 3);
+  assert(s.order_of_key(1000) == 4);
+  assert(s.order_of_key(10000) == 5);
+  assert(s.order_of_key(9999999) == 6);
+
+  // Erase an entry.
+  s.erase(30);
+
+  // The order of the keys should be: 12, 100, 505, 1000, 10000.
+  assert(*s.find_by_order(0) == 12);
+  assert(*s.find_by_order(1) == 100);
+  assert(*s.find_by_order(2) == 505);
+  assert(*s.find_by_order(3) == 1000);
+  assert(*s.find_by_order(4) == 10000);
+  assert(s.find_by_order(5) == s.end());
+
+  // The order of the keys should be: 12, 100, 505, 1000, 10000.
+  assert(s.order_of_key(10) == 0);
+  assert(s.order_of_key(12) == 0);
+  assert(s.order_of_key(100) == 1);
+  assert(s.order_of_key(505) == 2);
+  assert(s.order_of_key(707) == 3);
+  assert(s.order_of_key(1000) == 3);
+  assert(s.order_of_key(1001) == 4);
+  assert(s.order_of_key(10000) == 4);
+  assert(s.order_of_key(100000) == 5);
+  assert(s.order_of_key(9999999) == 5);
+
+  return 0;
+}
+
diff --git a/libstdc++-v3/testsuite/ext/pb_ds/example/tree_order_statistics_join.cc b/libstdc++-v3/testsuite/ext/pb_ds/example/tree_order_statistics_join.cc
new file mode 100644
index 00000000000..74fe8382cdc
--- /dev/null
+++ b/libstdc++-v3/testsuite/ext/pb_ds/example/tree_order_statistics_join.cc
@@ -0,0 +1,104 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file tree_order_statistics_join_example.cpp
+ * An example showing how to augment a splay tree to support order statistics.
+ */
+
+// This example shows how join operations still maintain node
+// invariants. Specifically, it shows how the objects of containers
+// supporting order statistics can be joined into an object supporting
+// order statistics.
+// While the example does not show this, the same holds for split operations.
+
+#include <cassert>
+#include <ext/pb_ds/assoc_container.hpp>
+#include <ext/pb_ds/tree_policy.hpp>
+
+using namespace std;
+using namespace pb_ds;
+using namespace pb_ds;
+
+// A splay tree table mapping ints to chars and storing the ints order
+// statistics.
+typedef
+tree<
+  int,
+  char,
+  less<int>,
+  splay_tree_tag,
+  tree_order_statistics_node_update>
+tree_map_t;
+
+int main()
+{
+  // Insert some entries into s0.
+  tree_map_t s0;
+  s0.insert(make_pair(12, 'a'));
+  s0.insert(make_pair(505, 'b'));
+  s0.insert(make_pair(30, 'c'));
+
+  // The order of the keys should be: 12, 30, 505.
+  assert(s0.find_by_order(0)->first == 12);
+  assert(s0.find_by_order(1)->first == 30);
+  assert(s0.find_by_order(2)->first == 505);
+
+  // Insert some entries into s1.
+  tree_map_t s1;
+  s1.insert(make_pair(506, 'a'));
+  s1.insert(make_pair(1222, 'b'));
+  s1.insert(make_pair(3004, 'a'));
+
+  // Now join s0 and s1.
+  s0.join(s1);
+
+  // The order of the keys should be: 12, 30, 505, 506, 1222, 3004.
+  assert(s0.find_by_order(0)->first == 12);
+  assert(s0.find_by_order(1)->first == 30);
+  assert(s0.find_by_order(2)->first == 505);
+  assert(s0.find_by_order(3)->first == 506);
+  assert(s0.find_by_order(4)->first == 1222);
+  assert(s0.find_by_order(5)->first == 3004);
+
+  return 0;
+}
+
diff --git a/libstdc++-v3/testsuite/ext/pb_ds/example/trie_dna.cc b/libstdc++-v3/testsuite/ext/pb_ds/example/trie_dna.cc
new file mode 100644
index 00000000000..c1f23d524c4
--- /dev/null
+++ b/libstdc++-v3/testsuite/ext/pb_ds/example/trie_dna.cc
@@ -0,0 +1,127 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file trie_dna_example.cpp
+ * An example showing how to use a trie for storing DNA strings.
+ */
+
+/**
+ * This example shows how to use a PATRICIA trie for storing
+ DNA strings. The main point is writing element-access traits
+ for these strings.
+*/
+
+#include <cassert>
+#include <iostream>
+#include <ext/pb_ds/assoc_container.hpp>
+#include <ext/pb_ds/trie_policy.hpp>
+
+using namespace std;
+using namespace pb_ds;
+
+// DNA is represented by a string.
+typedef string dna_t;
+
+// Following is an element access traits for a DNA string.
+struct dna_string_e_access_traits
+{
+public:
+  typedef size_t size_type;
+  typedef dna_t key_type;
+  typedef const key_type& const_key_reference;
+  typedef char e_type;
+  typedef string::const_iterator const_iterator;
+
+  enum
+    {
+      // Number of distinct elements. This is 4 = |{'A', 'C', 'G', 'T'}|
+      max_size = 4
+    };
+
+  // Returns a const_iterator to the firstelement of r_key.
+  inline static const_iterator
+  begin(const_key_reference r_key)
+  { return r_key.begin(); }
+
+  // Returns a const_iterator to the after-lastelement of r_key.
+  inline static const_iterator
+  end(const_key_reference r_key)
+  { return r_key.end(); }
+
+  // Maps an element to a position.
+  inline static size_t
+  e_pos(e_type e)
+  {
+    switch(e)
+      {
+      case 'A':
+	return 0;
+      case 'C':
+	return 1;
+      case 'G':
+	return 2;
+      case 'T':
+	return 3;
+      default:
+	abort();
+      };
+  }
+};
+
+// A PATRICIA trie with DNA string element-access traits.
+typedef dna_string_e_access_traits traits_type;
+typedef trie<dna_t, string, traits_type> trie_type;
+
+int main()
+{
+  trie_type t;
+
+  // Now map some DNAs to diseases in namespace STD.
+  t["ACCGGTTACTGGTA"] = "gonorrhea";
+  t["CCGTTATCGGTA"] = "syphlis";
+
+  // Check gonorrhea already contracted.
+  assert(t.find("ACCGGTTACTGGTA") != t.end());
+
+  return 0;
+}
+
diff --git a/libstdc++-v3/testsuite/ext/pb_ds/example/trie_prefix_search.cc b/libstdc++-v3/testsuite/ext/pb_ds/example/trie_prefix_search.cc
new file mode 100644
index 00000000000..5cb140b5cb0
--- /dev/null
+++ b/libstdc++-v3/testsuite/ext/pb_ds/example/trie_prefix_search.cc
@@ -0,0 +1,121 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file trie_prefix_search_example.cpp
+ * An example showing how to use a trie for searching
+ *    for words with a given prefix.
+ */
+
+/**
+ * This example shows how to use a PATRICIA trie for searching
+ * for words with a given prefix.
+ */
+
+#include <cassert>
+#include <iostream>
+#include <ext/pb_ds/assoc_container.hpp>
+#include <ext/pb_ds/trie_policy.hpp>
+#include <ext/pb_ds/tag_and_trait.hpp>
+
+using namespace std;
+using namespace pb_ds;
+using namespace pb_ds;
+
+// A PATRICIA trie with a prefix-search node-updator type. Note that
+// since the node updator is trie_prefix_search_node_update, then the
+// container includes its method prefix_range.
+typedef null_mapped_type		mapped_type;
+typedef string_trie_e_access_traits<> 	cmp_fn;
+typedef pat_trie_tag 			tag_type;
+
+typedef trie<string, mapped_type, cmp_fn, tag_type, 
+	     trie_prefix_search_node_update> trie_type;
+
+// The following helper function takes a trie object and r_key, a
+// const reference to a string, and prints all entries whose key
+// includes r_key as a prefix.
+void
+print_prefix_match(const trie_type& t, const string& key)
+{
+  typedef trie_type::const_iterator 		const_iterator;
+  typedef pair<const_iterator, const_iterator> 	pair_type;
+
+  cout << "All keys whose prefix matches \"" << key << "\":" << endl;
+
+  const pair_type match_range = t.prefix_range(key);
+  for (const_iterator it = match_range.first; it != match_range.second; ++it)
+    cout << *it << ' ';
+  cout << endl;
+}
+
+int main()
+{
+  trie_type t;
+
+  // Insert some entries.
+  assert(t.insert("I").second == true);
+  assert(t.insert("wish").second == true);
+  assert(t.insert("that").second == true);
+  assert(t.insert("I").second == false);
+  assert(t.insert("could").second == true);
+  assert(t.insert("ever").second == true);
+  assert(t.insert("see").second == true);
+  assert(t.insert("a").second == true);
+  assert(t.insert("poem").second == true);
+  assert(t.insert("lovely").second == true);
+  assert(t.insert("as").second == true);
+  assert(t.insert("a").second == false);
+  assert(t.insert("trie").second == true);
+
+  // Now search for prefixes.
+  print_prefix_match(t, "");
+  print_prefix_match(t, "a");
+  print_prefix_match(t, "as");
+  print_prefix_match(t, "ad");
+  print_prefix_match(t, "t");
+  print_prefix_match(t, "tr");
+  print_prefix_match(t, "trie");
+  print_prefix_match(t, "zzz");
+
+  return 0;
+}
+
diff --git a/libstdc++-v3/testsuite/ext/pb_ds/example/trie_split.cc b/libstdc++-v3/testsuite/ext/pb_ds/example/trie_split.cc
new file mode 100644
index 00000000000..11cd1823516
--- /dev/null
+++ b/libstdc++-v3/testsuite/ext/pb_ds/example/trie_split.cc
@@ -0,0 +1,95 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file trie_split_example.cpp
+ * A basic example showing how to split trie-based container objects.
+ */
+
+/**
+ * This example shows how to split trie based containers, i.e., the opposite
+ * of a join operation.
+ */
+
+#include <string>
+#include <cassert>
+#include <ext/pb_ds/assoc_container.hpp>
+
+using namespace std;
+using namespace pb_ds;
+
+int main()
+{
+  // A PATRICIA trie table mapping strings to chars.
+  typedef trie<string, char> map_type;
+
+  // A map_type object.
+  map_type r;
+
+  // Inserts some entries into r.
+  for (int i = 0; i < 100; ++ i)
+    r.insert(make_pair(string(i, 'a'), 'b'));
+
+  // Now split r into a different map_type object.
+
+  // larger_r will hold the larger values following the split.
+  map_type larger_r;
+
+  // Split all elements with key larger than 'a'^1000 into larger_r.
+  // This is exception free.
+  r.split(string(1000, 'a'), larger_r);
+
+  // Since there were no elements with key larger than 'a'^1000, r
+  // should be unchanged.
+  assert(r.size() == 100);
+  assert(r.begin()->first == string(""));
+
+  // Now perform a split which actually changes the content of r.
+
+  // Split all elements with key larger than "aaa" into larger_r.
+  r.split(string("aaa"), larger_r);
+
+  assert(r.size() == 4);
+  assert(larger_r.begin()->first == string("aaaa"));
+
+  return 0;
+}
+
diff --git a/libstdc++-v3/testsuite/ext/pb_ds/regression/associative_containers.cc b/libstdc++-v3/testsuite/ext/pb_ds/regression/associative_containers.cc
new file mode 100644
index 00000000000..686f8b9c70f
--- /dev/null
+++ b/libstdc++-v3/testsuite/ext/pb_ds/regression/associative_containers.cc
@@ -0,0 +1,175 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file assoc_link_regression_test_1.cpp
+ * A linkage regression test.
+ */
+
+
+#include <ext/pb_ds/assoc_container.hpp>
+#include <iostream>
+#include <cassert>
+
+using namespace std;
+using namespace pb_ds;
+
+/**
+ * The following function performs a sequence of operations on an
+ * associative container object mapping integers to characters.
+ */
+template<typename Cntnr>
+void
+some_op_sequence(Cntnr& r_c)
+{
+  assert(r_c.empty());
+  assert(r_c.size() == 0);
+
+  r_c.insert(make_pair(1, 'a'));
+
+  r_c[2] = 'b';
+
+  assert(!r_c.empty());
+  assert(r_c.size() == 2);
+
+  cout << "Key 1 is mapped to " << r_c[1] << endl;
+  cout << "Key 2 is mapped to " << r_c[2] << endl;
+
+  cout << endl << "All value types in the container:" << endl;
+  for (typename Cntnr::const_iterator it = r_c.begin(); it != r_c.end(); ++it)
+    cout << it->first << " -> " << it->second << endl;
+
+  cout << endl;
+
+  r_c.clear();
+
+  assert(r_c.empty());
+  assert(r_c.size() == 0);
+}
+
+void
+assoc_link_regression_test_0()
+{
+  {
+    // Perform operations on a collision-chaining hash map.
+    cc_hash_table<int, char> c;
+    some_op_sequence(c);
+  }
+
+  {
+    // Perform operations on a general-probing hash map.
+    gp_hash_table<int, char> c;
+    some_op_sequence(c);
+  }
+
+  {
+    // Perform operations on a red-black tree map.
+    tree<int, char> c;
+    some_op_sequence(c);
+  }
+
+  {
+    // Perform operations on a splay tree map.
+    tree<int, char, less<int>, splay_tree_tag> c;
+    some_op_sequence(c);
+  }
+
+  {
+    // Perform operations on a splay tree map.
+    tree<int, char, less<int>, ov_tree_tag> c;
+    some_op_sequence(c);
+  }
+
+  {
+    // Perform operations on a list-update map.
+    list_update<int, char> c;
+    some_op_sequence(c);
+  }
+}
+
+
+void
+assoc_link_regression_test_1()
+{
+  {
+    // Perform operations on a collision-chaining hash map.
+    cc_hash_table<int, char> c;
+    some_op_sequence(c);
+  }
+
+  {
+    // Perform operations on a general-probing hash map.
+    gp_hash_table<int, char> c;
+    some_op_sequence(c);
+  }
+
+  {
+    // Perform operations on a red-black tree map.
+    tree<int, char> c;
+    some_op_sequence(c);
+  }
+
+  {
+    // Perform operations on a splay tree map.
+    tree<int, char, less<int>, splay_tree_tag> c;
+    some_op_sequence(c);
+  }
+
+  {
+    // Perform operations on a splay tree map.
+    tree<int, char, less<int>, ov_tree_tag> c;
+    some_op_sequence(c);
+  }
+
+  {
+    // Perform operations on a list-update map.
+    list_update<int, char> c;
+    some_op_sequence(c);
+  }
+}
+
+int
+main()
+{
+  assoc_link_regression_test_0();
+  assoc_link_regression_test_1();
+  return 0;
+}
diff --git a/libstdc++-v3/testsuite/ext/pb_ds/regression/hash_data_map_rand.cc b/libstdc++-v3/testsuite/ext/pb_ds/regression/hash_data_map_rand.cc
new file mode 100644
index 00000000000..06c51f53d1c
--- /dev/null
+++ b/libstdc++-v3/testsuite/ext/pb_ds/regression/hash_data_map_rand.cc
@@ -0,0 +1,61 @@
+// { dg-options "-DPB_DS_REGRESSION" }
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file hash_data_map_rand_regression_test.cpp
+ * Contains a random-operation test for maps and sets.
+ */
+
+#include <regression/rand/assoc/rand_regression_test.hpp>
+#include <regression/assoc/common_type.hpp>
+
+int
+main(int argc, char* a_p_argv[])
+{
+  using namespace pb_ds::test;
+  typedef hash_map_tl_t map_tl_t;
+
+  return rand_regression_test(10000, 10000,
+			      "hash_data_map_rand_regression_test",
+			      map_tl_t());
+}
+
diff --git a/libstdc++-v3/testsuite/ext/pb_ds/regression/hash_no_data_map_rand.cc b/libstdc++-v3/testsuite/ext/pb_ds/regression/hash_no_data_map_rand.cc
new file mode 100644
index 00000000000..50bf33344cd
--- /dev/null
+++ b/libstdc++-v3/testsuite/ext/pb_ds/regression/hash_no_data_map_rand.cc
@@ -0,0 +1,61 @@
+// { dg-options "-DPB_DS_REGRESSION" }
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file hash_no_data_map_rand_regression_test.cpp
+ * Contains a random-operation test for maps and sets.
+ */
+
+#include <regression/rand/assoc/rand_regression_test.hpp>
+#include <regression/assoc/common_type.hpp>
+
+int
+main(int argc, char* a_p_argv[])
+{
+  using namespace pb_ds::test;
+  typedef hash_set_tl_t map_tl_t;
+
+  return rand_regression_test(10000, 10000,
+			      "hash_no_data_map_rand_regression_test",
+			      map_tl_t());
+}
+
diff --git a/libstdc++-v3/testsuite/ext/pb_ds/regression/list_update_data_map_rand.cc b/libstdc++-v3/testsuite/ext/pb_ds/regression/list_update_data_map_rand.cc
new file mode 100644
index 00000000000..d184844f1ae
--- /dev/null
+++ b/libstdc++-v3/testsuite/ext/pb_ds/regression/list_update_data_map_rand.cc
@@ -0,0 +1,61 @@
+// { dg-options "-DPB_DS_REGRESSION" }
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file lu_data_map_rand_regression_test.cpp
+ * Contains a random-operation test for maps and sets.
+ */
+
+#include <regression/rand/assoc/rand_regression_test.hpp>
+#include <regression/assoc/common_type.hpp>
+
+int
+main(int argc, char* a_p_argv[])
+{
+  using namespace pb_ds::test;
+  typedef lu_map_tl_t map_tl_t;
+
+  return rand_regression_test(100, 10, 
+			      "lu_data_map_rand_regression_test",
+			      map_tl_t());
+}
+
diff --git a/libstdc++-v3/testsuite/ext/pb_ds/regression/list_update_no_data_map_rand.cc b/libstdc++-v3/testsuite/ext/pb_ds/regression/list_update_no_data_map_rand.cc
new file mode 100644
index 00000000000..ae70c1ea6a3
--- /dev/null
+++ b/libstdc++-v3/testsuite/ext/pb_ds/regression/list_update_no_data_map_rand.cc
@@ -0,0 +1,61 @@
+// { dg-options "-DPB_DS_REGRESSION" }
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file lu_no_data_map_rand_regression_test.cpp
+ * Contains a random-operation test for maps and sets.
+ */
+
+#include <regression/rand/assoc/rand_regression_test.hpp>
+#include <regression/assoc/common_type.hpp>
+
+int
+main(int argc, char* a_p_argv[])
+{
+  using namespace pb_ds::test;
+  typedef lu_set_tl_t map_tl_t;
+
+  return rand_regression_test(100, 10,
+			      "lu_no_data_map_rand_regression_test",
+			      map_tl_t());
+}
+
diff --git a/libstdc++-v3/testsuite/ext/pb_ds/regression/priority_queue_rand.cc b/libstdc++-v3/testsuite/ext/pb_ds/regression/priority_queue_rand.cc
new file mode 100644
index 00000000000..6266e13d0ca
--- /dev/null
+++ b/libstdc++-v3/testsuite/ext/pb_ds/regression/priority_queue_rand.cc
@@ -0,0 +1,59 @@
+// { dg-options "-DPB_DS_REGRESSION" }
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file priority_queue_rand_regression_test.cpp
+ * Contains a random-operation test for priority queues.
+ */
+
+#include <regression/rand/priority_queue/rand_regression_test.hpp>
+#include <regression/priority_queue/common_type.hpp>
+
+int
+main(int argc, char* a_p_argv[])
+{
+  using namespace pb_ds::test;
+  return rand_regression_test(10000, 10000,
+			      "tree_no_data_map_rand_regression_test", 
+			      pq_tl_t());
+}
+
diff --git a/libstdc++-v3/testsuite/ext/pb_ds/regression/priority_queues.cc b/libstdc++-v3/testsuite/ext/pb_ds/regression/priority_queues.cc
new file mode 100644
index 00000000000..0f53cf22d03
--- /dev/null
+++ b/libstdc++-v3/testsuite/ext/pb_ds/regression/priority_queues.cc
@@ -0,0 +1,194 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * This example shows how to use priority queues. It defines a
+ *    function performing a sequence of operations on
+ *    a generic container. It then calls this function with some containers.
+ */
+
+#include <ext/pb_ds/priority_queue.hpp>
+#include <iostream>
+#include <cassert>
+
+using namespace std;
+using namespace pb_ds;
+using namespace pb_ds;
+
+template<typename Cntnr>
+void
+some_op_sequence(Cntnr& r_c)
+{
+  assert(r_c.empty());
+  assert(r_c.size() == 0);
+
+  for (size_t i = 0; i < 10; ++i)
+    r_c.push(i);
+
+  cout << endl << "All values in the container:" << endl;
+  for (typename Cntnr::const_iterator it = r_c.begin(); it != r_c.end();
+       ++it)
+    cout <<* it << endl;
+
+  assert(!r_c.empty());
+  assert(r_c.size() == 10);
+
+  cout << "Popping all values: " << endl;
+
+  while (!r_c.empty())
+    {
+      cout << r_c.top() << endl;
+
+      r_c.pop();
+    }
+
+  assert(r_c.empty());
+  assert(r_c.size() == 0);
+
+  cout << endl;
+}
+
+void
+priority_queue_link_regression_test_0()
+{
+  {
+    /*
+     *  Perform operations on a pairing-heap queue.
+     */
+    cout << "Pairing heap" << endl;
+    pb_ds::priority_queue<int, less<int>, pairing_heap_tag> c;
+    some_op_sequence(c);
+  }
+
+  {
+    /*
+     *  Perform operations on a binomial-heap queue.
+     */
+    cout << "Binomial heap" << endl;
+    pb_ds::priority_queue<int, less<int>, binomial_heap_tag> c;
+    some_op_sequence(c);
+  }
+
+  {
+    /*
+     *  Perform operations on a binomial-heap queue.
+     */
+    cout << "Redundant-counter binomial heap" << endl;
+    pb_ds::priority_queue<int, less<int>, rc_binomial_heap_tag> c;
+    some_op_sequence(c);
+  }
+
+  {
+    /*
+     *  Perform operations on a binomial-heap queue.
+     */
+    cout << "Binary heap" << endl;
+    pb_ds::priority_queue<int, less<int>, binary_heap_tag> c;
+    some_op_sequence(c);
+  }
+
+  {
+    /*
+     *  Perform operations on a thin-heap queue.
+     */
+    cout << "Thin heap" << endl;
+    pb_ds::priority_queue<int, less<int>, thin_heap_tag> c;
+    some_op_sequence(c);
+  }
+}
+
+
+void
+priority_queue_link_regression_test_1()
+{
+  {
+    /*
+     *  Perform operations on a pairing-heap queue.
+     */
+    cout << "Pairing heap" << endl;
+    pb_ds::priority_queue<int, less<int>, pairing_heap_tag> c;
+    some_op_sequence(c);
+  }
+
+  {
+    /*
+     *  Perform operations on a binomial-heap queue.
+     */
+    cout << "Binomial heap" << endl;
+    pb_ds::priority_queue<int, less<int>, binomial_heap_tag> c;
+    some_op_sequence(c);
+  }
+
+  {
+    /*
+     *  Perform operations on a binomial-heap queue.
+     */
+    cout << "Redundant-counter binomial heap" << endl;
+    pb_ds::priority_queue<int, less<int>, rc_binomial_heap_tag> c;
+    some_op_sequence(c);
+  }
+
+  {
+    /*
+     *  Perform operations on a binomial-heap queue.
+     */
+    cout << "Binary heap" << endl;
+    pb_ds::priority_queue<int, less<int>, binary_heap_tag> c;
+    some_op_sequence(c);
+  }
+
+  {
+    /*
+     *  Perform operations on a thin-heap queue.
+     */
+    cout << "Thin heap" << endl;
+    pb_ds::priority_queue<int, less<int>, thin_heap_tag> c;
+    some_op_sequence(c);
+  }
+}
+
+int
+main()
+{
+  priority_queue_link_regression_test_0();
+  priority_queue_link_regression_test_1();
+  return 0;
+}
diff --git a/libstdc++-v3/testsuite/ext/pb_ds/regression/tree_data_map_rand.cc b/libstdc++-v3/testsuite/ext/pb_ds/regression/tree_data_map_rand.cc
new file mode 100644
index 00000000000..4a51facf439
--- /dev/null
+++ b/libstdc++-v3/testsuite/ext/pb_ds/regression/tree_data_map_rand.cc
@@ -0,0 +1,61 @@
+// { dg-options "-DPB_DS_REGRESSION" }
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file tree_data_map_rand_regression_test.cpp
+ * Contains a random-operation test for maps and sets.
+ */
+
+#include <regression/rand/assoc/rand_regression_test.hpp>
+#include <regression/assoc/common_type.hpp>
+
+int
+main(int argc, char* a_p_argv[])
+{
+  using namespace pb_ds::test;
+  typedef tree_map_tl_t map_tl_t;
+
+  return rand_regression_test(10000, 10000,
+			      "tree_data_map_rand_regression_test",
+			      map_tl_t());
+}
+
diff --git a/libstdc++-v3/testsuite/ext/pb_ds/regression/tree_no_data_map_rand.cc b/libstdc++-v3/testsuite/ext/pb_ds/regression/tree_no_data_map_rand.cc
new file mode 100644
index 00000000000..4d3c8ff510f
--- /dev/null
+++ b/libstdc++-v3/testsuite/ext/pb_ds/regression/tree_no_data_map_rand.cc
@@ -0,0 +1,61 @@
+// { dg-options "-DPB_DS_REGRESSION" }
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file tree_no_data_map_rand_regression_test.cpp
+ * Contains a random-operation test for maps and sets.
+ */
+
+#include <regression/rand/assoc/rand_regression_test.hpp>
+#include <regression/assoc/common_type.hpp>
+
+int
+main(int argc, char* a_p_argv[])
+{
+  using namespace pb_ds::test;
+  typedef tree_set_tl_t map_tl_t;
+
+  return rand_regression_test(10000, 10000,
+			      "tree_no_data_map_rand_regression_test",
+			      map_tl_t());
+}
+
diff --git a/libstdc++-v3/testsuite/ext/pb_ds/regression/trie_data_map_rand.cc b/libstdc++-v3/testsuite/ext/pb_ds/regression/trie_data_map_rand.cc
new file mode 100644
index 00000000000..e6841970cbd
--- /dev/null
+++ b/libstdc++-v3/testsuite/ext/pb_ds/regression/trie_data_map_rand.cc
@@ -0,0 +1,61 @@
+// { dg-options "-DPB_DS_REGRESSION" }
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file trie_data_map_rand_regression_test.cpp
+ * Contains a random-operation test for maps and sets.
+ */
+
+#include <regression/rand/assoc/rand_regression_test.hpp>
+#include <regression/assoc/common_type.hpp>
+
+int
+main(int argc, char* a_p_argv[])
+{
+  using namespace pb_ds::test;
+  typedef trie_map_tl_t map_tl_t;
+
+  return rand_regression_test(10000, 10000,
+			      "trie_data_map_rand_regression_test",
+			      map_tl_t());
+}
+
diff --git a/libstdc++-v3/testsuite/ext/pb_ds/regression/trie_no_data_map_rand.cc b/libstdc++-v3/testsuite/ext/pb_ds/regression/trie_no_data_map_rand.cc
new file mode 100644
index 00000000000..b8af58cdb8b
--- /dev/null
+++ b/libstdc++-v3/testsuite/ext/pb_ds/regression/trie_no_data_map_rand.cc
@@ -0,0 +1,61 @@
+// { dg-options "-DPB_DS_REGRESSION" }
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file trie_no_data_map_rand_regression_test.cpp
+ * Contains a random-operation test for maps and sets.
+ */
+
+#include <regression/rand/assoc/rand_regression_test.hpp>
+#include <regression/assoc/common_type.hpp>
+
+int
+main(int argc, char* a_p_argv[])
+{
+  using namespace pb_ds::test;
+  typedef trie_set_tl_t map_tl_t;
+
+  return rand_regression_test(10000, 10000,
+			      "trie_no_data_map_rand_regression_test", 
+			      map_tl_t());
+}
+
diff --git a/libstdc++-v3/testsuite/lib/libstdc++.exp b/libstdc++-v3/testsuite/lib/libstdc++.exp
index e98397ba77c..d7da29f77c3 100644
--- a/libstdc++-v3/testsuite/lib/libstdc++.exp
+++ b/libstdc++-v3/testsuite/lib/libstdc++.exp
@@ -405,10 +405,14 @@ proc v3-build_support { } {
     }
 
     # Build the support objects.
-    set source_files \
-	[list testsuite_abi.cc testsuite_allocator.cc testsuite_character.cc testsuite_hooks.cc ]
+    set source_files [list testsuite_abi.cc testsuite_allocator.cc \
+			  testsuite_character.cc testsuite_hooks.cc \
+	       	 rng/twister_rand_gen.cc io/verified_cmd_line_input.cc \
+       	 io/prog_bar.cc regression/res_mng/dbg_ex_allocator_base.cc \
+	     performance/time/elapsed_timer.cc ]
     foreach f $source_files {
-	set object_file [file rootname $f].o
+	set obj [file rootname $f].o
+	set object_file [file tail $obj]
 	# Compile with "-w" so that warnings issued by the compiler
 	# do not prevent compilation.
 	if { [v3_target_compile $srcdir/util/$f $object_file "object" \
@@ -419,10 +423,27 @@ proc v3-build_support { } {
 	append v3-test_objs "$object_file "
     }
 
-    # Build the shared support objects.
+    # Collect into libtestc++.a
+    set arcommand "ar -rc ./libtestc++.a ${v3-test_objs}"
+    set result [lindex [local_exec "$arcommand" "" "" 300] 0]
+    verbose "link result is $result"
+    if { $result == 0 } {
+	set ranlibcommand "ranlib ./libtestc++.a"
+	set result [lindex [local_exec "$ranlibcommand" "" "" 300] 0]
+	if { $result != 0 } {
+	    error "could not link libtestc++.a"
+	    
+	    # We cannot actually use libtestc++.a because it's hard to
+	    # position this library after the test file being compiled
+	    # on the constructed compile line. However, we use this as
+	    # a convenience for performance testing.  
+	    #set v3-test_objs "./libtestc++.a"
+	}
+    }
+
+    # Build any shared objects needed for regression testing.
     if { ${v3-sharedlib} == 1 } {
-	set source_files \
-	    [list testsuite_shared.cc]
+	set source_files [list testsuite_shared.cc]
 	foreach f $source_files {
 	    set object_file [file rootname $f].so
 	    # Compile with "-w" so that warnings issued by the compiler
diff --git a/libstdc++-v3/testsuite/performance/ext/pb_ds/hash_random_int_erase_mem_usage.cc b/libstdc++-v3/testsuite/performance/ext/pb_ds/hash_random_int_erase_mem_usage.cc
new file mode 100644
index 00000000000..075c4956758
--- /dev/null
+++ b/libstdc++-v3/testsuite/performance/ext/pb_ds/hash_random_int_erase_mem_usage.cc
@@ -0,0 +1,138 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file hash_random_int_erase_mem_usage_test.cpp
+ * Contains test for erasing random integers.
+ */
+
+#include <ext/pb_ds/detail/typelist.hpp>
+#include <performance/io/xml_formatter.hpp>
+#include <io/verified_cmd_line_input.hpp>
+#include <rng/twister_rand_gen.hpp>
+#include <common_type/assoc/common_type.hpp>
+#include <performance/assoc/mem_usage/erase_test.hpp>
+#include <ext/pb_ds/detail/typelist.hpp>
+#include <performance/mem/mem_track_allocator.hpp>
+#include <iostream>
+#include <vector>
+#include <functional>
+
+struct int_hash : public std::unary_function<int, int>
+{
+  inline int
+  operator()(int i) const
+  { return i; }
+};
+
+void
+usage();
+
+int
+main(int argc, char* a_p_argv[])
+{
+  using namespace pb_ds::test;
+
+  size_t vn = 200;
+  size_t vs = 200;
+  size_t vm = 2100;
+  try
+    {
+      xml_test_performance_formatter fmt("Size", "Memory (bytes)");
+
+      typedef std::vector< int> vec_t;
+      vec_t a_v(vm);
+      twister_rand_gen g;
+      for (size_t i = 0; i < vm; ++i)
+	a_v[i] = static_cast<int>(g.get_unsigned_long());
+
+      vec_t::const_iterator b = a_v.begin();
+      erase_test<vec_t::const_iterator> tst(b,  vn, vs, vm);
+      typedef mem_track_allocator<char> alloc_t;
+      {
+	typedef
+	  hash_common_types<int, pb_ds::null_mapped_type, int_hash,
+	  std::equal_to<int>, alloc_t>::performance_tl
+	  tl_t;
+
+	tl_t tl;
+	pb_ds::detail::typelist_apply(tst, tl);
+      }
+
+      {
+	typedef
+	  native_hash_set<int, 8, int_hash,
+	  std::equal_to<int>,
+	  std::less<int>, alloc_t>
+	  native_t;
+
+	tst(pb_ds::detail::type_to_type<native_t>());
+      }
+    }
+  catch (...)
+    {
+      std::cerr << "Test failed" << std::endl;
+      return -1;
+    }
+  return 0;
+}
+
+void
+usage()
+{
+  using namespace std;
+  cerr << "usage: hash_random_int_erase_if_test <vn> <vs> <vm>" <<
+    endl << endl;
+
+  cerr <<
+    "This test checks the performance of various associative containers "
+    "using their erase method. " << endl;
+  cerr << "Specifically, it does the following:"    << endl;
+  cerr << "*  Creates a vector of random integers "    << endl;
+  cerr << "*  Inserts the elements into the container"    << endl;
+  cerr << "*  Erases all the elements, except one, from the constainer" << endl;
+
+  cerr << endl << endl;
+
+  cerr << "vn = minimum size of the vector" << endl;
+  cerr << "vs = step size of the vector" << endl;
+  cerr << "vm = maximum size of the vector" << endl;
+}
diff --git a/libstdc++-v3/testsuite/performance/ext/pb_ds/hash_zlob_random_int_find_timing.cc b/libstdc++-v3/testsuite/performance/ext/pb_ds/hash_zlob_random_int_find_timing.cc
new file mode 100644
index 00000000000..a5e9f5fa785
--- /dev/null
+++ b/libstdc++-v3/testsuite/performance/ext/pb_ds/hash_zlob_random_int_find_timing.cc
@@ -0,0 +1,130 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file hash_zlob_random_int_find_timing_test.cpp
+ * Contains test for finding random integers.
+ */
+
+#include <ext/pb_ds/detail/typelist.hpp>
+#include <performance/io/xml_formatter.hpp>
+#include <native_type/assoc/native_hash_set.hpp>
+#include <io/verified_cmd_line_input.hpp>
+#include <rng/twister_rand_gen.hpp>
+#include <common_type/assoc/common_type.hpp>
+#include <performance/assoc/timing/find_test.hpp>
+#include <ext/pb_ds/detail/typelist.hpp>
+#include <iostream>
+#include <vector>
+
+void
+usage();
+
+int
+main(int argc, char* a_p_argv[])
+{
+  using namespace pb_ds::test;
+
+  size_t vn = 200;
+  size_t vs = 200;
+  size_t vm = 2100;
+  try
+    {
+      xml_test_performance_formatter fmt("Size", "Average time (sec.)");
+
+      typedef std::vector<std::pair<int, char> > vec_t;
+      vec_t a_v(vm);
+      twister_rand_gen g;
+
+      for (size_t i = 0; i < vm; ++i)
+        {
+	  int k = static_cast<int>(g.get_unsigned_long());
+	  a_v[i] = std::make_pair(k << 8, 0);
+	  if ((a_v[i].first&  127) != 0)
+	    throw std::logic_error("Fucked!");
+        }
+
+      vec_t::const_iterator b = a_v.begin();
+      typedef find_test<vec_t::const_iterator> test_t;
+      test_t tst(b, b, vn, vs, vm, vn, vs, vm);
+      {
+	typedef native_hash_map< int, char> native_t;
+	tst(pb_ds::detail::type_to_type<native_t>());
+      }
+
+      {
+	typedef hash_common_types<int, char>::performance_tl tl_t;
+	tl_t tl;
+	pb_ds::detail::typelist_apply(tst, tl);
+      }
+    }
+  catch (...)
+    {
+      std::cerr << "Test failed" << std::endl;
+      return -1;
+    }
+  return 0;
+}
+
+void
+usage()
+{
+  using namespace std;
+  cerr << "usage: hash_zlob_random_int_find_timing_test <vn> <vs> <vm>" <<
+    endl << endl;
+
+  cerr <<
+    "This test checks the performance of various associative containers "
+    "using their find method. " << endl;
+  cerr << "Specifically, it does the following:"    << endl;
+  cerr << "*  Creates a vector of zero low-order bit random integers " << endl;
+  cerr << "*  Inserts the elements into the container" << endl;
+  cerr << "*  Performs a sequence of find operations. At each iteration, "
+    "it finds, for each integer in the vector, its entry in the "
+    "container, using the find method";
+  cerr << "*  Repeats the above test a number of times" << endl;
+
+  cerr << endl << endl;
+
+  cerr << "vn = minimum size of the vector" << endl;
+  cerr << "vs = step size of the vector" << endl;
+  cerr << "vm = maximum size of the vector" << endl;
+}
diff --git a/libstdc++-v3/testsuite/performance/ext/pb_ds/multimap_text_find_timing.hpp b/libstdc++-v3/testsuite/performance/ext/pb_ds/multimap_text_find_timing.hpp
new file mode 100644
index 00000000000..a57254a8522
--- /dev/null
+++ b/libstdc++-v3/testsuite/performance/ext/pb_ds/multimap_text_find_timing.hpp
@@ -0,0 +1,148 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file multimap_text_find_timing_test.cpp
+ * Contains test for inserting text words.
+ */
+
+#include <ext/pb_ds/detail/typelist.hpp>
+#include <io/text_populate.hpp>
+#include <performance/io/xml_formatter.hpp>
+#include <native_type/assoc/native_hash_multimap.hpp>
+#include <native_type/assoc/native_multimap.hpp>
+#include <io/verified_cmd_line_input.hpp>
+#include <rng/twister_rand_gen.hpp>
+#include <common_type/assoc/common_type.hpp>
+#include <performance/assoc/timing/multimap_find_test.hpp>
+#include <performance/assoc/multimap_common_type.hpp>
+#include <hash_fn/string_hash_fn.hpp>
+#include <ext/pb_ds/detail/typelist.hpp>
+#include <iostream>
+#include <vector>
+
+void
+usage();
+
+void
+set_test_parameters(size_t& n, size_t&s, size_t& m, size_t& prm);
+
+int
+main(int argc, char* a_p_argv[])
+{
+  using namespace pb_ds::test;
+
+  std::string f_name = "thirty_years_among_the_dead_preproc.txt";
+  size_t prm;
+  size_t ratio_n;
+  size_t ratio_s;
+  size_t ratio_m;
+
+
+  set_test_parameters(prm, ratio_n, ratio_s, ratio_m);
+
+  try
+    {
+      xml_test_performance_formatter fmt("Size", "Average time (sec.)");
+
+      typedef std::vector<std::pair<std::string, int> > vec_t;
+      vec_t a_v_init(prm);
+      distinct_text_populate(f_name, a_v_init);
+
+      vec_t a_v;
+      twister_rand_gen g;
+      for (size_t i = 0; i < ratio_m; ++i)
+	for (size_t j = 0; j < a_v_init.size(); ++j)
+	  a_v.push_back(std::make_pair(a_v_init[j].first,
+				       static_cast<int>(g.get_unsigned_long())));
+
+      vec_t::const_iterator b = a_v.begin();
+      {
+	typedef mmap_tl_t<std::string, int, std::allocator<char> >::type mmap_tl_tl;
+	mmap_tl_tl tl;
+
+	typedef multimap_find_test<vec_t::const_iterator, false> test_type;
+	test_type tst(b, prm* ratio_n, prm* ratio_s, prm* ratio_m);
+	pb_ds::detail::typelist_apply(tst, tl);
+      }
+
+      {
+	typedef native_hash_multimap<std::string, int, 8, string_hash_fn> native_t;
+	typedef multimap_find_test<vec_t::const_iterator, true> test_type;
+	test_type tst(b, prm* ratio_n, prm* ratio_s, prm* ratio_m);
+	tst(pb_ds::detail::type_to_type<native_t>());
+      }
+
+      {
+	typedef native_multimap<std::string, int> native_t;
+	typedef multimap_find_test<vec_t::const_iterator, true> test_type;
+	test_type tst(b, prm* ratio_n, prm* ratio_s, prm* ratio_m);
+	tst(pb_ds::detail::type_to_type<native_t>());
+      }
+    }
+  catch (...)
+    {
+      std::cerr << "Test failed" << std::endl;
+      return -1;
+    }
+  return 0;
+}
+
+void
+usage()
+{
+  using namespace std;
+  cerr << "usage: multimap_text_insert_test.out <prm> <ratio_n> <ratio_s> <ratio_m>" 
+       << endl << endl;
+
+  cerr << "This test checks the performance of various associative containers "
+          "using their insert method. " << endl;
+  cerr << "Specifically, it does the following:" << endl;
+  cerr << "*  Creates a vector of pairs of text words" << endl;
+  cerr << "*  Inserts the elements into the container" << endl;
+  cerr << "*  Repeats the above test a number of times" << endl;
+  cerr << endl << endl;
+
+  cerr << "prm = maximum size of distinct pair-first entries" << endl;
+  cerr << "ratio_n = minimum ratio of secondary keys to primary keys" << endl;
+  cerr << "ratio_s = step ratio of secondary keys to primary keys" << endl;
+  cerr << "ratio_m = maximum ratio of secondary keys to primary keys" << endl;
+}
diff --git a/libstdc++-v3/testsuite/performance/ext/pb_ds/multimap_text_find_timing_large.cc b/libstdc++-v3/testsuite/performance/ext/pb_ds/multimap_text_find_timing_large.cc
new file mode 100644
index 00000000000..1c9178643b7
--- /dev/null
+++ b/libstdc++-v3/testsuite/performance/ext/pb_ds/multimap_text_find_timing_large.cc
@@ -0,0 +1,51 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+#include "multimap_text_find_timing.hpp"
+
+void
+set_test_parameters(size_t& prm, size_t&n, size_t& s, size_t& m)
+{
+  prm = 100;
+  n = 3;
+  s = 4;
+  m = 20;
+}
diff --git a/libstdc++-v3/testsuite/performance/ext/pb_ds/multimap_text_find_timing_small.cc b/libstdc++-v3/testsuite/performance/ext/pb_ds/multimap_text_find_timing_small.cc
new file mode 100644
index 00000000000..8398f48a265
--- /dev/null
+++ b/libstdc++-v3/testsuite/performance/ext/pb_ds/multimap_text_find_timing_small.cc
@@ -0,0 +1,52 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+#include "multimap_text_find_timing.hpp"
+
+void
+set_test_parameters(size_t& prm, size_t&n, size_t& s, size_t& m)
+{
+  prm = 400;
+  n = 1;
+  s = 1;
+  m = 6;
+}
+
diff --git a/libstdc++-v3/testsuite/performance/ext/pb_ds/multimap_text_insert_mem_usage.hpp b/libstdc++-v3/testsuite/performance/ext/pb_ds/multimap_text_insert_mem_usage.hpp
new file mode 100644
index 00000000000..896d766753f
--- /dev/null
+++ b/libstdc++-v3/testsuite/performance/ext/pb_ds/multimap_text_insert_mem_usage.hpp
@@ -0,0 +1,166 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file multimap_text_insert_mem_usage_test.cpp
+ * Contains test for inserting text words.
+ */
+
+#include <ext/pb_ds/detail/typelist.hpp>
+#include <io/text_populate.hpp>
+#include <performance/io/xml_formatter.hpp>
+#include <native_type/assoc/native_hash_multimap.hpp>
+#include <native_type/assoc/native_multimap.hpp>
+#include <io/verified_cmd_line_input.hpp>
+#include <rng/twister_rand_gen.hpp>
+#include <common_type/assoc/common_type.hpp>
+#include <performance/assoc/mem_usage/multimap_insert_test.hpp>
+#include <performance/assoc/multimap_common_type.hpp>
+#include <ext/pb_ds/detail/typelist.hpp>
+#include <performance/mem/mem_track_allocator.hpp>
+#include <hash_fn/string_hash_fn.hpp>
+#include <iostream>
+#include <vector>
+
+void
+usage();
+
+void
+set_test_parameters(size_t& n, size_t&s, size_t& m, size_t& prm);
+
+int
+main(int argc, char* a_p_argv[])
+{
+  using namespace pb_ds::test;
+
+  std::string f_name = "thirty_years_among_the_dead_preproc.txt";
+  size_t prm;
+  size_t ratio_n;
+  size_t ratio_s;
+  size_t ratio_m;
+
+  set_test_parameters(prm, ratio_n, ratio_s, ratio_m);
+
+  try
+    {
+      xml_test_performance_formatter fmt("Size", "Memory (bytes)");
+
+      typedef std::vector<std::pair<std::string, int> > init_vec_t;
+      init_vec_t a_v_init(prm);
+      distinct_text_populate(f_name, a_v_init);
+
+      typedef mem_track_allocator<char> alloc_t;
+      typedef std::basic_string<char, std::char_traits<char>, alloc_t> string_t;
+      typedef std::vector<std::pair<string_t, int> > vec_t;
+      vec_t a_v;
+      twister_rand_gen g;
+      for (size_t i = 0; i < ratio_m; ++i)
+	for (size_t j = 0; j < a_v_init.size(); ++j)
+	  a_v.push_back(std::make_pair(string_t(a_v_init[j].first.begin(), a_v_init[j].first.end()), static_cast<int>(g.get_unsigned_long())));
+
+      vec_t::const_iterator b = a_v.begin();
+      {
+	typedef mmap_tl_t<string_t, int, alloc_t>::type tl_t;
+	tl_t tl;
+	typedef multimap_insert_test<vec_t::const_iterator, false> test_type;
+	test_type tst(b, prm* ratio_n, prm* ratio_s, prm* ratio_m);
+	pb_ds::detail::typelist_apply(tst, tl);
+      }
+
+      {
+	typedef mmap_tl_t< string_t, int, alloc_t>::type tl_t;
+	tl_t tl;
+	typedef multimap_insert_test<vec_t::const_iterator, false> test_type;
+	test_type tst(b,  prm*  ratio_n, prm*  ratio_s, prm*  ratio_m);
+	pb_ds::detail::typelist_apply(tst, tl);
+      }
+
+      typedef multimap_insert_test<vec_t::const_iterator, true> test_type;
+      test_type tst(b,  prm* ratio_n, prm* ratio_s, prm* ratio_m);
+      {
+	typedef native_multimap<string_t, int, std::less<string_t>, alloc_t> native_t;
+	tst(pb_ds::detail::type_to_type<native_t>());
+      }
+
+      {
+	typedef
+	  native_hash_multimap<
+	  string_t,
+	  int,
+	  8,
+	  string_hash_fn, std::equal_to<string_t>,
+	  std::less<string_t>,
+	  alloc_t>
+	  native_t;
+
+	tst(pb_ds::detail::type_to_type<native_t>());
+      }
+    }
+  catch (...)
+    {
+      std::cerr << "Test failed" << std::endl;
+      return -1;
+    }
+  return 0;
+}
+
+void
+usage()
+{
+  using namespace std;
+  cerr << "usage: multimap_text_insert_test.out <prm> <ratio_n> <ratio_s> <ratio_m>" <<
+    endl << endl;
+
+  cerr <<
+    "This test checks the performance of various associative containers "
+    "using their insert method. " << endl;
+  cerr << "Specifically, it does the following:"    << endl;
+  cerr << "*  Creates a vector of pairs of text words"    << endl;
+  cerr << "*  Inserts the elements into the container"    << endl;
+  cerr << "*  Repeats the above test a number of times" << endl;
+
+  cerr << endl << endl;
+
+  cerr << "prm = maximum size of distinct pair-first entries" << endl;
+  cerr << "ratio_n = minimum ratio of secondary keys to primary keys" << endl;
+  cerr << "ratio_s = step ratio of secondary keys to primary keys" << endl;
+  cerr << "ratio_m = maximum ratio of secondary keys to primary keys" << endl;
+}
diff --git a/libstdc++-v3/testsuite/performance/ext/pb_ds/multimap_text_insert_mem_usage_large.cc b/libstdc++-v3/testsuite/performance/ext/pb_ds/multimap_text_insert_mem_usage_large.cc
new file mode 100644
index 00000000000..6cd5f1c9e7b
--- /dev/null
+++ b/libstdc++-v3/testsuite/performance/ext/pb_ds/multimap_text_insert_mem_usage_large.cc
@@ -0,0 +1,51 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+#include "multimap_text_insert_mem_usage.hpp"
+
+void
+set_test_parameters(size_t& prm, size_t&n, size_t& s, size_t& m)
+{
+  prm = 100;
+  n = 3;
+  s = 4;
+  m = 20;
+}
diff --git a/libstdc++-v3/testsuite/performance/ext/pb_ds/multimap_text_insert_mem_usage_small.cc b/libstdc++-v3/testsuite/performance/ext/pb_ds/multimap_text_insert_mem_usage_small.cc
new file mode 100644
index 00000000000..8020bfc3056
--- /dev/null
+++ b/libstdc++-v3/testsuite/performance/ext/pb_ds/multimap_text_insert_mem_usage_small.cc
@@ -0,0 +1,51 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+#include "multimap_text_insert_mem_usage.hpp"
+
+void
+set_test_parameters(size_t& prm, size_t&n, size_t& s, size_t& m)
+{
+  prm = 400;
+  n = 1;
+  s = 1;
+  m = 6;
+}
diff --git a/libstdc++-v3/testsuite/performance/ext/pb_ds/multimap_text_insert_timing.hpp b/libstdc++-v3/testsuite/performance/ext/pb_ds/multimap_text_insert_timing.hpp
new file mode 100644
index 00000000000..1c757d5dae2
--- /dev/null
+++ b/libstdc++-v3/testsuite/performance/ext/pb_ds/multimap_text_insert_timing.hpp
@@ -0,0 +1,148 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file multimap_text_insert_timing_test.cpp
+ * Contains test for inserting text words.
+ */
+
+#include <ext/pb_ds/detail/typelist.hpp>
+#include <io/text_populate.hpp>
+#include <performance/io/xml_formatter.hpp>
+#include <native_type/assoc/native_hash_multimap.hpp>
+#include <native_type/assoc/native_multimap.hpp>
+#include <io/verified_cmd_line_input.hpp>
+#include <rng/twister_rand_gen.hpp>
+#include <common_type/assoc/common_type.hpp>
+#include <performance/assoc/timing/multimap_insert_test.hpp>
+#include <performance/assoc/multimap_common_type.hpp>
+#include <ext/pb_ds/detail/typelist.hpp>
+#include <hash_fn/string_hash_fn.hpp>
+#include <iostream>
+#include <vector>
+
+void
+usage();
+
+void
+set_test_parameters(size_t& n, size_t&s, size_t& m, size_t& prm);
+
+int
+main(int argc, char* a_p_argv[])
+{
+  using namespace pb_ds::test;
+
+  std::string f_name = "thirty_years_among_the_dead_preproc.txt";
+  size_t prm;
+  size_t ratio_n;
+  size_t ratio_s;
+  size_t ratio_m;
+
+  set_test_parameters(prm, ratio_n, ratio_s, ratio_m);
+
+  try
+    {
+      xml_test_performance_formatter fmt("Size", "Average time (sec.)");
+
+      typedef std::vector<std::pair<std::string, int> > vec_t;
+      vec_t a_v_init(prm);
+      distinct_text_populate(f_name, a_v_init);
+
+      vec_t a_v;
+      twister_rand_gen g;
+      for (size_t i = 0; i < ratio_m; ++i)
+	for (size_t j = 0; j < a_v_init.size(); ++j)
+	  a_v.push_back(std::make_pair(a_v_init[j].first,
+				       static_cast<int>(g.get_unsigned_long())));
+
+      vec_t::const_iterator b = a_v.begin();
+      {
+	typedef mmap_tl_t<std::string, int, std::allocator<char> >::type mmap_tl_tl;
+	mmap_tl_tl tl;
+	typedef multimap_insert_test<vec_t::const_iterator, false> test_type;
+	test_type tst(b, prm*  ratio_n, prm*  ratio_s, prm*  ratio_m);
+	pb_ds::detail::typelist_apply(tst, tl);
+      }
+
+      {
+	typedef native_hash_multimap<std::string, int, 8, string_hash_fn> native_t;
+	typedef multimap_insert_test<vec_t::const_iterator, true> test_type;
+	test_type tst(b,  prm*  ratio_n, prm*  ratio_s, prm*  ratio_m);
+	tst(pb_ds::detail::type_to_type<native_t>());
+      }
+
+      {
+	typedef native_multimap<std::string, int> native_t;
+	typedef multimap_insert_test<vec_t::const_iterator, true> test_type;
+	test_type tst(b, prm* ratio_n, prm* ratio_s, prm* ratio_m);
+	tst(pb_ds::detail::type_to_type<native_t>());
+      }
+    }
+  catch (...)
+    {
+      std::cerr << "Test failed" << std::endl;
+      return -1;
+    }
+  return 0;
+}
+
+void
+usage()
+{
+  using namespace std;
+  cerr << "usage: multimap_text_insert_test.out <prm> <ratio_n> <ratio_s> <ratio_m>" <<
+    endl << endl;
+
+  cerr <<
+    "This test checks the performance of various associative containers "
+    "using their insert method. " << endl;
+  cerr << "Specifically, it does the following:"    << endl;
+  cerr << "*  Creates a vector of pairs of text words"    << endl;
+  cerr << "*  Inserts the elements into the container"    << endl;
+  cerr << "*  Repeats the above test a number of times" << endl;
+
+  cerr << endl << endl;
+
+  cerr << "prm = maximum size of distinct pair-first entries" << endl;
+  cerr << "ratio_n = minimum ratio of secondary keys to primary keys" << endl;
+  cerr << "ratio_s = step ratio of secondary keys to primary keys" << endl;
+  cerr << "ratio_m = maximum ratio of secondary keys to primary keys" << endl;
+}
diff --git a/libstdc++-v3/testsuite/performance/ext/pb_ds/multimap_text_insert_timing_large.cc b/libstdc++-v3/testsuite/performance/ext/pb_ds/multimap_text_insert_timing_large.cc
new file mode 100644
index 00000000000..9930c88888c
--- /dev/null
+++ b/libstdc++-v3/testsuite/performance/ext/pb_ds/multimap_text_insert_timing_large.cc
@@ -0,0 +1,51 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+#include "multimap_text_insert_timing.hpp"
+
+void
+set_test_parameters(size_t& prm, size_t&n, size_t& s, size_t& m)
+{
+  prm = 100;
+  n = 3;
+  s = 4;
+  m = 20;
+}
diff --git a/libstdc++-v3/testsuite/performance/ext/pb_ds/multimap_text_insert_timing_small.cc b/libstdc++-v3/testsuite/performance/ext/pb_ds/multimap_text_insert_timing_small.cc
new file mode 100644
index 00000000000..84017a52013
--- /dev/null
+++ b/libstdc++-v3/testsuite/performance/ext/pb_ds/multimap_text_insert_timing_small.cc
@@ -0,0 +1,51 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+#include "multimap_text_insert_timing.hpp"
+
+void
+set_test_parameters(size_t& prm, size_t&n, size_t& s, size_t& m)
+{
+  prm = 400;
+  n = 1;
+  s = 1;
+  m = 6;
+}
diff --git a/libstdc++-v3/testsuite/performance/ext/pb_ds/priority_queue_random_int_push_pop_timing.cc b/libstdc++-v3/testsuite/performance/ext/pb_ds/priority_queue_random_int_push_pop_timing.cc
new file mode 100644
index 00000000000..64f19b12799
--- /dev/null
+++ b/libstdc++-v3/testsuite/performance/ext/pb_ds/priority_queue_random_int_push_pop_timing.cc
@@ -0,0 +1,129 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file priority_queue_random_int_push_pop_timing_test.cpp
+ * Contains test for finding random_int.
+ */
+
+#include <ext/pb_ds/detail/typelist.hpp>
+#include <performance/io/xml_formatter.hpp>
+#include <io/verified_cmd_line_input.hpp>
+#include <common_type/priority_queue/common_type.hpp>
+#include <performance/priority_queue/timing/push_pop_test.hpp>
+#include <ext/pb_ds/detail/typelist.hpp>
+#include <native_type/priority_queue/native_priority_queue.hpp>
+#include <rng/twister_rand_gen.hpp>
+#include <iostream>
+#include <vector>
+
+void
+usage();
+
+int
+main(int argc, char* a_p_argv[])
+{
+  using namespace pb_ds::test;
+
+  size_t vn = 200;
+  size_t vs = 200;
+  size_t vm = 2100;
+
+  try
+    {
+      xml_test_performance_formatter fmt("Size", "Average time (sec.)");
+
+      typedef std::vector<std::pair<int, char> > vector_type;
+      vector_type a_v(vm);
+      twister_rand_gen g;
+
+      for (size_t i = 0; i < vm; ++i)
+	a_v[i] = std::make_pair(static_cast<int>(g.get_unsigned_long()), 0);
+      vector_type::const_iterator b = a_v.begin();
+
+      typedef push_pop_test<vector_type::const_iterator> test_type;
+      test_type tst(b, vn, vs, vm);
+      {
+	typedef pq_common_types<int>::performance_tl pq_tl_t;
+	pq_tl_t tl;
+	pb_ds::detail::typelist_apply(tst, tl);
+      }
+
+      {
+	typedef native_priority_queue<int, true> native_pq_t;
+	tst(pb_ds::detail::type_to_type<native_pq_t>());
+      }
+
+      {
+	typedef native_priority_queue<int, false> native_pq_t;
+	tst(pb_ds::detail::type_to_type<native_pq_t>());
+      }
+    }
+  catch(...)
+    {
+      std::cerr << "Test failed" << std::endl;
+      return -1;
+    }
+  return 0;
+}
+
+void
+usage()
+{
+  std::cerr << "usage: priority_queue_random_int_push_pop_timing_test <vn> <vs> <vm>" <<
+    std::endl << std::endl;
+
+  std::cerr <<
+    "This test checks the performance of various priority_queue containers "
+    "using their push and pop method. " << std::endl;
+  std::cerr << "Specifically, it does the following:" << std::endl;
+  std::cerr << "*  Creates a vector of random integers " << std::endl;
+  std::cerr << "*  Pushes the elements into the container" << std::endl;
+  std::cerr << "*  Pops the elements from the container" << std::endl;
+  std::cerr << "*  Repeats the above test a number of times "
+	    << std::endl;
+
+  std::cerr << std::endl << std::endl;
+
+  std::cerr << "vn = minimum size of the vector" << std::endl;
+  std::cerr << "vs = step size of the vector" << std::endl;
+  std::cerr << "vm = maximum size of the vector" << std::endl;
+}
diff --git a/libstdc++-v3/testsuite/performance/ext/pb_ds/priority_queue_random_int_push_timing.cc b/libstdc++-v3/testsuite/performance/ext/pb_ds/priority_queue_random_int_push_timing.cc
new file mode 100644
index 00000000000..7706175355b
--- /dev/null
+++ b/libstdc++-v3/testsuite/performance/ext/pb_ds/priority_queue_random_int_push_timing.cc
@@ -0,0 +1,127 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file priority_queue_random_int_push_timing_test.cpp
+ * Contains test for finding random_int.
+ */
+
+#include <ext/pb_ds/detail/typelist.hpp>
+#include <performance/io/xml_formatter.hpp>
+#include <io/verified_cmd_line_input.hpp>
+#include <common_type/priority_queue/common_type.hpp>
+#include <performance/priority_queue/timing/push_test.hpp>
+#include <ext/pb_ds/detail/typelist.hpp>
+#include <native_type/priority_queue/native_priority_queue.hpp>
+#include <rng/twister_rand_gen.hpp>
+#include <iostream>
+#include <vector>
+
+void
+usage();
+
+int
+main(int argc, char* a_p_argv[])
+{
+  using namespace pb_ds::test;
+
+  size_t vn = 200;
+  size_t vs = 200;
+  size_t vm = 2100;
+  try
+    {
+      xml_test_performance_formatter fmt("Size", "Average time (sec.)");
+
+      typedef std::vector<std::pair<int, char> > vec_t;
+      vec_t a_v(vm);
+      twister_rand_gen g;
+      for (size_t i = 0; i < vm; ++i)
+	a_v[i] = std::make_pair(static_cast<int>(g.get_unsigned_long()), 0);
+
+      typedef push_test<vec_t::const_iterator> test_t;
+      vec_t::const_iterator b = a_v.begin();
+      test_t tst(b, vn, vs, vm);
+      {
+	typedef pq_common_types<int>::performance_tl pq_tl_t;
+	pq_tl_t tl;
+	pb_ds::detail::typelist_apply(tst, tl);
+      }
+
+      {
+	typedef native_priority_queue<int, true> native_pq_t;
+	tst(pb_ds::detail::type_to_type<native_pq_t>());
+      }
+
+      {
+	typedef native_priority_queue<int, false> native_pq_t;
+	tst(pb_ds::detail::type_to_type<native_pq_t>());
+      }
+    }
+  catch (...)
+    {
+      std::cerr << "Test failed" << std::endl;
+      return -1;
+    }
+  return 0;
+}
+
+void
+usage()
+{
+  using namespace std;
+  cerr << "usage: priority_queue_random_int_push_timing_test <vn> <vs> <vm>" <<
+    endl << endl;
+
+  cerr <<
+    "This test checks the performance of various priority_queue containers "
+    "using their push method. " << endl;
+  cerr << "Specifically, it does the following:" << endl;
+  cerr << "*  Creates a vector of random integers " << endl;
+  cerr << "*  Pushes the elements into the container" << endl;
+  cerr << "*  Repeats the above test a number of times "
+	    << endl;
+
+  cerr << endl << endl;
+
+  cerr << "vn = minimum size of the vector" << endl;
+  cerr << "vs = step size of the vector" << endl;
+  cerr << "vm = maximum size of the vector" << endl;
+}
diff --git a/libstdc++-v3/testsuite/performance/ext/pb_ds/priority_queue_text_join_timing.cc b/libstdc++-v3/testsuite/performance/ext/pb_ds/priority_queue_text_join_timing.cc
new file mode 100644
index 00000000000..c13f060c3c9
--- /dev/null
+++ b/libstdc++-v3/testsuite/performance/ext/pb_ds/priority_queue_text_join_timing.cc
@@ -0,0 +1,123 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file priority_queue_text_join_timing_test.cpp
+ * Contains test for finding text.
+ */
+
+#include <ext/pb_ds/detail/typelist.hpp>
+#include <performance/io/xml_formatter.hpp>
+#include <io/verified_cmd_line_input.hpp>
+#include <common_type/priority_queue/common_type.hpp>
+#include <performance/priority_queue/timing/join_test.hpp>
+#include <io/text_populate.hpp>
+#include <native_type/priority_queue/native_priority_queue.hpp>
+#include <iostream>
+#include <vector>
+
+void
+usage()
+{
+  using namespace std;
+  cerr << "usage: priority_queue_text_join_timing_test <f_name> <vn> <vs> <vm>";
+  cerr << endl << endl;
+
+  cerr << "This test checks the performance of various priority_queueiative containers "
+    "using their join method. " << endl;
+  cerr << "Specifically, it does the following:" << endl;
+  cerr << "*  Creates a vector of text words " << endl;
+  cerr << "*  Pushes the elements into two containers" << endl;
+  cerr << "*  Joins the two containers (and measures this time)" << endl;
+  cerr << "*  Repeats the above test a number of times " << endl;
+  cerr << endl << endl;
+
+  cerr << "f_name = file name containing the text words. "
+    "Each line should contain one word." << endl;
+  cerr << "vn = minimum size of the vector" << endl;
+  cerr << "vs = step size of the vector" << endl;
+  cerr << "vm = maximum size of the vector" << endl;
+}
+
+int
+main(int argc, char* a_p_argv[])
+{
+  using namespace pb_ds::test;
+
+  std::string f_name = "thirty_years_among_the_dead_preproc.txt";
+  size_t vn = 200;
+  size_t vs = 200;
+  size_t vm = 2100;
+
+  try
+    {
+      xml_test_performance_formatter fmt("Size", "Average time (sec.)");
+
+      typedef std::vector<std::pair<std::string, char> > vec_t;
+      vec_t a_v(vm);
+      text_populate(f_name, a_v);
+
+      typedef join_test<vec_t::const_iterator> test_t;
+      vec_t::const_iterator b = a_v.begin();
+      test_t tst(b, vn, vs, vm);
+      {
+	typedef pq_common_types<std::string>::performance_tl pq_tl_t;
+	pq_tl_t tl;
+	pb_ds::detail::typelist_apply(tst, tl);
+      }
+
+      {
+	typedef native_priority_queue<std::string, true> native_pq_t;
+	tst(pb_ds::detail::type_to_type<native_pq_t>());
+      }
+
+      {
+	typedef native_priority_queue<std::string, false> native_pq_t;
+	tst(pb_ds::detail::type_to_type<native_pq_t>());
+      }
+    }
+  catch(...)
+    {
+      std::cerr << "Test failed" << std::endl;
+      return -1;
+    }
+  return 0;
+}
diff --git a/libstdc++-v3/testsuite/performance/ext/pb_ds/priority_queue_text_modify_down_timing.cc b/libstdc++-v3/testsuite/performance/ext/pb_ds/priority_queue_text_modify_down_timing.cc
new file mode 100644
index 00000000000..614191118bf
--- /dev/null
+++ b/libstdc++-v3/testsuite/performance/ext/pb_ds/priority_queue_text_modify_down_timing.cc
@@ -0,0 +1,47 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+#include "priority_queue_text_modify_timing.hpp"
+
+void
+set_test_parameters(bool& b)
+{ b = false; }
+
diff --git a/libstdc++-v3/testsuite/performance/ext/pb_ds/priority_queue_text_modify_timing.hpp b/libstdc++-v3/testsuite/performance/ext/pb_ds/priority_queue_text_modify_timing.hpp
new file mode 100644
index 00000000000..58e9cf546f9
--- /dev/null
+++ b/libstdc++-v3/testsuite/performance/ext/pb_ds/priority_queue_text_modify_timing.hpp
@@ -0,0 +1,138 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file priority_queue_text_modify_timing_test.cpp
+ * Contains test for finding text.
+ */
+
+#include <ext/pb_ds/detail/typelist.hpp>
+#include <performance/io/xml_formatter.hpp>
+#include <io/verified_cmd_line_input.hpp>
+#include <common_type/priority_queue/common_type.hpp>
+#include <performance/priority_queue/timing/modify_test.hpp>
+#include <io/text_populate.hpp>
+#include <ext/pb_ds/detail/typelist.hpp>
+#include <native_type/priority_queue/native_priority_queue.hpp>
+#include <iostream>
+#include <vector>
+
+void
+usage();
+
+void
+set_test_parameters(bool& b);
+
+int
+main(int argc, char* a_p_argv[])
+{
+  using namespace pb_ds::test;
+
+  std::string f_name = "thirty_years_among_the_dead_preproc.txt";
+  size_t vn = 100;
+  size_t vs = 100;
+  size_t vm = 1100;
+  bool modify_up;
+
+  set_test_parameters(modify_up);
+
+  try
+    {
+      xml_test_performance_formatter fmt("Size", "Average time (sec.)");
+
+      typedef std::vector<std::pair<std::string, char> > vec_t;
+      vec_t a_v(vm);
+      text_populate(f_name, a_v);
+
+      typedef modify_test<vec_t::const_iterator> test_t;
+      vec_t::const_iterator b = a_v.begin();
+      test_t tst(b, vn, vs, vm, modify_up);
+      {
+	typedef pq_common_types<std::string>::performance_tl pq_tl_t;
+	pq_tl_t tl;
+	pb_ds::detail::typelist_apply(tst, tl);
+      }
+
+      {
+	typedef native_priority_queue<std::string, true> native_pq_t;
+	tst(pb_ds::detail::type_to_type<native_pq_t>());
+      }
+
+      {
+	typedef native_priority_queue<std::string, false> native_pq_t;
+	tst(pb_ds::detail::type_to_type<native_pq_t>());
+      }
+    }
+  catch (...)
+    {
+      std::cerr << "Test failed" << std::endl;
+      return -1;
+    }
+  return 0;
+}
+
+void
+usage()
+{
+  using namespace std;
+  cerr << "usage: priority_queue_text_modify_timing_test <f_name> <vn> <vs> <vm> <modify_up>" <<
+    endl << endl;
+
+  cerr <<
+    "This test checks the performance of various priority_queueiative containers "
+    "using their modify method. " << endl;
+  cerr << "Specifically, it does the following:" << endl;
+  cerr << "*  Creates a vector of text words " << endl;
+  cerr << "*  Pushes the elements into the container" << endl;
+  cerr << "*  Modifies the words in the container. If modify_up == 't', then" << endl;
+  cerr << "*      it modifies them to the largest word. If modify_up == 'f', then" << endl;
+  cerr << "*      it modifies them to the smallest word." << endl;
+  cerr << "*  Repeats the above test a number of times "
+	    << endl;
+
+  cerr << endl << endl;
+
+  cerr << "f_name = file name containing the text words. "
+    "Each line should contain one word." << endl;
+  cerr << "vn = minimum size of the vector" << endl;
+  cerr << "vs = step size of the vector" << endl;
+  cerr << "vm = maximum size of the vector" << endl;
+}
diff --git a/libstdc++-v3/testsuite/performance/ext/pb_ds/priority_queue_text_modify_up_timing.cc b/libstdc++-v3/testsuite/performance/ext/pb_ds/priority_queue_text_modify_up_timing.cc
new file mode 100644
index 00000000000..e2ff2bc7247
--- /dev/null
+++ b/libstdc++-v3/testsuite/performance/ext/pb_ds/priority_queue_text_modify_up_timing.cc
@@ -0,0 +1,47 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+#include "priority_queue_text_modify_timing.hpp"
+
+void
+set_test_parameters(bool& b)
+{ b = true; }
+
diff --git a/libstdc++-v3/testsuite/performance/ext/pb_ds/priority_queue_text_pop_mem_usage.cc b/libstdc++-v3/testsuite/performance/ext/pb_ds/priority_queue_text_pop_mem_usage.cc
new file mode 100644
index 00000000000..12820e90690
--- /dev/null
+++ b/libstdc++-v3/testsuite/performance/ext/pb_ds/priority_queue_text_pop_mem_usage.cc
@@ -0,0 +1,129 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file priority_queue_text_push_pop_timing_test.cpp
+ * Contains test for finding text.
+ */
+
+#include <ext/pb_ds/detail/typelist.hpp>
+#include <performance/io/xml_formatter.hpp>
+#include <io/verified_cmd_line_input.hpp>
+#include <common_type/priority_queue/common_type.hpp>
+#include <performance/priority_queue/mem_usage/pop_test.hpp>
+#include <io/text_populate.hpp>
+#include <ext/pb_ds/detail/typelist.hpp>
+#include <native_type/priority_queue/native_priority_queue.hpp>
+#include <performance/mem/mem_track_allocator.hpp>
+#include <iostream>
+#include <vector>
+
+void
+usage();
+
+int
+main(int argc, char* a_p_argv[])
+{
+  using namespace pb_ds::test;
+  std::string f_name = "thirty_years_among_the_dead_preproc.txt";
+
+  size_t vn = 200;
+  size_t vs = 200;
+  size_t vm = 2100;
+  try
+    {
+      xml_test_performance_formatter fmt("Size", "Memory (bytes)");
+
+      typedef std::basic_string<char, std::char_traits<char>, mem_track_allocator<char> > string_t;
+
+      typedef std::vector<std::pair< string_t, char> > vec_t;
+      vec_t a_v(vm);
+      text_populate(f_name, a_v);
+
+      typedef pop_test<vec_t::const_iterator> test_t;
+      vec_t::const_iterator b = a_v.begin();
+      test_t tst(b, vn, vs, vm);
+      {
+	typedef pq_common_types<string_t, std::less<string_t>, mem_track_allocator<char> >::performance_tl pq_tl_t;
+	pq_tl_t tl;
+	pb_ds::detail::typelist_apply(tst, tl);
+      }
+
+      {
+	typedef native_priority_queue<string_t, true, std::less<string_t>, mem_track_allocator<string_t> > native_pq_t;
+	tst(pb_ds::detail::type_to_type<native_pq_t>());
+      }
+
+      {
+	typedef native_priority_queue<string_t, false, std::less<string_t>, mem_track_allocator<string_t> > native_pq_t;
+	tst(pb_ds::detail::type_to_type<native_pq_t>());
+      }
+    }
+  catch (...)
+    {
+      std::cerr << "Test failed" << std::endl;
+      return -1;
+    }
+  return 0;
+}
+
+void
+usage()
+{
+  using namespace std;
+  cerr << "usage: priority_queue_text_pop_mem_usage_test <f_name> <vn> <vs> <vm>" <<
+    endl << endl;
+
+  cerr <<
+    "This test checks the performance of various priority_queueiative containers "
+    "using their push method. " << endl;
+  cerr << "Specifically, it does the following:" << endl;
+  cerr << "*  Creates a vector of text words " << endl;
+  cerr << "*  Pushes the elements into the container, then pops until it's empty." << endl;
+
+  cerr << endl << endl;
+
+  cerr << "f_name = file name containing the text words. "
+    "Each line should contain one word." << endl;
+  cerr << "vn = minimum size of the vector" << endl;
+  cerr << "vs = step size of the vector" << endl;
+  cerr << "vm = maximum size of the vector" << endl;
+}
diff --git a/libstdc++-v3/testsuite/performance/ext/pb_ds/priority_queue_text_push_pop_timing.cc b/libstdc++-v3/testsuite/performance/ext/pb_ds/priority_queue_text_push_pop_timing.cc
new file mode 100644
index 00000000000..13f5c00000b
--- /dev/null
+++ b/libstdc++-v3/testsuite/performance/ext/pb_ds/priority_queue_text_push_pop_timing.cc
@@ -0,0 +1,127 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file priority_queue_text_push_pop_timing_test.cpp
+ * Contains test for finding text.
+ */
+
+#include <ext/pb_ds/detail/typelist.hpp>
+#include <performance/io/xml_formatter.hpp>
+#include <io/verified_cmd_line_input.hpp>
+#include <common_type/priority_queue/common_type.hpp>
+#include <performance/priority_queue/timing/push_pop_test.hpp>
+#include <io/text_populate.hpp>
+#include <ext/pb_ds/detail/typelist.hpp>
+#include <native_type/priority_queue/native_priority_queue.hpp>
+#include <iostream>
+#include <vector>
+
+void
+usage();
+
+int
+main(int argc, char* a_p_argv[])
+{
+  using namespace pb_ds::test;
+  std::string f_name = "thirty_years_among_the_dead_preproc.txt";
+  size_t vn = 200;
+  size_t vs = 200;
+  size_t vm = 2100;
+
+  try
+    {
+      xml_test_performance_formatter fmt("Size", "Average time (sec.)");
+
+      typedef std::vector<std::pair<std::string, char> > vec_t;
+      vec_t a_v(vm);
+      text_populate(f_name, a_v);
+
+      typedef push_pop_test<vec_t::const_iterator> test_t;
+      vec_t::const_iterator b = a_v.begin();
+      test_t tst(b, vn, vs, vm);
+      {
+	typedef pq_common_types<std::string>::performance_tl pq_tl_t;
+	pq_tl_t tl;
+	pb_ds::detail::typelist_apply(tst, tl);
+      }
+
+      {
+	typedef native_priority_queue<std::string, true> native_pq_t;
+	tst(pb_ds::detail::type_to_type<native_pq_t>());
+      }
+
+      {
+	typedef native_priority_queue<std::string, false> native_pq_t;
+	tst(pb_ds::detail::type_to_type<native_pq_t>());
+      }
+    }
+  catch(...)
+    {
+      std::cerr << "Test failed" << std::endl;
+      return -1;
+    }
+  return 0;
+}
+
+void
+usage()
+{
+  using namespace std;
+  cerr << "usage: priority_queue_text_push_pop_timing_test "
+          "<f_name> <vn> <vs> <vm>" << endl << endl;
+
+  cerr << "This test checks the performance of various"
+    "priority_queue containers using their push method. " << endl;
+  cerr << "Specifically, it does the following:" << endl;
+  cerr << "*  Creates a vector of text words " << endl;
+  cerr << "*  Pushes the elements into the container, then pops until it's empty." << endl;
+  cerr << "*  Repeats the above test a number of times) "
+	    << endl;
+
+  cerr << endl << endl;
+
+  cerr << "f_name = file name containing the text words. "
+    "Each line should contain one word." << endl;
+  cerr << "vn = minimum size of the vector" << endl;
+  cerr << "vs = step size of the vector" << endl;
+  cerr << "vm = maximum size of the vector" << endl;
+}
diff --git a/libstdc++-v3/testsuite/performance/ext/pb_ds/priority_queue_text_push_timing.cc b/libstdc++-v3/testsuite/performance/ext/pb_ds/priority_queue_text_push_timing.cc
new file mode 100644
index 00000000000..f1f76e899c7
--- /dev/null
+++ b/libstdc++-v3/testsuite/performance/ext/pb_ds/priority_queue_text_push_timing.cc
@@ -0,0 +1,128 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file priority_queue_text_push_timing_test.cpp
+ * Contains test for finding text.
+ */
+
+#include <ext/pb_ds/detail/typelist.hpp>
+#include <performance/io/xml_formatter.hpp>
+#include <io/verified_cmd_line_input.hpp>
+#include <common_type/priority_queue/common_type.hpp>
+#include <performance/priority_queue/timing/push_test.hpp>
+#include <io/text_populate.hpp>
+#include <ext/pb_ds/detail/typelist.hpp>
+#include <native_type/priority_queue/native_priority_queue.hpp>
+#include <iostream>
+#include <vector>
+
+void
+usage();
+
+int
+main(int argc, char* a_p_argv[])
+{
+  using namespace pb_ds::test;
+  std::string f_name = "thirty_years_among_the_dead_preproc.txt";
+  size_t vn = 200;
+  size_t vs = 200;
+  size_t vm = 2100;
+
+  try
+    {
+      xml_test_performance_formatter fmt("Size", "Average time (sec.)");
+
+      typedef std::vector<std::pair<std::string, char> > vec_t;
+      vec_t a_v(vm);
+      text_populate(f_name, a_v);
+
+      typedef push_test<vec_t::const_iterator> test_t;
+      vec_t::const_iterator b = a_v.begin();
+      test_t tst(b, vn, vs, vm);
+      {
+	typedef pq_common_types<std::string>::performance_tl pq_tl_t;
+	pq_tl_t tl;
+	pb_ds::detail::typelist_apply(tst, tl);
+      }
+
+      {
+	typedef native_priority_queue<std::string, true> native_pq_t;
+	tst(pb_ds::detail::type_to_type<native_pq_t>());
+      }
+
+      {
+	typedef native_priority_queue<std::string, false> native_pq_t;
+	tst(pb_ds::detail::type_to_type<native_pq_t>());
+      }
+    }
+  catch(...)
+    {
+      std::cerr << "Test failed" << std::endl;
+      return -1;
+    }
+  return 0;
+}
+
+void
+usage()
+{
+  using namespace std;
+  cerr << "usage: priority_queue_text_push_timing_test <f_name> <vn> <vs> <vm>"
+       << endl << endl;
+
+  cerr <<
+    "This test checks the performance of various priority_queue containers "
+    "using their push method. " << endl;
+  cerr << "Specifically, it does the following:" << endl;
+  cerr << "*  Creates a vector of text words " << endl;
+  cerr << "*  Pushes the elements into the container" << endl;
+  cerr << "*  Repeats the above test a number of times "
+	    << endl;
+
+  cerr << endl << endl;
+
+  cerr << "f_name = file name containing the text words. "
+    "Each line should contain one word." << endl;
+  cerr << "vn = minimum size of the vector" << endl;
+  cerr << "vs = step size of the vector" << endl;
+  cerr << "vm = maximum size of the vector" << endl;
+}
diff --git a/libstdc++-v3/testsuite/performance/ext/pb_ds/random_int_find_timing.cc b/libstdc++-v3/testsuite/performance/ext/pb_ds/random_int_find_timing.cc
new file mode 100644
index 00000000000..ce7c56952da
--- /dev/null
+++ b/libstdc++-v3/testsuite/performance/ext/pb_ds/random_int_find_timing.cc
@@ -0,0 +1,137 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file random_int_find_timing_test.cpp
+ * Contains test for finding random integers.
+ */
+
+#include <ext/pb_ds/detail/typelist.hpp>
+#include <performance/io/xml_formatter.hpp>
+#include <native_type/assoc/native_hash_map.hpp>
+#include <native_type/assoc/native_map.hpp>
+#include <io/verified_cmd_line_input.hpp>
+#include <rng/twister_rand_gen.hpp>
+#include <common_type/assoc/common_type.hpp>
+#include <performance/assoc/timing/find_test.hpp>
+#include <ext/pb_ds/detail/typelist.hpp>
+#include <iostream>
+#include <vector>
+
+void
+usage();
+
+int
+main(int argc, char* a_p_argv[])
+{
+  using namespace pb_ds::test;
+
+  size_t vn = 200;
+  size_t vs = 200;
+  size_t vm = 2100;
+
+  try
+    {
+      xml_test_performance_formatter fmt("Size", "Average time (sec.)");
+
+      typedef std::vector< std::pair< int, char> > vec_t;
+      vec_t a_v(vm);
+      twister_rand_gen g;
+      for (size_t i = 0; i < vm; ++i)
+	a_v[i] = std::make_pair(static_cast<int>(g.get_unsigned_long()), 0);
+      vec_t::const_iterator b = a_v.begin();
+
+      typedef find_test< vec_t::const_iterator> test_t;
+      test_t tst(b, b, vn, vs, vm, vn, vs, vm);
+      {
+	typedef native_hash_map< int, char> native_t;
+	tst(pb_ds::detail::type_to_type<native_t>());
+      }
+
+      {
+	typedef native_map< int, char> native_t;
+	tst(pb_ds::detail::type_to_type<native_t>());
+      }
+
+      {
+	typedef hash_common_types<int, char>::performance_tl tl_t;
+	tl_t tl;
+	pb_ds::detail::typelist_apply(tst, tl);
+      }
+
+      {
+	typedef tree_common_types<int, char>::performance_tl tl_t;
+	tl_t tl;
+	pb_ds::detail::typelist_apply(tst, tl);
+      }
+    }
+  catch (...)
+    {
+      std::cerr << "Test failed" << std::endl;
+      return -1;
+    }
+  return 0;
+}
+
+void
+usage()
+{
+  using namespace std;
+  cerr << "usage: hash_random_int_find_timing_test <vn> <vs> <vm>" <<
+    endl << endl;
+
+  cerr <<
+    "This test checks the performance of various associative containers "
+    "using their find method. " << endl;
+  cerr << "Specifically, it does the following:"    << endl;
+  cerr << "*  Creates a vector of random integers "    << endl;
+  cerr << "*  Inserts the elements into the container"    << endl;
+  cerr << "*  Performs a sequence of find operations. At each iteration, "
+    "it finds, for each integer in the vector, its entry in the "
+    "container, using the find method";
+  cerr << "*  Repeats the above test a number of times" << endl;
+
+  cerr << endl << endl;
+
+  cerr << "vn = minimum size of the vector" << endl;
+  cerr << "vs = step size of the vector" << endl;
+  cerr << "vm = maximum size of the vector" << endl;
+}
diff --git a/libstdc++-v3/testsuite/performance/ext/pb_ds/random_int_subscript_find_timing.cc b/libstdc++-v3/testsuite/performance/ext/pb_ds/random_int_subscript_find_timing.cc
new file mode 100644
index 00000000000..5d796c26be2
--- /dev/null
+++ b/libstdc++-v3/testsuite/performance/ext/pb_ds/random_int_subscript_find_timing.cc
@@ -0,0 +1,137 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file random_int_subscript_find_timing_test.cpp
+ * Contains test for subscripting random integers.
+ */
+
+#include <ext/pb_ds/detail/typelist.hpp>
+#include <performance/io/xml_formatter.hpp>
+#include <native_type/assoc/native_hash_map.hpp>
+#include <native_type/assoc/native_map.hpp>
+#include <io/verified_cmd_line_input.hpp>
+#include <rng/twister_rand_gen.hpp>
+#include <common_type/assoc/common_type.hpp>
+#include <performance/assoc/timing/subscript_find_test.hpp>
+#include <ext/pb_ds/detail/typelist.hpp>
+#include <iostream>
+#include <vector>
+
+void
+usage();
+
+int
+main(int argc, char* a_p_argv[])
+{
+  using namespace pb_ds::test;
+
+  size_t vn = 200;
+  size_t vs = 200;
+  size_t vm = 2100;
+
+  try
+    {
+      xml_test_performance_formatter fmt("Size", "Average time (sec.)");
+
+      typedef std::vector<std::pair<int, size_t> > vec_t;
+      vec_t a_v(vm);
+      twister_rand_gen g;
+      for (size_t i = 0; i < vm; ++i)
+	a_v[i] = std::make_pair(static_cast<int>(g.get_unsigned_long()), 0);
+      vec_t::const_iterator b = a_v.begin();
+
+      typedef subscript_find_test<vec_t::const_iterator> test_t;
+      test_t tst(b, b, vn, vs, vm, vn, vs, vm);
+      {
+	typedef hash_common_types<int, size_t>::performance_tl tl_t;
+	tl_t tl;
+	pb_ds::detail::typelist_apply(tst, tl);
+      }
+
+      {
+	typedef tree_common_types<int, size_t>::performance_tl tl_t;
+	tl_t tl;
+	pb_ds::detail::typelist_apply(tst, tl);
+      }
+
+      {
+	typedef native_hash_map<int, size_t> native_t;
+	tst(pb_ds::detail::type_to_type<native_t>());
+      }
+
+      {
+	typedef native_map< int, size_t> native_t;
+	tst(pb_ds::detail::type_to_type<native_t>());
+      }
+    }
+  catch (...)
+    {
+      std::cerr << "Test failed" << std::endl;
+      return -1;
+    }
+  return 0;
+}
+
+void
+usage()
+{
+  using namespace std;
+  cerr << "usage: hash_random_int_subscript_find_timing_test <vn> <vs> <vm>" <<
+    endl << endl;
+
+  cerr <<
+    "This test checks the performance of various associative containers "
+    "using their find method. " << endl;
+  cerr << "Specifically, it does the following:"    << endl;
+  cerr << "*  Creates a vector of random integers "    << endl;
+  cerr << "*  Inserts the elements into the container"    << endl;
+  cerr << "*  Performs a sequence of find operations. At each iteration, "
+    "it finds, for each integer in the vector, its entry in the "
+    "container, using the subscript operator";
+  cerr << "*  Repeats the above test a number of times" << endl;
+
+  cerr << endl << endl;
+
+  cerr << "vn = minimum size of the vector" << endl;
+  cerr << "vs = step size of the vector" << endl;
+  cerr << "vm = maximum size of the vector" << endl;
+}
diff --git a/libstdc++-v3/testsuite/performance/ext/pb_ds/random_int_subscript_insert_timing.cc b/libstdc++-v3/testsuite/performance/ext/pb_ds/random_int_subscript_insert_timing.cc
new file mode 100644
index 00000000000..60e16dd1bcc
--- /dev/null
+++ b/libstdc++-v3/testsuite/performance/ext/pb_ds/random_int_subscript_insert_timing.cc
@@ -0,0 +1,134 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file random_int_subscript_insert_timing_test.cpp
+ * Contains test for subscripting random integers.
+ */
+
+#include <ext/pb_ds/detail/typelist.hpp>
+#include <performance/io/xml_formatter.hpp>
+#include <native_type/assoc/native_hash_map.hpp>
+#include <native_type/assoc/native_map.hpp>
+#include <io/verified_cmd_line_input.hpp>
+#include <rng/twister_rand_gen.hpp>
+#include <common_type/assoc/common_type.hpp>
+#include <performance/assoc/timing/subscript_insert_test.hpp>
+#include <ext/pb_ds/detail/typelist.hpp>
+#include <iostream>
+#include <vector>
+
+void
+usage();
+
+int
+main(int argc, char* a_p_argv[])
+{
+  using namespace pb_ds::test;
+  size_t vn = 200;
+  size_t vs = 200;
+  size_t vm = 2100;
+
+  try
+    {
+      xml_test_performance_formatter fmt("Size", "Average time (sec.)");
+
+      typedef std::vector<std::pair<int, size_t> > vec_t;
+      vec_t a_v(vm);
+      twister_rand_gen g;
+
+      for (size_t i = 0; i < vm; ++i)
+	a_v[i] = std::make_pair(static_cast<int>(g.get_unsigned_long()), 0);
+      vec_t::const_iterator b = a_v.begin();
+
+      typedef subscript_insert_test<vec_t::const_iterator> test_t;
+      test_t tst(b, b, vn, vs, vm, vn, vs, vm);
+      {
+	typedef hash_common_types<int, size_t>::performance_tl tl_t;
+	tl_t tl;
+	pb_ds::detail::typelist_apply(tst, tl);
+      }
+
+      {
+	typedef tree_common_types<int, size_t>::performance_tl tl_t;
+	tl_t tl;
+	pb_ds::detail::typelist_apply(tst, tl);
+      }
+
+      {
+	typedef native_hash_map< int, size_t> native_t;
+	tst(pb_ds::detail::type_to_type<native_t>());
+      }
+
+      {
+	typedef native_map< int, size_t> native_t;
+	tst(pb_ds::detail::type_to_type<native_t>());
+      }
+    }
+  catch(...)
+    {
+      std::cerr << "Test failed" << std::endl;
+      return -1;
+    }
+  return 0;
+}
+
+void
+usage()
+{
+  using namespace std;
+  cerr << "usage: hash_random_int_subscript_insert_timing_test <vn> <vs> <vm>" 
+       << endl << endl;
+
+  cerr <<
+    "This test checks the performance of various associative containers "
+    "using their find method. " << endl;
+  cerr << "Specifically, it does the following:" << endl;
+  cerr << "*  Creates a vector of random integers " << endl;
+  cerr << "*  Inserts the elements into the container" << endl;
+  cerr << "*  Repeats the above test a number of times" << endl;
+
+  cerr << endl << endl;
+
+  cerr << "vn = minimum size of the vector" << endl;
+  cerr << "vs = step size of the vector" << endl;
+  cerr << "vm = maximum size of the vector" << endl;
+}
diff --git a/libstdc++-v3/testsuite/performance/ext/pb_ds/text_find_timing.cc b/libstdc++-v3/testsuite/performance/ext/pb_ds/text_find_timing.cc
new file mode 100644
index 00000000000..a1cc598a78d
--- /dev/null
+++ b/libstdc++-v3/testsuite/performance/ext/pb_ds/text_find_timing.cc
@@ -0,0 +1,159 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file text_find_timing_test.cpp
+ * Contains test for finding text.
+ */
+
+#include <ext/pb_ds/detail/typelist.hpp>
+#include <performance/io/xml_formatter.hpp>
+#include <io/verified_cmd_line_input.hpp>
+#include <common_type/assoc/common_type.hpp>
+#include <performance/assoc/timing/find_test.hpp>
+#include <io/text_populate.hpp>
+#include <ext/pb_ds/detail/typelist.hpp>
+#include <hash_fn/string_hash_fn.hpp>
+#include <native_type/assoc/native_hash_map.hpp>
+#include <native_type/assoc/native_map.hpp>
+#include <iostream>
+#include <vector>
+
+void
+usage();
+
+int
+main(int argc, char* a_p_argv[])
+{
+  using namespace pb_ds::test;
+  std::string f_name = "thirty_years_among_the_dead_preproc.txt";
+  size_t vn = 200;
+  size_t vs = 200;
+  size_t vm = 2100;
+
+  try
+    {
+      xml_test_performance_formatter fmt("Size", "Average time (sec.)");
+      typedef std::vector<std::pair<std::string, char> > vec_t;
+
+      vec_t a_v(vm);
+      text_populate(f_name, a_v);
+      typedef find_test<vec_t::const_iterator, false> test_t;
+      vec_t::const_iterator b = a_v.begin();
+      test_t tst(b, b, vn, vs, vm, vn, vs, vm);
+      {
+	typedef trie_common_types<std::string, char>::performance_tl pat_trie_tl_t;
+
+	typedef tree_common_types<std::string, char>::performance_tl tree_tl_t;
+
+	typedef hash_common_types<std::string, char, string_hash_fn>::performance_tl hash_tl_t;
+
+	typedef pb_ds::detail::typelist_append<pat_trie_tl_t, pb_ds::detail::typelist_append<hash_tl_t, tree_tl_t>::type>::type tl_t;
+
+	tl_t tl;
+	pb_ds::detail::typelist_apply(tst, tl);
+      }
+
+      {
+	typedef native_map<std::string, char> native_map_t;
+	tst(pb_ds::detail::type_to_type<native_map_t>());
+
+	typedef native_hash_map<std::string, char, 8, string_hash_fn> native_hash_map_t;
+	tst(pb_ds::detail::type_to_type<native_hash_map_t>());
+
+	// XXX Unfortunately, this crashes
+#if 0
+#ifdef PB_DS_USE_TR1
+	typedef
+	  native_hash_map<
+	  std::string,
+	  char,
+	  8,
+	  string_hash_fn,
+	  std::equal_to<
+	  std::string>,
+	  std::less<
+	  std::string>,
+	  std::allocator<
+	  char>,
+	  true>
+	  sth_native_hash_map_t;
+
+	tst(pb_ds::detail::type_to_type<sth_native_hash_map_t>());
+#endif // #ifdef PB_DS_USE_TR1
+#endif // #if 0
+      }
+    }
+  catch(...)
+    {
+      std::cerr << "Test failed" << std::endl;
+      return -1;
+    }
+  return 0;
+}
+
+void
+usage()
+{
+  using namespace std;
+  cerr << "usage: text_find_timing_test <f_name> <vn> <vs> <vm>" <<
+    endl << endl;
+
+  cerr <<
+    "This test checks the performance of various associative containers "
+    "using their find method. " << endl;
+  cerr << "Specifically, it does the following:" << endl;
+  cerr << "*  Creates a vector of text words " << endl;
+  cerr << "*  Inserts the elements into the container" << endl;
+  cerr << "*  Performs a sequence of find operations. At each iteration, "
+    "it finds, for each word in the vector, its entry in the "
+    "container, using the find method" << endl;
+  cerr << "*  Repeats the above test a number of times) "
+	    << endl;
+
+  cerr << endl << endl;
+
+  cerr << "f_name = file name containing the text words. "
+    "Each line should contain one word." << endl;
+  cerr << "vn = minimum size of the vector" << endl;
+  cerr << "vs = step size of the vector" << endl;
+  cerr << "vm = maximum size of the vector" << endl;
+}
diff --git a/libstdc++-v3/testsuite/performance/ext/pb_ds/tree_order_statistics_timing.cc b/libstdc++-v3/testsuite/performance/ext/pb_ds/tree_order_statistics_timing.cc
new file mode 100644
index 00000000000..2af32f394d6
--- /dev/null
+++ b/libstdc++-v3/testsuite/performance/ext/pb_ds/tree_order_statistics_timing.cc
@@ -0,0 +1,116 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file tree_order_statistics_timing_test.cpp
+ * Contains test for order_statisticsing trees.
+ */
+
+#include <iostream>
+#include <vector>
+#include <ext/pb_ds/detail/typelist.hpp>
+#include <performance/io/xml_formatter.hpp>
+#include <io/verified_cmd_line_input.hpp>
+#include <rng/twister_rand_gen.hpp>
+#include <common_type/assoc/common_type.hpp>
+#include <ext/pb_ds/detail/typelist.hpp>
+#include <performance/assoc/timing/tree_order_statistics_test.hpp>
+
+void
+usage();
+
+int
+main(int argc, char* a_p_argv[])
+{
+  using namespace pb_ds::test;
+  size_t vn = 200;
+  size_t vs = 200;
+  size_t vm = 2100;
+
+  try
+    {
+      xml_test_performance_formatter fmt("Size", "Average time (sec.)");
+
+      {
+	typedef tree_order_statistics_test< true> test_t;
+	test_t tst(vn, vs, vm);
+	typedef tree_common_types<int, pb_ds::null_mapped_type, std::less<int>, pb_ds::tree_order_statistics_node_update>::performance_tl tl_t;
+	tl_t tl;
+	pb_ds::detail::typelist_apply(tst, tl);
+      }
+
+      {
+	typedef tree_order_statistics_test<false> test_t;
+	test_t tst(vn, vs, vm);
+	typedef native_set<int> native_set_t;
+	tst(pb_ds::detail::type_to_type<native_set_t>());
+      }
+    }
+  catch(...)
+    {
+      std::cerr << "Test failed" << std::endl;
+      return -1;
+    }
+  return 0;
+}
+
+void
+usage()
+{
+  using namespace std;
+  cerr << "usage: tree_order_statistics_timing_test.out <vn> <vs> <vm>" <<
+    endl << endl;
+
+  cerr << "This test checks the performance of order statistics"
+    " in tree based containers. " << endl;
+  cerr << "Specifically, it does the following:" << endl;
+  cerr << "*  Creates a tree" << endl;
+  cerr << "*  Inserts integers into the tree" << endl;
+  cerr << "*  Checks the order-statistics of each entry in the tree" << endl;
+  cerr << "*  Repeats the above test some times"
+	    << endl;
+
+  cerr << endl << endl;
+
+  cerr << "vn = minimum size of the tree" << endl;
+  cerr << "vs = step size of the tree" << endl;
+  cerr << "vm = maximum size of the tree" << endl;
+}
diff --git a/libstdc++-v3/testsuite/performance/ext/pb_ds/tree_split_join_timing.cc b/libstdc++-v3/testsuite/performance/ext/pb_ds/tree_split_join_timing.cc
new file mode 100644
index 00000000000..6de06c53335
--- /dev/null
+++ b/libstdc++-v3/testsuite/performance/ext/pb_ds/tree_split_join_timing.cc
@@ -0,0 +1,118 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file tree_split_join_timing_test.cpp
+ * Contains test for joining trees.
+ */
+
+#include <ext/pb_ds/detail/typelist.hpp>
+#include <performance/io/xml_formatter.hpp>
+#include <io/verified_cmd_line_input.hpp>
+#include <rng/twister_rand_gen.hpp>
+#include <common_type/assoc/common_type.hpp>
+#include <performance/assoc/timing/tree_split_join_test.hpp>
+#include <ext/pb_ds/detail/typelist.hpp>
+#include <iostream>
+#include <vector>
+
+void
+usage();
+
+int
+main(int argc, char* a_p_argv[])
+{
+  using namespace pb_ds::test;
+  size_t vn = 200;
+  size_t vs = 200;
+  size_t vm = 2100;
+
+  try
+    {
+      xml_test_performance_formatter fmt("Size", "Average time (sec.)");
+
+      {
+	typedef tree_split_join_test<true> test_t;
+	test_t tst(vn, vs, vm);
+
+	typedef tree_common_types<int, pb_ds::null_mapped_type>::performance_tl tl_t;
+	tl_t tl;
+	pb_ds::detail::typelist_apply(tst, tl);
+      }
+
+      {
+	typedef tree_split_join_test<false> test_t;
+	test_t tst(vn, vs, vm);
+	typedef native_set<int> native_set_t;
+	tst(pb_ds::detail::type_to_type<native_set_t>());
+      }
+    }
+  catch(...)
+    {
+      std::cerr << "Test failed" << std::endl;
+      return -1;
+    }
+  return 0;
+}
+
+void
+usage()
+{
+  using namespace std;
+  cerr << "usage: tree_split_join_test.cpp <vn> <vs> <vm>" <<
+    endl << endl;
+
+  cerr << "This test checks the performance of splitting joining" 
+          "tree based containers. " << endl;
+  cerr << "Specifically, it does the following:" << endl;
+  cerr << "*  Creates a tree " << endl;
+  cerr << "*  Inserts integers into the tree" << endl;
+  cerr << "*  Splits half the tree into a different tree" << endl;
+  cerr << "*  Joins the trees" << endl;
+  cerr << "*  Repeats the above test a given number of times) "
+	    << endl;
+
+  cerr << endl << endl;
+
+  cerr << "vn = minimum size of the tree" << endl;
+  cerr << "vs = step size of the tree" << endl;
+  cerr << "vm = maximum size of the tree" << endl;
+}
diff --git a/libstdc++-v3/testsuite/performance/ext/pb_ds/tree_text_insert_timing.cc b/libstdc++-v3/testsuite/performance/ext/pb_ds/tree_text_insert_timing.cc
new file mode 100644
index 00000000000..f61fe1c6d36
--- /dev/null
+++ b/libstdc++-v3/testsuite/performance/ext/pb_ds/tree_text_insert_timing.cc
@@ -0,0 +1,127 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file tree_text_insert_timing_test.cpp
+ * Contains test for finding text.
+ */
+
+#include <ext/pb_ds/detail/typelist.hpp>
+#include <performance/io/xml_formatter.hpp>
+#include <io/verified_cmd_line_input.hpp>
+#include <common_type/assoc/common_type.hpp>
+#include <performance/assoc/timing/insert_test.hpp>
+#include <io/text_populate.hpp>
+#include <ext/pb_ds/detail/typelist.hpp>
+#include <hash_fn/string_hash_fn.hpp>
+#include <native_type/assoc/native_hash_map.hpp>
+#include <native_type/assoc/native_map.hpp>
+#include <iostream>
+#include <vector>
+
+void
+usage();
+
+int
+main(int argc, char* a_p_argv[])
+{
+  using namespace pb_ds::test;
+  
+  std::string f_name = "thirty_years_among_the_dead_preproc.txt";
+  size_t vn = 200;
+  size_t vs = 200;
+  size_t vm = 2100;
+  try
+    {
+      xml_test_performance_formatter fmt("Size", "Average time (sec.)");
+
+      typedef std::vector<std::pair<std::string, char> > vec_t;
+      vec_t a_v(vm);
+      text_populate(f_name, a_v);
+
+      typedef insert_test< vec_t::const_iterator> test_t;
+      vec_t::const_iterator b = a_v.begin();
+      test_t tst(b, vn, vs, vm);
+      {
+	typedef trie_common_types<std::string, char>::performance_tl pat_trie_tl_t;
+	typedef tree_common_types<std::string, char>::performance_tl tree_tl_t;
+	typedef pb_ds::detail::typelist_append<pat_trie_tl_t, tree_tl_t>::type tl_t;
+	tl_t tl;
+	pb_ds::detail::typelist_apply(tst, tl);
+      }
+
+      {
+	typedef native_map<std::string, char> native_map_t;
+	tst(pb_ds::detail::type_to_type<native_map_t>());
+      }
+    }
+  catch (...)
+    {
+      std::cerr << "Test failed" << std::endl;
+      return -1;
+    }
+  return 0;
+}
+
+void
+usage()
+{
+  using namespace std;
+  cerr << "usage: tree_text_insert_timing_test <f_name> <vn> <vs> <vm>" <<
+    endl << endl;
+
+  cerr <<
+    "This test checks the performance of various associative containers "
+    "using their insert method. " << endl;
+  cerr << "Specifically, it does the following:" << endl;
+  cerr << "*  Creates a vector of text words " << endl;
+  cerr << "*  Inserts the elements into the container" << endl;
+  cerr << "*  Repeats the above test a number of times) "
+	    << endl;
+
+  cerr << endl << endl;
+
+  cerr << "f_name = file name containing the text words. "
+    "Each line should contain one word." << endl;
+  cerr << "vn = minimum size of the vector" << endl;
+  cerr << "vs = step size of the vector" << endl;
+  cerr << "vm = maximum size of the vector" << endl;
+}
diff --git a/libstdc++-v3/testsuite/performance/ext/pb_ds/tree_text_lor_find_timing.cc b/libstdc++-v3/testsuite/performance/ext/pb_ds/tree_text_lor_find_timing.cc
new file mode 100644
index 00000000000..4dd52445d62
--- /dev/null
+++ b/libstdc++-v3/testsuite/performance/ext/pb_ds/tree_text_lor_find_timing.cc
@@ -0,0 +1,126 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file tree_text_lor_find_timing_test.cpp
+ * Contains test for finding text with locality of reference.
+ */
+
+#include <ext/pb_ds/detail/typelist.hpp>
+#include <performance/io/xml_formatter.hpp>
+#include <io/verified_cmd_line_input.hpp>
+#include <common_type/assoc/common_type.hpp>
+#include <performance/assoc/timing/find_test.hpp>
+#include <io/text_populate.hpp>
+#include <ext/pb_ds/detail/typelist.hpp>
+#include <native_type/assoc/native_map.hpp>
+#include <iostream>
+#include <vector>
+
+void
+usage();
+
+int
+main(int argc, char* a_p_argv[])
+{
+  using namespace pb_ds::test;
+
+  std::string f_name = "thirty_years_among_the_dead_preproc.txt";
+  size_t vn = 200;
+  size_t vs = 200;
+  size_t vm = 2100;
+
+  try
+    {
+      xml_test_performance_formatter fmt("Size", "Average time (sec.)");
+
+      typedef std::vector<std::pair<std::string, char> > vec_t;
+      vec_t a_v(vm);
+      text_populate(f_name, a_v);
+
+      typedef find_test<vec_t::const_iterator, true> test_t;
+      vec_t::const_iterator b = a_v.begin();
+      test_t tst(b, b, vn, vs, vm, vn, vs, vm);
+      {
+	typedef native_map<std::string, char> native_set_t;
+	tst(pb_ds::detail::type_to_type<native_set_t>());
+      }
+
+      {
+	typedef tree_common_types<std::string, char>::performance_tl tree_tl_t;
+	tree_tl_t tl;
+	pb_ds::detail::typelist_apply(tst, tl);
+      }
+    }
+  catch(...)
+    {
+      std::cerr << "Test failed" << std::endl;
+      return -1;
+    }
+  return 0;
+}
+
+void
+usage()
+{
+  using namespace std;
+  cerr << "usage: tree_text_lor_find_performance_test <f_name> <vn> <vs> <vm>" 
+       << endl << endl;
+
+  cerr <<
+    "This test checks the performance of various associative containers "
+    "using their find method. " << endl;
+  cerr << "Specifically, it does the following:" << endl;
+  cerr << "*  Creates a vector of text words " << endl;
+  cerr << "*  Inserts the elements into the container" << endl;
+  cerr << "*  Performs a sequence of find operations. At each iteration, "
+    "it finds, for each word in the vector, its entry in the "
+    "container, using the find method" << endl;
+  cerr << "*  Repeats the above test a number of times" << endl;
+
+  cerr << endl << endl;
+
+  cerr << "f_name = file name containing the text words. "
+    "Each line should contain one word." << endl;
+  cerr << "vn = minimum size of the vector" << endl;
+  cerr << "vs = step size of the vector" << endl;
+  cerr << "vm = maximum size of the vector" << endl;
+}
diff --git a/libstdc++-v3/testsuite/util/common_type/assoc/common_type.hpp b/libstdc++-v3/testsuite/util/common_type/assoc/common_type.hpp
new file mode 100644
index 00000000000..df07eb38644
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/common_type/assoc/common_type.hpp
@@ -0,0 +1,847 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file common_type.hpp
+ * Contains common types.
+ */
+
+#ifndef PB_DS_COMMON_TYPES_HPP
+#define PB_DS_COMMON_TYPES_HPP
+
+#include <ext/pb_ds/detail/type_utils.hpp>
+#include <common_type/assoc/template_policy.hpp>
+#include <ext/pb_ds/assoc_container.hpp>
+
+namespace pb_ds
+{
+
+  namespace test
+  {
+
+    template<typename Key,
+	     typename Data,
+	     class Hash_Fn =
+	     typename pb_ds::detail::default_hash_fn<
+      Key>::type,
+	     class Eq_Fn =
+	     std::equal_to<Key>,
+	     class Allocator =
+	     std::allocator< std::pair<const Key, Data> > >
+    struct hash_common_types
+    {
+    private:
+      typedef typename Allocator::size_type size_type;
+
+      typedef
+      pb_ds::test::hash_load_check_resize_trigger_t_<
+	Allocator,
+	1, 8,
+	1, 2,
+	false>
+      no_access_half_load_check_resize_trigger_policy;
+
+      typedef
+      pb_ds::test::hash_load_check_resize_trigger_t_<
+	Allocator,
+	1, 8,
+	1, 2,
+	true>
+      access_half_load_check_resize_trigger_policy;
+
+      typedef
+      pb_ds::test::hash_load_check_resize_trigger_t_<
+	Allocator,
+	1, 8,
+	1, 1,
+	false>
+      no_access_one_load_check_resize_trigger_policy;
+
+      typedef
+      pb_ds::test::cc_hash_max_collision_check_resize_trigger_t_<
+	Allocator,
+	1, 2,
+	false>
+      no_access_half_max_col_check_check_resize_trigger_policy;
+
+      typedef
+      pb_ds::test::cc_hash_max_collision_check_resize_trigger_t_<
+	Allocator,
+	1, 2,
+	true>
+      access_half_max_col_check_check_resize_trigger_policy;
+
+      typedef pb_ds::test::linear_probe_fn_t_< Key, Allocator> lin_p_t;
+
+      typedef pb_ds::test::quadratic_probe_fn_t_< Key, Allocator> quad_p_t;
+
+      typedef
+      typename pb_ds::detail::typelist4<
+	pb_ds::detail::false_type,
+	pb_ds::test::direct_mask_range_hashing_t_<
+	Allocator>,
+	no_access_half_load_check_resize_trigger_policy,
+	pb_ds::test::hash_exponential_size_policy_t_<
+	Allocator> >::type
+      performance_cc_policy0;
+
+      typedef
+      typename pb_ds::detail::typelist4<
+	pb_ds::detail::false_type,
+	pb_ds::test::direct_mod_range_hashing_t_<
+	Allocator>,
+	no_access_half_load_check_resize_trigger_policy,
+	pb_ds::test::hash_prime_size_policy_t_>::type
+      performance_cc_policy1;
+
+      typedef
+      typename pb_ds::detail::typelist4<
+	pb_ds::detail::false_type,
+	pb_ds::test::direct_mask_range_hashing_t_<
+	Allocator>,
+	no_access_one_load_check_resize_trigger_policy,
+	pb_ds::test::hash_exponential_size_policy_t_<
+	Allocator> >::type
+      performance_cc_policy2;
+
+      typedef
+      typename pb_ds::detail::typelist4<
+	pb_ds::detail::false_type,
+	pb_ds::test::direct_mod_range_hashing_t_<
+	Allocator>,
+	no_access_one_load_check_resize_trigger_policy,
+	pb_ds::test::hash_prime_size_policy_t_ >::type
+      performance_cc_policy3;
+
+      typedef
+      typename pb_ds::detail::typelist4<
+	pb_ds::detail::true_type,
+	pb_ds::test::direct_mask_range_hashing_t_<
+	Allocator>,
+	no_access_half_load_check_resize_trigger_policy,
+	pb_ds::test::hash_exponential_size_policy_t_<
+	Allocator> >::type
+      performance_cc_policy4;
+
+      typedef
+      typename pb_ds::detail::typelist4<
+	pb_ds::detail::false_type,
+	pb_ds::test::direct_mask_range_hashing_t_<
+	Allocator>,
+	no_access_half_max_col_check_check_resize_trigger_policy,
+	pb_ds::test::hash_exponential_size_policy_t_<
+	Allocator> >::type
+      performance_cc_policy5;
+
+      typedef
+      typename pb_ds::detail::typelist4<
+	pb_ds::detail::false_type,
+	pb_ds::test::direct_mask_range_hashing_t_<
+	Allocator>,
+	access_half_max_col_check_check_resize_trigger_policy,
+	pb_ds::test::hash_exponential_size_policy_t_<
+	Allocator> >::type
+      regression_cc_policy0;
+
+      typedef
+      typename pb_ds::detail::typelist4<
+	pb_ds::detail::false_type,
+	pb_ds::test::direct_mask_range_hashing_t_<
+	Allocator>,
+	access_half_load_check_resize_trigger_policy,
+	pb_ds::test::hash_exponential_size_policy_t_<
+	Allocator> >::type
+      regression_cc_policy1;
+
+      typedef
+      typename pb_ds::detail::typelist4<
+	pb_ds::detail::true_type,
+	pb_ds::test::direct_mod_range_hashing_t_<
+	Allocator>,
+	no_access_half_load_check_resize_trigger_policy,
+	pb_ds::test::hash_prime_size_policy_t_ >::type
+      regression_cc_policy2;
+
+      typedef
+      typename pb_ds::detail::typelist5<
+	pb_ds::detail::false_type,
+	lin_p_t,
+	pb_ds::test::direct_mask_range_hashing_t_<
+	Allocator>,
+	no_access_half_load_check_resize_trigger_policy,
+	pb_ds::test::hash_exponential_size_policy_t_<
+	Allocator> >::type
+      performance_gp_policy0;
+
+      typedef
+      typename pb_ds::detail::typelist5<
+	pb_ds::detail::false_type,
+	quad_p_t,
+	pb_ds::test::direct_mod_range_hashing_t_<
+	Allocator>,
+	no_access_half_load_check_resize_trigger_policy,
+	pb_ds::test::hash_prime_size_policy_t_ >::type
+      performance_gp_policy1;
+
+      typedef
+      typename pb_ds::detail::typelist5<
+	pb_ds::detail::false_type,
+	quad_p_t,
+	pb_ds::test::direct_mod_range_hashing_t_<
+	Allocator>,
+	access_half_load_check_resize_trigger_policy,
+	pb_ds::test::hash_prime_size_policy_t_>::type
+      regression_gp_policy0;
+
+      typedef
+      typename pb_ds::detail::typelist5<
+	pb_ds::detail::true_type,
+	lin_p_t,
+	pb_ds::test::direct_mask_range_hashing_t_<
+	Allocator>,
+	access_half_load_check_resize_trigger_policy,
+	pb_ds::test::hash_exponential_size_policy_t_<
+	Allocator> >::type
+      regression_gp_policy1;
+
+      typedef
+      typename pb_ds::detail::typelist6<
+	performance_cc_policy0,
+	performance_cc_policy1,
+	performance_cc_policy2,
+	performance_cc_policy3,
+	performance_cc_policy4,
+	performance_cc_policy5>::type
+      performance_cc_range_hashing_policies;
+
+      typedef
+      typename pb_ds::detail::typelist3<
+	regression_cc_policy0,
+	regression_cc_policy1,
+	regression_cc_policy2>::type
+      regression_cc_range_hashing_policies;
+
+      typedef
+      typename pb_ds::detail::typelist2<
+	performance_gp_policy0,
+	performance_gp_policy1>::type
+      performance_gp_range_hashing_policies;
+
+      typedef
+      typename pb_ds::detail::typelist2<
+	regression_gp_policy0,
+	regression_gp_policy1>::type
+      regression_gp_range_hashing_policies;
+
+      template<typename Policy_Tl>
+      struct no_access_generic_cc_hash_table_t
+      {
+      private:
+        typedef
+	typename pb_ds::detail::typelist_at_index<
+	Policy_Tl, 0>::type
+	store_hash_indicator;
+
+        enum
+	  {
+            store_hash = store_hash_indicator::value
+	  };
+
+        typedef
+	typename pb_ds::detail::typelist_at_index<
+	  Policy_Tl, 1>::type
+	comb_hash_fn;
+
+        typedef
+	typename pb_ds::detail::typelist_at_index<
+	  Policy_Tl, 2>::type
+	trigger_policy;
+
+        typedef
+	typename pb_ds::detail::typelist_at_index<
+	  Policy_Tl, 3>::type
+	size_policy;
+
+      public:
+        typedef
+	pb_ds::cc_hash_table<
+	Key,
+	Data,
+	Hash_Fn,
+	Eq_Fn,
+	comb_hash_fn,
+	pb_ds::hash_standard_resize_policy<
+	size_policy,
+	trigger_policy,
+	false>,
+	store_hash,
+	Allocator>
+	type;
+      };
+
+      template<typename Policy_Tl>
+      struct access_generic_cc_hash_table_t
+      {
+      private:
+        typedef
+	typename pb_ds::detail::typelist_at_index<
+	Policy_Tl, 0>::type
+	store_hash_indicator;
+
+        enum
+	  {
+            store_hash = store_hash_indicator::value
+	  };
+
+        typedef
+	typename pb_ds::detail::typelist_at_index<
+	  Policy_Tl, 1>::type
+	comb_hash_fn;
+
+        typedef
+	typename pb_ds::detail::typelist_at_index<
+	  Policy_Tl, 2>::type
+	trigger_policy;
+
+        typedef
+	typename pb_ds::detail::typelist_at_index<
+	  Policy_Tl, 3>::type
+	size_policy;
+
+      public:
+        typedef
+	pb_ds::cc_hash_table<
+	Key,
+	Data,
+	Hash_Fn,
+	Eq_Fn,
+	comb_hash_fn,
+	pb_ds::hash_standard_resize_policy<
+	size_policy,
+	trigger_policy,
+	true>,
+	store_hash,
+	Allocator>
+	type;
+      };
+
+      template<typename Policy_Tl>
+      struct no_access_generic_gp_hash_table_t
+      {
+      private:
+        typedef
+	typename pb_ds::detail::typelist_at_index<
+	Policy_Tl, 0>::type
+	store_hash_indicator;
+
+        enum
+	  {
+            store_hash = store_hash_indicator::value
+	  };
+
+        typedef
+	typename pb_ds::detail::typelist_at_index<
+	  Policy_Tl, 1>::type
+	probe_fn;
+
+        typedef
+	typename pb_ds::detail::typelist_at_index<
+	  Policy_Tl, 2>::type
+	comb_probe_fn;
+
+        typedef
+	typename pb_ds::detail::typelist_at_index<
+	  Policy_Tl, 3>::type
+	trigger_policy;
+
+        typedef
+	typename pb_ds::detail::typelist_at_index<
+	  Policy_Tl, 4>::type
+	size_policy;
+
+      public:
+        typedef
+	pb_ds::gp_hash_table<
+	Key,
+	Data,
+	Hash_Fn,
+	Eq_Fn,
+	comb_probe_fn,
+	probe_fn,
+	pb_ds::hash_standard_resize_policy<
+	size_policy,
+	trigger_policy,
+	false>,
+	store_hash,
+	Allocator>
+	type;
+      };
+
+      template<typename Policy_Tl>
+      struct access_generic_gp_hash_table_t
+      {
+      private:
+        typedef
+	typename pb_ds::detail::typelist_at_index<
+	Policy_Tl, 0>::type
+	store_hash_indicator;
+
+        enum
+	  {
+            store_hash = store_hash_indicator::value
+	  };
+
+        typedef
+	typename pb_ds::detail::typelist_at_index<
+	  Policy_Tl, 1>::type
+	probe_fn;
+
+        typedef
+	typename pb_ds::detail::typelist_at_index<
+	  Policy_Tl, 2>::type
+	comb_probe_fn;
+
+        typedef
+	typename pb_ds::detail::typelist_at_index<
+	  Policy_Tl, 3>::type
+	trigger_policy;
+
+        typedef
+	typename pb_ds::detail::typelist_at_index<
+	  Policy_Tl, 4>::type
+	size_policy;
+
+      public:
+        typedef
+	pb_ds::gp_hash_table<
+	Key,
+	Data,
+	Hash_Fn,
+	Eq_Fn,
+	comb_probe_fn,
+	probe_fn,
+	pb_ds::hash_standard_resize_policy<
+	size_policy,
+	trigger_policy,
+	true>,
+	store_hash,
+	Allocator>
+	type;
+      };
+
+      typedef
+      typename pb_ds::detail::typelist_transform<
+	performance_cc_range_hashing_policies,
+	no_access_generic_cc_hash_table_t>::type
+      performance_cc_types;
+
+      typedef
+      typename pb_ds::detail::typelist_transform<
+	regression_cc_range_hashing_policies,
+	access_generic_cc_hash_table_t>::type
+      regression_cc_types;
+
+      typedef
+      typename pb_ds::detail::typelist_at_index<
+	performance_cc_types,
+	0>::type
+      performance_min_cc_type;
+
+      typedef
+      typename pb_ds::detail::typelist_transform<
+	performance_gp_range_hashing_policies,
+	no_access_generic_gp_hash_table_t>::type
+      performance_gp_types;
+
+      typedef
+      typename pb_ds::detail::typelist_transform<
+	regression_gp_range_hashing_policies,
+	access_generic_gp_hash_table_t>::type
+      regression_gp_types;
+
+      typedef
+      typename pb_ds::detail::typelist_at_index<
+	performance_gp_types,
+	0>::type
+      performance_min_gp_type;
+
+    public:
+      typedef
+      typename pb_ds::detail::typelist_append<
+      performance_cc_types,
+      performance_gp_types>::type
+      performance_tl;
+
+      typedef
+      typename pb_ds::detail::typelist_append<
+	regression_gp_types,
+	regression_cc_types>::type
+      regression_tl;
+
+      typedef
+      typename pb_ds::detail::typelist1<
+	performance_min_cc_type>::type
+      performance_min_tl;
+    };
+
+    template<typename Key,
+	     typename Data,
+	     class Comb_Hash_Fn_TL,
+	     class Comb_Probe_Fn_TL,
+	     class Eq_Fn =
+	     std::equal_to<Key>,
+	     class Allocator =
+	     std::allocator<
+      std::pair<
+      const Key,
+      Data> > >
+    struct ranged_hash_common_types
+    {
+    private:
+      typedef typename Allocator::size_type size_type;
+
+      typedef
+      pb_ds::test::hash_load_check_resize_trigger_t_<
+	Allocator,
+	1, 8,
+	1, 2,
+	false>
+      no_access_half_load_check_resize_trigger_policy;
+
+      typedef
+      pb_ds::test::hash_load_check_resize_trigger_t_<
+	Allocator,
+	1, 8,
+	1, 1,
+	false>
+      no_access_one_load_check_resize_trigger_policy;
+
+      typedef
+      pb_ds::hash_standard_resize_policy<
+	pb_ds::test::hash_exponential_size_policy_t_<
+	Allocator>,
+	no_access_half_load_check_resize_trigger_policy>
+      mask_half_resize_policy_t;
+
+      typedef
+      pb_ds::hash_standard_resize_policy<
+	pb_ds::test::hash_exponential_size_policy_t_<
+	Allocator>,
+	no_access_one_load_check_resize_trigger_policy>
+      mask_one_resize_policy_t;
+
+      typedef
+      pb_ds::hash_standard_resize_policy<
+	pb_ds::test::hash_prime_size_policy_t_,
+	no_access_half_load_check_resize_trigger_policy>
+      mod_half_resize_policy_t;
+
+      typedef
+      pb_ds::hash_standard_resize_policy<
+	pb_ds::test::hash_prime_size_policy_t_,
+	no_access_one_load_check_resize_trigger_policy>
+      mod_one_resize_policy_t;
+
+      template<typename Comb_Hash_Fn_>
+      struct half_resize_policy_selector;
+
+      template<typename Allocator_>
+      struct half_resize_policy_selector<
+        pb_ds::test::direct_mask_range_hashing_t_<
+	Allocator_> >
+      {
+        typedef mask_half_resize_policy_t type;
+      };
+
+      template<typename Allocator_>
+      struct half_resize_policy_selector<
+        pb_ds::test::direct_mod_range_hashing_t_<
+	Allocator_> >
+      {
+        typedef mod_half_resize_policy_t type;
+      };
+
+      template<typename Comb_Hash_Fn_>
+      struct one_resize_policy_selector;
+
+      template<typename Allocator_>
+      struct one_resize_policy_selector<
+        pb_ds::test::direct_mask_range_hashing_t_<
+	Allocator_> >
+      {
+        typedef mask_one_resize_policy_t type;
+      };
+
+      template<typename Allocator_>
+      struct one_resize_policy_selector<
+        pb_ds::test::direct_mod_range_hashing_t_<
+	Allocator_> >
+      {
+        typedef mod_one_resize_policy_t type;
+      };
+
+      template<typename Comb_Hash_Fn>
+      struct generic_cc_hash_table_t
+      {
+        typedef
+	pb_ds::cc_hash_table<
+	  Key,
+	  Data,
+	  pb_ds::null_hash_fn,
+	  Eq_Fn,
+	  Comb_Hash_Fn,
+	  typename one_resize_policy_selector<
+	  typename Comb_Hash_Fn::comb_fn>::type,
+	  false,
+	  Allocator>
+	type;
+      };
+
+      typedef
+      typename pb_ds::detail::typelist_transform<
+	Comb_Hash_Fn_TL,
+	generic_cc_hash_table_t>::type
+      performance_cc_types;
+
+      template<typename Comb_Probe_Fn>
+      struct no_access_generic_gp_hash_table_t
+      {
+        typedef
+	pb_ds::gp_hash_table<
+	  Key,
+	  Data,
+	  pb_ds::null_hash_fn,
+	  Eq_Fn,
+	  Comb_Probe_Fn,
+	  pb_ds::null_probe_fn,
+	  typename half_resize_policy_selector<
+	  typename Comb_Probe_Fn::comb_fn>::type,
+	  false,
+	  Allocator>
+	type;
+      };
+
+      typedef
+      typename pb_ds::detail::typelist_transform<
+	Comb_Probe_Fn_TL,
+	no_access_generic_gp_hash_table_t>::type
+      performance_gp_types;
+
+    public:
+      typedef
+      typename pb_ds::detail::typelist_append<
+      performance_cc_types,
+      performance_gp_types>::type
+      performance_tl;
+    };
+
+    template<typename Key, typename Data, class Eq_Fn = std::equal_to<Key>,
+	     class Allocator =
+	     std::allocator<char> >
+    class lu_common_types
+    {
+    private:
+      typedef typename Allocator::size_type size_type;
+
+      typedef pb_ds::test::move_to_front_lu_policy_t_ mtf_u;
+
+      typedef pb_ds::test::counter_lu_policy_t_< Allocator, 5> cnt_5_u;
+
+      typedef typename pb_ds::detail::typelist1< mtf_u>::type lu_policy0;
+
+      typedef typename pb_ds::detail::typelist1< cnt_5_u>::type lu_policy1;
+
+      typedef
+      typename pb_ds::detail::typelist2<
+	lu_policy0,
+	lu_policy1>::type
+      lu_policies;
+
+      template<typename Policy_Tl>
+      struct generic_list_update_t
+      {
+      private:
+        typedef
+	typename pb_ds::detail::typelist_at_index<
+	Policy_Tl, 0>::type
+	update_policy_t;
+
+      public:
+        typedef
+	pb_ds::list_update<
+	Key,
+	Data,
+	Eq_Fn,
+	update_policy_t,
+	Allocator>
+	type;
+      };
+
+      typedef
+      typename pb_ds::detail::typelist_transform<
+	lu_policies,
+	generic_list_update_t>::type
+      lu_types;
+
+      typedef
+      typename pb_ds::detail::typelist_at_index<
+	lu_types,
+	0>::type
+      min_lu_type;
+
+    public:
+      typedef lu_types performance_tl;
+
+      typedef lu_types regression_tl;
+
+      typedef
+      typename pb_ds::detail::typelist1<
+	min_lu_type>::type
+      performance_min_tl;
+    };
+
+    template<typename Key, typename Data, class Cmp_Fn = std::less<Key>,
+	     template<typename Const_Node_Iterator,
+		      class Node_Iterator,
+		      class Cmp_Fn_,
+		      class Allocator_>
+    class Node_Update =
+	     pb_ds::null_tree_node_update,
+	     class Allocator =
+	     std::allocator<std::pair<const Key, Data> > >
+    struct tree_common_types
+    {
+    private:
+      typedef
+      pb_ds::tree<
+      Key,
+      Data,
+      Cmp_Fn,
+      pb_ds::ov_tree_tag,
+      Node_Update,
+      Allocator>
+      ov_tree_assoc_container_t;
+
+      typedef
+      pb_ds::tree<
+	Key,
+	Data,
+	Cmp_Fn,
+	pb_ds::rb_tree_tag,
+	Node_Update,
+	Allocator>
+      rb_tree_assoc_container_t;
+
+      typedef
+      pb_ds::tree<
+	Key,
+	Data,
+	Cmp_Fn,
+	pb_ds::splay_tree_tag,
+	Node_Update,
+	Allocator>
+      splay_tree_assoc_container_t;
+
+    public:
+      typedef
+      typename pb_ds::detail::typelist3<
+      splay_tree_assoc_container_t,
+      rb_tree_assoc_container_t,
+      ov_tree_assoc_container_t>::type
+      performance_tl;
+
+      typedef
+      typename pb_ds::detail::typelist3<
+	ov_tree_assoc_container_t,
+	splay_tree_assoc_container_t,
+	rb_tree_assoc_container_t>::type
+      regression_tl;
+
+      typedef
+      typename pb_ds::detail::typelist1<
+	rb_tree_assoc_container_t>::type
+      performance_min_tl;
+    };
+
+    template<typename Key,
+	     typename Data,
+	     class E_Access_Traits =
+	     typename pb_ds::detail::default_trie_e_access_traits<
+      Key>::type,
+	     class Tag =
+	     pb_ds::pat_trie_tag,
+	     template<typename Const_Node_Iterator,
+		      typename Node_Iterator,
+		      class E_Access_Traits_,
+		      typename Allocator_>
+    class Node_Update =
+	     pb_ds::null_trie_node_update,
+	     class Allocator =
+	     std::allocator<char> >
+    class trie_common_types
+    {
+    private:
+      typedef
+      pb_ds::trie<
+      Key,
+      Data,
+      E_Access_Traits,
+      Tag,
+      Node_Update,
+      Allocator>
+      type;
+
+    public:
+      typedef typename pb_ds::detail::typelist1< type>::type performance_tl;
+
+      typedef typename pb_ds::detail::typelist1< type>::type regression_tl;
+
+      typedef
+      typename pb_ds::detail::typelist1<
+	type>::type
+      performance_min_tl;
+    };
+
+  } // namespace test
+
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_COMMON_TYPES_HPP
diff --git a/libstdc++-v3/testsuite/util/common_type/assoc/detail/comb_hash_fn_string_form.hpp b/libstdc++-v3/testsuite/util/common_type/assoc/detail/comb_hash_fn_string_form.hpp
new file mode 100644
index 00000000000..024caab4b2b
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/common_type/assoc/detail/comb_hash_fn_string_form.hpp
@@ -0,0 +1,122 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file comb_hash_fn_string_form.hpp
+ * Transforms containers into string form.
+ */
+
+#ifndef PB_DS_COMB_HASH_FN_STRING_FORM_HPP
+#define PB_DS_COMB_HASH_FN_STRING_FORM_HPP
+
+#include <string>
+#include <common_type/assoc/template_policy.hpp>
+#include <io/xml.hpp>
+
+namespace pb_ds
+{
+
+  namespace test
+  {
+
+    namespace detail
+    {
+
+      template<typename Comb_Hash_Fn>
+      struct comb_hash_fn_string_form
+      {
+	static std::string
+        name()
+	{
+	  return (Comb_Hash_Fn::name());
+	}
+
+	static std::string
+        desc()
+	{
+	  return (Comb_Hash_Fn::desc());
+	}
+      };
+
+      template<typename Size_Type>
+      struct comb_hash_fn_string_form<
+	direct_mask_range_hashing_t_<
+        Size_Type> >
+      {
+	static std::string
+        name()
+	{
+	  return ("mask_");
+	}
+
+	static std::string
+        desc()
+	{
+	  return (make_xml_tag(            "Comb_Hash_Fn", "value", "direct_mask_range_hashing"));
+	}
+      };
+
+      template<typename Size_Type>
+      struct comb_hash_fn_string_form<
+	direct_mod_range_hashing_t_<
+        Size_Type> >
+      {
+	static std::string
+        name()
+	{
+	  return ("mod_");
+	}
+
+	static std::string
+        desc()
+	{
+	  return (make_xml_tag(            "Comb_Hash_Fn", "value", "direct_mod_range_hashing"));
+	}
+      };
+
+    } // namespace detail
+
+  } // namespace test
+
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_COMB_HASH_FN_STRING_FORM_HPP
+
diff --git a/libstdc++-v3/testsuite/util/common_type/assoc/detail/ds_string_form.hpp b/libstdc++-v3/testsuite/util/common_type/assoc/detail/ds_string_form.hpp
new file mode 100644
index 00000000000..84edbd90273
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/common_type/assoc/detail/ds_string_form.hpp
@@ -0,0 +1,304 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file ds_string_form.hpp
+ * Transforms containers into string form.
+ */
+
+#ifndef PB_DS_DS_STRING_FORM_HPP
+#define PB_DS_DS_STRING_FORM_HPP
+
+#include <string>
+#include <ext/pb_ds/tag_and_trait.hpp>
+#include <common_type/assoc/detail/list_update_policy_string_form.hpp>
+#include <common_type/assoc/detail/comb_hash_fn_string_form.hpp>
+#include <common_type/assoc/detail/resize_policy_string_form.hpp>
+#include <common_type/assoc/detail/probe_fn_string_form.hpp>
+#include <common_type/assoc/detail/tree_supports_order_statistics.hpp>
+#include <common_type/assoc/detail/trie_supports_order_statistics.hpp>
+#include <common_type/assoc/detail/trie_supports_prefix_search.hpp>
+#include <common_type/assoc/detail/store_hash_string_form.hpp>
+#include <io/xml.hpp>
+
+namespace pb_ds
+{
+
+  namespace test
+  {
+
+    namespace detail
+    {
+
+      template<typename Cntnr, class Tag>
+      struct ds_string_form;
+
+      template<typename Cntnr>
+      struct ds_string_form<
+	Cntnr,
+	pb_ds::cc_hash_tag>
+      {
+	static std::string
+        name()
+	{
+	  return ("cc_hash_" +
+		  comb_hash_fn_string_form<typename Cntnr::comb_hash_fn>::name() +
+		  resize_policy_string_form<typename Cntnr::resize_policy>::name() +
+		  store_hash_string_form<Cntnr::store_hash>::name());
+	}
+
+	static std::string
+        desc()
+	{
+	  const std::string comb_hash_fn_desc =
+            comb_hash_fn_string_form<typename Cntnr::comb_hash_fn>::desc();
+
+	  const std::string resize_policy_desc =
+            resize_policy_string_form<typename Cntnr::resize_policy>::desc();
+
+	  const std::string store_hash_desc =
+            store_hash_string_form<Cntnr::store_hash>::desc();
+
+	  return (make_xml_tag(            "type", "value", "cc_hash_table", comb_hash_fn_desc +            resize_policy_desc +            store_hash_desc));
+	}
+      };
+
+      template<typename Cntnr>
+      struct ds_string_form<
+	Cntnr,
+	pb_ds::gp_hash_tag>
+      {
+	static std::string
+        name()
+	{
+	  return ("gp_hash_" +
+		  comb_hash_fn_string_form<typename Cntnr::comb_probe_fn>::name() +
+		  probe_fn_string_form<typename Cntnr::probe_fn>::name() +
+		  resize_policy_string_form<typename Cntnr::resize_policy>::name() +
+		  store_hash_string_form<Cntnr::store_hash>::name());
+	}
+
+	static std::string
+        desc()
+	{
+	  const std::string comb_probe_fn_desc =
+            comb_hash_fn_string_form<typename Cntnr::comb_probe_fn>::desc();
+
+	  const std::string probe_fn_desc =
+            probe_fn_string_form<typename Cntnr::probe_fn>::desc();
+
+	  const std::string resize_policy_desc =
+            resize_policy_string_form<typename Cntnr::resize_policy>::desc();
+
+	  const std::string store_hash_desc =
+            store_hash_string_form<Cntnr::store_hash>::desc();
+
+	  return (make_xml_tag(            "type", "value", "gp_hash_table", comb_probe_fn_desc +            probe_fn_desc +            resize_policy_desc +            store_hash_desc));
+	}
+      };
+
+      template<typename Cntnr>
+      struct tree_ds_string_form
+      {
+	static std::string
+        name(const std::string container_category_str)
+	{
+	  if (tree_supports_order_statistics<Cntnr>::value)
+            return (container_category_str + "ost_");
+
+	  return (container_category_str);
+	}
+
+	static std::string
+        desc(const std::string container_category_str)
+	{
+	  const std::string category_str =
+            make_xml_tag(                "Tag",  "value",  container_category_str);
+
+	  const std::string node_update_str =
+            make_xml_tag(
+			 "Node_Update",
+			 "value",(tree_supports_order_statistics<Cntnr>::value?
+				  "tree_order_statistics_node_update" : "null_tree_node_update"));
+
+	  return (make_xml_tag(            "type", "value", "tree", category_str + node_update_str));
+	}
+      };
+
+      template<typename Cntnr>
+      struct ds_string_form<
+        Cntnr,
+        pb_ds::rb_tree_tag> : private tree_ds_string_form<
+        Cntnr>
+      {
+      private:
+	typedef tree_ds_string_form< Cntnr> base_type;
+
+      public:
+	static std::string
+        name()
+	{
+	  return (base_type::name("rb_tree_"));
+	}
+
+	static std::string
+        desc()
+	{
+	  return (base_type::desc("rb_tree_tag"));
+	}
+      };
+
+      template<typename Cntnr>
+      struct ds_string_form<
+        Cntnr,
+        pb_ds::splay_tree_tag> : private tree_ds_string_form<
+        Cntnr>
+      {
+      private:
+	typedef tree_ds_string_form< Cntnr> base_type;
+
+      public:
+	static std::string
+        name()
+	{
+	  return (base_type::name("splay_tree_"));
+	}
+
+	static std::string
+        desc()
+	{
+	  return (base_type::desc("splay_tree_tag"));
+	}
+      };
+
+      template<typename Cntnr>
+      struct ds_string_form<
+        Cntnr,
+        pb_ds::ov_tree_tag> : private tree_ds_string_form<
+        Cntnr>
+      {
+      private:
+	typedef tree_ds_string_form< Cntnr> base_type;
+
+      public:
+	static std::string
+        name()
+	{
+	  return (base_type::name("ov_tree_"));
+	}
+
+	static std::string
+        desc()
+	{
+	  return (base_type::desc("ov_tree_tag"));
+	}
+      };
+
+      template<typename Cntnr>
+      struct ds_string_form<
+	Cntnr,
+	pb_ds::list_update_tag>
+      {
+	static std::string
+        name()
+	{
+	  return ("lu_" +
+		  lu_policy_string_form<typename Cntnr::update_policy>::name());
+	}
+
+	static std::string
+        desc()
+	{
+	  return (make_xml_tag(
+			       "type",
+			       "value",
+			       "list_update",
+			       lu_policy_string_form<typename Cntnr::update_policy>::desc()));
+	}
+      };
+
+      template<typename Cntnr>
+      struct ds_string_form<
+	Cntnr,
+	pb_ds::pat_trie_tag>
+      {
+	static std::string
+        name()
+	{
+	  if (trie_supports_order_statistics<Cntnr>::value)
+            return ("pat_trie_ost_");
+
+	  if (trie_supports_prefix_search<Cntnr>::value)
+            return ("pat_trie_prs_");
+
+	  return ("pat_trie_");
+	}
+
+	static std::string
+        desc()
+	{
+	  const std::string category_str =
+            make_xml_tag(                "Tag",  "value",  "pat_trie_tag");
+
+	  std::string node_update_desc;
+
+	  if (trie_supports_order_statistics<Cntnr>::value)
+            node_update_desc =
+	      make_xml_tag(                    "Node_Update",  "value",  "trie_order_statistics_node_update");
+	  else if (trie_supports_prefix_search<Cntnr>::value)
+            node_update_desc =
+	      make_xml_tag(                    "Node_Update",  "value",  "trie_prefix_search_node_update");
+	  else
+            node_update_desc =
+	      make_xml_tag(                    "Node_Update",  "value",  "null_trie_node_update");
+
+	  return (make_xml_tag(            "type", "value", "trie", category_str + node_update_desc));
+	}
+      };
+
+    } // namespace detail
+
+  } // namespace test
+
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_DS_STRING_FORM_HPP
+
diff --git a/libstdc++-v3/testsuite/util/common_type/assoc/detail/list_update_policy_string_form.hpp b/libstdc++-v3/testsuite/util/common_type/assoc/detail/list_update_policy_string_form.hpp
new file mode 100644
index 00000000000..d8f9e977aec
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/common_type/assoc/detail/list_update_policy_string_form.hpp
@@ -0,0 +1,113 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file lu_policy_string_form.hpp
+ * Transforms containers into string form.
+ */
+
+#ifndef PB_DS_LU_POLICY_STRING_FORM_HPP
+#define PB_DS_LU_POLICY_STRING_FORM_HPP
+
+#include <string>
+#include <common_type/assoc/template_policy.hpp>
+#include <io/xml.hpp>
+
+namespace pb_ds
+{
+
+  namespace test
+  {
+
+    namespace detail
+    {
+
+      template<typename Update_Policy>
+      struct lu_policy_string_form;
+
+      template<>
+      struct lu_policy_string_form<
+	move_to_front_lu_policy_t_>
+      {
+	static std::string
+        name()
+	{
+	  return ("mtf_");
+	}
+
+	static std::string
+        desc()
+	{
+	  return (make_xml_tag(            "Update_Policy", "value", "move_to_front_lu_policy"));
+	}
+      };
+
+      template<typename Allocator, typename Allocator::size_type Max_Count>
+      struct lu_policy_string_form<
+	counter_lu_policy_t_<
+        Allocator,
+        Max_Count> >
+      {
+	static std::string
+        name()
+	{
+	  std::ostringstream ret;
+
+	  ret << "cnt_" << Max_Count << "_";
+
+	  return (ret.str());
+	}
+
+	static std::string
+        desc()
+	{
+	  return (make_xml_tag(            "Update_Policy", "value", "counter_lu_policy", "Max_Count", Max_Count));
+	}
+      };
+
+    } // namespace detail
+
+  } // namespace test
+
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_LU_POLICY_STRING_FORM_HPP
+
diff --git a/libstdc++-v3/testsuite/util/common_type/assoc/detail/probe_fn_string_form.hpp b/libstdc++-v3/testsuite/util/common_type/assoc/detail/probe_fn_string_form.hpp
new file mode 100644
index 00000000000..364e7efcc73
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/common_type/assoc/detail/probe_fn_string_form.hpp
@@ -0,0 +1,128 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file probe_fn_string_form.hpp
+ * Transforms containers into string form.
+ */
+
+#ifndef PB_DS_PROBE_FN_STRING_FORM_HPP
+#define PB_DS_PROBE_FN_STRING_FORM_HPP
+
+#include <string>
+#include <common_type/assoc/template_policy.hpp>
+#include <io/xml.hpp>
+
+namespace pb_ds
+{
+
+  namespace test
+  {
+
+    namespace detail
+    {
+
+      template<typename Probe_Fn>
+      struct probe_fn_string_form;
+
+      template<typename Key, class Allocator>
+      struct probe_fn_string_form<
+	linear_probe_fn_t_<
+        Key,
+        Allocator> >
+      {
+	static std::string
+        name()
+	{
+	  return ("linp_");
+	}
+
+	static std::string
+        desc()
+	{
+	  return (make_xml_tag(            "Probe_Fn", "value", "linear_probe_fn"));
+	}
+      };
+
+      template<typename Key, class Allocator>
+      struct probe_fn_string_form<
+	quadratic_probe_fn_t_<
+        Key,
+        Allocator> >
+      {
+	static std::string
+        name()
+	{
+	  return ("quadp_");
+	}
+
+	static std::string
+        desc()
+	{
+	  return (make_xml_tag(            "Probe_Fn", "value", "quadratic_probe_fn"));
+	}
+      };
+
+      template<>
+      struct probe_fn_string_form<
+	pb_ds::null_probe_fn>
+      {
+	static std::string
+        name()
+	{
+	  return ("");
+	}
+
+	static std::string
+        desc()
+	{
+	  return (make_xml_tag(            "Probe_Fn", "value", "null_probe_fn"));
+	}
+      };
+
+    } // namespace detail
+
+  } // namespace test
+
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_PROBE_FN_STRING_FORM_HPP
+
diff --git a/libstdc++-v3/testsuite/util/common_type/assoc/detail/resize_policy_string_form.hpp b/libstdc++-v3/testsuite/util/common_type/assoc/detail/resize_policy_string_form.hpp
new file mode 100644
index 00000000000..96da7a3c721
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/common_type/assoc/detail/resize_policy_string_form.hpp
@@ -0,0 +1,106 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file resize_policy_string_form.hpp
+ * Transforms containers into string form.
+ */
+
+#ifndef PB_DS_RESIZE_POLICY_STRING_FORM_HPP
+#define PB_DS_RESIZE_POLICY_STRING_FORM_HPP
+
+#include <string>
+#include <common_type/assoc/detail/size_policy_string_form.hpp>
+#include <common_type/assoc/detail/trigger_policy_string_form.hpp>
+#include <common_type/assoc/template_policy.hpp>
+#include <io/xml.hpp>
+
+namespace pb_ds
+{
+
+  namespace test
+  {
+
+    namespace detail
+    {
+
+      template<typename Resize_Policy>
+      struct resize_policy_string_form;
+
+      template<typename Size_Policy,
+	       class Trigger_Policy,
+	       bool External_Size_Access,
+	       typename Size_Type>
+      struct resize_policy_string_form<
+	pb_ds::hash_standard_resize_policy<
+        Size_Policy,
+        Trigger_Policy,
+        External_Size_Access,
+        Size_Type> >
+      {
+	static std::string
+        name()
+	{
+	  return (size_policy_string_form<Size_Policy>::name() +
+		  trigger_policy_string_form<Trigger_Policy>::name());
+	}
+
+	static std::string
+        desc()
+	{
+	  const std::string size_policy_string_form_desc =
+            size_policy_string_form<Size_Policy>::desc();
+
+	  const std::string trigger_policy_string_form_desc =
+            trigger_policy_string_form<Trigger_Policy>::desc();
+
+	  return (make_xml_tag(            "Resize_Policy", "value", "hash_standard_resize_policy", size_policy_string_form_desc + trigger_policy_string_form_desc));
+	}
+      };
+
+    } // namespace detail
+
+  } // namespace test
+
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_RESIZE_POLICY_STRING_FORM_HPP
+
diff --git a/libstdc++-v3/testsuite/util/common_type/assoc/detail/size_policy_string_form.hpp b/libstdc++-v3/testsuite/util/common_type/assoc/detail/size_policy_string_form.hpp
new file mode 100644
index 00000000000..1ae61c4c14a
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/common_type/assoc/detail/size_policy_string_form.hpp
@@ -0,0 +1,110 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file size_policy_string_form.hpp
+ * Transforms containers into string form.
+ */
+
+#ifndef PB_DS_SIZE_POLICY_STRING_FORM_HPP
+#define PB_DS_SIZE_POLICY_STRING_FORM_HPP
+
+#include <string>
+#include <common_type/assoc/detail/size_policy_string_form.hpp>
+#include <common_type/assoc/detail/trigger_policy_string_form.hpp>
+#include <common_type/assoc/template_policy.hpp>
+#include <io/xml.hpp>
+
+namespace pb_ds
+{
+
+  namespace test
+  {
+
+    namespace detail
+    {
+
+      template<typename Size_Policy>
+      struct size_policy_string_form;
+
+      template<typename Allocator>
+      struct size_policy_string_form<
+	pb_ds::test::hash_exponential_size_policy_t_<
+        Allocator> >
+      {
+	static std::string
+        name()
+	{
+	  return ("exp_");
+	}
+
+	static std::string
+        desc()
+	{
+	  return (make_xml_tag(            "Size_Policy", "value", "hash_exponential_size_policy"));
+	}
+      };
+
+      template<>
+      struct size_policy_string_form<
+	pb_ds::test::hash_prime_size_policy_t_>
+      {
+	static std::string
+        name()
+	{
+	  return ("prime_");
+	}
+
+	static std::string
+        desc()
+	{
+	  return (make_xml_tag(            "Size_Policy", "value", "hash_prime_size_policy"));
+	}
+      };
+
+    } // namespace detail
+
+  } // namespace test
+
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_SIZE_POLICY_STRING_FORM_HPP
+
diff --git a/libstdc++-v3/testsuite/util/common_type/assoc/detail/store_hash_string_form.hpp b/libstdc++-v3/testsuite/util/common_type/assoc/detail/store_hash_string_form.hpp
new file mode 100644
index 00000000000..4dabbd6ca8f
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/common_type/assoc/detail/store_hash_string_form.hpp
@@ -0,0 +1,103 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file store_hash_string_form.hpp
+ * Transforms containers into string form.
+ */
+
+#ifndef PB_DS_STORE_HASH_STRING_FORM_HPP
+#define PB_DS_STORE_HASH_STRING_FORM_HPP
+
+#include <string>
+#include <common_type/assoc/template_policy.hpp>
+#include <io/xml.hpp>
+
+namespace pb_ds
+{
+
+  namespace test
+  {
+
+    namespace detail
+    {
+
+      template<bool Store_Hash>
+      struct store_hash_string_form
+      {
+	static std::string
+        name()
+	{
+	  return ("sth_");
+	}
+
+	static std::string
+        desc()
+	{
+	  return (make_xml_tag(            "Store_Hash", "value", "true"));
+	}
+      };
+
+      template<>
+      struct store_hash_string_form<
+        false>
+      {
+	static std::string
+	name()
+        {
+	  return ("nsth_");
+	}
+
+	static std::string
+        desc()
+        {
+	  return (make_xml_tag(                "Store_Hash",  "value",  "false"));
+        }
+      };
+
+    } // namespace detail
+
+  } // namespace test
+
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_STORE_HASH_STRING_FORM_HPP
+
diff --git a/libstdc++-v3/testsuite/util/common_type/assoc/detail/tree_supports_order_statistics.hpp b/libstdc++-v3/testsuite/util/common_type/assoc/detail/tree_supports_order_statistics.hpp
new file mode 100644
index 00000000000..14bdc7bab32
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/common_type/assoc/detail/tree_supports_order_statistics.hpp
@@ -0,0 +1,83 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file tree_supports_order_statistics.hpp
+ * Checks whether a tree supports order statistics.
+ */
+
+#ifndef PB_DS_TREE_SUPPORTS_ORDER_STATISTICS_HPP
+#define PB_DS_TREE_SUPPORTS_ORDER_STATISTICS_HPP
+
+#include <ext/pb_ds/tree_policy.hpp>
+
+namespace pb_ds
+{
+
+  namespace test
+  {
+
+    namespace detail
+    {
+
+      template<typename Tree_Cntnr>
+      struct tree_supports_order_statistics
+      {
+	enum
+	  {
+	    value = pb_ds::detail::is_same<
+            typename Tree_Cntnr::node_update,
+            pb_ds::tree_order_statistics_node_update<
+            typename Tree_Cntnr::const_node_iterator,
+            typename Tree_Cntnr::node_iterator,
+            typename Tree_Cntnr::cmp_fn,
+            typename Tree_Cntnr::allocator> >::value
+	  };
+      };
+
+    } // namespace detail
+
+  } // namespace test
+
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_TREE_SUPPORTS_ORDER_STATISTICS_HPP
+
diff --git a/libstdc++-v3/testsuite/util/common_type/assoc/detail/trie_supports_order_statistics.hpp b/libstdc++-v3/testsuite/util/common_type/assoc/detail/trie_supports_order_statistics.hpp
new file mode 100644
index 00000000000..43f2c711107
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/common_type/assoc/detail/trie_supports_order_statistics.hpp
@@ -0,0 +1,83 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file trie_supports_order_statistics.hpp
+ * Checks whether a trie supports order stats.
+ */
+
+#ifndef PB_DS_TRIE_SUPPORTS_ORDER_STATISTICS_HPP
+#define PB_DS_TRIE_SUPPORTS_ORDER_STATISTICS_HPP
+
+#include <ext/pb_ds/trie_policy.hpp>
+
+namespace pb_ds
+{
+
+  namespace test
+  {
+
+    namespace detail
+    {
+
+      template<typename Tree_Cntnr>
+      struct trie_supports_order_statistics
+      {
+	enum
+	  {
+	    value = pb_ds::detail::is_same<
+            typename Tree_Cntnr::node_update,
+            pb_ds::trie_order_statistics_node_update<
+            typename Tree_Cntnr::const_node_iterator,
+            typename Tree_Cntnr::node_iterator,
+            typename Tree_Cntnr::e_access_traits,
+            typename Tree_Cntnr::allocator> >::value
+	  };
+      };
+
+    } // namespace detail
+
+  } // namespace test
+
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_TRIE_SUPPORTS_ORDER_STATISTICS_HPP
+
diff --git a/libstdc++-v3/testsuite/util/common_type/assoc/detail/trie_supports_prefix_search.hpp b/libstdc++-v3/testsuite/util/common_type/assoc/detail/trie_supports_prefix_search.hpp
new file mode 100644
index 00000000000..7fb3479715f
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/common_type/assoc/detail/trie_supports_prefix_search.hpp
@@ -0,0 +1,83 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file trie_supports_prefix_search.hpp
+ * Checks whether a trie supports prefix search.
+ */
+
+#ifndef PB_DS_TRIE_SUPPORTS_PREFIX_SEARCH_HPP
+#define PB_DS_TRIE_SUPPORTS_PREFIX_SEARCH_HPP
+
+#include <ext/pb_ds/trie_policy.hpp>
+
+namespace pb_ds
+{
+
+  namespace test
+  {
+
+    namespace detail
+    {
+
+      template<typename Tree_Cntnr>
+      struct trie_supports_prefix_search
+      {
+	enum
+	  {
+	    value = pb_ds::detail::is_same<
+            typename Tree_Cntnr::node_update,
+            pb_ds::trie_prefix_search_node_update<
+            typename Tree_Cntnr::const_node_iterator,
+            typename Tree_Cntnr::node_iterator,
+            typename Tree_Cntnr::e_access_traits,
+            typename Tree_Cntnr::allocator> >::value
+	  };
+      };
+
+    } // namespace detail
+
+  } // namespace test
+
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_TRIE_SUPPORTS_PREFIX_SEARCH_HPP
+
diff --git a/libstdc++-v3/testsuite/util/common_type/assoc/detail/trigger_policy_string_form.hpp b/libstdc++-v3/testsuite/util/common_type/assoc/detail/trigger_policy_string_form.hpp
new file mode 100644
index 00000000000..0d7081f4966
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/common_type/assoc/detail/trigger_policy_string_form.hpp
@@ -0,0 +1,153 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file trigger_policy_string_form.hpp
+ * Transforms containers into string form.
+ */
+
+#ifndef PB_DS_TRIGGER_POLICY_STRING_FORM_HPP
+#define PB_DS_TRIGGER_POLICY_STRING_FORM_HPP
+
+#include <string>
+#include <common_type/assoc/template_policy.hpp>
+#include <io/xml.hpp>
+
+namespace pb_ds
+{
+
+  namespace test
+  {
+
+    namespace detail
+    {
+
+      template<typename Trigger_Policy>
+      struct trigger_policy_string_form;
+
+      template<typename Allocator,
+	       typename Allocator::size_type Min_Load_Nom,
+	       typename Allocator::size_type Min_Load_Denom,
+	       typename Allocator::size_type Max_Load_Nom,
+	       typename Allocator::size_type Max_Load_Denom,
+	       bool External_Access>
+      struct trigger_policy_string_form<
+	pb_ds::test::hash_load_check_resize_trigger_t_<
+        Allocator,
+        Min_Load_Nom,
+        Min_Load_Denom,
+        Max_Load_Nom,
+        Max_Load_Denom,
+        External_Access> >
+      {
+	static std::string
+        name()
+	{
+	  std::ostringstream ret;
+
+	  ret << (External_Access? "": "n") << "ea_"
+            "lc_" << Min_Load_Nom << "div" << Min_Load_Denom << "_" <<
+            Max_Load_Nom << "div" << Max_Load_Denom << "_";
+
+	  return (ret.str());
+	}
+
+	static std::string
+        desc()
+	{
+	  const std::string ext_access_desc =
+            make_xml_tag(
+			 "External_Access",
+			 "value",(External_Access? "true" : "false"));
+
+	  const std::string loads_desc =
+            make_xml_tag(                "alpha_min",  "nom", Min_Load_Nom,  "denom", Min_Load_Denom) +
+            make_xml_tag(                "alpha_max",  "nom", Max_Load_Nom,  "denom", Max_Load_Denom);
+
+	  return (make_xml_tag(            "Trigger_Policy", "value", "hash_load_check_resize_trigger", ext_access_desc + loads_desc));
+	}
+      };
+
+      template<typename Allocator,
+	       typename Allocator::size_type Load_Nom,
+	       typename Allocator::size_type Load_Denom,
+	       bool External_Access>
+      struct trigger_policy_string_form<
+	pb_ds::test::cc_hash_max_collision_check_resize_trigger_t_<
+        Allocator,
+        Load_Nom,
+        Load_Denom,
+        External_Access> >
+      {
+	static std::string
+        name()
+	{
+	  std::ostringstream ret;
+
+	  ret << (External_Access? "": "n") << "ea_"
+            "mcolc_" << Load_Nom << "div" << Load_Denom << "_";
+
+	  return (ret.str());
+	}
+
+	static std::string
+        desc()
+	{
+	  const std::string ext_access_desc =
+            make_xml_tag(
+			 "External_Access",
+			 "value",(External_Access? "true" : "false"));
+
+	  const std::string load_desc =
+            make_xml_tag(                "alpha",  "nom", Load_Nom,  "denom", Load_Denom);
+
+	  return (make_xml_tag(            "Trigger_Policy", "value", "cc_hash_max_collision_check_resize_trigger", ext_access_desc + load_desc));
+	}
+      };
+
+    } // namespace detail
+
+  } // namespace test
+
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_TRIGGER_POLICY_STRING_FORM_HPP
+
diff --git a/libstdc++-v3/testsuite/util/common_type/assoc/native_set.hpp b/libstdc++-v3/testsuite/util/common_type/assoc/native_set.hpp
new file mode 100644
index 00000000000..ec72648f854
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/common_type/assoc/native_set.hpp
@@ -0,0 +1,111 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file native_set.hpp
+ * Contains an adapter to Dinkumware/SGI tree tables
+ */
+
+#ifndef PB_DS_NATIVE_SET_HPP
+#define PB_DS_NATIVE_SET_HPP
+
+#include <ext/pb_ds/detail/standard_policies.hpp>
+#include <native_type/assoc/native_tree_tag.hpp>
+#include <io/xml.hpp>
+#include <string>
+
+namespace pb_ds
+{
+
+  namespace test
+  {
+
+#define PB_DS_BASE_C_DEC						\
+    std::set<								\
+								Key,	\
+								Cmp_Fn,	\
+								typename Allocator::template rebind< \
+														Key>::other>
+
+    template<typename Key, class Cmp_Fn = std::less<Key>,
+	     class Allocator =
+	     std::allocator<char> >
+    class native_set : public PB_DS_BASE_C_DEC
+    {
+    private:
+      typedef PB_DS_BASE_C_DEC base_type;
+
+    public:
+      typedef native_tree_tag container_category;
+
+      typedef typename PB_DS_BASE_C_DEC::const_iterator const_iterator;
+
+    public:
+      native_set() : base_type()
+      { }
+
+      template<typename It>
+      native_set(It f,  It l) : base_type(f, l)
+      { }
+
+      native_set(const_iterator f,  const_iterator l) : base_type(f, l)
+      { }
+
+      static std::string
+      name()
+      {
+        return ("n_set");
+      }
+
+      static std::string
+      desc()
+      {
+        return (make_xml_tag(            "type", "value", "std_set"));
+      }
+    };
+
+#undef PB_DS_BASE_C_DEC
+
+  } // namespace test
+
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_NATIVE_SET_HPP
diff --git a/libstdc++-v3/testsuite/util/common_type/assoc/string_form.hpp b/libstdc++-v3/testsuite/util/common_type/assoc/string_form.hpp
new file mode 100644
index 00000000000..983f8a11c57
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/common_type/assoc/string_form.hpp
@@ -0,0 +1,238 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file string_form.hpp
+ * Transforms containers into string form.
+ */
+
+#ifndef PB_DS_STRING_FORM_HPP
+#define PB_DS_STRING_FORM_HPP
+
+#include <string>
+#include <sstream>
+#include <ext/pb_ds/detail/type_utils.hpp>
+#include <ext/pb_ds/tag_and_trait.hpp>
+#include <native_type/assoc/native_hash_map.hpp>
+#include <native_type/assoc/native_hash_set.hpp>
+#include <native_type/assoc/native_multimap.hpp>
+#include <native_type/assoc/native_hash_multimap.hpp>
+#include <native_type/assoc/native_set.hpp>
+#include <common_type/assoc/template_policy.hpp>
+#include <common_type/assoc/detail/ds_string_form.hpp>
+#include <regression/basic_type.hpp>
+#include <io/xml.hpp>
+
+namespace pb_ds
+{
+
+  namespace test
+  {
+
+    namespace detail
+    {
+
+      template<typename Cntnr>
+      struct pb_ds_string_form
+      {
+      private:
+	typedef typename Cntnr::mapped_type mapped_type;
+
+	struct mapped_string_form
+	{
+	private:
+	  template<typename D_Cntnr>
+	  static std::string
+	  name(pb_ds::detail::type_to_type<D_Cntnr>)
+	  {
+            return ("mmap_" + pb_ds_string_form<D_Cntnr>::name());
+	  }
+
+	  template<typename D_Cntnr>
+	  static std::string
+	  desc(pb_ds::detail::type_to_type<D_Cntnr>)
+	  {
+            return (pb_ds_string_form<D_Cntnr>::desc());
+	  }
+
+	  static std::string
+	  name(pb_ds::detail::type_to_type<size_t>)
+	  {
+            return ("map");
+	  }
+
+	  static std::string
+	  desc(pb_ds::detail::type_to_type<size_t>)
+	  {
+            return ("");
+	  }
+
+	  static std::string
+	  name(pb_ds::detail::type_to_type<basic_type>)
+	  {
+            return ("map");
+	  }
+
+	  static std::string
+	  desc(pb_ds::detail::type_to_type<basic_type>)
+	  {
+            return ("");
+	  }
+
+	  static std::string
+	  name(pb_ds::detail::type_to_type<int>)
+	  {
+            return ("map");
+	  }
+
+	  static std::string
+	  desc(pb_ds::detail::type_to_type<int>)
+	  {
+            return ("");
+	  }
+
+	  static std::string
+	  name(pb_ds::detail::type_to_type<char>)
+	  {
+            return ("map");
+	  }
+
+	  static std::string
+	  desc(pb_ds::detail::type_to_type<char>)
+	  {
+            return ("");
+	  }
+
+	  static std::string
+	  name(pb_ds::detail::type_to_type<pb_ds::null_mapped_type>)
+	  {
+            return ("set");
+	  }
+
+	  static std::string
+	  desc(pb_ds::detail::type_to_type<pb_ds::null_mapped_type>)
+	  {
+            return ("");
+	  }
+
+	public:
+	  static std::string
+	  name()
+	  {
+            return (name(pb_ds::detail::type_to_type<mapped_type>()));
+	  }
+
+	  static std::string
+	  desc()
+	  {
+            return (desc(pb_ds::detail::type_to_type<mapped_type>()));
+	  }
+	};
+
+	typedef
+        detail::ds_string_form<
+	  Cntnr,
+	  typename Cntnr::container_category>
+        ds_string_form_t;
+
+      public:
+	static std::string
+        name()
+	{
+	  return (ds_string_form_t::name() + mapped_string_form::name());
+	}
+
+	static std::string
+        desc()
+	{
+	  return (ds_string_form_t::desc() + mapped_string_form::desc());
+	}
+      };
+
+      template<typename Cntnr>
+      struct native_string_form
+      {
+	static std::string
+        name()
+	{
+	  return (Cntnr::name());
+	}
+
+	static std::string
+        desc()
+	{
+	  return (Cntnr::desc());
+	}
+      };
+
+      template<typename Cntnr, class Tag>
+      struct tag_select_string_form : public pb_ds_string_form<
+        Cntnr>
+      { };
+
+      template<typename Cntnr>
+      struct tag_select_string_form<
+        Cntnr,
+        native_hash_tag> : public native_string_form<
+        Cntnr>
+      { };
+
+      template<typename Cntnr>
+      struct tag_select_string_form<
+        Cntnr,
+        native_tree_tag> : public native_string_form<
+        Cntnr>
+      { };
+
+    } // namespace detail
+
+    template<typename Cntnr>
+    struct string_form : public detail::tag_select_string_form<
+      Cntnr,
+      typename Cntnr::container_category>
+    { };
+
+  } // namespace test
+
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_STRING_FORM_HPP
+
diff --git a/libstdc++-v3/testsuite/util/common_type/assoc/template_policy.hpp b/libstdc++-v3/testsuite/util/common_type/assoc/template_policy.hpp
new file mode 100644
index 00000000000..288aba24a47
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/common_type/assoc/template_policy.hpp
@@ -0,0 +1,176 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file template_policy.hpp
+ * Contains template versions of policies.
+ */
+
+#ifndef PB_DS_TEMPLATE_POLICY_HPP
+#define PB_DS_TEMPLATE_POLICY_HPP
+
+#include <ext/pb_ds/detail/typelist.hpp>
+
+#include <ext/pb_ds/hash_policy.hpp>
+#include <ext/pb_ds/tree_policy.hpp>
+#include <ext/pb_ds/list_update_policy.hpp>
+
+namespace pb_ds
+{
+
+  namespace test
+  {
+
+    template<typename Allocator>
+    struct direct_mask_range_hashing_t_ : public pb_ds::direct_mask_range_hashing<
+      typename Allocator::size_type>
+    {
+      typedef
+      pb_ds::direct_mask_range_hashing<
+	typename Allocator::size_type>
+      base_type;
+    };
+
+    template<typename Allocator>
+    struct direct_mod_range_hashing_t_ : public pb_ds::direct_mod_range_hashing<
+      typename Allocator::size_type>
+    {
+      typedef
+      pb_ds::direct_mod_range_hashing<
+	typename Allocator::size_type>
+      base_type;
+    };
+
+    template<typename Allocator,
+	     typename Allocator::size_type Min_Load_Nom,
+	     typename Allocator::size_type Min_Load_Denom,
+	     typename Allocator::size_type Max_Load_Nom,
+	     typename Allocator::size_type Max_Load_Denom,
+	     bool External_Access>
+    struct hash_load_check_resize_trigger_t_ : public pb_ds::hash_load_check_resize_trigger<
+      External_Access,
+      typename Allocator::size_type>
+    {
+      typedef
+      pb_ds::hash_load_check_resize_trigger<
+	External_Access,
+	typename Allocator::size_type>
+      base_type;
+
+      inline
+      hash_load_check_resize_trigger_t_() : base_type(
+						      static_cast<float>(Min_Load_Nom) /
+						      static_cast<float>(Min_Load_Denom),
+						      static_cast<float>(Max_Load_Nom) /
+						      static_cast<float>(Max_Load_Denom))
+      { }
+
+      enum
+	{
+	  get_set_loads = External_Access,
+	  get_set_load = false
+	};
+    };
+
+    template<typename Allocator,
+	     typename Allocator::size_type Load_Nom,
+	     typename Allocator::size_type Load_Denom,
+	     bool External_Access>
+    struct cc_hash_max_collision_check_resize_trigger_t_ : public pb_ds::cc_hash_max_collision_check_resize_trigger<
+      External_Access,
+      typename Allocator::size_type>
+    {
+      typedef
+      pb_ds::cc_hash_max_collision_check_resize_trigger<
+	External_Access,
+	typename Allocator::size_type>
+      base_type;
+
+      inline
+      cc_hash_max_collision_check_resize_trigger_t_() : base_type(
+								  static_cast<float>(Load_Nom) /
+								  static_cast<float>(Load_Denom))
+      { }
+
+      enum
+	{
+	  get_set_load = External_Access,
+	  get_set_loads = false
+	};
+    };
+
+    struct hash_prime_size_policy_t_ : public pb_ds::hash_prime_size_policy
+    { };
+
+    template<typename Allocator>
+    struct hash_exponential_size_policy_t_ : public pb_ds::hash_exponential_size_policy<
+      typename Allocator::size_type>
+    {
+      // Nothing
+    };
+
+    template<typename Key, class Allocator>
+    struct linear_probe_fn_t_ : public pb_ds::linear_probe_fn<
+      typename Allocator::size_type>
+    { };
+
+    template<typename Key, class Allocator>
+    struct quadratic_probe_fn_t_ : public pb_ds::quadratic_probe_fn<
+      typename Allocator::size_type>
+    { };
+
+    template<typename Allocator, typename Allocator::size_type Max_Count>
+    struct counter_lu_policy_t_ : public pb_ds::counter_lu_policy<
+      Max_Count,
+      Allocator>
+    {
+      typedef pb_ds::counter_lu_policy< Max_Count, Allocator> base_type;
+    };
+
+    struct move_to_front_lu_policy_t_ : public pb_ds::move_to_front_lu_policy<>
+    { };
+
+  } // namespace test
+
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_TEMPLATE_POLICY_HPP
+
diff --git a/libstdc++-v3/testsuite/util/common_type/priority_queue/common_type.hpp b/libstdc++-v3/testsuite/util/common_type/priority_queue/common_type.hpp
new file mode 100644
index 00000000000..437fe6e09e5
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/common_type/priority_queue/common_type.hpp
@@ -0,0 +1,87 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file common_type.hpp
+ * Contains common types.
+ */
+
+#ifndef PB_DS_COMMON_TYPES_HPP
+#define PB_DS_COMMON_TYPES_HPP
+
+#include <ext/pb_ds/detail/type_utils.hpp>
+#include <ext/pb_ds/priority_queue.hpp>
+#include <ext/pb_ds/detail/typelist.hpp>
+
+namespace pb_ds
+{
+  namespace test
+  {
+    template<typename Value_Type, typename Cmp_Fn = std::less<Value_Type>,
+	     class Allocator = std::allocator<Value_Type> >
+    struct pq_common_types
+    {
+    private:
+      //    typedef typename Allocator::size_type size_type;
+
+      typedef pb_ds::priority_queue<Value_Type, Cmp_Fn, pb_ds::pairing_heap_tag, Allocator> pairing_heap_t;
+
+      typedef pb_ds::priority_queue<Value_Type, Cmp_Fn, pb_ds::binomial_heap_tag, Allocator> binomial_heap_t;
+
+      typedef pb_ds::priority_queue<Value_Type, Cmp_Fn, pb_ds::rc_binomial_heap_tag, Allocator> rc_binomial_heap_t;
+
+      typedef pb_ds::priority_queue<Value_Type, Cmp_Fn, pb_ds::binary_heap_tag, Allocator> binary_heap_t;
+
+      typedef pb_ds::priority_queue<Value_Type, Cmp_Fn, pb_ds::thin_heap_tag, Allocator> thin_heap_t;
+
+      typedef typename pb_ds::detail::typelist5<thin_heap_t, pairing_heap_t, binomial_heap_t, rc_binomial_heap_t, binary_heap_t>::type all_tl;
+
+    public:
+      typedef all_tl performance_tl;
+      typedef all_tl regression_tl;
+      typedef all_tl performance_min_tl;
+      typedef all_tl regression_min_tl;
+    };
+
+  } // namespace test
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_COMMON_TYPES_HPP
diff --git a/libstdc++-v3/testsuite/util/common_type/priority_queue/detail/ds_string_form.hpp b/libstdc++-v3/testsuite/util/common_type/priority_queue/detail/ds_string_form.hpp
new file mode 100644
index 00000000000..4c33e6c1fdb
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/common_type/priority_queue/detail/ds_string_form.hpp
@@ -0,0 +1,128 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file ds_string_form.hpp
+ * Transforms containers into string form.
+ */
+
+#ifndef PB_DS_DS_STRING_FORM_HPP
+#define PB_DS_DS_STRING_FORM_HPP
+
+#include <string>
+#include <ext/pb_ds/tag_and_trait.hpp>
+#include <io/xml.hpp>
+
+namespace pb_ds
+{
+  namespace test
+  {
+    namespace detail
+    {
+      template<typename Cntnr, class Tag>
+      struct ds_string_form;
+
+      template<typename Cntnr>
+      struct ds_string_form<Cntnr, pb_ds::pairing_heap_tag>
+      {
+	static std::string
+        name()
+	{ return "pairing_heap"; }
+
+	static std::string
+        desc()
+	{ return make_xml_tag("type", "value", "pairing_heap"); }
+      };
+
+      template<typename Cntnr>
+      struct ds_string_form<Cntnr, pb_ds::thin_heap_tag>
+      {
+	static std::string
+        name()
+	{ return "thin_heap"; }
+
+	static std::string
+        desc()
+	{ return make_xml_tag("type", "value", "thin_heap"); }
+      };
+
+      template<typename Cntnr>
+      struct ds_string_form<Cntnr, pb_ds::binomial_heap_tag>
+      {
+	static std::string
+        name()
+	{ return "binomial_heap"; }
+
+	static std::string
+        desc()
+	{ return make_xml_tag("type", "value", "binomial_heap"); }
+      };
+
+      template<typename Cntnr>
+      struct ds_string_form<Cntnr, pb_ds::rc_binomial_heap_tag>
+      {
+	static std::string
+        name()
+	{ return "rc_binomial_heap"; }
+
+	static std::string
+        desc()
+	{ return make_xml_tag("type", "value", "rc_binomial_heap"); }
+      };
+
+      template<typename Cntnr>
+      struct ds_string_form<Cntnr, pb_ds::binary_heap_tag>
+      {
+	static std::string
+        name()
+	{ return "binary_heap"; }
+
+	static std::string
+        desc()
+	{ return make_xml_tag("type", "value", "binary_heap"); }
+      };
+
+    } // namespace detail
+  } // namespace test
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_DS_STRING_FORM_HPP
+
diff --git a/libstdc++-v3/testsuite/util/common_type/priority_queue/string_form.hpp b/libstdc++-v3/testsuite/util/common_type/priority_queue/string_form.hpp
new file mode 100644
index 00000000000..6d85b86a11d
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/common_type/priority_queue/string_form.hpp
@@ -0,0 +1,109 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file string_form.hpp
+ * Transforms containers into string form.
+ */
+
+#ifndef PB_DS_STRING_FORM_HPP
+#define PB_DS_STRING_FORM_HPP
+
+#include <string>
+#include <sstream>
+#include <ext/pb_ds/detail/type_utils.hpp>
+#include <native_type/priority_queue/native_priority_queue.hpp>
+#include <common_type/priority_queue/detail/ds_string_form.hpp>
+#include <io/xml.hpp>
+
+namespace pb_ds
+{
+  namespace test
+  {
+    namespace detail
+    {
+      template<typename Cntnr>
+      struct pb_ds_string_form
+      {
+      private:
+	typedef ds_string_form<Cntnr, typename Cntnr::container_category> ds_string_form_t;
+
+      public:
+	static std::string
+        name()
+	{ return ds_string_form_t::name(); }
+
+	static std::string
+        desc()
+	{ return ds_string_form_t::desc(); }
+      };
+
+      template<typename Cntnr>
+      struct native_string_form
+      {
+	static std::string
+        name()
+	{ return Cntnr::name(); }
+
+	static std::string
+        desc()
+	{ return Cntnr::desc(); }
+      };
+
+      template<typename Cntnr, class Tag>
+      struct tag_select_string_form : public pb_ds_string_form<Cntnr>
+      { };
+
+      template<typename Cntnr>
+      struct tag_select_string_form<Cntnr, native_pq_tag> 
+	: public native_string_form<Cntnr>
+      { };
+    } // namespace detail
+
+    template<typename Cntnr>
+    struct string_form 
+      : public detail::tag_select_string_form<Cntnr, typename Cntnr::container_category>
+    { };
+  } // namespace test
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_STRING_FORM_HPP
+
diff --git a/libstdc++-v3/testsuite/util/hash_fn/dna_str_limit.hpp b/libstdc++-v3/testsuite/util/hash_fn/dna_str_limit.hpp
new file mode 100644
index 00000000000..144cf03b2b9
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/hash_fn/dna_str_limit.hpp
@@ -0,0 +1,72 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file dna_str_limit.hpp
+ * Contains a function for finding the numer of characters
+ *    to access in a DNA string.
+ */
+
+#ifndef PB_DS_DNA_STR_LIMIT_HPP
+#define PB_DS_DNA_STR_LIMIT_HPP
+
+#include <string>
+
+namespace pb_ds
+{
+  namespace test
+  {
+    size_t
+    dna_str_limit(size_t size)
+    {
+      size_t ret = 1;
+      size_t calc_size = 4;
+      while (calc_size < size)
+	{
+	  ++ret;
+	  calc_size = calc_size << 2;
+	}
+      return ret;
+    }
+  } // namespace test
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_DNA_STR_LIMIT_HPP
diff --git a/libstdc++-v3/testsuite/util/hash_fn/limit_string_hash_fn.hpp b/libstdc++-v3/testsuite/util/hash_fn/limit_string_hash_fn.hpp
new file mode 100644
index 00000000000..78cc6f22735
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/hash_fn/limit_string_hash_fn.hpp
@@ -0,0 +1,82 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file limit_string_hash_fn.hpp
+ * Contains a string hash function.
+ */
+
+#ifndef PB_DS_LIMIT_STRING_HASH_FN_HPP
+#define PB_DS_LIMIT_STRING_HASH_FN_HPP
+
+#include <string>
+
+namespace pb_ds
+{
+  namespace test
+  {
+    struct limit_string_hash_fn
+    {
+      static size_t _S_max;
+
+      inline size_t
+      operator()(const std::string& r_str) const
+      {
+	size_t ret = 0;
+	std::string::const_iterator b = r_str.begin();
+	std::string::const_iterator e = r_str.end();
+
+	size_t i = 0;
+	while (b != e&&  i < _S_max)
+	  {
+	    ret *= 5;
+	    ret += static_cast<size_t>(*(b++));
+	  }
+	return ret;
+      }
+    };
+
+    size_t limit_string_hash_fn::_S_max;
+
+  } // namespace test
+} // namespace pb_ds
+
+#endif
diff --git a/libstdc++-v3/testsuite/util/hash_fn/string_hash_fn.hpp b/libstdc++-v3/testsuite/util/hash_fn/string_hash_fn.hpp
new file mode 100644
index 00000000000..b1990b4b390
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/hash_fn/string_hash_fn.hpp
@@ -0,0 +1,78 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file string_hash_fn.hpp
+ * Contains a string hash function.
+ */
+
+#ifndef PB_DS_STRING_HASH_FN_HPP
+#define PB_DS_STRING_HASH_FN_HPP
+
+#include <string>
+
+namespace pb_ds
+{
+  namespace test
+  {
+    struct string_hash_fn
+    {
+      template<typename String_T>
+      inline size_t
+      operator()(const String_T& r_str) const
+      {
+	typedef typename String_T::const_iterator const_iterator;
+	const_iterator b = r_str.begin();
+	const_iterator e = r_str.end();
+
+	size_t ret = 0;
+	while (b != e)
+	  {
+	    ret *= 5;
+	    ret += static_cast<size_t>(*(b++));
+	  }
+	return ret;
+      }
+    };
+  } // namespace test
+} // namespace pb_ds
+
+#endif
diff --git a/libstdc++-v3/testsuite/util/hash_fn/string_ranged_hash_fn.hpp b/libstdc++-v3/testsuite/util/hash_fn/string_ranged_hash_fn.hpp
new file mode 100644
index 00000000000..e9a5465e485
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/hash_fn/string_ranged_hash_fn.hpp
@@ -0,0 +1,109 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file string_ranged_hash_fn.hpp
+ * Contains a ranged string hash function.
+ */
+
+#ifndef PB_DS_STRING_RANGED_HASH_FN_HPP
+#define PB_DS_STRING_RANGED_HASH_FN_HPP
+
+#include <string>
+#include <hash_fn/dna_str_limit.hpp>
+
+namespace pb_ds
+{
+  namespace test
+  {
+    template<typename Comb_Fn>
+    class string_ranged_hash_fn : public Comb_Fn
+    {
+    private:
+      size_t _M_limit;
+
+    public:
+      typedef Comb_Fn comb_fn;
+      typedef detail::comb_hash_fn_string_form<comb_fn> string_form;
+
+      inline size_t
+      operator()(const std::string& r_str) const
+      {
+	size_t ret = 0;
+	std::string::const_iterator b = r_str.begin();
+	std::string::const_iterator e = r_str.end();
+
+	size_t i = 0;
+	while (i < _M_limit&&  b != e)
+	  {
+	    ret *= 5;
+	    ret += static_cast<size_t>(*(b++));
+	    ++i;
+	  }
+	return (comb_fn::operator()(ret));
+      }
+
+      void
+      swap(string_ranged_hash_fn<Comb_Fn>& other)
+      {
+	std::swap(_M_limit, other._M_limit);
+	comb_fn::swap(other);
+      }
+
+      void
+      notify_resized(size_t new_size)
+      {
+	comb_fn::notify_resized(new_size);
+	_M_limit = dna_str_limit(new_size);
+      }
+
+      static std::string
+      name()
+      { return ("string_ranged_hash_fn_" + string_form<comb_fn>::name()); }
+
+      static std::string
+      desc()
+      { return ("string ranged-hash using" + string_form<comb_fn>::desc()); }
+    };
+  } // namespace test
+} // namespace pb_ds
+
+#endif 
diff --git a/libstdc++-v3/testsuite/util/hash_fn/string_ranged_probe_fn.hpp b/libstdc++-v3/testsuite/util/hash_fn/string_ranged_probe_fn.hpp
new file mode 100644
index 00000000000..63bb0533c55
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/hash_fn/string_ranged_probe_fn.hpp
@@ -0,0 +1,113 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file string_ranged_probe_fn.hpp
+ * Contains a ranged string probe function.
+ */
+
+#ifndef PB_DS_STRING_RANGED_PROBE_FN_HPP
+#define PB_DS_STRING_RANGED_PROBE_FN_HPP
+
+#include <string>
+
+namespace pb_ds
+{
+  namespace test
+  {
+    template<typename Comb_Fn, typename Probe_Fn>
+    class string_ranged_probe_fn : public Probe_Fn, public Comb_Fn
+    {
+    private:
+      size_t _M_limit;
+
+    public:
+      typedef Comb_Fn comb_fn;
+      typedef Probe_Fn probe_fn;
+      typedef detail::comb_hash_fn_string_form<comb_fn> string_form;
+
+      inline size_t
+      operator()(const std::string& r_str) const
+      {
+	size_t ret = 0;
+	std::string::const_iterator b = r_str.begin();
+	std::string::const_iterator e = r_str.end();
+
+	size_t i = 0;
+	while (i < _M_limit&&  b != e)
+	  {
+	    ret *= 5;
+	    ret += static_cast<size_t>(*(b++));
+	    ++i;
+	  }
+	return (comb_fn::operator()(ret));
+      }
+
+      inline size_t
+      operator()(const std::string&, const size_t hash, size_t i) const
+      { return comb_fn::operator()(hash + probe_fn::operator()(i)); }
+
+      void
+      swap(string_ranged_probe_fn<Comb_Fn, Probe_Fn>& other)
+      {
+	std::swap(_M_limit, other._M_limit);
+	comb_fn::swap(other);
+      }
+
+      void
+      notify_resized(size_t new_size)
+      {
+	comb_fn::notify_resized(new_size);
+	_M_limit = dna_str_limit(new_size);
+      }
+
+      static std::string
+      name()
+      { return ("string_ranged_probe_fn_" + string_form<comb_fn>::name()); }
+
+      static std::string
+      desc()
+      { return ("string ranged-probe using" + string_form<comb_fn>::desc());}
+    };
+  } // namespace test
+} // namespace pb_ds
+
+#endif
diff --git a/libstdc++-v3/testsuite/util/io/illegal_input_error.hpp b/libstdc++-v3/testsuite/util/io/illegal_input_error.hpp
new file mode 100644
index 00000000000..3e786d457f8
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/io/illegal_input_error.hpp
@@ -0,0 +1,63 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file illegal_input_error.hpp
+ * Contains an input exception.
+ */
+
+#ifndef PB_DS_ILLEGAL_INPUT_EX_HPP
+#define PB_DS_ILLEGAL_INPUT_EX_HPP
+
+namespace pb_ds
+{
+
+  namespace test
+  {
+
+    class illegal_input_error
+    { };
+
+  } // namespace test
+
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_ILLEGAL_INPUT_EX_HPP
diff --git a/libstdc++-v3/testsuite/util/io/prog_bar.cc b/libstdc++-v3/testsuite/util/io/prog_bar.cc
new file mode 100644
index 00000000000..365c5186532
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/io/prog_bar.cc
@@ -0,0 +1,92 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file prog_bar.cpp
+ * Contains a progress bar - idea taken from boost::timer by Beman Dawes.
+ */
+
+#include <util/io/prog_bar.hpp>
+
+namespace pb_ds
+{
+
+  namespace test
+  {
+
+    prog_bar::
+    prog_bar(size_t max, std::ostream& r_os, bool display/*= true*/) :
+      m_cur(0),
+      m_max(max),
+      m_cur_disp(0),
+      m_r_os(r_os),
+      m_display(display)
+    {
+      if (m_display == false)
+        return;
+
+      for (std::size_t i = 0; i < num_disp; ++i)
+        m_r_os << "-";
+
+      m_r_os << std::endl;
+    }
+
+    void
+    prog_bar::
+    inc()
+    {
+      ++m_cur;
+
+      if (m_display == false)
+        return;
+
+      while (m_cur*  num_disp >= m_max*  m_cur_disp&&  m_cur_disp < num_disp)
+	{
+	  m_r_os << '*';
+	  m_r_os.flush();
+
+	  ++m_cur_disp;
+	}
+    }
+
+  } // namespace test
+
+} // namespace pb_ds
diff --git a/libstdc++-v3/testsuite/util/io/prog_bar.hpp b/libstdc++-v3/testsuite/util/io/prog_bar.hpp
new file mode 100644
index 00000000000..0bbbda27854
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/io/prog_bar.hpp
@@ -0,0 +1,96 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file prog_bar.hpp
+ * Contains a progress bar - idea taken from boost::timer by Beman Dawes.
+ */
+
+#ifndef PB_DS_PROG_BAR_HPP
+#define PB_DS_PROG_BAR_HPP
+
+#include <limits.h>
+#include <iostream>
+#include <string>
+
+namespace pb_ds
+{
+
+  namespace test
+  {
+
+    /**
+     * Progress bar.
+     * Simplified from part of boost::timer by Beman Dawes.
+     **/
+    class prog_bar
+    {
+    protected:
+      enum{num_disp = 40};
+
+    public:
+      prog_bar(size_t max, std::ostream& r_os, bool display = true);
+
+      void
+      inc();
+
+    private:
+      prog_bar(const prog_bar& );
+
+      prog_bar& 
+      operator=(const prog_bar& );
+
+    private:
+      size_t m_cur;
+      const size_t m_max;
+
+      size_t m_cur_disp;
+
+      std::ostream& m_r_os;
+
+      bool m_display;
+    };
+
+  } // namespace test
+
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_PROG_BAR_HPP
diff --git a/libstdc++-v3/testsuite/util/io/text_populate.hpp b/libstdc++-v3/testsuite/util/io/text_populate.hpp
new file mode 100644
index 00000000000..a91097c5c93
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/io/text_populate.hpp
@@ -0,0 +1,163 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file text_populate.hpp
+ * Contains a function for populating a vector with text words from
+ *    a file.
+ */
+
+#ifndef PB_DS_TEXT_POPULATE_HPP
+#define PB_DS_TEXT_POPULATE_HPP
+
+#include <io/illegal_input_error.hpp>
+#include <set>
+#include <fstream>
+#include <string>
+#include <iostream>
+
+namespace pb_ds
+{
+
+  namespace test
+  {
+
+    template<typename Vec>
+    void
+    text_populate(const std::string& r_f_name, Vec& r_a_txt)
+    {
+      const size_t size = r_a_txt.size();
+
+      try
+	{
+	  std::ifstream f(r_f_name.c_str());
+
+	  if (!f.good())
+	    {
+	      std::cerr << "Cannot open file " << r_f_name.c_str() <<
+                std::endl;
+
+	      throw pb_ds::test::illegal_input_error();
+	    }
+
+	  size_t i = 0;
+
+	  while (f.good()&&  i < size)
+	    {
+	      f >> r_a_txt[i].first;
+	      r_a_txt[i].second = 0;
+
+	      ++i;
+	    }
+
+	  if (i < size)
+	    {
+	      std::cerr << "Read only " << static_cast<unsigned long>(i) <<
+                " words" << std::endl;
+
+	      throw pb_ds::test::illegal_input_error();
+	    }
+	}
+      catch(...)
+	{
+	  std::cerr << "Error reading from file" << std::endl;
+
+	  throw;
+	}
+    }
+
+    template<typename Vec>
+    void
+    distinct_text_populate(const std::string& r_f_name, Vec& r_a_txt)
+    {
+      const size_t size = r_a_txt.size();
+
+      try
+	{
+	  std::ifstream f(r_f_name.c_str());
+
+	  if (!f.good())
+	    {
+	      std::cerr << "Cannot open file " << r_f_name.c_str() <<
+                std::endl;
+
+	      throw pb_ds::test::illegal_input_error();
+	    }
+
+	  typedef std::set< typename Vec::value_type::first_type> set_t;
+
+	  set_t s;
+
+	  while (f.good()&&  s.size() < size)
+	    {
+	      typename Vec::value_type::first_type v;
+
+	      f >> v;
+
+	      if (s.find(v) == s.end())
+		{
+		  r_a_txt[s.size()] = std::make_pair(v, 0);
+
+		  s.insert(v);
+		}
+	    }
+
+	  if (s.size() < size)
+	    {
+	      std::cerr << "Read only " << static_cast<unsigned long>(s.size()) <<
+                " words" << std::endl;
+
+	      throw pb_ds::test::illegal_input_error();
+	    }
+	}
+      catch(...)
+	{
+	  std::cerr << "Error reading from file" << std::endl;
+
+	  throw;
+	}
+    }
+
+  } // namespace test
+
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_TEXT_POPULATE_HPP
diff --git a/libstdc++-v3/testsuite/util/io/verified_cmd_line_input.cc b/libstdc++-v3/testsuite/util/io/verified_cmd_line_input.cc
new file mode 100644
index 00000000000..7b004a565d4
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/io/verified_cmd_line_input.cc
@@ -0,0 +1,131 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file verified_cmd_line_input.cpp
+ * Contains definitions for tests - verified command line input.
+ */
+
+#include <util/io/verified_cmd_line_input.hpp>
+#include <limits.h>
+#include <utility>
+#include <stdlib.h>
+
+namespace pb_ds
+{
+
+  namespace test
+  {
+
+    void
+    verify_argc(size_t given, size_t required)
+    {
+      if (given != required)
+        throw illegal_input_error();
+    }
+
+    void
+    verify_prob(double prob)
+    {
+      if (prob < 0 || prob > 1)
+        throw illegal_input_error();
+    }
+
+    std::string
+    get_cmd_line_str(int argc, char* a_p_argv[], int argn)
+    {
+      if (argc <= argn)
+        throw illegal_input_error();
+
+      const std::string ret(a_p_argv[argn]);
+
+      return (ret);
+    }
+
+    double
+    get_cmd_line_prob(int argc, char* a_p_argv[], int argn)
+    {
+      if (argc <= argn)
+        throw illegal_input_error();
+
+      const double ret = ::atof(a_p_argv[argn]);
+
+      verify_prob(ret);
+
+      return (ret);
+    }
+
+    size_t
+    get_cmd_line_size(int argc, char* a_p_argv[], int argn)
+    {
+      if (argc <= argn)
+        throw illegal_input_error();
+
+      const size_t ret = static_cast<size_t>(::atoi(a_p_argv[argn]));
+
+      return (ret);
+    }
+
+    bool
+    get_cmd_line_bool(int argc, char* a_p_argv[], int argn)
+    {
+      if (argc <= argn)
+        throw illegal_input_error();
+
+      const std::string opt(a_p_argv[argn]);
+
+      if (opt.size() != 1)
+        throw illegal_input_error();
+
+      if (opt[0] == 't')
+        return (true);
+
+      if (opt[0] == 'f')
+        return (false);
+
+      throw illegal_input_error();
+
+      return (false);
+    }
+
+  } // namespace test
+
+} // namespace pb_ds
diff --git a/libstdc++-v3/testsuite/util/io/verified_cmd_line_input.hpp b/libstdc++-v3/testsuite/util/io/verified_cmd_line_input.hpp
new file mode 100644
index 00000000000..725c75e6291
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/io/verified_cmd_line_input.hpp
@@ -0,0 +1,77 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file verified_cmd_line_input.hpp
+ * Contains definitions for tests - verified command line input.
+ */
+
+#ifndef PB_DS_VERIFIED_CMD_LINE_INPUT_HPP
+#define PB_DS_VERIFIED_CMD_LINE_INPUT_HPP
+
+#include <io/illegal_input_error.hpp>
+#include <string>
+
+namespace pb_ds
+{
+  namespace test
+  {
+    void
+    verify_argc(size_t given, size_t required);
+
+    void
+    verify_prob(double prob);
+
+    std::string
+    get_cmd_line_str(int argc, char* a_p_argv[], int argn);
+
+    double
+    get_cmd_line_prob(int argc, char* a_p_argv[], int argn);
+
+    size_t
+    get_cmd_line_size(int argc, char* a_p_argv[], int argn);
+
+    bool
+    get_cmd_line_bool(int argc, char* a_p_argv[], int argn);
+  } // namespace test
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_VERIFIED_CMD_LINE_INPUT_HPP
diff --git a/libstdc++-v3/testsuite/util/io/xml.hpp b/libstdc++-v3/testsuite/util/io/xml.hpp
new file mode 100644
index 00000000000..506c1a10a0d
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/io/xml.hpp
@@ -0,0 +1,131 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file xml.hpp
+ * Contains some xml utilities.
+ */
+
+#ifndef PB_DS_XML_HPP
+#define PB_DS_XML_HPP
+
+#include <string>
+#include <sstream>
+
+namespace pb_ds
+{
+  namespace test
+  {
+    namespace detail
+    {
+      std::string
+      make_xml_name_start_tag(std::string name)
+      { return ("<" + name); }
+
+      template<typename V>
+      std::string
+      make_xml_attrib_val(std::string attrib, const V val)
+      {
+	std::ostringstream sstrm;
+	sstrm << " " << attrib << " = \"" << val << "\"";
+	return (sstrm.str());
+      }
+
+      std::string
+      make_xml_name_start_tag_end_delimiter()
+      { return (">\n"); }
+
+      std::string
+      make_xml_name_end_tag(std::string name)
+      { return ("</" + name + ">\n"); }
+    } // namespace detail
+
+    std::string
+    make_xml_tag(const std::string name,
+		 const std::string data = std::string(""))
+    {
+      std::ostringstream sstrm;
+      sstrm << detail::make_xml_name_start_tag(name);
+      sstrm << detail::make_xml_name_start_tag_end_delimiter();
+      sstrm << data;
+      sstrm << detail::make_xml_name_end_tag(name);
+      return sstrm.str();
+    }
+
+    template<typename Val0>
+    std::string
+    make_xml_tag(const std::string name,
+		 const std::string attrib0,
+		 const Val0 val0,
+		 const std::string data = std::string(""))
+    {
+      std::ostringstream sstrm;
+
+      sstrm << detail::make_xml_name_start_tag(name);
+      sstrm << detail::make_xml_attrib_val(attrib0, val0);
+      sstrm << detail::make_xml_name_start_tag_end_delimiter();
+      sstrm << data;
+      sstrm << detail::make_xml_name_end_tag(name);
+      return sstrm.str();
+    }
+
+    template<typename Val0, typename Val1>
+    std::string
+    make_xml_tag(const std::string name,
+		 const std::string attrib0,
+		 const Val0 val0,
+		 const std::string attrib1,
+		 const Val1 val1,
+		 const std::string data = std::string(""))
+    {
+      std::ostringstream sstrm;
+      sstrm << detail::make_xml_name_start_tag(name);
+      sstrm << detail::make_xml_attrib_val(attrib0, val0);
+      sstrm << detail::make_xml_attrib_val(attrib1, val1);
+      sstrm << detail::make_xml_name_start_tag_end_delimiter();
+      sstrm << data;
+      sstrm << detail::make_xml_name_end_tag(name);
+      return sstrm.str();
+    }
+  } // namespace test
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_XML_HPP
diff --git a/libstdc++-v3/testsuite/util/io/xml_test_formatter.hpp b/libstdc++-v3/testsuite/util/io/xml_test_formatter.hpp
new file mode 100644
index 00000000000..ceedf817378
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/io/xml_test_formatter.hpp
@@ -0,0 +1,88 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file xml_test_formatter.hpp
+ * Contains an XML formatter for tests.
+ */
+
+#ifndef PB_DS_XML_TEST_FORMATTER_HPP
+#define PB_DS_XML_TEST_FORMATTER_HPP
+
+#include <string>
+#include <iostream>
+#include <io/xml.hpp>
+
+namespace pb_ds
+{
+  namespace test
+  {
+    struct xml_test_formatter
+    {
+      xml_test_formatter()
+      {
+	std::cout << "<?xml version = \"1.0\"?>" << std::endl;
+	std::cout << "<test>" << std::endl;
+      }
+
+      virtual
+      ~xml_test_formatter()
+      { std::cout << "</test>" << std::endl; }
+    };
+
+    struct xml_result_set_formatter
+    {
+      xml_result_set_formatter(const std::string& name, const std::string& desc)
+      {
+	std::cout << detail::make_xml_name_start_tag("cntnr");
+	std::cout << detail::make_xml_attrib_val("name", name);
+	std::cout << detail::make_xml_name_start_tag_end_delimiter();	
+	std::cout << make_xml_tag("desc", desc);
+      }
+
+      virtual
+      ~xml_result_set_formatter()
+      { std::cout << "</cntnr>" << std::endl; }
+    };
+  } // namespace test
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_XML_TEST_FORMATTER_HPP
diff --git a/libstdc++-v3/testsuite/util/native_type/assoc/native_hash_map.hpp b/libstdc++-v3/testsuite/util/native_type/assoc/native_hash_map.hpp
new file mode 100644
index 00000000000..528934e92c6
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/native_type/assoc/native_hash_map.hpp
@@ -0,0 +1,137 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file native_hash_map.hpp
+ * Contains an adapter to Dinkumware/SGI hash tables
+ */
+
+#ifndef PB_DS_NATIVE_HASH_MAP_HPP
+#define PB_DS_NATIVE_HASH_MAP_HPP
+
+#include <ext/pb_ds/detail/standard_policies.hpp>
+#include <native_type/assoc/native_hash_tag.hpp>
+#include <io/xml.hpp>
+#include <string>
+
+// Default to using tr1.
+#define PB_DS_USE_TR1 1
+
+#ifdef PB_DS_USE_TR1
+#include <tr1/unordered_map>
+#else
+#include <ext/hash_map>
+#endif 
+
+namespace pb_ds
+{
+  namespace test
+  {
+#ifdef PB_DS_USE_TR1
+#define PB_DS_BASE_C_DEC \
+    std::tr1::unordered_map<Key, Data, Hash_Fn, Eq_Fn, \
+    typename Allocator::template rebind<std::pair<const Key, Data> >::other, Cache_Hash>
+#else 
+#define PB_DS_BASE_C_DEC \
+    __gnu_cxx::hash_map<Key, Data, Hash_Fn, Eq_Fn, \
+    typename Allocator::template rebind<std::pair<const Key, Data> >::other>
+#endif
+
+    template<typename Key,
+	     typename Data,
+	     size_t Init_Size = 8,
+	     typename Hash_Fn = typename pb_ds::detail::default_hash_fn<Key>::type,
+	     typename Eq_Fn = std::equal_to<Key>,
+	     typename Less_Fn = std::less<Key>,
+	     typename Allocator = std::allocator<char>
+#ifdef PB_DS_USE_TR1
+	     , bool Cache_Hash = false
+#endif
+	     >
+    class native_hash_map : public PB_DS_BASE_C_DEC
+    {
+    private:
+      typedef PB_DS_BASE_C_DEC base_type;
+
+    public:
+      typedef native_hash_tag container_category;
+
+    public:
+      native_hash_map() : base_type(Init_Size) { }
+
+      template<typename It>
+      native_hash_map(It f, It l) : base_type(f, l) { }
+
+      static std::string
+      name()
+      {
+#ifdef PB_DS_USE_TR1
+        return std::string("n_hash_map_") 
+               + (Cache_Hash ? std::string("cah") : std::string("ncah"));
+#else 
+        return std::string("n_hash_map_ncah");
+#endif
+      }
+
+      static std::string
+      desc()
+      {
+#ifdef PB_DS_USE_TR1
+        const std::string cache_hash_desc =
+	make_xml_tag("cache_hash_code",
+		     "value",
+		    (Cache_Hash ? std::string("true") : std::string("false")));
+
+        return make_xml_tag("type", "value", "std_tr1_unordered_map", 
+			    cache_hash_desc);
+#else 
+        return make_xml_tag("type", "value", "__gnucxx_hash_map");
+#endif 
+      }
+    };
+
+#undef PB_DS_BASE_C_DEC
+
+  } // namespace test
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_NATIVE_HASH_MAP_HPP
+
diff --git a/libstdc++-v3/testsuite/util/native_type/assoc/native_hash_multimap.hpp b/libstdc++-v3/testsuite/util/native_type/assoc/native_hash_multimap.hpp
new file mode 100644
index 00000000000..65b3c8d8270
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/native_type/assoc/native_hash_multimap.hpp
@@ -0,0 +1,253 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file native_hash_multimap.hpp
+ * Contains an adapter to Dinkumware/SGI hash tables
+ */
+
+#ifndef PB_DS_NATIVE_HASH_MULTIMAP_HPP
+#define PB_DS_NATIVE_HASH_MULTIMAP_HPP
+
+#include <ext/pb_ds/detail/standard_policies.hpp>
+#include <native_type/assoc/native_hash_tag.hpp>
+#include <io/xml.hpp>
+#include <string>
+#include <ext/hash_map>
+
+namespace pb_ds
+{
+
+  namespace test
+  {
+
+#ifdef NATIVE_HASH_MULTIMAP_DEBUG
+#define PB_DS_DBG_ASSERT(X) assert(X)
+#define PB_DS_DBG_VERIFY(X) assert(X)
+#define PB_DS_DBG_ONLY(X) X
+#else // #ifdef NATIVE_HASH_MULTIMAP_DEBUG
+#define PB_DS_DBG_ASSERT(X)
+#define PB_DS_DBG_VERIFY(X) {if((X)==0);}
+#define PB_DS_DBG_ONLY(X) ;
+#endif // #ifdef NATIVE_HASH_MULTIMAP_DEBUG
+
+#define PB_DS_CLASS_T_DEC						\
+    template<								\
+						typename Key,		\
+						typename Data,		\
+						size_t Init_Size,	\
+						class Hash_Fn,		\
+						class Eq_Fn,		\
+						class Less_Fn,		\
+						class Allocator>
+
+#define PB_DS_CLASS_C_DEC					\
+    native_hash_multimap<					\
+						Key,		\
+						Data,		\
+						Init_Size,	\
+						Hash_Fn,	\
+						Eq_Fn,		\
+						Less_Fn,	\
+						Allocator>
+
+#define PB_DS_BASE_C_DEC					\
+    __gnu_cxx::hash_multimap<					\
+						Key,		\
+						Data,		\
+						Hash_Fn,	\
+						Eq_Fn,		\
+						Allocator>
+
+    template<typename Key,
+	     typename Data,
+	     size_t Init_Size = 8,
+	     class Hash_Fn =
+	     typename pb_ds::detail::default_hash_fn<Key>::type,
+	     class Eq_Fn =
+	     std::equal_to<Key>,
+	     class Less_Fn =
+	     std::less<Key>,
+	     class Allocator =
+	     std::allocator<char> >
+    class native_hash_multimap : public PB_DS_BASE_C_DEC
+    {
+    private:
+      typedef PB_DS_BASE_C_DEC base_type;
+
+    public:
+      typedef native_hash_tag container_category;
+
+      typedef Allocator allocator;
+
+      typedef typename base_type::iterator iterator;
+
+      typedef typename base_type::const_iterator const_iterator;
+
+      typedef
+      typename Allocator::template rebind<
+	std::pair<
+	Key,
+	Data> >::other::const_reference
+      const_reference;
+
+    public:
+      native_hash_multimap();
+
+      inline void
+      insert(typename base_type::const_reference r_val)
+      {
+        typedef
+	  std::pair<
+	  typename base_type::iterator,
+	  typename base_type::iterator>
+	  eq_range_t;
+
+        eq_range_t f = base_type::equal_range(r_val.first);
+
+        typename base_type::iterator it = f.first;
+
+        while (it != f.second)
+	  {
+            if (it->second == r_val.second)
+	      return;
+
+            ++it;
+	  }
+
+        base_type::insert(r_val);
+      }
+
+      inline iterator
+      find(const_reference r_val)
+      {
+        typedef
+	std::pair<
+	typename base_type::iterator,
+	typename base_type::iterator>
+	eq_range_t;
+
+        eq_range_t f = base_type::equal_range(r_val.first);
+
+        typename base_type::iterator it = f.first;
+
+        while (it != f.second)
+	  {
+            if (it->second == r_val.second)
+	      return it;
+
+            ++it;
+	  }
+
+        return base_type::end();
+      }
+
+      inline const_iterator
+      find(const_reference r_val) const
+      {
+        typedef
+	std::pair<
+	typename base_type::const_iterator,
+	typename base_type::const_iterator>
+	eq_range_t;
+
+        eq_range_t f = base_type::equal_range(r_val.first);
+
+        typename base_type::const_iterator it = f.first;
+
+        while (it != f.second)
+	  {
+            if (it->second == r_val.second)
+	      return it;
+
+            ++it;
+	  }
+
+        return base_type::end();
+      }
+
+      template<typename It>
+      native_hash_multimap(It f, It l);
+
+      static std::string
+      name()
+      {
+        return ("n_hash_mmap");
+      }
+
+      static std::string
+      desc()
+      {
+        return (make_xml_tag(            "type", "value", "__gnucxx_hash_multimap"));
+      }
+    };
+
+    PB_DS_CLASS_T_DEC
+    PB_DS_CLASS_C_DEC::
+    native_hash_multimap()
+#ifdef __GNUC__
+      :
+    base_type(Init_Size)
+#endif // #ifdef __GNUC__
+    { }
+
+    PB_DS_CLASS_T_DEC
+    template<typename It>
+    PB_DS_CLASS_C_DEC::
+    native_hash_multimap(It f, It l) :
+      base_type(f, l)
+    { }
+
+#undef PB_DS_CLASS_T_DEC
+
+#undef PB_DS_CLASS_C_DEC
+
+#undef PB_DS_BASE_C_DEC
+
+#undef PB_DS_DBG_ASSERT
+#undef PB_DS_DBG_VERIFY
+#undef PB_DS_DBG_ONLY
+
+  } // namespace test
+
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_NATIVE_HASH_MULTIMAP_HPP
diff --git a/libstdc++-v3/testsuite/util/native_type/assoc/native_hash_set.hpp b/libstdc++-v3/testsuite/util/native_type/assoc/native_hash_set.hpp
new file mode 100644
index 00000000000..e1082c907e4
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/native_type/assoc/native_hash_set.hpp
@@ -0,0 +1,159 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file native_hash_set.hpp
+ * Contains an adapter to Dinkumware/SGI hash tables
+ */
+
+#ifndef PB_DS_NATIVE_HASH_SET_HPP
+#define PB_DS_NATIVE_HASH_SET_HPP
+
+#include <ext/pb_ds/detail/standard_policies.hpp>
+#include <native_type/assoc/native_hash_tag.hpp>
+#include <io/xml.hpp>
+#include <string>
+
+// Default to using tr1.
+#define PB_DS_USE_TR1 1
+
+#ifdef PB_DS_USE_TR1
+#include <tr1/unordered_set>
+#else 
+#include <ext/hash_set>
+#endif
+
+namespace pb_ds
+{
+  namespace test
+  {
+#ifdef PB_DS_USE_TR1
+#define PB_DS_BASE_C_DEC \
+    std::tr1::unordered_set<Key, Hash_Fn, Eq_Fn, \
+			    typename Allocator::template rebind<Key>::other>
+#else
+#define PB_DS_BASE_C_DEC \
+    __gnu_cxx::hash_set<Key, Hash_Fn, Eq_Fn, \
+			typename Allocator::template rebind<Key>::other>
+#endif
+
+    template<typename Key,
+	     size_t Init_Size = 8,
+	     typename Hash_Fn = typename pb_ds::detail::default_hash_fn<Key>::type,
+	     typename Eq_Fn = std::equal_to<Key>,
+	     typename Less_Fn = std::less<Key>,
+	     typename Allocator = std::allocator<char>
+#ifdef PB_DS_USE_TR1
+	     , bool Cache_Hash = false
+#endif
+	     >
+    class native_hash_set : public PB_DS_BASE_C_DEC
+    {
+    private:
+      typedef PB_DS_BASE_C_DEC base_type;
+
+    public:
+      typedef native_hash_tag container_category;
+
+      native_hash_set() : base_type(Init_Size) { }
+
+      template<typename It>
+      native_hash_set(It f, It l) : base_type(f, l) { }
+
+      template<typename Pred>
+      inline size_t
+      erase_if(Pred pred)
+      {
+        size_t ersd = 0;
+        bool done = false;
+        while (!done)
+	  {
+            typename base_type::iterator b_it = base_type::begin();
+            typename base_type::iterator e_it = base_type::end();
+            done = true;
+            while (b_it != e_it)
+	      {
+                if (pred(*b_it))
+		  {
+                    ++ersd;
+                    done = false;
+                    base_type::erase(*b_it);
+                    b_it = e_it;
+		  }
+                else
+		  ++b_it;
+	      }
+	  }
+        return ersd;
+      }
+
+      static std::string
+      name()
+      {
+#ifdef PB_DS_USE_TR1
+        return std::string("n_hash_set_") 
+	       + (Cache_Hash ? std::string("cah") : std::string("ncah"));
+#else
+        return std::string("n_hash_set_ncah");
+#endif
+      }
+
+      static std::string
+      desc()
+      {
+#ifdef PB_DS_USE_TR1
+        const std::string cache_hash_desc =
+	make_xml_tag("cache_hash_code", "value",
+		     Cache_Hash ? std::string("true") : std::string("false"));
+
+        return make_xml_tag("type", "value", "std_tr1_unordered_set", 
+			    cache_hash_desc);
+#else
+        return make_xml_tag("type", "value", "__gnucxx_hash_set");
+#endif
+      }
+    };
+
+#undef PB_DS_BASE_C_DEC
+  } // namespace test
+} // namespace pb_ds
+
+#endif
diff --git a/libstdc++-v3/testsuite/util/native_type/assoc/native_hash_tag.hpp b/libstdc++-v3/testsuite/util/native_type/assoc/native_hash_tag.hpp
new file mode 100644
index 00000000000..4c6c80b4275
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/native_type/assoc/native_hash_tag.hpp
@@ -0,0 +1,58 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file native_hash_tag.hpp
+ * Contains a tag for native hash-based containers
+ */
+
+#ifndef PB_DS_NATIVE_HASH_DS_TAG_HPP
+#define PB_DS_NATIVE_HASH_DS_TAG_HPP
+
+namespace pb_ds
+{
+  namespace test
+  {
+    struct native_hash_tag { };
+  } // namespace test
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_NATIVE_HASH_DS_TAG_HPP
diff --git a/libstdc++-v3/testsuite/util/native_type/assoc/native_map.hpp b/libstdc++-v3/testsuite/util/native_type/assoc/native_map.hpp
new file mode 100644
index 00000000000..a9d8e11b10e
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/native_type/assoc/native_map.hpp
@@ -0,0 +1,110 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file native_map.hpp
+ * Contains an adapter to Dinkumware/SGI tree tables
+ */
+
+#ifndef PB_DS_NATIVE_MAP_HPP
+#define PB_DS_NATIVE_MAP_HPP
+
+#include <map>
+#include <ext/pb_ds/detail/standard_policies.hpp>
+#include <native_type/assoc/native_tree_tag.hpp>
+#include <io/xml.hpp>
+#include <string>
+
+namespace pb_ds
+{
+
+  namespace test
+  {
+
+#define PB_DS_BASE_C_DEC						\
+    std::map<								\
+									Key, \
+									Data, \
+									Cmp_Fn,	\
+									typename Allocator::template rebind< \
+																std::pair< \
+																			const Key, \
+																			Data > >::other >
+
+    template<typename Key, typename Data, class Cmp_Fn = std::less<Key>,
+	     class Allocator =
+	     std::allocator<char> >
+    class native_map : public PB_DS_BASE_C_DEC
+    {
+    private:
+      typedef PB_DS_BASE_C_DEC base_type;
+
+    public:
+      typedef native_tree_tag container_category;
+
+    public:
+      native_map() : base_type()
+      { }
+
+      template<typename It>
+      native_map(It f, It l) : base_type(f, l)
+      { }
+
+      static std::string
+      name()
+      {
+        return ("n_map");
+      }
+
+      static std::string
+      desc()
+      {
+        return (make_xml_tag(            "type", "value", "std_map"));
+      }
+    };
+
+#undef PB_DS_BASE_C_DEC
+
+  } // namespace test
+
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_NATIVE_MAP_HPP
diff --git a/libstdc++-v3/testsuite/util/native_type/assoc/native_multimap.hpp b/libstdc++-v3/testsuite/util/native_type/assoc/native_multimap.hpp
new file mode 100644
index 00000000000..f428ca8cdea
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/native_type/assoc/native_multimap.hpp
@@ -0,0 +1,231 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file native_multimap.hpp
+ * Contains an adapter to Dinkumware/SGI tables
+ */
+
+#ifndef PB_DS_NATIVE_MULTIMAP_HPP
+#define PB_DS_NATIVE_MULTIMAP_HPP
+
+#include <map>
+#include <native_type/assoc/native_tree_tag.hpp>
+#include <string>
+
+namespace pb_ds
+{
+
+  namespace test
+  {
+
+#ifdef NATIVE_HASH_SET_DEBUG
+#define PB_DS_DBG_ASSERT(X) assert(X)
+#define PB_DS_DBG_VERIFY(X) assert(X)
+#define PB_DS_DBG_ONLY(X) X
+#else // #ifdef NATIVE_HASH_SET_DEBUG
+#define PB_DS_DBG_ASSERT(X)
+#define PB_DS_DBG_VERIFY(X) {if((X)==0);}
+#define PB_DS_DBG_ONLY(X) ;
+#endif // #ifdef NATIVE_HASH_SET_DEBUG
+
+#define PB_DS_CLASS_T_DEC						\
+    template<typename Key, typename Data, class Less_Fn, class Allocator>
+
+#define PB_DS_CLASS_C_DEC					\
+    native_multimap<						\
+						Key,		\
+						Data,		\
+						Less_Fn,	\
+						Allocator>
+
+#define PB_DS_BASE_C_DEC						\
+    std::multimap<							\
+									Key, \
+									Data, \
+									Less_Fn, \
+									typename Allocator::template rebind< \
+																std::pair< \
+																		const Key, \
+																		Data> >::other >
+
+    template<typename Key, typename Data, class Less_Fn = std::less<Key>,
+	     class Allocator =
+	     std::allocator<char> >
+    class native_multimap : public PB_DS_BASE_C_DEC
+    {
+    private:
+      typedef PB_DS_BASE_C_DEC base_type;
+
+    public:
+      typedef native_tree_tag container_category;
+
+      typedef Allocator allocator;
+
+      typedef
+      typename Allocator::template rebind<
+	std::pair<
+	Key,
+	Data> >::other::const_reference
+      const_reference;
+
+      typedef typename base_type::iterator iterator;
+
+      typedef typename base_type::const_iterator const_iterator;
+
+    public:
+      native_multimap();
+
+      inline void
+      insert(const_reference r_val)
+      {
+        typedef
+	  std::pair<
+	  typename base_type::iterator,
+	  typename base_type::iterator>
+	  eq_range_t;
+
+        eq_range_t f = base_type::equal_range(r_val.first);
+
+        typename base_type::iterator it = f.first;
+
+        while (it != f.second)
+	  {
+            if (it->second == r_val.second)
+	      return;
+
+            ++it;
+	  }
+
+        base_type::insert(r_val);
+      }
+
+      inline iterator
+      find(const_reference r_val)
+      {
+        typedef
+	std::pair<
+	typename base_type::iterator,
+	typename base_type::iterator>
+	eq_range_t;
+
+        eq_range_t f = base_type::equal_range(r_val.first);
+
+        typename base_type::iterator it = f.first;
+
+        while (it != f.second)
+	  {
+            if (it->second == r_val.second)
+	      return it;
+
+            ++it;
+	  }
+
+        return base_type::end();
+      }
+
+      inline const_iterator
+      find(const_reference r_val) const
+      {
+        typedef
+	std::pair<
+	typename base_type::const_iterator,
+	typename base_type::const_iterator>
+	eq_range_t;
+
+        eq_range_t f = base_type::equal_range(r_val.first);
+
+        typename base_type::const_iterator it = f.first;
+
+        while (it != f.second)
+	  {
+            if (it->second == r_val.second)
+	      return it;
+
+            ++it;
+	  }
+
+        return base_type::end();
+      }
+
+      template<typename It>
+      native_multimap(It f, It l);
+
+      static std::string
+      name()
+      {
+        return ("n_mmap");
+      }
+
+      static std::string
+      desc()
+      {
+        return (make_xml_tag(            "type", "value", "std_multimap"));
+      }
+    };
+
+    PB_DS_CLASS_T_DEC
+    PB_DS_CLASS_C_DEC::
+    native_multimap()
+    { }
+
+    PB_DS_CLASS_T_DEC
+    template<typename It>
+    PB_DS_CLASS_C_DEC::
+    native_multimap(It f, It l) :
+      base_type(f, l)
+    { }
+
+#undef PB_DS_CLASS_T_DEC
+
+#undef PB_DS_CLASS_C_DEC
+
+#undef PB_DS_BASE_C_DEC
+
+#undef PB_DS_DBG_ASSERT
+#undef PB_DS_DBG_VERIFY
+#undef PB_DS_DBG_ONLY
+
+  } // namespace test
+
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_NATIVE_MULTIMAP_HPP
diff --git a/libstdc++-v3/testsuite/util/native_type/assoc/native_set.hpp b/libstdc++-v3/testsuite/util/native_type/assoc/native_set.hpp
new file mode 100644
index 00000000000..ec72648f854
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/native_type/assoc/native_set.hpp
@@ -0,0 +1,111 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file native_set.hpp
+ * Contains an adapter to Dinkumware/SGI tree tables
+ */
+
+#ifndef PB_DS_NATIVE_SET_HPP
+#define PB_DS_NATIVE_SET_HPP
+
+#include <ext/pb_ds/detail/standard_policies.hpp>
+#include <native_type/assoc/native_tree_tag.hpp>
+#include <io/xml.hpp>
+#include <string>
+
+namespace pb_ds
+{
+
+  namespace test
+  {
+
+#define PB_DS_BASE_C_DEC						\
+    std::set<								\
+								Key,	\
+								Cmp_Fn,	\
+								typename Allocator::template rebind< \
+														Key>::other>
+
+    template<typename Key, class Cmp_Fn = std::less<Key>,
+	     class Allocator =
+	     std::allocator<char> >
+    class native_set : public PB_DS_BASE_C_DEC
+    {
+    private:
+      typedef PB_DS_BASE_C_DEC base_type;
+
+    public:
+      typedef native_tree_tag container_category;
+
+      typedef typename PB_DS_BASE_C_DEC::const_iterator const_iterator;
+
+    public:
+      native_set() : base_type()
+      { }
+
+      template<typename It>
+      native_set(It f,  It l) : base_type(f, l)
+      { }
+
+      native_set(const_iterator f,  const_iterator l) : base_type(f, l)
+      { }
+
+      static std::string
+      name()
+      {
+        return ("n_set");
+      }
+
+      static std::string
+      desc()
+      {
+        return (make_xml_tag(            "type", "value", "std_set"));
+      }
+    };
+
+#undef PB_DS_BASE_C_DEC
+
+  } // namespace test
+
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_NATIVE_SET_HPP
diff --git a/libstdc++-v3/testsuite/util/native_type/assoc/native_tree_tag.hpp b/libstdc++-v3/testsuite/util/native_type/assoc/native_tree_tag.hpp
new file mode 100644
index 00000000000..bf69c92c235
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/native_type/assoc/native_tree_tag.hpp
@@ -0,0 +1,63 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file native_tree_tag.hpp
+ * Contains a tag for native tree-based containers
+ */
+
+#ifndef PB_DS_NATIVE_TREE_DS_TAG_HPP
+#define PB_DS_NATIVE_TREE_DS_TAG_HPP
+
+namespace pb_ds
+{
+
+  namespace test
+  {
+
+    struct native_tree_tag
+    { };
+
+  } // namespace test
+
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_NATIVE_TREE_DS_TAG_HPP
diff --git a/libstdc++-v3/testsuite/util/native_type/priority_queue/native_pq_tag.hpp b/libstdc++-v3/testsuite/util/native_type/priority_queue/native_pq_tag.hpp
new file mode 100644
index 00000000000..8b0357c99d5
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/native_type/priority_queue/native_pq_tag.hpp
@@ -0,0 +1,63 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file native_tree_tag.hpp
+ * Contains a tag for native tree-based containers
+ */
+
+#ifndef PB_DS_NATIVE_PQ_DS_TAG_HPP
+#define PB_DS_NATIVE_PQ_DS_TAG_HPP
+
+namespace pb_ds
+{
+
+  namespace test
+  {
+
+    struct native_pq_tag
+    { };
+
+  } // namespace test
+
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_NATIVE_PQ_DS_TAG_HPP
diff --git a/libstdc++-v3/testsuite/util/native_type/priority_queue/native_priority_queue.hpp b/libstdc++-v3/testsuite/util/native_type/priority_queue/native_priority_queue.hpp
new file mode 100644
index 00000000000..d8a2865c0f0
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/native_type/priority_queue/native_priority_queue.hpp
@@ -0,0 +1,280 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file native_priority_queue.hpp
+ * Contains an adapter to Dinkumware/SGI tree tables
+ */
+
+#ifndef PB_DS_NATIVE_PRIORITY_QUEUE_HPP
+#define PB_DS_NATIVE_PRIORITY_QUEUE_HPP
+
+#include <ext/pb_ds/detail/standard_policies.hpp>
+#include <ext/pb_ds/detail/type_utils.hpp>
+#include <native_type/priority_queue/native_pq_tag.hpp>
+#include <io/xml.hpp>
+#include <string>
+#include <vector>
+#include <queue>
+#include <deque>
+
+namespace pb_ds
+{
+
+  namespace test
+  {
+
+    namespace detail
+    {
+
+      template<typename Value_Type, bool Vector, class Allocator>
+      struct base_seq
+      {
+	typedef
+        std::vector<
+	  Value_Type,
+	  typename Allocator::template rebind<
+	  Value_Type>::other>
+        type;
+      };
+
+      template<typename Value_Type, class Allocator>
+      struct base_seq<
+	Value_Type,
+	false,
+	Allocator>
+      {
+	typedef
+        std::deque<
+	  Value_Type,
+	  typename Allocator::template rebind<
+	  Value_Type>::other>
+        type;
+      };
+
+    } // namespace detail
+
+#define PB_DS_CLASS_C_DEC					\
+    native_priority_queue<					\
+						Value_Type,	\
+						Vector,		\
+						Cmp_Fn,		\
+						Allocator>
+
+#define PB_DS_BASE_C_DEC						\
+    std::priority_queue<						\
+									Value_Type, \
+									typename detail::base_seq<Value_Type, Vector, Allocator>::type, \
+									Cmp_Fn>
+
+    template<typename Value_Type,
+	     bool Vector,
+	     class Cmp_Fn =
+	     std::less<Value_Type>,
+	     class Allocator = std::allocator<char> >
+    class native_priority_queue : public PB_DS_BASE_C_DEC
+    {
+    private:
+      typedef PB_DS_BASE_C_DEC base_type;
+
+    public:
+      typedef Value_Type value_type;
+
+      typedef
+      typename Allocator::template rebind<
+	value_type>::other::const_reference
+      const_reference;
+
+      typedef native_pq_tag container_category;
+
+      typedef Cmp_Fn cmp_fn;
+
+    public:
+      native_priority_queue() : base_type()
+      { }
+
+      template<typename It>
+      native_priority_queue(It f, It l) : base_type(f, l)
+      { }
+
+      static std::string
+      name()
+      {
+        if (Vector)
+	  return ("n_pq_vector");
+
+        return ("n_pq_deque");
+      }
+
+      static std::string
+      desc()
+      {
+        if (Vector)
+	  return (make_xml_tag(                "type",  "value",  "std::priority_queue_vector"));
+
+        return (make_xml_tag(            "type", "value", "std::priority_queue_deque"));
+      }
+
+      void
+      clear()
+      {
+	* static_cast<base_type* >(this) = base_type();
+      }
+
+      void
+      erase(const_reference r_val)
+      {
+        base_type tmp;
+
+        Cmp_Fn cmp;
+
+        while (cmp(base_type::top(), r_val) || cmp(r_val, base_type::top()))
+	  {
+            tmp.push(base_type::top());
+
+            base_type::pop();
+	  }
+
+        if (!base_type::empty())
+	  {
+            base_type::pop();
+
+            while (!base_type::empty())
+	      {
+                tmp.push(base_type::top());
+
+                base_type::pop();
+	      }
+	  }
+
+	* static_cast<base_type* >(this) = tmp;
+      }
+
+      template<typename Pred>
+      size_t
+      erase_if(Pred pred)
+      {
+        base_type tmp;
+
+        std::size_t ersd = 0;
+
+        while (!base_type::empty())
+	  {
+            if (!pred(base_type::top()))
+	      tmp.push(base_type::top());
+            else
+	      ++ersd;
+
+            base_type::pop();
+	  }
+
+	* static_cast<base_type* >(this) = tmp;
+
+        return ersd;
+      }
+
+      template<typename Pred>
+      void
+      split(Pred pred, PB_DS_CLASS_C_DEC& other)
+      {
+        base_type tmp;
+
+        other.clear();
+
+        while (!base_type::empty())
+	  {
+            if (!pred(base_type::top()))
+	      tmp.push(base_type::top());
+            else
+	      other.push(base_type::top());
+
+            base_type::pop();
+	  }
+
+	* static_cast<base_type* >(this) = tmp;
+      }
+
+      void
+      modify(const_reference r_old, const_reference r_new)
+      {
+        erase(r_old);
+
+        push(r_new);
+      }
+
+      void
+      join(PB_DS_CLASS_C_DEC& other)
+      {
+        std::vector<value_type> a_tmp;
+
+        while (!base_type::empty())
+	  {
+            a_tmp.push_back(base_type::top());
+
+            base_type::pop();
+	  }
+
+        while (!other.empty())
+	  {
+            a_tmp.push_back(other.top());
+
+            other.pop();
+	  }
+
+	* static_cast<base_type* >(this) = base_type(a_tmp.begin(), a_tmp.end());
+      }
+
+      Cmp_Fn
+      get_cmp_fn() const
+      {
+        return Cmp_Fn();
+      }
+    };
+
+#undef PB_DS_BASE_C_DEC
+
+#undef PB_DS_CLASS_C_DEC
+
+  } // namespace test
+
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_NATIVE_PRIORITY_QUEUE_HPP
diff --git a/libstdc++-v3/testsuite/util/performance/assoc/mem_usage/erase_test.hpp b/libstdc++-v3/testsuite/util/performance/assoc/mem_usage/erase_test.hpp
new file mode 100644
index 00000000000..0754567a304
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/performance/assoc/mem_usage/erase_test.hpp
@@ -0,0 +1,145 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file erase_test.hpp
+ * Contains a generic erase test.
+ */
+
+#ifndef PB_DS_ERASE_TEST_HPP
+#define PB_DS_ERASE_TEST_HPP
+
+#include <ext/pb_ds/detail/type_utils.hpp>
+#include <performance/mem/mem_track_allocator.hpp>
+#include <performance/io/xml_formatter.hpp>
+#include <common_type/assoc/string_form.hpp>
+#include <iterator>
+
+namespace pb_ds
+{
+
+  namespace test
+  {
+
+#define PB_DS_CLASS_T_DEC			\
+    template<typename It>
+
+#define PB_DS_CLASS_C_DEC				\
+    erase_test<						\
+						It>
+
+    template<typename It>
+    class erase_test
+    {
+    public:
+      erase_test(It ins_b, size_t ins_vn, size_t ins_vs, size_t ins_vm);
+
+      template<typename Cntnr>
+      void
+      operator()(pb_ds::detail::type_to_type<Cntnr>);
+
+    private:
+      erase_test(const erase_test& );
+
+    private:
+      const It m_ins_b;
+
+      const size_t m_ins_vn;
+      const size_t m_ins_vs;
+      const size_t m_ins_vm;
+    };
+
+    PB_DS_CLASS_T_DEC
+    PB_DS_CLASS_C_DEC::
+    erase_test(It ins_b, size_t ins_vn, size_t ins_vs, size_t ins_vm) :
+      m_ins_b(ins_b),
+      m_ins_vn(ins_vn),
+      m_ins_vs(ins_vs),
+      m_ins_vm(ins_vm)
+    { }
+
+    PB_DS_CLASS_T_DEC
+    template<typename Cntnr>
+    void
+    PB_DS_CLASS_C_DEC::
+    operator()(pb_ds::detail::type_to_type<Cntnr>)
+    {
+      xml_result_set_performance_formatter res_set_fmt(
+						       string_form<Cntnr>::name(),
+						       string_form<Cntnr>::desc());
+
+      for (size_t size_i = 0; m_ins_vn + size_i*  m_ins_vs < m_ins_vm; ++size_i)
+	{
+	  const size_t ins_size = m_ins_vn + size_i*  m_ins_vs;
+
+	  It ins_it_b = m_ins_b;
+	  It ins_it_e = m_ins_b;
+	  std::advance(ins_it_e, ins_size);
+
+	  mem_track_allocator<char> alloc;
+
+	  const size_t init_mem = alloc.get_total();
+
+	  Cntnr cntnr(ins_it_b, ins_it_e);
+
+	  while (cntnr.size() > 1)
+            cntnr.erase(*cntnr.begin());
+
+	  const size_t final_mem = alloc.get_total();
+
+	  assert(final_mem > init_mem);
+
+	  const size_t delta_mem = final_mem - init_mem;
+
+	  res_set_fmt.add_res(ins_size, static_cast<double>(delta_mem));
+	}
+    }
+
+#undef PB_DS_CLASS_T_DEC
+
+#undef PB_DS_CLASS_C_DEC
+
+  } // namespace test
+
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_ERASE_TEST_HPP
+
diff --git a/libstdc++-v3/testsuite/util/performance/assoc/mem_usage/multimap_insert_test.hpp b/libstdc++-v3/testsuite/util/performance/assoc/mem_usage/multimap_insert_test.hpp
new file mode 100644
index 00000000000..2cb9abc8f50
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/performance/assoc/mem_usage/multimap_insert_test.hpp
@@ -0,0 +1,188 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file multimap_insert_test.hpp
+ * Contains a generic multimap_insert_test test.
+ */
+
+#ifndef PB_DS_MULTIMAP_INSERT_TEST_HPP
+#define PB_DS_MULTIMAP_INSERT_TEST_HPP
+
+#include <ext/pb_ds/detail/type_utils.hpp>
+#include <performance/mem/mem_track_allocator.hpp>
+#include <performance/io/xml_formatter.hpp>
+#include <common_type/assoc/string_form.hpp>
+#include <iterator>
+
+namespace pb_ds
+{
+
+  namespace test
+  {
+
+#define PB_DS_CLASS_T_DEC			\
+    template<typename It, bool Native>
+
+#define PB_DS_CLASS_C_DEC				\
+    multimap_insert_test<				\
+						It,	\
+						Native>
+
+    template<typename It, bool Native>
+    class multimap_insert_test
+    {
+    public:
+      multimap_insert_test(It ins_b, size_t ins_vn, size_t ins_vs, size_t ins_vm);
+
+      template<typename Cntnr>
+      void
+      operator()(pb_ds::detail::type_to_type<Cntnr>);
+
+    private:
+      multimap_insert_test(const multimap_insert_test& );
+
+      template<typename Cntnr>
+      size_t
+      insert(pb_ds::detail::type_to_type<Cntnr>, It ins_it_b, It ins_it_e, pb_ds::detail::true_type);
+
+      template<typename Cntnr>
+      size_t
+      insert(pb_ds::detail::type_to_type<Cntnr>, It ins_it_b, It ins_it_e, pb_ds::detail::false_type);
+
+    private:
+      const It m_ins_b;
+
+      const size_t m_ins_vn;
+      const size_t m_ins_vs;
+      const size_t m_ins_vm;
+    };
+
+    PB_DS_CLASS_T_DEC
+    PB_DS_CLASS_C_DEC::
+    multimap_insert_test(It ins_b, size_t ins_vn, size_t ins_vs, size_t ins_vm) :
+      m_ins_b(ins_b),
+      m_ins_vn(ins_vn),
+      m_ins_vs(ins_vs),
+      m_ins_vm(ins_vm)
+    { }
+
+    PB_DS_CLASS_T_DEC
+    template<typename Cntnr>
+    void
+    PB_DS_CLASS_C_DEC::
+    operator()(pb_ds::detail::type_to_type<Cntnr>)
+    {
+      xml_result_set_performance_formatter res_set_fmt(
+						       string_form<Cntnr>::name(),
+						       string_form<Cntnr>::desc());
+
+      for (size_t size_i = 0; m_ins_vn + size_i*  m_ins_vs < m_ins_vm; ++size_i)
+	{
+	  const size_t ins_size = m_ins_vn + size_i*  m_ins_vs;
+
+	  It ins_it_b = m_ins_b;
+	  It ins_it_e = m_ins_b;
+	  std::advance(ins_it_e, ins_size);
+
+	  const size_t delta_mem = insert(pb_ds::detail::type_to_type<Cntnr>(),
+					  ins_it_b,
+					  ins_it_e,
+					  pb_ds::detail::integral_constant<int,Native>());
+
+	  res_set_fmt.add_res(ins_size, static_cast<double>(delta_mem));
+	}
+    }
+
+    PB_DS_CLASS_T_DEC
+    template<typename Cntnr>
+    size_t
+    PB_DS_CLASS_C_DEC::
+    insert(pb_ds::detail::type_to_type<Cntnr>, It ins_it_b, It ins_it_e, pb_ds::detail::true_type)
+    {
+      mem_track_allocator<char> alloc;
+
+      const size_t init_mem = alloc.get_total();
+
+      Cntnr cntnr;
+
+      for (It ins_it = ins_it_b; ins_it != ins_it_e; ++ins_it)
+        cntnr.insert((typename Cntnr::const_reference)(*ins_it));
+
+      const size_t final_mem = alloc.get_total();
+
+      assert(final_mem > init_mem);
+
+      return (final_mem - init_mem);
+    }
+
+    PB_DS_CLASS_T_DEC
+    template<typename Cntnr>
+    size_t
+    PB_DS_CLASS_C_DEC::
+    insert(pb_ds::detail::type_to_type<Cntnr>, It ins_it_b, It ins_it_e, pb_ds::detail::false_type)
+    {
+      mem_track_allocator<char> alloc;
+
+      const size_t init_mem = alloc.get_total();
+
+      Cntnr cntnr;
+
+      for (It ins_it = ins_it_b; ins_it != ins_it_e; ++ins_it)
+        cntnr[ins_it->first].insert(ins_it->second);
+
+      const size_t final_mem = alloc.get_total();
+
+      assert(final_mem > init_mem);
+
+      return (final_mem - init_mem);
+    }
+
+#undef PB_DS_CLASS_T_DEC
+
+#undef PB_DS_CLASS_C_DEC
+
+  } // namespace test
+
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_MULTIMAP_INSERT_TEST_HPP
+
diff --git a/libstdc++-v3/testsuite/util/performance/assoc/multimap_common_type.hpp b/libstdc++-v3/testsuite/util/performance/assoc/multimap_common_type.hpp
new file mode 100644
index 00000000000..244fb101ca2
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/performance/assoc/multimap_common_type.hpp
@@ -0,0 +1,260 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file multimap_common_type.hpp
+ * Contains types for a generic multimap_insert_test test.
+ */
+
+#ifndef PB_DS_MULTIMAP_RANDOM_INT_INSERT_TEST_COMMON_TYPE_HPP
+#define PB_DS_MULTIMAP_RANDOM_INT_INSERT_TEST_COMMON_TYPE_HPP
+
+#include <hash_fn/string_hash_fn.hpp>
+#include <common_type/assoc/common_type.hpp>
+
+namespace pb_ds
+{
+
+  namespace test
+  {
+
+    namespace detail
+    {
+
+      struct int_hash : public std::unary_function<
+        int,
+        size_t>
+      {
+	inline size_t
+        operator()(const int i) const
+	{
+	  return (static_cast<size_t>(i));
+	}
+      };
+
+      template<typename Key, class Allocator = std::allocator<char> >
+      struct hash_set_tl_t
+      {
+	typedef
+        typename pb_ds::test::hash_common_types<
+	  Key,
+	  pb_ds::null_mapped_type,
+	  int_hash,
+	  std::equal_to<
+	  Key>,
+	  Allocator>::performance_min_tl
+        type;
+      };
+
+      template<typename Key, class Allocator = std::allocator<char> >
+      struct lu_set_tl_t
+      {
+	typedef
+        typename pb_ds::test::lu_common_types<
+	  Key,
+	  pb_ds::null_mapped_type,
+	  std::equal_to<
+	  Key>,
+	  Allocator>::performance_min_tl
+        type;
+      };
+
+      template<typename Key,
+	       class Sec_Tl,
+	       class Allocator = std::allocator<
+        char> >
+      struct hash_mmap_tl_t
+      {
+      private:
+	typedef
+        typename pb_ds::detail::conditional_type<
+	pb_ds::detail::is_same<
+	int,
+	Key>::value,
+	int_hash,
+	string_hash_fn>::type
+        hash_fn_t;
+
+	template<typename Cntnr_T>
+	struct hash_mmap_transform
+	{
+	  typedef
+	  typename pb_ds::test::hash_common_types<
+	    Key,
+	    Cntnr_T,
+	    hash_fn_t,
+	    std::equal_to<
+	    Key>,
+	    Allocator>::performance_min_tl
+	  type;
+	};
+
+      public:
+	typedef
+        typename pb_ds::detail::typelist_flatten<
+	typename pb_ds::detail::typelist_transform<
+	Sec_Tl,
+	hash_mmap_transform>::type>::type
+        type;
+      };
+
+      template<typename Key,
+	       class Sec_Tl,
+	       class Allocator = std::allocator<
+        char> >
+      struct tree_mmap_tl_t
+      {
+      private:
+	template<typename Cntnr_T>
+	struct tree_mmap_transform
+	{
+	  typedef
+	  typename pb_ds::test::tree_common_types<
+	    Key,
+	    Cntnr_T,
+	    std::less<
+	    Key>,
+	    pb_ds::null_tree_node_update,
+	    Allocator>::performance_min_tl
+	  type;
+	};
+
+      public:
+	typedef
+        typename pb_ds::detail::typelist_flatten<
+	typename pb_ds::detail::typelist_transform<
+	Sec_Tl,
+	tree_mmap_transform>::type>::type
+        type;
+      };
+
+      template<typename Key, typename Mapped, class Allocator>
+      struct hash_hash_mmap_tl_t
+      {
+      private:
+	typedef typename hash_set_tl_t< Mapped, Allocator>::type sec_tl_t;
+
+      public:
+	typedef typename hash_mmap_tl_t< Key, sec_tl_t, Allocator>::type type;
+      };
+
+      template<typename Key, typename Mapped, class Allocator>
+      struct tree_hash_mmap_tl_t
+      {
+      private:
+	typedef typename hash_set_tl_t< Mapped, Allocator>::type sec_tl_t;
+
+      public:
+	typedef typename tree_mmap_tl_t< Key, sec_tl_t, Allocator>::type type;
+      };
+
+      template<typename Key, typename Mapped, class Allocator>
+      struct tree_lu_mmap_tl_t
+      {
+      private:
+	typedef typename lu_set_tl_t< Mapped, Allocator>::type sec_tl_t;
+
+      public:
+	typedef typename tree_mmap_tl_t< Key, sec_tl_t, Allocator>::type type;
+      };
+
+      template<typename Key, typename Mapped, class Allocator>
+      struct hash_lu_mmap_tl_t
+      {
+      private:
+	typedef typename lu_set_tl_t< Mapped, Allocator>::type sec_tl_t;
+
+      public:
+	typedef typename hash_mmap_tl_t< Key, sec_tl_t, Allocator>::type type;
+      };
+
+    } // namespace detail
+
+    template<typename Key, typename Mapped, class Allocator>
+    struct mmap_tl_t
+    {
+    private:
+      typedef
+      typename detail::hash_hash_mmap_tl_t<
+      Key,
+      Mapped,
+      Allocator>::type
+      hh_mmap_tl_t;
+
+      typedef
+      typename detail::hash_lu_mmap_tl_t<
+	Key,
+	Mapped,
+	Allocator>::type
+      hl_mmap_tl_t;
+
+      typedef
+      typename detail::tree_hash_mmap_tl_t<
+	Key,
+	Mapped,
+	Allocator>::type
+      th_mmap_tl_t;
+
+      typedef
+      typename detail::tree_lu_mmap_tl_t<
+	Key,
+	Mapped,
+	Allocator>::type
+      tl_mmap_tl_t;
+
+    public:
+      typedef
+      typename pb_ds::detail::typelist_append<
+      hl_mmap_tl_t,
+      typename pb_ds::detail::typelist_append<
+      hh_mmap_tl_t,
+      typename pb_ds::detail::typelist_append<
+      th_mmap_tl_t,
+      tl_mmap_tl_t>::type>::type>::type
+      type;
+    };
+
+  } // namespace test
+
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_MULTIMAP_RANDOM_INT_INSERT_TEST_COMMON_TYPE_HPP
+
diff --git a/libstdc++-v3/testsuite/util/performance/assoc/timing/common_type.hpp b/libstdc++-v3/testsuite/util/performance/assoc/timing/common_type.hpp
new file mode 100644
index 00000000000..8a6a22e9827
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/performance/assoc/timing/common_type.hpp
@@ -0,0 +1,113 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file common_type.hpp
+ * Contains types for a generic multimap_insert_test test.
+ */
+
+#ifndef PB_DS_MULTIMAP_RANDOM_INT_INSERT_TEST_COMMON_TYPE_HPP
+#define PB_DS_MULTIMAP_RANDOM_INT_INSERT_TEST_COMMON_TYPE_HPP
+
+#include <common_type/assoc/common_type.hpp>
+
+namespace pb_ds
+{
+
+  namespace test
+  {
+
+    typedef
+    pb_ds::test::hash_common_types<
+      int,
+      pb_ds::null_mapped_type>::tl
+    hash_set_tl_t;
+
+    template<typename Cntnr_T>
+    struct hash_mmap_transform
+    {
+      typedef
+      typename pb_ds::test::hash_common_types<
+	int,
+	pb_ds::compound_data_type<
+	Cntnr_T> >::tl
+      type;
+    };
+
+    typedef
+    pb_ds::detail::typelist_flatten<
+      pb_ds::detail::typelist_transform<
+      hash_set_tl_t,
+      hash_mmap_transform>::type>::type
+    hash_mmap_tl_t;
+
+    typedef
+    pb_ds::test::tree_common_types<
+      int,
+      pb_ds::null_mapped_type>::tl
+    tree_set_tl_t;
+
+    template<typename Cntnr_T>
+    struct tree_mmap_transform
+    {
+      typedef
+      typename pb_ds::test::tree_common_types<
+	int,
+	pb_ds::compound_data_type<
+	Cntnr_T> >::tl
+      type;
+    };
+
+    typedef
+    pb_ds::detail::typelist_flatten<
+      pb_ds::detail::typelist_transform<
+      tree_set_tl_t,
+      tree_mmap_transform>::type>::type
+    tree_mmap_tl_t;
+
+    typedef hash_mmap_tl_t mmap_tl_t;
+
+  } // namespace test
+
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_MULTIMAP_RANDOM_INT_INSERT_TEST_COMMON_TYPE_HPP
+
diff --git a/libstdc++-v3/testsuite/util/performance/assoc/timing/find_test.hpp b/libstdc++-v3/testsuite/util/performance/assoc/timing/find_test.hpp
new file mode 100644
index 00000000000..aa58e8a9d4e
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/performance/assoc/timing/find_test.hpp
@@ -0,0 +1,219 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file find_test.hpp
+ * Contains a generic find test.
+ */
+
+#ifndef PB_DS_FIND_TEST_HPP
+#define PB_DS_FIND_TEST_HPP
+
+#include <performance/time/timing_test_base.hpp>
+#include <performance/io/xml_formatter.hpp>
+#include <common_type/assoc/string_form.hpp>
+#include <iterator>
+
+namespace pb_ds
+{
+
+  namespace test
+  {
+
+    namespace detail
+    {
+
+      template<typename It, class Cntnr, bool LOR>
+      class find_find_functor
+      {
+      public:
+        find_find_functor(Cntnr& r_container,  It fnd_it_b,  It fnd_it_e) : m_r_container(r_container),
+									    m_fnd_it_b(fnd_it_b),
+									    m_fnd_it_e(fnd_it_e)
+	{ }
+
+	void
+        operator()(std::size_t resolution)
+	{
+	  for (std::size_t i = 0; i < resolution; ++i)
+	    {
+	      It fnd_it = m_fnd_it_b;
+
+	      while (fnd_it != m_fnd_it_e)
+                ++m_r_container.find((fnd_it++)->first)->second;
+	    }
+	}
+
+      private:
+	Cntnr& m_r_container;
+
+	const It m_fnd_it_b;
+	const It m_fnd_it_e;
+      };
+
+      template<typename It, class Cntnr>
+      class find_find_functor<
+	It,
+	Cntnr,
+	true>
+      {
+      public:
+        find_find_functor(Cntnr& r_container,  It fnd_it_b,  It fnd_it_e) : m_r_container(r_container),
+									    m_fnd_it_b(fnd_it_b),
+									    m_fnd_it_e(fnd_it_e)
+	{ }
+
+	void
+        operator()(std::size_t resolution)
+	{
+	  It fnd_it = m_fnd_it_b;
+
+	  while (fnd_it != m_fnd_it_e)
+	    {
+	      for (std::size_t i = 0; i < resolution; ++i)
+                ++m_r_container.find(fnd_it->first)->second;
+
+	      ++fnd_it;
+	    }
+	}
+
+      private:
+	Cntnr& m_r_container;
+
+	const It m_fnd_it_b;
+	const It m_fnd_it_e;
+      };
+
+    } // namespace detail
+
+#define PB_DS_CLASS_T_DEC			\
+    template<typename It, bool LOR>
+
+#define PB_DS_CLASS_C_DEC				\
+    find_test<						\
+						It,	\
+						LOR>
+
+    template<typename It, bool LOR = false>
+    class find_test : private pb_ds::test::detail::timing_test_base
+    {
+    public:
+      find_test(It ins_b, It fnd_it_b, size_t ins_vn, size_t ins_vs, size_t ins_vm, size_t fnd_vn, size_t fnd_vs, size_t fnd_vm);
+
+      template<typename Cntnr>
+      void
+      operator()(pb_ds::detail::type_to_type<Cntnr>);
+
+    private:
+      find_test(const find_test& );
+
+    private:
+      const It m_ins_b;
+
+      const It m_fnd_it_b;
+
+      const size_t m_ins_vn;
+      const size_t m_ins_vs;
+      const size_t m_ins_vm;
+
+      const size_t m_fnd_vn;
+      const size_t m_fnd_vs;
+      const size_t m_fnd_vm;
+    };
+
+    PB_DS_CLASS_T_DEC
+    PB_DS_CLASS_C_DEC::
+    find_test(It ins_b, It fnd_it_b, size_t ins_vn, size_t ins_vs, size_t ins_vm, size_t fnd_vn, size_t fnd_vs, size_t fnd_vm) :
+      m_ins_b(ins_b),
+      m_fnd_it_b(fnd_it_b),
+      m_ins_vn(ins_vn),
+      m_ins_vs(ins_vs),
+      m_ins_vm(ins_vm),
+      m_fnd_vn(fnd_vn),
+      m_fnd_vs(fnd_vs),
+      m_fnd_vm(fnd_vm)
+    { }
+
+    PB_DS_CLASS_T_DEC
+    template<typename Cntnr>
+    void
+    PB_DS_CLASS_C_DEC::
+    operator()(pb_ds::detail::type_to_type<Cntnr>)
+    {
+      xml_result_set_performance_formatter res_set_fmt(
+						       string_form<Cntnr>::name(),
+						       string_form<Cntnr>::desc());
+
+      for (size_t size_i = 0; m_ins_vn + size_i*  m_ins_vs < m_ins_vm; ++size_i)
+	{
+	  const size_t v = m_ins_vn + size_i*  m_ins_vs;
+	  const size_t fnd_size = m_fnd_vn + size_i*  m_fnd_vs;
+
+	  It ins_it_b = m_ins_b;
+	  It ins_it_e = m_ins_b;
+	  std::advance(ins_it_e, v);
+
+	  Cntnr test_container(ins_it_b, ins_it_e);
+
+	  It fnd_it_b = m_fnd_it_b;
+	  It fnd_it_e = m_fnd_it_b;
+	  std::advance(fnd_it_e, fnd_size);
+
+	  pb_ds::test::detail::find_find_functor<It, Cntnr, LOR>
+            fn(test_container, fnd_it_b, fnd_it_e);
+
+	  const double res =
+            pb_ds::test::detail::timing_test_base::operator()(fn);
+
+	  res_set_fmt.add_res(v, res / fnd_size);
+	}
+    }
+
+#undef PB_DS_CLASS_T_DEC
+
+#undef PB_DS_CLASS_C_DEC
+
+  } // namespace test
+
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_FIND_TEST_HPP
+
diff --git a/libstdc++-v3/testsuite/util/performance/assoc/timing/insert_test.hpp b/libstdc++-v3/testsuite/util/performance/assoc/timing/insert_test.hpp
new file mode 100644
index 00000000000..d4227796d75
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/performance/assoc/timing/insert_test.hpp
@@ -0,0 +1,182 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file insert_test.hpp
+ * Contains an insert performance test.
+ */
+
+#ifndef PB_DS_INSERT_TEST_HPP
+#define PB_DS_INSERT_TEST_HPP
+
+#include <performance/time/timing_test_base.hpp>
+#include <ext/pb_ds/detail/type_utils.hpp>
+#include <performance/io/xml_formatter.hpp>
+#include <common_type/assoc/string_form.hpp>
+#include <iterator>
+
+namespace pb_ds
+{
+
+  namespace test
+  {
+
+    namespace detail
+    {
+
+      template<typename It, class Cntnr>
+      class insert_insert_functor
+      {
+      public:
+        insert_insert_functor(It ins_it_b,  It ins_it_e) : m_ins_it_b(ins_it_b),
+							   m_ins_it_e(ins_it_e)
+	{ }
+
+	void
+        operator()(std::size_t resolution)
+	{
+	  for (std::size_t i = 0; i < resolution; ++i)
+	    {
+	      Cntnr cntnr;
+
+	      for (It ins_it = m_ins_it_b; ins_it != m_ins_it_e; ++ins_it)
+                cntnr.insert((typename Cntnr::const_reference)(*ins_it));
+	    }
+	}
+
+      private:
+	const It m_ins_it_b;
+	const It m_ins_it_e;
+      };
+
+    } // namespace detail
+
+#define PB_DS_CLASS_T_DEC			\
+    template<typename It>
+
+#define PB_DS_CLASS_C_DEC				\
+    insert_test<					\
+						It>
+
+    template<typename It>
+    class insert_test : private pb_ds::test::detail::timing_test_base
+    {
+    public:
+      insert_test(It ins_b, size_t ins_vn, size_t ins_vs, size_t ins_vm);
+
+      template<typename Cntnr>
+      void
+      operator()(pb_ds::detail::type_to_type<Cntnr>);
+
+    private:
+      insert_test(const insert_test& );
+
+      template<typename Cntnr>
+      void
+      insert(pb_ds::detail::type_to_type<Cntnr>, It ins_it_b, It ins_it_e);
+
+    private:
+      const It m_ins_b;
+
+      const size_t m_ins_vn;
+      const size_t m_ins_vs;
+      const size_t m_ins_vm;
+    };
+
+    PB_DS_CLASS_T_DEC
+    PB_DS_CLASS_C_DEC::
+    insert_test(It ins_b, size_t ins_vn, size_t ins_vs, size_t ins_vm) :
+      m_ins_b(ins_b),
+      m_ins_vn(ins_vn),
+      m_ins_vs(ins_vs),
+      m_ins_vm(ins_vm)
+    { }
+
+    PB_DS_CLASS_T_DEC
+    template<typename Cntnr>
+    void
+    PB_DS_CLASS_C_DEC::
+    operator()(pb_ds::detail::type_to_type<Cntnr>)
+    {
+      xml_result_set_performance_formatter res_set_fmt(
+						       string_form<Cntnr>::name(),
+						       string_form<Cntnr>::desc());
+
+      for (size_t size_i = 0; m_ins_vn + size_i*  m_ins_vs < m_ins_vm; ++size_i)
+	{
+	  const size_t v = m_ins_vn + size_i*  m_ins_vs;
+
+	  It ins_it_b = m_ins_b;
+	  It ins_it_e = m_ins_b;
+	  std::advance(ins_it_e, v);
+
+	  pb_ds::test::detail::insert_insert_functor<It, Cntnr>
+            fn(ins_it_b, ins_it_e);
+
+	  const double res =
+            pb_ds::test::detail::timing_test_base::operator()(fn);
+
+	  res_set_fmt.add_res(v, res / v);
+	}
+    }
+
+    PB_DS_CLASS_T_DEC
+    template<typename Cntnr>
+    void
+    PB_DS_CLASS_C_DEC::
+    insert(pb_ds::detail::type_to_type<Cntnr>, It ins_it_b, It ins_it_e)
+    {
+      Cntnr cntnr;
+
+      for (It ins_it = ins_it_b; ins_it != ins_it_e; ++ins_it)
+        cntnr.insert((typename Cntnr::const_reference)(*ins_it));
+    }
+
+#undef PB_DS_CLASS_T_DEC
+
+#undef PB_DS_CLASS_C_DEC
+
+  } // namespace test
+
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_INSERT_TEST_HPP
+
diff --git a/libstdc++-v3/testsuite/util/performance/assoc/timing/multimap_find_test.hpp b/libstdc++-v3/testsuite/util/performance/assoc/timing/multimap_find_test.hpp
new file mode 100644
index 00000000000..1d005fc686f
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/performance/assoc/timing/multimap_find_test.hpp
@@ -0,0 +1,253 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file multimap_find_test.hpp
+ * Contains a generic multimap_find_test test.
+ */
+
+#ifndef PB_DS_MULTIMAP_INSERT_TEST_HPP
+#define PB_DS_MULTIMAP_INSERT_TEST_HPP
+
+#include <performance/time/timing_test_base.hpp>
+#include <performance/io/xml_formatter.hpp>
+#include <common_type/assoc/string_form.hpp>
+#include <iterator>
+
+namespace pb_ds
+{
+
+  namespace test
+  {
+
+    namespace detail
+    {
+
+      template<typename It, class Cntnr, bool Native>
+      class multimap_find_functor
+      {
+      public:
+        multimap_find_functor(const Cntnr& r_container,  It fnd_it_b,  It fnd_it_e) : m_r_container(r_container),
+										      m_fnd_it_b(fnd_it_b),
+										      m_fnd_it_e(fnd_it_e)
+	{ }
+
+	void
+        operator()(std::size_t resolution)
+	{
+	  size_t not_found_count = 0;
+
+	  for (std::size_t i = 0; i < resolution; ++i)
+	    {
+	      typename Cntnr::const_point_iterator prm_end_it = m_r_container.end();
+
+	      for (It fnd_it = m_fnd_it_b; fnd_it != m_fnd_it_e; ++fnd_it)
+		{
+		  typename Cntnr::const_point_iterator prm_it = m_r_container.find(fnd_it->first);
+
+		  if (prm_it == prm_end_it ||
+		      prm_it->second.find(fnd_it->second) == prm_it->second.end())
+                    ++not_found_count;
+		}
+	    }
+
+	  if (not_found_count != 0)
+            abort();
+	}
+
+      private:
+	const Cntnr& m_r_container;
+
+	const It m_fnd_it_b;
+	const It m_fnd_it_e;
+      };
+
+      template<typename It, class Cntnr>
+      class multimap_find_functor<
+	It,
+	Cntnr,
+	true>
+      {
+      public:
+        multimap_find_functor(const Cntnr& r_container,  It fnd_it_b,  It fnd_it_e) : m_r_container(r_container),
+										      m_fnd_it_b(fnd_it_b),
+										      m_fnd_it_e(fnd_it_e)
+	{ }
+
+	void
+        operator()(std::size_t resolution)
+	{
+	  size_t not_found_count = 0;
+
+	  for (std::size_t i = 0; i < resolution; ++i)
+	    {
+	      Cntnr cntnr;
+
+	      for (It fnd_it = m_fnd_it_b; fnd_it != m_fnd_it_e; ++fnd_it)
+                if (m_r_container.find((typename Cntnr::const_reference)(*fnd_it)) == m_r_container.end())
+		  ++not_found_count;
+	    }
+
+	  if (not_found_count != 0)
+            abort();
+	}
+
+      private:
+	const Cntnr& m_r_container;
+
+	const It m_fnd_it_b;
+	const It m_fnd_it_e;
+      };
+
+    } // namespace detail
+
+#define PB_DS_CLASS_T_DEC			\
+    template<typename It, bool Native>
+
+#define PB_DS_CLASS_C_DEC				\
+    multimap_find_test<					\
+						It,	\
+						Native>
+
+    template<typename It, bool Native>
+    class multimap_find_test : private pb_ds::test::detail::timing_test_base
+    {
+    public:
+      multimap_find_test(It ins_b, size_t ins_vn, size_t ins_vs, size_t ins_vm);
+
+      template<typename Cntnr>
+      void
+      operator()(pb_ds::detail::type_to_type<Cntnr>);
+
+    private:
+      multimap_find_test(const multimap_find_test& );
+
+      template<typename Cntnr>
+      Cntnr
+      init(It ins_b, It ins_e, pb_ds::detail::type_to_type<Cntnr>, pb_ds::detail::true_type);
+
+      template<typename Cntnr>
+      Cntnr
+      init(It ins_b, It ins_e, pb_ds::detail::type_to_type<Cntnr>, pb_ds::detail::false_type);
+
+    private:
+      const It m_ins_b;
+
+      const size_t m_ins_vn;
+      const size_t m_ins_vs;
+      const size_t m_ins_vm;
+    };
+
+    PB_DS_CLASS_T_DEC
+    PB_DS_CLASS_C_DEC::
+    multimap_find_test(It ins_b, size_t ins_vn, size_t ins_vs, size_t ins_vm) :
+      m_ins_b(ins_b),
+      m_ins_vn(ins_vn),
+      m_ins_vs(ins_vs),
+      m_ins_vm(ins_vm)
+    { }
+
+    PB_DS_CLASS_T_DEC
+    template<typename Cntnr>
+    void
+    PB_DS_CLASS_C_DEC::
+    operator()(pb_ds::detail::type_to_type<Cntnr>)
+    {
+      xml_result_set_performance_formatter res_set_fmt(
+						       string_form<Cntnr>::name(),
+						       string_form<Cntnr>::desc());
+
+      for (size_t size_i = 0; m_ins_vn + size_i*  m_ins_vs < m_ins_vm; ++size_i)
+	{
+	  const size_t v = m_ins_vn + size_i*  m_ins_vs;
+
+	  It ins_it_b = m_ins_b;
+	  It ins_it_e = m_ins_b;
+	  std::advance(ins_it_e, v);
+
+	  Cntnr c = init(ins_it_b,
+			 ins_it_e,
+			 pb_ds::detail::type_to_type<Cntnr>(),
+			 pb_ds::detail::integral_constant<int,Native>());
+
+	  pb_ds::test::detail::multimap_find_functor<It, Cntnr, Native>
+            fn(c, ins_it_b, ins_it_e);
+
+	  const double res =
+            pb_ds::test::detail::timing_test_base::operator()(fn);
+
+	  res_set_fmt.add_res(v, res / v);
+	}
+    }
+
+    PB_DS_CLASS_T_DEC
+    template<typename Cntnr>
+    Cntnr
+    PB_DS_CLASS_C_DEC::
+    init(It ins_b, It ins_e, pb_ds::detail::type_to_type<Cntnr>, pb_ds::detail::true_type)
+    {
+      return Cntnr(ins_b, ins_e);
+    }
+
+    PB_DS_CLASS_T_DEC
+    template<typename Cntnr>
+    Cntnr
+    PB_DS_CLASS_C_DEC::
+    init(It ins_b, It ins_e, pb_ds::detail::type_to_type<Cntnr>, pb_ds::detail::false_type)
+    {
+      Cntnr ret;
+
+      for (It it = ins_b; it != ins_e; ++it)
+        ret[it->first].insert(it->second);
+
+      return ret;
+    }
+
+#undef PB_DS_CLASS_T_DEC
+
+#undef PB_DS_CLASS_C_DEC
+
+  } // namespace test
+
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_MULTIMAP_INSERT_TEST_HPP
+
diff --git a/libstdc++-v3/testsuite/util/performance/assoc/timing/multimap_insert_test.hpp b/libstdc++-v3/testsuite/util/performance/assoc/timing/multimap_insert_test.hpp
new file mode 100644
index 00000000000..f481137825c
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/performance/assoc/timing/multimap_insert_test.hpp
@@ -0,0 +1,194 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file multimap_insert_test.hpp
+ * Contains a generic multimap_insert_test test.
+ */
+
+#ifndef PB_DS_MULTIMAP_INSERT_TEST_HPP
+#define PB_DS_MULTIMAP_INSERT_TEST_HPP
+
+#include <performance/time/timing_test_base.hpp>
+#include <performance/io/xml_formatter.hpp>
+#include <common_type/assoc/string_form.hpp>
+#include <iterator>
+
+namespace pb_ds
+{
+
+  namespace test
+  {
+
+    namespace detail
+    {
+
+      template<typename It, class Cntnr, bool Native>
+      class multimap_insert_functor
+      {
+      public:
+        multimap_insert_functor(It ins_it_b,  It ins_it_e) : m_ins_it_b(ins_it_b),
+							     m_ins_it_e(ins_it_e)
+	{ }
+
+	void
+        operator()(std::size_t resolution)
+	{
+	  for (std::size_t i = 0; i < resolution; ++i)
+	    {
+	      Cntnr cntnr;
+
+	      for (It ins_it = m_ins_it_b; ins_it != m_ins_it_e; ++ins_it)
+                cntnr[ins_it->first].insert(ins_it->second);
+	    }
+	}
+
+      private:
+	const It m_ins_it_b;
+	const It m_ins_it_e;
+      };
+
+      template<typename It, class Cntnr>
+      class multimap_insert_functor<
+	It,
+	Cntnr,
+	true>
+      {
+      public:
+        multimap_insert_functor(It ins_it_b,  It ins_it_e) : m_ins_it_b(ins_it_b),
+							     m_ins_it_e(ins_it_e)
+	{ }
+
+	void
+        operator()(std::size_t resolution)
+	{
+	  for (std::size_t i = 0; i < resolution; ++i)
+	    {
+	      Cntnr cntnr;
+
+	      for (It ins_it = m_ins_it_b; ins_it != m_ins_it_e; ++ins_it)
+                cntnr.insert((typename Cntnr::const_reference)(*ins_it));
+	    }
+	}
+
+      private:
+	const It m_ins_it_b;
+	const It m_ins_it_e;
+      };
+
+    } // namespace detail
+
+#define PB_DS_CLASS_T_DEC			\
+    template<typename It, bool Native>
+
+#define PB_DS_CLASS_C_DEC				\
+    multimap_insert_test<				\
+						It,	\
+						Native>
+
+    template<typename It, bool Native>
+    class multimap_insert_test : private pb_ds::test::detail::timing_test_base
+    {
+    public:
+      multimap_insert_test(It ins_b, size_t ins_vn, size_t ins_vs, size_t ins_vm);
+
+      template<typename Cntnr>
+      void
+      operator()(pb_ds::detail::type_to_type<Cntnr>);
+
+    private:
+      multimap_insert_test(const multimap_insert_test& );
+
+    private:
+      const It m_ins_b;
+
+      const size_t m_ins_vn;
+      const size_t m_ins_vs;
+      const size_t m_ins_vm;
+    };
+
+    PB_DS_CLASS_T_DEC
+    PB_DS_CLASS_C_DEC::
+    multimap_insert_test(It ins_b, size_t ins_vn, size_t ins_vs, size_t ins_vm) :
+      m_ins_b(ins_b),
+      m_ins_vn(ins_vn),
+      m_ins_vs(ins_vs),
+      m_ins_vm(ins_vm)
+    { }
+
+    PB_DS_CLASS_T_DEC
+    template<typename Cntnr>
+    void
+    PB_DS_CLASS_C_DEC::
+    operator()(pb_ds::detail::type_to_type<Cntnr>)
+    {
+      xml_result_set_performance_formatter res_set_fmt(
+						       string_form<Cntnr>::name(),
+						       string_form<Cntnr>::desc());
+
+      for (size_t size_i = 0; m_ins_vn + size_i*  m_ins_vs < m_ins_vm; ++size_i)
+	{
+	  const size_t v = m_ins_vn + size_i*  m_ins_vs;
+
+	  It ins_it_b = m_ins_b;
+	  It ins_it_e = m_ins_b;
+	  std::advance(ins_it_e, v);
+
+	  pb_ds::test::detail::multimap_insert_functor<It, Cntnr, Native>
+            fn(ins_it_b, ins_it_e);
+
+	  const double res =
+            pb_ds::test::detail::timing_test_base::operator()(fn);
+
+	  res_set_fmt.add_res(v, res / v);
+	}
+    }
+
+#undef PB_DS_CLASS_T_DEC
+
+#undef PB_DS_CLASS_C_DEC
+
+  } // namespace test
+
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_MULTIMAP_INSERT_TEST_HPP
+
diff --git a/libstdc++-v3/testsuite/util/performance/assoc/timing/subscript_find_test.hpp b/libstdc++-v3/testsuite/util/performance/assoc/timing/subscript_find_test.hpp
new file mode 100644
index 00000000000..eaf66b4537e
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/performance/assoc/timing/subscript_find_test.hpp
@@ -0,0 +1,185 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file subscript_find_test.hpp
+ * Contains a generic subscript_find_test test.
+ */
+
+#ifndef PB_DS_SUBSCRIPT_TEST_HPP
+#define PB_DS_SUBSCRIPT_TEST_HPP
+
+#include <performance/time/timing_test_base.hpp>
+#include <common_type/assoc/string_form.hpp>
+#include <iterator>
+
+namespace pb_ds
+{
+
+  namespace test
+  {
+
+    namespace detail
+    {
+
+      template<typename It, class Cntnr>
+      class subscript_find_functor
+      {
+      public:
+        subscript_find_functor(Cntnr& r_container,  It fnd_it_b,  It fnd_it_e) : m_r_container(r_container),
+										 m_fnd_it_b(fnd_it_b),
+										 m_fnd_it_e(fnd_it_e)
+	{ }
+
+	void
+        operator()(std::size_t resolution)
+	{
+	  for (std::size_t i = 0; i < resolution; ++i)
+	    {
+	      It fnd_it = m_fnd_it_b;
+
+	      while (fnd_it != m_fnd_it_e)
+                ++m_r_container[(fnd_it++)->first];
+
+	      ++fnd_it;
+	    }
+	}
+
+      private:
+	Cntnr& m_r_container;
+	const It m_fnd_it_b;
+	const It m_fnd_it_e;
+      };
+
+    } // namespace detail
+
+#define PB_DS_CLASS_T_DEC			\
+    template<typename It>
+
+#define PB_DS_CLASS_C_DEC				\
+    subscript_find_test<				\
+						It>
+
+    template<typename It>
+    class subscript_find_test : private pb_ds::test::detail::timing_test_base
+    {
+    public:
+      subscript_find_test(It ins_b, It fnd_b, size_t ins_vn, size_t ins_vs, size_t ins_vm, size_t fnd_vn, size_t fnd_vs, size_t fnd_vm);
+
+      template<typename Cntnr>
+      void
+      operator()(pb_ds::detail::type_to_type<Cntnr>);
+
+    private:
+      subscript_find_test(const subscript_find_test& );
+
+    private:
+      const It m_ins_b;
+
+      const It m_fnd_b;
+
+      const size_t m_ins_vn;
+      const size_t m_ins_vs;
+      const size_t m_ins_vm;
+
+      const size_t m_fnd_vn;
+      const size_t m_fnd_vs;
+      const size_t m_fnd_vm;
+    };
+
+    PB_DS_CLASS_T_DEC
+    PB_DS_CLASS_C_DEC::
+    subscript_find_test(It ins_b, It fnd_b, size_t ins_vn, size_t ins_vs, size_t ins_vm, size_t fnd_vn, size_t fnd_vs, size_t fnd_vm) :
+      m_ins_b(ins_b),
+      m_fnd_b(fnd_b),
+      m_ins_vn(ins_vn),
+      m_ins_vs(ins_vs),
+      m_ins_vm(ins_vm),
+      m_fnd_vn(fnd_vn),
+      m_fnd_vs(fnd_vs),
+      m_fnd_vm(fnd_vm)
+    { }
+
+    PB_DS_CLASS_T_DEC
+    template<typename Cntnr>
+    void
+    PB_DS_CLASS_C_DEC::
+    operator()(pb_ds::detail::type_to_type<Cntnr>)
+    {
+      xml_result_set_performance_formatter res_set_fmt(
+						       string_form<Cntnr>::name(),
+						       string_form<Cntnr>::desc());
+
+      for (size_t size_i = 0; m_ins_vn + size_i*  m_ins_vs < m_ins_vm; ++size_i)
+	{
+	  const size_t v = m_ins_vn + size_i*  m_ins_vs;
+	  const size_t fnd_size = m_fnd_vn + size_i*  m_fnd_vs;
+
+	  It ins_it_b = m_ins_b;
+	  It ins_it_e = m_ins_b;
+	  std::advance(ins_it_e, v);
+
+	  Cntnr test_container(ins_it_b, ins_it_e);
+
+	  It fnd_it_b = m_fnd_b;
+	  It fnd_it_e = m_fnd_b;
+	  std::advance(fnd_it_e, fnd_size);
+
+	  pb_ds::test::detail::subscript_find_functor<It, Cntnr>
+            fn(test_container, fnd_it_b, fnd_it_e);
+
+	  const double res =
+            pb_ds::test::detail::timing_test_base::operator()(fn);
+
+	  res_set_fmt.add_res(v, res / fnd_size);
+	}
+    }
+
+#undef PB_DS_CLASS_T_DEC
+
+#undef PB_DS_CLASS_C_DEC
+
+  } // namespace test
+
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_SUBSCRIPT_TEST_HPP
+
diff --git a/libstdc++-v3/testsuite/util/performance/assoc/timing/subscript_insert_test.hpp b/libstdc++-v3/testsuite/util/performance/assoc/timing/subscript_insert_test.hpp
new file mode 100644
index 00000000000..2fd8b887487
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/performance/assoc/timing/subscript_insert_test.hpp
@@ -0,0 +1,176 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file subscript_insert_test.hpp
+ * Contains a generic subscript_insert_test test.
+ */
+
+#ifndef PB_DS_SUBSCRIPT_TEST_HPP
+#define PB_DS_SUBSCRIPT_TEST_HPP
+
+#include <performance/time/timing_test_base.hpp>
+#include <performance/io/xml_formatter.hpp>
+#include <common_type/assoc/string_form.hpp>
+#include <statistic/res_recorder.hpp>
+#include <iterator>
+
+namespace pb_ds
+{
+
+  namespace test
+  {
+
+    namespace detail
+    {
+
+      template<typename It, class Cntnr>
+      class subscript_insert_functor
+      {
+      public:
+        subscript_insert_functor(It ins_it_b,  It ins_it_e) : m_ins_it_b(ins_it_b),
+							      m_ins_it_e(ins_it_e)
+	{ }
+
+	void
+        operator()(std::size_t resolution)
+	{
+	  for (std::size_t i = 0; i < resolution; ++i)
+	    {
+	      Cntnr cntnr;
+
+	      for (It ins_it = m_ins_it_b; ins_it != m_ins_it_e; ++ins_it)
+                ++cntnr[ins_it->first];
+	    }
+	}
+
+      private:
+	const It m_ins_it_b;
+	const It m_ins_it_e;
+      };
+
+    } // namespace detail
+
+#define PB_DS_CLASS_T_DEC			\
+    template<typename It>
+
+#define PB_DS_CLASS_C_DEC				\
+    subscript_insert_test<				\
+						It>
+
+    template<typename It>
+    class subscript_insert_test : private pb_ds::test::detail::timing_test_base
+    {
+    public:
+      subscript_insert_test(It ins_b, It fnd_b, size_t ins_vn, size_t ins_vs, size_t ins_vm, size_t fnd_vn, size_t fnd_vs, size_t fnd_vm);
+
+      template<typename Cntnr>
+      void
+      operator()(pb_ds::detail::type_to_type<Cntnr>);
+
+    private:
+      subscript_insert_test(const subscript_insert_test& );
+
+    private:
+      const It m_ins_b;
+
+      const It m_fnd_b;
+
+      const size_t m_ins_vn;
+      const size_t m_ins_vs;
+      const size_t m_ins_vm;
+
+      const size_t m_fnd_vn;
+      const size_t m_fnd_vs;
+      const size_t m_fnd_vm;
+    };
+
+    PB_DS_CLASS_T_DEC
+    PB_DS_CLASS_C_DEC::
+    subscript_insert_test(It ins_b, It fnd_b, size_t ins_vn, size_t ins_vs, size_t ins_vm, size_t fnd_vn, size_t fnd_vs, size_t fnd_vm) :
+      m_ins_b(ins_b),
+      m_fnd_b(fnd_b),
+      m_ins_vn(ins_vn),
+      m_ins_vs(ins_vs),
+      m_ins_vm(ins_vm),
+      m_fnd_vn(fnd_vn),
+      m_fnd_vs(fnd_vs),
+      m_fnd_vm(fnd_vm)
+    { }
+
+    PB_DS_CLASS_T_DEC
+    template<typename Cntnr>
+    void
+    PB_DS_CLASS_C_DEC::
+    operator()(pb_ds::detail::type_to_type<Cntnr>)
+    {
+      xml_result_set_performance_formatter res_set_fmt(
+						       string_form<Cntnr>::name(),
+						       string_form<Cntnr>::desc());
+
+      for (size_t size_i = 0; m_ins_vn + size_i*  m_ins_vs < m_ins_vm; ++size_i)
+	{
+	  const size_t v = m_ins_vn + size_i*  m_ins_vs;
+
+	  It ins_it_b = m_ins_b;
+	  It ins_it_e = m_ins_b;
+	  std::advance(ins_it_e, v);
+
+	  pb_ds::test::detail::subscript_insert_functor<It, Cntnr>
+            fn(ins_it_b, ins_it_e);
+
+	  const double res =
+            pb_ds::test::detail::timing_test_base::operator()(fn);
+
+	  res_set_fmt.add_res(v, res / v);
+	}
+    }
+
+#undef PB_DS_CLASS_T_DEC
+
+#undef PB_DS_CLASS_C_DEC
+
+  } // namespace test
+
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_SUBSCRIPT_TEST_HPP
+
diff --git a/libstdc++-v3/testsuite/util/performance/assoc/timing/tree_order_statistics_test.hpp b/libstdc++-v3/testsuite/util/performance/assoc/timing/tree_order_statistics_test.hpp
new file mode 100644
index 00000000000..c87a7823d6a
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/performance/assoc/timing/tree_order_statistics_test.hpp
@@ -0,0 +1,225 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file tree_order_statistics_test.hpp
+ * Contains a test for order_statisticsing trees
+ */
+
+#ifndef PB_DS_TREE_ORDER_STATISTICS_TEST_HPP
+#define PB_DS_TREE_ORDER_STATISTICS_TEST_HPP
+
+#include <performance/time/timing_test_base.hpp>
+#include <performance/io/xml_formatter.hpp>
+#include <common_type/assoc/string_form.hpp>
+#include <iterator>
+
+namespace pb_ds
+{
+
+  namespace test
+  {
+
+    namespace detail
+    {
+
+#define PB_DS_STATIC_ASSERT(UNIQUE, E)					\
+      typedef								\
+      pb_ds::detail::static_assert_dumclass<				\
+									sizeof(pb_ds::detail::static_assert<(bool)(E)>)> \
+      UNIQUE##static_assert_type
+
+      template<typename Cntnr, bool Native>
+      class order_statistics_functor
+      {
+      public:
+        order_statistics_functor(Cntnr& r_container) : m_r_container(r_container)
+	{ }
+
+	void
+        operator()(std::size_t resolution)
+	{
+	  enum
+	    {
+	      support_detected =
+	      pb_ds::test::detail::tree_supports_order_statistics<
+	      Cntnr>::value
+	    };
+
+	  PB_DS_STATIC_ASSERT(correct_type, support_detected);
+
+	  for (std::size_t i = 0; i < resolution; ++i)
+	    {
+	      typename Cntnr::const_iterator it = m_r_container.begin();
+
+	      typename Cntnr::const_iterator e = m_r_container.end();
+
+	      const size_t max_size = m_r_container.size();
+
+	      while (it != e)
+		if (m_r_container.order_of_key(*(it++)) > max_size)
+		  abort();
+	    }
+	}
+
+      private:
+	Cntnr& m_r_container;
+      };
+
+      template<typename Cntnr>
+      class order_statistics_functor<
+	Cntnr,
+	false>
+      {
+      public:
+        order_statistics_functor(Cntnr& r_container) : m_r_container(r_container)
+	{ }
+
+	void
+        operator()(std::size_t resolution)
+	{
+	  for (std::size_t i = 0; i < resolution; ++i)
+	    {
+	      typename Cntnr::const_iterator b = m_r_container.begin();
+
+	      typename Cntnr::const_iterator e = m_r_container.end();
+
+	      typename Cntnr::const_iterator it = b;
+
+	      const size_t max_size = m_r_container.size();
+
+	      while (it != e)
+		{
+		  typename Cntnr::const_iterator f_it = m_r_container.find(*(it++));
+
+		  if (static_cast<size_t>(std::distance(b, f_it)) > max_size)
+		    abort();
+		}
+	    }
+	}
+
+      private:
+	Cntnr& m_r_container;
+      };
+
+    } // namespace detail
+
+#define PB_DS_CLASS_T_DEC			\
+    template<bool Support_Order_Statistics>
+
+#define PB_DS_CLASS_C_DEC						\
+    tree_order_statistics_test<						\
+								Support_Order_Statistics>
+
+    template<bool Support_Order_Statistics>
+    class tree_order_statistics_test : private pb_ds::test::detail::timing_test_base
+    {
+    public:
+      tree_order_statistics_test(size_t vn, size_t vs, size_t vm);
+
+      template<typename Cntnr>
+      void
+      operator()(pb_ds::detail::type_to_type<Cntnr>);
+
+    private:
+      tree_order_statistics_test(const tree_order_statistics_test& );
+
+      template<typename Cntnr>
+      void
+      order_statistics(Cntnr& r_container, pb_ds::detail::true_type);
+
+      template<typename Cntnr>
+      void
+      order_statistics(Cntnr& r_container, pb_ds::detail::false_type);
+
+    private:
+      const size_t m_vn;
+      const size_t m_vs;
+      const size_t m_vm;
+    };
+
+    PB_DS_CLASS_T_DEC
+    PB_DS_CLASS_C_DEC::
+    tree_order_statistics_test(size_t vn, size_t vs, size_t vm) :
+      m_vn(vn),
+      m_vs(vs),
+      m_vm(vm)
+    { }
+
+    PB_DS_CLASS_T_DEC
+    template<typename Cntnr>
+    void
+    PB_DS_CLASS_C_DEC::
+    operator()(pb_ds::detail::type_to_type<Cntnr>)
+    {
+      xml_result_set_performance_formatter res_set_fmt(
+						       string_form<Cntnr>::name(),
+						       string_form<Cntnr>::desc());
+
+      for (size_t v = m_vn; v < m_vm; v += m_vs)
+	{
+	  Cntnr cntnr;
+
+	  for (size_t ins = 0; ins < v; ++ ins)
+            cntnr.insert((typename Cntnr::value_type)ins);
+
+	  pb_ds::test::detail::order_statistics_functor<Cntnr, Support_Order_Statistics>
+            fn(cntnr);
+
+	  const double res =
+            pb_ds::test::detail::timing_test_base::operator()(fn);
+
+	  res_set_fmt.add_res(v, res / v);
+	}
+    }
+
+#undef PB_DS_CLASS_T_DEC
+
+#undef PB_DS_CLASS_C_DEC
+
+#undef PB_DS_STATIC_ASSERT
+
+  } // namespace test
+
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_TREE_ORDER_STATISTICS_TEST_HPP
+
diff --git a/libstdc++-v3/testsuite/util/performance/assoc/timing/tree_split_join_test.hpp b/libstdc++-v3/testsuite/util/performance/assoc/timing/tree_split_join_test.hpp
new file mode 100644
index 00000000000..18dd0af6c13
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/performance/assoc/timing/tree_split_join_test.hpp
@@ -0,0 +1,192 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file tree_split_join_test.hpp
+ * Contains a test for splitting and joining trees
+ */
+
+#ifndef PB_DS_TREE_SPLIT_JOIN_TEST_HPP
+#define PB_DS_TREE_SPLIT_JOIN_TEST_HPP
+
+#include <performance/time/timing_test_base.hpp>
+#include <performance/io/xml_formatter.hpp>
+#include <common_type/assoc/string_form.hpp>
+#include <iterator>
+
+namespace pb_ds
+{
+
+  namespace test
+  {
+
+    namespace detail
+    {
+
+      template<typename Cntnr, bool Support_Split_Join>
+      class split_join_functor
+      {
+      public:
+        split_join_functor(Cntnr& r_container) : m_r_container(r_container)
+	{ }
+
+	void
+        operator()(std::size_t resolution)
+	{
+	  for (std::size_t i = 0; i < resolution; ++i)
+	    {
+	      typename Cntnr::const_iterator mid_it = m_r_container.begin();
+	      std::advance(mid_it, m_r_container.size() / 2);
+
+	      Cntnr other;
+
+	      m_r_container.split(*mid_it, other);
+
+	      m_r_container.join(other);
+	    }
+	}
+
+      private:
+	Cntnr& m_r_container;
+      };
+
+      template<typename Cntnr>
+      class split_join_functor<
+	Cntnr,
+	false>
+      {
+      public:
+        split_join_functor(Cntnr& r_container) : m_r_container(r_container)
+	{ }
+
+	void
+        operator()(std::size_t resolution)
+	{
+	  for (std::size_t i = 0; i < resolution; ++i)
+	    {
+	      typename Cntnr::iterator mid_it = m_r_container.begin();
+	      std::advance(mid_it, m_r_container.size() / 2);
+
+	      Cntnr other(mid_it, m_r_container.end());
+	      m_r_container.erase(mid_it, m_r_container.end());
+
+	      m_r_container.insert(other.begin(), other.end());
+	      other.clear();
+	    }
+	}
+
+      private:
+	Cntnr& m_r_container;
+      };
+
+    } // namespace detail
+
+#define PB_DS_CLASS_T_DEC			\
+    template<bool Support_Split_Join>
+
+#define PB_DS_CLASS_C_DEC						\
+    tree_split_join_test<						\
+						Support_Split_Join>
+
+    template<bool Support_Split_Join>
+    class tree_split_join_test : private pb_ds::test::detail::timing_test_base
+    {
+    public:
+      tree_split_join_test(size_t vn, size_t vs, size_t vm);
+
+      template<typename Cntnr>
+      void
+      operator()(pb_ds::detail::type_to_type<Cntnr>);
+
+    private:
+      tree_split_join_test(const tree_split_join_test& );
+
+    private:
+      const size_t m_vn;
+      const size_t m_vs;
+      const size_t m_vm;
+    };
+
+    PB_DS_CLASS_T_DEC
+    PB_DS_CLASS_C_DEC::
+    tree_split_join_test(size_t vn, size_t vs, size_t vm) :
+      m_vn(vn),
+      m_vs(vs),
+      m_vm(vm)
+    { }
+
+    PB_DS_CLASS_T_DEC
+    template<typename Cntnr>
+    void
+    PB_DS_CLASS_C_DEC::
+    operator()(pb_ds::detail::type_to_type<Cntnr>)
+    {
+      xml_result_set_performance_formatter res_set_fmt(
+						       string_form<Cntnr>::name(),
+						       string_form<Cntnr>::desc());
+
+      for (size_t v = m_vn; v < m_vm; v += m_vs)
+	{
+	  Cntnr cntnr;
+
+	  for (size_t ins = 0; ins < v; ++ ins)
+            cntnr.insert((typename Cntnr::value_type)ins);
+
+	  pb_ds::test::detail::split_join_functor<Cntnr, Support_Split_Join>
+            fn(cntnr);
+
+	  const double res =
+            pb_ds::test::detail::timing_test_base::operator()(fn);
+
+	  res_set_fmt.add_res(v, res);
+	}
+    }
+
+#undef PB_DS_CLASS_T_DEC
+
+#undef PB_DS_CLASS_C_DEC
+
+  } // namespace test
+
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_TREE_SPLIT_JOIN_TEST_HPP
+
diff --git a/libstdc++-v3/testsuite/util/performance/io/xml_formatter.hpp b/libstdc++-v3/testsuite/util/performance/io/xml_formatter.hpp
new file mode 100644
index 00000000000..e7d48d7dc48
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/performance/io/xml_formatter.hpp
@@ -0,0 +1,88 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file xml_formatter.hpp
+ * Contains an XML formatter for performance tests.
+ */
+
+#ifndef PB_DS_XML_TEST_PERFORMANCE_FORMATTER_HPP
+#define PB_DS_XML_TEST_PERFORMANCE_FORMATTER_HPP
+
+#include <string>
+#include <iostream>
+#include <io/xml_test_formatter.hpp>
+
+namespace pb_ds
+{
+  namespace test
+  {
+    class xml_test_performance_formatter : public xml_test_formatter
+    {
+    public:
+      xml_test_performance_formatter(const std::string& r_x_name, const std::string& r_y_name)
+      {
+	std::cout << make_xml_tag("x_name", r_x_name);
+	std::cout << make_xml_tag("y_name", r_y_name);
+      }
+    };
+
+    class xml_result_set_performance_formatter : public xml_result_set_formatter
+    {
+    public:
+      xml_result_set_performance_formatter(const std::string& r_container_name, const std::string& r_container_desc)
+	:  xml_result_set_formatter(r_container_name, r_container_desc)
+      {
+	{ }
+      }
+
+      void
+      add_res(size_t x, double y)
+      {
+	const unsigned long ul = static_cast<unsigned long>(x);
+	const std::string res = make_xml_tag("result", "x", ul, "y", y);
+	std::cout << res;
+      }
+    };
+  } // namespace test
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_XML_TEST_PERFORMANCE_FORMATTER_HPP
diff --git a/libstdc++-v3/testsuite/util/performance/mem/mem_track_allocator.hpp b/libstdc++-v3/testsuite/util/performance/mem/mem_track_allocator.hpp
new file mode 100644
index 00000000000..d119e95c2cd
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/performance/mem/mem_track_allocator.hpp
@@ -0,0 +1,189 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file mem_track_allocator.hpp
+ * Contains a memory-tracking allocator used for tests.
+ */
+
+#ifndef PB_DS_MEM_TRACK_ALLOCATOR_HPP
+#define PB_DS_MEM_TRACK_ALLOCATOR_HPP
+
+#include <performance/mem/mem_track_allocator_base.hpp>
+
+namespace pb_ds
+{
+
+  namespace test
+  {
+
+#define PB_DS_CLASS_T_DEC			\
+    template<typename T>
+
+#define PB_DS_CLASS_C_DEC				\
+    mem_track_allocator<				\
+						T>
+
+    template<typename T>
+    class mem_track_allocator : public detail::mem_track_allocator_base
+    {
+    public:
+      typedef size_t size_type;
+      typedef ptrdiff_t difference_type;
+      typedef T* pointer;
+      typedef const T* const_pointer;
+      typedef T& reference;
+      typedef const T& const_reference;
+      typedef T value_type;
+
+      template<typename U>
+      struct rebind
+      {
+        typedef mem_track_allocator<U> other;
+      };
+
+      mem_track_allocator() throw();
+
+      mem_track_allocator(const PB_DS_CLASS_C_DEC& ) throw();
+
+      template <class U>
+      mem_track_allocator(const mem_track_allocator<U>& ) throw();
+
+      ~mem_track_allocator() throw();
+
+      size_type
+      max_size() const throw();
+
+      pointer
+      allocate(size_type num, std::allocator<void>::const_pointer hint = 0);
+
+      void
+      construct(pointer p, const T& r_val);
+
+      void
+      destroy(pointer p);
+
+      void
+      deallocate(pointer p, size_type num);
+    };
+
+    PB_DS_CLASS_T_DEC
+    bool
+    operator==(const PB_DS_CLASS_C_DEC& , const PB_DS_CLASS_C_DEC& )
+    {
+      return true;
+    }
+
+    PB_DS_CLASS_T_DEC
+    PB_DS_CLASS_C_DEC::
+    mem_track_allocator() throw()
+    { }
+
+    PB_DS_CLASS_T_DEC
+    PB_DS_CLASS_C_DEC::
+    mem_track_allocator(const PB_DS_CLASS_C_DEC& ) throw()
+    { }
+
+    PB_DS_CLASS_T_DEC
+    template<typename U>
+    PB_DS_CLASS_C_DEC::
+    mem_track_allocator(const mem_track_allocator<U>& ) throw()
+    { }
+
+    PB_DS_CLASS_T_DEC
+    PB_DS_CLASS_C_DEC::
+    ~mem_track_allocator() throw()
+    { }
+
+    PB_DS_CLASS_T_DEC
+    typename PB_DS_CLASS_C_DEC::size_type
+    PB_DS_CLASS_C_DEC::
+    max_size() const throw()
+    {
+      return (std::allocator<T>().max_size());
+    }
+
+    PB_DS_CLASS_T_DEC
+    typename PB_DS_CLASS_C_DEC::pointer
+    PB_DS_CLASS_C_DEC::
+    allocate(size_type num, std::allocator<void>::const_pointer hint/*= 0*/)
+    {
+      T* const a_t = std::allocator<T>().allocate(num, hint);
+
+      inc(sizeof(T)*  num);
+
+      return (a_t);
+    }
+
+    PB_DS_CLASS_T_DEC
+    void
+    PB_DS_CLASS_C_DEC::
+    construct(pointer p, const T& r_val)
+    {
+      return (std::allocator<T>().construct(p, r_val));
+    }
+
+    PB_DS_CLASS_T_DEC
+    void
+    PB_DS_CLASS_C_DEC::
+    destroy(pointer p)
+    {
+      std::allocator<T>().destroy(p);
+    }
+
+    PB_DS_CLASS_T_DEC
+    void
+    PB_DS_CLASS_C_DEC::
+    deallocate(pointer p, size_type num)
+    {
+      std::allocator<T>().deallocate(p, num);
+
+      dec(sizeof(T)*  num);
+    }
+
+#undef PB_DS_CLASS_T_DEC
+#undef PB_DS_CLASS_C_DEC
+
+  } // namespace test
+
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_MEM_TRACK_ALLOCATOR_HPP
diff --git a/libstdc++-v3/testsuite/util/performance/mem/mem_track_allocator_base.hpp b/libstdc++-v3/testsuite/util/performance/mem/mem_track_allocator_base.hpp
new file mode 100644
index 00000000000..97d831a755e
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/performance/mem/mem_track_allocator_base.hpp
@@ -0,0 +1,116 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file mem_track_allocator_base.hpp
+ * Contains a base for a memory-tracking allocator used for tests.
+ */
+
+#ifndef PB_DS_MEM_TRACK_ALLOCATOR_BASE_HPP
+#define PB_DS_MEM_TRACK_ALLOCATOR_BASE_HPP
+
+#include <cassert>
+
+namespace pb_ds
+{
+
+  namespace test
+  {
+
+    namespace detail
+    {
+
+      struct total_holder
+      {
+        total_holder() : m_total(0)
+	{ }
+
+	size_t m_total;
+      };
+
+      class mem_track_allocator_base
+      {
+      public:
+	static void
+        inc(size_t size);
+
+	static void
+        dec(size_t size);
+
+	static size_t
+        get_total();
+
+      private:
+	static total_holder s_total_holder;
+      };
+
+      total_holder mem_track_allocator_base::s_total_holder;
+
+      void
+      mem_track_allocator_base::
+      inc(size_t size)
+      {
+	s_total_holder.m_total += size;
+      }
+
+      void
+      mem_track_allocator_base::
+      dec(size_t size)
+      {
+	assert(s_total_holder.m_total >= size);
+
+	s_total_holder.m_total -= size;
+      }
+
+      size_t
+      mem_track_allocator_base::
+      get_total()
+      {
+	return (s_total_holder.m_total);
+      }
+
+    } // namespace detail
+
+  } // namespace test
+
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_MEM_TRACK_ALLOCATOR_BASE_HPP
diff --git a/libstdc++-v3/testsuite/util/performance/priority_queue/mem_usage/pop_test.hpp b/libstdc++-v3/testsuite/util/performance/priority_queue/mem_usage/pop_test.hpp
new file mode 100644
index 00000000000..85e234c9b68
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/performance/priority_queue/mem_usage/pop_test.hpp
@@ -0,0 +1,148 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file pop_test.hpp
+ * Contains a generic pop test.
+ */
+
+#ifndef PB_DS_POP_TEST_HPP
+#define PB_DS_POP_TEST_HPP
+
+#include <ext/pb_ds/detail/type_utils.hpp>
+#include <performance/mem/mem_track_allocator.hpp>
+#include <performance/io/xml_formatter.hpp>
+#include <common_type/priority_queue/string_form.hpp>
+#include <iterator>
+
+namespace pb_ds
+{
+
+  namespace test
+  {
+
+#define PB_DS_CLASS_T_DEC			\
+    template<typename It>
+
+#define PB_DS_CLASS_C_DEC				\
+    pop_test<						\
+						It>
+
+    template<typename It>
+    class pop_test
+    {
+    public:
+      pop_test(It ins_b, size_t ins_vn, size_t ins_vs, size_t ins_vm);
+
+      template<typename Cntnr>
+      void
+      operator()(pb_ds::detail::type_to_type<Cntnr>);
+
+    private:
+      pop_test(const pop_test& );
+
+    private:
+      const It m_ins_b;
+
+      const size_t m_ins_vn;
+      const size_t m_ins_vs;
+      const size_t m_ins_vm;
+    };
+
+    PB_DS_CLASS_T_DEC
+    PB_DS_CLASS_C_DEC::
+    pop_test(It ins_b, size_t ins_vn, size_t ins_vs, size_t ins_vm) :
+      m_ins_b(ins_b),
+      m_ins_vn(ins_vn),
+      m_ins_vs(ins_vs),
+      m_ins_vm(ins_vm)
+    { }
+
+    PB_DS_CLASS_T_DEC
+    template<typename Cntnr>
+    void
+    PB_DS_CLASS_C_DEC::
+    operator()(pb_ds::detail::type_to_type<Cntnr>)
+    {
+      xml_result_set_performance_formatter res_set_fmt(
+						       string_form<Cntnr>::name(),
+						       string_form<Cntnr>::desc());
+
+      for (size_t size_i = 0; m_ins_vn + size_i*  m_ins_vs < m_ins_vm; ++size_i)
+	{
+	  const size_t ins_size = m_ins_vn + size_i*  m_ins_vs;
+
+	  It ins_it_b = m_ins_b;
+	  It ins_it_e = m_ins_b;
+	  std::advance(ins_it_e, ins_size);
+
+	  mem_track_allocator<char> alloc;
+
+	  const size_t init_mem = alloc.get_total();
+
+	  Cntnr cntnr;
+
+	  for (It ins_it =    ins_it_b; ins_it != ins_it_e; ++ins_it)
+            cntnr.push(ins_it->first);
+
+	  while (cntnr.size() > 1)
+            cntnr.pop();
+
+	  const size_t final_mem = alloc.get_total();
+
+	  assert(final_mem > init_mem);
+
+	  const size_t delta_mem = final_mem - init_mem;
+
+	  res_set_fmt.add_res(ins_size, static_cast<double>(delta_mem));
+	}
+    }
+
+#undef PB_DS_CLASS_T_DEC
+
+#undef PB_DS_CLASS_C_DEC
+
+  } // namespace test
+
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_POP_TEST_HPP
+
diff --git a/libstdc++-v3/testsuite/util/performance/priority_queue/timing/join_test.hpp b/libstdc++-v3/testsuite/util/performance/priority_queue/timing/join_test.hpp
new file mode 100644
index 00000000000..ffa1187dde4
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/performance/priority_queue/timing/join_test.hpp
@@ -0,0 +1,174 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file join_test.hpp
+ * Contains a join performance test.
+ */
+
+#ifndef PB_DS_JOIN_TEST_HPP
+#define PB_DS_JOIN_TEST_HPP
+
+#include <performance/time/timing_test_base.hpp>
+#include <ext/pb_ds/detail/type_utils.hpp>
+#include <performance/io/xml_formatter.hpp>
+#include <common_type/priority_queue/string_form.hpp>
+#include <iterator>
+
+namespace pb_ds
+{
+  namespace test
+  {
+    namespace detail
+    {
+      template<typename It, typename Cntnr>
+      class double_push_functor
+      {
+	const It _M_begin;
+	const It _M_end;
+
+      public:
+        double_push_functor(It b,  It e) : _M_begin(b), _M_end(e) { }
+
+	void
+        operator()(std::size_t resolution)
+	{
+	  typedef typename Cntnr::const_reference const_reference;
+	  for (std::size_t n = 0; n < resolution; ++n)
+	    {
+	      Cntnr c0;
+	      Cntnr c1;
+	      for (It it = _M_begin; it != _M_end; ++it)
+		{
+		  c0.push(const_reference(it->first));
+		  c1.push(const_reference(it->first));
+		}
+	    }
+	}
+      };
+
+      template<typename It, typename Cntnr>
+      class double_push_join_functor
+      {
+	const It _M_begin;
+	const It _M_end;
+
+      public:
+        double_push_join_functor(It b,  It e) : _M_begin(b), _M_end(e) { }
+
+	void
+        operator()(std::size_t resolution)
+	{
+	  typedef typename Cntnr::const_reference const_reference;
+	  for (std::size_t n = 0; n < resolution; ++n)
+	    {
+	      Cntnr c0;
+	      Cntnr c1;
+	      for (It it = _M_begin; it != _M_end; ++it)
+		{
+		  c0.push(const_reference(it->first));
+		  c1.push(const_reference(it->first));
+		}
+	      c0.join(c1);
+	    }
+	}
+      };
+    } // namespace detail
+
+    template<typename It>
+    class join_test : private pb_ds::test::detail::timing_test_base
+    {
+      const It 		m_ins_b;
+      const size_t 	m_ins_vn;
+      const size_t 	m_ins_vs;
+      const size_t 	m_ins_vm;
+
+    public:
+      join_test(It ins_b, size_t ins_vn, size_t ins_vs, size_t ins_vm)
+	: m_ins_b(ins_b), m_ins_vn(ins_vn), m_ins_vs(ins_vs), m_ins_vm(ins_vm)
+      { }
+
+      template<typename Cntnr>
+      void
+      operator()(pb_ds::detail::type_to_type<Cntnr>)
+      {
+	using pb_ds::test::detail::double_push_functor;
+	using pb_ds::test::detail::double_push_join_functor;
+	typedef pb_ds::test::detail::timing_test_base base_type;
+	typedef xml_result_set_performance_formatter result_type;
+	result_type res(string_form<Cntnr>::name(), string_form<Cntnr>::desc());
+	  
+	for (size_t n = 0; m_ins_vn + n*  m_ins_vs < m_ins_vm; ++n)
+	  {
+	    const size_t v = m_ins_vn + n *  m_ins_vs;
+	    It b = m_ins_b;
+	    It e = m_ins_b;
+	    std::advance(e, v);
+
+	    double_push_functor<It, Cntnr> double_push_fn(b, e);
+	    const double double_push_res = base_type::operator()(double_push_fn);
+	    double_push_join_functor<It, Cntnr> double_push_join_fn(b, e);
+	    const double double_push_join_res = base_type::operator()(double_push_join_fn);
+	      
+	    const double effective_delta = std::max(double_push_join_res - double_push_res,
+						    base_type::min_time_res());
+	    res.add_res(v, effective_delta / v);
+	  }
+      }
+
+    private:
+      join_test(const join_test&);
+
+      template<typename Cntnr>
+      void
+      join(pb_ds::detail::type_to_type<Cntnr>, It b, It e)
+      {
+	Cntnr cntnr;
+	typedef typename Cntnr::const_reference const_reference;
+	for (It it = b; it != e; ++it)
+	  cntnr.join(const_reference(*it));
+      }
+    };
+  } // namespace test
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_JOIN_TEST_HPP
+
diff --git a/libstdc++-v3/testsuite/util/performance/priority_queue/timing/modify_test.hpp b/libstdc++-v3/testsuite/util/performance/priority_queue/timing/modify_test.hpp
new file mode 100644
index 00000000000..8694f995769
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/performance/priority_queue/timing/modify_test.hpp
@@ -0,0 +1,387 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file modify_test.hpp
+ * Contains a modify performance test.
+ */
+
+#ifndef PB_DS_JOIN_TEST_HPP
+#define PB_DS_JOIN_TEST_HPP
+
+#include <performance/time/timing_test_base.hpp>
+#include <ext/pb_ds/detail/type_utils.hpp>
+#include <performance/io/xml_formatter.hpp>
+#include <common_type/priority_queue/string_form.hpp>
+#include <iterator>
+
+namespace pb_ds
+{
+
+  namespace test
+  {
+
+    namespace detail
+    {
+
+      template<typename It, class Cntnr, class Tag>
+      class push_functor
+      {
+      public:
+        push_functor(It ins_it_b,  It ins_it_e) : m_ins_it_b(ins_it_b),
+						  m_ins_it_e(ins_it_e)
+	{ }
+
+	void
+        operator()(std::size_t resolution)
+	{
+	  for (std::size_t i = 0; i < resolution; ++i)
+	    {
+	      Cntnr c;
+
+	      typedef std::vector< typename Cntnr::point_iterator> it_vec_t;
+
+	      it_vec_t m_a_its;
+
+	      for (It ins_it = m_ins_it_b; ins_it != m_ins_it_e; ++ins_it)
+                m_a_its.push_back(c.push((typename Cntnr::const_reference)(ins_it->first)));
+	    }
+	}
+
+      private:
+	const It m_ins_it_b;
+	const It m_ins_it_e;
+      };
+
+      template<typename It, class Cntnr, class Tag>
+      class push_modify_functor
+      {
+      public:
+        push_modify_functor(It ins_it_b,  It ins_it_e,  typename Cntnr::value_type mod_val) : m_ins_it_b(ins_it_b),
+											      m_ins_it_e(ins_it_e),
+											      m_mod_val(mod_val)
+	{ }
+
+	void
+        operator()(std::size_t resolution)
+	{
+	  for (std::size_t i = 0; i < resolution; ++i)
+	    {
+	      Cntnr c;
+
+	      typedef std::vector< typename Cntnr::point_iterator> it_vec_t;
+
+	      it_vec_t m_a_its;
+
+	      for (It ins_it = m_ins_it_b; ins_it != m_ins_it_e; ++ins_it)
+                m_a_its.push_back(c.push((typename Cntnr::const_reference)(ins_it->first)));
+
+	      typename it_vec_t::iterator mod_it = m_a_its.begin();
+
+	      while (mod_it != m_a_its.end())
+                c.modify(*mod_it++, m_mod_val);
+	    }
+	}
+
+      private:
+	const It m_ins_it_b;
+	const It m_ins_it_e;
+
+	const typename Cntnr::value_type m_mod_val;
+      };
+
+      template<typename It, class Cntnr>
+      class push_functor<
+	It,
+	Cntnr,
+	pb_ds::binary_heap_tag>
+      {
+      public:
+        push_functor(It ins_it_b,  It ins_it_e) : m_ins_it_b(ins_it_b),
+						  m_ins_it_e(ins_it_e)
+	{ }
+
+	void
+        operator()(std::size_t resolution)
+	{
+	  for (std::size_t i = 0; i < resolution; ++i)
+	    {
+	      Cntnr c;
+
+	      for (It ins_it = m_ins_it_b; ins_it != m_ins_it_e; ++ins_it)
+                c.push((typename Cntnr::const_reference)(ins_it->first));
+	    }
+	}
+
+      private:
+	const It m_ins_it_b;
+	const It m_ins_it_e;
+      };
+
+      template<typename It, class Cntnr>
+      class push_modify_functor<
+	It,
+	Cntnr,
+	pb_ds::binary_heap_tag>
+      {
+      public:
+        push_modify_functor(It ins_it_b,  It ins_it_e,  typename Cntnr::value_type mod_val) : m_ins_it_b(ins_it_b),
+											      m_ins_it_e(ins_it_e),
+											      m_mod_val(mod_val)
+	{ }
+
+	void
+        operator()(std::size_t resolution)
+	{
+	  for (std::size_t i = 0; i < resolution; ++i)
+	    {
+	      Cntnr c;
+
+	      It ins_it;
+
+	      for (ins_it = m_ins_it_b; ins_it != m_ins_it_e; ++ins_it)
+                c.push((typename Cntnr::const_reference)(ins_it->first));
+
+	      for (ins_it = m_ins_it_b; ins_it != m_ins_it_e; ++ins_it)
+		{
+		  bool modified = false;
+
+		  for (typename Cntnr::iterator it = c.begin(); !modified&&  it != c.end(); ++it)
+                    if (*it == ins_it->first)
+		      {
+                        c.modify(it, m_mod_val);
+
+                        modified = true;
+		      }
+		}
+	    }
+	}
+
+      private:
+	const It m_ins_it_b;
+	const It m_ins_it_e;
+
+	const typename Cntnr::value_type m_mod_val;
+      };
+
+      template<typename It, class Cntnr>
+      class push_functor<
+	It,
+	Cntnr,
+	pb_ds::test::native_pq_tag>
+      {
+      public:
+        push_functor(It ins_it_b,  It ins_it_e) : m_ins_it_b(ins_it_b),
+						  m_ins_it_e(ins_it_e)
+	{ }
+
+	void
+        operator()(std::size_t resolution)
+	{
+	  for (std::size_t i = 0; i < resolution; ++i)
+	    {
+	      Cntnr c;
+
+	      for (It ins_it = m_ins_it_b; ins_it != m_ins_it_e; ++ins_it)
+                c.push((typename Cntnr::const_reference)(ins_it->first));
+	    }
+	}
+
+      private:
+	const It m_ins_it_b;
+	const It m_ins_it_e;
+      };
+
+      template<typename It, class Cntnr>
+      class push_modify_functor<
+	It,
+	Cntnr,
+	pb_ds::test::native_pq_tag>
+      {
+      public:
+        push_modify_functor(It ins_it_b,  It ins_it_e,  typename Cntnr::value_type mod_val) : m_ins_it_b(ins_it_b),
+											      m_ins_it_e(ins_it_e),
+											      m_mod_val(mod_val)
+	{ }
+
+	void
+        operator()(std::size_t resolution)
+	{
+	  for (std::size_t i = 0; i < resolution; ++i)
+	    {
+	      Cntnr c;
+
+	      It ins_it;
+
+	      for (ins_it = m_ins_it_b; ins_it != m_ins_it_e; ++ins_it)
+                c.push((typename Cntnr::const_reference)(ins_it->first));
+
+	      for (ins_it = m_ins_it_b; ins_it != m_ins_it_e; ++ins_it)
+                c.modify(ins_it->first, m_mod_val);
+	    }
+	}
+
+      private:
+	const It m_ins_it_b;
+	const It m_ins_it_e;
+
+	const typename Cntnr::value_type m_mod_val;
+      };
+
+    } // namespace detail
+
+#define PB_DS_CLASS_T_DEC			\
+    template<typename It>
+
+#define PB_DS_CLASS_C_DEC				\
+    modify_test<					\
+						It>
+
+    template<typename It>
+    class modify_test : private pb_ds::test::detail::timing_test_base
+    {
+    public:
+      modify_test(It ins_b, size_t ins_vn, size_t ins_vs, size_t ins_vm, bool m_modify_up);
+
+      template<typename Cntnr>
+      void
+      operator()(pb_ds::detail::type_to_type<Cntnr>);
+
+    private:
+      modify_test(const modify_test& );
+
+      template<typename Cntnr>
+      void
+      modify(pb_ds::detail::type_to_type<Cntnr>, It ins_it_b, It ins_it_e);
+
+    private:
+      const It m_ins_b;
+
+      const size_t m_ins_vn;
+      const size_t m_ins_vs;
+      const size_t m_ins_vm;
+
+      const bool m_modify_up;
+    };
+
+    PB_DS_CLASS_T_DEC
+    PB_DS_CLASS_C_DEC::
+    modify_test(It ins_b, size_t ins_vn, size_t ins_vs, size_t ins_vm, bool modify_up) :
+      m_ins_b(ins_b),
+      m_ins_vn(ins_vn),
+      m_ins_vs(ins_vs),
+      m_ins_vm(ins_vm),
+      m_modify_up(modify_up)
+    { }
+
+    PB_DS_CLASS_T_DEC
+    template<typename Cntnr>
+    void
+    PB_DS_CLASS_C_DEC::
+    operator()(pb_ds::detail::type_to_type<Cntnr>)
+    {
+      xml_result_set_performance_formatter res_set_fmt(
+						       string_form<Cntnr>::name(),
+						       string_form<Cntnr>::desc());
+
+      for (size_t size_i = 0; m_ins_vn + size_i*  m_ins_vs < m_ins_vm; ++size_i)
+	{
+	  const size_t v = m_ins_vn + size_i*  m_ins_vs;
+
+	  It ins_it_b = m_ins_b;
+	  It ins_it_e = m_ins_b;
+	  std::advance(ins_it_e, v);
+
+	  pb_ds::test::detail::push_functor<It, Cntnr, typename Cntnr::container_category>
+            push_fn(ins_it_b, ins_it_e);
+
+	  const double push_res =
+            pb_ds::test::detail::timing_test_base::operator()(push_fn);
+
+	  typename Cntnr::value_type mod_val = ins_it_b->first;
+
+	  {
+            Cntnr mod_val_container;
+            for (It mod_val_it = ins_it_b; mod_val_it != ins_it_e; ++mod_val_it)
+	      {
+                typename Cntnr::value_type pot = mod_val_it->first;
+
+                if (m_modify_up == mod_val_container.get_cmp_fn()(mod_val, pot))
+		  mod_val = pot;
+	      }
+	  }
+
+	  pb_ds::test::detail::push_modify_functor<It, Cntnr, typename Cntnr::container_category>
+            push_modify_fn(ins_it_b, ins_it_e, mod_val);
+
+	  const double push_modify_res =
+            pb_ds::test::detail::timing_test_base::operator()(push_modify_fn);
+
+	  const double effective_delta = std::max(
+						  push_modify_res - push_res,
+						  pb_ds::test::detail::timing_test_base::min_time_res());
+
+	  res_set_fmt.add_res(v, effective_delta / v);
+	}
+    }
+
+    PB_DS_CLASS_T_DEC
+    template<typename Cntnr>
+    void
+    PB_DS_CLASS_C_DEC::
+    modify(pb_ds::detail::type_to_type<Cntnr>, It ins_it_b, It ins_it_e)
+    {
+      Cntnr cntnr;
+
+      for (It ins_it = ins_it_b; ins_it != ins_it_e; ++ins_it)
+        cntnr.modify((typename Cntnr::const_reference)(*ins_it));
+    }
+
+#undef PB_DS_CLASS_T_DEC
+
+#undef PB_DS_CLASS_C_DEC
+
+  } // namespace test
+
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_JOIN_TEST_HPP
+
diff --git a/libstdc++-v3/testsuite/util/performance/priority_queue/timing/push_pop_test.hpp b/libstdc++-v3/testsuite/util/performance/priority_queue/timing/push_pop_test.hpp
new file mode 100644
index 00000000000..779ee672926
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/performance/priority_queue/timing/push_pop_test.hpp
@@ -0,0 +1,185 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file push_pop_test.hpp
+ * Contains a push performance test.
+ */
+
+#ifndef PB_DS_PUSH_TEST_HPP
+#define PB_DS_PUSH_TEST_HPP
+
+#include <performance/time/timing_test_base.hpp>
+#include <ext/pb_ds/detail/type_utils.hpp>
+#include <performance/io/xml_formatter.hpp>
+#include <common_type/priority_queue/string_form.hpp>
+#include <iterator>
+
+namespace pb_ds
+{
+
+  namespace test
+  {
+
+    namespace detail
+    {
+
+      template<typename It, class Cntnr>
+      class push_pop_push_pop_functor
+      {
+      public:
+        push_pop_push_pop_functor(It ins_it_b,  It ins_it_e) : m_ins_it_b(ins_it_b),
+							       m_ins_it_e(ins_it_e)
+	{ }
+
+	void
+        operator()(std::size_t resolution)
+	{
+	  for (std::size_t i = 0; i < resolution; ++i)
+	    {
+	      Cntnr cntnr;
+
+	      for (It ins_it = m_ins_it_b; ins_it != m_ins_it_e; ++ins_it)
+                cntnr.push((typename Cntnr::const_reference)(ins_it->first));
+
+	      while (!cntnr.empty())
+                cntnr.pop();
+	    }
+	}
+
+      private:
+	const It m_ins_it_b;
+	const It m_ins_it_e;
+      };
+
+    } // namespace detail
+
+#define PB_DS_CLASS_T_DEC			\
+    template<typename It>
+
+#define PB_DS_CLASS_C_DEC				\
+    push_pop_test<					\
+						It>
+
+    template<typename It>
+    class push_pop_test : private pb_ds::test::detail::timing_test_base
+    {
+    public:
+      push_pop_test(It ins_b, size_t ins_vn, size_t ins_vs, size_t ins_vm);
+
+      template<typename Cntnr>
+      void
+      operator()(pb_ds::detail::type_to_type<Cntnr>);
+
+    private:
+      push_pop_test(const push_pop_test& );
+
+      template<typename Cntnr>
+      void
+      push(pb_ds::detail::type_to_type<Cntnr>, It ins_it_b, It ins_it_e);
+
+    private:
+      const It m_ins_b;
+
+      const size_t m_ins_vn;
+      const size_t m_ins_vs;
+      const size_t m_ins_vm;
+    };
+
+    PB_DS_CLASS_T_DEC
+    PB_DS_CLASS_C_DEC::
+    push_pop_test(It ins_b, size_t ins_vn, size_t ins_vs, size_t ins_vm) :
+      m_ins_b(ins_b),
+      m_ins_vn(ins_vn),
+      m_ins_vs(ins_vs),
+      m_ins_vm(ins_vm)
+    { }
+
+    PB_DS_CLASS_T_DEC
+    template<typename Cntnr>
+    void
+    PB_DS_CLASS_C_DEC::
+    operator()(pb_ds::detail::type_to_type<Cntnr>)
+    {
+      xml_result_set_performance_formatter res_set_fmt(
+						       string_form<Cntnr>::name(),
+						       string_form<Cntnr>::desc());
+
+      for (size_t size_i = 0; m_ins_vn + size_i*  m_ins_vs < m_ins_vm; ++size_i)
+	{
+	  const size_t v = m_ins_vn + size_i*  m_ins_vs;
+
+	  It ins_it_b = m_ins_b;
+	  It ins_it_e = m_ins_b;
+	  std::advance(ins_it_e, v);
+
+	  pb_ds::test::detail::push_pop_push_pop_functor<It, Cntnr>
+            fn(ins_it_b, ins_it_e);
+
+	  const double res =
+            pb_ds::test::detail::timing_test_base::operator()(fn);
+
+	  res_set_fmt.add_res(v, res / v);
+	}
+    }
+
+    PB_DS_CLASS_T_DEC
+    template<typename Cntnr>
+    void
+    PB_DS_CLASS_C_DEC::
+    push(pb_ds::detail::type_to_type<Cntnr>, It ins_it_b, It ins_it_e)
+    {
+      Cntnr cntnr;
+
+      for (It ins_it = ins_it_b; ins_it != ins_it_e; ++ins_it)
+        cntnr.push((typename Cntnr::const_reference)(*ins_it));
+    }
+
+#undef PB_DS_CLASS_T_DEC
+
+#undef PB_DS_CLASS_C_DEC
+
+  } // namespace test
+
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_PUSH_TEST_HPP
+
diff --git a/libstdc++-v3/testsuite/util/performance/priority_queue/timing/push_test.hpp b/libstdc++-v3/testsuite/util/performance/priority_queue/timing/push_test.hpp
new file mode 100644
index 00000000000..29dcd7740ce
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/performance/priority_queue/timing/push_test.hpp
@@ -0,0 +1,182 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file push_test.hpp
+ * Contains a push performance test.
+ */
+
+#ifndef PB_DS_PUSH_TEST_HPP
+#define PB_DS_PUSH_TEST_HPP
+
+#include <performance/time/timing_test_base.hpp>
+#include <ext/pb_ds/detail/type_utils.hpp>
+#include <performance/io/xml_formatter.hpp>
+#include <common_type/priority_queue/string_form.hpp>
+#include <iterator>
+
+namespace pb_ds
+{
+
+  namespace test
+  {
+
+    namespace detail
+    {
+
+      template<typename It, class Cntnr>
+      class push_push_functor
+      {
+      public:
+        push_push_functor(It ins_it_b,  It ins_it_e) : m_ins_it_b(ins_it_b),
+						       m_ins_it_e(ins_it_e)
+	{ }
+
+	void
+        operator()(std::size_t resolution)
+	{
+	  for (std::size_t i = 0; i < resolution; ++i)
+	    {
+	      Cntnr cntnr;
+
+	      for (It ins_it = m_ins_it_b; ins_it != m_ins_it_e; ++ins_it)
+                cntnr.push((typename Cntnr::const_reference)(ins_it->first));
+	    }
+	}
+
+      private:
+	const It m_ins_it_b;
+	const It m_ins_it_e;
+      };
+
+    } // namespace detail
+
+#define PB_DS_CLASS_T_DEC			\
+    template<typename It>
+
+#define PB_DS_CLASS_C_DEC				\
+    push_test<						\
+						It>
+
+    template<typename It>
+    class push_test : private pb_ds::test::detail::timing_test_base
+    {
+    public:
+      push_test(It ins_b, size_t ins_vn, size_t ins_vs, size_t ins_vm);
+
+      template<typename Cntnr>
+      void
+      operator()(pb_ds::detail::type_to_type<Cntnr>);
+
+    private:
+      push_test(const push_test& );
+
+      template<typename Cntnr>
+      void
+      push(pb_ds::detail::type_to_type<Cntnr>, It ins_it_b, It ins_it_e);
+
+    private:
+      const It m_ins_b;
+
+      const size_t m_ins_vn;
+      const size_t m_ins_vs;
+      const size_t m_ins_vm;
+    };
+
+    PB_DS_CLASS_T_DEC
+    PB_DS_CLASS_C_DEC::
+    push_test(It ins_b, size_t ins_vn, size_t ins_vs, size_t ins_vm) :
+      m_ins_b(ins_b),
+      m_ins_vn(ins_vn),
+      m_ins_vs(ins_vs),
+      m_ins_vm(ins_vm)
+    { }
+
+    PB_DS_CLASS_T_DEC
+    template<typename Cntnr>
+    void
+    PB_DS_CLASS_C_DEC::
+    operator()(pb_ds::detail::type_to_type<Cntnr>)
+    {
+      xml_result_set_performance_formatter res_set_fmt(
+						       string_form<Cntnr>::name(),
+						       string_form<Cntnr>::desc());
+
+      for (size_t size_i = 0; m_ins_vn + size_i*  m_ins_vs < m_ins_vm; ++size_i)
+	{
+	  const size_t v = m_ins_vn + size_i*  m_ins_vs;
+
+	  It ins_it_b = m_ins_b;
+	  It ins_it_e = m_ins_b;
+	  std::advance(ins_it_e, v);
+
+	  pb_ds::test::detail::push_push_functor<It, Cntnr>
+            fn(ins_it_b, ins_it_e);
+
+	  const double res =
+            pb_ds::test::detail::timing_test_base::operator()(fn);
+
+	  res_set_fmt.add_res(v, res / v);
+	}
+    }
+
+    PB_DS_CLASS_T_DEC
+    template<typename Cntnr>
+    void
+    PB_DS_CLASS_C_DEC::
+    push(pb_ds::detail::type_to_type<Cntnr>, It ins_it_b, It ins_it_e)
+    {
+      Cntnr cntnr;
+
+      for (It ins_it = ins_it_b; ins_it != ins_it_e; ++ins_it)
+        cntnr.push((typename Cntnr::const_reference)(*ins_it));
+    }
+
+#undef PB_DS_CLASS_T_DEC
+
+#undef PB_DS_CLASS_C_DEC
+
+  } // namespace test
+
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_PUSH_TEST_HPP
+
diff --git a/libstdc++-v3/testsuite/util/performance/time/elapsed_timer.cc b/libstdc++-v3/testsuite/util/performance/time/elapsed_timer.cc
new file mode 100644
index 00000000000..39748bf2d8d
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/performance/time/elapsed_timer.cc
@@ -0,0 +1,78 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file elapsed_timer.cpp
+ * Contains utilities for tests.
+ */
+
+#include <util/performance/time/elapsed_timer.hpp>
+
+namespace pb_ds
+{
+
+  namespace test
+  {
+
+    elapsed_timer::
+    elapsed_timer()
+    {
+      reset();
+    }
+
+    void
+    elapsed_timer::
+    reset()
+    {
+      m_start = ::clock();
+    }
+
+    elapsed_timer::
+    operator double() const
+    {
+      const clock_t now = ::clock();
+
+      return (((double)now - m_start) / CLOCKS_PER_SEC);
+    }
+
+  } // namespace test
+
+} // namespace pb_ds
diff --git a/libstdc++-v3/testsuite/util/performance/time/elapsed_timer.hpp b/libstdc++-v3/testsuite/util/performance/time/elapsed_timer.hpp
new file mode 100644
index 00000000000..06d9b307984
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/performance/time/elapsed_timer.hpp
@@ -0,0 +1,77 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file elapsed_timer.hpp
+ * Contains time utilities for tests.
+ */
+
+#ifndef PB_DS_TEST_TIME_HPP
+#define PB_DS_TEST_TIME_HPP
+
+#include <time.h>
+#include <iosfwd>
+
+namespace pb_ds
+{
+
+  namespace test
+  {
+
+    class elapsed_timer
+    {
+    public:
+      elapsed_timer();
+
+      void
+      reset();
+
+      operator double() const;
+
+    protected:
+      clock_t m_start;
+    };
+
+  } // namespace test
+
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_TEST_TIME_HPP
diff --git a/libstdc++-v3/testsuite/util/performance/time/timing_test_base.hpp b/libstdc++-v3/testsuite/util/performance/time/timing_test_base.hpp
new file mode 100644
index 00000000000..c9121fe3f48
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/performance/time/timing_test_base.hpp
@@ -0,0 +1,127 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file timing_test_base.hpp
+ * Contains a base class for timing tests.
+ */
+
+#ifndef PB_DS_TIMING_TEST_BASE_HPP
+#define PB_DS_TIMING_TEST_BASE_HPP
+
+#include <performance/time/elapsed_timer.hpp>
+#include <statistic/res_recorder.hpp>
+
+namespace pb_ds
+{
+  namespace test
+  {
+    namespace detail
+    {
+      class timing_test_base
+      {
+      protected:
+	template<typename Functor>
+	double
+	operator()(Functor& fn);
+
+	static double
+        min_time_res();
+
+      private:
+	template<typename Functor>
+	std::size_t
+	get_min_resolution(Functor&);
+
+	template<typename Functor>
+	double
+	run_at_resolution(Functor&, std::size_t);
+      };
+
+      template<typename Functor>
+      double
+      timing_test_base::operator()(Functor& fn)
+      {
+	const std::size_t resolution = get_min_resolution(fn);
+	pb_ds::test::detail::res_recorder<double> rec;
+	double res;
+	do
+	  res = run_at_resolution(fn, resolution);
+	while (rec.add_res(res) == false);
+	res = rec.sample_mean() / resolution;
+	return res;
+      }
+
+      double
+      timing_test_base::min_time_res()
+      { return 1e-7; }
+
+      template<typename Functor>
+      std::size_t
+      timing_test_base::get_min_resolution(Functor& fn)
+      {
+	std::size_t guess = 0;
+	const double epsilon_val = min_time_res();
+	double res;
+	do
+	  {
+	    guess = guess * 2 + 1;
+	    res = run_at_resolution(fn, guess);
+	  }
+	while (res < epsilon_val);
+	return guess;
+      }
+
+      template<typename Functor>
+      double
+      timing_test_base::run_at_resolution(Functor& fn, std::size_t resolution)
+      {
+	elapsed_timer res;
+	fn(resolution);
+	return res;
+      }
+
+    } // namespace detail
+  } // namespace test
+} // namespace pb_ds
+
+#endif 
+
diff --git a/libstdc++-v3/testsuite/util/regression/assoc/common_type.hpp b/libstdc++-v3/testsuite/util/regression/assoc/common_type.hpp
new file mode 100644
index 00000000000..bc89bd71789
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/regression/assoc/common_type.hpp
@@ -0,0 +1,261 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file common_type.hpp
+ * Contains types used for regression tests.
+ */
+
+#ifndef PB_DS_RAND_REGRESSION_TEST_COMMON_TYPE_HPP
+#define PB_DS_RAND_REGRESSION_TEST_COMMON_TYPE_HPP
+
+#include <regression/basic_type.hpp>
+#include <common_type/assoc/common_type.hpp>
+
+namespace pb_ds
+{
+
+  namespace test
+  {
+
+    typedef
+    pb_ds::test::dbg_ex_allocator<
+      pb_ds::test::basic_type>
+    alloc_type;
+
+    struct hash
+    {
+      typedef
+      alloc_type::rebind<
+	pb_ds::test::basic_type>::other::const_reference
+      const_key_reference;
+
+      size_t
+      operator()(const_key_reference r_key) const
+      {
+        size_t ret = 0;
+
+        for (pb_ds::test::basic_type::const_iterator it = r_key.begin(); it != r_key.end(); ++it)
+	  ret = ret*  5 +    static_cast<size_t>(*it);
+
+        return (ret);
+      }
+    };
+
+    typedef
+    pb_ds::string_trie_e_access_traits<
+      basic_type,
+      'a',
+      'a' + basic_type::distinct_chars - 1,
+      false,
+      alloc_type>
+    e_access_traits_t;
+
+    template<typename Data_Type>
+    struct tree_types
+    {
+    private:
+      typedef
+      typename pb_ds::test::tree_common_types<
+      pb_ds::test::basic_type,
+      Data_Type,
+      std::less<
+      pb_ds::test::basic_type>,
+      pb_ds::null_tree_node_update,
+      alloc_type>::regression_tl
+      no_order_statistics_tl_t;
+
+      typedef
+      typename pb_ds::test::tree_common_types<
+	pb_ds::test::basic_type,
+	Data_Type,
+	std::less<
+	pb_ds::test::basic_type>,
+	pb_ds::tree_order_statistics_node_update,
+	alloc_type>::regression_tl
+      order_statistics_tl_t;
+
+    public:
+
+      typedef
+      typename pb_ds::detail::typelist_append<
+      no_order_statistics_tl_t,
+      order_statistics_tl_t>::type
+      tl_t;
+
+      typedef no_order_statistics_tl_t min_tl_t;
+    };
+
+    template<typename Data_Type>
+    struct trie_types
+    {
+    private:
+      typedef
+      typename pb_ds::test::trie_common_types<
+      pb_ds::test::basic_type,
+      Data_Type,
+      e_access_traits_t,
+      pb_ds::pat_trie_tag,
+      pb_ds::null_trie_node_update,
+      alloc_type>::regression_tl
+      no_updates_tl_t;
+
+      typedef
+      typename pb_ds::test::trie_common_types<
+	pb_ds::test::basic_type,
+	Data_Type,
+	e_access_traits_t,
+	pb_ds::pat_trie_tag,
+	pb_ds::trie_order_statistics_node_update,
+	alloc_type>::regression_tl
+      order_statistics_tl_t;
+
+      typedef
+      typename pb_ds::test::trie_common_types<
+	pb_ds::test::basic_type,
+	Data_Type,
+	e_access_traits_t,
+	pb_ds::pat_trie_tag,
+	pb_ds::trie_prefix_search_node_update,
+	alloc_type>::regression_tl
+      prefix_search_tl_t;
+
+    public:
+      typedef
+      typename pb_ds::detail::typelist_append<
+      no_updates_tl_t,
+      typename pb_ds::detail::typelist_append<
+      prefix_search_tl_t,
+      order_statistics_tl_t>::type>::type
+      tl_t;
+
+      typedef no_updates_tl_t min_tl_t;
+    };
+
+    template<typename Data_Type>
+    struct hash_types
+    {
+      typedef
+      typename pb_ds::test::hash_common_types<
+	pb_ds::test::basic_type,
+	Data_Type,
+	hash,
+	std::equal_to<
+	pb_ds::test::basic_type>,
+	alloc_type>::regression_tl
+      tl_t;
+
+      typedef tl_t min_tl_t;
+    };
+
+    template<typename Data_Type>
+    struct lu_types
+    {
+      typedef
+      typename pb_ds::test::lu_common_types<
+	pb_ds::test::basic_type,
+	Data_Type,
+	std::equal_to<
+	pb_ds::test::basic_type>,
+	alloc_type>::regression_tl
+      tl_t;
+
+      typedef tl_t min_tl_t;
+    };
+
+    typedef
+    tree_types<
+      pb_ds::null_mapped_type>::tl_t
+    tree_set_tl_t;
+
+    typedef
+    tree_types<
+      pb_ds::null_mapped_type>::min_tl_t
+    min_tree_set_tl_t;
+
+    typedef
+    hash_types<
+      pb_ds::null_mapped_type>::tl_t
+    hash_set_tl_t;
+
+    typedef
+    hash_types<
+      pb_ds::null_mapped_type>::min_tl_t
+    min_hash_set_tl_t;
+
+    typedef lu_types< pb_ds::null_mapped_type>::tl_t lu_set_tl_t;
+
+    typedef
+    lu_types<
+      pb_ds::null_mapped_type>::min_tl_t
+    min_lu_set_tl_t;
+
+    typedef
+    trie_types<
+      pb_ds::null_mapped_type>::tl_t
+    trie_set_tl_t;
+
+    typedef
+    trie_types<
+      pb_ds::null_mapped_type>::min_tl_t
+    min_trie_set_tl_t;
+
+    typedef tree_types< basic_type>::tl_t tree_map_tl_t;
+
+    typedef tree_types< basic_type>::min_tl_t min_tree_map_tl_t;
+
+    typedef hash_types< basic_type>::tl_t hash_map_tl_t;
+
+    typedef hash_types< basic_type>::min_tl_t min_hash_map_tl_t;
+
+    typedef lu_types< basic_type>::tl_t lu_map_tl_t;
+
+    typedef lu_types< basic_type>::min_tl_t min_lu_map_tl_t;
+
+    typedef trie_types< basic_type>::tl_t trie_map_tl_t;
+
+    typedef trie_types< basic_type>::min_tl_t min_trie_map_tl_t;
+
+  } // namespace test
+
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_RAND_REGRESSION_TEST_COMMON_TYPE_HPP
diff --git a/libstdc++-v3/testsuite/util/regression/basic_type.hpp b/libstdc++-v3/testsuite/util/regression/basic_type.hpp
new file mode 100644
index 00000000000..60e970bd471
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/regression/basic_type.hpp
@@ -0,0 +1,118 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file basic_type.hpp
+ * Containsert a type used for regression tests' key and data.
+ */
+
+#ifndef PB_DS_BASIC_TYPE_HPP
+#define PB_DS_BASIC_TYPE_HPP
+
+#include <string>
+#include <regression/res_mng/dbg_ex_allocator.hpp>
+
+namespace pb_ds
+{
+
+  namespace test
+  {
+
+#define PB_DS_BASE_C_DEC						\
+    std::basic_string<							\
+							char,		\
+							std::char_traits< \
+											char>, \
+							dbg_ex_allocator< \
+											char> >
+
+    struct basic_type : public PB_DS_BASE_C_DEC
+    {
+    public:
+      enum
+	{
+	  distinct_chars = 4
+	};
+
+    public:
+      basic_type()
+      { }
+
+      template<typename Gen>
+      basic_type(Gen& r_gen, size_t max)
+      {
+        size_t rnd =
+	  r_gen.get_unsigned_long(0, static_cast<unsigned long>(max));
+
+        while (rnd > 0)
+	  {
+            PB_DS_BASE_C_DEC::push_back('a' +
+					static_cast<char>(rnd % distinct_chars));
+
+            rnd /= distinct_chars;
+	  }
+      }
+
+      basic_type(const std::string other)
+      {
+        std::string::const_iterator it = other.begin();
+
+        while (it != other.end())
+	  {
+            PB_DS_BASE_C_DEC::push_back(*it);
+
+            ++it;
+	  }
+      }
+
+      operator std::string() const
+      {
+        return (std::string(PB_DS_BASE_C_DEC::c_str()));
+      }
+    };
+
+#undef PB_DS_BASE_C_DEC
+
+  } // namespace test
+
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_BASIC_TYPE_HPP
diff --git a/libstdc++-v3/testsuite/util/regression/priority_queue/common_type.hpp b/libstdc++-v3/testsuite/util/regression/priority_queue/common_type.hpp
new file mode 100644
index 00000000000..4c67167a0e2
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/regression/priority_queue/common_type.hpp
@@ -0,0 +1,78 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file common_type.hpp
+ * Contains types used for regression tests.
+ */
+
+#ifndef PB_DS_RAND_REGRESSION_TEST_COMMON_TYPE_HPP
+#define PB_DS_RAND_REGRESSION_TEST_COMMON_TYPE_HPP
+
+#include <regression/basic_type.hpp>
+#include <common_type/priority_queue/common_type.hpp>
+
+namespace pb_ds
+{
+
+  namespace test
+  {
+
+    typedef
+    pb_ds::test::dbg_ex_allocator<
+      pb_ds::test::basic_type>
+    alloc_type;
+
+    typedef
+    pb_ds::test::pq_common_types<
+      pb_ds::test::basic_type,
+      std::less<
+      pb_ds::test::basic_type>,
+      alloc_type>::regression_tl
+    pq_tl_t;
+
+    typedef pq_tl_t min_pq_tl_t;
+
+  } // namespace test
+
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_RAND_REGRESSION_TEST_COMMON_TYPE_HPP
diff --git a/libstdc++-v3/testsuite/util/regression/rand/assoc/container_rand_regression_test.hpp b/libstdc++-v3/testsuite/util/regression/rand/assoc/container_rand_regression_test.hpp
new file mode 100644
index 00000000000..4f4c144b8d2
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/regression/rand/assoc/container_rand_regression_test.hpp
@@ -0,0 +1,530 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file container_rand_regression_test.hpp
+ * Contains a random regression test for a specific container type.
+ */
+
+#ifndef PB_DS_CONTAINER_RAND_REGRESSION_TEST_HPP
+#define PB_DS_CONTAINER_RAND_REGRESSION_TEST_HPP
+
+#include <algorithm>
+#include <string>
+#include <sstream>
+#include <utility>
+#include <ext/pb_ds/assoc_container.hpp>
+#include <io/prog_bar.hpp>
+#include <rng/twister_rand_gen.hpp>
+#include <regression/trait/assoc/trait.hpp>
+#include <common_type/assoc/string_form.hpp>
+#include <regression/rand/io/assoc/xml_formatter.hpp>
+
+namespace pb_ds
+{
+
+  namespace test
+  {
+
+    namespace detail
+    {
+
+#ifdef PB_DS_REGRESSION_TRACE
+#define PB_DS_TRACE(X) std::cerr << X << std::endl
+#else // #ifdef PB_DS_REGRESSION_TRACE
+#define PB_DS_TRACE(X)
+#endif // #ifdef PB_DS_REGRESSION_TRACE
+
+#define PB_DS_CLASS_T_DEC			\
+      template<typename Cntnr>
+
+#define PB_DS_CLASS_C_DEC				\
+      container_rand_regression_test<			\
+						Cntnr>
+
+#define PB_DS_COND_COMPARE(L, R)		\
+      if (m_g.get_prob() < m_mp)		\
+        cmp(L, R, __FUNCTION__);
+
+#define PB_DS_RUN_MTHD(MTHD)			\
+      {						\
+        bool done = false;			\
+						\
+        while (!done)				\
+	  done = MTHD();			\
+      }
+
+#define PB_DS_THROW_IF_FAILED_(PRED, MORE, P_C, P_NC, F, L)		\
+      if (!(PRED))							\
+	{								\
+	  std::cerr << "Failure at " << F << ": " << L << std::endl;	\
+									\
+	  std::cerr << MORE << std::endl;				\
+									\
+	  std::cerr << "container:" << std::endl;			\
+									\
+	  print_container(*(P_C));					\
+	  std::cerr << std::endl;					\
+									\
+	  std::cerr << "native container:" << std::endl;		\
+									\
+	  print_container(*(P_NC));					\
+	  std::cerr << std::endl;					\
+									\
+	  throw std::logic_error("fucked!");				\
+	}
+
+#define PB_DS_THROW_IF_FAILED(PRED, MORE, P_C, P_NC)			\
+      PB_DS_THROW_IF_FAILED_(PRED, MORE, P_C, P_NC, __FILE__, __LINE__)
+
+#define PB_DS_SET_DESTRUCT_PRINT			\
+      destructor_printer dest_print___(__FUNCTION__);
+
+#define PB_DS_CANCEL_DESTRUCT_PRINT		\
+      dest_print___.cancel_print();
+
+      // Rand test specialized for a specific container.
+      template<typename Cntnr>
+      class container_rand_regression_test
+      {
+
+      public:
+
+        container_rand_regression_test(unsigned long seed, size_t n, size_t m, double tp, double ip, double ep, double cp, double mp, bool disp);
+
+	virtual
+        ~container_rand_regression_test();
+
+	void
+        operator()();
+
+      private:
+	typedef Cntnr cntnr;
+
+	typedef typename cntnr::allocator allocator;
+
+	typedef typename cntnr::size_type size_type;
+
+	typedef twister_rand_gen gen;
+
+	typedef regression_test_traits< Cntnr> test_traits;
+
+	typedef pb_ds::container_traits< Cntnr> container_traits;
+
+	typedef typename test_traits::key_type key_type;
+
+	typedef typename test_traits::const_key_reference const_key_reference;
+
+	typedef typename test_traits::value_type value_type;
+
+	typedef typename test_traits::native_type native_type;
+
+	enum op
+	  {
+	    insert_op,
+	    erase_op,
+	    clear_op,
+	    other_op
+	  };
+
+	typedef dbg_ex_allocator< char> alloc_t;
+
+      private:
+
+	op
+        get_next_op();
+
+	size_t
+        get_next_sub_op(size_t max);
+
+	static void
+        defs();
+
+	static void
+        key_defs();
+
+	static void
+        mapped_defs();
+
+	static void
+        value_defs();
+
+	static void
+        ds_defs();
+
+	static void
+        iterator_defs();
+
+	static void
+        node_iterator_defs(pb_ds::detail::false_type);
+
+	static void
+        node_iterator_defs(pb_ds::detail::true_type);
+
+	static void
+        policy_defs();
+
+	static void
+        policy_defs(pb_ds::basic_hash_tag);
+
+	static void
+        policy_defs(pb_ds::cc_hash_tag);
+
+	static void
+        policy_defs(pb_ds::gp_hash_tag);
+
+	static void
+        policy_defs(pb_ds::tree_tag);
+
+	static void
+        policy_defs(pb_ds::list_update_tag);
+
+	static void
+        policy_defs(pb_ds::pat_trie_tag);
+
+	void
+        policy_access();
+
+	void
+        policy_access(pb_ds::basic_hash_tag);
+
+	void
+        policy_access(pb_ds::cc_hash_tag);
+
+	void
+        policy_access(pb_ds::gp_hash_tag);
+
+	void
+        policy_access(pb_ds::tree_tag);
+
+	void
+        policy_access(pb_ds::list_update_tag);
+
+	void
+        policy_access(pb_ds::pat_trie_tag);
+
+	void
+        it_copy();
+
+	void
+        it_assign();
+
+	void
+        rev_it_copy();
+
+	void
+        rev_it_assign();
+
+	void
+        rev_it_copy_imp(pb_ds::detail::false_type);
+
+	void
+        rev_it_copy_imp(pb_ds::detail::true_type);
+
+	void
+        rev_it_assign_imp(pb_ds::detail::false_type);
+
+	void
+        rev_it_assign_imp(pb_ds::detail::true_type);
+
+	bool
+        default_constructor();
+
+	void
+        swap();
+
+	bool
+        copy_constructor();
+
+	bool
+        assignment_operator();
+
+	bool
+        it_constructor();
+
+	bool
+        it_constructor_imp(pb_ds::cc_hash_tag);
+
+	bool
+        it_constructor_imp(pb_ds::gp_hash_tag);
+
+	bool
+        it_constructor_imp(pb_ds::tree_tag);
+
+	bool
+        it_constructor_imp(pb_ds::list_update_tag);
+
+	bool
+        it_constructor_imp(pb_ds::pat_trie_tag);
+
+	bool
+        insert();
+
+	bool
+        erase();
+
+	bool
+        erase_it();
+
+	bool
+        erase_it_imp(pb_ds::detail::false_type);
+
+	bool
+        erase_it_imp(pb_ds::detail::true_type);
+
+	bool
+        erase_rev_it();
+
+	bool
+        erase_rev_it_imp(pb_ds::detail::false_type);
+
+	bool
+        erase_rev_it_imp(pb_ds::detail::true_type);
+
+	bool
+        erase_if();
+
+	bool
+        clear();
+
+	bool
+        resize();
+
+	bool
+        resize_imp(pb_ds::detail::true_type);
+
+	bool
+        resize_imp(pb_ds::detail::false_type);
+
+	bool
+        get_set_loads();
+
+	bool
+        get_set_loads_imp(pb_ds::detail::true_type);
+
+	bool
+        get_set_loads_imp(pb_ds::detail::false_type);
+
+	void
+        get_set_load();
+
+	void
+        get_set_load_imp(pb_ds::detail::true_type);
+
+	void
+        get_set_load_imp(pb_ds::detail::false_type);
+
+	bool
+        subscript();
+
+	bool
+        subscript_imp(pb_ds::detail::false_type);
+
+	bool
+        subscript_imp(pb_ds::detail::true_type);
+
+	bool
+        split_join();
+
+	bool
+        split_join_imp(pb_ds::detail::false_type);
+
+	bool
+        split_join_imp(pb_ds::detail::true_type);
+
+	void
+        cmp(const Cntnr& r_container, const native_type& r_native_c, const std::string& r_call_fn);
+
+	void
+        basic_cmp_(const Cntnr& r_container, const native_type& r_native_c);
+
+	void
+        cmp_(const Cntnr& r_container, const native_type& r_native_c);
+
+	void
+        order_preserving_cmp_imp(const Cntnr& r_c, const native_type& r_native_c, pb_ds::detail::false_type);
+
+	void
+        order_preserving_cmp_imp(const Cntnr& r_c, const native_type& r_native_c, pb_ds::detail::true_type);
+
+	void
+        back_order_preserving_cmp_imp(const Cntnr& r_c, const native_type& r_native_c, pb_ds::detail::false_type);
+
+	void
+        back_order_preserving_cmp_imp(const Cntnr& r_c, const native_type& r_native_c, pb_ds::detail::true_type);
+
+	void
+        reverse_iteration_cmp_imp(const Cntnr& r_c, const native_type& r_native_c, pb_ds::detail::false_type);
+
+	void
+        reverse_iteration_cmp_imp(const Cntnr& r_c, const native_type& r_native_c, pb_ds::detail::true_type);
+
+	void
+        order_statistics_cmp_imp(const Cntnr& r_c, const native_type& r_native_c, pb_ds::detail::false_type);
+
+	void
+        order_statistics_cmp_imp(const Cntnr& r_c, const native_type& r_native_c, pb_ds::detail::true_type);
+
+	void
+        prefix_search_cmp_imp(const Cntnr& r_c, const native_type& r_native_c, pb_ds::detail::false_type);
+
+	void
+        prefix_search_cmp_imp(const Cntnr& r_c, const native_type& r_native_c, pb_ds::detail::true_type);
+
+	template<typename Const_It, class Const_Native_It>
+	void
+        it_cmp_imp(Const_It b, Const_It e, Const_Native_It native_b, Const_Native_It native_e);
+
+	template<typename Const_It, class Const_Native_It>
+	void
+        back_it_cmp_imp(Const_It b, Const_It e, Const_Native_It native_b, Const_Native_It native_e);
+
+	void
+        lower_bound_cmp_imp(const Cntnr& r_c, const native_type& r_native_c, pb_ds::detail::false_type);
+
+	void
+        lower_bound_cmp_imp(const Cntnr& r_c, const native_type& r_native_c, pb_ds::detail::true_type);
+
+	void
+        upper_bound_cmp_imp(const Cntnr& r_c, const native_type& r_native_c, pb_ds::detail::false_type);
+
+	void
+        upper_bound_cmp_imp(const Cntnr& r_c, const native_type& r_native_c, pb_ds::detail::true_type);
+
+	void
+        print_container(const native_type& r_cnt, std::ostream& r_os = std::cerr) const;
+
+	void
+        print_container(const cntnr& r_cnt, std::ostream& r_os = std::cerr) const;
+
+      private:
+	struct destructor_printer
+	{
+	  destructor_printer(const std::string& r_msg) : m_msg(r_msg),
+							 m_print(true)
+	  { }
+
+	  void
+	  cancel_print()
+	  {
+            m_print = false;
+	  }
+
+	  ~destructor_printer()
+	  {
+            if (!m_print)
+	      return;
+
+            std::cerr << std::endl <<
+	      "Uncaught exception: " << std::endl <<
+	      m_msg << std::endl;
+	  }
+
+	private:
+	  const std::string m_msg;
+
+	  bool m_print;
+	};
+
+      private:
+	const unsigned long m_seed;
+
+	const size_t m_n;
+	const size_t m_m;
+	const double m_tp;
+	const double m_ip;
+	const double m_ep;
+	const double m_cp;
+	const double m_mp;
+	const bool m_disp;
+
+	twister_rand_gen m_g;
+
+	Cntnr* m_p_c;
+
+	native_type m_native_c;
+
+	alloc_t m_alloc;
+
+	size_t m_i;
+      };
+
+#include <regression/rand/assoc/detail/constructor_destructor_fn_imps.hpp>
+#include <regression/rand/assoc/detail/cmp_fn_imps.hpp>
+#include <regression/rand/assoc/detail/operator_fn_imps.hpp>
+#include <regression/rand/assoc/detail/insert_fn_imps.hpp>
+#include <regression/rand/assoc/detail/subscript_fn_imps.hpp>
+#include <regression/rand/assoc/detail/clear_fn_imps.hpp>
+#include <regression/rand/assoc/detail/erase_fn_imps.hpp>
+#include <regression/rand/assoc/detail/defs_fn_imps.hpp>
+#include <regression/rand/assoc/detail/policy_access_fn_imps.hpp>
+#include <regression/rand/assoc/detail/split_join_fn_imps.hpp>
+#include <regression/rand/assoc/detail/it_conversion_fn_imps.hpp>
+#include <regression/rand/assoc/detail/resize_fn_imps.hpp>
+#include <regression/rand/assoc/detail/get_set_load_fn_imps.hpp>
+#include <regression/rand/assoc/detail/get_set_loads_fn_imps.hpp>
+#include <regression/rand/assoc/detail/diagnostic_fn_imps.hpp>
+
+#undef PB_DS_COND_COMPARE
+
+#undef PB_DS_RUN_MTHD
+
+#undef PB_DS_CLASS_T_DEC
+
+#undef PB_DS_CLASS_C_DEC
+
+#undef PB_DS_THROW_IF_FAILED_
+
+#undef PB_DS_THROW_IF_FAILED
+
+#undef PB_DS_SET_DESTRUCT_PRINT
+
+#undef PB_DS_CANCEL_DESTRUCT_PRINT
+
+#undef PB_DS_TRACE
+
+    } // namespace detail
+
+  } // namespace test
+
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_CONTAINER_RAND_REGRESSION_TEST_HPP
diff --git a/libstdc++-v3/testsuite/util/regression/rand/assoc/detail/clear_fn_imps.hpp b/libstdc++-v3/testsuite/util/regression/rand/assoc/detail/clear_fn_imps.hpp
new file mode 100644
index 00000000000..bbc8cbe75c9
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/regression/rand/assoc/detail/clear_fn_imps.hpp
@@ -0,0 +1,58 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file clear_fn_imps.hpp
+ * Containsert a random regression test for a specific container type.
+ */
+
+PB_DS_CLASS_T_DEC
+bool
+PB_DS_CLASS_C_DEC::
+clear()
+{
+  m_p_c->clear();
+
+  m_native_c.clear();
+
+  return (true);
+}
+
diff --git a/libstdc++-v3/testsuite/util/regression/rand/assoc/detail/cmp_fn_imps.hpp b/libstdc++-v3/testsuite/util/regression/rand/assoc/detail/cmp_fn_imps.hpp
new file mode 100644
index 00000000000..2b1325f8e51
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/regression/rand/assoc/detail/cmp_fn_imps.hpp
@@ -0,0 +1,601 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file cmp_fn_imps.hpp
+ * Containsert a random regression test for a specific container type.
+ */
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+cmp(const Cntnr& r_c, const native_type& r_native_c, const std::string& r_call_fn)
+{
+  m_alloc.set_throw_prob(1);
+
+  const size_t size = r_c.size();
+  const size_t native_size = r_native_c.size();
+
+  PB_DS_THROW_IF_FAILED(
+			size == native_size,
+			static_cast<unsigned long>(size) << " " <<
+			static_cast<unsigned long>(native_size),
+			& r_c,
+			& r_native_c);
+
+  const bool empty = r_c.empty();
+  const bool native_empty = r_native_c.empty();
+
+  PB_DS_THROW_IF_FAILED(
+			empty == native_empty,
+			empty << " " << native_empty,
+			& r_c,
+			& r_native_c);
+
+  try
+    {
+      basic_cmp_(r_c, r_native_c);
+
+      cmp_(r_c, r_native_c);
+    }
+  catch(...)
+    {
+      PB_DS_THROW_IF_FAILED(            false, "call-fn: " + r_call_fn, & r_c, & r_native_c);
+    }
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+basic_cmp_(const Cntnr& r_c, const native_type& r_native_c)
+{
+  PB_DS_SET_DESTRUCT_PRINT
+
+    if (static_cast<size_t>(std::distance(r_c.begin(), r_c.end())) !=
+	r_c.size())
+      PB_DS_THROW_IF_FAILED(
+			    false,
+			    static_cast<unsigned long>(
+						       std::distance(r_c.begin(), r_c.end())) <<
+			    " " << static_cast<unsigned long>(r_c.size()),
+			    & r_c,
+			    & r_native_c);
+
+  typename native_type::const_iterator it = r_native_c.begin();
+
+  while (it != r_native_c.end())
+    {
+      typename native_type::key_type native_key =
+	test_traits::extract_native_key(*it);
+
+      m_alloc.set_throw_prob(0);
+
+      const key_type k = native_key;
+
+      m_alloc.set_throw_prob(1);
+
+      typename cntnr::const_point_iterator found_it = r_c.find(k);
+
+      PB_DS_THROW_IF_FAILED(
+			    found_it != r_c.end(),
+			    test_traits::native_val_to_string(*it),
+			    & r_c,
+			    & r_native_c);
+
+      if (!test_traits::cmp(*found_it, * it))
+	PB_DS_THROW_IF_FAILED(                false,  "", & r_c, & r_native_c);
+
+      ++it;
+    }
+
+  PB_DS_CANCEL_DESTRUCT_PRINT
+    }
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+cmp_(const Cntnr& r_c, const native_type& r_native_c)
+{
+  enum
+    {
+      order_preserving =
+      container_traits::order_preserving,
+      back_order_preserving =
+      container_traits::order_preserving&& 
+      !pb_ds::detail::is_same<
+      typename std::iterator_traits<
+      typename cntnr::const_iterator>::iterator_category,
+      std::forward_iterator_tag>::value,
+      reverse_iteration = container_traits::reverse_iteration,
+      order_statistics = test_traits::order_statistics,
+      prefix_search = test_traits::prefix_search,
+      has_mapped = !pb_ds::detail::is_same<
+      typename Cntnr::mapped_type,
+      pb_ds::null_mapped_type>::value
+    };
+
+  order_preserving_cmp_imp(r_c, r_native_c,
+			   pb_ds::detail::integral_constant<int,order_preserving>());
+
+  back_order_preserving_cmp_imp(r_c, r_native_c,
+				pb_ds::detail::integral_constant<int,back_order_preserving>());
+
+  order_statistics_cmp_imp(r_c, r_native_c,
+			   pb_ds::detail::integral_constant<int,order_statistics>());
+
+  prefix_search_cmp_imp(r_c, r_native_c,
+			pb_ds::detail::integral_constant<int,prefix_search>());
+
+  reverse_iteration_cmp_imp(r_c, r_native_c,
+			    pb_ds::detail::integral_constant<int,reverse_iteration>());
+
+  lower_bound_cmp_imp(r_c, r_native_c,
+		      pb_ds::detail::integral_constant<int,order_preserving>());
+
+  upper_bound_cmp_imp(r_c, r_native_c,
+		      pb_ds::detail::integral_constant<int,order_preserving>());
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+order_preserving_cmp_imp(const Cntnr& /*r_c*/, const native_type& /*r_native_c*/, pb_ds::detail::false_type)
+{ }
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+order_preserving_cmp_imp(const Cntnr& r_c, const native_type& r_native_c, pb_ds::detail::true_type)
+{
+  PB_DS_SET_DESTRUCT_PRINT
+
+    typename cntnr::const_iterator b = r_c.begin();
+  typename cntnr::const_iterator e = r_c.end();
+
+  typename native_type::const_iterator native_b = r_native_c.begin();
+  typename native_type::const_iterator native_e = r_native_c.end();
+
+  try
+    {
+      it_cmp_imp(b, e, native_b, native_e);
+    }
+  catch(...)
+    {
+      PB_DS_THROW_IF_FAILED(            false, "", & r_c, & r_native_c)
+	}
+
+  try
+    {
+      back_it_cmp_imp(b, e, native_b, native_e);
+    }
+  catch(...)
+    {
+      PB_DS_THROW_IF_FAILED(            false, "", & r_c, & r_native_c)
+	}
+
+  PB_DS_CANCEL_DESTRUCT_PRINT
+    }
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+back_order_preserving_cmp_imp(const Cntnr& /*r_c*/, const native_type& /*r_native_c*/, pb_ds::detail::false_type)
+{ }
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+back_order_preserving_cmp_imp(const Cntnr& r_c, const native_type& r_native_c, pb_ds::detail::true_type)
+{
+  PB_DS_SET_DESTRUCT_PRINT
+
+    typename cntnr::const_iterator b = r_c.begin();
+  typename cntnr::const_iterator e = r_c.end();
+
+  typename native_type::const_iterator native_b = r_native_c.begin();
+  typename native_type::const_iterator native_e = r_native_c.end();
+
+  it_cmp_imp(b, e, native_b, native_e);
+
+  PB_DS_CANCEL_DESTRUCT_PRINT
+    }
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+reverse_iteration_cmp_imp(const Cntnr& /*r_c*/, const native_type& /*r_native_c*/, pb_ds::detail::false_type)
+{ }
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+reverse_iteration_cmp_imp(const Cntnr& r_c, const native_type& r_native_c, pb_ds::detail::true_type)
+{
+  PB_DS_SET_DESTRUCT_PRINT
+
+    typename cntnr::const_reverse_iterator b = r_c.rbegin();
+  typename cntnr::const_reverse_iterator e = r_c.rend();
+
+  typename native_type::const_reverse_iterator native_b = r_native_c.rbegin();
+  typename native_type::const_reverse_iterator native_e = r_native_c.rend();
+
+  try
+    {
+      it_cmp_imp(b, e, native_b, native_e);
+    }
+  catch(...)
+    {
+      PB_DS_THROW_IF_FAILED(            false, "", & r_c, & r_native_c)
+	}
+
+  try
+    {
+      back_it_cmp_imp(b, e, native_b, native_e);
+    }
+  catch(...)
+    {
+      PB_DS_THROW_IF_FAILED(            false, "", & r_c, & r_native_c)
+	}
+
+  PB_DS_CANCEL_DESTRUCT_PRINT
+    }
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+order_statistics_cmp_imp(const Cntnr& /*r_c*/, const native_type& /*r_native_c*/, pb_ds::detail::false_type)
+{ }
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+order_statistics_cmp_imp(const Cntnr& r_c, const native_type& r_native_c, pb_ds::detail::true_type)
+{
+  {
+    m_alloc.set_throw_prob(0);
+
+    const key_type k =
+      test_traits::generate_key(m_g, m_m);
+
+    m_alloc.set_throw_prob(1);
+
+    const size_type order = r_c.order_of_key(k);
+
+    const size_type native_order = std::distance(
+						 r_native_c.begin(),
+						 r_native_c.lower_bound(test_traits::native_key(k)));
+
+    PB_DS_THROW_IF_FAILED(
+			  order == native_order,
+			  test_traits::key_to_string(k) << " " <<
+			  static_cast<unsigned long>(order) << " " <<
+			  static_cast<unsigned long>(native_order),
+			  & r_c,
+			  & r_native_c);
+  }
+
+  const size_type rand_ord =
+    static_cast<size_t>(m_g.get_unsigned_long(
+					      0,
+					      2*  static_cast<unsigned long>(m_m)));
+
+  typename cntnr::const_iterator it =
+    r_c.find_by_order(rand_ord);
+
+  typename native_type::const_iterator native_it =
+    r_native_c.begin();
+
+  std::advance(native_it, std::min(rand_ord, r_native_c.size()));
+
+  if (it == r_c.end()&&  native_it != r_native_c.end())
+    PB_DS_THROW_IF_FAILED(
+			  false,
+			  static_cast<unsigned long>(rand_ord),
+			  m_p_c,
+			  & m_native_c);
+
+  if (it != r_c.end()&&  native_it == r_native_c.end())
+    PB_DS_THROW_IF_FAILED(
+			  false,
+			  static_cast<unsigned long>(rand_ord),
+			  m_p_c,
+			  & m_native_c);
+
+  if (it != r_c.end()&&     native_it != r_native_c.end())
+    PB_DS_THROW_IF_FAILED(
+			  test_traits::cmp(*it, * native_it),
+			  static_cast<unsigned long>(rand_ord),
+			  m_p_c,
+			  & m_native_c);
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+prefix_search_cmp_imp(const Cntnr& /*r_c*/, const native_type& /*r_native_c*/, pb_ds::detail::false_type)
+{ }
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+prefix_search_cmp_imp(const Cntnr& r_c, const native_type& r_native_c, pb_ds::detail::true_type)
+{
+  PB_DS_SET_DESTRUCT_PRINT
+
+    m_alloc.set_throw_prob(0);
+
+  const key_type k =
+    test_traits::generate_key(m_g, m_m);
+
+  m_alloc.set_throw_prob(1);
+
+  try
+    {
+      typedef
+	std::pair<
+	typename Cntnr::const_iterator,
+	typename Cntnr::const_iterator>
+	pref_ret_t;
+
+      const pref_ret_t pref_ret = r_c.prefix_range(k);
+
+      typename native_type::const_iterator native_start_it =
+	r_native_c.begin();
+
+      while (native_start_it != r_native_c.end()&& 
+	     !test_traits::prefix_match(
+					k,
+					test_traits::extract_native_key(*native_start_it)))
+	++native_start_it;
+
+      typename native_type::const_iterator native_end_it =
+	native_start_it;
+
+      do
+        {
+	  if (native_end_it != r_native_c.end())
+	    ++native_end_it;
+        }
+      while (native_end_it != r_native_c.end()&& 
+	     test_traits::prefix_match(
+				       k,
+				       test_traits::extract_native_key(*native_end_it)));
+
+      it_cmp_imp(            pref_ret.first, pref_ret.second, native_start_it, native_end_it);
+    }
+  catch(...)
+    {
+      PB_DS_THROW_IF_FAILED(
+			    false,
+			    "prefix key " << k,
+			    & r_c,
+			    & r_native_c);
+    }
+
+  PB_DS_CANCEL_DESTRUCT_PRINT
+    }
+
+PB_DS_CLASS_T_DEC
+template<typename Const_It, class Const_Native_It>
+void
+PB_DS_CLASS_C_DEC::
+it_cmp_imp(Const_It b, Const_It e, Const_Native_It native_b, Const_Native_It native_e)
+{
+  PB_DS_SET_DESTRUCT_PRINT
+
+    if (std::distance(b, e) != std::distance(native_b, native_e))
+      {
+        const size_t dist = std::distance(b, e);
+
+        const size_t native_dist = std::distance(native_b, native_e);
+
+        PB_DS_THROW_IF_FAILED(
+			      false,
+			      static_cast<unsigned long>(dist) << " "
+			      << static_cast<unsigned long>(native_dist),
+			      m_p_c,
+			      & m_native_c);
+      }
+
+  while (b != e)
+    {
+      PB_DS_THROW_IF_FAILED(            native_b != native_e, "", m_p_c, & m_native_c);
+
+      if (!test_traits::cmp(*b, * native_b))
+	PB_DS_THROW_IF_FAILED(
+			      false,
+			      test_traits::val_to_string(*b) << " " <<
+			      test_traits::val_to_string(*native_b),
+			      m_p_c,
+			      & m_native_c);
+
+      ++b;
+      ++native_b;
+    }
+
+  PB_DS_THROW_IF_FAILED(        native_b == native_e, "", m_p_c,    & m_native_c);
+
+  PB_DS_CANCEL_DESTRUCT_PRINT
+    }
+
+PB_DS_CLASS_T_DEC
+template<typename Const_It, class Const_Native_It>
+void
+PB_DS_CLASS_C_DEC::
+back_it_cmp_imp(Const_It b, Const_It e, Const_Native_It native_b, Const_Native_It native_e)
+{
+  PB_DS_SET_DESTRUCT_PRINT
+
+    while (b != e)
+      {
+        PB_DS_THROW_IF_FAILED(
+			      native_b != native_e,
+			      test_traits::val_to_string(*native_e),
+			      m_p_c,
+			      & m_native_c);
+
+        --e;
+        --native_e;
+
+        PB_DS_THROW_IF_FAILED(
+			      test_traits::cmp(*e, * native_e),
+			      test_traits::val_to_string(*e) <<
+			      test_traits::val_to_string(*native_e),
+			      m_p_c,
+			      & m_native_c);
+      }
+
+  PB_DS_THROW_IF_FAILED(
+			native_b == native_e,
+			test_traits::val_to_string(*native_e),
+			m_p_c,
+			& m_native_c);
+
+  PB_DS_CANCEL_DESTRUCT_PRINT
+    }
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+lower_bound_cmp_imp(const Cntnr& /*r_c*/, const native_type& /*r_native_c*/, pb_ds::detail::false_type)
+{ }
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+lower_bound_cmp_imp(const Cntnr& r_c, const native_type& r_native_c, pb_ds::detail::true_type)
+{
+  PB_DS_SET_DESTRUCT_PRINT
+
+    m_alloc.set_throw_prob(0);
+
+  const key_type k =
+    test_traits::generate_key(m_g, m_m);
+
+  m_alloc.set_throw_prob(1);
+
+  typename cntnr::const_iterator it =    r_c.lower_bound(k);
+
+  typename native_type::key_type native_k = test_traits::native_key(k);
+
+  typename native_type::const_iterator native_it =
+    r_native_c.lower_bound(native_k);
+
+  if (it != r_c.end()&&  native_it == r_native_c.end())
+    PB_DS_THROW_IF_FAILED(
+			  "",
+			  "it: " + test_traits::val_to_string(*it) + "\n\n",
+			  & r_c,
+			  & r_native_c);
+
+  if (it == r_c.end()&&  native_it != r_native_c.end())
+    PB_DS_THROW_IF_FAILED(
+			  "",
+			  "native_it: " + test_traits::val_to_string(*native_it) + "\n\n",
+			  & r_c,
+			  & r_native_c);
+
+  if (it != r_c.end()&&  !test_traits::cmp(*it, * native_it))
+    PB_DS_THROW_IF_FAILED(
+			  false,
+			  "key: " + test_traits::key_to_string(k) + "\n\n" +
+			  "it: " + test_traits::val_to_string(*it) + "\n\n" +
+			  "native_it: " + test_traits::val_to_string(*native_it) + "\n\n",
+			  & r_c,
+			  & r_native_c);
+
+  PB_DS_CANCEL_DESTRUCT_PRINT
+    }
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+upper_bound_cmp_imp(const Cntnr& /*r_c*/, const native_type& /*r_native_c*/, pb_ds::detail::false_type)
+{ }
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+upper_bound_cmp_imp(const Cntnr& r_c, const native_type& r_native_c, pb_ds::detail::true_type)
+{
+  PB_DS_SET_DESTRUCT_PRINT
+
+    m_alloc.set_throw_prob(0);
+
+  const key_type k =
+    test_traits::generate_key(m_g, m_m);
+
+  m_alloc.set_throw_prob(1);
+
+  typename cntnr::const_iterator it =    r_c.upper_bound(k);
+
+  typename native_type::key_type native_k = test_traits::native_key(k);
+
+  typename native_type::const_iterator native_it =
+    r_native_c.upper_bound(native_k);
+
+  if (it == r_c.end()&&  native_it != r_native_c.end())
+    PB_DS_THROW_IF_FAILED(
+			  false,
+			  "key: " + test_traits::key_to_string(k) + "\n\n" +
+			  "native_it: " + test_traits::val_to_string(*native_it) + "\n\n",
+			  & r_c,
+			  & r_native_c);
+
+  if (it != r_c.end()&&  native_it == r_native_c.end())
+    PB_DS_THROW_IF_FAILED(
+			  false,
+			  "key: " + test_traits::key_to_string(k) + "\n\n" +
+			  "it: " + test_traits::val_to_string(*it) + "\n\n",
+			  & r_c,
+			  & r_native_c);
+
+  if (it != r_c.end()&&  !test_traits::cmp(*it, * native_it))
+    PB_DS_THROW_IF_FAILED(
+			  false,
+			  "key: " + test_traits::key_to_string(k) + "\n\n" +
+			  "it: " + test_traits::val_to_string(*it) + "\n\n" +
+			  "native_it: " + test_traits::val_to_string(*native_it) + "\n\n",
+			  & r_c,
+			  & r_native_c);
+
+  PB_DS_CANCEL_DESTRUCT_PRINT
+    }
diff --git a/libstdc++-v3/testsuite/util/regression/rand/assoc/detail/constructor_destructor_fn_imps.hpp b/libstdc++-v3/testsuite/util/regression/rand/assoc/detail/constructor_destructor_fn_imps.hpp
new file mode 100644
index 00000000000..82cc024e3a5
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/regression/rand/assoc/detail/constructor_destructor_fn_imps.hpp
@@ -0,0 +1,521 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file constructor_destructor_fn_imps.hpp
+ * Containsert a random regression test for a specific container type.
+ */
+
+PB_DS_CLASS_T_DEC
+PB_DS_CLASS_C_DEC::
+container_rand_regression_test(unsigned long seed, size_t n, size_t m, double tp, double ip, double ep, double cp, double mp, bool disp) :
+  m_seed((seed == 0)?
+	 twister_rand_gen::get_time_determined_seed():
+	 seed),
+  m_n(n),
+  m_m(m),
+  m_tp(tp),
+  m_ip(ip),
+  m_ep(ep),
+  m_cp(cp),
+  m_mp(mp),
+  m_disp(disp),
+  m_p_c(NULL)
+{ }
+
+PB_DS_CLASS_T_DEC
+PB_DS_CLASS_C_DEC::
+~container_rand_regression_test()
+{ }
+
+PB_DS_CLASS_T_DEC
+bool
+PB_DS_CLASS_C_DEC::
+default_constructor()
+{
+  PB_DS_TRACE("default_constructor");
+
+  bool done = true;
+
+  m_alloc.set_throw_prob(m_tp);
+
+  try
+    {
+      m_p_c = new Cntnr;
+    }
+  catch(forced_exception& )
+    {
+      done = false;
+    }
+
+  if (m_p_c != NULL)
+    PB_DS_COND_COMPARE(*m_p_c, m_native_c);
+
+  return (done);
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+swap()
+{
+  PB_DS_TRACE("swap");
+
+  m_alloc.set_throw_prob(0);
+
+  Cntnr* p_c = new Cntnr;
+
+  m_alloc.set_throw_prob(1);
+
+  p_c->swap(*m_p_c);
+
+  std::swap(p_c, m_p_c);
+
+  delete p_c;
+
+  PB_DS_COND_COMPARE(*m_p_c, m_native_c);
+}
+
+PB_DS_CLASS_T_DEC
+bool
+PB_DS_CLASS_C_DEC::
+copy_constructor()
+{
+  PB_DS_TRACE("copy_constructor");
+
+  bool done = true;
+
+  Cntnr* p_c = NULL;
+
+  m_alloc.set_throw_prob(m_tp);
+
+  typename alloc_t::group_throw_prob_adjustor
+    adjust(m_p_c->size());
+
+  try
+    {
+      p_c = new Cntnr(*m_p_c);
+
+      std::swap(p_c, m_p_c);
+    }
+  catch(forced_exception& )
+    {
+      done = false;
+    }
+
+  delete p_c;
+
+  PB_DS_COND_COMPARE(*m_p_c, m_native_c);
+
+  return (done);
+}
+
+PB_DS_CLASS_T_DEC
+bool
+PB_DS_CLASS_C_DEC::
+assignment_operator()
+{
+  PB_DS_TRACE("assignment operator");
+
+  bool done = true;
+
+  Cntnr* p_c = NULL;
+
+  m_alloc.set_throw_prob(m_tp);
+
+  typename alloc_t::group_throw_prob_adjustor
+    adjust(m_p_c->size());
+
+  try
+    {
+      p_c = new Cntnr();
+
+      * p_c =* m_p_c;
+
+      std::swap(p_c, m_p_c);
+    }
+  catch(forced_exception& )
+    {
+      done = false;
+    }
+
+  delete p_c;
+
+  PB_DS_COND_COMPARE(*m_p_c, m_native_c);
+
+  return (done);
+}
+
+PB_DS_CLASS_T_DEC
+bool
+PB_DS_CLASS_C_DEC::
+it_constructor()
+{
+  PB_DS_TRACE("it_constructor");
+
+  return (it_constructor_imp(typename Cntnr::container_category()));
+}
+
+PB_DS_CLASS_T_DEC
+bool
+PB_DS_CLASS_C_DEC::
+it_constructor_imp(pb_ds::cc_hash_tag)
+{
+  bool done = true;
+
+  Cntnr* p_c = NULL;
+
+  m_alloc.set_throw_prob(m_tp);
+
+  typename alloc_t::group_throw_prob_adjustor
+    adjust(m_p_c->size());
+
+  try
+    {
+      switch(get_next_sub_op(8))
+        {
+        case 0:
+	  p_c = new Cntnr(m_p_c->get_hash_fn());
+	  m_native_c.clear();
+	  break;
+        case 1:
+	  p_c = new Cntnr(m_p_c->get_hash_fn(),
+			  m_p_c->get_eq_fn());
+	  m_native_c.clear();
+	  break;
+        case 2:
+	  p_c = new Cntnr(m_p_c->get_hash_fn(),
+			  m_p_c->get_eq_fn(),
+			  m_p_c->get_comb_hash_fn());
+	  m_native_c.clear();
+	  break;
+        case 3:
+	  p_c = new Cntnr(m_p_c->get_hash_fn(),
+			  m_p_c->get_eq_fn(),
+			  m_p_c->get_comb_hash_fn(),
+			  m_p_c->get_resize_policy());
+	  m_native_c.clear();
+	  break;
+        case 4:
+	  p_c = new Cntnr(m_p_c->begin(),
+			  m_p_c->end());
+	  break;
+        case 5:
+	  p_c = new Cntnr(m_p_c->begin(),
+			  m_p_c->end(),
+			  m_p_c->get_hash_fn());
+	  break;
+        case 6:
+	  p_c = new Cntnr(m_p_c->begin(),
+			  m_p_c->end(),
+			  m_p_c->get_hash_fn(),
+			  m_p_c->get_eq_fn());
+	  break;
+        case 7:
+	  p_c = new Cntnr(m_p_c->begin(),
+			  m_p_c->end(),
+			  m_p_c->get_hash_fn(),
+			  m_p_c->get_eq_fn(),
+			  m_p_c->get_comb_hash_fn());
+	  break;
+        case 8:
+	  p_c = new Cntnr(m_p_c->begin(),
+			  m_p_c->end(),
+			  m_p_c->get_hash_fn(),
+			  m_p_c->get_eq_fn(),
+			  m_p_c->get_comb_hash_fn(),
+			  m_p_c->get_resize_policy());
+	  break;
+        default:
+	  PB_DS_THROW_IF_FAILED(                    false,  "",  m_p_c, & m_native_c);
+        };
+
+      std::swap(p_c, m_p_c);
+    }
+  catch(forced_exception& )
+    {
+      done = false;
+    }
+
+  delete p_c;
+
+  PB_DS_COND_COMPARE(*m_p_c, m_native_c);
+
+  return (done);
+}
+
+PB_DS_CLASS_T_DEC
+bool
+PB_DS_CLASS_C_DEC::
+it_constructor_imp(pb_ds::gp_hash_tag)
+{
+  bool done = true;
+
+  Cntnr* p_c = NULL;
+
+  m_alloc.set_throw_prob(m_tp);
+
+  typename alloc_t::group_throw_prob_adjustor
+    adjust(m_p_c->size());
+
+  try
+    {
+      switch(get_next_sub_op(11))
+        {
+        case 0:
+	  p_c = new Cntnr(m_p_c->get_hash_fn());
+	  m_native_c.clear();
+	  break;
+        case 1:
+	  p_c = new Cntnr(m_p_c->get_hash_fn(),
+			  m_p_c->get_eq_fn());
+	  m_native_c.clear();
+	  break;
+        case 2:
+	  p_c = new Cntnr(m_p_c->get_hash_fn(),
+			  m_p_c->get_eq_fn(),
+			  m_p_c->get_comb_probe_fn());
+	  m_native_c.clear();
+	  break;
+        case 3:
+	  p_c = new Cntnr(m_p_c->get_hash_fn(),
+			  m_p_c->get_eq_fn(),
+			  m_p_c->get_comb_probe_fn());
+	  m_native_c.clear();
+	  break;
+        case 4:
+	  p_c = new Cntnr(m_p_c->get_hash_fn(),
+			  m_p_c->get_eq_fn(),
+			  m_p_c->get_comb_probe_fn(),
+			  m_p_c->get_probe_fn());
+	  m_native_c.clear();
+	  break;
+        case 5:
+	  p_c = new Cntnr(m_p_c->get_hash_fn(),
+			  m_p_c->get_eq_fn(),
+			  m_p_c->get_comb_probe_fn(),
+			  m_p_c->get_probe_fn(),
+			  m_p_c->get_resize_policy());
+	  m_native_c.clear();
+	  break;
+        case 6:
+	  p_c = new Cntnr(m_p_c->begin(),
+			  m_p_c->end(),
+			  m_p_c->get_hash_fn());
+	  break;
+        case 7:
+	  p_c = new Cntnr(m_p_c->begin(),
+			  m_p_c->end(),
+			  m_p_c->get_hash_fn(),
+			  m_p_c->get_eq_fn());
+	  break;
+        case 8:
+	  p_c = new Cntnr(m_p_c->begin(),
+			  m_p_c->end(),
+			  m_p_c->get_hash_fn(),
+			  m_p_c->get_eq_fn(),
+			  m_p_c->get_comb_probe_fn());
+	  break;
+        case 9:
+	  p_c = new Cntnr(m_p_c->begin(),
+			  m_p_c->end(),
+			  m_p_c->get_hash_fn(),
+			  m_p_c->get_eq_fn(),
+			  m_p_c->get_comb_probe_fn());
+	  break;
+        case 10:
+	  p_c = new Cntnr(m_p_c->begin(),
+			  m_p_c->end(),
+			  m_p_c->get_hash_fn(),
+			  m_p_c->get_eq_fn(),
+			  m_p_c->get_comb_probe_fn(),
+			  m_p_c->get_probe_fn());
+	  break;
+        case 11:
+	  p_c = new Cntnr(m_p_c->begin(),
+			  m_p_c->end(),
+			  m_p_c->get_hash_fn(),
+			  m_p_c->get_eq_fn(),
+			  m_p_c->get_comb_probe_fn(),
+			  m_p_c->get_probe_fn(),
+			  m_p_c->get_resize_policy());
+	  break;
+        default:
+	  PB_DS_THROW_IF_FAILED(                    false,  "",  m_p_c, & m_native_c);
+        };
+
+      std::swap(p_c, m_p_c);
+    }
+  catch(forced_exception& )
+    {
+      done = false;
+    }
+
+  delete p_c;
+
+  PB_DS_COND_COMPARE(*m_p_c, m_native_c);
+
+  return (done);
+}
+
+PB_DS_CLASS_T_DEC
+bool
+PB_DS_CLASS_C_DEC::
+it_constructor_imp(pb_ds::tree_tag)
+{
+  bool done = true;
+
+  Cntnr* p_c = NULL;
+
+  m_alloc.set_throw_prob(m_tp);
+
+  typename alloc_t::group_throw_prob_adjustor
+    adjust(m_p_c->size());
+
+  try
+    {
+      switch(get_next_sub_op(2))
+        {
+        case 0:
+	  p_c = new Cntnr(m_p_c->get_cmp_fn());
+	  m_native_c.clear();
+	  break;
+        case 1:
+	  p_c = new Cntnr(m_p_c->begin(),
+			  m_p_c->end(),
+			  m_p_c->get_cmp_fn());
+	  break;
+        default:
+	  PB_DS_THROW_IF_FAILED(                false,  "",  m_p_c, & m_native_c);
+        };
+
+      std::swap(p_c, m_p_c);
+    }
+  catch(forced_exception& )
+    {
+      done = false;
+    }
+
+  delete p_c;
+
+  PB_DS_COND_COMPARE(*m_p_c, m_native_c);
+
+  return (done);
+}
+
+PB_DS_CLASS_T_DEC
+bool
+PB_DS_CLASS_C_DEC::
+it_constructor_imp(pb_ds::list_update_tag)
+{
+  bool done = true;
+
+  Cntnr* p_c = NULL;
+
+  m_alloc.set_throw_prob(m_tp);
+
+  typename alloc_t::group_throw_prob_adjustor
+    adjust(m_p_c->size());
+
+  try
+    {
+      p_c = new Cntnr(m_p_c->begin(),
+		      m_p_c->end());
+
+      std::swap(p_c, m_p_c);
+    }
+  catch(forced_exception& )
+    {
+      done = false;
+    }
+
+  delete p_c;
+
+  PB_DS_COND_COMPARE(*m_p_c, m_native_c);
+
+  return (done);
+}
+
+PB_DS_CLASS_T_DEC
+bool
+PB_DS_CLASS_C_DEC::
+it_constructor_imp(pb_ds::pat_trie_tag)
+{
+  bool done = true;
+
+  Cntnr* p_c = NULL;
+
+  m_alloc.set_throw_prob(m_tp);
+
+  typename alloc_t::group_throw_prob_adjustor
+    adjust(m_p_c->size());
+
+  try
+    {
+      switch(get_next_sub_op(2))
+        {
+        case 0:
+	  p_c = new Cntnr(m_p_c->get_e_access_traits());
+	  m_native_c.clear();
+	  break;
+        case 1:
+	  p_c = new Cntnr(m_p_c->begin(),
+			  m_p_c->end(),
+			  m_p_c->get_e_access_traits());
+	  break;
+        default:
+	  PB_DS_THROW_IF_FAILED(                    false,  "",  m_p_c, & m_native_c);
+        };
+
+      std::swap(p_c, m_p_c);
+    }
+  catch(forced_exception& )
+    {
+      done = false;
+    }
+
+  delete p_c;
+
+  PB_DS_COND_COMPARE(*m_p_c, m_native_c);
+
+  return (done);
+}
+
diff --git a/libstdc++-v3/testsuite/util/regression/rand/assoc/detail/defs_fn_imps.hpp b/libstdc++-v3/testsuite/util/regression/rand/assoc/detail/defs_fn_imps.hpp
new file mode 100644
index 00000000000..68829d3e187
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/regression/rand/assoc/detail/defs_fn_imps.hpp
@@ -0,0 +1,248 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file defs_fn_imps.hpp
+ * Containsert a random regression test for a specific container type.
+ */
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+defs()
+{
+  // General container types.
+
+  typedef typename Cntnr::size_type test_size_type;
+
+  typedef typename Cntnr::difference_type difference_type;
+
+  key_defs();
+
+  mapped_defs();
+
+  value_defs();
+
+  iterator_defs();
+
+  node_iterator_defs(pb_ds::detail::integral_constant<int,
+		     container_traits::order_preserving>());
+
+  policy_defs();
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+key_defs()
+{
+  typedef typename Cntnr::key_type test_key_type;
+
+  typedef typename Cntnr::key_reference test_key_reference;
+
+  typedef typename Cntnr::const_key_reference test_const_key_reference;
+
+  typedef typename Cntnr::key_pointer test_key_pointer;
+
+  typedef typename Cntnr::const_key_pointer test_const_key_pointer;
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+mapped_defs()
+{
+  typedef typename Cntnr::mapped_type test_mapped_type;
+
+  typedef typename Cntnr::mapped_reference test_mapped_reference;
+
+  typedef
+    typename Cntnr::const_mapped_reference
+    test_const_mapped_reference;
+
+  typedef typename Cntnr::mapped_pointer test_mapped_pointer;
+
+  typedef typename Cntnr::const_mapped_pointer test_const_mapped_pointer;
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+value_defs()
+{
+  typedef typename Cntnr::value_type test_value_type;
+
+  typedef typename Cntnr::reference test_reference;
+
+  typedef typename Cntnr::const_reference test_const_reference;
+
+  typedef typename Cntnr::pointer test_pointer;
+
+  typedef typename Cntnr::const_pointer test_const_pointer;
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+ds_defs()
+{
+  typedef pb_ds::container_traits< Cntnr> test_container_traits;
+
+  typedef typename test_container_traits::container_category test_container_category;
+
+  typedef
+    typename test_container_traits::invalidation_guarantee
+    test_invalidation_guarantee;
+
+  enum
+    {
+      test_order_preserving =
+      test_container_traits::order_preserving
+    };
+
+  enum
+    {
+      test_erase_can_throw =
+      test_container_traits::erase_can_throw
+    };
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+iterator_defs()
+{
+  typedef typename Cntnr::point_iterator test_point_iterator;
+
+  typedef typename Cntnr::const_point_iterator const_test_point_iterator;
+
+  typedef typename Cntnr::iterator test_iterator;
+
+  typedef typename Cntnr::const_iterator const_test_iterator;
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+node_iterator_defs(pb_ds::detail::false_type)
+{ }
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+node_iterator_defs(pb_ds::detail::true_type)
+{
+  typedef typename Cntnr::node_iterator test_node_iterator;
+
+  typedef typename Cntnr::const_node_iterator test_const_node_iterator;
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+policy_defs()
+{
+  typedef typename Cntnr::allocator test_allocator;
+
+  policy_defs(typename Cntnr::container_category());
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+policy_defs(pb_ds::basic_hash_tag)
+{
+  typedef typename Cntnr::hash_fn test_hash_fn;
+
+  typedef typename Cntnr::eq_fn test_eq_fn;
+
+  typedef typename Cntnr::resize_policy test_resize_policy;
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+policy_defs(pb_ds::cc_hash_tag)
+{
+  policy_defs(pb_ds::basic_hash_tag());
+
+  typedef typename Cntnr::comb_hash_fn test_comb_hash_fn;
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+policy_defs(pb_ds::gp_hash_tag)
+{
+  policy_defs(pb_ds::basic_hash_tag());
+
+  typedef typename Cntnr::comb_probe_fn test_comb_probe_fn;
+
+  typedef typename Cntnr::probe_fn test_probe_fn;
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+policy_defs(pb_ds::tree_tag)
+{
+  typedef typename Cntnr::cmp_fn test_cmp_fn;
+
+  typedef typename Cntnr::node_update test_node_update;
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+policy_defs(pb_ds::list_update_tag)
+{
+  typedef typename Cntnr::eq_fn test_eq_fn;
+
+  typedef typename Cntnr::update_policy test_update_policy;
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+policy_defs(pb_ds::pat_trie_tag)
+{
+  typedef typename Cntnr::e_access_traits e_access_traits;
+}
diff --git a/libstdc++-v3/testsuite/util/regression/rand/assoc/detail/diagnostic_fn_imps.hpp b/libstdc++-v3/testsuite/util/regression/rand/assoc/detail/diagnostic_fn_imps.hpp
new file mode 100644
index 00000000000..0a16482d3a1
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/regression/rand/assoc/detail/diagnostic_fn_imps.hpp
@@ -0,0 +1,79 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file diagnostic_fn_imps.hpp
+ * Containsert a random regression test for a specific container type.
+ */
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+print_container(const native_type& r_cnt, std::ostream& r_os /*= std::cerr*/) const
+{
+  m_alloc.set_throw_prob(0);
+
+  typename native_type::const_iterator it = r_cnt.begin();
+
+  while (it != r_cnt.end())
+    {
+      r_os << test_traits::val_to_string(*it) + "\n";
+
+      ++it;
+    }
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+print_container(const cntnr& r_cnt, std::ostream& r_os /*= std::cerr*/) const
+{
+  m_alloc.set_throw_prob(0);
+
+  typename cntnr::const_iterator it = r_cnt.begin();
+
+  while (it != r_cnt.end())
+    {
+      r_os << test_traits::val_to_string(*it) + "\n";
+
+      ++it;
+    }
+}
diff --git a/libstdc++-v3/testsuite/util/regression/rand/assoc/detail/erase_fn_imps.hpp b/libstdc++-v3/testsuite/util/regression/rand/assoc/detail/erase_fn_imps.hpp
new file mode 100644
index 00000000000..0b2a62c0ecd
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/regression/rand/assoc/detail/erase_fn_imps.hpp
@@ -0,0 +1,319 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file erase_fn_imps.hpp
+ * Containsert a random regression test for a specific container type.
+ */
+
+PB_DS_CLASS_T_DEC
+bool
+PB_DS_CLASS_C_DEC::
+erase()
+{
+  PB_DS_TRACE("erase");
+
+  bool done = true;
+
+  PB_DS_SET_DESTRUCT_PRINT
+
+    m_alloc.set_throw_prob(0);
+
+  const key_type k =
+    test_traits::generate_key(m_g, m_m);
+
+  m_alloc.set_throw_prob(m_tp);
+
+  try
+    {
+      const bool cntnd = m_p_c->find(k) != m_p_c->end();
+
+      PB_DS_THROW_IF_FAILED(
+			    cntnd ==(m_native_c.find(test_traits::native_key(k)) != m_native_c.end()),
+			    test_traits::key_to_string(k),
+			    m_p_c,
+			    & m_native_c);
+
+      const bool ersd = m_p_c->erase(k);
+
+      const bool native_ersd =
+	m_native_c.erase(test_traits::native_key(k)) != 0;
+
+      PB_DS_THROW_IF_FAILED(
+			    ersd == native_ersd,
+			    ersd << " " << native_ersd,
+			    m_p_c,
+			    & m_native_c);
+
+      PB_DS_THROW_IF_FAILED(
+			    m_p_c->find(k) == m_p_c->end(),
+			    "",
+			    m_p_c,
+			    & m_native_c);
+    }
+  catch(forced_exception& )
+    {
+      done = false;
+
+      PB_DS_THROW_IF_FAILED(            container_traits::erase_can_throw, container_traits::erase_can_throw, m_p_c, & m_native_c);
+    }
+
+  PB_DS_COND_COMPARE(*m_p_c, m_native_c);
+
+  PB_DS_CANCEL_DESTRUCT_PRINT
+
+    return (done);
+}
+
+PB_DS_CLASS_T_DEC
+bool
+PB_DS_CLASS_C_DEC::
+erase_if()
+{
+  PB_DS_TRACE("erase_if");
+
+  bool done = true;
+
+  PB_DS_SET_DESTRUCT_PRINT
+
+    try
+      {
+        typedef
+	  typename std::iterator_traits<
+	  typename cntnr::iterator>::reference
+	  it_const_reference;
+
+        typedef
+	  typename test_traits::template erase_if_fn<
+	  value_type>
+	  erase_if_fn_t;
+
+        m_alloc.set_throw_prob(m_tp);
+
+        const size_t ersd =
+	  m_p_c->erase_if(erase_if_fn_t());
+
+        const size_t native_ersd =
+	  test_traits::erase_if(m_native_c);
+
+        PB_DS_THROW_IF_FAILED(
+			      ersd == native_ersd,
+			      static_cast<unsigned long>(ersd) << " " <<
+			      static_cast<unsigned long>(native_ersd),
+			      m_p_c,
+			      & m_native_c);
+      }
+    catch(forced_exception& )
+      {
+        done = false;
+
+        PB_DS_THROW_IF_FAILED(            container_traits::erase_can_throw, container_traits::erase_can_throw, m_p_c, & m_native_c);
+      }
+
+  PB_DS_COND_COMPARE(*m_p_c, m_native_c);
+
+  PB_DS_CANCEL_DESTRUCT_PRINT
+
+    return (done);
+}
+
+PB_DS_CLASS_T_DEC
+bool
+PB_DS_CLASS_C_DEC::
+erase_it()
+{
+  enum
+    {
+      erase_iterators =
+      container_traits::order_preserving
+    };
+
+  return (erase_it_imp(pb_ds::detail::integral_constant<int,erase_iterators>()));
+}
+
+PB_DS_CLASS_T_DEC
+bool
+PB_DS_CLASS_C_DEC::
+erase_it_imp(pb_ds::detail::false_type)
+{
+  return (true);
+}
+
+PB_DS_CLASS_T_DEC
+bool
+PB_DS_CLASS_C_DEC::
+erase_it_imp(pb_ds::detail::true_type)
+{
+  PB_DS_TRACE("erase_it");
+
+  bool done = true;
+
+  PB_DS_SET_DESTRUCT_PRINT
+
+    try
+      {
+        m_alloc.set_throw_prob(0);
+
+        const key_type k =
+	  test_traits::generate_key(m_g, m_m);
+
+        m_alloc.set_throw_prob(m_tp);
+
+        typename cntnr::iterator found_it = m_p_c->find(k);
+
+        typename native_type::iterator native_it = m_native_c.find(
+								   test_traits::native_key(k));
+
+        const bool found = found_it != m_p_c->end();
+        const bool native_found = native_it != m_native_c.end();
+
+        PB_DS_THROW_IF_FAILED(
+			      found == native_found,
+			      found << " " <<    native_found,
+			      m_p_c,
+			      & m_native_c);
+
+        typename cntnr::const_iterator next_it = found_it;
+        if (next_it != m_p_c->end())
+	  ++next_it;
+
+        typename cntnr::iterator next_ers_it =
+	  m_p_c->erase(found_it);
+
+        if (native_it != m_native_c.end())
+	  m_native_c.erase(native_it);
+
+        bool range_guarantee =
+	  pb_ds::detail::is_same<
+	  typename container_traits::invalidation_guarantee,
+	  pb_ds::range_invalidation_guarantee>::value ;
+
+        if (range_guarantee)
+	  PB_DS_THROW_IF_FAILED(                next_ers_it == next_it,  "",  m_p_c, & m_native_c);
+      }
+    catch(forced_exception& )
+      {
+        done = false;
+
+        PB_DS_THROW_IF_FAILED(            container_traits::erase_can_throw, container_traits::erase_can_throw, m_p_c, & m_native_c);
+      }
+
+  PB_DS_COND_COMPARE(*m_p_c, m_native_c);
+
+  PB_DS_CANCEL_DESTRUCT_PRINT
+
+    return (done);
+}
+
+PB_DS_CLASS_T_DEC
+bool
+PB_DS_CLASS_C_DEC::
+erase_rev_it()
+{
+  enum
+    {
+      erase_iterators =
+      container_traits::order_preserving&& 
+      container_traits::reverse_iteration
+    };
+
+  return (erase_rev_it_imp(pb_ds::detail::integral_constant<int,erase_iterators>()));
+}
+
+PB_DS_CLASS_T_DEC
+bool
+PB_DS_CLASS_C_DEC::
+erase_rev_it_imp(pb_ds::detail::false_type)
+{
+  return (true);
+}
+
+PB_DS_CLASS_T_DEC
+bool
+PB_DS_CLASS_C_DEC::
+erase_rev_it_imp(pb_ds::detail::true_type)
+{
+  PB_DS_TRACE("erase_rev_it");
+
+  bool done = true;
+
+  PB_DS_SET_DESTRUCT_PRINT
+
+    try
+      {
+        m_alloc.set_throw_prob(0);
+
+        const key_type k =
+	  test_traits::generate_key(m_g, m_m);
+
+        m_alloc.set_throw_prob(m_tp);
+
+        typename cntnr::iterator found_it = m_p_c->find(k);
+
+        typename native_type::iterator native_it = m_native_c.find(
+								   test_traits::native_key(k));
+
+        typename cntnr::const_reverse_iterator next_it = found_it;
+        if (next_it != m_p_c->end())
+	  ++next_it;
+
+        typename cntnr::reverse_iterator next_ers_it =
+	  m_p_c->erase((typename cntnr::reverse_iterator)found_it);
+
+        PB_DS_THROW_IF_FAILED(            next_ers_it == next_it, "", m_p_c, & m_native_c);
+
+        if (native_it != m_native_c.end())
+	  m_native_c.erase(native_it);
+      }
+    catch(forced_exception& )
+      {
+        done = false;
+
+        PB_DS_THROW_IF_FAILED(            container_traits::erase_can_throw, container_traits::erase_can_throw, m_p_c, & m_native_c);
+      }
+
+  PB_DS_COND_COMPARE(*m_p_c, m_native_c);
+
+  PB_DS_CANCEL_DESTRUCT_PRINT
+
+    return (done);
+}
+
diff --git a/libstdc++-v3/testsuite/util/regression/rand/assoc/detail/get_set_load_fn_imps.hpp b/libstdc++-v3/testsuite/util/regression/rand/assoc/detail/get_set_load_fn_imps.hpp
new file mode 100644
index 00000000000..8f58f3e2c46
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/regression/rand/assoc/detail/get_set_load_fn_imps.hpp
@@ -0,0 +1,102 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file get_set_load_fn_imps.hpp
+ * Containsert a random regression test for a specific container type.
+ */
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+get_set_load()
+{
+  typedef
+    pb_ds::detail::integral_constant<int,
+    test_traits::get_set_load>
+    get_set_load_ind;
+
+  get_set_load_imp(get_set_load_ind());
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+get_set_load_imp(pb_ds::detail::false_type)
+{ }
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+get_set_load_imp(pb_ds::detail::true_type)
+{
+  PB_DS_TRACE("get_set_load");
+
+  PB_DS_SET_DESTRUCT_PRINT
+
+    m_p_c->get_load();
+
+  m_alloc.set_throw_prob(1);
+
+  typename alloc_t::group_throw_prob_adjustor adjust(
+						     m_p_c->size());
+
+  const float min_load = static_cast<float>(0.05);
+  const float max_load = static_cast<float>(0.9);
+
+  const float new_load =
+    static_cast<float>(
+		       m_g.get_prob()*  (max_load - min_load) +
+		       min_load);
+
+  m_p_c->set_load(new_load);
+
+  PB_DS_THROW_IF_FAILED(
+			m_p_c->get_load() == new_load,
+			"",
+			m_p_c,
+			& m_native_c);
+
+  PB_DS_COND_COMPARE(*m_p_c, m_native_c);
+
+  PB_DS_CANCEL_DESTRUCT_PRINT
+    }
+
diff --git a/libstdc++-v3/testsuite/util/regression/rand/assoc/detail/get_set_loads_fn_imps.hpp b/libstdc++-v3/testsuite/util/regression/rand/assoc/detail/get_set_loads_fn_imps.hpp
new file mode 100644
index 00000000000..cbcac81c631
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/regression/rand/assoc/detail/get_set_loads_fn_imps.hpp
@@ -0,0 +1,122 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file get_set_loads_fn_imps.hpp
+ * Containsert a random regression test for a specific container type.
+ */
+
+PB_DS_CLASS_T_DEC
+bool
+PB_DS_CLASS_C_DEC::
+get_set_loads()
+{
+  typedef
+    pb_ds::detail::integral_constant<int,
+    test_traits::get_set_loads>
+    get_set_loads_ind;
+
+  return (get_set_loads_imp(get_set_loads_ind()));
+}
+
+PB_DS_CLASS_T_DEC
+bool
+PB_DS_CLASS_C_DEC::
+get_set_loads_imp(pb_ds::detail::false_type)
+{
+  return (true);
+}
+
+PB_DS_CLASS_T_DEC
+bool
+PB_DS_CLASS_C_DEC::
+get_set_loads_imp(pb_ds::detail::true_type)
+{
+  PB_DS_TRACE("get_set_loads");
+
+  bool done = true;
+
+  PB_DS_SET_DESTRUCT_PRINT
+
+    const std::pair<float, float> old_loads =
+    m_p_c->get_loads();
+
+  try
+    {
+      m_alloc.set_throw_prob(m_tp);
+
+      typename alloc_t::group_throw_prob_adjustor adjust(
+							 m_p_c->size());
+
+      const float min_min_load = static_cast<float>(0.05);
+      const float max_min_load = static_cast<float>(0.2);
+
+      const float new_min_load =
+	static_cast<float>(
+			   m_g.get_prob()*  (max_min_load - min_min_load) +
+			   min_min_load);
+
+      const float new_max_load = static_cast<float>(new_min_load*  2.5);
+
+      PB_DS_THROW_IF_FAILED(            new_max_load < 1, new_max_load, m_p_c, & m_native_c);
+
+      m_p_c->set_loads(
+		       std::make_pair(                new_min_load,  new_max_load));
+    }
+  catch(...)
+    {
+      PB_DS_THROW_IF_FAILED(
+			    old_loads == m_p_c->get_loads(),
+			    old_loads.first << " " << old_loads.second << " " <<
+			    m_p_c->get_loads().first << " " <<
+			    m_p_c->get_loads().second,
+			    m_p_c,
+			    & m_native_c);
+
+      done = false;
+    }
+
+  PB_DS_COND_COMPARE(*m_p_c, m_native_c);
+
+  PB_DS_CANCEL_DESTRUCT_PRINT
+
+    return (done);
+}
diff --git a/libstdc++-v3/testsuite/util/regression/rand/assoc/detail/insert_fn_imps.hpp b/libstdc++-v3/testsuite/util/regression/rand/assoc/detail/insert_fn_imps.hpp
new file mode 100644
index 00000000000..262b28ba2cf
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/regression/rand/assoc/detail/insert_fn_imps.hpp
@@ -0,0 +1,89 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file insert_fn_imps.hpp
+ * Containsert a random regression test for a specific container type.
+ */
+
+PB_DS_CLASS_T_DEC
+bool
+PB_DS_CLASS_C_DEC::
+insert()
+{
+  PB_DS_TRACE("insert");
+  bool done = true;
+  PB_DS_SET_DESTRUCT_PRINT
+    try
+      {
+        m_alloc.set_throw_prob(0);
+        value_type v = test_traits::generate_value(m_g, m_m);
+        m_alloc.set_throw_prob(m_tp);
+        const_key_reference r_k = test_traits::extract_key(v);
+        typename cntnr::const_point_iterator found_it = m_p_c->find(r_k);
+        const bool existed = (found_it != m_p_c->end());
+        const std::pair<typename cntnr::point_iterator, bool> ins_ret = m_p_c->insert(v);
+
+        if (ins_ret.second)
+	  {
+            PB_DS_THROW_IF_FAILED(!existed, "", m_p_c, & m_native_c);
+	  }
+        else
+	  {
+            PB_DS_THROW_IF_FAILED(existed, "", m_p_c, & m_native_c);
+            PB_DS_THROW_IF_FAILED(found_it == ins_ret.first, "", m_p_c, & m_native_c);
+	  }
+        m_native_c.insert(test_traits::native_value(v));
+      }
+    catch(forced_exception& )
+      {
+        done = false;
+      }
+    catch(pb_ds::insert_error& )
+      {
+        PB_DS_THROW_IF_FAILED(false, "", m_p_c, & m_native_c);
+      }
+
+  PB_DS_COND_COMPARE(*m_p_c, m_native_c);
+  PB_DS_CANCEL_DESTRUCT_PRINT
+    return (done);
+}
+
diff --git a/libstdc++-v3/testsuite/util/regression/rand/assoc/detail/it_conversion_fn_imps.hpp b/libstdc++-v3/testsuite/util/regression/rand/assoc/detail/it_conversion_fn_imps.hpp
new file mode 100644
index 00000000000..14d89e1ebf9
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/regression/rand/assoc/detail/it_conversion_fn_imps.hpp
@@ -0,0 +1,307 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file it_conversion_fn_imps.hpp
+ * Containsert a random regression test for a specific container type.
+ */
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+it_copy()
+{
+  {
+    typename cntnr::iterator it = m_p_c->end();
+
+    typename cntnr::const_iterator const_it(it);
+
+    PB_DS_THROW_IF_FAILED(            const_it == it, "", m_p_c, & m_native_c);
+
+    PB_DS_THROW_IF_FAILED(
+			  !(const_it != it),
+			  "",
+			  m_p_c,
+			  & m_native_c);
+
+    typename cntnr::const_point_iterator const_find_it(it);
+
+    PB_DS_THROW_IF_FAILED(            const_find_it == it, "", m_p_c, & m_native_c);
+
+    PB_DS_THROW_IF_FAILED(
+			  !(const_find_it != it),
+			  "",
+			  m_p_c,
+			  & m_native_c);
+
+    typename cntnr::point_iterator find_it(it);
+
+    PB_DS_THROW_IF_FAILED(            find_it == it, "", m_p_c, & m_native_c);
+
+    PB_DS_THROW_IF_FAILED(
+			  !(find_it != it),
+			  "",
+			  m_p_c,
+			  & m_native_c);
+  }
+
+  {
+    typename cntnr::const_iterator const_it = m_p_c->end();
+
+    typename cntnr::const_point_iterator const_find_it(const_it);
+
+    PB_DS_THROW_IF_FAILED(            const_find_it == const_it, "", m_p_c, & m_native_c);
+
+    PB_DS_THROW_IF_FAILED(
+			  !(const_find_it != const_it),
+			  "",
+			  m_p_c,
+			  & m_native_c);
+  }
+
+  {
+    typename cntnr::point_iterator find_it = m_p_c->end();
+
+    typename cntnr::const_point_iterator const_find_it(find_it);
+
+    PB_DS_THROW_IF_FAILED(            find_it == const_find_it, "", m_p_c, & m_native_c);
+
+    PB_DS_THROW_IF_FAILED(
+			  !(find_it != const_find_it),
+			  "",
+			  m_p_c,
+			  & m_native_c);
+  }
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+it_assign()
+{
+  {
+    typename cntnr::iterator it = m_p_c->end();
+
+    typename cntnr::const_iterator const_it;
+    const_it = it;
+
+    PB_DS_THROW_IF_FAILED(            const_it == it, "", m_p_c, & m_native_c);
+
+    PB_DS_THROW_IF_FAILED(
+			  !(const_it != it),
+			  "",
+			  m_p_c,
+			  & m_native_c);
+
+    typename cntnr::const_point_iterator const_find_it;
+    const_find_it = it;
+
+    PB_DS_THROW_IF_FAILED(            const_find_it == it, "", m_p_c, & m_native_c);
+
+    PB_DS_THROW_IF_FAILED(
+			  !(const_find_it != it),
+			  "",
+			  m_p_c,
+			  & m_native_c);
+
+    typename cntnr::point_iterator find_it;
+    find_it = it;
+
+    PB_DS_THROW_IF_FAILED(            find_it == it, "", m_p_c, & m_native_c);
+
+    PB_DS_THROW_IF_FAILED(
+			  !(find_it != it),
+			  "",
+			  m_p_c,
+			  & m_native_c);
+  }
+
+  {
+    typename cntnr::const_iterator const_it = m_p_c->end();
+
+    typename cntnr::const_point_iterator const_find_it;
+    const_find_it = const_it;
+
+    PB_DS_THROW_IF_FAILED(            const_find_it == const_it, "", m_p_c, & m_native_c);
+
+    PB_DS_THROW_IF_FAILED(
+			  !(const_find_it != const_it),
+			  "",
+			  m_p_c,
+			  & m_native_c);
+  }
+
+  {
+    typename cntnr::point_iterator find_it = m_p_c->end();
+
+    typename cntnr::const_point_iterator const_find_it;
+    const_find_it = find_it;
+
+    PB_DS_THROW_IF_FAILED(            find_it == const_find_it, "", m_p_c, & m_native_c);
+
+    PB_DS_THROW_IF_FAILED(
+			  !(find_it != const_find_it),
+			  "",
+			  m_p_c,
+			  & m_native_c);
+  }
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+rev_it_copy()
+{
+  enum
+    {
+      reverse_iteration = container_traits::reverse_iteration
+    };
+
+  rev_it_copy_imp(pb_ds::detail::integral_constant<int,reverse_iteration>());
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+rev_it_assign()
+{
+  enum
+    {
+      reverse_iteration = container_traits::reverse_iteration
+    };
+
+  rev_it_assign_imp(pb_ds::detail::integral_constant<int,reverse_iteration>());
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+rev_it_copy_imp(pb_ds::detail::false_type)
+{ }
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+rev_it_copy_imp(pb_ds::detail::true_type)
+{
+  {
+    typename cntnr::iterator it = m_p_c->end();
+
+    typename cntnr::const_reverse_iterator const_it(it);
+
+    PB_DS_THROW_IF_FAILED(            const_it == it, "", m_p_c, & m_native_c);
+
+    PB_DS_THROW_IF_FAILED(
+			  !(const_it != it),
+			  "",
+			  m_p_c,
+			  & m_native_c);
+
+    typename cntnr::const_point_iterator const_find_it(it);
+
+    PB_DS_THROW_IF_FAILED(            const_find_it == it, "", m_p_c, & m_native_c);
+
+    PB_DS_THROW_IF_FAILED(
+			  !(const_find_it != it),
+			  "",
+			  m_p_c,
+			  & m_native_c);
+
+    typename cntnr::point_iterator find_it(it);
+
+    PB_DS_THROW_IF_FAILED(            find_it == it, "", m_p_c, & m_native_c);
+
+    PB_DS_THROW_IF_FAILED(
+			  !(find_it != it),
+			  "",
+			  m_p_c,
+			  & m_native_c);
+  }
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+rev_it_assign_imp(pb_ds::detail::false_type)
+{ }
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+rev_it_assign_imp(pb_ds::detail::true_type)
+{
+  {
+    typename cntnr::iterator it = m_p_c->end();
+
+    typename cntnr::const_reverse_iterator const_it;
+    const_it = it;
+
+    PB_DS_THROW_IF_FAILED(            const_it == it, "", m_p_c, & m_native_c);
+
+    PB_DS_THROW_IF_FAILED(
+			  !(const_it != it),
+			  "",
+			  m_p_c,
+			  & m_native_c);
+
+    typename cntnr::const_point_iterator const_find_it;
+    const_find_it = it;
+
+    PB_DS_THROW_IF_FAILED(            const_find_it == it, "", m_p_c, & m_native_c);
+
+    PB_DS_THROW_IF_FAILED(
+			  !(const_find_it != it),
+			  "",
+			  m_p_c,
+			  & m_native_c);
+
+    typename cntnr::point_iterator find_it;
+    find_it = it;
+
+    PB_DS_THROW_IF_FAILED(            find_it == it, "", m_p_c, & m_native_c);
+
+    PB_DS_THROW_IF_FAILED(
+			  !(find_it != it),
+			  "",
+			  m_p_c,
+			  & m_native_c);
+  }
+}
diff --git a/libstdc++-v3/testsuite/util/regression/rand/assoc/detail/operator_fn_imps.hpp b/libstdc++-v3/testsuite/util/regression/rand/assoc/detail/operator_fn_imps.hpp
new file mode 100644
index 00000000000..34df60ec294
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/regression/rand/assoc/detail/operator_fn_imps.hpp
@@ -0,0 +1,249 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file operator_fn_imps.hpp
+ * Containsert a random regression test for a specific container type.
+ */
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+operator()()
+{
+  xml_result_set_regression_formatter* p_fmt = NULL;
+
+  if (m_disp)
+    p_fmt = new xml_result_set_regression_formatter(
+						    string_form<Cntnr>::name(),
+						    string_form<Cntnr>::desc());
+
+  m_g.init(m_seed);
+  m_alloc.init(m_seed);
+
+  prog_bar pb(m_n, std::cout, m_disp);
+
+  m_i = 0;
+
+  try
+    {
+      for (m_i = 0; m_i < m_n; ++m_i)
+        {
+	  PB_DS_TRACE("Op #" << static_cast<unsigned long>(m_i));
+
+	  allocator::set_label(m_i);
+
+	  switch(m_i)
+            {
+            case 0:
+	      PB_DS_RUN_MTHD(default_constructor);
+	      break;
+            case 1:
+	      defs();
+	      break;
+            case 2:
+	      policy_access();
+	      break;
+            case 3:
+	      it_copy();
+	      break;
+            case 4:
+	      it_assign();
+	      break;
+            case 5:
+	      rev_it_copy();
+	      break;
+            case 6:
+	      rev_it_assign();
+	      break;
+            default:
+	      switch(get_next_op())
+                {
+                case insert_op:
+		  switch(get_next_sub_op(2))
+                    {
+                    case 0:
+		      PB_DS_RUN_MTHD(insert)
+                        break;
+                    case 1:
+		      PB_DS_RUN_MTHD(subscript)
+                        break;
+                    default:
+		      PB_DS_THROW_IF_FAILED(                            false,       "",       m_p_c,      & m_native_c);
+                    }
+		  break;
+                case erase_op:
+		  switch(get_next_sub_op(4))
+                    {
+                    case 0:
+		      PB_DS_RUN_MTHD(erase)
+                        break;
+                    case 1:
+		      PB_DS_RUN_MTHD(erase_if)
+                        break;
+                    case 2:
+		      PB_DS_RUN_MTHD(erase_it)
+                        break;
+                    case 3:
+		      PB_DS_RUN_MTHD(erase_rev_it)
+                        break;
+                    default:
+		      PB_DS_THROW_IF_FAILED(                            false,       "",       m_p_c,      & m_native_c);
+                    }
+		  break;
+                case clear_op:
+		  PB_DS_RUN_MTHD(clear)
+                    break;
+                case other_op:
+		  switch(get_next_sub_op(8))
+                    {
+                    case 0:
+		      swap();
+		      break;
+                    case 1:
+		      PB_DS_RUN_MTHD(copy_constructor)
+                        break;
+                    case 2:
+		      PB_DS_RUN_MTHD(it_constructor)
+                        break;
+                    case 3:
+		      PB_DS_RUN_MTHD(assignment_operator)
+                        break;
+                    case 4:
+		      PB_DS_RUN_MTHD(split_join)
+                        break;
+                    case 5:
+		      resize();
+		      break;
+                    case 6:
+		      get_set_load();
+		      break;
+                    case 7:
+		      get_set_loads();
+		      break;
+                    default:
+		      PB_DS_THROW_IF_FAILED(                            false,       "",       m_p_c,      & m_native_c);
+                    }
+		  break;
+                default:
+		  PB_DS_THROW_IF_FAILED(                        false,   "",   m_p_c,  & m_native_c);
+                };
+            }
+
+	  pb.inc();
+        }
+    }
+  catch(...)
+    {
+      std::cerr << "Failed at index " << static_cast<unsigned long>(m_i) <<
+	std::endl;
+
+      delete m_p_c;
+
+      throw;
+    }
+
+  delete m_p_c;
+
+  if (!m_alloc.dbg_ex_allocator<char>::empty())
+    {
+      std::cerr << "detected leaks!" << std::endl;
+
+      std::cerr << m_alloc << std::endl;
+
+      PB_DS_THROW_IF_FAILED(            false, "", m_p_c, & m_native_c);
+    }
+
+  if (m_disp)
+    {
+      std::cout << std::endl;
+
+      delete p_fmt;
+    }
+}
+
+PB_DS_CLASS_T_DEC
+typename PB_DS_CLASS_C_DEC::op
+PB_DS_CLASS_C_DEC::
+get_next_op()
+{
+  const double prob = m_g.get_prob();
+
+  if (prob < m_ip)
+    return (insert_op);
+
+  if (prob < m_ip + m_ep)
+    return (erase_op);
+
+  if (prob < m_ip + m_ep + m_cp)
+    return (clear_op);
+
+  PB_DS_THROW_IF_FAILED(        prob <= 1, prob, m_p_c,    & m_native_c);
+
+  return (other_op);
+}
+
+PB_DS_CLASS_T_DEC
+size_t
+PB_DS_CLASS_C_DEC::
+get_next_sub_op(size_t max)
+{
+  const double p = m_g.get_prob();
+
+  const double delta = 1 / static_cast<double>(max);
+
+  size_t i = 0;
+
+  while (true)
+    if (p <= (i + 1)*  delta)
+      {
+	PB_DS_THROW_IF_FAILED(
+			      i < max,
+			      static_cast<unsigned long>(i) << " " <<
+			      static_cast<unsigned long>(max),
+			      m_p_c,
+			      & m_native_c);
+
+	return (i);
+      }
+    else
+      ++i;
+}
diff --git a/libstdc++-v3/testsuite/util/regression/rand/assoc/detail/policy_access_fn_imps.hpp b/libstdc++-v3/testsuite/util/regression/rand/assoc/detail/policy_access_fn_imps.hpp
new file mode 100644
index 00000000000..7ffd18a77dc
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/regression/rand/assoc/detail/policy_access_fn_imps.hpp
@@ -0,0 +1,184 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file policy_access_fn_imps.hpp
+ * Containsert a random regression test for a specific container type.
+ */
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+policy_access()
+{
+  policy_access(typename Cntnr::container_category());
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+policy_access(pb_ds::basic_hash_tag)
+{
+  {
+    typename Cntnr::hash_fn& r_t =
+      m_p_c->get_hash_fn();
+
+    assert(&r_t != NULL);
+  }
+  {
+    const typename Cntnr::hash_fn& r_t =((const Cntnr& )*m_p_c).get_hash_fn();
+
+    assert(&r_t != NULL);
+  }
+
+  {
+    typename Cntnr::eq_fn& r_t =
+      m_p_c->get_eq_fn();
+
+    assert(&r_t != NULL);
+  }
+  {
+    const typename Cntnr::eq_fn& r_t =((const Cntnr& )*m_p_c).get_eq_fn();
+
+    assert(&r_t != NULL);
+  }
+
+  {
+    typename Cntnr::resize_policy& r_t =
+      m_p_c->get_resize_policy();
+
+    assert(&r_t != NULL);
+  }
+  {
+    const typename Cntnr::resize_policy& r_t =((const Cntnr& )*m_p_c).get_resize_policy();
+
+    assert(&r_t != NULL);
+  }
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+policy_access(pb_ds::cc_hash_tag)
+{
+  policy_access(pb_ds::basic_hash_tag());
+
+  {
+    typename Cntnr::comb_hash_fn& r_t =
+      m_p_c->get_comb_hash_fn();
+
+    assert(&r_t != NULL);
+  }
+  {
+    const typename Cntnr::comb_hash_fn& r_t =((const Cntnr& )*m_p_c).get_comb_hash_fn();
+
+    assert(&r_t != NULL);
+  }
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+policy_access(pb_ds::gp_hash_tag)
+{
+  policy_access(pb_ds::basic_hash_tag());
+
+  {
+    typename Cntnr::comb_probe_fn& r_t =
+      m_p_c->get_comb_probe_fn();
+
+    assert(&r_t != NULL);
+  }
+  {
+    const typename Cntnr::comb_probe_fn& r_t =((const Cntnr& )*m_p_c).get_comb_probe_fn();
+
+    assert(&r_t != NULL);
+  }
+
+  {
+    typename Cntnr::probe_fn& r_t =
+      m_p_c->get_probe_fn();
+
+    assert(&r_t != NULL);
+  }
+  {
+    const typename Cntnr::probe_fn& r_t =((const Cntnr& )*m_p_c).get_probe_fn();
+
+    assert(&r_t != NULL);
+  }
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+policy_access(pb_ds::tree_tag)
+{
+  {
+    typename Cntnr::cmp_fn& r_t =
+      m_p_c->get_cmp_fn();
+
+    assert(&r_t != NULL);
+  }
+
+  {
+    const typename Cntnr::cmp_fn& r_t =((const Cntnr& )*m_p_c).get_cmp_fn();
+
+    assert(&r_t != NULL);
+  }
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+policy_access(pb_ds::list_update_tag)
+{ }
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+policy_access(pb_ds::pat_trie_tag)
+{
+  typename Cntnr::e_access_traits& r_t =
+    m_p_c->get_e_access_traits();
+
+  assert(&r_t != NULL);
+}
+
diff --git a/libstdc++-v3/testsuite/util/regression/rand/assoc/detail/resize_fn_imps.hpp b/libstdc++-v3/testsuite/util/regression/rand/assoc/detail/resize_fn_imps.hpp
new file mode 100644
index 00000000000..6f5ee79fdd4
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/regression/rand/assoc/detail/resize_fn_imps.hpp
@@ -0,0 +1,125 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file resize_fn_imps.hpp
+ * Containsert a random regression test for a specific container type.
+ */
+
+PB_DS_CLASS_T_DEC
+bool
+PB_DS_CLASS_C_DEC::
+resize()
+{
+  typedef pb_ds::detail::integral_constant<int, test_traits::resize> resize_ind;
+
+  return (resize_imp(resize_ind()));
+}
+
+PB_DS_CLASS_T_DEC
+bool
+PB_DS_CLASS_C_DEC::
+resize_imp(pb_ds::detail::false_type)
+{
+  return (true);
+}
+
+PB_DS_CLASS_T_DEC
+bool
+PB_DS_CLASS_C_DEC::
+resize_imp(pb_ds::detail::true_type)
+{
+  PB_DS_TRACE("resize");
+
+  bool done = true;
+
+  PB_DS_SET_DESTRUCT_PRINT
+
+    const size_t old_size =
+    m_p_c->get_actual_size();
+
+  try
+    {
+      m_alloc.set_throw_prob(m_tp);
+
+      typename alloc_t::group_throw_prob_adjustor
+	adjust(m_p_c->size());
+
+      enum
+        {
+	  min_new_size = 200,
+	  max_new_size = 2000
+        };
+
+      const size_t new_size =
+	m_g.get_unsigned_long(min_new_size, max_new_size);
+
+      m_p_c->resize(new_size);
+
+      const size_t actual_new_size =
+	m_p_c->get_actual_size();
+
+      PB_DS_THROW_IF_FAILED(
+			    actual_new_size >= new_size,
+			    static_cast<unsigned long>(actual_new_size) << " " <<
+			    static_cast<unsigned long>(new_size),
+			    m_p_c,
+			    & m_native_c);
+    }
+  catch(...)
+    {
+      PB_DS_THROW_IF_FAILED(
+			    m_p_c->get_actual_size() == old_size,
+			    static_cast<unsigned long>(m_p_c->get_actual_size()) <<
+			    " " << static_cast<unsigned long>(old_size),
+			    m_p_c,
+			    & m_native_c);
+
+      done = false;
+    }
+
+  PB_DS_COND_COMPARE(*m_p_c, m_native_c);
+
+  PB_DS_CANCEL_DESTRUCT_PRINT
+
+    return (done);
+}
+
diff --git a/libstdc++-v3/testsuite/util/regression/rand/assoc/detail/split_join_fn_imps.hpp b/libstdc++-v3/testsuite/util/regression/rand/assoc/detail/split_join_fn_imps.hpp
new file mode 100644
index 00000000000..3b0da01d90d
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/regression/rand/assoc/detail/split_join_fn_imps.hpp
@@ -0,0 +1,149 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file split_join_fn_imps.hpp
+ * Containsert a random regression test for a specific container type.
+ */
+
+PB_DS_CLASS_T_DEC
+bool
+PB_DS_CLASS_C_DEC::
+split_join()
+{
+  enum
+    {
+      split_join = container_traits::order_preserving
+    };
+
+  return (split_join_imp(pb_ds::detail::integral_constant<int,split_join>()));
+}
+
+PB_DS_CLASS_T_DEC
+bool
+PB_DS_CLASS_C_DEC::
+split_join_imp(pb_ds::detail::false_type)
+{
+  return (true);
+}
+
+PB_DS_CLASS_T_DEC
+bool
+PB_DS_CLASS_C_DEC::
+split_join_imp(pb_ds::detail::true_type)
+{
+  PB_DS_TRACE("split_join");
+
+  bool done = true;
+
+  PB_DS_SET_DESTRUCT_PRINT
+
+    try
+      {
+        m_alloc.set_throw_prob(0);
+
+        Cntnr lhs(*m_p_c);
+
+        Cntnr rhs;
+
+        native_type native_lhs(m_native_c);
+
+        native_type native_rhs;
+
+        const key_type k =
+	  test_traits::generate_key(m_g, m_m);
+
+        m_alloc.set_throw_prob(m_tp);
+
+        lhs.split(k, rhs);
+
+        typename native_type::const_iterator it =
+	  native_lhs.upper_bound(test_traits::native_key(k));
+
+        while (!native_lhs.empty()&&  it != native_lhs.end())
+	  {
+            native_rhs.insert(*it);
+
+            typename native_type::const_iterator next_it = it;
+            ++next_it;
+
+            native_lhs.erase(test_traits::extract_native_key(*it));
+
+            it = next_it;
+	  }
+
+        PB_DS_COND_COMPARE(lhs, native_lhs);
+        PB_DS_COND_COMPARE(rhs, native_rhs);
+
+        m_alloc.set_throw_prob(m_tp);
+
+        if (m_g.get_prob() < 0.5)
+	  lhs.swap(rhs);
+
+        lhs.join(rhs);
+
+        PB_DS_THROW_IF_FAILED(
+			      rhs.size() == 0,
+			      static_cast<unsigned long>(rhs.size()),
+			      m_p_c,
+			      & m_native_c);
+
+        PB_DS_THROW_IF_FAILED(
+			      rhs.empty(),
+			      static_cast<unsigned long>(rhs.size()),
+			      m_p_c,
+			      & m_native_c);
+
+        m_p_c->swap(lhs);
+      }
+    catch(forced_exception& )
+      {
+        done = false;
+
+        PB_DS_THROW_IF_FAILED(            container_traits::split_join_can_throw, container_traits::split_join_can_throw, m_p_c, & m_native_c);
+      }
+
+  PB_DS_COND_COMPARE(*m_p_c, m_native_c);
+
+  PB_DS_CANCEL_DESTRUCT_PRINT
+
+    return (done);
+}
diff --git a/libstdc++-v3/testsuite/util/regression/rand/assoc/detail/subscript_fn_imps.hpp b/libstdc++-v3/testsuite/util/regression/rand/assoc/detail/subscript_fn_imps.hpp
new file mode 100644
index 00000000000..561f230054e
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/regression/rand/assoc/detail/subscript_fn_imps.hpp
@@ -0,0 +1,127 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file subscript_fn_imps.hpp
+ * Containsert a random regression test for a specific container type.
+ */
+
+PB_DS_CLASS_T_DEC
+bool
+PB_DS_CLASS_C_DEC::
+subscript()
+{
+  PB_DS_TRACE("subscript");
+
+  enum
+    {
+      no_data = pb_ds::detail::is_same<
+      typename Cntnr::const_key_reference,
+      typename Cntnr::const_reference>::value
+    };
+
+  return (subscript_imp(pb_ds::detail::integral_constant<int,no_data>()));
+}
+
+PB_DS_CLASS_T_DEC
+bool
+PB_DS_CLASS_C_DEC::
+subscript_imp(pb_ds::detail::false_type)
+{
+  bool done = true;
+
+  PB_DS_SET_DESTRUCT_PRINT
+
+    try
+      {
+        m_alloc.set_throw_prob(0);
+
+        value_type v = test_traits::generate_value(m_g, m_m);
+
+        m_alloc.set_throw_prob(m_tp);
+	(*m_p_c)[v.first] = v.second;
+
+        m_native_c[test_traits::native_value(v).first] =
+	  test_traits::native_value(v).second;
+      }
+    catch(forced_exception& )
+      {
+        done = false;
+      }
+
+  PB_DS_COND_COMPARE(*m_p_c, m_native_c);
+
+  PB_DS_CANCEL_DESTRUCT_PRINT
+
+    return (done);
+}
+
+PB_DS_CLASS_T_DEC
+bool
+PB_DS_CLASS_C_DEC::
+subscript_imp(pb_ds::detail::true_type)
+{
+  bool done = true;
+
+  PB_DS_SET_DESTRUCT_PRINT
+
+    try
+      {
+        m_alloc.set_throw_prob(0);
+
+        value_type v = test_traits::generate_value(m_g, m_m);
+
+        m_alloc.set_throw_prob(m_tp);
+	(*m_p_c)[v] = pb_ds::null_mapped_type();
+
+        m_native_c.insert(test_traits::native_value(v));
+      }
+    catch(forced_exception& )
+      {
+        done = false;
+      }
+
+  PB_DS_COND_COMPARE(*m_p_c, m_native_c);
+
+  PB_DS_CANCEL_DESTRUCT_PRINT
+
+    return (done);
+}
diff --git a/libstdc++-v3/testsuite/util/regression/rand/assoc/rand_regression_test.hpp b/libstdc++-v3/testsuite/util/regression/rand/assoc/rand_regression_test.hpp
new file mode 100644
index 00000000000..6f6bafa861b
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/regression/rand/assoc/rand_regression_test.hpp
@@ -0,0 +1,206 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file rand_regression_test.hpp
+ * Contains a random-operation test.
+ */
+
+#include <iostream>
+#include <vector>
+#include <regression/rand/assoc/container_rand_regression_test.hpp>
+#include <io/verified_cmd_line_input.hpp>
+#include <common_type/assoc/common_type.hpp>
+#include <regression/basic_type.hpp>
+#include <regression/assoc/common_type.hpp>
+
+namespace pb_ds
+{
+namespace test
+{
+namespace detail
+{
+#ifndef PB_DS_REGRESSION
+#error "Must define PB_DS_REGRESSION"
+#endif
+
+  struct rand_reg_test
+  {
+  public:
+    rand_reg_test(size_t seed, size_t n, size_t m, double tp, double ip, 
+		  double ep, double cp, double mp, bool d) 
+    : m_sd(seed), m_n(n), m_m(m), m_tp(tp), m_ip(ip), m_ep(ep), m_cp(cp), 
+      m_mp(mp), m_disp(d)
+    { }
+
+    template<typename Cntnr>
+    void
+    operator()(pb_ds::detail::type_to_type<Cntnr>)
+    {
+      unsigned long ul = static_cast<unsigned long>(m_sd);
+      container_rand_regression_test<Cntnr> t(ul, m_n, m_n, m_tp, m_ip, 
+					      m_ep, m_cp, m_mp, m_disp);
+      t();
+    }
+
+  private:
+    const size_t m_sd;
+    const size_t m_n;
+    const size_t m_m;
+    const double m_tp;
+    const double m_ip;
+    const double m_ep;
+    const double m_cp;
+    const double m_mp;
+    const bool m_disp;
+  };
+
+  void
+  usage(const std::string& r_name);
+
+  void
+  verify_params(size_t&, size_t&, size_t&, 
+		double&, double&, double&, double&, double&, bool&);
+} // namespace detail
+
+  template<typename TL>
+  int
+  rand_regression_test(size_t iter, size_t keys, const std::string name, TL tl)
+  {
+    // Sane defaults.
+    size_t n = iter;
+    size_t m = keys;
+    size_t sd = 0; // 0 = time-determined arbitrary
+    double tp = 0.2;
+    double ip = 0.6;
+    double ep = 0.2; 
+    double cp = 0.001;
+    double mp = 1;
+    bool disp = false; // show progress
+
+    try
+      {
+	detail::verify_params(sd, n, m, tp, ip, ep, cp, mp, disp);
+      }
+    catch(pb_ds::test::illegal_input_error&)
+      {
+	detail::usage(name);
+	return -1;
+      }
+    catch(...)
+      {
+	return -2;
+      };
+
+    xml_test_rand_regression_formatter* p_fmt = NULL;
+    if (sd == 0)
+      sd = twister_rand_gen::get_time_determined_seed();
+    if (disp)
+      p_fmt = new xml_test_rand_regression_formatter(sd, n, m, tp, ip, 
+						     ep, cp, mp);
+
+    try
+      {
+	detail::rand_reg_test tst(sd, n, m, tp, ip, ep, cp, mp, disp);
+	pb_ds::detail::typelist_apply(tst, tl);
+      }
+    catch(...)
+      {
+	std::cerr << "Test failed with seed " << sd << std::endl;
+	if (disp)
+	  delete p_fmt;
+	return -1;
+      }
+
+    if (disp)
+      delete p_fmt;
+    return 0;
+  }
+
+namespace detail
+{
+  void
+  usage(const std::string& name)
+  {
+    using namespace std;
+    cerr << "usage: " << name << " <sd> <n> <m> <tp> <ip> <ep> <cp> <mp> ['t' | 'f']" <<
+      endl << endl;
+
+    cerr << "This test performs basic regression tests on various associative containers."
+      "For each container, it performs a sequence of operations. At each iteration, it does "
+      "the following: " << endl;
+    cerr << "*  Performs an operation on the container " << endl;
+    cerr << "*  Performs the same operation on an cntnr object" << endl;
+    cerr << "*  Possibly compares the container to the cntnr object" << endl;
+    cerr << "*  Checks that exceptions (thrown by an allocator) "
+      "do not violate exception guarantees";
+
+    cerr << endl << endl;
+
+    cerr << "sd = seed for random-number generator; 0 = "
+      "time determined value" << endl;
+    cerr << "n = number of iterations" << endl;
+    cerr << "m = number of distinct values" << endl;
+    cerr << "tp = probability that an exception will be actively thrown" << endl;
+    cerr << "ip = probability that an operation will be insert" << endl;
+    cerr << "ep = probability that an operation will be erase" << endl;
+    cerr << "cp = probability that an operation will be clear" << endl;
+    cerr << "(therefore, 1 - (ip + ep + cp) = probability of any other operation)" << endl;
+    cerr << "mp = probability that the container will be compared to the cntnr object" << endl;
+    cerr << "'t' or 'f' determine whether progress will be displayed" << endl;
+  }
+
+  void
+  verify_params(size_t& r_seed, size_t& r_n, 
+		size_t& r_m, double& r_tp, double& r_ip, double& r_ep, 
+		double& r_cp, double& r_mp, bool& r_d)
+  {
+    verify_prob(r_tp);
+    verify_prob(r_ip);
+    verify_prob(r_ep);
+    verify_prob(r_cp);
+    verify_prob(r_mp);
+    verify_prob(r_ip + r_ep + r_cp);
+  }
+} // namespace detail
+} // namespace test
+} // namespace pb_ds
+
diff --git a/libstdc++-v3/testsuite/util/regression/rand/io/assoc/xml_formatter.hpp b/libstdc++-v3/testsuite/util/regression/rand/io/assoc/xml_formatter.hpp
new file mode 100644
index 00000000000..d5e1f5ba3a4
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/regression/rand/io/assoc/xml_formatter.hpp
@@ -0,0 +1,81 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file xml_formatter.hpp
+ * Contains an XML formatter for regression tests.
+ */
+
+#ifndef PB_DS_XML_TEST_REGRESSION_FORMATTER_HPP
+#define PB_DS_XML_TEST_REGRESSION_FORMATTER_HPP
+
+#include <regression/rand/io/xml_formatter.hpp>
+
+namespace pb_ds
+{
+
+  namespace test
+  {
+
+    class xml_test_rand_regression_formatter : public xml_test_formatter
+    {
+    public:
+      xml_test_rand_regression_formatter(size_t sd, size_t n, size_t m, double tp, double ip, double ep, double cp, double mp);
+    };
+
+    xml_test_rand_regression_formatter::
+    xml_test_rand_regression_formatter(size_t sd, size_t n, size_t m, double tp, double ip, double ep, double cp, double mp)
+    {
+      std::cout << make_xml_tag("sd", "value", sd);
+      std::cout << make_xml_tag("n", "value", n);
+      std::cout << make_xml_tag("m", "value", m);
+      std::cout << make_xml_tag("tp", "value", tp);
+      std::cout << make_xml_tag("ip", "value", ip);
+      std::cout << make_xml_tag("ep", "value", ep);
+      std::cout << make_xml_tag("cp", "value", cp);
+      std::cout << make_xml_tag("mp", "value", mp);
+    }
+
+  } // namespace test
+
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_XML_TEST_REGRESSION_FORMATTER_HPP
diff --git a/libstdc++-v3/testsuite/util/regression/rand/io/priority_queue/xml_formatter.hpp b/libstdc++-v3/testsuite/util/regression/rand/io/priority_queue/xml_formatter.hpp
new file mode 100644
index 00000000000..a8ceab4d2ee
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/regression/rand/io/priority_queue/xml_formatter.hpp
@@ -0,0 +1,82 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file xml_formatter.hpp
+ * Contains an XML formatter for regression tests.
+ */
+
+#ifndef PB_DS_XML_TEST_REGRESSION_FORMATTER_HPP
+#define PB_DS_XML_TEST_REGRESSION_FORMATTER_HPP
+
+#include <regression/rand/io/xml_formatter.hpp>
+
+namespace pb_ds
+{
+
+  namespace test
+  {
+
+    class xml_test_rand_regression_formatter : public xml_test_formatter
+    {
+    public:
+      xml_test_rand_regression_formatter(size_t sd, size_t n, size_t m, double tp, double ip, double dp, double ep, double cp, double mp);
+    };
+
+    xml_test_rand_regression_formatter::
+    xml_test_rand_regression_formatter(size_t sd, size_t n, size_t m, double tp, double ip, double dp, double ep, double cp, double mp)
+    {
+      std::cout << make_xml_tag("sd", "value", sd);
+      std::cout << make_xml_tag("n", "value", n);
+      std::cout << make_xml_tag("m", "value", m);
+      std::cout << make_xml_tag("tp", "value", tp);
+      std::cout << make_xml_tag("ip", "value", ip);
+      std::cout << make_xml_tag("dp", "value", dp);
+      std::cout << make_xml_tag("ep", "value", ep);
+      std::cout << make_xml_tag("cp", "value", cp);
+      std::cout << make_xml_tag("mp", "value", mp);
+    }
+
+  } // namespace test
+
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_XML_TEST_REGRESSION_FORMATTER_HPP
diff --git a/libstdc++-v3/testsuite/util/regression/rand/io/xml_formatter.hpp b/libstdc++-v3/testsuite/util/regression/rand/io/xml_formatter.hpp
new file mode 100644
index 00000000000..6bc89976c58
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/regression/rand/io/xml_formatter.hpp
@@ -0,0 +1,87 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file xml_formatter.hpp
+ * Contains an XML formatter for regression tests.
+ */
+
+#ifndef PB_DS_COMMON_XML_TEST_REGRESSION_FORMATTER_HPP
+#define PB_DS_COMMON_XML_TEST_REGRESSION_FORMATTER_HPP
+
+#include <string>
+#include <iostream>
+#include <io/xml_test_formatter.hpp>
+
+namespace pb_ds
+{
+
+  namespace test
+  {
+
+    class xml_result_set_regression_formatter : public xml_result_set_formatter
+    {
+    public:
+      xml_result_set_regression_formatter(const std::string& r_container_name, const std::string& r_container_desc);
+
+      ~xml_result_set_regression_formatter();
+    };
+
+    xml_result_set_regression_formatter::
+    xml_result_set_regression_formatter(const std::string& r_container_name, const std::string& r_container_desc) :
+      xml_result_set_formatter(r_container_name, r_container_desc)
+    {
+
+      std::cout << detail::make_xml_name_start_tag("progress");
+      std::cout << detail::make_xml_name_start_tag_end_delimiter();
+    }
+
+    xml_result_set_regression_formatter::
+    ~xml_result_set_regression_formatter()
+    {
+      std::cout << detail::make_xml_name_end_tag("progress");
+    }
+
+  } // namespace test
+
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_COMMON_XML_TEST_REGRESSION_FORMATTER_HPP
diff --git a/libstdc++-v3/testsuite/util/regression/rand/priority_queue/container_rand_regression_test.hpp b/libstdc++-v3/testsuite/util/regression/rand/priority_queue/container_rand_regression_test.hpp
new file mode 100644
index 00000000000..310d59b0154
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/regression/rand/priority_queue/container_rand_regression_test.hpp
@@ -0,0 +1,334 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file container_rand_regression_test.hpp
+ * Contains a random regression test for a specific container type.
+ */
+
+#ifndef PB_DS_CONTAINER_RAND_REGRESSION_TEST_HPP
+#define PB_DS_CONTAINER_RAND_REGRESSION_TEST_HPP
+
+#include <algorithm>
+#include <string>
+#include <sstream>
+#include <utility>
+#include <cassert>
+#include <regression/basic_type.hpp>
+#include <ext/pb_ds/priority_queue.hpp>
+#include <io/prog_bar.hpp>
+#include <rng/twister_rand_gen.hpp>
+#include <common_type/priority_queue/string_form.hpp>
+#include <regression/rand/io/priority_queue/xml_formatter.hpp>
+#include <regression/trait/priority_queue/trait.hpp>
+
+namespace pb_ds
+{
+
+  namespace test
+  {
+
+    namespace detail
+    {
+
+#ifdef PB_DS_REGRESSION_TRACE
+#define PB_DS_TRACE(X) std::cerr << X << std::endl
+#else // #ifdef PB_DS_REGRESSION_TRACE
+#define PB_DS_TRACE(X)
+#endif // #ifdef PB_DS_REGRESSION_TRACE
+
+#define PB_DS_CLASS_T_DEC			\
+      template<typename Cntnr>
+
+#define PB_DS_CLASS_C_DEC				\
+      container_rand_regression_test<			\
+						Cntnr>
+
+#define PB_DS_COND_COMPARE(L, R)		\
+      if (m_g.get_prob() < m_mp)		\
+        cmp(L, R, __FUNCTION__);
+
+#define PB_DS_RUN_MTHD(MTHD)			\
+      {						\
+        bool done = false;			\
+						\
+        while (!done)				\
+	  done = MTHD();			\
+      }
+
+#define PB_DS_THROW_IF_FAILED_(PRED, MORE, P_C, P_NC, F, L)		\
+      if (!(PRED))							\
+	{								\
+	  std::cerr << "Failure at " << F << ": " << L << std::endl;	\
+									\
+	  std::cerr << MORE << std::endl;				\
+									\
+	  std::cerr << "container:" << std::endl;			\
+									\
+	  print_container(*(P_C));					\
+	  std::cerr << std::endl;					\
+									\
+	  std::cerr << "native container:" << std::endl;		\
+									\
+	  print_container(*(P_NC));					\
+	  std::cerr << std::endl;					\
+									\
+	  throw std::logic_error("fucked!");				\
+	}
+
+#define PB_DS_THROW_IF_FAILED(PRED, MORE, P_C, P_NC)			\
+      PB_DS_THROW_IF_FAILED_(PRED, MORE, P_C, P_NC, __FILE__, __LINE__)
+
+#define PB_DS_SET_DESTRUCT_PRINT			\
+      destructor_printer dest_print___(__FUNCTION__);
+
+#define PB_DS_CANCEL_DESTRUCT_PRINT		\
+      dest_print___.cancel_print();
+
+      // Rand test specialized for a specific container.
+      template<typename Cntnr>
+      class container_rand_regression_test
+      {
+
+      public:
+
+        container_rand_regression_test(unsigned long seed, size_t n, size_t m, double tp, double ip, double dp, double ep, double cp, double mp, bool disp);
+
+	virtual
+        ~container_rand_regression_test();
+
+	void
+        operator()();
+
+      private:
+	typedef Cntnr cntnr;
+
+	typedef typename cntnr::allocator allocator;
+
+	typedef typename cntnr::size_type size_type;
+
+	typedef twister_rand_gen gen;
+
+	typedef basic_type value_type;
+
+	typedef native_priority_queue< std::string, true> native_type;
+
+	enum op
+	  {
+	    insert_op,
+	    modify_op,
+	    erase_op,
+	    clear_op,
+	    other_op
+	  };
+
+	typedef dbg_ex_allocator< char> alloc_t;
+
+	typedef regression_test_traits< Cntnr> test_traits;
+
+      private:
+
+	op
+        get_next_op();
+
+	size_t
+        get_next_sub_op(size_t max);
+
+	static void
+        defs();
+
+	static void
+        value_defs();
+
+	static void
+        ds_defs();
+
+	static void
+        iterator_defs();
+
+	static void
+        policy_defs();
+
+	void
+        policy_access();
+
+	void
+        it_copy();
+
+	void
+        it_assign();
+
+	bool
+        default_constructor();
+
+	void
+        swap();
+
+	bool
+        copy_constructor();
+
+	bool
+        assignment_operator();
+
+	bool
+        it_constructor();
+
+	bool
+        push();
+
+	bool
+        modify();
+
+	bool
+        pop();
+
+	bool
+        erase_if();
+
+	bool
+        erase_it();
+
+	bool
+        clear();
+
+	bool
+        split_join();
+
+	void
+        cmp(const Cntnr& r_container, const native_type& r_native_c, const std::string& r_call_fn);
+
+	void
+        print_container(const native_type& r_cnt, std::ostream& r_os = std::cerr) const;
+
+	void
+        print_container(const cntnr& r_cnt, std::ostream& r_os = std::cerr) const;
+
+      private:
+	struct destructor_printer
+	{
+	  destructor_printer(const std::string& r_msg) : m_msg(r_msg),
+							 m_print(true)
+	  { }
+
+	  void
+	  cancel_print()
+	  {
+            m_print = false;
+	  }
+
+	  ~destructor_printer()
+	  {
+            if (!m_print)
+	      return;
+
+            std::cerr << std::endl <<
+	      "Uncaught exception: " << std::endl <<
+	      m_msg << std::endl;
+	  }
+
+	private:
+	  const std::string m_msg;
+
+	  bool m_print;
+	};
+
+      private:
+	const unsigned long m_seed;
+
+	const size_t m_n;
+	const size_t m_m;
+	const double m_tp;
+	const double m_ip;
+	const double m_dp;
+	const double m_ep;
+	const double m_cp;
+	const double m_mp;
+	const bool m_disp;
+
+	twister_rand_gen m_g;
+
+	Cntnr* m_p_c;
+
+	native_type m_native_c;
+
+	alloc_t m_alloc;
+
+	size_t m_i;
+      };
+
+#include <regression/rand/priority_queue/detail/constructor_destructor_fn_imps.hpp>
+#include <regression/rand/priority_queue/detail/cmp_fn_imps.hpp>
+#include <regression/rand/priority_queue/detail/operator_fn_imps.hpp>
+#include <regression/rand/priority_queue/detail/insert_fn_imps.hpp>
+#include <regression/rand/priority_queue/detail/modify_fn_imps.hpp>
+#include <regression/rand/priority_queue/detail/clear_fn_imps.hpp>
+#include <regression/rand/priority_queue/detail/erase_fn_imps.hpp>
+#include <regression/rand/priority_queue/detail/defs_fn_imps.hpp>
+#include <regression/rand/priority_queue/detail/policy_access_fn_imps.hpp>
+#include <regression/rand/priority_queue/detail/split_join_fn_imps.hpp>
+#include <regression/rand/priority_queue/detail/it_conversion_fn_imps.hpp>
+#include <regression/rand/priority_queue/detail/diagnostic_fn_imps.hpp>
+
+#undef PB_DS_COND_COMPARE
+
+#undef PB_DS_RUN_MTHD
+
+#undef PB_DS_CLASS_T_DEC
+
+#undef PB_DS_CLASS_C_DEC
+
+#undef PB_DS_THROW_IF_FAILED_
+
+#undef PB_DS_THROW_IF_FAILED
+
+#undef PB_DS_SET_DESTRUCT_PRINT
+
+#undef PB_DS_CANCEL_DESTRUCT_PRINT
+
+#undef PB_DS_TRACE
+
+    } // namespace detail
+
+  } // namespace test
+
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_CONTAINER_RAND_REGRESSION_TEST_HPP
diff --git a/libstdc++-v3/testsuite/util/regression/rand/priority_queue/detail/clear_fn_imps.hpp b/libstdc++-v3/testsuite/util/regression/rand/priority_queue/detail/clear_fn_imps.hpp
new file mode 100644
index 00000000000..009b56faaf6
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/regression/rand/priority_queue/detail/clear_fn_imps.hpp
@@ -0,0 +1,60 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file clear_fn_imps.hpp
+ * Containsert a random regression test for a specific container type.
+ */
+
+PB_DS_CLASS_T_DEC
+bool
+PB_DS_CLASS_C_DEC::
+clear()
+{
+  PB_DS_TRACE("clear");
+
+  m_p_c->clear();
+
+  m_native_c.clear();
+
+  return (true);
+}
+
diff --git a/libstdc++-v3/testsuite/util/regression/rand/priority_queue/detail/cmp_fn_imps.hpp b/libstdc++-v3/testsuite/util/regression/rand/priority_queue/detail/cmp_fn_imps.hpp
new file mode 100644
index 00000000000..3707b7db997
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/regression/rand/priority_queue/detail/cmp_fn_imps.hpp
@@ -0,0 +1,108 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file cmp_fn_imps.hpp
+ * Containsert a random regression test for a specific container type.
+ */
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+cmp(const Cntnr& r_c, const native_type& r_native_c, const std::string& r_call_fn)
+{
+  PB_DS_SET_DESTRUCT_PRINT
+
+    try
+      {
+        m_alloc.set_throw_prob(1);
+
+        const size_t size = r_c.size();
+        const size_t native_size = r_native_c.size();
+
+        PB_DS_THROW_IF_FAILED(
+			      size == native_size,
+			      static_cast<unsigned long>(size) << " " <<
+			      static_cast<unsigned long>(native_size),
+			      & r_c,
+			      & r_native_c);
+
+        const bool empty = r_c.empty();
+        const bool native_empty = r_native_c.empty();
+
+        PB_DS_THROW_IF_FAILED(
+			      empty == native_empty,
+			      empty << " " << native_empty,
+			      & r_c,
+			      & r_native_c);
+
+        const size_t it_size = std::distance(r_c.begin(), r_c.end());
+
+        PB_DS_THROW_IF_FAILED(
+			      it_size == size,
+			      it_size << " " << size,
+			      & r_c,
+			      & r_native_c);
+
+        if (!r_c.empty())
+	  {
+            const std::string native_top = r_native_c.top();
+            const std::string top = test_traits::native_value(r_c.top());
+
+            const bool top_smaller = std::less<std::string>()(top, native_top);
+            const bool top_larger = std::less<std::string>()(native_top, top);
+
+            if (top_smaller || top_larger)
+	      PB_DS_THROW_IF_FAILED(
+				    false,
+				    top << " " << native_top,
+				    & r_c,
+				    & r_native_c);
+	  }
+      }
+    catch(...)
+      {
+        PB_DS_THROW_IF_FAILED(            false, "call-fn: " + r_call_fn, & r_c, & r_native_c);
+      }
+
+  PB_DS_CANCEL_DESTRUCT_PRINT
+    }
+
diff --git a/libstdc++-v3/testsuite/util/regression/rand/priority_queue/detail/constructor_destructor_fn_imps.hpp b/libstdc++-v3/testsuite/util/regression/rand/priority_queue/detail/constructor_destructor_fn_imps.hpp
new file mode 100644
index 00000000000..e04627c151e
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/regression/rand/priority_queue/detail/constructor_destructor_fn_imps.hpp
@@ -0,0 +1,235 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file constructor_destructor_fn_imps.hpp
+ * Containsert a random regression test for a specific container type.
+ */
+
+PB_DS_CLASS_T_DEC
+PB_DS_CLASS_C_DEC::
+container_rand_regression_test(unsigned long seed, size_t n, size_t m, double tp, double ip, double dp, double ep, double cp, double mp, bool disp) :
+  m_seed((seed == 0)?
+	 twister_rand_gen::get_time_determined_seed():
+	 seed),
+  m_n(n),
+  m_m(m),
+  m_tp(tp),
+  m_ip(ip),
+  m_dp(dp),
+  m_ep(ep),
+  m_cp(cp),
+  m_mp(mp),
+  m_disp(disp),
+  m_p_c(NULL)
+{ }
+
+PB_DS_CLASS_T_DEC
+PB_DS_CLASS_C_DEC::
+~container_rand_regression_test()
+{ }
+
+PB_DS_CLASS_T_DEC
+bool
+PB_DS_CLASS_C_DEC::
+default_constructor()
+{
+  PB_DS_TRACE("default_constructor");
+
+  bool done = true;
+
+  m_alloc.set_throw_prob(m_tp);
+
+  try
+    {
+      m_p_c = new Cntnr;
+    }
+  catch(forced_exception& )
+    {
+      done = false;
+    }
+
+  if (m_p_c != NULL)
+    PB_DS_COND_COMPARE(*m_p_c, m_native_c);
+
+  return (done);
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+swap()
+{
+  PB_DS_TRACE("swap");
+
+  m_alloc.set_throw_prob(0);
+
+  Cntnr* p_c = new Cntnr;
+
+  m_alloc.set_throw_prob(1);
+
+  p_c->swap(*m_p_c);
+
+  std::swap(p_c, m_p_c);
+
+  delete p_c;
+
+  PB_DS_COND_COMPARE(*m_p_c, m_native_c);
+}
+
+PB_DS_CLASS_T_DEC
+bool
+PB_DS_CLASS_C_DEC::
+copy_constructor()
+{
+  PB_DS_TRACE("copy_constructor");
+
+  bool done = true;
+
+  Cntnr* p_c = NULL;
+
+  m_alloc.set_throw_prob(m_tp);
+
+  typename alloc_t::group_throw_prob_adjustor
+    adjust(m_p_c->size());
+
+  try
+    {
+      p_c = new Cntnr(*m_p_c);
+
+      std::swap(p_c, m_p_c);
+    }
+  catch(forced_exception& )
+    {
+      done = false;
+    }
+
+  delete p_c;
+
+  PB_DS_COND_COMPARE(*m_p_c, m_native_c);
+
+  return (done);
+}
+
+PB_DS_CLASS_T_DEC
+bool
+PB_DS_CLASS_C_DEC::
+assignment_operator()
+{
+  PB_DS_TRACE("assignment operator");
+
+  bool done = true;
+
+  Cntnr* p_c = NULL;
+
+  m_alloc.set_throw_prob(m_tp);
+
+  typename alloc_t::group_throw_prob_adjustor
+    adjust(m_p_c->size());
+
+  try
+    {
+      p_c = new Cntnr();
+
+      * p_c =* m_p_c;
+
+      std::swap(p_c, m_p_c);
+    }
+  catch(forced_exception& )
+    {
+      done = false;
+    }
+
+  delete p_c;
+
+  PB_DS_COND_COMPARE(*m_p_c, m_native_c);
+
+  return (done);
+}
+
+PB_DS_CLASS_T_DEC
+bool
+PB_DS_CLASS_C_DEC::
+it_constructor()
+{
+  bool done = true;
+
+  Cntnr* p_c = NULL;
+
+  m_alloc.set_throw_prob(m_tp);
+
+  typename alloc_t::group_throw_prob_adjustor
+    adjust(m_p_c->size());
+
+  try
+    {
+      switch(get_next_sub_op(3))
+        {
+        case 0:
+	  p_c = new Cntnr(m_p_c->get_cmp_fn());
+	  m_native_c.clear();
+	  break;
+        case 1:
+	  p_c = new Cntnr(m_p_c->begin(),
+			  m_p_c->end());
+	  break;
+        case 2:
+	  p_c = new Cntnr(m_p_c->begin(),
+			  m_p_c->end(),
+			  m_p_c->get_cmp_fn());
+	  break;
+        default:
+	  PB_DS_THROW_IF_FAILED(                    false,  "",  m_p_c, & m_native_c);
+        };
+
+      std::swap(p_c, m_p_c);
+    }
+  catch(forced_exception& )
+    {
+      done = false;
+    }
+
+  delete p_c;
+
+  PB_DS_COND_COMPARE(*m_p_c, m_native_c);
+
+  return (done);
+}
diff --git a/libstdc++-v3/testsuite/util/regression/rand/priority_queue/detail/defs_fn_imps.hpp b/libstdc++-v3/testsuite/util/regression/rand/priority_queue/detail/defs_fn_imps.hpp
new file mode 100644
index 00000000000..85bc6b0a14e
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/regression/rand/priority_queue/detail/defs_fn_imps.hpp
@@ -0,0 +1,111 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file defs_fn_imps.hpp
+ * Containsert a random regression test for a specific container type.
+ */
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+defs()
+{
+  // General container types.
+
+  typedef typename Cntnr::size_type test_size_type;
+
+  typedef typename Cntnr::difference_type difference_type;
+
+  value_defs();
+
+  iterator_defs();
+
+  policy_defs();
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+value_defs()
+{
+  typedef typename Cntnr::value_type test_value_type;
+
+  typedef typename Cntnr::reference test_reference;
+
+  typedef typename Cntnr::const_reference test_const_reference;
+
+  typedef typename Cntnr::pointer test_pointer;
+
+  typedef typename Cntnr::const_pointer test_const_pointer;
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+ds_defs()
+{
+  typedef typename Cntnr::container_category test_container_category;
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+iterator_defs()
+{
+  typedef typename Cntnr::point_iterator test_point_iterator;
+
+  typedef typename Cntnr::const_point_iterator const_test_point_iterator;
+
+  typedef typename Cntnr::iterator test_iterator;
+
+  typedef typename Cntnr::const_iterator const_test_iterator;
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+policy_defs()
+{
+  typedef typename Cntnr::allocator test_allocator;
+
+  typedef typename Cntnr::cmp_fn test_cmp_fn;
+}
diff --git a/libstdc++-v3/testsuite/util/regression/rand/priority_queue/detail/diagnostic_fn_imps.hpp b/libstdc++-v3/testsuite/util/regression/rand/priority_queue/detail/diagnostic_fn_imps.hpp
new file mode 100644
index 00000000000..caeba090e25
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/regression/rand/priority_queue/detail/diagnostic_fn_imps.hpp
@@ -0,0 +1,73 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file diagnostic_fn_imps.hpp
+ * Containsert a random regression test for a specific container type.
+ */
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+print_container(const native_type& r_cnt, std::ostream& r_os /*= std::cerr*/) const
+{
+  m_alloc.set_throw_prob(0);
+
+  native_type cpy(r_cnt);
+
+  while (!cpy.empty())
+    {
+      r_os << cpy.top() << std::endl;
+
+      cpy.pop();
+    }
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+print_container(const cntnr& r_cnt, std::ostream& r_os /*= std::cerr*/) const
+{
+  m_alloc.set_throw_prob(0);
+
+  for (typename cntnr::const_iterator it = r_cnt.begin(); it != r_cnt.end(); ++it)
+    r_os <<* it << std::endl;
+}
diff --git a/libstdc++-v3/testsuite/util/regression/rand/priority_queue/detail/erase_fn_imps.hpp b/libstdc++-v3/testsuite/util/regression/rand/priority_queue/detail/erase_fn_imps.hpp
new file mode 100644
index 00000000000..f5e287b9d65
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/regression/rand/priority_queue/detail/erase_fn_imps.hpp
@@ -0,0 +1,178 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file erase_fn_imps.hpp
+ * Containsert a random regression test for a specific container type.
+ */
+
+PB_DS_CLASS_T_DEC
+bool
+PB_DS_CLASS_C_DEC::
+pop()
+{
+  PB_DS_TRACE("pop");
+
+  bool done = true;
+
+  PB_DS_SET_DESTRUCT_PRINT
+
+    m_alloc.set_throw_prob(1);
+
+  try
+    {
+      if (!m_p_c->empty())
+        {
+	  m_p_c->pop();
+
+	  m_native_c.pop();
+        }
+    }
+  catch(forced_exception& )
+    {
+      done = false;
+
+      PB_DS_THROW_IF_FAILED(            false, "", m_p_c, & m_native_c);
+    }
+
+  PB_DS_COND_COMPARE(*m_p_c, m_native_c);
+
+  PB_DS_CANCEL_DESTRUCT_PRINT
+
+    return (done);
+}
+
+PB_DS_CLASS_T_DEC
+bool
+PB_DS_CLASS_C_DEC::
+erase_if()
+{
+  PB_DS_TRACE("erase_if");
+
+  bool done = true;
+
+  PB_DS_SET_DESTRUCT_PRINT
+
+    try
+      {
+        typedef
+	  typename std::iterator_traits<
+	  typename cntnr::iterator>::reference
+	  it_const_reference;
+
+        m_alloc.set_throw_prob(1);
+
+        typedef
+	  typename test_traits::template erase_if_fn<
+	  value_type>
+	  erase_if_fn_t;
+
+        const size_t ersd =
+	  m_p_c->erase_if(erase_if_fn_t());
+
+        typedef
+	  typename test_traits::template erase_if_fn<
+	  std::string>
+	  native_erase_if_fn_t;
+
+        const size_t native_ersd =
+	  m_native_c.erase_if(native_erase_if_fn_t());
+
+        PB_DS_THROW_IF_FAILED(
+			      ersd == native_ersd,
+			      static_cast<unsigned long>(ersd) << " " <<
+			      static_cast<unsigned long>(native_ersd),
+			      m_p_c,
+			      & m_native_c);
+      }
+    catch(forced_exception& )
+      {
+        done = false;
+
+        PB_DS_THROW_IF_FAILED(            false, "", m_p_c, & m_native_c);
+      }
+
+  PB_DS_COND_COMPARE(*m_p_c, m_native_c);
+
+  PB_DS_CANCEL_DESTRUCT_PRINT
+
+    return (done);
+}
+
+PB_DS_CLASS_T_DEC
+bool
+PB_DS_CLASS_C_DEC::
+erase_it()
+{
+  PB_DS_TRACE("erase_it");
+
+  bool done = true;
+
+  PB_DS_SET_DESTRUCT_PRINT
+
+    try
+      {
+        m_alloc.set_throw_prob(1);
+
+        typename cntnr::iterator it = m_p_c->begin();
+
+        std::advance(it, m_g.get_unsigned_long(0, m_p_c->size()));
+
+        if (it != m_p_c->end())
+	  {
+            m_native_c.erase(*it);
+
+            m_p_c->erase(it);
+	  }
+      }
+    catch(forced_exception& )
+      {
+        done = false;
+
+        PB_DS_THROW_IF_FAILED(            false, "", m_p_c, & m_native_c);
+      }
+
+  PB_DS_COND_COMPARE(*m_p_c, m_native_c);
+
+  PB_DS_CANCEL_DESTRUCT_PRINT
+
+    return (done);
+}
diff --git a/libstdc++-v3/testsuite/util/regression/rand/priority_queue/detail/insert_fn_imps.hpp b/libstdc++-v3/testsuite/util/regression/rand/priority_queue/detail/insert_fn_imps.hpp
new file mode 100644
index 00000000000..70eea252762
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/regression/rand/priority_queue/detail/insert_fn_imps.hpp
@@ -0,0 +1,93 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file insert_fn_imps.hpp
+ * Containsert a random regression test for a specific container type.
+ */
+
+PB_DS_CLASS_T_DEC
+bool
+PB_DS_CLASS_C_DEC::
+push()
+{
+  PB_DS_TRACE("push");
+
+  bool done = true;
+
+  PB_DS_SET_DESTRUCT_PRINT
+
+    try
+      {
+        m_alloc.set_throw_prob(0);
+
+        value_type v = test_traits::generate_value(m_g, m_m);
+
+        m_alloc.set_throw_prob(m_tp);
+
+        const typename cntnr::size_type sz = m_p_c->size();
+
+        typename cntnr::point_iterator ins_ret = m_p_c->push(v);
+
+        PB_DS_THROW_IF_FAILED(
+			      sz == m_p_c->size() - 1,
+			      sz,
+			      m_p_c,
+			      & m_native_c);
+
+        m_native_c.push(test_traits::native_value(v));
+      }
+    catch(forced_exception& )
+      {
+        done = false;
+      }
+    catch(...)
+      {
+        PB_DS_THROW_IF_FAILED(            false, "", m_p_c, & m_native_c);
+      }
+
+  PB_DS_COND_COMPARE(*m_p_c, m_native_c);
+
+  PB_DS_CANCEL_DESTRUCT_PRINT
+
+    return (done);
+}
+
diff --git a/libstdc++-v3/testsuite/util/regression/rand/priority_queue/detail/it_conversion_fn_imps.hpp b/libstdc++-v3/testsuite/util/regression/rand/priority_queue/detail/it_conversion_fn_imps.hpp
new file mode 100644
index 00000000000..c59e1368835
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/regression/rand/priority_queue/detail/it_conversion_fn_imps.hpp
@@ -0,0 +1,190 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file it_conversion_fn_imps.hpp
+ * Containsert a random regression test for a specific container type.
+ */
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+it_copy()
+{
+  PB_DS_TRACE("it_copy");
+
+  {
+    typename cntnr::iterator it = m_p_c->end();
+
+    typename cntnr::const_iterator const_it(it);
+
+    PB_DS_THROW_IF_FAILED(            const_it == it, "", m_p_c, & m_native_c);
+
+    PB_DS_THROW_IF_FAILED(
+			  !(const_it != it),
+			  "",
+			  m_p_c,
+			  & m_native_c);
+
+    typename cntnr::const_point_iterator const_find_it(it);
+
+    PB_DS_THROW_IF_FAILED(            const_find_it == it, "", m_p_c, & m_native_c);
+
+    PB_DS_THROW_IF_FAILED(
+			  !(const_find_it != it),
+			  "",
+			  m_p_c,
+			  & m_native_c);
+
+    typename cntnr::point_iterator find_it(it);
+
+    PB_DS_THROW_IF_FAILED(            find_it == it, "", m_p_c, & m_native_c);
+
+    PB_DS_THROW_IF_FAILED(
+			  !(find_it != it),
+			  "",
+			  m_p_c,
+			  & m_native_c);
+  }
+
+  {
+    typename cntnr::const_iterator const_it = m_p_c->end();
+
+    typename cntnr::const_point_iterator const_find_it(const_it);
+
+    PB_DS_THROW_IF_FAILED(            const_find_it == const_it, "", m_p_c, & m_native_c);
+
+    PB_DS_THROW_IF_FAILED(
+			  !(const_find_it != const_it),
+			  "",
+			  m_p_c,
+			  & m_native_c);
+  }
+
+  {
+    typename cntnr::point_iterator find_it = m_p_c->end();
+
+    typename cntnr::const_point_iterator const_find_it(find_it);
+
+    PB_DS_THROW_IF_FAILED(            find_it == const_find_it, "", m_p_c, & m_native_c);
+
+    PB_DS_THROW_IF_FAILED(
+			  !(find_it != const_find_it),
+			  "",
+			  m_p_c,
+			  & m_native_c);
+  }
+}
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+it_assign()
+{
+  PB_DS_TRACE("it_assign");
+
+  {
+    typename cntnr::iterator it = m_p_c->end();
+
+    typename cntnr::const_iterator const_it;
+    const_it = it;
+
+    PB_DS_THROW_IF_FAILED(            const_it == it, "", m_p_c, & m_native_c);
+
+    PB_DS_THROW_IF_FAILED(
+			  !(const_it != it),
+			  "",
+			  m_p_c,
+			  & m_native_c);
+
+    typename cntnr::const_point_iterator const_find_it;
+    const_find_it = it;
+
+    PB_DS_THROW_IF_FAILED(            const_find_it == it, "", m_p_c, & m_native_c);
+
+    PB_DS_THROW_IF_FAILED(
+			  !(const_find_it != it),
+			  "",
+			  m_p_c,
+			  & m_native_c);
+
+    typename cntnr::point_iterator find_it;
+    find_it = it;
+
+    PB_DS_THROW_IF_FAILED(            find_it == it, "", m_p_c, & m_native_c);
+
+    PB_DS_THROW_IF_FAILED(
+			  !(find_it != it),
+			  "",
+			  m_p_c,
+			  & m_native_c);
+  }
+
+  {
+    typename cntnr::const_iterator const_it = m_p_c->end();
+
+    typename cntnr::const_point_iterator const_find_it;
+    const_find_it = const_it;
+
+    PB_DS_THROW_IF_FAILED(            const_find_it == const_it, "", m_p_c, & m_native_c);
+
+    PB_DS_THROW_IF_FAILED(
+			  !(const_find_it != const_it),
+			  "",
+			  m_p_c,
+			  & m_native_c);
+  }
+
+  {
+    typename cntnr::point_iterator find_it = m_p_c->end();
+
+    typename cntnr::const_point_iterator const_find_it;
+    const_find_it = find_it;
+
+    PB_DS_THROW_IF_FAILED(            find_it == const_find_it, "", m_p_c, & m_native_c);
+
+    PB_DS_THROW_IF_FAILED(
+			  !(find_it != const_find_it),
+			  "",
+			  m_p_c,
+			  & m_native_c);
+  }
+}
diff --git a/libstdc++-v3/testsuite/util/regression/rand/priority_queue/detail/modify_fn_imps.hpp b/libstdc++-v3/testsuite/util/regression/rand/priority_queue/detail/modify_fn_imps.hpp
new file mode 100644
index 00000000000..e213a2ea57f
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/regression/rand/priority_queue/detail/modify_fn_imps.hpp
@@ -0,0 +1,96 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file modify_fn_imps.hpp
+ * Containsert a random regression test for a specific container type.
+ */
+
+PB_DS_CLASS_T_DEC
+bool
+PB_DS_CLASS_C_DEC::
+modify()
+{
+  PB_DS_TRACE("modify");
+
+  bool done = true;
+
+  PB_DS_SET_DESTRUCT_PRINT
+
+    try
+      {
+        m_alloc.set_throw_prob(0);
+
+        value_type v = test_traits::generate_value(m_g, m_m);
+
+        m_alloc.set_throw_prob(m_tp);
+
+        typename cntnr::iterator it = m_p_c->begin();
+
+        std::advance(it, m_g.get_unsigned_long(0, m_p_c->size()));
+
+        if (it != m_p_c->end())
+	  {
+            typename test_traits::native_value_type native_v =
+	      test_traits::native_value(*it);
+
+            typename test_traits::native_value_type new_native_v =
+	      test_traits::native_value(v);
+
+            m_p_c->modify(it, v);
+
+            m_native_c.modify(native_v, new_native_v);
+	  }
+      }
+    catch(forced_exception& )
+      {
+        done = false;
+
+        PB_DS_THROW_IF_FAILED(            false, "", m_p_c, & m_native_c);
+      }
+
+  PB_DS_COND_COMPARE(*m_p_c, m_native_c);
+
+  PB_DS_CANCEL_DESTRUCT_PRINT
+
+    return (done);
+}
+
diff --git a/libstdc++-v3/testsuite/util/regression/rand/priority_queue/detail/operator_fn_imps.hpp b/libstdc++-v3/testsuite/util/regression/rand/priority_queue/detail/operator_fn_imps.hpp
new file mode 100644
index 00000000000..9b8c0dd87c4
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/regression/rand/priority_queue/detail/operator_fn_imps.hpp
@@ -0,0 +1,227 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file operator_fn_imps.hpp
+ * Containsert a random regression test for a specific container type.
+ */
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+operator()()
+{
+  xml_result_set_regression_formatter* p_fmt = NULL;
+
+  if (m_disp)
+    p_fmt = new xml_result_set_regression_formatter(
+						    string_form<Cntnr>::name(),
+						    string_form<Cntnr>::desc());
+
+  m_g.init(m_seed);
+  m_alloc.init(m_seed);
+
+  prog_bar pb(m_n, std::cout, m_disp);
+
+  m_i = 0;
+
+  try
+    {
+      for (m_i = 0; m_i < m_n; ++m_i)
+        {
+	  PB_DS_TRACE("Op #" << static_cast<unsigned long>(m_i));
+
+	  allocator::set_label(m_i);
+
+	  switch(m_i)
+            {
+            case 0:
+	      PB_DS_RUN_MTHD(default_constructor);
+	      break;
+            case 1:
+	      defs();
+	      break;
+            case 2:
+	      policy_access();
+	      break;
+            case 3:
+	      it_copy();
+	      break;
+            case 4:
+	      it_assign();
+	      break;
+            default:
+	      switch(get_next_op())
+                {
+                case insert_op:
+		  PB_DS_RUN_MTHD(push)
+                    break;
+                case modify_op:
+		  PB_DS_RUN_MTHD(modify)
+                    break;
+                case erase_op:
+		  switch(get_next_sub_op(3))
+                    {
+                    case 0:
+		      PB_DS_RUN_MTHD(pop)
+                        break;
+                    case 1:
+		      PB_DS_RUN_MTHD(erase_if)
+                        break;
+                    case 2:
+		      PB_DS_RUN_MTHD(erase_it)
+                        break;
+                    default:
+		      PB_DS_THROW_IF_FAILED(                            false,       "",       m_p_c,      & m_native_c);
+                    }
+		  break;
+                case clear_op:
+		  PB_DS_RUN_MTHD(clear)
+                    break;
+                case other_op:
+		  switch(get_next_sub_op(5))
+                    {
+                    case 0:
+		      swap();
+		      break;
+                    case 1:
+		      PB_DS_RUN_MTHD(copy_constructor)
+                        break;
+                    case 2:
+		      PB_DS_RUN_MTHD(it_constructor)
+                        break;
+                    case 3:
+		      PB_DS_RUN_MTHD(assignment_operator)
+                        break;
+                    case 4:
+		      PB_DS_RUN_MTHD(split_join)
+                        break;
+                    default:
+		      PB_DS_THROW_IF_FAILED(                            false,       "",       m_p_c,      & m_native_c);
+                    }
+		  break;
+                default:
+		  PB_DS_THROW_IF_FAILED(                        false,   "",   m_p_c,  & m_native_c);
+                };
+            }
+
+	  pb.inc();
+        }
+    }
+  catch(...)
+    {
+      std::cerr << "Failed at index " << static_cast<unsigned long>(m_i) <<
+	std::endl;
+
+      delete m_p_c;
+
+      throw;
+    }
+
+  delete m_p_c;
+
+  if (!m_alloc.dbg_ex_allocator<char>::empty())
+    {
+      std::cerr << "detected leaks!" << std::endl;
+
+      std::cerr << m_alloc << std::endl;
+
+      PB_DS_THROW_IF_FAILED(            false, "", m_p_c, & m_native_c);
+    }
+
+  if (m_disp)
+    {
+      std::cout << std::endl;
+
+      delete p_fmt;
+    }
+}
+
+PB_DS_CLASS_T_DEC
+typename PB_DS_CLASS_C_DEC::op
+PB_DS_CLASS_C_DEC::
+get_next_op()
+{
+  const double prob = m_g.get_prob();
+
+  if (prob < m_ip)
+    return (insert_op);
+
+  if (prob < m_ip + m_dp)
+    return (modify_op);
+
+  if (prob < m_ip + m_dp + m_ep)
+    return (erase_op);
+
+  if (prob < m_ip + m_dp + m_ep + m_cp)
+    return (clear_op);
+
+  PB_DS_THROW_IF_FAILED(        prob <= 1, prob, m_p_c,    & m_native_c);
+
+  return (other_op);
+}
+
+PB_DS_CLASS_T_DEC
+size_t
+PB_DS_CLASS_C_DEC::
+get_next_sub_op(size_t max)
+{
+  const double p = m_g.get_prob();
+
+  const double delta = 1 / static_cast<double>(max);
+
+  size_t i = 0;
+
+  while (true)
+    if (p <= (i + 1)*  delta)
+      {
+	PB_DS_THROW_IF_FAILED(
+			      i < max,
+			      static_cast<unsigned long>(i) << " " <<
+			      static_cast<unsigned long>(max),
+			      m_p_c,
+			      & m_native_c);
+
+	return (i);
+      }
+    else
+      ++i;
+}
diff --git a/libstdc++-v3/testsuite/util/regression/rand/priority_queue/detail/policy_access_fn_imps.hpp b/libstdc++-v3/testsuite/util/regression/rand/priority_queue/detail/policy_access_fn_imps.hpp
new file mode 100644
index 00000000000..40f37926c8e
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/regression/rand/priority_queue/detail/policy_access_fn_imps.hpp
@@ -0,0 +1,66 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file policy_access_fn_imps.hpp
+ * Containsert a random regression test for a specific container type.
+ */
+
+PB_DS_CLASS_T_DEC
+void
+PB_DS_CLASS_C_DEC::
+policy_access()
+{
+  PB_DS_TRACE("policy_access");
+
+  {
+    typename Cntnr::cmp_fn& r_t =
+      m_p_c->get_cmp_fn();
+
+    assert(&r_t != NULL);
+  }
+
+  {
+    const typename Cntnr::cmp_fn& r_t =((const Cntnr& )*m_p_c).get_cmp_fn();
+
+    assert(&r_t != NULL);
+  }
+}
diff --git a/libstdc++-v3/testsuite/util/regression/rand/priority_queue/detail/split_join_fn_imps.hpp b/libstdc++-v3/testsuite/util/regression/rand/priority_queue/detail/split_join_fn_imps.hpp
new file mode 100644
index 00000000000..b3f7425674e
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/regression/rand/priority_queue/detail/split_join_fn_imps.hpp
@@ -0,0 +1,120 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file split_join_fn_imps.hpp
+ * Containsert a random regression test for a specific container type.
+ */
+
+PB_DS_CLASS_T_DEC
+bool
+PB_DS_CLASS_C_DEC::
+split_join()
+{
+  PB_DS_TRACE("split_join");
+
+  bool done = true;
+
+  PB_DS_SET_DESTRUCT_PRINT
+
+    try
+      {
+        m_alloc.set_throw_prob(0);
+
+        Cntnr lhs(*m_p_c);
+
+        Cntnr rhs;
+
+        native_type native_lhs(m_native_c);
+
+        m_alloc.set_throw_prob(m_tp);
+
+        typedef
+	  typename test_traits::template erase_if_fn<
+	  value_type>
+	  split_fn_t;
+
+        lhs.split(split_fn_t(), rhs);
+
+        typedef
+	  typename test_traits::template erase_if_fn<
+	  std::string>
+	  native_split_fn_t;
+
+        native_type native_rhs;
+
+        native_lhs.split(native_split_fn_t(), native_rhs);
+
+        PB_DS_COND_COMPARE(lhs, native_lhs);
+        PB_DS_COND_COMPARE(rhs, native_rhs);
+
+        m_alloc.set_throw_prob(m_tp);
+
+        if (m_g.get_prob() < 0.5)
+	  lhs.swap(rhs);
+
+        lhs.join(rhs);
+
+        PB_DS_THROW_IF_FAILED(
+			      rhs.size() == 0,
+			      static_cast<unsigned long>(rhs.size()),
+			      m_p_c,
+			      & m_native_c);
+
+        PB_DS_THROW_IF_FAILED(
+			      rhs.empty(),
+			      static_cast<unsigned long>(rhs.size()),
+			      m_p_c,
+			      & m_native_c);
+      }
+    catch(forced_exception& )
+      {
+        done = false;
+
+        PB_DS_THROW_IF_FAILED(            pb_ds::container_traits<cntnr>::split_join_can_throw, pb_ds::container_traits<cntnr>::split_join_can_throw, m_p_c, & m_native_c);
+      }
+
+  PB_DS_COND_COMPARE(*m_p_c, m_native_c);
+
+  PB_DS_CANCEL_DESTRUCT_PRINT
+
+    return (done);
+}
diff --git a/libstdc++-v3/testsuite/util/regression/rand/priority_queue/rand_regression_test.hpp b/libstdc++-v3/testsuite/util/regression/rand/priority_queue/rand_regression_test.hpp
new file mode 100644
index 00000000000..ebd6d33c8d2
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/regression/rand/priority_queue/rand_regression_test.hpp
@@ -0,0 +1,210 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file rand_regression_test.hpp
+ * Contains a random-operation test.
+ */
+
+#include <iostream>
+#include <vector>
+#include <regression/rand/priority_queue/container_rand_regression_test.hpp>
+#include <io/verified_cmd_line_input.hpp>
+#include <common_type/priority_queue/common_type.hpp>
+#include <regression/basic_type.hpp>
+#include <regression/priority_queue/common_type.hpp>
+
+namespace pb_ds
+{
+namespace test
+{
+namespace detail
+{
+#ifndef PB_DS_REGRESSION
+#error "Must define PB_DS_REGRESSION"
+#endif
+
+  struct rand_reg_test
+  {
+  public:
+    rand_reg_test(size_t seed, size_t n, size_t m, double tp, double ip, 
+		  double dp, double ep, double cp, double mp, bool d) 
+    : m_sd(seed), m_n(n), m_m(m), m_tp(tp), m_ip(ip), m_dp(dp), m_ep(ep), 
+      m_cp(cp), m_mp(mp), m_disp(d)
+    { }
+
+    template<typename Cntnr>
+    void
+    operator()(pb_ds::detail::type_to_type<Cntnr>)
+    {
+      unsigned long ul = static_cast<unsigned long>(m_sd);
+      container_rand_regression_test<Cntnr> t(ul, m_n, m_n, m_tp, m_ip, m_dp, 
+					      m_ep, m_cp, m_mp, m_disp);
+      t();
+    }
+
+  private:
+    const size_t m_sd;
+    const size_t m_n;
+    const size_t m_m;
+    const double m_tp;
+    const double m_ip;
+    const double m_dp;
+    const double m_ep;
+    const double m_cp;
+    const double m_mp;
+    const bool m_disp;
+  };
+
+  void
+  usage(const std::string& r_name);
+
+  void
+  verify_params(size_t&, size_t&, size_t&, 
+		double&, double&, double&, double&, double&, double&, bool&);
+} // namespace detail
+
+  template<typename TL>
+  int
+  rand_regression_test(size_t iter, size_t keys, const std::string name, TL tl)
+  {
+    // Sane defaults.
+    size_t n = iter;
+    size_t m = keys;
+    size_t sd = 0; // 0 = time-determined arbitrary
+    double tp = 0.2;
+    double ip = 0.6;
+    double dp = 0.1;
+    double ep = 0.2; 
+    double cp = 0.001;
+    double mp = 1;
+    bool disp = false; // show progress
+
+    try
+      {
+	detail::verify_params(sd, n, m, tp, ip, dp, ep, cp, mp, disp);
+      }
+    catch(pb_ds::test::illegal_input_error&)
+      {
+	detail::usage(name);
+	return -1;
+      }
+    catch(...)
+      {
+	return -2;
+      };
+
+    xml_test_rand_regression_formatter* p_fmt = NULL;
+    if (sd == 0)
+      sd = twister_rand_gen::get_time_determined_seed();
+    if (disp)
+      p_fmt = new xml_test_rand_regression_formatter(sd, n, m, tp, ip, dp,
+						     ep, cp, mp);
+
+    try
+      {
+	detail::rand_reg_test tst(sd, n, m, tp, ip, dp, ep, cp, mp, disp);
+	pb_ds::detail::typelist_apply(tst, tl);
+      }
+    catch(...)
+      {
+	std::cerr << "Test failed with seed " << sd << std::endl;
+	if (disp)
+	  delete p_fmt;
+	return -1;
+      }
+
+    if (disp)
+      delete p_fmt;
+    return 0;
+  }
+
+namespace detail
+{
+  void
+  usage(const std::string& name)
+  {
+    using namespace std;
+    cerr << "usage: " << name << " <sd> <n> <m> <tp> <ip> <dp> <ep> <cp> <mp> ['t' | 'f']" <<
+      endl << endl;
+
+    cerr << "This test performs basic regression tests on various priority queues."
+      "For each container, it performs a sequence of operations. At each iteration, it does "
+      "the following: " << endl;
+    cerr << "*  Performs an operation on the container " << endl;
+    cerr << "*  Performs the same operation on an cntnr object" << endl;
+    cerr << "*  Possibly compares the container to the cntnr object" << endl;
+    cerr << "*  Checks that exceptions (thrown by an allocator) "
+      "do not violate exception guarantees";
+
+    cerr << endl << endl;
+
+    cerr << "sd = seed for random-number generator; 0 = "
+      "time determined value" << endl;
+    cerr << "n = number of iterations" << endl;
+    cerr << "m = number of distinct values" << endl;
+    cerr << "tp = probability that an exception will be actively thrown" << endl;
+    cerr << "ip = probability that an operation will be insert" << endl;
+    cerr << "dp = probability that an operation will be modify" << endl;
+    cerr << "ep = probability that an operation will be erase" << endl;
+    cerr << "cp = probability that an operation will be clear" << endl;
+    cerr << "(therefore, 1 - (ip + dp + ep + cp) = probability of any other operation)" << endl;
+    cerr << "mp = probability that the container will be compared to the cntnr object" << endl;
+    cerr << "'t' or 'f' determine whether progress will be displayed" << endl;
+  }
+
+  void
+  verify_params(size_t& r_seed, size_t& r_n, 
+		size_t& r_m, double& r_tp, double& r_ip, double& r_dp, 
+		double& r_ep, double& r_cp, double& r_mp, bool& r_d)
+  {
+    verify_prob(r_tp);
+    verify_prob(r_ip);
+    verify_prob(r_dp);
+    verify_prob(r_ep);
+    verify_prob(r_cp);
+    verify_prob(r_mp);
+    verify_prob(r_ip + r_dp + r_ep + r_cp);
+  }
+} // namespace detail
+} // namespace test
+} // namespace pb_ds
+
diff --git a/libstdc++-v3/testsuite/util/regression/res_mng/dbg_ex_allocator.hpp b/libstdc++-v3/testsuite/util/regression/res_mng/dbg_ex_allocator.hpp
new file mode 100644
index 00000000000..eedce6bed01
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/regression/res_mng/dbg_ex_allocator.hpp
@@ -0,0 +1,206 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file dbg_ex_allocator.hpp
+ * Contains a debugging, exception throwing, allocator used for tests.
+ */
+
+#ifndef PB_DS_DBG_EX_ALLOCATOR_HPP
+#define PB_DS_DBG_EX_ALLOCATOR_HPP
+
+#include <regression/res_mng/dbg_ex_allocator_base.hpp>
+
+namespace pb_ds
+{
+
+  namespace test
+  {
+
+#define PB_DS_CLASS_T_DEC			\
+    template<typename T>
+
+#define PB_DS_CLASS_C_DEC				\
+    dbg_ex_allocator<					\
+						T>
+
+    template<typename T>
+    class dbg_ex_allocator : public detail::dbg_ex_allocator_base
+    {
+    public:
+      typedef size_t size_type;
+      typedef ptrdiff_t difference_type;
+      typedef T* pointer;
+      typedef const T* const_pointer;
+      typedef T& reference;
+      typedef const T& const_reference;
+      typedef T value_type;
+
+      template<typename U>
+      struct rebind
+      {
+        typedef dbg_ex_allocator<U> other;
+      };
+
+      dbg_ex_allocator() throw();
+
+      dbg_ex_allocator(const PB_DS_CLASS_C_DEC& ) throw();
+
+      template <class U>
+      dbg_ex_allocator(const dbg_ex_allocator<U>& ) throw();
+
+      ~dbg_ex_allocator() throw();
+
+      size_type
+      max_size() const throw();
+
+      pointer
+      allocate(size_type num, std::allocator<void>::const_pointer hint = 0);
+
+      void
+      construct(pointer p, const T& r_val);
+
+      void
+      destroy(pointer p);
+
+      void
+      deallocate(pointer p, size_type num);
+
+      void
+      check_allocated(pointer p, size_type num);
+    };
+
+    PB_DS_CLASS_T_DEC
+    inline bool
+    operator==(const PB_DS_CLASS_C_DEC& , const PB_DS_CLASS_C_DEC& );
+
+    PB_DS_CLASS_T_DEC
+    PB_DS_CLASS_C_DEC::
+    dbg_ex_allocator() throw()
+    { }
+
+    PB_DS_CLASS_T_DEC
+    PB_DS_CLASS_C_DEC::
+    dbg_ex_allocator(const PB_DS_CLASS_C_DEC& ) throw()
+    { }
+
+    PB_DS_CLASS_T_DEC
+    template<typename U>
+    PB_DS_CLASS_C_DEC::
+    dbg_ex_allocator(const dbg_ex_allocator<U>& ) throw()
+    { }
+
+    PB_DS_CLASS_T_DEC
+    PB_DS_CLASS_C_DEC::
+    ~dbg_ex_allocator() throw()
+    { }
+
+    PB_DS_CLASS_T_DEC
+    typename PB_DS_CLASS_C_DEC::size_type
+    PB_DS_CLASS_C_DEC::
+    max_size() const throw()
+    {
+      return (std::allocator<T>().max_size());
+    }
+
+    PB_DS_CLASS_T_DEC
+    typename PB_DS_CLASS_C_DEC::pointer
+    PB_DS_CLASS_C_DEC::
+    allocate(size_type num, std::allocator<void>::const_pointer hint/*= 0*/)
+    {
+      cond_throw();
+
+      T* const a_t = std::allocator<T>().allocate(num, hint);
+
+      insert(a_t, sizeof(T)*  num);
+
+      return (a_t);
+    }
+
+    PB_DS_CLASS_T_DEC
+    void
+    PB_DS_CLASS_C_DEC::
+    construct(pointer p, const T& r_val)
+    {
+      return (std::allocator<T>().construct(p, r_val));
+    }
+
+    PB_DS_CLASS_T_DEC
+    void
+    PB_DS_CLASS_C_DEC::
+    destroy(pointer p)
+    {
+      std::allocator<T>().destroy(p);
+    }
+
+    PB_DS_CLASS_T_DEC
+    void
+    PB_DS_CLASS_C_DEC::
+    deallocate(pointer p, size_type num)
+    {
+      erase(p, sizeof(T)*  num);
+
+      std::allocator<T>().deallocate(p, num);
+    }
+
+    PB_DS_CLASS_T_DEC
+    void
+    PB_DS_CLASS_C_DEC::
+    check_allocated(pointer p, size_type num)
+    {
+      detail::dbg_ex_allocator_base::check_allocated(p, sizeof(T)*  num);
+    }
+
+    PB_DS_CLASS_T_DEC
+    inline bool
+    operator==(const PB_DS_CLASS_C_DEC& , const PB_DS_CLASS_C_DEC& )
+    {
+      return (true);
+    }
+
+#undef PB_DS_CLASS_T_DEC
+#undef PB_DS_CLASS_C_DEC
+
+  } // namespace test
+
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_DBG_EX_ALLOCATOR_HPP
diff --git a/libstdc++-v3/testsuite/util/regression/res_mng/dbg_ex_allocator_base.cc b/libstdc++-v3/testsuite/util/regression/res_mng/dbg_ex_allocator_base.cc
new file mode 100644
index 00000000000..6038ab0c0c9
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/regression/res_mng/dbg_ex_allocator_base.cc
@@ -0,0 +1,210 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file dbg_ex_allocator_base.cpp
+ * Contains a debugging, exception throwing, allocator used for tests.
+ */
+
+#include <util/regression/res_mng/dbg_ex_allocator_base.hpp>
+
+namespace pb_ds
+{
+
+  namespace test
+  {
+
+    namespace detail
+    {
+
+      twister_rand_gen dbg_ex_allocator_base::s_g;
+
+      dbg_ex_allocator_base::map_t
+      dbg_ex_allocator_base::s_map;
+
+      double dbg_ex_allocator_base::s_throw_prob;
+
+      size_t dbg_ex_allocator_base::s_label = 0;
+
+      dbg_ex_allocator_base::entry_t
+      dbg_ex_allocator_base::
+      make_entry(void* p_r, size_t size)
+      {
+	return std::make_pair(
+			      p_r,
+			      alloc_data_t(s_label, size));
+      }
+
+      void
+      dbg_ex_allocator_base::
+      init(unsigned long seed)
+      {
+	s_g.init(seed);
+      }
+
+      void
+      dbg_ex_allocator_base::
+      set_throw_prob(double throw_prob)
+      {
+	s_throw_prob = throw_prob;
+      }
+
+      double
+      dbg_ex_allocator_base::
+      get_throw_prob()
+      {
+	return (s_throw_prob);
+      }
+
+      void
+      dbg_ex_allocator_base::
+      set_label(size_t l)
+      {
+	s_label = l;
+      }
+
+      void
+      dbg_ex_allocator_base::
+      insert(void* p_r, size_t size)
+      {
+	const_iterator found_it = s_map.find(p_r);
+
+	if (found_it != s_map.end())
+	  {
+	    std::cerr << "Double insert! " << std::endl;
+	    print_to_ostream(std::cerr, make_entry(p_r, size));
+	    print_to_ostream(std::cerr, * found_it);
+
+	    throw std::logic_error("double insert");
+	  }
+
+	s_map.insert(make_entry(p_r, size));
+      }
+
+      bool
+      dbg_ex_allocator_base::
+      empty()
+      {
+	return (s_map.empty());
+      }
+
+      void
+      dbg_ex_allocator_base::
+      erase(void* p_r, size_t size)
+      {
+	check_allocated(p_r, size);
+
+	s_map.erase(p_r);
+      }
+
+      void
+      dbg_ex_allocator_base::
+      check_allocated(void* p_r, size_t size)
+      {
+	const_iterator found_it =
+	  s_map.find(p_r);
+
+	if (found_it == s_map.end())
+	  {
+	    std::cerr << "Null erase! " << std::endl;
+	    print_to_ostream(std::cerr, make_entry(p_r, size));
+
+	    throw std::logic_error("null erase");
+	  }
+
+	if (found_it->second.second != size)
+	  {
+	    std::cerr << "Wrong-size erase! " << std::endl;
+	    print_to_ostream(std::cerr, make_entry(p_r, size));
+	    print_to_ostream(std::cerr, * found_it);
+
+	    throw std::logic_error("wrong-size erase");
+	  }
+      }
+
+      void
+      dbg_ex_allocator_base::
+      cond_throw()
+      {
+	if (s_g.get_prob() < s_throw_prob)
+	  throw forced_exception();
+      }
+
+      void
+      dbg_ex_allocator_base::
+      print_to_ostream(std::ostream& r_os)
+      {
+	const_iterator it =
+	  dbg_ex_allocator_base::s_map.begin();
+
+	const_iterator end_it =
+	  dbg_ex_allocator_base::s_map.end();
+
+	for (; it != end_it; ++it)
+	  print_to_ostream(r_os, * it);
+
+	r_os << std::endl;
+      }
+
+      void
+      dbg_ex_allocator_base::
+      print_to_ostream(std::ostream& r_os, const_reference r_entry)
+      {
+	r_os << r_entry.first << ": ";
+	r_os << r_entry.second.first << ", ";
+	r_os << r_entry.second.second;
+
+	r_os << std::endl;
+      }
+
+      std::ostream& 
+      operator<<(std::ostream& r_os, const dbg_ex_allocator_base& /*r_dbg*/)
+      {
+	dbg_ex_allocator_base::print_to_ostream(r_os);
+
+	return r_os;
+      }
+
+    } // namespace detail
+
+  } // namespace test
+
+} // namespace pb_ds
diff --git a/libstdc++-v3/testsuite/util/regression/res_mng/dbg_ex_allocator_base.hpp b/libstdc++-v3/testsuite/util/regression/res_mng/dbg_ex_allocator_base.hpp
new file mode 100644
index 00000000000..caedd36aa52
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/regression/res_mng/dbg_ex_allocator_base.hpp
@@ -0,0 +1,187 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file dbg_ex_allocator_base.hpp
+ * Contains a debugging, exception throwing, allocator used for tests.
+ */
+
+#ifndef PB_DS_DBG_EX_ALLOCATOR_BASE_HPP
+#define PB_DS_DBG_EX_ALLOCATOR_BASE_HPP
+
+#include <math.h>
+#include <map>
+#include <set>
+#include <iostream>
+#include <stdexcept>
+#include <regression/res_mng/forced_exception.hpp>
+#include <rng/twister_rand_gen.hpp>
+
+namespace pb_ds
+{
+
+  namespace test
+  {
+
+    namespace detail
+    {
+
+      class dbg_ex_allocator_base;
+
+      std::ostream& 
+      operator<<(std::ostream& r_os, const dbg_ex_allocator_base& r_dbg);
+
+      class dbg_ex_allocator_base
+      {
+      public:
+	typedef size_t label;
+
+      public:
+	void
+        init(unsigned long seed);
+
+	static void
+        set_throw_prob(double throw_prob);
+
+	static double
+        get_throw_prob();
+
+	static void
+        set_label(size_t l);
+
+	static bool
+        empty();
+
+	class group_throw_prob_adjustor
+	{
+	public:
+	  group_throw_prob_adjustor(size_t size) : m_orig_throw_prob(s_throw_prob)
+	  {
+            s_throw_prob =
+	      1 - ::pow((double)(
+				 1 - s_throw_prob),(double)(0.5 / (size + 1)));
+	  }
+
+	  ~group_throw_prob_adjustor()
+	  {
+            s_throw_prob = m_orig_throw_prob;
+	  }
+
+	private:
+	  const double m_orig_throw_prob;
+	};
+
+	class zero_throw_prob_adjustor
+	{
+	public:
+	  zero_throw_prob_adjustor() : m_orig_throw_prob(s_throw_prob)
+	  {
+            s_throw_prob = 0;
+	  }
+
+	  ~zero_throw_prob_adjustor()
+	  {
+            s_throw_prob = m_orig_throw_prob;
+	  }
+
+	private:
+	  const double m_orig_throw_prob;
+	};
+
+      protected:
+	static void
+        insert(void* p_r, size_t size);
+
+	static void
+        erase(void* p_r, size_t size);
+
+	static void
+        cond_throw();
+
+	static void
+        assert_allocatod(const void* p_r, size_t size);
+
+	static void
+        check_allocated(void* p_r, size_t size);
+
+      private:
+	typedef std::pair< label, size_t> alloc_data_t;
+
+	typedef std::map< void* , alloc_data_t> map_t;
+
+	typedef map_t::value_type entry_t;
+
+	typedef map_t::const_iterator const_iterator;
+
+	typedef map_t::const_reference const_reference;
+
+      private:
+	static void
+        print_to_ostream(std::ostream& r_os);
+
+	static void
+        print_to_ostream(std::ostream& r_os, const_reference r_entry);
+
+	static entry_t
+        make_entry(void* p_r, size_t size);
+
+      private:
+	static twister_rand_gen s_g;
+
+	static map_t s_map;
+
+	static double s_throw_prob;
+
+	static size_t s_label;
+
+	friend std::ostream& operator<<(std::ostream& r_os, const dbg_ex_allocator_base& r_dbg);
+      };
+
+      std::ostream& 
+      operator<<(std::ostream& r_os, const dbg_ex_allocator_base& r_dbg);
+
+    } // namespace detail
+
+  } // namespace test
+
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_DBG_EX_ALLOCATOR_BASE_HPP
diff --git a/libstdc++-v3/testsuite/util/regression/res_mng/forced_exception.hpp b/libstdc++-v3/testsuite/util/regression/res_mng/forced_exception.hpp
new file mode 100644
index 00000000000..a46ad2c0604
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/regression/res_mng/forced_exception.hpp
@@ -0,0 +1,64 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file forced_exception.hpp
+ * Contains an exception thrown by the debugging allocator.
+ */
+
+#ifndef PB_DS_FORCED_EXCEPTION_HPP
+#define PB_DS_FORCED_EXCEPTION_HPP
+
+namespace pb_ds
+{
+
+  namespace test
+  {
+
+    struct forced_exception
+    { };
+
+  } // namespace test
+
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_FORCED_EXCEPTION_HPP
+
diff --git a/libstdc++-v3/testsuite/util/regression/trait/assoc/get_set_load_trait.hpp b/libstdc++-v3/testsuite/util/regression/trait/assoc/get_set_load_trait.hpp
new file mode 100644
index 00000000000..dac0c7f4719
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/regression/trait/assoc/get_set_load_trait.hpp
@@ -0,0 +1,100 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file get_set_load_trait.hpp
+ * Containsert traits for a random regression test
+ *    for a specific container type.
+ */
+
+#ifndef PB_DS_REGRESSION_TEST_SET_LOAD_TRAIT_HPP
+#define PB_DS_REGRESSION_TEST_SET_LOAD_TRAIT_HPP
+
+#include <ext/pb_ds/assoc_container.hpp>
+
+namespace pb_ds
+{
+
+  namespace test
+  {
+
+    namespace detail
+    {
+
+      template<typename Cntnr, class Tag>
+      struct regression_test_get_set_load_traits
+      {
+	enum
+	  {
+	    value = false
+	  };
+      };
+
+      template<typename Cntnr>
+      struct regression_test_hash_get_set_load_traits
+      {
+	enum
+	  {
+	    value = Cntnr::resize_policy::trigger_policy::get_set_load
+	  };
+      };
+
+      template<typename Cntnr>
+      struct regression_test_get_set_load_traits<
+        Cntnr,
+        pb_ds::cc_hash_tag> : public regression_test_hash_get_set_load_traits<
+        Cntnr>
+      { };
+
+      template<typename Cntnr>
+      struct regression_test_get_set_load_traits<
+        Cntnr,
+        pb_ds::gp_hash_tag> : public regression_test_hash_get_set_load_traits<
+        Cntnr>
+      { };
+
+    } // namespace detail
+
+  } // namespace test
+
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_REGRESSION_TEST_SET_LOAD_TRAIT_HPP
diff --git a/libstdc++-v3/testsuite/util/regression/trait/assoc/get_set_loads_trait.hpp b/libstdc++-v3/testsuite/util/regression/trait/assoc/get_set_loads_trait.hpp
new file mode 100644
index 00000000000..17c872ee83e
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/regression/trait/assoc/get_set_loads_trait.hpp
@@ -0,0 +1,100 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file get_set_loads_trait.hpp
+ * Containsert traits for a random regression test
+ *    for a specific container type.
+ */
+
+#ifndef PB_DS_REGRESSION_TEST_SET_LOADS_TRAIT_HPP
+#define PB_DS_REGRESSION_TEST_SET_LOADS_TRAIT_HPP
+
+#include <ext/pb_ds/assoc_container.hpp>
+
+namespace pb_ds
+{
+
+  namespace test
+  {
+
+    namespace detail
+    {
+
+      template<typename Cntnr, class Tag>
+      struct regression_test_get_set_loacontainer_traits
+      {
+	enum
+	  {
+	    value = false
+	  };
+      };
+
+      template<typename Cntnr>
+      struct regression_test_hash_get_set_loacontainer_traits
+      {
+	enum
+	  {
+	    value = Cntnr::resize_policy::trigger_policy::get_set_loads
+	  };
+      };
+
+      template<typename Cntnr>
+      struct regression_test_get_set_loacontainer_traits<
+        Cntnr,
+        pb_ds::cc_hash_tag> : public regression_test_hash_get_set_loacontainer_traits<
+        Cntnr>
+      { };
+
+      template<typename Cntnr>
+      struct regression_test_get_set_loacontainer_traits<
+        Cntnr,
+        pb_ds::gp_hash_tag> : public regression_test_hash_get_set_loacontainer_traits<
+        Cntnr>
+      { };
+
+    } // namespace detail
+
+  } // namespace test
+
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_REGRESSION_TEST_SET_LOADS_TRAIT_HPP
diff --git a/libstdc++-v3/testsuite/util/regression/trait/assoc/native_type_trait.hpp b/libstdc++-v3/testsuite/util/regression/trait/assoc/native_type_trait.hpp
new file mode 100644
index 00000000000..1c65c6c81f8
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/regression/trait/assoc/native_type_trait.hpp
@@ -0,0 +1,195 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file native_type_trait.hpp
+ * Containsert traits for a random regression test
+ *    for a specific container type.
+ */
+
+#ifndef PB_DS_REGRESSION_TEST_NATIVE_TYPE_TRAIT_HPP
+#define PB_DS_REGRESSION_TEST_NATIVE_TYPE_TRAIT_HPP
+
+namespace pb_ds
+{
+
+  namespace test
+  {
+
+    namespace detail
+    {
+
+      template<typename Key, class Allocator>
+      struct native_key_type;
+
+      template<typename Allocator>
+      struct native_key_type<
+	basic_type,
+	Allocator>
+      {
+	typedef std::string type;
+
+	static type
+        native_key(typename Allocator::template rebind<
+		   basic_type>::other::const_reference r_key)
+	{
+	  return (std::string(r_key));
+	}
+      };
+
+      template<typename Hd, class Tl, class Allocator>
+      struct native_key_type<
+	std::pair<
+        Hd,
+        Tl>,
+	Allocator>
+      {
+	typedef typename native_key_type< Hd, Allocator>::type hd_type;
+
+	typedef typename native_key_type< Tl, Allocator>::type tl_type;
+
+	typedef std::pair< hd_type, tl_type> type;
+
+	static type
+        native_key(typename Allocator::template rebind<            std::pair<Hd, Tl> >::other::const_reference r_key)
+	{
+	  return (std::make_pair(
+				 native_key_type<Hd, Allocator>::native_key(r_key.first),
+				 native_key_type<Tl, Allocator>::native_key(r_key.second)));
+	}
+      };
+
+      template<typename Native_Key_Type,
+	       class Key_Type,
+	       class Data_Type,
+	       class Allocator>
+      struct native_type_traits_base;
+
+      template<typename Native_Key_Type, class Key_Type, class Allocator>
+      struct native_type_traits_base<
+	Native_Key_Type,
+	Key_Type,
+	basic_type,
+	Allocator>
+      {
+      public:
+	typedef std::map< Native_Key_Type, std::string> type;
+
+      public:
+	static const typename type::key_type& 
+        extract_key(typename type::const_reference r_val)
+	{
+	  return (r_val.first);
+	}
+
+	static typename type::value_type
+        native_value(typename Allocator::template rebind<            std::pair<Key_Type, basic_type> >::other::const_reference r_val)
+	{
+	  return (std::make_pair(
+				 native_key_type<Key_Type, Allocator>::native_key(r_val.first),
+				 std::string(r_val.second)));
+	}
+      };
+
+      template<typename Native_Key_Type, class Key_Type, class Allocator>
+      struct native_type_traits_base<
+	Native_Key_Type,
+	Key_Type,
+	pb_ds::null_mapped_type,
+	Allocator>
+      {
+      public:
+	typedef std::set< Native_Key_Type> type;
+
+      public:
+	static const typename type::key_type& 
+        extract_key(typename type::const_reference r_val)
+	{
+	  return (r_val);
+	}
+
+	static typename type::value_type
+        native_value(typename Allocator::template rebind<
+		     Key_Type>::other::const_reference r_val)
+	{
+	  return (native_key_type<Key_Type, Allocator>::native_key(
+								   r_val));
+	}
+      };
+
+#define PB_DS_NATIVE_KEY_TYPE_C_DEC				\
+      native_key_type<						\
+						Key_Type,	\
+						Allocator>
+
+#define PB_DS_BASE_C_DEC						\
+      native_type_traits_base<						\
+									typename PB_DS_NATIVE_KEY_TYPE_C_DEC::type, \
+									Key_Type, \
+									Data_Type, \
+									Allocator>
+
+      template<typename Key_Type, class Data_Type, class Allocator>
+      struct native_type_traits : public PB_DS_BASE_C_DEC
+      {
+	typedef typename PB_DS_BASE_C_DEC::type type;
+
+	typedef typename type::key_type key_type;
+
+	static typename PB_DS_NATIVE_KEY_TYPE_C_DEC::type
+        native_key(typename Allocator::template rebind<
+		   Key_Type>::other::const_reference r_key)
+	{
+	  return (PB_DS_NATIVE_KEY_TYPE_C_DEC::native_key(r_key));
+	}
+      };
+
+#undef PB_DS_BASE_C_DEC
+
+#undef PB_DS_NATIVE_KEY_TYPE_C_DEC
+
+    } // namespace detail
+
+  } // namespace test
+
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_REGRESSION_TEST_NATIVE_TYPE_TRAIT_HPP
diff --git a/libstdc++-v3/testsuite/util/regression/trait/assoc/node_update_trait.hpp b/libstdc++-v3/testsuite/util/regression/trait/assoc/node_update_trait.hpp
new file mode 100644
index 00000000000..9f235116ecb
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/regression/trait/assoc/node_update_trait.hpp
@@ -0,0 +1,134 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file node_update_trait.hpp
+ * Containsert traits for a random regression test
+ *    for a specific container type.
+ */
+
+#ifndef PB_DS_REGRESSION_TEST_NODE_UPDATOR_TRAIT_HPP
+#define PB_DS_REGRESSION_TEST_NODE_UPDATOR_TRAIT_HPP
+
+#include <ext/pb_ds/assoc_container.hpp>
+#include <common_type/assoc/detail/tree_supports_order_statistics.hpp>
+#include <common_type/assoc/detail/trie_supports_order_statistics.hpp>
+#include <common_type/assoc/detail/trie_supports_prefix_search.hpp>
+
+namespace pb_ds
+{
+
+  namespace test
+  {
+
+    namespace detail
+    {
+
+      template<typename Cntnr, class Tag>
+      struct regression_test_node_update_traits
+      {
+	enum
+	  {
+	    order_statistics = false,
+	    prefix_search = false
+	  };
+      };
+
+      template<typename Cntnr>
+      struct regression_test_node_update_traits<
+	Cntnr,
+	pb_ds::pat_trie_tag>
+      {
+	enum
+	  {
+	    order_statistics =
+            trie_supports_order_statistics<Cntnr>::value,
+	    prefix_search =
+            trie_supports_prefix_search<Cntnr>::value
+	  };
+      };
+
+      template<typename Cntnr>
+      struct regression_test_node_update_traits<
+	Cntnr,
+	pb_ds::rb_tree_tag>
+      {
+	enum
+	  {
+	    order_statistics =
+            tree_supports_order_statistics<Cntnr>::value,
+	    prefix_search = false
+	  };
+      };
+
+      template<typename Cntnr>
+      struct regression_test_node_update_traits<
+	Cntnr,
+	pb_ds::splay_tree_tag>
+      {
+	enum
+	  {
+	    order_statistics =
+            tree_supports_order_statistics<Cntnr>::value,
+	    prefix_search = false
+	  };
+      };
+
+      template<typename Cntnr>
+      struct regression_test_node_update_traits<
+	Cntnr,
+	pb_ds::ov_tree_tag>
+      {
+	enum
+	  {
+	    order_statistics =
+            tree_supports_order_statistics<Cntnr>::value,
+	    prefix_search = false
+	  };
+      };
+
+    } // namespace detail
+
+  } // namespace test
+
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_REGRESSION_TEST_NODE_UPDATOR_TRAIT_HPP
diff --git a/libstdc++-v3/testsuite/util/regression/trait/assoc/resize_trait.hpp b/libstdc++-v3/testsuite/util/regression/trait/assoc/resize_trait.hpp
new file mode 100644
index 00000000000..24ee05b15c5
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/regression/trait/assoc/resize_trait.hpp
@@ -0,0 +1,100 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file resize_trait.hpp
+ * Containsert traits for a random regression test
+ *    for a specific container type.
+ */
+
+#ifndef PB_DS_REGRESSION_TEST_RESIZE_TRAIT_HPP
+#define PB_DS_REGRESSION_TEST_RESIZE_TRAIT_HPP
+
+#include <ext/pb_ds/assoc_container.hpp>
+
+namespace pb_ds
+{
+
+  namespace test
+  {
+
+    namespace detail
+    {
+
+      template<typename Cntnr, class Tag>
+      struct regression_test_resize_traits
+      {
+	enum
+	  {
+	    value = false
+	  };
+      };
+
+      template<typename Cntnr>
+      struct regression_test_hash_resize_traits
+      {
+	enum
+	  {
+	    value = Cntnr::resize_policy::external_size_access
+	  };
+      };
+
+      template<typename Cntnr>
+      struct regression_test_resize_traits<
+        Cntnr,
+        pb_ds::cc_hash_tag> : public regression_test_hash_resize_traits<
+        Cntnr>
+      { };
+
+      template<typename Cntnr>
+      struct regression_test_resize_traits<
+        Cntnr,
+        pb_ds::gp_hash_tag> : public regression_test_hash_resize_traits<
+        Cntnr>
+      { };
+
+    } // namespace detail
+
+  } // namespace test
+
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_REGRESSION_TEST_RESIZE_TRAIT_HPP
diff --git a/libstdc++-v3/testsuite/util/regression/trait/assoc/to_string.hpp b/libstdc++-v3/testsuite/util/regression/trait/assoc/to_string.hpp
new file mode 100644
index 00000000000..d07b330cadb
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/regression/trait/assoc/to_string.hpp
@@ -0,0 +1,91 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file to_string.hpp
+ * Containsert classes for transforming stuff to strings.
+ */
+
+#ifndef PB_DS_REGRESSION_TEST_TO_STRING_HPP
+#define PB_DS_REGRESSION_TEST_TO_STRING_HPP
+
+#include <regression/basic_type.hpp>
+#include <string>
+
+namespace pb_ds
+{
+
+  namespace test
+  {
+
+    namespace detail
+    {
+
+      std::string
+      to_string(const basic_type& r_t)
+      {
+	return (r_t);
+      }
+
+      std::string
+      to_string(const std::string& r_t)
+      {
+	return (r_t);
+      }
+
+      template<typename Hd, class Tl>
+      std::string
+      to_string(const std::pair<Hd, Tl>&r_t)
+      {
+	std::ostringstream ret;
+
+	ret << to_string(r_t.first) << " " << to_string(r_t.second);
+
+	return (ret.str());
+      }
+
+    } // namespace detail
+
+  } // namespace test
+
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_REGRESSION_TEST_TO_STRING_HPP
diff --git a/libstdc++-v3/testsuite/util/regression/trait/assoc/trait.hpp b/libstdc++-v3/testsuite/util/regression/trait/assoc/trait.hpp
new file mode 100644
index 00000000000..8cf8c1271fc
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/regression/trait/assoc/trait.hpp
@@ -0,0 +1,289 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file trait.hpp
+ * Containsert traits for a random regression test
+ *    for a specific container type.
+ */
+
+#ifndef PB_DS_REGRESSION_TEST_TRAIT_HPP
+#define PB_DS_REGRESSION_TEST_TRAIT_HPP
+
+#include <regression/trait/assoc/to_string.hpp>
+#include <regression/trait/assoc/type_trait.hpp>
+#include <regression/trait/assoc/native_type_trait.hpp>
+#include <regression/trait/assoc/resize_trait.hpp>
+#include <regression/trait/assoc/get_set_loads_trait.hpp>
+#include <regression/trait/assoc/get_set_load_trait.hpp>
+#include <regression/trait/assoc/node_update_trait.hpp>
+#include <regression/trait/erase_if_fn.hpp>
+
+namespace pb_ds
+{
+
+  namespace test
+  {
+
+    namespace detail
+    {
+
+#define PB_DS_CLASS_T_DEC			\
+      template<typename Cntnr>
+
+#define PB_DS_CLASS_C_DEC				\
+      regression_test_traits<				\
+						Cntnr>
+
+#define PB_DS_TYPE_TRAITS_C_DEC				\
+      regression_test_type_traits<			\
+						Cntnr>
+
+#define PB_DS_NATIVE_TYPE_TRAITS_C_DEC					\
+      native_type_traits<						\
+									typename PB_DS_TYPE_TRAITS_C_DEC::key_type, \
+									typename PB_DS_TYPE_TRAITS_C_DEC::mapped_type, \
+									typename Cntnr::allocator>
+
+#define PB_DS_RESIZE_TRAITS_C_DEC					\
+      regression_test_resize_traits<					\
+									Cntnr, \
+									typename Cntnr::container_category>
+
+#define PB_DS_SET_LOADS_TRAITS_C_DEC					\
+      regression_test_get_set_loacontainer_traits<			\
+										Cntnr, \
+										typename Cntnr::container_category>
+
+#define PB_DS_SET_LOAD_TRAITS_C_DEC					\
+      regression_test_get_set_load_traits<				\
+									Cntnr, \
+									typename Cntnr::container_category>
+
+#define PB_DS_NODE_UPDATOR_TRAITS_C_DEC					\
+      regression_test_node_update_traits<				\
+									Cntnr, \
+									typename Cntnr::container_category>
+
+      template<typename Cntnr>
+      struct regression_test_traits : private PB_DS_TYPE_TRAITS_C_DEC,
+				      private PB_DS_NATIVE_TYPE_TRAITS_C_DEC,
+				      private PB_DS_RESIZE_TRAITS_C_DEC,
+				      private PB_DS_NODE_UPDATOR_TRAITS_C_DEC,
+				      private PB_DS_SET_LOADS_TRAITS_C_DEC,
+				      private PB_DS_SET_LOAD_TRAITS_C_DEC
+      {
+
+      private:
+	typedef PB_DS_NATIVE_TYPE_TRAITS_C_DEC native_type_traits_base;
+
+	typedef PB_DS_TYPE_TRAITS_C_DEC type_traits_base;
+
+      public:
+
+	typedef typename Cntnr::key_type key_type;
+
+	typedef typename Cntnr::const_key_reference const_key_reference;
+
+	typedef typename Cntnr::value_type value_type;
+
+	typedef typename Cntnr::const_reference const_reference;
+
+	typedef typename PB_DS_NATIVE_TYPE_TRAITS_C_DEC::type native_type;
+
+	typedef typename native_type::key_type native_key_type;
+
+	typedef typename native_type::value_type native_value_type;
+
+	enum
+	  {
+	    resize = PB_DS_RESIZE_TRAITS_C_DEC::value,
+	    get_set_loads = PB_DS_SET_LOADS_TRAITS_C_DEC::value,
+	    get_set_load = PB_DS_SET_LOAD_TRAITS_C_DEC::value,
+	    order_statistics =
+            PB_DS_NODE_UPDATOR_TRAITS_C_DEC::order_statistics,
+	    prefix_search =
+            PB_DS_NODE_UPDATOR_TRAITS_C_DEC::prefix_search
+	  };
+
+	template<typename T>
+	struct erase_if_fn : public regression_test_erase_if_fn<
+	  T>
+	{
+
+	};
+
+	static size_t
+        erase_if(native_type& r_native_c)
+	{
+	  typedef
+            regression_test_erase_if_fn<
+	    typename native_type::value_type>
+            erase_if_fn;
+
+	  typename native_type::iterator it = r_native_c.begin();
+
+	  size_t num_ersd = 0;
+
+	  while (it != r_native_c.end())
+            if (erase_if_fn()(*it))
+	      {
+                ++num_ersd;
+
+                r_native_c.erase(it);
+
+                it = r_native_c.begin();
+	      }
+            else
+	      ++it;
+
+	  return (num_ersd);
+	}
+
+	static void
+        print_container(const Cntnr& r_c, std::ostream& r_os)
+	{
+	  PB_DS_TYPE_TRAITS_C_DEC::print_container(r_c, r_os);
+	}
+
+      public:
+
+	template<typename Gen>
+	static key_type
+        generate_key(Gen& r_gen, size_t max)
+	{
+	  return (PB_DS_TYPE_TRAITS_C_DEC::generate_key(r_gen, max));
+	}
+
+	template<typename Gen>
+	static value_type
+        generate_value(Gen& r_gen, size_t max)
+	{
+	  return (PB_DS_TYPE_TRAITS_C_DEC::generate_value(r_gen, max));
+	}
+
+	static const_key_reference
+        extract_key(const_reference r_val)
+	{
+	  return type_traits_base::extract_key(r_val);
+	}
+
+	static native_key_type
+        native_key(const_key_reference r_key)
+	{
+	  return (native_type_traits_base::native_key(r_key));
+	}
+
+	static native_value_type
+        native_value(const_reference r_val)
+	{
+	  return (native_type_traits_base::native_value(r_val));
+	}
+
+	static const native_key_type& 
+        extract_native_key(const native_value_type& r_val)
+	{
+	  return (native_type_traits_base::extract_key(r_val));
+	}
+
+	static bool
+        cmp(const_reference r_val, const native_value_type& r_native_val)
+	{
+	  return (val_to_string(r_val) ==
+		  native_val_to_string(r_native_val));
+	}
+
+	static std::string
+        val_to_string(const_reference r_val)
+	{
+	  return (to_string(r_val));
+	}
+
+	static std::string
+        key_to_string(const_key_reference r_key)
+	{
+	  return (to_string(r_key));
+	}
+
+	static std::string
+        native_val_to_string(const native_value_type& r_native_val)
+	{
+	  return (to_string(r_native_val));
+	}
+
+	static bool
+        prefix_match(const_key_reference r_key, const std::string& r_native_key)
+	{
+	  const size_t native_substr_len = std::min(
+						    r_key.length(),
+						    r_native_key.length());
+
+	  const std::string native_substr =
+            r_native_key.substr(0, native_substr_len);
+
+	  return (native_substr == (const std::string& )r_key);
+	}
+
+      };
+
+#undef PB_DS_TYPE_TRAITS_C_DEC
+
+#undef PB_DS_NATIVE_TYPE_TRAITS_C_DEC
+
+#undef PB_DS_RESIZE_TRAITS_C_DEC
+
+#undef PB_DS_SET_LOADS_TRAITS_C_DEC
+
+#undef PB_DS_SET_LOAD_TRAITS_C_DEC
+
+#undef PB_DS_NODE_UPDATOR_TRAITS_C_DEC
+
+#undef PB_DS_CLASS_T_DEC
+
+#undef PB_DS_CLASS_C_DEC
+
+    } // namespace detail
+
+  } // namespace test
+
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_REGRESSION_TEST_TRAIT_HPP
diff --git a/libstdc++-v3/testsuite/util/regression/trait/assoc/type_trait.hpp b/libstdc++-v3/testsuite/util/regression/trait/assoc/type_trait.hpp
new file mode 100644
index 00000000000..f0da95ed0dd
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/regression/trait/assoc/type_trait.hpp
@@ -0,0 +1,161 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file type_trait.hpp
+ * Containsert traits for a random regression test
+ *    for a specific container type.
+ */
+
+#ifndef PB_DS_REGRESSION_TEST_TYPE_TRAIT_HPP
+#define PB_DS_REGRESSION_TEST_TYPE_TRAIT_HPP
+
+#include <regression/basic_type.hpp>
+
+namespace pb_ds
+{
+
+  namespace test
+  {
+
+    namespace detail
+    {
+
+      template<typename Cntnr>
+      struct regression_test_type_traits
+      {
+
+      public:
+
+	typedef Cntnr cntnr;
+
+	typedef typename cntnr::key_type key_type;
+
+	typedef typename cntnr::const_key_reference const_key_reference;
+
+	typedef typename cntnr::value_type value_type;
+
+	typedef typename cntnr::const_reference const_reference;
+
+	typedef typename cntnr::mapped_type mapped_type;
+
+	typedef typename cntnr::const_mapped_reference const_mapped_reference;
+
+      public:
+
+	template<typename Gen>
+	static key_type
+        generate_key(Gen& r_gen, size_t max)
+	{
+	  return (basic_type(r_gen, max));
+	}
+
+	template<typename Gen>
+	static value_type
+        generate_value(Gen& r_gen, size_t max)
+	{
+	  return (generate_value(r_gen, max,
+				 pb_ds::detail::type_to_type<value_type>()));
+	}
+
+	static const_key_reference
+        extract_key(const_reference r_val)
+	{
+	  return extract_key_imp(r_val);
+	}
+
+      private:
+	typedef
+        typename Cntnr::allocator::template rebind<
+	basic_type>::other::const_reference
+        basic_type_const_reference;
+
+	typedef
+        typename Cntnr::allocator::template rebind<
+	  std::pair<
+	  basic_type,
+	  basic_type> >::other::const_reference
+        basic_type_pair_const_reference;
+
+      private:
+	template<typename Gen>
+	static value_type
+        generate_value(Gen& r_gen, size_t max,  pb_ds::detail::type_to_type<pb_ds::null_mapped_type>)
+	{
+	  return (basic_type(r_gen, max));
+	}
+
+	template<typename Gen>
+	static value_type
+        generate_value(Gen& r_gen, size_t max, pb_ds::detail::type_to_type<basic_type>)
+	{
+	  return (basic_type(r_gen, max));
+	}
+
+	template<typename Gen>
+	static value_type
+        generate_value(Gen& r_gen, size_t max, pb_ds::detail::type_to_type<std::pair<const basic_type, basic_type> >)
+	{
+	  return (std::make_pair(basic_type(r_gen, max), basic_type(r_gen, max)));
+	}
+
+	static const_key_reference
+        extract_key_imp(basic_type_const_reference r_val)
+	{
+	  return r_val;
+	}
+
+	static const_key_reference
+        extract_key_imp(basic_type_pair_const_reference r_val)
+	{
+	  return r_val.first;
+	}
+      };
+
+#undef PB_DS_BASE_C_DEC
+
+    } // namespace detail
+
+  } // namespace test
+
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_REGRESSION_TEST_TYPE_TRAIT_HPP
diff --git a/libstdc++-v3/testsuite/util/regression/trait/erase_if_fn.hpp b/libstdc++-v3/testsuite/util/regression/trait/erase_if_fn.hpp
new file mode 100644
index 00000000000..adab6b015ec
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/regression/trait/erase_if_fn.hpp
@@ -0,0 +1,111 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file erase_if_fn.hpp
+ * Containsert traits for a random regression test
+ *    for a specific container type.
+ */
+
+#ifndef PB_DS_REGRESSION_TEST_ERASE_IF_FN_HPP
+#define PB_DS_REGRESSION_TEST_ERASE_IF_FN_HPP
+
+#include <functional>
+
+namespace pb_ds
+{
+
+  namespace test
+  {
+
+    namespace detail
+    {
+
+      template<typename T>
+      struct regression_test_erase_if_fn : public std::unary_function<
+        T,
+        bool>
+      {
+      private:
+	typedef const T&  const_reference;
+
+      public:
+	bool
+        operator()(const_reference r_t) const
+	{
+	  return (r_t.length() == 0 ||
+		  static_cast<size_t>(*((r_t).begin())) % 2 == 1);
+	}
+      };
+
+      template<typename Hd, class Tl>
+      struct regression_test_erase_if_fn<
+        std::pair<
+	Hd,
+	Tl> > : public std::unary_function<
+        std::pair<
+	Hd,
+	Tl>,
+        bool>
+      {
+      private:
+	typedef const std::pair<Hd, Tl>&  const_reference;
+
+	typedef regression_test_erase_if_fn< Hd> hd_erase_if_fn;
+
+	typedef regression_test_erase_if_fn< Tl> tl_erase_if_fn;
+
+      public:
+	bool
+        operator()(const_reference r_t) const
+	{
+	  return (hd_erase_if_fn()(r_t.first)&& 
+		  tl_erase_if_fn()(r_t.second));
+	}
+      };
+
+    } // namespace detail
+
+  } // namespace test
+
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_REGRESSION_TEST_ERASE_IF_FN_HPP
diff --git a/libstdc++-v3/testsuite/util/regression/trait/priority_queue/trait.hpp b/libstdc++-v3/testsuite/util/regression/trait/priority_queue/trait.hpp
new file mode 100644
index 00000000000..80ffe1f7836
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/regression/trait/priority_queue/trait.hpp
@@ -0,0 +1,133 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file trait.hpp
+ * Containsert traits for a random regression test
+ *    for a specific container type.
+ */
+
+#ifndef PB_DS_REGRESSION_TEST_TRAIT_HPP
+#define PB_DS_REGRESSION_TEST_TRAIT_HPP
+
+#include <regression/trait/erase_if_fn.hpp>
+
+namespace pb_ds
+{
+
+  namespace test
+  {
+
+    namespace detail
+    {
+
+#define PB_DS_CLASS_T_DEC			\
+      template<typename Cntnr>
+
+#define PB_DS_CLASS_C_DEC				\
+      regression_test_traits<				\
+						Cntnr>
+
+      template<typename Cntnr>
+      struct regression_test_traits
+      {
+
+      public:
+
+	typedef typename Cntnr::value_type value_type;
+
+	typedef typename Cntnr::const_reference const_reference;
+
+	typedef
+        pb_ds::test::native_priority_queue<
+	  std::string,
+	  true>
+        native_type;
+
+	typedef typename native_type::value_type native_value_type;
+
+	template<typename T>
+	struct erase_if_fn : public regression_test_erase_if_fn<
+	  T>
+	{
+
+	};
+
+      public:
+
+	template<typename Gen>
+	static value_type
+        generate_value(Gen& r_gen, size_t max)
+	{
+	  return basic_type(r_gen, max);
+	}
+
+	static native_value_type
+        native_value(const_reference r_val)
+	{
+	  return (native_value_type(r_val));
+	}
+
+	static bool
+        cmp(const_reference r_val, const native_value_type& r_native_val)
+	{
+	  return (val_to_string(r_val) == r_native_val);
+	}
+
+	static std::string
+        val_to_string(const_reference r_val)
+	{
+	  return (std::string(r_val));
+	}
+
+      };
+
+#undef PB_DS_CLASS_T_DEC
+
+#undef PB_DS_CLASS_C_DEC
+
+    } // namespace detail
+
+  } // namespace test
+
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_REGRESSION_TEST_TRAIT_HPP
diff --git a/libstdc++-v3/testsuite/util/rng/twister_rand_gen.cc b/libstdc++-v3/testsuite/util/rng/twister_rand_gen.cc
new file mode 100644
index 00000000000..594a8008feb
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/rng/twister_rand_gen.cc
@@ -0,0 +1,203 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file twister_rand_gen.cpp
+ * Contains a random number generator invented and implemented by
+ *    Makoto Matsumoto
+ *    (http://www.math.sci.hiroshima-u.ac.jp/~m-mat/MT/emt.html)
+ */
+
+#include <util/rng/twister_rand_gen.hpp>
+#include <ctime>
+#include <iostream>
+
+namespace pb_ds
+{
+  namespace test
+  {
+#ifdef TWISTER_RAND_GEN_DEBUG
+#define PB_DS_DBG_ASSERT(X) assert(X)
+#define PB_DS_DBG_VERIFY(X) assert(X)
+#define PB_DS_DBG_ONLY(X) X
+#else // #ifdef TWISTER_RAND_GEN_DEBUG
+#define PB_DS_DBG_ASSERT(X)
+#define PB_DS_DBG_VERIFY(X) {if((X)==0);}
+#define PB_DS_DBG_ONLY(X) ;
+#endif // #ifdef TWISTER_RAND_GEN_DEBUG
+
+    enum
+      {
+	mers_n = 624,
+	mers_m = 397,
+	mers_r = 31,
+	mers_u = 11,
+	mers_s = 7,
+	mers_t = 15,
+	mers_l = 18,
+	mers_a = 0x9908B0DF,
+	mers_b = 0x9D2C5680,
+	mers_c = 0xEFC60000
+      };
+
+    twister_rand_gen::
+    twister_rand_gen(unsigned long seed)
+    { init(seed); }
+
+    void
+    twister_rand_gen::
+    init(unsigned long seed)
+    {
+      m_a_mt[0]= seed;
+
+      for (m_mti=1; m_mti < mers_n; ++m_mti)
+	m_a_mt[m_mti] = (1812433253UL* (m_a_mt[m_mti-1] ^ (m_a_mt[m_mti-1] >> 30)) + m_mti);
+
+      union
+      {
+	double m_f;
+	unsigned long m_a[2];
+      } u;
+
+      u.m_f = 1.0;
+
+      if (u.m_a[1] == 0x3FF00000)
+	m_endianess = little;
+      else if (u.m_a[0] == 0x3FF00000)
+	m_endianess = big;
+      else
+	m_endianess = none;
+    }
+
+    unsigned long
+    twister_rand_gen::
+    get_unsigned_long(unsigned long min, unsigned long max)
+    {
+      PB_DS_DBG_ASSERT(max >= min);
+      const double prob = get_prob();
+      const unsigned long rand_word =(unsigned long)((max - min+ 1)*  prob) + min;
+
+      PB_DS_DBG_ASSERT(rand_word <= max);
+      return rand_word;
+    }
+
+    double
+    twister_rand_gen::
+    get_prob()
+    {
+      union
+      {
+	double m_f;
+	unsigned long m_a[2];
+      } u;
+
+      unsigned long rand_word = get_unsigned_long_imp();
+
+      double ret;
+
+      switch(m_endianess)
+	{
+	case little:
+	  u.m_a[0] =    rand_word << 20;
+	  u.m_a[1] = (rand_word >> 12) | 0x3FF00000;
+	  ret = u.m_f - 1.0;
+	  break;
+	case big:
+	  u.m_a[1] =    rand_word << 20;
+	  u.m_a[0] = (rand_word >> 12) | 0x3FF00000;
+	  ret = u.m_f - 1.0;
+	  break;
+	case none:
+	default:
+	  break;
+	}
+
+      ret = (double)rand_word * (1./((double)(unsigned long)(-1L)+1.));
+
+      PB_DS_DBG_ASSERT(ret >= 0);
+      PB_DS_DBG_ASSERT(ret <= 1);
+
+      return ret;
+    }
+
+    unsigned long
+    twister_rand_gen::
+    get_unsigned_long_imp()
+    {
+      unsigned long y;
+      if (m_mti >= mers_n)
+	{
+	  const unsigned long LOWER_MASK = (1LU << mers_r) - 1;
+	  const unsigned long UPPER_MASK = static_cast<unsigned long>(-1L << mers_r);
+	  static const unsigned long m_a_mag01[2] = {0, mers_a};
+
+	  unsigned long kk;
+	  for (kk=0; kk < mers_n-mers_m; ++kk)
+	    {
+	      y = (m_a_mt[kk]&  UPPER_MASK) | (m_a_mt[kk+1]&  LOWER_MASK);
+	      m_a_mt[kk] = m_a_mt[kk+mers_m] ^ (y >> 1) ^ m_a_mag01[y&  1];
+	    }
+
+	  for (; kk < mers_n-1; ++kk)
+	    {
+	      y = (m_a_mt[kk]&  UPPER_MASK) | (m_a_mt[kk+1]&  LOWER_MASK);
+	      m_a_mt[kk] = m_a_mt[kk+(mers_m-mers_n)] ^ (y >> 1) ^ m_a_mag01[y&  1];
+	    }
+
+	  y = (m_a_mt[mers_n-1]&  UPPER_MASK) | (m_a_mt[0]&  LOWER_MASK);
+	  m_a_mt[mers_n-1] = m_a_mt[mers_m-1] ^ (y >> 1) ^ m_a_mag01[y&  1];
+	  m_mti = 0;
+	}
+
+      y = m_a_mt[m_mti++];
+
+      y ^=    y >> mers_u;
+      y ^= (y << mers_s)&  mers_b;
+      y ^= (y << mers_t)&  mers_c;
+      y ^=    y >> mers_l;
+      return y;
+    }
+
+#undef PB_DS_DBG_ASSERT
+#undef PB_DS_DBG_VERIFY
+#undef PB_DS_DBG_ONLY
+  } // namespace test
+} // namespace pb_ds
diff --git a/libstdc++-v3/testsuite/util/rng/twister_rand_gen.hpp b/libstdc++-v3/testsuite/util/rng/twister_rand_gen.hpp
new file mode 100644
index 00000000000..59396645b3c
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/rng/twister_rand_gen.hpp
@@ -0,0 +1,110 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file twister_rand_gen.hpp
+ * Contains a random number generator invented and implemented by
+ *    Makoto Matsumoto
+ *    (http://www.math.sci.hiroshima-u.ac.jp/~m-mat/MT/emt.html)
+ */
+
+#ifndef PB_DS_TWISTER_RAND_GEN_HPP
+#define PB_DS_TWISTER_RAND_GEN_HPP
+
+#include <ctime>
+#include <limits.h>
+
+namespace pb_ds
+{
+  namespace test
+  {
+    class twister_rand_gen
+    {
+    private:
+      enum
+	{
+	  mers_n = 624,
+	  mers_m = 397,
+	  mers_r = 31,
+	  mers_u = 11,
+	  mers_s = 7,
+	  mers_t = 15,
+	  mers_l = 18,
+	  mers_a = 0x9908B0DF,
+	  mers_b = 0x9D2C5680,
+	  mers_c = 0xEFC60000
+	};
+
+      unsigned long m_a_mt[mers_n];
+      unsigned long m_mti;
+
+      enum endianess_type
+	{
+	  little,
+	  big,
+	  none
+	};
+
+      endianess_type m_endianess;
+
+      unsigned long
+      get_unsigned_long_imp();
+
+    public:
+      twister_rand_gen(unsigned long seed = static_cast<unsigned long>(std::time(0)));
+
+      void
+      init(unsigned long seed);
+
+      static unsigned long
+      get_time_determined_seed()
+      { return (static_cast<unsigned long>(std::time(0))); }
+
+      unsigned long
+      get_unsigned_long(unsigned long min = 0, unsigned long max = UINT_MAX - 1);
+
+      double
+      get_prob();
+    };
+  } // namespace test
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_TWISTER_RAND_GEN_HPP
diff --git a/libstdc++-v3/testsuite/util/statistic/res_recorder.hpp b/libstdc++-v3/testsuite/util/statistic/res_recorder.hpp
new file mode 100644
index 00000000000..98d169df8d4
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/statistic/res_recorder.hpp
@@ -0,0 +1,143 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file res_recorder.hpp
+ * Contains a class for recording results
+ */
+
+#ifndef PB_DS_RES_RECORDER_HPP
+#define PB_DS_RES_RECORDER_HPP
+
+#include <statistic/sample_mean.hpp>
+#include <statistic/sample_var.hpp>
+#include <statistic/sample_mean_confidence_checker.hpp>
+
+namespace pb_ds
+{
+
+  namespace test
+  {
+
+    namespace detail
+    {
+
+#define PB_DS_CLASS_T_DEC			\
+      template<typename Value_Type>
+
+#define PB_DS_CLASS_C_DEC					\
+      res_recorder<						\
+						Value_Type>
+
+      /*
+       * Records results until the probability that the sample mean is 10% away
+       *     from the true mean is ~ 0.05.
+       */
+      template<typename Value_Type = double>
+      class res_recorder
+      {
+      public:
+	typedef Value_Type value_type;
+
+      public:
+	res_recorder();
+
+	bool
+        add_res(value_type res);
+
+	inline value_type
+        sample_mean() const;
+
+      private:
+	typedef std::list< value_type> list_t;
+
+      private:
+	list_t m_l;
+
+	value_type m_sample_mean;
+
+	value_type m_sample_var;
+      };
+
+      PB_DS_CLASS_T_DEC
+      PB_DS_CLASS_C_DEC::
+      res_recorder() :
+        m_sample_mean(0)
+      { }
+
+      PB_DS_CLASS_T_DEC
+      inline typename PB_DS_CLASS_C_DEC::value_type
+      PB_DS_CLASS_C_DEC::
+      sample_mean() const
+      {
+	return (m_sample_mean);
+      }
+
+      PB_DS_CLASS_T_DEC
+      bool
+      PB_DS_CLASS_C_DEC::
+      add_res(value_type res)
+      {
+	m_l.push_back(res);
+
+	m_sample_mean = pb_ds::test::detail::sample_mean(m_l.begin(), m_l.end());
+
+	const value_type sample_var =
+	  pb_ds::test::detail::sample_var(m_l.begin(), m_l.end(), m_sample_mean);
+
+	return (pb_ds::test::detail::sample_mean_confidence_checker(m_sample_mean,
+								    sample_var,
+								    std::distance(m_l.begin(), m_l.end()),
+								    0.1));
+      }
+
+#undef PB_DS_CLASS_T_DEC
+
+#undef PB_DS_CLASS_C_DEC
+
+    } // namespace detail
+
+  } // namespace test
+
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_RES_RECORDER_HPP
+
diff --git a/libstdc++-v3/testsuite/util/statistic/sample_mean.hpp b/libstdc++-v3/testsuite/util/statistic/sample_mean.hpp
new file mode 100644
index 00000000000..26aa1f7b7a8
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/statistic/sample_mean.hpp
@@ -0,0 +1,87 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file sample_mean.hpp
+ * Contains a function for calculating a sample mean
+ */
+
+#ifndef PB_DS_SAMPLE_MEAN_HPP
+#define PB_DS_SAMPLE_MEAN_HPP
+
+#include <list>
+#include <numeric>
+#include <math.h>
+#include <iterator>
+
+namespace pb_ds
+{
+
+  namespace test
+  {
+
+    namespace detail
+    {
+
+#define PB_DS_VTYPE							\
+      typename std::iterator_traits<					\
+							It>::value_type
+
+      template<typename It>
+      PB_DS_VTYPE
+      sample_mean(It b, It e)
+      {
+	const PB_DS_VTYPE total = std::accumulate(b, e, PB_DS_VTYPE(0));
+	const size_t num = std::distance(b, e);
+
+	return (total / num);
+      }
+
+#undef PB_DS_VTYPE
+
+    } // namespace detail
+
+  } // namespace test
+
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_SAMPLE_MEAN_HPP
+
diff --git a/libstdc++-v3/testsuite/util/statistic/sample_mean_confidence_checker.hpp b/libstdc++-v3/testsuite/util/statistic/sample_mean_confidence_checker.hpp
new file mode 100644
index 00000000000..5fa4607f2d2
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/statistic/sample_mean_confidence_checker.hpp
@@ -0,0 +1,98 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file sample_mean_confidence_checker.hpp
+ * Contains a function for checking the confidence of a sample mean
+ */
+
+#ifndef PB_DS_SAMPLE_MEAN_CONFIDENCE_CHECKER_HPP
+#define PB_DS_SAMPLE_MEAN_CONFIDENCE_CHECKER_HPP
+
+#include <list>
+#include <numeric>
+#include <math.h>
+
+namespace pb_ds
+{
+
+  namespace test
+  {
+
+    namespace detail
+    {
+
+      /*
+       * Checks that a sample mean sm is in the relative interval
+       *     relative_interval of a true mean (assuming i.i.d. samples),
+       *     given a sample variance sv taken over num_samples samples,
+       *     with confidence ~ 0.95.
+       *
+       * See "Probability, Random Variables, and Stochastic Processes" (Third edition)
+       *     Athanasios Papoulis, Chapter 9.
+       */
+      template<typename Value_Type>
+      bool
+      sample_mean_confidence_checker(Value_Type sm, Value_Type sv, std::size_t num_samples, double relative_interval)
+      {
+	enum
+	  {
+	    // Ensures that the student-t distribution is approximately normal.
+	    min_num_samples = 30
+	  };
+
+	if (num_samples < min_num_samples)
+	  return (false);
+
+	// This is z_u (normal-dist percentile) for u = 0.975.
+	const Value_Type z = 1.976;
+
+	return (sv / ::sqrt(double(num_samples)) <= relative_interval*  sm / z);
+      }
+
+    } // namespace detail
+
+  } // namespace test
+
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_SAMPLE_MEAN_CONFIDENCE_CHECKER_HPP
+
diff --git a/libstdc++-v3/testsuite/util/statistic/sample_var.hpp b/libstdc++-v3/testsuite/util/statistic/sample_var.hpp
new file mode 100644
index 00000000000..f5a77817022
--- /dev/null
+++ b/libstdc++-v3/testsuite/util/statistic/sample_var.hpp
@@ -0,0 +1,102 @@
+// -*- C++ -*-
+
+// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the terms
+// of the GNU General Public License as published by the Free Software
+// Foundation; either version 2, or (at your option) any later
+// version.
+
+// This library is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with this library; see the file COPYING.  If not, write to
+// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
+// MA 02111-1307, USA.
+
+// As a special exception, you may use this file as part of a free
+// software library without restriction.  Specifically, if other files
+// instantiate templates or use macros or inline functions from this
+// file, or you compile this file and link it with other files to
+// produce an executable, this file does not by itself cause the
+// resulting executable to be covered by the GNU General Public
+// License.  This exception does not however invalidate any other
+// reasons why the executable file might be covered by the GNU General
+// Public License.
+
+// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
+
+// 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.
+
+/**
+ * @file sample_var.hpp
+ * Contains a function for calculating a sample variance
+ */
+
+#ifndef PB_DS_SAMPLE_VAR_HPP
+#define PB_DS_SAMPLE_VAR_HPP
+
+#include <list>
+#include <numeric>
+#include <math.h>
+#include <iterator>
+
+namespace pb_ds
+{
+
+  namespace test
+  {
+
+    namespace detail
+    {
+
+#define PB_DS_VTYPE							\
+      typename std::iterator_traits<					\
+							It>::value_type
+
+      template<typename It>
+      PB_DS_VTYPE
+      sample_var(It b, It e, PB_DS_VTYPE sm)
+      {
+	PB_DS_VTYPE ss = 0;
+
+	size_t num_res = 0;
+
+	while (b != e)
+	  {
+	    const PB_DS_VTYPE d =* b - sm;
+
+	    ss += d*  d;
+
+	    ++num_res;
+
+	    ++b;
+	  }
+
+	if (num_res == 1)
+	  return (0);
+
+	return (::sqrt(ss / (num_res - 1)));
+      }
+
+#undef PB_DS_VTYPE
+
+    } // namespace detail
+
+  } // namespace test
+
+} // namespace pb_ds
+
+#endif // #ifndef PB_DS_SAMPLE_VAR_HPP
+