Adjust Doxygen processing of pb_ds containers
authorJonathan Wakely <jwakely@redhat.com>
Thu, 2 May 2019 15:44:46 +0000 (16:44 +0100)
committerJonathan Wakely <redi@gcc.gnu.org>
Thu, 2 May 2019 15:44:46 +0000 (16:44 +0100)
Several of the pb_ds headers are intended to be included multiple times,
within the definition of various class templates. The including files
define macros like PB_DS_CLASS_C_DEC and PB_DS_GEN_POS before including
these headers.

In some cases the types defined in the headers are actually nested types
within other classes, and so should not have been documented as though
they are declared in the global namespace, as in:
https://gcc.gnu.org/onlinedocs/gcc-8.3.0/libstdc++/api/a12028.html

In other cases the headers provide inline member function definitions,
but when processed by Doxygen the class name "PB_DS_CLASS_C_DEC" is not
recognised.

This patch makes Doxygen ignore definitions that only make sense when
included in the right context with the right macros defined.

* include/ext/pb_ds/detail/bin_search_tree_/*_imps.hpp: Do not define
anything unless PB_DS_CLASS_C_DEC is defined.
* include/ext/pb_ds/detail/binary_heap_/*_imps.hpp: Likewise.
* include/ext/pb_ds/detail/binomial_heap_/*_imps.hpp: Likewise.
* include/ext/pb_ds/detail/binomial_heap_base_/*_imps.hpp: Likewise.
* include/ext/pb_ds/detail/cc_hash_table_map_/*_imps.hpp: Likewise.
* include/ext/pb_ds/detail/gp_hash_table_map_/*_imps.hpp: Likewise.
* include/ext/pb_ds/detail/hash_fn/*_imp.hpp: Likewise.
* include/ext/pb_ds/detail/left_child_next_sibling_heap_/*_imps.hpp:
Likewise.
* include/ext/pb_ds/detail/list_update_map_/*_imps.hpp: Likewise.
* include/ext/pb_ds/detail/ov_tree_map_/*_imps.hpp: Likewise.
* include/ext/pb_ds/detail/pairing_heap_/*_imps.hpp: Likewise.
* include/ext/pb_ds/detail/pat_trie_/*_imps.hpp: Likewise.
* include/ext/pb_ds/detail/rb_tree_map_/*_imps.hpp: Likewise.
* include/ext/pb_ds/detail/rc_binomial_heap_/*_imps.hpp: Likewise.
* include/ext/pb_ds/detail/resize_policy*_imp.hpp: Likewise.
* include/ext/pb_ds/detail/splay_tree_/*_imps.hpp: Likewise.
* include/ext/pb_ds/detail/thin_heap_/*_imps.hpp: Likewise.
* include/ext/pb_ds/detail/trie_policy*_imp.hpp: Likewise.
* include/ext/pb_ds/detail/unordered_iterator/const_iterator.hpp:
Likewise.
* include/ext/pb_ds/detail/unordered_iterator/iterator.hpp: Likewise.
* include/ext/pb_ds/detail/unordered_iterator/point_const_iterator.hpp:
Likewise.
* include/ext/pb_ds/detail/unordered_iterator/point_iterator.hpp:
Likewise.

From-SVN: r270803

158 files changed:
libstdc++-v3/ChangeLog
libstdc++-v3/include/ext/pb_ds/detail/bin_search_tree_/constructors_destructor_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/bin_search_tree_/debug_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/bin_search_tree_/erase_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/bin_search_tree_/find_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/bin_search_tree_/info_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/bin_search_tree_/insert_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/bin_search_tree_/iterators_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/bin_search_tree_/policy_access_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/bin_search_tree_/r_erase_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/bin_search_tree_/rotate_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/bin_search_tree_/split_join_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/binary_heap_/constructors_destructor_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/binary_heap_/debug_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/binary_heap_/erase_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/binary_heap_/find_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/binary_heap_/info_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/binary_heap_/insert_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/binary_heap_/iterators_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/binary_heap_/policy_access_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/binary_heap_/split_join_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/binary_heap_/trace_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/binomial_heap_/constructors_destructor_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/binomial_heap_/debug_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/binomial_heap_base_/constructors_destructor_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/binomial_heap_base_/debug_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/binomial_heap_base_/erase_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/binomial_heap_base_/find_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/binomial_heap_base_/insert_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/binomial_heap_base_/split_join_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/cc_hash_table_map_/cmp_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/cc_hash_table_map_/constructor_destructor_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/cc_hash_table_map_/constructor_destructor_no_store_hash_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/cc_hash_table_map_/constructor_destructor_store_hash_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/cc_hash_table_map_/debug_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/cc_hash_table_map_/debug_no_store_hash_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/cc_hash_table_map_/debug_store_hash_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/cc_hash_table_map_/entry_list_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/cc_hash_table_map_/erase_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/cc_hash_table_map_/erase_no_store_hash_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/cc_hash_table_map_/erase_store_hash_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/cc_hash_table_map_/find_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/cc_hash_table_map_/info_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/cc_hash_table_map_/insert_no_store_hash_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/cc_hash_table_map_/insert_store_hash_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/cc_hash_table_map_/iterators_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/cc_hash_table_map_/policy_access_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/cc_hash_table_map_/resize_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/cc_hash_table_map_/resize_no_store_hash_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/cc_hash_table_map_/resize_store_hash_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/cc_hash_table_map_/size_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/cc_hash_table_map_/trace_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/gp_hash_table_map_/constructor_destructor_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/gp_hash_table_map_/constructor_destructor_no_store_hash_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/gp_hash_table_map_/constructor_destructor_store_hash_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/gp_hash_table_map_/debug_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/gp_hash_table_map_/debug_no_store_hash_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/gp_hash_table_map_/debug_store_hash_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/gp_hash_table_map_/erase_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/gp_hash_table_map_/erase_no_store_hash_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/gp_hash_table_map_/erase_store_hash_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/gp_hash_table_map_/find_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/gp_hash_table_map_/find_no_store_hash_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/gp_hash_table_map_/info_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/gp_hash_table_map_/insert_no_store_hash_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/gp_hash_table_map_/insert_store_hash_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/gp_hash_table_map_/iterator_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/gp_hash_table_map_/policy_access_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/gp_hash_table_map_/resize_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/gp_hash_table_map_/resize_no_store_hash_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/gp_hash_table_map_/resize_store_hash_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/gp_hash_table_map_/trace_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/hash_fn/direct_mask_range_hashing_imp.hpp
libstdc++-v3/include/ext/pb_ds/detail/hash_fn/direct_mod_range_hashing_imp.hpp
libstdc++-v3/include/ext/pb_ds/detail/hash_fn/linear_probe_fn_imp.hpp
libstdc++-v3/include/ext/pb_ds/detail/hash_fn/quadratic_probe_fn_imp.hpp
libstdc++-v3/include/ext/pb_ds/detail/left_child_next_sibling_heap_/constructors_destructor_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/left_child_next_sibling_heap_/debug_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/left_child_next_sibling_heap_/erase_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/left_child_next_sibling_heap_/info_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/left_child_next_sibling_heap_/insert_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/left_child_next_sibling_heap_/iterators_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/left_child_next_sibling_heap_/policy_access_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/left_child_next_sibling_heap_/trace_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/list_update_map_/constructor_destructor_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/list_update_map_/debug_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/list_update_map_/erase_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/list_update_map_/find_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/list_update_map_/info_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/list_update_map_/insert_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/list_update_map_/iterators_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/list_update_map_/trace_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/ov_tree_map_/constructors_destructor_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/ov_tree_map_/debug_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/ov_tree_map_/erase_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/ov_tree_map_/info_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/ov_tree_map_/insert_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/ov_tree_map_/iterators_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/ov_tree_map_/policy_access_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/ov_tree_map_/split_join_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/pairing_heap_/constructors_destructor_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/pairing_heap_/debug_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/pairing_heap_/erase_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/pairing_heap_/find_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/pairing_heap_/insert_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/pairing_heap_/split_join_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/constructors_destructor_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/debug_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/erase_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/find_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/info_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/insert_join_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/iterators_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/policy_access_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/r_erase_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/rotate_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/split_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/trace_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/update_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/rb_tree_map_/constructors_destructor_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/rb_tree_map_/debug_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/rb_tree_map_/erase_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/rb_tree_map_/info_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/rb_tree_map_/insert_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/rb_tree_map_/split_join_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/rc_binomial_heap_/constructors_destructor_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/rc_binomial_heap_/debug_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/rc_binomial_heap_/erase_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/rc_binomial_heap_/insert_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/rc_binomial_heap_/split_join_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/rc_binomial_heap_/trace_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/resize_policy/cc_hash_max_collision_check_resize_trigger_imp.hpp
libstdc++-v3/include/ext/pb_ds/detail/resize_policy/hash_exponential_size_policy_imp.hpp
libstdc++-v3/include/ext/pb_ds/detail/resize_policy/hash_load_check_resize_trigger_imp.hpp
libstdc++-v3/include/ext/pb_ds/detail/resize_policy/hash_prime_size_policy_imp.hpp
libstdc++-v3/include/ext/pb_ds/detail/resize_policy/hash_standard_resize_policy_imp.hpp
libstdc++-v3/include/ext/pb_ds/detail/splay_tree_/constructors_destructor_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/splay_tree_/debug_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/splay_tree_/erase_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/splay_tree_/find_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/splay_tree_/insert_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/splay_tree_/splay_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/splay_tree_/split_join_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/thin_heap_/constructors_destructor_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/thin_heap_/debug_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/thin_heap_/erase_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/thin_heap_/find_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/thin_heap_/insert_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/thin_heap_/split_join_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/thin_heap_/trace_fn_imps.hpp
libstdc++-v3/include/ext/pb_ds/detail/tree_policy/order_statistics_imp.hpp
libstdc++-v3/include/ext/pb_ds/detail/trie_policy/order_statistics_imp.hpp
libstdc++-v3/include/ext/pb_ds/detail/trie_policy/prefix_search_node_update_imp.hpp
libstdc++-v3/include/ext/pb_ds/detail/trie_policy/trie_string_access_traits_imp.hpp
libstdc++-v3/include/ext/pb_ds/detail/unordered_iterator/const_iterator.hpp
libstdc++-v3/include/ext/pb_ds/detail/unordered_iterator/iterator.hpp
libstdc++-v3/include/ext/pb_ds/detail/unordered_iterator/point_const_iterator.hpp
libstdc++-v3/include/ext/pb_ds/detail/unordered_iterator/point_iterator.hpp

index 126ed4ee9e37743f68c618014e7037444f8fbb31..e356075fd8c63b4d39411d726e0f3e4b38202418 100644 (file)
@@ -1,5 +1,33 @@
 2019-05-02  Jonathan Wakely  <jwakely@redhat.com>
 
+       * include/ext/pb_ds/detail/bin_search_tree_/*_imps.hpp: Do not define
+       anything unless PB_DS_CLASS_C_DEC is defined.
+       * include/ext/pb_ds/detail/binary_heap_/*_imps.hpp: Likewise.
+       * include/ext/pb_ds/detail/binomial_heap_/*_imps.hpp: Likewise.
+       * include/ext/pb_ds/detail/binomial_heap_base_/*_imps.hpp: Likewise.
+       * include/ext/pb_ds/detail/cc_hash_table_map_/*_imps.hpp: Likewise.
+       * include/ext/pb_ds/detail/gp_hash_table_map_/*_imps.hpp: Likewise.
+       * include/ext/pb_ds/detail/hash_fn/*_imp.hpp: Likewise.
+       * include/ext/pb_ds/detail/left_child_next_sibling_heap_/*_imps.hpp:
+       Likewise.
+       * include/ext/pb_ds/detail/list_update_map_/*_imps.hpp: Likewise.
+       * include/ext/pb_ds/detail/ov_tree_map_/*_imps.hpp: Likewise.
+       * include/ext/pb_ds/detail/pairing_heap_/*_imps.hpp: Likewise.
+       * include/ext/pb_ds/detail/pat_trie_/*_imps.hpp: Likewise.
+       * include/ext/pb_ds/detail/rb_tree_map_/*_imps.hpp: Likewise.
+       * include/ext/pb_ds/detail/rc_binomial_heap_/*_imps.hpp: Likewise.
+       * include/ext/pb_ds/detail/resize_policy*_imp.hpp: Likewise.
+       * include/ext/pb_ds/detail/splay_tree_/*_imps.hpp: Likewise.
+       * include/ext/pb_ds/detail/thin_heap_/*_imps.hpp: Likewise.
+       * include/ext/pb_ds/detail/trie_policy*_imp.hpp: Likewise.
+       * include/ext/pb_ds/detail/unordered_iterator/const_iterator.hpp:
+       Likewise.
+       * include/ext/pb_ds/detail/unordered_iterator/iterator.hpp: Likewise.
+       * include/ext/pb_ds/detail/unordered_iterator/point_const_iterator.hpp:
+       Likewise.
+       * include/ext/pb_ds/detail/unordered_iterator/point_iterator.hpp:
+       Likewise.
+
        * doc/doxygen/user.cfg.in: Regenerate with Doxygen 1.8.14 and set
        GROUP_NESTED_COMPOUNDS=YES and SORT_BY_SCOPE_NAME=NO. Add various
        _GLIBCXX_xxx macros and __attribute__(X) to PREDEFINED macros that
index 7ad5a9e76ff33764262b7a603359cc2ae9af7f79..73c83e2b0a25faf6e308a9d1fc09825e5f270235 100644 (file)
@@ -38,6 +38,8 @@
  * Contains an implementation class for bin_search_tree_.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 typename PB_DS_CLASS_C_DEC::node_allocator
 PB_DS_CLASS_C_DEC::s_node_allocator;
@@ -215,4 +217,4 @@ initialize_min_max()
     m_p_head->m_p_right = p_max;
   }
 }
-
+#endif
index ddc6c7678aab5520b7860d50d4b3ba6743a68f43..d9b0cf8a97ebbe70ddcdfb1efd07cc4b79809c87 100644 (file)
@@ -38,6 +38,8 @@
  * Contains an implementation class for bin_search_tree_.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 #ifdef _GLIBCXX_DEBUG
 
 PB_DS_CLASS_T_DEC
@@ -275,3 +277,4 @@ assert_size(const char* __file, int __line) const
 { PB_DS_DEBUG_VERIFY(recursive_count(m_p_head->m_p_parent) == m_size); }
 
 #endif
+#endif
index 727e526b1217c229241023cb79cd61d6b3e43e67..4201634c90580a426150432ecce5ddfa53a0577e 100644 (file)
@@ -38,6 +38,8 @@
  * Contains an implementation class for bin_search_tree_.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 inline void
 PB_DS_CLASS_C_DEC::
@@ -101,3 +103,4 @@ clear_imp(node_pointer p_nd)
   p_nd->~node();
   s_node_allocator.deallocate(p_nd, 1);
 }
+#endif
index 95a809acb0fa0bd15a7d628a0818a30de9f3f2bc..7d6c41cdcb39fed22cad57fbb04b7b1fb3d24c09 100644 (file)
@@ -38,6 +38,8 @@
  * Contains an implementation class for bin_search_tree_.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 inline typename PB_DS_CLASS_C_DEC::point_const_iterator
 PB_DS_CLASS_C_DEC::
@@ -169,3 +171,4 @@ find(key_const_reference r_key) const
     }
   return point_const_iterator(ret);
 }
+#endif
index 4019f864307468f14854fc640b0ebe2afafe049f..cb751b28ec833f57678160eba753cb8affbd8e65 100644 (file)
@@ -38,6 +38,8 @@
  * Contains an implementation class for bin_search_tree_.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 _GLIBCXX_NODISCARD
 inline bool
@@ -63,3 +65,4 @@ max_size() const
   return (s_node_allocator.max_size());
 }
 
+#endif
index 96f6a3e942173518845bf8a08a2e045842389de7..9c33f218ed98a6414efa2bfc327a87bd15f84581 100644 (file)
@@ -38,6 +38,8 @@
  * Contains an implementation class for bin_search_tree_.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 inline std::pair<typename PB_DS_CLASS_C_DEC::point_iterator, bool>
 PB_DS_CLASS_C_DEC::
@@ -178,3 +180,4 @@ get_new_node_for_leaf_insert(const_reference r_val, true_type)
   ++m_size;
   return p_new_nd;
 }
+#endif
index 3f052e86898c11dcc6ed0de769dd180e372e40b2..6db474637ae343499f1a0d4b0002c593cceaf523 100644 (file)
@@ -38,6 +38,8 @@
  * Contains an implementation class for bin_search_tree_.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 inline typename PB_DS_CLASS_C_DEC::iterator
 PB_DS_CLASS_C_DEC::
@@ -134,3 +136,4 @@ node_end()
   return (node_iterator(0));
 }
 
+#endif
index 846c8709abb87d4f8101ddf7a9c3bb1dd129a137..5bf6721bb89632eeba90ffdc6a68795eedb79df4 100644 (file)
@@ -38,6 +38,8 @@
  * Contains an implementation class for bin_search_tree_.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 Cmp_Fn& 
 PB_DS_CLASS_C_DEC::
@@ -50,3 +52,4 @@ PB_DS_CLASS_C_DEC::
 get_cmp_fn() const
 { return (*this); }
 
+#endif
index 2ad610671ab8acc8b3c526774f7e5b627111737e..561c94e785c8a8e43eb7d4f468108eeebef3572a 100644 (file)
@@ -38,6 +38,8 @@
  * Contains an implementation class for bin_search_tree_.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 inline void
 PB_DS_CLASS_C_DEC::
@@ -101,3 +103,4 @@ clear_imp(node_pointer p_nd)
   p_nd->~Node();
   s_node_allocator.deallocate(p_nd, 1);
 }
+#endif
index acf620ca2174c4d1ffb6d3a72a1bf678cd042ded..62ba39e50599f1458b528a1dd1720bff289d5fbe 100644 (file)
@@ -38,6 +38,8 @@
  * Contains imps for rotating nodes.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 inline void
 PB_DS_CLASS_C_DEC::
@@ -153,3 +155,4 @@ PB_DS_CLASS_C_DEC::
 update_to_top(node_pointer /*p_nd*/, null_node_update_pointer /*p_update*/)
 { }
 
