/freebsd-9.3-release/contrib/libstdc++/include/ext/pb_ds/detail/splay_tree_/ |
H A D | constructors_destructor_fn_imps.hpp | 68 base_type(r_cmp_fn) 77 base_type(r_cmp_fn, r_node_update) 86 base_type(other) 99 base_type::swap(other); 108 { base_type::m_p_head->m_special = true; }
|
H A D | find_fn_imps.hpp | 53 if (p_found != base_type::m_p_head) 64 if (p_found != base_type::m_p_head) 74 _GLIBCXX_DEBUG_ONLY(base_type::structure_only_assert_valid();) 75 node_pointer p_nd = base_type::m_p_head->m_p_parent; 85 return base_type::m_p_head; 94 node_pointer p_nd = base_type::m_p_head->m_p_parent; 104 return base_type::m_p_head;
|
H A D | split_join_fn_imps.hpp | 54 if (base_type::join_prep(other) == false) 68 p_target_r->m_p_left = base_type::m_p_head->m_p_parent; 73 base_type::m_p_head->m_p_parent = p_target_r; 74 p_target_r->m_p_parent = base_type::m_p_head; 77 base_type::join_finish(other); 91 if (base_type::split_prep(r_key, other) == false) 107 base_type::m_p_head->m_p_parent = p_new_root; 108 p_new_root->m_p_parent = base_type::m_p_head; 113 base_type::split_finish(other);
|
H A D | splay_tree_.hpp | 144 typedef PB_DS_BASE_C_DEC base_type; typedef in class:pb_ds::detail::PB_DS_CLASS_NAME 145 typedef typename base_type::node_pointer node_pointer; 152 typedef typename base_type::key_type key_type; 153 typedef typename base_type::key_pointer key_pointer; 154 typedef typename base_type::const_key_pointer const_key_pointer; 155 typedef typename base_type::key_reference key_reference; 156 typedef typename base_type::const_key_reference const_key_reference; 157 typedef typename base_type::mapped_type mapped_type; 158 typedef typename base_type::mapped_pointer mapped_pointer; 159 typedef typename base_type [all...] |
H A D | erase_fn_imps.hpp | 53 if (it == base_type::end()) 65 if (it == base_type::end()) 80 if (it.m_p_nd == base_type::m_p_head) 97 iterator it = base_type::begin(); 98 while (it != base_type::end()) 126 base_type::update_min_max_for_erased_node(p_nd); 127 base_type::actual_erase_node(p_nd); 130 base_type::m_p_head->m_p_parent = p_l; 132 p_l->m_p_parent = base_type::m_p_head; 139 p_r->m_p_parent = base_type [all...] |
H A D | splay_fn_imps.hpp | 52 while (p_nd->m_p_parent != base_type::m_p_head) 56 node_pointer p_head = base_type::m_p_head; 61 _GLIBCXX_DEBUG_ONLY(base_type::assert_node_consistent(p_nd);) 63 if (p_nd->m_p_parent->m_p_parent == base_type::m_p_head) 65 base_type::rotate_parent(p_nd); 75 base_type::recursive_count(p_grandparent); 93 _GLIBCXX_DEBUG_ONLY(base_type::assert_node_consistent(p_nd);) 106 _GLIBCXX_DEBUG_ONLY(base_type::assert_node_consistent(p_grandparent);) 142 _GLIBCXX_DEBUG_ONLY(base_type::assert_node_consistent(p_grandparent);) 178 _GLIBCXX_DEBUG_ONLY(base_type [all...] |
/freebsd-9.3-release/contrib/libstdc++/include/ext/pb_ds/detail/pairing_heap_/ |
H A D | erase_fn_imps.hpp | 53 _GLIBCXX_DEBUG_ASSERT(!base_type::empty()); 55 node_pointer p_new_root = join_node_children(base_type::m_p_root); 60 base_type::actual_erase_node(base_type::m_p_root); 61 base_type::m_p_root = p_new_root; 71 _GLIBCXX_DEBUG_ASSERT(!base_type::empty()); 73 base_type::actual_erase_node(it.m_p_nd); 83 _GLIBCXX_DEBUG_ASSERT(!base_type::empty()); 88 base_type::assert_node_consistent(p_new_child, false); 91 if (p_nd == base_type [all...] |
/freebsd-9.3-release/contrib/libstdc++/include/ext/pb_ds/detail/thin_heap_/ |
H A D | erase_fn_imps.hpp | 53 _GLIBCXX_DEBUG_ASSERT(!base_type::empty()); 61 base_type::actual_erase_node(p_nd); 81 node_pointer p_add = base_type::m_p_root; 160 base_type::make_child_of(p_nd, p_new_parent); 168 base_type::m_p_root = m_p_max = NULL; 195 while (base_type::parent(p_parent) != NULL) 196 p_parent = base_type::parent(p_parent); 198 base_type::bubble_to_top(p_nd); 202 node_pointer p_fix = base_type::m_p_root; 217 base_type [all...] |
H A D | debug_fn_imps.hpp | 54 base_type::assert_valid(); 55 assert_node_consistent(base_type::m_p_root, true); 76 _GLIBCXX_DEBUG_ASSERT(base_type::empty()); 80 _GLIBCXX_DEBUG_ASSERT(!base_type::empty()); 81 _GLIBCXX_DEBUG_ASSERT(base_type::parent(m_p_max) == NULL); 83 for (const_iterator it = base_type::begin(); it != base_type::end(); ++it) 92 base_type::assert_node_consistent(p_nd, root); 107 _GLIBCXX_DEBUG_ASSERT(p_nd->m_p_l_child->m_metadata + 1 == base_type::degree(p_nd));
|
H A D | find_fn_imps.hpp | 53 _GLIBCXX_DEBUG_ASSERT(!base_type::empty());
|
H A D | trace_fn_imps.hpp | 58 base_type::trace();
|
/freebsd-9.3-release/contrib/libstdc++/include/ext/pb_ds/detail/rc_binomial_heap_/ |
H A D | rc_binomial_heap_.hpp | 81 typedef PB_DS_BASE_C_DEC base_type; typedef in class:pb_ds::detail::rc_binomial_heap_ 83 typedef typename base_type::node_pointer node_pointer; 85 typedef typename base_type::const_node_pointer const_node_pointer; 97 typedef typename base_type::pointer pointer; 99 typedef typename base_type::const_pointer const_pointer; 101 typedef typename base_type::reference reference; 103 typedef typename base_type::const_reference const_reference; 105 typedef typename base_type::const_point_iterator const_point_iterator; 107 typedef typename base_type::point_iterator point_iterator; 109 typedef typename base_type [all...] |
H A D | debug_fn_imps.hpp | 54 base_type::assert_valid(false); 55 if (!base_type::empty()) 57 _GLIBCXX_DEBUG_ASSERT(base_type::m_p_max != NULL); 58 base_type::assert_max(); 65 base_type::assert_valid(true); 66 _GLIBCXX_DEBUG_ASSERT(next_2_pointer(base_type::m_p_root) == NULL); 70 const_node_pointer p_nd = next_2_pointer(base_type::m_p_root);
|
H A D | constructors_destructor_fn_imps.hpp | 69 base_type::find_max(); 87 base_type::swap(other);
|
/freebsd-9.3-release/contrib/texinfo/makeinfo/ |
H A D | defun.c | 304 int base_type; local 307 case defivar: base_type = defcv; break; 308 case defmac: base_type = deffn; break; 309 case defmethod: base_type = defop; break; 310 case defopt: base_type = defvr; break; 311 case defspec: base_type = deffn; break; 312 case deftypecv: base_type = deftypecv; break; 313 case deftypefun: base_type = deftypefn; break; 314 case deftypeivar: base_type = deftypeivar; break; 315 case deftypemethod: base_type 334 int base_type; local [all...] |
/freebsd-9.3-release/contrib/libstdc++/include/ext/pb_ds/detail/unordered_iterator/ |
H A D | const_iterator.hpp | 90 m_p_tbl->inc_it_state(base_type::m_p_value, m_pos); 101 m_p_tbl->inc_it_state(base_type::m_p_value, m_pos); 108 typedef const_point_iterator_ base_type; typedef in class:const_iterator_
|
/freebsd-9.3-release/contrib/libstdc++/include/ext/pb_ds/detail/rb_tree_map_/ |
H A D | rb_tree_.hpp | 122 typedef PB_DS_BASE_C_DEC base_type; typedef in class:pb_ds::detail::PB_DS_CLASS_NAME 123 typedef typename base_type::node_pointer node_pointer; 130 typedef typename base_type::key_type key_type; 131 typedef typename base_type::key_pointer key_pointer; 132 typedef typename base_type::const_key_pointer const_key_pointer; 133 typedef typename base_type::key_reference key_reference; 134 typedef typename base_type::const_key_reference const_key_reference; 135 typedef typename base_type::mapped_type mapped_type; 136 typedef typename base_type::mapped_pointer mapped_pointer; 137 typedef typename base_type [all...] |
H A D | insert_fn_imps.hpp | 53 std::pair<point_iterator, bool> ins_pair = base_type::insert_leaf(r_value); 71 while (p_nd != base_type::m_p_head->m_p_parent && p_nd->m_p_parent->m_red) 88 base_type::rotate_left(p_nd); 92 base_type::rotate_right(p_nd->m_p_parent->m_p_parent); 110 base_type::rotate_right(p_nd); 114 base_type::rotate_left(p_nd->m_p_parent->m_p_parent); 119 base_type::update_to_top(p_nd, (node_update* )this); 120 base_type::m_p_head->m_p_parent->m_red = false;
|
H A D | erase_fn_imps.hpp | 53 if (it == base_type::end()) 65 if (it == base_type::end()) 81 if (it.m_p_nd == base_type::m_p_head) 99 iterator it = base_type::begin(); 100 while (it != base_type::end()) 121 base_type::actual_erase_node(p_nd); 153 if (base_type::m_p_head->m_p_parent == p_z) 154 base_type::m_p_head->m_p_parent = p_x; 182 if (base_type::m_p_head->m_p_parent == p_z) 183 base_type [all...] |
/freebsd-9.3-release/contrib/libstdc++/include/ext/pb_ds/detail/binomial_heap_base_/ |
H A D | split_join_fn_imps.hpp | 58 if (base_type::empty()) 66 base_type::to_linked_list(); 68 node_pointer p_out = base_type::prune(pred); 72 _GLIBCXX_DEBUG_ASSERT(base_type::m_size > 0); 73 --base_type::m_size; 97 node_pointer p_cur = base_type::m_p_root; 99 base_type::m_p_root = NULL; 109 p_cur->m_p_next_sibling = base_type::m_p_root; 111 if (base_type::m_p_root != NULL) 112 base_type [all...] |
H A D | find_fn_imps.hpp | 53 _GLIBCXX_DEBUG_ASSERT(!base_type::empty()); 67 node_pointer p_cur = base_type::m_p_root;
|
/freebsd-9.3-release/contrib/libstdc++/include/ext/pb_ds/detail/ |
H A D | constructors_destructor_fn_imps.hpp | 53 : base_type((const base_type&)other) 58 PB_DS_CLASS_NAME(T0 t0) : base_type(t0) 63 PB_DS_CLASS_NAME(T0 t0, T1 t1) : base_type(t0, t1) 68 PB_DS_CLASS_NAME(T0 t0, T1 t1, T2 t2) : base_type(t0, t1, t2) 74 : base_type(t0, t1, t2, t3) 80 : base_type(t0, t1, t2, t3, t4) 87 : base_type(t0, t1, t2, t3, t4, t5) 94 : base_type(t0, t1, t2, t3, t4, t5, t6) 101 : base_type(t [all...] |
/freebsd-9.3-release/contrib/libstdc++/include/ext/pb_ds/ |
H A D | assoc_container.hpp | 70 typedef typename PB_DS_BASE_C_DEC base_type; typedef in class:pb_ds::container_base 95 typedef typename base_type::value_type value_type; 103 typedef typename base_type::iterator iterator; 104 typedef typename base_type::const_iterator const_iterator; 105 typedef typename base_type::point_iterator point_iterator; 106 typedef typename base_type::const_point_iterator const_point_iterator; 137 typedef PB_DS_BASE_C_DEC base_type; typedef in class:pb_ds::basic_hash_table 150 operator=(const base_type&); 173 typedef PB_DS_BASE_C_DEC base_type; typedef in class:pb_ds::cc_hash_table 187 : base_type( 311 typedef PB_DS_BASE_C_DEC base_type; typedef in class:pb_ds::gp_hash_table 470 typedef PB_DS_BASE_C_DEC base_type; typedef in class:pb_ds::basic_tree 503 typedef PB_DS_BASE_C_DEC base_type; typedef in class:pb_ds::tree 579 typedef PB_DS_BASE_C_DEC base_type; typedef in class:pb_ds::trie 647 typedef PB_DS_BASE_C_DEC base_type; typedef in class:pb_ds::list_update [all...] |
H A D | tree_policy.hpp | 79 typedef PB_DS_BASE_C_DEC base_type; typedef in class:pb_ds::tree_order_statistics_node_update 85 typedef typename base_type::key_type key_type; 86 typedef typename base_type::const_key_reference const_key_reference; 118 typedef typename base_type::const_reference const_reference; 121 typedef typename base_type::const_pointer const_pointer;
|
/freebsd-9.3-release/contrib/libstdc++/include/ext/pb_ds/detail/pat_trie_/ |
H A D | node_iterators.hpp | 277 typedef PB_DS_PAT_TRIE_CONST_NODE_ITERATOR_C_DEC base_type; typedef in class:pb_ds::detail::pat_trie_node_it_ 280 typename base_type::const_e_access_traits_pointer 283 typedef typename base_type::internal_node_pointer internal_node_pointer; 308 pat_trie_node_it_(node_pointer p_nd = NULL, const_e_access_traits_pointer p_traits = NULL) : base_type(p_nd, p_traits) 315 _GLIBCXX_DEBUG_ASSERT(base_type::num_children() == 0); 316 return Iterator(base_type::m_p_nd); 324 _GLIBCXX_DEBUG_ASSERT(base_type::m_p_nd->m_type == pat_trie_internal_node_type); 327 static_cast<internal_node_pointer>(base_type::m_p_nd)->begin(); 330 return PB_DS_PAT_TRIE_NODE_ITERATOR_C_DEC(*it, base_type::m_p_traits);
|