| /prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/ext/pb_ds/detail/bin_search_tree_/ |
| insert_fn_imps.hpp | 53 node_pointer p_nd = m_p_head->m_p_parent;
56 while (p_nd != NULL)
58 PB_DS_V2F(p_nd->m_value),
61 p_pot = p_nd;
63 p_nd = p_nd->m_p_left;
66 p_nd = p_nd->m_p_right;
88 p_nd = p_pot->m_p_left;
89 if (p_nd == NULL
[all...] |
| debug_fn_imps.hpp | 89 assert_node_consistent(const node_pointer p_nd) const
91 assert_node_consistent_(p_nd);
97 assert_node_consistent_(const node_pointer p_nd) const
99 if (p_nd == NULL)
102 assert_node_consistent_with_left(p_nd);
103 assert_node_consistent_with_right(p_nd);
106 l_range = assert_node_consistent_(p_nd->m_p_left);
110 PB_DS_V2F(p_nd->m_value)));
113 r_range = assert_node_consistent_(p_nd->m_p_right);
116 _GLIBCXX_DEBUG_ASSERT(Cmp_Fn::operator()(PB_DS_V2F(p_nd->m_value)
[all...] |
| cond_dtor_entry_dealtor.hpp | 45 bin_search_tree_cond_dtor_entry_dealtor_(node_pointer p_nd) : m_p_nd(p_nd),
|
| cond_key_dtor_entry_dealtor.hpp | 45 bin_seach_tree_cond_key_dtor_entry_dealtor_(node_pointer p_nd) : m_p_nd(p_nd),
|
| rotate_fn_imps.hpp | 106 rotate_parent(node_pointer p_nd)
108 node_pointer p_parent = p_nd->m_p_parent;
110 if (p_nd == p_parent->m_p_left)
115 _GLIBCXX_DEBUG_ASSERT(p_parent->m_p_parent = p_nd);
116 _GLIBCXX_DEBUG_ASSERT(p_nd->m_p_left == p_parent ||
117 p_nd->m_p_right == p_parent);
123 apply_update(node_pointer /*p_nd*/, null_node_update_pointer /*p_update*/)
130 apply_update(node_pointer p_nd, Node_Update_* /*p_update*/)
133 node_iterator(p_nd),
141 update_to_top(node_pointer p_nd, Node_Update_* p_update
[all...] |
| erase_fn_imps.hpp | 107 clear_imp(node_pointer p_nd)
109 if (p_nd == NULL)
112 clear_imp(p_nd->m_p_left);
114 clear_imp(p_nd->m_p_right);
116 p_nd->~node();
118 s_node_allocator.deallocate(p_nd, 1);
|
| r_erase_fn_imps.hpp | 107 clear_imp(node_pointer p_nd)
109 if (p_nd == NULL)
112 clear_imp(p_nd->m_p_left);
114 clear_imp(p_nd->m_p_right);
116 p_nd->~Node();
118 s_node_allocator.deallocate(p_nd, 1);
|
| bin_search_tree_.hpp | 341 insert_leaf_new(const_reference r_value, node_pointer p_nd, bool left_nd);
350 actual_erase_node(node_pointer p_nd);
353 erase(node_pointer p_nd);
356 update_min_max_for_erased_node(node_pointer p_nd);
359 clear_imp(node_pointer p_nd);
373 rotate_parent(node_pointer p_nd);
376 apply_update(node_pointer p_nd, null_node_update_pointer);
380 apply_update(node_pointer p_nd, Node_Update_* p_update);
383 update_to_top(node_pointer p_nd, null_node_update_pointer);
387 update_to_top(node_pointer p_nd, Node_Update_* p_update)
[all...] |
| node_iterators.hpp | 108 bin_search_tree_const_node_it_(const node_pointer p_nd = NULL) : m_p_nd(const_cast<node_pointer>(p_nd))
200 bin_search_tree_node_it_(const node_pointer p_nd = NULL) : PB_DS_TREE_CONST_NODE_ITERATOR_CLASS_C_DEC(
201 const_cast<node_pointer>(p_nd))
|
| /prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/ext/pb_ds/detail/thin_heap_/ |
| erase_fn_imps.hpp | 51 node_pointer p_nd = m_p_max; local
55 base_type::actual_erase_node(p_nd);
116 add_to_aux(node_pointer p_nd)
118 size_type r = p_nd->m_metadata;
122 _GLIBCXX_DEBUG_ASSERT(p_nd->m_metadata < rank_bound());
124 if (Cmp_Fn::operator()(m_a_aux[r]->m_value, p_nd->m_value))
125 make_child_of(m_a_aux[r], p_nd);
128 make_child_of(p_nd, m_a_aux[r]);
130 p_nd = m_a_aux[r];
138 _GLIBCXX_DEBUG_ASSERT(p_nd->m_metadata < rank_bound())
224 node_pointer p_nd = it.m_p_nd; local
[all...] |
| constructors_destructor_fn_imps.hpp | 78 for (node_pointer p_nd = base_type::m_p_root; p_nd != NULL; p_nd = p_nd->m_p_next_sibling)
79 if (Cmp_Fn::operator()(m_p_max->m_value, p_nd->m_value))
80 m_p_max = p_nd;
|
| /prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/ext/pb_ds/detail/pat_trie_/ |
| rotate_fn_imps.hpp | 102 rotate_parent(node_pointer p_nd)
104 node_pointer p_parent = p_nd->m_p_parent;
105 if (p_nd == p_parent->m_p_left)
109 _GLIBCXX_DEBUG_ASSERT(p_parent->m_p_parent = p_nd);
110 _GLIBCXX_DEBUG_ASSERT(p_nd->m_p_left == p_parent || p_nd->m_p_right == p_parent);
116 apply_update(node_pointer /*p_nd*/, __gnu_pbds::null_node_update* /*p_update*/)
123 apply_update(node_pointer p_nd, Node_Update_* p_update)
125 p_update->operator()(& PB_DS_V2F(p_nd->m_value),(p_nd->m_p_left == NULL)
[all...] |
| erase_fn_imps.hpp | 46 node_pointer p_nd = find_imp(r_key); local
47 if (p_nd == NULL || p_nd->m_type == pat_trie_internal_node_type)
53 _GLIBCXX_DEBUG_ASSERT(p_nd->m_type == pat_trie_leaf_node_type);
54 if (!synth_e_access_traits::equal_keys(PB_DS_V2F(reinterpret_cast<leaf_pointer>(p_nd)->value()), r_key))
61 erase_leaf(static_cast<leaf_pointer>(p_nd));
69 erase_fixup(internal_node_pointer p_nd)
71 _GLIBCXX_DEBUG_ASSERT(std::distance(p_nd->begin(), p_nd->end()) >= 1);
72 if (std::distance(p_nd->begin(), p_nd->end()) == 1
[all...] |
| cond_dtor_entry_dealtor.hpp | 45 cond_dealtor(leaf_pointer p_nd) : m_p_nd(p_nd),
|
| debug_fn_imps.hpp | 90 const_node_pointer p_nd = local
92 _GLIBCXX_DEBUG_ASSERT(p_nd == it.m_p_nd);
100 recursive_count_leafs(const_node_pointer p_nd)
102 if (p_nd == NULL)
104 if (p_nd->m_type == pat_trie_leaf_node_type)
106 _GLIBCXX_DEBUG_ASSERT(p_nd->m_type == pat_trie_internal_node_type);
109 static_cast<const_internal_node_pointer>(p_nd)->begin();
110 it != static_cast<const_internal_node_pointer>(p_nd)->end();
|
| r_erase_fn_imps.hpp | 94 clear_imp(node_pointer p_nd)
96 if (p_nd == NULL)
98 clear_imp(p_nd->m_p_left);
99 clear_imp(p_nd->m_p_right);
100 p_nd->~Node();
101 s_node_allocator.deallocate(p_nd, 1);
|
| point_iterators.hpp | 148 pat_trie_const_it_(node_pointer p_nd = NULL) : m_p_nd(p_nd)
292 get_larger_sibling(node_pointer p_nd)
295 static_cast<internal_node_pointer>(p_nd->m_p_parent);
298 while (*it != p_nd)
307 get_smaller_sibling(node_pointer p_nd)
310 static_cast<internal_node_pointer>(p_nd->m_p_parent);
314 if (*it == p_nd)
321 if (*it == p_nd)
331 leftmost_descendant(node_pointer p_nd)
[all...] |
| split_fn_imps.hpp | 117 node_pointer p_nd = it.m_p_nd; local
118 _GLIBCXX_DEBUG_ASSERT(p_nd->m_type == pat_trie_leaf_node_type);
119 leaf_pointer p_ret_l = static_cast<leaf_pointer>(p_nd);
120 while (p_nd->m_type != pat_trie_head_node_type)
123 p_nd = p_nd->m_p_parent;
133 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)
135 if (p_nd->m_type == pat_trie_leaf_node_type)
138 return (p_nd);
141 _GLIBCXX_DEBUG_ASSERT(p_nd->m_type == pat_trie_internal_node_type)
[all...] |
| /prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/ext/pb_ds/detail/rc_binomial_heap_/ |
| erase_fn_imps.hpp | 66 node_pointer p_nd = base_type::m_p_root; local
67 while (p_nd != NULL)
69 node_pointer p_next = p_nd->m_p_next_sibling;
71 p_nd = p_next;
72 else if (p_nd->m_metadata == p_next->m_metadata)
73 p_nd = link_with_next_sibling(p_nd);
74 else if (p_nd->m_metadata < p_next->m_metadata)
75 p_nd = p_next;
|
| /prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/ext/pb_ds/detail/binomial_heap_base_/ |
| erase_fn_imps.hpp | 54 node_pointer p_nd = m_p_max; local
58 base_type::actual_erase_node(p_nd);
68 remove_parentless_node(node_pointer p_nd)
70 _GLIBCXX_DEBUG_ASSERT(p_nd != NULL);
71 _GLIBCXX_DEBUG_ASSERT(base_type::parent(p_nd) == NULL);
73 node_pointer p_cur_root = p_nd == base_type::m_p_root?
74 p_nd->m_p_next_sibling :
80 if (p_nd->m_p_prev_or_parent != NULL)
81 p_nd->m_p_prev_or_parent->m_p_next_sibling = p_nd->m_p_next_sibling
[all...] |
| /prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/ext/pb_ds/detail/splay_tree_/ |
| erase_fn_imps.hpp | 109 erase_node(node_pointer p_nd)
111 _GLIBCXX_DEBUG_ASSERT(p_nd != NULL);
112 splay(p_nd);
115 _GLIBCXX_DEBUG_ASSERT(p_nd == this->m_p_head->m_p_parent);
117 node_pointer p_l = p_nd->m_p_left;
118 node_pointer p_r = p_nd->m_p_right;
120 base_type::update_min_max_for_erased_node(p_nd);
121 base_type::actual_erase_node(p_nd);
151 leftmost(node_pointer p_nd)
153 _GLIBCXX_DEBUG_ASSERT(p_nd != NULL)
[all...] |
| /prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/ext/pb_ds/detail/left_child_next_sibling_heap_/ |
| constructors_destructor_fn_imps.hpp | 112 recursive_copy_node(const_node_pointer p_nd)
114 if (p_nd == NULL)
121 new (p_ret) node(*p_nd);
134 p_ret->m_p_l_child = recursive_copy_node(p_nd->m_p_l_child);
135 p_ret->m_p_next_sibling = recursive_copy_node(p_nd->m_p_next_sibling);
148 p_nd->m_p_next_sibling->m_p_prev_or_parent == p_nd ? p_ret : NULL;
|
| left_child_next_sibling_heap_.hpp | 247 make_child_of(node_pointer p_nd, node_pointer p_new_parent);
253 parent(node_pointer p_nd);
256 swap_with_parent(node_pointer p_nd, node_pointer p_parent);
259 bubble_to_top(node_pointer p_nd);
262 actual_erase_node(node_pointer p_nd);
265 clear_imp(node_pointer p_nd);
279 assert_node_consistent(const_node_pointer p_nd, bool single_link) const;
282 size_under_node(const_node_pointer p_nd);
285 degree(const_node_pointer p_nd);
307 size_from_node(const_node_pointer p_nd);
[all...] |
| const_point_iterator.hpp | 105 left_child_next_sibling_heap_node_const_point_iterator_(node_pointer p_nd) : m_p_nd(p_nd)
|
| /prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/ext/pb_ds/detail/rb_tree_map_/ |
| split_join_fn_imps.hpp | 223 black_height(node_pointer p_nd)
226 while (p_nd != NULL)
228 if (p_nd->m_red == false)
230 p_nd = p_nd->m_p_left;
255 node_pointer p_nd = upper_bound(r_key).m_p_nd; local
258 node_pointer p_next_nd = p_nd->m_p_parent;
259 if (Cmp_Fn::operator()(r_key, PB_DS_V2F(p_nd->m_value)))
260 split_at_node(p_nd, other);
264 p_nd = p_next_nd
[all...] |