+#endif
index 67cbf80ddfeac6f1b8587d6c31a3ea17d619dc00..6935b7465da1c6f36ca0db5f38497bf18e3247b1 100644 (file)
@@ -38,6 +38,8 @@
  * Contains an implementation class for bin_search_tree_.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 bool
 PB_DS_CLASS_C_DEC::
@@ -148,3 +150,4 @@ recursive_count(node_pointer p) const
   return 1 + recursive_count(p->m_p_left) + recursive_count(p->m_p_right);
 }
 
+#endif
index 1b0687338b2e4f00fa900f03d6d32f1b3e6923b7..edd1625dda440f3f5a4193473fe7f229156f80a5 100644 (file)
@@ -38,6 +38,8 @@
  * Contains an implementation class for binary_heap_.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 typename PB_DS_CLASS_C_DEC::entry_allocator
 PB_DS_CLASS_C_DEC::s_entry_allocator;
@@ -137,3 +139,4 @@ PB_DS_CLASS_C_DEC::
     erase_at(m_a_entries, i, s_no_throw_copies_ind);
   s_entry_allocator.deallocate(m_a_entries, m_actual_size);
 }
+#endif
index e16677f7853e9c7898c5487837caffb7b63bfdd5..45609443be3e30b1da08a1cbc44c5c649a72945f 100644 (file)
@@ -38,6 +38,8 @@
  * Contains an implementation class for a binary_heap.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 #ifdef _GLIBCXX_DEBUG
 
 PB_DS_CLASS_T_DEC
@@ -70,3 +72,4 @@ assert_valid(const char* __file, int __line) const
 }
 
 #endif
+#endif
index 651a62d2cf19635b0b3819a0d61c0b957a809ecc..260bc86470e3f52164f9c028c32717935c2ab832 100644 (file)
@@ -38,6 +38,8 @@
  * Contains an implementation class for a binary_heap.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 void
 PB_DS_CLASS_C_DEC::
@@ -206,3 +208,4 @@ partition(Pred pred)
 
   return left;
 }
+#endif
index b01cbda78a2310dd9b0625cf3f7508e0614f9345..6da5cb4372d287726865c096e8f72e2c6597e706 100644 (file)
@@ -38,6 +38,8 @@
  * Contains an implementation class for a binary_heap.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 inline typename PB_DS_CLASS_C_DEC::const_reference
 PB_DS_CLASS_C_DEC::
@@ -77,3 +79,4 @@ inline typename PB_DS_CLASS_C_DEC::size_type
 PB_DS_CLASS_C_DEC::
 parent(size_type i)
 { return (i - 1) / 2; }
+#endif
index d81d5500659ae5e108c8ab3f36a5a98eb4b3960c..641489b5ad0c79fb4697f0e82f8d0740d117354b 100644 (file)
@@ -38,6 +38,8 @@
  * Contains an implementation class for a binary_heap.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 _GLIBCXX_NODISCARD
 inline bool
@@ -57,3 +59,4 @@ PB_DS_CLASS_C_DEC::
 max_size() const
 { return s_entry_allocator.max_size(); }
 
+#endif
index 36cdcd2039107fea2498ab48d727df02ba58e40c..9feaf33d86c57b67c9f04943a267ee6fda10ac7c 100644 (file)
@@ -38,6 +38,8 @@
  * Contains an implementation class for a binary_heap.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 inline typename PB_DS_CLASS_C_DEC::point_iterator
 PB_DS_CLASS_C_DEC::
@@ -171,3 +173,4 @@ swap_value_imp(entry_pointer p_e, const_reference r_new_val, false_type)
   value_type tmp(r_new_val);
   (*p_e)->swap(tmp);
 }
+#endif
index a8a0804c517fa5088f5ea67f48a4aad68bf6ae72..394e4620dcde34be34356c07f6e02365931c5816 100644 (file)
@@ -38,6 +38,8 @@
  * Contains an implementation class for a binary_heap.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 inline typename PB_DS_CLASS_C_DEC::iterator
 PB_DS_CLASS_C_DEC::
@@ -62,3 +64,4 @@ PB_DS_CLASS_C_DEC::
 end() const
 { return const_iterator(m_a_entries + m_size); }
 
+#endif
index 41804580d5565bb4a3851bec9b7ee973e3071053..c41eb35f105dce90ef25e583f95701bc6e40bb03 100644 (file)
@@ -38,6 +38,8 @@
  * Contains an implementation class for a binary_heap.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 Cmp_Fn& 
 PB_DS_CLASS_C_DEC::
@@ -54,3 +56,4 @@ get_cmp_fn() const
   return (*this);
 }
 
+#endif
index 4a919eb7b28521f871e850110720cdca0500f49b..ce15b71c1e7676bba1b7cc9280ed25974e696d34 100644 (file)
@@ -38,6 +38,8 @@
  * Contains an implementation class for a binary_heap.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 template<typename Pred>
 void
@@ -158,3 +160,4 @@ join(PB_DS_CLASS_C_DEC& other)
   PB_DS_ASSERT_VALID((*this))
   PB_DS_ASSERT_VALID(other)
 }
+#endif
index c7b652a76f1289de408e581efdb6ef94e56ce9ed..8992f037d1448f934493ea9163b095aab139c574 100644 (file)
@@ -38,6 +38,8 @@
  * Contains an implementation class for a binary_heap.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 #ifdef PB_DS_BINARY_HEAP_TRACE_
 
 PB_DS_CLASS_T_DEC
@@ -76,3 +78,4 @@ trace_entry(const entry& r_e, true_type) const
 }
 
 #endif // #ifdef PB_DS_BINARY_HEAP_TRACE_
+#endif
index 5cfe3d2550b870b29689649c82c8b5a383f2a1de..5f33acde95572bb9c3a5173bf0c19e147d5fb625 100644 (file)
@@ -38,6 +38,8 @@
  * Contains an implementation for binomial_heap_.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 PB_DS_CLASS_C_DEC::
 binomial_heap()
@@ -58,3 +60,4 @@ binomial_heap(const PB_DS_CLASS_C_DEC& other)
 PB_DS_CLASS_T_DEC
 PB_DS_CLASS_C_DEC::
 ~binomial_heap() { }
+#endif
index 9520f7453e0b7b5e20de7d7a2a959996b203a0ac..4a8837b5f1f9ec75e172f4f962b0f53aa0846f26 100644 (file)
@@ -38,6 +38,8 @@
  * Contains an implementation for binomial_heap_.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 #ifdef _GLIBCXX_DEBUG
 
 PB_DS_CLASS_T_DEC
@@ -47,3 +49,4 @@ assert_valid(const char* __file, int __line) const
 { base_type::assert_valid(true, __file, __line); }
 
 #endif 
+#endif
index 24db3d6359b48fecf6f58043804f4bfa53b74af9..a6f5b225a419b0f5a1cff15276733b396c4af9cf 100644 (file)
@@ -38,6 +38,8 @@
  * Contains an implementation class for a base of binomial heaps.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 template<typename It>
 void
@@ -83,3 +85,4 @@ PB_DS_CLASS_T_DEC
 PB_DS_CLASS_C_DEC::
 ~binomial_heap_base()
 { }
+#endif
index 54f8585ab61e743e20d0fa1667ad72ba76d22ff4..4a55a9ad1dd1a61a0db49a344dc4cae6b0331d0d 100644 (file)
@@ -38,6 +38,8 @@
  * Contains an implementation class for a base of binomial heaps.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 #ifdef _GLIBCXX_DEBUG
 
 PB_DS_CLASS_T_DEC
@@ -98,3 +100,4 @@ assert_node_consistent(node_const_pointer p_nd, bool strictly_binomial,
 }
 
 #endif
+#endif
index c72321680b144757f204ea7d5dcf9ef798bf8d49..058dddbdb73956f320ec51fc5883e1b2f54b300d 100644 (file)
@@ -38,6 +38,8 @@
  * Contains an implementation class for a base of binomial heaps.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 void
 PB_DS_CLASS_C_DEC::
@@ -159,3 +161,4 @@ erase_if(Pred pred)
   PB_DS_ASSERT_VALID_COND((*this),true)
   return ersd;
 }
+#endif
index 6a3fa906700ff0eb9271bdabd8c89ccc32b42d48..b3d90d4915df1baf489c5ee59b84605bfedb9198 100644 (file)
@@ -38,6 +38,8 @@
  * Contains an implementation class for a base of binomial heaps.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 inline typename PB_DS_CLASS_C_DEC::const_reference
 PB_DS_CLASS_C_DEC::
@@ -68,3 +70,4 @@ find_max()
     }
 }
 
+#endif
index a5cf6e753e0100e23abe3c3b4b451a0db2ecc4b3..a5918c70b07bbe752a8f1f18326d0da5a6830b42 100644 (file)
@@ -38,6 +38,8 @@
  * Contains an implementation class for a base of binomial heaps.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 inline typename PB_DS_CLASS_C_DEC::point_iterator
 PB_DS_CLASS_C_DEC::
@@ -176,3 +178,4 @@ modify(point_iterator it, const_reference r_new_val)
   m_p_max = 0;
   PB_DS_ASSERT_VALID_COND((*this),true)
 }
+#endif
index caf3715ed495076edc123a57853c4fb4e7469267..9da0fc210f63f055f66459ef8f192dd3ffd026c3 100644 (file)
@@ -38,6 +38,8 @@
  * Contains an implementation class for a base of binomial heaps.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 template<typename Pred>
 void
@@ -195,3 +197,4 @@ join(node_pointer p_lhs, node_pointer p_rhs) const
 
   return p_ret;
 }
+#endif
index d11ff0055f954d847c9ee64b397598b3a64ef9f8..a534ab3fd091d4dd567a0ded8a72d2d98a88d75f 100644 (file)
@@ -39,6 +39,8 @@
  *    functions.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 template<typename Other_HT_Map_Type>
 bool
@@ -81,3 +83,4 @@ bool
 PB_DS_CLASS_C_DEC::
 operator!=(const Other_HT_Map_Type& other) const
 { return !operator==(other); }
+#endif
index d6db450db5d3ab694912c09eb270b75999ccf690..a3773867379491822193a5776b99f9c533fae9f1 100644 (file)
@@ -39,6 +39,8 @@
  * and related functions.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 typename PB_DS_CLASS_C_DEC::entry_allocator
 PB_DS_CLASS_C_DEC::s_entry_allocator;
@@ -189,3 +191,4 @@ initialize()
   Resize_Policy::notify_cleared();
   ranged_hash_fn_base::notify_resized(m_num_e);
 }
+#endif
index 89eb1d6943720f43bdc025cdb8302ea60273d9db..a93f03c895fa93f38f082b8b83f11145419361aa 100644 (file)
@@ -39,6 +39,8 @@
  *    and related functions.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 inline void
 PB_DS_CLASS_C_DEC::
@@ -53,3 +55,4 @@ constructor_insert_new_imp(mapped_const_reference r_val, size_type pos,
   m_entries[pos] = p;
   _GLIBCXX_DEBUG_ONLY(debug_base::insert_new(r_key);)
 }
+#endif
index 6709b0689c356f5928c5050837bdbdb372231fed..512edb92057289a57d9156e06249839751477241 100644 (file)
@@ -39,6 +39,8 @@
  * and related functions.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 inline void
 PB_DS_CLASS_C_DEC::
@@ -54,3 +56,4 @@ constructor_insert_new_imp(const_reference r_val, size_type pos, true_type)
   m_entries[pos] = p;
   _GLIBCXX_DEBUG_ONLY(debug_base::insert_new(r_key);)
 }
+#endif
index 65b3b0aa2dde1f2588c963ae5292fa8bc51af1bf..2423d63cc056a8fae4d1b6e07afc17b3876c975e 100644 (file)
@@ -38,6 +38,8 @@
  * Contains implementations of cc_ht_map_'s debug-mode functions.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 #ifdef _GLIBCXX_DEBUG
 
 PB_DS_CLASS_T_DEC
@@ -74,3 +76,4 @@ assert_entry_pointer_array_valid(const entry_pointer_array a_p_entries,
 #include <ext/pb_ds/detail/cc_hash_table_map_/debug_no_store_hash_fn_imps.hpp>
 
 #endif 
+#endif
index 9385036b022433cc8b88da034fcae486cdcd93e9..0fe5fa5368796c81f1c6de1be48b5fd4f8be8f46 100644 (file)
@@ -38,6 +38,8 @@
  * Contains implementations of cc_ht_map_'s debug-mode functions.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 #ifdef _GLIBCXX_DEBUG
 
 PB_DS_CLASS_T_DEC
@@ -48,3 +50,4 @@ assert_entry_pointer_valid(const entry_pointer p, false_type,
 { debug_base::check_key_exists(PB_DS_V2F(p->m_value), __file, __line); }
 
 #endif
+#endif
index 2d6e0863832fca47ec5f5db079bcef4ba0e1a16d..8831ab5e2449219603c84921a18c8aa1d6b13716 100644 (file)
@@ -38,6 +38,8 @@
  * Contains implementations of cc_ht_map_'s debug-mode functions.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 #ifdef _GLIBCXX_DEBUG
 
 PB_DS_CLASS_T_DEC
@@ -52,3 +54,4 @@ assert_entry_pointer_valid(const entry_pointer p_e, true_type,
 }
 
 #endif 
+#endif
index 75a191255603344eab054be9c6268ab11a2b3b0d..feea011c55a5c7779837894c9c07c6fe60f4e4f9 100644 (file)
@@ -38,6 +38,8 @@
  * Contains implementations of cc_ht_map_'s entry-list related functions.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 void
 PB_DS_CLASS_C_DEC::
@@ -89,3 +91,4 @@ rels_entry(entry_pointer p_e)
   s_entry_allocator.deallocate(p_e, 1);
 }
 
+#endif
index 3d39c47a8ab927f7234fe4c97e886402dea544c9..cef305e4c55588e1826e7f8e658d94be32302702 100644 (file)
@@ -38,6 +38,8 @@
  * Contains implementations of cc_ht_map_'s erase related functions.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 inline void
 PB_DS_CLASS_C_DEC::
@@ -101,3 +103,4 @@ clear()
 #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>
 
+#endif
index e4f2300a82c548f59278c856025c2e0ab1a924ab..a2f776311d4724d2d2003a0bf322e6e341b95df7 100644 (file)
@@ -39,6 +39,8 @@
  * when the hash value is not stored.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 inline bool
 PB_DS_CLASS_C_DEC::
@@ -98,3 +100,4 @@ erase_in_pos_imp(key_const_reference r_key, size_type pos)
       p_e = p_next_e;
     }
 }
+#endif
index 90533aa54eb93a8d5a2df6737bdd5471a9695534..480ce61e1a3e7730c7d634a32a44c6ee96c55cc0 100644 (file)
@@ -39,6 +39,8 @@
  * when the hash value is stored.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 inline bool
 PB_DS_CLASS_C_DEC::
@@ -92,3 +94,4 @@ erase_in_pos_imp(key_const_reference r_key, const comp_hash& r_pos_hash_pair)
       p_e = p_next_e;
     }
 }
+#endif
index 1f6c46b577b3fcc9bfbb8611003a11b5f99374ed..f3f9b5bc1d7046fff6052b3cfedba28e8ff93f9b 100644 (file)
@@ -38,6 +38,8 @@
  * Contains implementations of cc_ht_map_'s find related functions.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 inline typename PB_DS_CLASS_C_DEC::point_iterator
 PB_DS_CLASS_C_DEC::
@@ -69,3 +71,4 @@ PB_DS_CLASS_C_DEC::
 find_end() const
 { return 0; }
 
+#endif
index 9d38890f7f687577d3cf86736c578d5b3b9197b0..49fd16cffdb867e384fa5dd8f1610e8155fee19e 100644 (file)
@@ -39,6 +39,8 @@
  * functions.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 inline typename PB_DS_CLASS_C_DEC::size_type
 PB_DS_CLASS_C_DEC::
@@ -99,3 +101,4 @@ bool
 PB_DS_CLASS_C_DEC::
 operator!=(const Other_HT_Map_Type& other) const
 { return !operator==(other); }
+#endif
index 7fc51b67b80a3bb7082469d339e1ba11642dbb43..b4729f7fdb42b24d1ad2160aee779d47530ba803 100644 (file)
@@ -39,6 +39,8 @@
  * when the hash value is not stored.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 inline std::pair<typename PB_DS_CLASS_C_DEC::point_iterator, bool>
 PB_DS_CLASS_C_DEC::
@@ -68,3 +70,4 @@ insert_imp(const_reference r_val, false_type)
   return std::make_pair(insert_new_imp(r_val, pos), true);
 }
 
+#endif
index cbf05c88e4d3adc4c2a8f741c5cfef7a52aa7822..165ef419f4cec03ba97c145cef6994c9ec4f1b1c 100644 (file)
@@ -39,6 +39,8 @@
  * when the hash value is stored.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 inline std::pair<typename PB_DS_CLASS_C_DEC::point_iterator, bool>
 PB_DS_CLASS_C_DEC::
@@ -69,3 +71,4 @@ insert_imp(const_reference r_val, true_type)
   return std::make_pair(insert_new_imp(r_val, pos_hash_pair), true);
 }
 
+#endif
index 5cfbc0cc65e4b8e74a2f1e6de157968ddc8d3e51..492d376eb6bfa8f82117a9c860359a0bd832c41e 100644 (file)
@@ -39,6 +39,8 @@
  * begin().
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 typename PB_DS_CLASS_C_DEC::iterator
 PB_DS_CLASS_C_DEC::s_end_it;
@@ -81,3 +83,4 @@ PB_DS_CLASS_C_DEC::
 end() const
 { return s_const_end_it; }
 
+#endif
index 979f3e05d37843b4c8bad4391e774d50ba34c72a..cc83dd3c0e53c7f7684017f0e7a8a6b5f36e2c56 100644 (file)
@@ -39,6 +39,8 @@
  *    functions.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 Hash_Fn& 
 PB_DS_CLASS_C_DEC::
@@ -86,3 +88,4 @@ const Resize_Policy&
 PB_DS_CLASS_C_DEC::
 get_resize_policy() const
 { return *this; }
+#endif
index 86c727f3ec2a6f69a4d87470c42998fcbbb428b4..5f4b532559b28b50861aa345b8a2d5a4b082db07 100644 (file)
@@ -38,6 +38,8 @@
  * Contains implementations of cc_ht_map_'s resize related functions.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 inline bool
 PB_DS_CLASS_C_DEC::
@@ -132,3 +134,4 @@ resize_imp_no_exceptions(size_type new_size, entry_pointer_array a_p_entries_res
 #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>
 
+#endif
index f0722701ab7b21e859b0b576bd81994ac51a1575..3ca56b4f93d8a6f6dc7a7f70578c688046b13e39 100644 (file)
@@ -39,6 +39,8 @@
  * hash value is not stored.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 inline typename PB_DS_CLASS_C_DEC::entry_pointer
 PB_DS_CLASS_C_DEC::
@@ -52,3 +54,4 @@ resize_imp_no_exceptions_reassign_pointer(entry_pointer p_e, entry_pointer_array
   a_p_entries_resized[hash_pos] = p_e;
   return p_next_e;
 }
+#endif
index 9fd546d86938d9356ab2ba36849f9ddb97ed6832..a98e2e73f14124685afd8ca9fd23a31f663a3b97 100644 (file)
@@ -39,6 +39,8 @@
  * hash value is stored.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 inline typename PB_DS_CLASS_C_DEC::entry_pointer
 PB_DS_CLASS_C_DEC::
@@ -52,3 +54,4 @@ resize_imp_no_exceptions_reassign_pointer(entry_pointer p_e, entry_pointer_array
   a_p_entries_resized[pos_hash_pair.first] = p_e;
   return p_next_e;
 }
+#endif
index bcc1fc47b126190daa4c857eb390c6a92f101687..2aa146fce83a95ca6e88552a086ad45f7f73a103 100644 (file)
@@ -39,6 +39,8 @@
  * functions.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 inline typename PB_DS_CLASS_C_DEC::size_type
 PB_DS_CLASS_C_DEC::
@@ -58,3 +60,4 @@ PB_DS_CLASS_C_DEC::
 max_size() const
 { return s_entry_allocator.max_size(); }
 
+#endif
index f2fa32691049988dfee6c3a9f38a95df14ef1d4b..88a674c34acc6c0b138ada34e38d592227651525 100644 (file)
@@ -38,6 +38,8 @@
  * Contains implementations of cc_ht_map_'s trace-mode functions.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 #ifdef PB_DS_HT_MAP_TRACE_
 
 PB_DS_CLASS_T_DEC
@@ -70,3 +72,4 @@ trace_list(const_entry_pointer p_l) const
 }
 
 #endif 
+#endif
index f9b401b480870e0792b97df3a070930f4faca4f9..aa480fe4f42b2781f2f8d4f5312c606285705980 100644 (file)
@@ -39,6 +39,8 @@
  * and related functions.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 typename PB_DS_CLASS_C_DEC::entry_allocator
 PB_DS_CLASS_C_DEC::s_entry_allocator;
@@ -221,3 +223,4 @@ initialize()
     m_entries[i].m_stat = empty_entry_status;
 }
 
+#endif
index 41d7c081315b43496ef38d0426d5572ec3962ff5..e07984e040ad258e833abb2ec6b6aacea6aa405b 100644 (file)
@@ -39,6 +39,8 @@
  *    and related functions.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 inline void
 PB_DS_CLASS_C_DEC::
@@ -51,3 +53,4 @@ constructor_insert_new_imp(mapped_const_reference r_val, size_type pos,
   p_e->m_stat = valid_entry_status;
   _GLIBCXX_DEBUG_ONLY(debug_base::insert_new(p_e->m_value.first);)
 }
+#endif
index d87fdc72e72a8d6bc098ecf26d72b07366d4d79c..5390c6b013b85c37a423699bc2cde02286ae8074 100644 (file)
@@ -39,6 +39,8 @@
  * and related functions.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 inline void
 PB_DS_CLASS_C_DEC::
@@ -52,3 +54,4 @@ constructor_insert_new_imp(mapped_const_reference r_val, size_type pos,
   p_e->m_stat = valid_entry_status;
   _GLIBCXX_DEBUG_ONLY(debug_base::insert_new(p_e->m_value.first);)
 }
+#endif
index ead21e387a079875491177b61621b71824e8c67b..8b5574a255cf47197f7c58b49ba4f94f9744f10f 100644 (file)
@@ -38,6 +38,8 @@
  * Contains implementations of gp_ht_map_'s debug-mode functions.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 #ifdef _GLIBCXX_DEBUG
 
 PB_DS_CLASS_T_DEC
@@ -54,3 +56,4 @@ assert_valid(const char* __file, int __line) const
 #include <ext/pb_ds/detail/gp_hash_table_map_/debug_store_hash_fn_imps.hpp>
 
 #endif 
+#endif
index 5b17ac8ac992ffd8498788ec14ee6b27d147fff3..8de0910cd1382104944517c9ca2721e347f4bb25 100644 (file)
@@ -38,6 +38,8 @@
  * Contains implementations of gp_ht_map_'s debug-mode functions.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 #ifdef _GLIBCXX_DEBUG
 
 PB_DS_CLASS_T_DEC
@@ -70,3 +72,4 @@ assert_entry_array_valid(const entry_array a_entries, false_type,
 }
 
 #endif 
+#endif
index ce45b3870815b8318d0662ffde88ea537c05ecd3..62769e7ff08e5a1589f45ed06e310cee109db017 100644 (file)
@@ -38,6 +38,8 @@
  * Contains implementations of gp_ht_map_'s debug-mode functions.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 #ifdef _GLIBCXX_DEBUG
 
 PB_DS_CLASS_T_DEC
@@ -76,3 +78,4 @@ assert_entry_array_valid(const entry_array a_entries, true_type,
 }
 
 #endif 
+#endif
index af83629b5f0294dd4b7c1940de28e8714bbc2364..b42c87b4628d6714ae5821d54682843da28caf53 100644 (file)
@@ -38,6 +38,8 @@
  * Contains implementations of gp_ht_map_'s erase related functions.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 inline void
 PB_DS_CLASS_C_DEC::
@@ -98,3 +100,4 @@ erase(key_const_reference r_key)
 
 #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>
+#endif
index 9e6b69b10b53207f38de947b13ef987b1b6ebad8..7d0690165a0383d62cffb1260dc5c9b3d4dd5ad4 100644 (file)
@@ -39,6 +39,8 @@
  * when the hash value is not stored.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 inline bool
 PB_DS_CLASS_C_DEC::
@@ -82,3 +84,4 @@ erase_imp(key_const_reference r_key,  false_type)
   return false;
 }
 
+#endif
index 547a33f110462923e66eeefc887b02291326893d..1faa648c6062d678c156892db6a6d987c0d5d736 100644 (file)
@@ -39,6 +39,8 @@
  * when the hash value is stored.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 inline bool
 PB_DS_CLASS_C_DEC::
@@ -83,3 +85,4 @@ erase_imp(key_const_reference r_key, true_type)
   return false;
 }
 
+#endif
index c2ee829d3c4232ded8360fde7fbc466b0d3355f3..44feed70d47c22f216f2a91b4cba062ab51f806f 100644 (file)
@@ -38,6 +38,8 @@
  * Contains implementations of gp_ht_map_'s find related functions.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 inline typename PB_DS_CLASS_C_DEC::point_iterator
 PB_DS_CLASS_C_DEC::
@@ -68,3 +70,4 @@ PB_DS_CLASS_C_DEC::
 find_end() const
 { return 0; }
 
+#endif
index 21df6c76a29a819a5ef0dc081d41b85fdbff4081..91e96ecbc8195ad47a06b77670cc39216b7366ed 100644 (file)
@@ -39,6 +39,8 @@
  * when the hash value is not stored.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 inline typename PB_DS_CLASS_C_DEC::pointer
 PB_DS_CLASS_C_DEC::
index 464216e45dd9de7a1f91a3799c2b33f489fa53f3..75a59ac0595751ae79949e85739324ca66f89862 100644 (file)
@@ -39,6 +39,8 @@
  * functions.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 inline typename PB_DS_CLASS_C_DEC::size_type
 PB_DS_CLASS_C_DEC::
@@ -57,3 +59,4 @@ inline bool
 PB_DS_CLASS_C_DEC::
 empty() const
 { return (size() == 0); }
+#endif
index 72445cc6cca3023ac089b056a5292f85f8584e7b..e868c16f0d0e3461344bc3d8f0a4e00ff7143222 100644 (file)
@@ -39,6 +39,8 @@
  * when the hash value is not stored.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 inline typename PB_DS_CLASS_C_DEC::size_type
 PB_DS_CLASS_C_DEC::
@@ -109,3 +111,4 @@ insert_imp(const_reference r_val, false_type)
   return std::make_pair(insert_new_imp(r_val, pos), true);
 }
 
+#endif
index 06eed096130abd8c2a46411755bed58bb7332160..09b2c264afaf87bac05c5cedb07adf1136ddae2a 100644 (file)
@@ -39,6 +39,8 @@
  * when the hash value is stored.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 inline typename PB_DS_CLASS_C_DEC::comp_hash
 PB_DS_CLASS_C_DEC::
@@ -116,3 +118,4 @@ insert_imp(const_reference r_val, true_type)
   return std::make_pair(insert_new_imp(r_val, pos_hash_pair), true);
 }
 
+#endif
index c9e51df5cfcec088b39c2997997d35b9e1e5f4f1..4277fb0c24afb07bd91a13b15da266dcf63c538f 100644 (file)
@@ -39,6 +39,8 @@
  * begin().
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 typename PB_DS_CLASS_C_DEC::iterator
 PB_DS_CLASS_C_DEC::s_end_it;
@@ -81,3 +83,4 @@ PB_DS_CLASS_C_DEC::
 end() const
 { return s_const_end_it; }
 
+#endif
index 92cb8eedd23b6ad19c94e4cb9a0f8ac6bea795aa..48f1f7958d0ff32fd03f8050d0be4e2f9cd3c323 100644 (file)
@@ -39,6 +39,8 @@
  * functions.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 Hash_Fn& 
 PB_DS_CLASS_C_DEC::
@@ -98,3 +100,4 @@ const Resize_Policy&
 PB_DS_CLASS_C_DEC::
 get_resize_policy() const
 { return *this; }
+#endif
index f8eec454782671d8c122db1a0c6eeb3355fb19ad..ff3f3512bad45cd050b139c5afebae39ec8d01a1 100644 (file)
@@ -38,6 +38,8 @@
  * Contains implementations of gp_ht_map_'s resize related functions.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 inline bool
 PB_DS_CLASS_C_DEC::
@@ -137,3 +139,4 @@ resize_imp(entry_array a_entries_resized, size_type old_size)
 #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>
 
+#endif
index 6f72d2934ccca5553d02c0dda88a6706f2e3d41f..48d19c4e35780d9138fdbd23e1105a573e347940 100644 (file)
@@ -39,6 +39,8 @@
  * hash value is not stored.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 inline void
 PB_DS_CLASS_C_DEC::
@@ -70,3 +72,4 @@ resize_imp_reassign(entry_pointer p_e, entry_array a_entries_resized,
   __throw_insert_error();
 }
 
+#endif
index bfd247d00256aa5ccb65b55f9b1f75b059431c67..cfaf5c4a61b5f6fe4afe23ca86f97f4179b01304 100644 (file)
@@ -39,6 +39,8 @@
  * hash value is stored.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 inline void
 PB_DS_CLASS_C_DEC::
@@ -72,3 +74,4 @@ resize_imp_reassign(entry_pointer p_e, entry_array a_entries_resized,
   __throw_insert_error();
 }
 
+#endif
index c66da8345da775cfe8fb6f9f01095d27f3ef4ba4..fd6971b158bf9ca7eb8a1b36ca934fee1f9e58cd 100644 (file)
@@ -38,6 +38,8 @@
  * Contains implementations of gp_ht_map_'s trace-mode functions.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 #ifdef PB_DS_HT_MAP_TRACE_
 
 PB_DS_CLASS_T_DEC
@@ -72,3 +74,4 @@ trace() const
 }
 
 #endif // #ifdef PB_DS_HT_MAP_TRACE_
+#endif
index bc89ebf279ae6e05a37bc0fee1198a3ffd2233fd..09b325cc806af53e143aa721b1fdafc673bf88f6 100644 (file)
@@ -38,6 +38,8 @@
  * Contains a range-hashing policy implementation
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 void
 PB_DS_CLASS_C_DEC::
@@ -56,3 +58,4 @@ PB_DS_CLASS_C_DEC::
 operator()(size_type hash) const
 { return mask_based_base::range_hash(hash); }
 
+#endif
index da4c0a7f32bbc5e08c21f4c2fdb5f419521545b9..bfa6723385ae9314db3565229b2f93dc1b5bd349 100644 (file)
@@ -38,6 +38,8 @@
  * Contains a range-hashing policy implementation
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 void
 PB_DS_CLASS_C_DEC::
@@ -56,3 +58,4 @@ PB_DS_CLASS_C_DEC::
 operator()(size_type hash) const
 { return mod_based_base::range_hash(hash); }
 
+#endif
index 0ca1a0e50016685b36a9117349ff01cc9b423f3f..6317c3090ecfbb0f9c8cca3c9eb67df02c9471f4 100644 (file)
@@ -38,6 +38,8 @@
  * Contains a probe policy implementation
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 inline void
 PB_DS_CLASS_C_DEC::
@@ -51,3 +53,4 @@ operator()(size_type i) const
 {
   return (i);
 }
+#endif
index 7c29ede53d8215ab52cc2b6394db6556b589031d..f8a4745a285a5e74bca3c02bde84666c598b966e 100644 (file)
@@ -38,6 +38,8 @@
  * Contains a probe policy implementation
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 inline void
 PB_DS_CLASS_C_DEC::
@@ -51,3 +53,4 @@ operator()(size_type i) const
 {
   return (i*  i);
 }
+#endif
index 305fd20b03b24a17e361f79ef9163f7adf201c14..c303fd1c9994df281d1ed6ed9977651dcb284794 100644 (file)
@@ -38,6 +38,8 @@
  * Contains an implementation class for left_child_next_sibling_heap_.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 typename PB_DS_CLASS_C_DEC::node_allocator
 PB_DS_CLASS_C_DEC::s_node_allocator;
@@ -150,3 +152,4 @@ recursive_copy_node(node_const_pointer p_nd)
   return p_ret;
 }
 
+#endif
index 10d618c21719cae0daecaedba4afdfc47e9fa210..2f7f5609153152421670a11e45188e4637327ebe 100644 (file)
@@ -38,6 +38,8 @@
  * Contains an implementation class for left_child_next_sibling_heap_.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 #ifdef _GLIBCXX_DEBUG
 
 PB_DS_CLASS_T_DEC
@@ -135,3 +137,4 @@ degree(node_const_pointer p_nd)
 }
 
 #endif 
+#endif
index 414f0d686bb654e062a9b037585e4ac5d102d670..ff4b53421ae9beed73d7940473852336d843aab3 100644 (file)
@@ -38,6 +38,8 @@
  * Contains an implementation class for left_child_next_sibling_heap_.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 void
 PB_DS_CLASS_C_DEC::
@@ -148,3 +150,4 @@ bubble_to_top(node_pointer p_nd)
     }
 }
 
+#endif
index d12710a1218e05841fa4790588ddb7dae3a6677e..605eeb9a26dcd66ee5caea3e6851cae03aeb5b7b 100644 (file)
@@ -38,6 +38,8 @@
  * Contains an implementation class for left_child_next_sibling_heap_.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 _GLIBCXX_NODISCARD
 inline bool
@@ -63,3 +65,4 @@ max_size() const
   return (s_node_allocator.max_size());
 }
 
+#endif
index e05cbb9e2fbf18c690c44c59f20f2b7cdba75e5a..6bc252f02e41ff37ce0a1b8fd914270693df01a5 100644 (file)
@@ -38,6 +38,8 @@
  * Contains an implementation class for left_child_next_sibling_heap_.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 inline typename PB_DS_CLASS_C_DEC::node_pointer
 PB_DS_CLASS_C_DEC::
@@ -173,3 +175,4 @@ swap_with_parent(node_pointer p_nd, node_pointer p_parent)
   _GLIBCXX_DEBUG_ASSERT(parent(p_parent) == p_nd);
 }
 
+#endif
index c78113ba2f403fc249ad383e6fd55c0b5173d17c..465ca4299bcf4dcc725271efa8a2e07d9a1e674f 100644 (file)
@@ -38,6 +38,8 @@
  * Contains an implementation class for left_child_next_sibling_heap_.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 inline typename PB_DS_CLASS_C_DEC::iterator
 PB_DS_CLASS_C_DEC::
@@ -86,3 +88,4 @@ end() const
   return (const_iterator(0));
 }
 
+#endif
index 4c44ed6616ffce2cc5a00d39f9b597880a4b4e50..6632e15474dd8edd14258c7eb4aa1ae315e88d30 100644 (file)
@@ -38,6 +38,8 @@
  * Contains an implementation class for left_child_next_sibling_heap_.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 Cmp_Fn& 
 PB_DS_CLASS_C_DEC::
@@ -50,3 +52,4 @@ PB_DS_CLASS_C_DEC::
 get_cmp_fn() const
 { return *this; }
 
+#endif
index 36c0ab6d53b7468711f9bf2083abbf817d86cb7e..9310a7b098e32e93804edd8c39d9a9e3c2e0e782 100644 (file)
@@ -38,6 +38,8 @@
  * Contains an implementation class for left_child_next_sibling_heap_.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 #ifdef PB_DS_LC_NS_HEAP_TRACE_
 
 PB_DS_CLASS_T_DEC
@@ -88,3 +90,4 @@ trace_node_metadata(node_const_pointer, type_to_type<null_type>)
 { }
 
 #endif // #ifdef PB_DS_LC_NS_HEAP_TRACE_
+#endif
index e29b5eccc024133e4261931b89fb0ab571aaea0b..e816204380f9d69c443dd4d848cf1c603a31beba 100644 (file)
@@ -37,6 +37,8 @@
  * @file list_update_map_/constructor_destructor_fn_imps.hpp
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 typename PB_DS_CLASS_C_DEC::entry_allocator
 PB_DS_CLASS_C_DEC::s_entry_allocator;
@@ -134,3 +136,4 @@ PB_DS_CLASS_T_DEC
 PB_DS_CLASS_C_DEC::
 ~PB_DS_LU_NAME()
 { deallocate_all(); }
+#endif
index 474fc11de18215ef07d8d99f032e104900e326da..451b1c5aadbbf711a6fff8b1c6c5343dfd82276c 100644 (file)
@@ -38,6 +38,8 @@
  * Contains implementations of cc_ht_map_'s debug-mode functions.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 #ifdef _GLIBCXX_DEBUG
 
 PB_DS_CLASS_T_DEC
@@ -55,3 +57,4 @@ assert_valid(const char* __file, int __line) const
 }
 
 #endif 
+#endif
index 96d584118f55aabf30d77de2248258136bd51a9c..6e7c576c505bd789807c2beb5cdebb349423dd0d 100644 (file)
@@ -38,6 +38,8 @@
  * Contains implementations of lu_map_.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 inline bool
 PB_DS_CLASS_C_DEC::
@@ -132,3 +134,4 @@ actual_erase_entry(entry_pointer p_l)
   s_entry_allocator.deallocate(p_l, 1);
 }
 
+#endif
index 5e602dd76462775a15602f8b972de5b226424388..c56d1676f627535f52926b96966d66e24c0df04e 100644 (file)
@@ -38,6 +38,8 @@
  * Contains implementations of lu_map_.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 inline typename PB_DS_CLASS_C_DEC::entry_pointer
 PB_DS_CLASS_C_DEC::
@@ -88,3 +90,4 @@ PB_DS_CLASS_C_DEC::
 apply_update(entry_pointer, type_to_type<null_type>)
 { return s_update_policy(s_null_type); }
 
+#endif
index 5d2e81ff4a7d21a7d023e731fa4a7b9d7d18771f..e95c8a588c339478e8fe786588ea96b839c50373 100644 (file)
@@ -38,6 +38,8 @@
  * Contains implementations of lu_map_.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 inline typename PB_DS_CLASS_C_DEC::size_type
 PB_DS_CLASS_C_DEC::
@@ -56,3 +58,4 @@ inline bool
 PB_DS_CLASS_C_DEC::
 empty() const
 { return (m_p_l == 0); }
+#endif
index fe71f06b79f51a52371f853145d720540561e35e..dfc9900c1e02fa62e918be106c70904b9e74c888 100644 (file)
@@ -38,6 +38,8 @@
  * Contains implementations of lu_map_.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 inline std::pair<
   typename PB_DS_CLASS_C_DEC::point_iterator,
@@ -104,3 +106,4 @@ PB_DS_CLASS_C_DEC::
 init_entry_metadata(entry_pointer, type_to_type<null_type>)
 { }
 
+#endif
index 79733ef204ec9ff5adca090f7edbf893d0955508..0efe2625dddd0a0934fb020a47e17875116ffab0 100644 (file)
@@ -38,6 +38,8 @@
  * Contains implementations of lu_map_.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 inline typename PB_DS_CLASS_C_DEC::iterator
 PB_DS_CLASS_C_DEC::
@@ -78,3 +80,4 @@ end() const
   return const_iterator(0, 0, const_cast<PB_DS_CLASS_C_DEC*>(this));
 }
 
+#endif
index 7ec66b78176886936571b7cc80d39e7f687b1359..f321633cd47700f69c3e7d8b3223d985d06fcc4f 100644 (file)
@@ -38,6 +38,8 @@
  * Contains implementations of lu_map_.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 #ifdef PB_DS_LU_MAP_TRACE_
 
 PB_DS_CLASS_T_DEC
@@ -57,3 +59,4 @@ trace() const
 
 #endif 
 
+#endif
index 021abc2f8abd4b0fa500374e7035e618f32e8bee..e081392a8cd797394d3fcde1ed53d1babd1fda61 100644 (file)
@@ -38,6 +38,8 @@
  * Contains an implementation class for ov_tree_.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 typename PB_DS_CLASS_C_DEC::value_allocator
 PB_DS_CLASS_C_DEC::s_value_alloc;
@@ -255,3 +257,4 @@ update(node_iterator nd_it, Node_Update* p_update)
       node_update::operator()(nd_it, end_it);
     }
 }
+#endif
index cfb6fd54e6ee973a71e65237a9ec56b9e4f36372..2117ceb87ff37da3774a464b9a5b719b4141a193 100644 (file)
@@ -38,6 +38,8 @@
  * Contains an implementation class for ov_tree_.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 #ifdef _GLIBCXX_DEBUG
 
 PB_DS_CLASS_T_DEC
@@ -77,3 +79,4 @@ assert_iterators(const char* __file, int __line) const
 }
 
 #endif
+#endif
index c74c1b8b1c5b305bd11ddb79859191d74428efba..060eb3cf0c1e769cdd6db4349acd8f2bbab7f573 100644 (file)
@@ -38,6 +38,8 @@
  * Contains an implementation class for ov_tree_.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 void
 PB_DS_CLASS_C_DEC::
@@ -189,3 +191,4 @@ erase(key_const_reference r_key)
   erase(it);
   return true;
 }
+#endif
index 81e7305e315ef2b12bd8aeb7df44aadf1c1260df..99a1dcadc8a24787f452b4efab0cc8a48396f5d8 100644 (file)
@@ -38,6 +38,8 @@
  * Contains an implementation class for ov_tree_.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 inline typename PB_DS_CLASS_C_DEC::size_type
 PB_DS_CLASS_C_DEC::
@@ -59,3 +61,4 @@ inline bool
 PB_DS_CLASS_C_DEC::
 empty() const
 { return size() == 0; }
+#endif
index 79a429a0bb322093182a7fcc61f240aa9fc25f61..d34b2e4794b24892620c158b7d55b47212101a53 100644 (file)
@@ -38,6 +38,8 @@
  * Contains an implementation class for ov_tree_.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 void
 PB_DS_CLASS_C_DEC::
@@ -61,3 +63,4 @@ reallocate_metadata(Node_Update_* , size_type new_size)
   std::swap(m_a_metadata, a_new_metadata_vec);
 }
 
+#endif
index b071a75812bc8f750436cb3f3b2a9cdc8681fd9c..c61d40e0dbee9c3d747efc40c19285dceef87a7e 100644 (file)
@@ -38,6 +38,8 @@
  * Contains an implementation class for ov_tree_.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 inline typename PB_DS_CLASS_C_DEC::node_const_iterator
 PB_DS_CLASS_C_DEC::
@@ -101,3 +103,4 @@ PB_DS_node_end_imp()
                  end(),(m_a_metadata == 0) ? 0 : m_a_metadata + m_size);
 }
 
+#endif
index 991f1c5654b2ebdbf784df5ee6b5f7fa7405701a..beaaff60ddc4695ef02e0c713db212daecd3726b 100644 (file)
@@ -38,6 +38,8 @@
  * Contains an implementation class for ov_tree.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 Cmp_Fn& 
 PB_DS_CLASS_C_DEC::
@@ -49,3 +51,4 @@ const Cmp_Fn&
 PB_DS_CLASS_C_DEC::
 get_cmp_fn() const
 { return *this; }
+#endif
index 0f5b04c75e7769fd1a6d8775e1aed4fe7f606412..525ae9c8b26f9b2bf4b2eba95fba1e7caef7a399 100644 (file)
@@ -38,6 +38,8 @@
  * Contains an implementation class for ov_tree_.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 void
 PB_DS_CLASS_C_DEC::
@@ -130,3 +132,4 @@ join(PB_DS_CLASS_C_DEC& other)
   PB_DS_ASSERT_VALID((*this))
   PB_DS_ASSERT_VALID(other)
 }
+#endif
index 1848255879b9ee59511206a434d3ff911f17497d..f28ce89e95593eb58416a7e9c327dafbe0f44de9 100644 (file)
@@ -38,6 +38,8 @@
  * Contains an implementation class for a pairing heap.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 template<typename It>
 void
@@ -80,3 +82,4 @@ PB_DS_CLASS_T_DEC
 PB_DS_CLASS_C_DEC::
 ~pairing_heap()
 { }
+#endif
index 93f63fcbc9a772734a2d27c952a0eeefa41d496b..2a2358dfae905fd88a8e496d16b834a3978dd360 100644 (file)
@@ -38,6 +38,8 @@
  * Contains an implementation class for a pairing heap.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 #ifdef _GLIBCXX_DEBUG
 
 PB_DS_CLASS_T_DEC
@@ -51,3 +53,4 @@ assert_valid(const char* __file, int __line) const
 }
 
 #endif 
+#endif
index 64923faa41b6afd342f2c0cbce97459a8891f635..954715c1c61ab219aed3f925f3400ed5e79cf587 100644 (file)
@@ -38,6 +38,8 @@
  * Contains an implementation class for a pairing heap.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 void
 PB_DS_CLASS_C_DEC::
@@ -231,3 +233,4 @@ erase_if(Pred pred)
   return ersd;
 }
 
+#endif
index 2bc072918d97300f0874866d8a68bd85efa880f2..e18f5d6511f2f3fbc73ce78873f5bf38cdfcdebc 100644 (file)
@@ -38,6 +38,8 @@
  * Contains an implementation class for a pairing heap.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 inline typename PB_DS_CLASS_C_DEC::const_reference
 PB_DS_CLASS_C_DEC::
@@ -47,3 +49,4 @@ top() const
   _GLIBCXX_DEBUG_ASSERT(!base_type::empty());
   return base_type::m_p_root->m_value;
 }
+#endif
index 6c7baeaab13df9a664868d75d0a76ad6f63dab19..e0299a4be414e834b8cb1a08e4e2aa6b6e43c423 100644 (file)
@@ -38,6 +38,8 @@
  * Contains an implementation class for a pairing heap.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 inline typename PB_DS_CLASS_C_DEC::point_iterator
 PB_DS_CLASS_C_DEC::
@@ -86,3 +88,4 @@ modify(point_iterator it, const_reference r_new_val)
   push_imp(it.m_p_nd);
   PB_DS_ASSERT_VALID((*this))
 }
+#endif
index e03a8ba3694a8d51acbf98370c6df475844d0f65..f243eeffc15b3572867505ba28f37c03dd3c3241 100644 (file)
@@ -38,6 +38,8 @@
  * Contains an implementation class for a pairing heap.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 template<typename Pred>
 void
@@ -121,3 +123,4 @@ join(PB_DS_CLASS_C_DEC& other)
   PB_DS_ASSERT_VALID((*this))
   PB_DS_ASSERT_VALID(other)
 }
+#endif
index 93ffcf10d5c42a57b2e0091382249b3bed6d851f..360034d3c7ed1b1d78e4c557ef2b9019602dff95 100644 (file)
@@ -38,6 +38,8 @@
  * Contains an implementation class for pat_trie.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 typename PB_DS_CLASS_C_DEC::head_allocator
 PB_DS_CLASS_C_DEC::s_head_allocator;
@@ -212,3 +214,4 @@ recursive_copy_node(node_const_pointer p_ncp)
   apply_update(p_ret, (node_update*)this);
   return p_ret;
 }
+#endif
index c72024aed45977e4957cf27723dc45e2be1d4e65..4f6dd612cbaafb2402754e1f4d98ada042ca1299 100644 (file)
@@ -38,6 +38,8 @@
  * Contains an implementation class for pat_trie_.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 #ifdef _GLIBCXX_DEBUG
 
 PB_DS_CLASS_T_DEC
@@ -113,3 +115,4 @@ recursive_count_leafs(node_const_pointer p_nd, const char* __file, int __line)
 }
 
 #endif
+#endif
index e83622043754d5d815bffbf2324db6f8b650b5cd..25c97a775f20c0e47a7809ad80807278aadebc96 100644 (file)
@@ -38,6 +38,8 @@
  * Contains an implementation class for pat_trie.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 inline bool
 PB_DS_CLASS_C_DEC::
@@ -313,3 +315,4 @@ update_min_max_for_erased_leaf(leaf_pointer p_l)
       m_p_head->m_p_max = it.m_p_nd;
     }
 }
+#endif
index 33121737798499bedd43389c3f2b0e427600effd..6005d4eaba6dcbe539bea4712c3489ac7d6aabfb 100644 (file)
@@ -38,6 +38,8 @@
  * Contains an implementation class for pat_trie.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 inline typename PB_DS_CLASS_C_DEC::point_iterator
 PB_DS_CLASS_C_DEC::
@@ -267,3 +269,4 @@ rightmost_descendant(node_pointer p_nd)
   return static_cast<inode_pointer>(p_nd)->rightmost_descendant();
 }
 
+#endif
index 33fc3e14ccfd80a5c5aa75bcd8859007048c847d..7012055f2b0e5cb72cb44226d7053a32bc716ea0 100644 (file)
@@ -38,6 +38,8 @@
  * Contains an implementation class for pat_trie.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 _GLIBCXX_NODISCARD
 inline bool
@@ -57,3 +59,4 @@ PB_DS_CLASS_C_DEC::
 max_size() const
 { return s_inode_allocator.max_size(); }
 
+#endif
index f661e9754dec8ff65668e5679b7c11464b53a77b..442d32e547f3f5bc65ebd79668dde12db5e525c1 100644 (file)
@@ -38,6 +38,8 @@
  * Contains an implementation class for pat_trie.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 void
 PB_DS_CLASS_C_DEC::
@@ -470,3 +472,4 @@ update_min_max_for_inserted_leaf(leaf_pointer p_new_lf)
       synth_access_traits::cmp_keys(PB_DS_V2F(static_cast<leaf_const_pointer>(m_p_head->m_p_max)->value()), PB_DS_V2F(p_new_lf->value())))
     m_p_head->m_p_max = p_new_lf;
 }
+#endif
index b027f781e17198a31298f36893dc91ebf032c7b3..3fb9d850491d4748781d3bbb58571d1524f176cf 100644 (file)
@@ -38,6 +38,8 @@
  * Contains an implementation class for pat_trie.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 inline typename PB_DS_CLASS_C_DEC::iterator
 PB_DS_CLASS_C_DEC::
@@ -118,3 +120,4 @@ PB_DS_CLASS_C_DEC::
 node_end()
 { return node_iterator(0, this); }
 
+#endif
index 3b656d75255399954f5d122b627dd572e009cc3f..7f7fe01dba5870d584db43b5135578dd1f4ecaa9 100644 (file)
@@ -38,6 +38,8 @@
  * Contains an implementation class for pat_trie.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 typename PB_DS_CLASS_C_DEC::access_traits& 
 PB_DS_CLASS_C_DEC::
@@ -61,3 +63,4 @@ const typename PB_DS_CLASS_C_DEC::node_update&
 PB_DS_CLASS_C_DEC::
 get_node_update() const
 { return *this; }
+#endif
index 3726cb69f9717e7ce52c062b91a58ef00d3e16fb..6a24e5acaf6d98c13535d03da7001792f1613317 100644 (file)
@@ -38,6 +38,8 @@
  * Contains an implementation class for pat_trie.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 inline void
 PB_DS_CLASS_C_DEC::
@@ -101,3 +103,4 @@ clear_imp(node_pointer p_nd)
   s_node_allocator.deallocate(p_nd, 1);
 }
 
+#endif
index 8f2f1daee8ac90bf16aad0412defaa11f5201df2..af8c89608564c1433de4ffad827113cf4732e11f 100644 (file)
@@ -38,6 +38,8 @@
  * Contains imps for rotating nodes.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 inline void
 PB_DS_CLASS_C_DEC::
@@ -148,3 +150,4 @@ PB_DS_CLASS_C_DEC::
 update_to_top(node_pointer /*p_nd*/, __gnu_pbds::null_node_update*  /*p_update*/)
 { }
 
+#endif
index e2065aef3ebac1b3e9b56e61db067530310867bc..52a9d88f3b47013e2c1cfdc9c9d72781772db36a 100644 (file)
@@ -38,6 +38,8 @@
  * Contains an implementation class for pat_trie.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 void
 PB_DS_CLASS_C_DEC::
@@ -248,3 +250,4 @@ split_insert_branch(size_type e_ind, a_const_iterator b_it,
   apply_update(m_p_head->m_p_parent, (node_update*)this);
   PB_DS_ASSERT_NODE_VALID(m_p_head->m_p_parent)
 }
+#endif
index 70406f2450ed3da03efb765559aa2ffdbd9d1d7e..28df7ef09b3d3ce97430ac753c1a318f1d962d28 100644 (file)
@@ -38,6 +38,8 @@
  * Contains an implementation class for pat_trie_.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 #ifdef PB_DS_PAT_TRIE_TRACE_
 
 PB_DS_CLASS_T_DEC
@@ -109,3 +111,4 @@ trace_node_metadata(node_const_pointer, type_to_type<null_type>)
 
 #endif 
 
+#endif
index e7b4a69b458581d6acf76afacd7bd8e64b31aee2..db3d3addf174f9cefbddb6cb1ad536e9f069079a 100644 (file)
@@ -38,6 +38,8 @@
  * Contains an implementation class for pat_trie_.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 inline void
 PB_DS_CLASS_C_DEC::
@@ -53,3 +55,4 @@ apply_update(node_pointer p_nd, Node_Update_*)
   Node_Update_::operator()(node_iterator(p_nd, this),
                           node_const_iterator(0, this));
 }
+#endif
index 4d173cfff2e1adf4baff45d4e723a72718a54f53..f0c2cf1b4fed588f4d45c8852e057a66d4cef92c 100644 (file)
@@ -38,6 +38,8 @@
  * Contains an implementation for rb_tree_.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 template<typename It>
 void
@@ -98,3 +100,4 @@ void
 PB_DS_CLASS_C_DEC::
 initialize()
 { base_type::m_p_head->m_red = true; }
+#endif
index fcdad469d9a9a8c76fdd4491f40d667cbb9fe784..5106452c5b350016507eecb5746cec20beca4ad5 100644 (file)
@@ -38,6 +38,8 @@
  * Contains an implementation for rb_tree_.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 #ifdef _GLIBCXX_DEBUG
 
 PB_DS_CLASS_T_DEC
@@ -79,3 +81,4 @@ assert_valid(const char* __file, int __line) const
 
 #endif 
 
+#endif
index 0d92fede8d0721629b47530fe8451910e0072505..35aa2ba0322d7cd8686194e554633f0ca7e14035 100644 (file)
@@ -38,6 +38,8 @@
  * Contains an implementation for rb_tree_.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 inline bool
 PB_DS_CLASS_C_DEC::
@@ -287,3 +289,4 @@ remove_fixup(node_pointer p_x, node_pointer p_new_x_parent)
   if (p_x != 0)
     p_x->m_red = false;
 }
+#endif
index 045834891e3ecfc1e28201455ee98524326cc6b7..11c1b29b2fcc04e006dac4e0e408d53083cacdf7 100644 (file)
  * Contains an implementation for rb_tree_.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 inline bool
 PB_DS_CLASS_C_DEC::
 is_effectively_black(const node_pointer p_nd)
 { return (p_nd == 0 || !p_nd->m_red); }
 
+#endif
index 6cc88fa6d3735a694cbae50dea0fc27c2fd6f1c6..11efd02207047c364cd035a59c2ac19c44954b60 100644 (file)
@@ -38,6 +38,8 @@
  * Contains an implementation for rb_tree_.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 inline std::pair<typename PB_DS_CLASS_C_DEC::point_iterator, bool>
 PB_DS_CLASS_C_DEC::
@@ -113,3 +115,4 @@ insert_fixup(node_pointer p_nd)
   base_type::update_to_top(p_nd, (node_update* )this);
   base_type::m_p_head->m_p_parent->m_red = false;
 }
+#endif
index 85ebdfb886c856b00776d5cfc455a94ebdb40814..adddc4f1858ea3818e4efdcd821074ed3f55b5fd 100644 (file)
@@ -38,6 +38,8 @@
  * Contains an implementation for rb_tree_.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 inline void
 PB_DS_CLASS_C_DEC::
@@ -304,3 +306,4 @@ split_at_node(node_pointer p_nd, PB_DS_CLASS_C_DEC& other)
   PB_DS_STRUCT_ONLY_ASSERT_VALID(other)
 }
 
+#endif
index 0c6a9608fa559a2caaf2a0b5c2e0c9263640ef3e..0864dcef099d3bec37a41ce456c6d2d2b5bbd8ae 100644 (file)
@@ -38,6 +38,8 @@
  * Contains an implementation for rc_binomial_heap_.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 PB_DS_CLASS_C_DEC::
 rc_binomial_heap()
@@ -82,3 +84,4 @@ swap(PB_DS_CLASS_C_DEC& other)
   PB_DS_ASSERT_VALID((*this))
   PB_DS_ASSERT_VALID(other)
 }
+#endif
index bec9ca3d42fe2c010dcad8bb689d8c3ae366a683..d258ee459b7579128ed624974e641dc4771bf205 100644 (file)
@@ -38,6 +38,8 @@
  * Contains an implementation for rc_binomial_heap_.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 #ifdef _GLIBCXX_DEBUG
 
 PB_DS_CLASS_T_DEC
@@ -119,3 +121,4 @@ next_after_0_pointer(node_const_pointer p_nd)
 }
 
 #endif 
+#endif
index b6d50748ed4478b4f544ca9d635b1f08cf0d93cb..03d6b0f5efafb33749593bf57a4bd4ef1182a7da 100644 (file)
@@ -38,6 +38,8 @@
  * Contains an implementation for rc_binomial_heap_.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 inline void
 PB_DS_CLASS_C_DEC::
@@ -105,3 +107,4 @@ erase(point_iterator it)
   base_type::find_max();
 }
 
+#endif
index b8f59d0184ac8bc6d9b490191241a07a86c2d022..7d4da53a313148413c45f62ddfdc0fabb91bf39d 100644 (file)
@@ -38,6 +38,8 @@
  * Contains an implementation for rc_binomial_heap_.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 inline typename PB_DS_CLASS_C_DEC::point_iterator
 PB_DS_CLASS_C_DEC::
@@ -152,3 +154,4 @@ make_0_exposed()
   if (p_res->m_p_next_sibling != 0&&  p_res->m_metadata == p_res->m_p_next_sibling->m_metadata)
     m_rc.push(p_res);
 }
+#endif
index 12363fe79a51685a8d1c5c563d8b53ec11573cfe..074b041f194940b81a57d6fc278a42ce313bf1cb 100644 (file)
@@ -38,6 +38,8 @@
  * Contains an implementation for rc_binomial_heap_.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 template<typename Pred>
 void
@@ -75,3 +77,4 @@ join(PB_DS_CLASS_C_DEC& other)
   PB_DS_ASSERT_VALID(other)
 }
 
+#endif
index 0b771a7f42d78f2d75d7468c1a9e47f8bce34879..0a429b0fff85e23a4766414510b5634ee150c30b 100644 (file)
@@ -38,6 +38,8 @@
  * Contains an implementation for rc_binomial_heap_.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 #ifdef PB_DS_RC_BINOMIAL_HEAP_TRACE_
 
 PB_DS_CLASS_T_DEC
@@ -50,3 +52,4 @@ trace() const
 }
 
 #endif // #ifdef PB_DS_RC_BINOMIAL_HEAP_TRACE_
+#endif
index fa246c060f9ca96a1140e22c616981446eaa1d67..06e4eb62a33b30fc032287db25728d66c6b3a2bc 100644 (file)
@@ -38,6 +38,8 @@
  * Contains a resize trigger implementation.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 PB_DS_CLASS_C_DEC::
 cc_hash_max_collision_check_resize_trigger(float load) :
@@ -209,3 +211,4 @@ set_load(float load)
   calc_resize_needed();
 }
 
+#endif
index c51e32860083eee2f68e0dbbbc08c2289ae32973..8d02c85def896904f3f9dbab1d22c0e22efc5b45 100644 (file)
@@ -38,6 +38,8 @@
  * Contains a resize size policy implementation.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 PB_DS_CLASS_C_DEC::
 hash_exponential_size_policy(size_type start_size, size_type grow_factor) :
@@ -88,3 +90,4 @@ get_nearest_smaller_size(size_type size) const
   return ret;
 }
 
+#endif
index 19dfa8f34a865a49cf3ed13ff6d74f2528e2e9b5..edfb35b24125f4c6999510aa420752ea54ab0144 100644 (file)
@@ -38,6 +38,8 @@
  * Contains a resize trigger implementation.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 #define PB_DS_ASSERT_VALID(X)                                          \
   _GLIBCXX_DEBUG_ONLY(X.assert_valid(__FILE__, __LINE__);)
 
@@ -291,3 +293,4 @@ assert_valid(const char* __file, int __line) const
 # undef PB_DS_DEBUG_VERIFY
 #endif
 #undef PB_DS_ASSERT_VALID
+#endif
index c3934e1b31b2b86aa01d82e6ec127efd92c54c01..d93f2076d3f31fcf09e11c525013a68c688f96e8 100644 (file)
@@ -38,6 +38,8 @@
  * Contains a resize size policy implementation.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 #pragma GCC system_header
 
 namespace detail
@@ -159,3 +161,4 @@ get_nearest_smaller_size(size_type n) const
     return m_start_size;
   return *p_lower;
 }
+#endif
index 45fbfc0bf8f5bb6e2c61220c3dce020d5517a3f9..f77a0952c77088a1561898eab67441b07f158606 100644 (file)
@@ -38,6 +38,8 @@
  * Contains a resize policy implementation.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 PB_DS_CLASS_C_DEC::
 hash_standard_resize_policy() 
@@ -247,3 +249,4 @@ PB_DS_CLASS_C_DEC::
 get_size_policy() const
 { return *this; }
 
+#endif
index 99247ee139529d216719d9102f45b5a646cc8700..21a70da41650d0b8fd7380acd8a54e1c139124f2 100644 (file)
@@ -38,6 +38,8 @@
  * Contains an implementation class for splay_tree_.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 template<typename It>
 void
@@ -100,3 +102,4 @@ void
 PB_DS_CLASS_C_DEC::
 initialize()
 { base_type::m_p_head->m_special = true; }
+#endif
index fdc0cfa2fd12473f7d80ac9691c12104572043cf..f24d2a367e190027137f3f83c23b236e566fc85c 100644 (file)
@@ -38,6 +38,8 @@
  * Contains an implementation class for splay_tree_.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 #ifdef _GLIBCXX_DEBUG
 
 PB_DS_CLASS_T_DEC
@@ -73,3 +75,4 @@ assert_special_imp(const node_pointer p_nd,
 
 #endif 
 
+#endif
index 1fea88a12db17eea38edd9aace57d5d7f8905ced..7aa3f24b485509523b4d14a4b89b51412615b61c 100644 (file)
@@ -38,6 +38,8 @@
  * Contains an implementation class for splay_tree_.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 inline bool
 PB_DS_CLASS_C_DEC::
@@ -155,3 +157,4 @@ leftmost(node_pointer p_nd)
     p_nd = p_nd->m_p_left;
   return p_nd;
 }
+#endif
index 6cccb441685970bed2b784d3fb6a46bcc00020ec..0ba3f5dc3b856a06ee2561700bbde23f4efa4951 100644 (file)
@@ -38,6 +38,8 @@
  * Contains an implementation class for splay_tree_.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 inline typename PB_DS_CLASS_C_DEC::point_iterator
 PB_DS_CLASS_C_DEC::
@@ -98,3 +100,4 @@ find_imp(key_const_reference r_key) const
       p_nd = p_nd->m_p_right;
   return base_type::m_p_head;
 }
+#endif
index 137c5cf7fa5a558eb8772830ca51ce2afa3d6019..9fb4cf0a4f5198af7f0ceba726410c3e4e39f200 100644 (file)
@@ -38,6 +38,8 @@
  * Contains an implementation class for splay_tree_.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 inline std::pair<typename PB_DS_CLASS_C_DEC::point_iterator, bool>
 PB_DS_CLASS_C_DEC::
@@ -92,3 +94,4 @@ insert_leaf_imp(const_reference r_value)
 
   return std::make_pair(this->insert_leaf_new(r_value, p_nd, false), true);
 }
+#endif
index 86983c39c64ac15921633883e81d4c376ac67145..2af92a25b865ed24bfef3693a835fab8bfc14f56 100644 (file)
@@ -38,6 +38,8 @@
  * Contains an implementation class for splay_tree_.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 void
 PB_DS_CLASS_C_DEC::
@@ -279,3 +281,4 @@ splay_zz_end(node_pointer p_nd, node_pointer p_parent,
   this->apply_update(p_nd, (node_update*)this);
   PB_DS_ASSERT_BASE_NODE_CONSISTENT(p_nd)
 }
+#endif
index a519ea1ce979a60e8c839adf1488b844991e353d..7419ccf495f3b30cc9c4c23625287337e7255dcb 100644 (file)
@@ -38,6 +38,8 @@
  * Contains an implementation class for splay_tree_.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 inline void
 PB_DS_CLASS_C_DEC::
@@ -110,3 +112,4 @@ split(key_const_reference r_key, PB_DS_CLASS_C_DEC& other)
   PB_DS_ASSERT_VALID(other)
 }
 
+#endif
index 91e9a7c25183fb18cd53e5a6d0e20d91595bf7dd..dd4e70f02d3e587a21319bad7941610b73c60859 100644 (file)
@@ -38,6 +38,8 @@
  * Contains an implementation for thin_heap_.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 template<typename It>
 void
@@ -103,3 +105,4 @@ PB_DS_CLASS_C_DEC::
 initialize()
 { std::fill(m_a_aux, m_a_aux + max_rank, static_cast<node_pointer>(0)); }
 
+#endif
index 3a434b674d8fcb41905172658378469ece95587d..447305d326a30d3939dfcb80bc2b25026a30790c 100644 (file)
@@ -38,6 +38,8 @@
  * Contains an implementation for thin_heap_.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 #ifdef _GLIBCXX_DEBUG
 
 PB_DS_CLASS_T_DEC
@@ -117,3 +119,4 @@ assert_node_consistent(node_const_pointer p_nd, bool root,
 }
 
 #endif 
+#endif
index 5dc0977f7b1bc871f6c43e93b0f887b70d09f07f..f26722653700c7f1c9eb4b31cace8752be953435 100644 (file)
@@ -38,6 +38,8 @@
  * Contains an implementation for thin_heap_.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 void
 PB_DS_CLASS_C_DEC::
@@ -253,3 +255,4 @@ rank_bound()
 
   return (p_upper - g_a_rank_bounds);
 }
+#endif
index 92009bbb55d10de3047b898702956325496883e3..8300867b5b69cac0c655888e1c2bcb633f8abcd5 100644 (file)
@@ -38,6 +38,8 @@
  * Contains an implementation for thin_heap_.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 inline typename PB_DS_CLASS_C_DEC::const_reference
 PB_DS_CLASS_C_DEC::
@@ -49,3 +51,4 @@ top() const
   _GLIBCXX_DEBUG_ASSERT(m_p_max != 0);
   return m_p_max->m_value;
 }
+#endif
index 76ea0132ce461d4f339bac1ddbe150bbdf77787e..57d3720409cf4b40588173495e0f834ccb8d5951 100644 (file)
@@ -38,6 +38,8 @@
  * Contains an implementation for thin_heap_.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 inline typename PB_DS_CLASS_C_DEC::point_iterator
 PB_DS_CLASS_C_DEC::
@@ -278,3 +280,4 @@ update_max(node_pointer p_nd)
     m_p_max = p_nd;
 }
 
+#endif
index 44103d01aefc563feed350c599d641df5ec11198..b922f473031a91cc148543e4fe7eaba472ec46c0 100644 (file)
@@ -38,6 +38,8 @@
  * Contains an implementation for thin_heap_.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 template<typename Pred>
 void
@@ -106,3 +108,4 @@ join(PB_DS_CLASS_C_DEC& other)
   PB_DS_ASSERT_VALID((*this))
   PB_DS_ASSERT_VALID(other)
 }
+#endif
index 428b4bb933ee93dc17484a56f980f38585585735..88e2ee7523641ea8354f45c2aa2255ca5b747639 100644 (file)
@@ -38,6 +38,8 @@
  * Contains an implementation class for left_child_next_sibling_heap_.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 #ifdef PB_DS_THIN_HEAP_TRACE_
 
 PB_DS_CLASS_T_DEC
@@ -51,3 +53,4 @@ trace() const
 }
 
 #endif // #ifdef PB_DS_THIN_HEAP_TRACE_
+#endif
index 4b2fcb5af4ab2471a697a46576d33590112c81a7..f7cfdb9fe9550563e823cada4a9b2465bed70da6 100644 (file)
@@ -38,6 +38,8 @@
  * Contains forward declarations for order_statistics_key
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 inline typename PB_DS_CLASS_C_DEC::iterator
 PB_DS_CLASS_C_DEC::
@@ -119,3 +121,4 @@ PB_DS_CLASS_T_DEC
 PB_DS_CLASS_C_DEC::
 ~tree_order_statistics_node_update()
 { }
+#endif
index 951de0c8c963ab5ac428d41957d099c5191dd12f..4b05675a690d0cf4a0865f3ff6ed95c2ae3820cd 100644 (file)
@@ -38,6 +38,8 @@
  * Contains forward declarations for order_statistics_key
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 inline typename PB_DS_CLASS_C_DEC::iterator
 PB_DS_CLASS_C_DEC::
@@ -158,3 +160,4 @@ operator()(node_iterator nd_it, node_const_iterator /*end_nd_it*/) const
   const size_type res = (num_children == 0) ? 1 : children_rank;
   const_cast<size_type&>(nd_it.get_metadata()) = res;
 }
+#endif
index 63c4ef6b3eb5928045c59336f9f532afdcda8311..49b0615ea204e2ad73193fbd10aecb5893bd37b1 100644 (file)
@@ -38,6 +38,8 @@
  * Contains an implementation of prefix_search_node_update.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 std::pair<
   typename PB_DS_CLASS_C_DEC::const_iterator,
@@ -137,3 +139,4 @@ inline void
 PB_DS_CLASS_C_DEC::
 operator()(node_iterator /*nd_it*/, node_const_iterator /*end_nd_it*/) const
 { }
+#endif
index 2e96964e330b07392bc4d6c2f898712492bc1089..d7f6a3c5437397bb1afcc31deb6be12cc9d0bd1c 100644 (file)
@@ -39,6 +39,8 @@
  *    a string for a vector-based PATRICIA tree
  */
 
+#ifdef PB_DS_CLASS_C_DEC
+
 PB_DS_CLASS_T_DEC
 detail::integral_constant<int, Reverse> PB_DS_CLASS_C_DEC::s_rev_ind;
 
@@ -97,3 +99,4 @@ end_imp(key_const_reference r_key, detail::true_type)
 {
   return (r_key.rend());
 }
+#endif
index ef7e7846c4b1a8821585636dd3fba6f78a4fc394..7468af6ad912359f917c23741b38374ea2fc89e6 100644 (file)
  * @file unordered_iterator/const_iterator.hpp
  * Contains an iterator class used for const ranging over the elements of the
  * table.
+ *
+ * This file is intended to be included inside a class definition, with
+ * PB_DS_CLASS_C_DEC defined to the name of the enclosing class.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
 /// Const range-type iterator.
 class const_iterator_
 : public point_const_iterator_
@@ -109,3 +113,4 @@ protected:
 
   friend class PB_DS_CLASS_C_DEC;
 };
+#endif
index 29fa3d1214005799d5019335bcfbd2d3fb390c58..388fccf625d7109bba264cfabb9ea02119b9a2a8 100644 (file)
 /**
  * @file iterator.hpp
  * Contains an iterator_ class used for ranging over the elements of the
- *    table.
+ * table.
+ *
+ * This file is intended to be included inside a class definition, with
+ * PB_DS_CLASS_C_DEC defined to the name of the enclosing class.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
 /// Range-type iterator.
 class iterator_
 : public const_iterator_
@@ -128,3 +132,4 @@ protected:
 
   friend class PB_DS_CLASS_C_DEC;
 };
+#endif
index 367f371bebdce5fef471e45e5abf3b9e94cd7c50..3f55a73b721bbfb37992827b1a5e1448a8449b8a 100644 (file)
 /**
  * @file unordered_iterator/point_const_iterator.hpp
  * Contains an iterator class returned by the tables' const find and insert
- *     methods.
+ * methods.
+ *
+ * * This file is intended to be included inside a class definition, with
+ * PB_DS_CLASS_C_DEC defined to the name of the enclosing class.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
 class point_iterator_;
 
 /// Const point-type iterator.
@@ -130,4 +134,4 @@ protected:
 
   friend class PB_DS_CLASS_C_DEC;
 };
-
+#endif
index d2514ade3c284643c7ed81341feb66db05345696..40d769f84be013406a129aecd38d3dc063c69070 100644 (file)
 /**
  * @file point_iterator.hpp
  * Contains an iterator class returned by the tables' find and insert
- *     methods.
+ * methods.
+ *
+ * This file is intended to be included inside a class definition, with
+ * PB_DS_CLASS_C_DEC defined to the name of the enclosing class.
  */
 
+#ifdef PB_DS_CLASS_C_DEC
 /// Find type iterator.
 class point_iterator_
 {
@@ -124,3 +128,4 @@ protected:
 protected:
   pointer m_p_value;
 };
+#endif