| /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_/ |
| iterators_fn_imps.hpp | 46 node_pointer p_nd = m_p_root; local
48 if (p_nd == NULL)
51 while (p_nd->m_p_l_child != NULL)
52 p_nd = p_nd->m_p_l_child;
54 return (iterator(p_nd));
62 node_pointer p_nd = m_p_root; local
64 if (p_nd == NULL)
67 while (p_nd->m_p_l_child != NULL)
68 p_nd = p_nd->m_p_l_child
[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_/ |
| find_fn_imps.hpp | 69 node_pointer p_nd = base_type::m_p_head->m_p_parent; local
70 while (p_nd != NULL)
71 if (!Cmp_Fn::operator()(PB_DS_V2F(p_nd->m_value), r_key))
73 if (!Cmp_Fn::operator()(r_key, PB_DS_V2F(p_nd->m_value)))
74 return p_nd;
75 p_nd = p_nd->m_p_left;
78 p_nd = p_nd->m_p_right;
88 node_pointer p_nd = base_type::m_p_head->m_p_parent local
[all...] |
| /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_/ |
| find_fn_imps.hpp | 47 node_pointer p_nd = m_p_head->m_p_parent; local
49 while (p_nd != NULL)
51 PB_DS_V2F(p_nd->m_value),
53 p_nd = p_nd->m_p_right;
56 p_pot = p_nd;
58 p_nd = p_nd->m_p_left;
70 node_pointer p_nd = m_p_head->m_p_parent; local
72 while (p_nd != NULL
93 node_pointer p_nd = m_p_head->m_p_parent; local
115 node_pointer p_nd = m_p_head->m_p_parent; local
139 node_pointer p_nd = m_p_head->m_p_parent; local
165 node_pointer p_nd = m_p_head->m_p_parent; local
[all...] |
| /prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/ext/pb_ds/detail/pat_trie_/ |
| 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();
|
| split_join_branch_bag.hpp | 56 internal_node_pointer p_nd = s_internal_node_allocator.allocate(1); local
59 m_bag.push_back(p_nd);
63 s_internal_node_allocator.deallocate(p_nd, 1);
72 internal_node_pointer p_nd =* m_bag.begin(); local
74 return p_nd;
81 internal_node_pointer p_nd =* m_bag.begin(); local
82 s_internal_node_allocator.deallocate(p_nd, 1);
|
| trace_fn_imps.hpp | 58 trace_node(const_node_pointer p_nd, size_type level)
62 std::cerr << p_nd << " "; local
63 std::cerr << ((p_nd->m_type == pat_trie_leaf_node_type) ? "l " : "i ");
65 trace_node_metadata(p_nd, type_to_type<typename node::metadata_type>());
66 typename e_access_traits::const_iterator el_it = pref_begin(p_nd);
67 while (el_it != pref_end(p_nd))
73 if (p_nd->m_type == pat_trie_leaf_node_type)
80 static_cast<const_internal_node_pointer>(p_nd);
101 trace_node_metadata(const_node_pointer p_nd, type_to_type<Metadata_>)
103 std::cerr << "(" << static_cast<unsigned long>(p_nd->get_metadata()) << ") "
[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...] |
| find_fn_imps.hpp | 47 node_pointer p_nd = find_imp(r_key); local
49 if (p_nd == NULL || p_nd->m_type != pat_trie_leaf_node_type)
55 if (synth_e_access_traits::equal_keys(PB_DS_V2F(static_cast<leaf_pointer>(p_nd)->value()), r_key))
58 return iterator(p_nd);
72 const_node_pointer p_nd = const_cast<PB_DS_CLASS_C_DEC* >(this)->find_imp(r_key); local
74 if (p_nd == NULL || p_nd->m_type != pat_trie_leaf_node_type)
80 if (synth_e_access_traits::equal_keys(PB_DS_V2F(static_cast<const_leaf_pointer>(p_nd)->value()), r_key))
83 return const_iterator(const_cast<node_pointer>(p_nd));
103 node_pointer p_nd = m_p_head->m_p_parent; local
[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_/ |
| debug_fn_imps.hpp | 64 const_node_pointer p_nd = next_2_pointer(base_type::m_p_root); local
68 while (p_nd != NULL)
70 _GLIBCXX_DEBUG_ASSERT(*it == p_nd);
71 const_node_pointer p_next = p_nd->m_p_next_sibling;
73 _GLIBCXX_DEBUG_ASSERT(p_nd->m_metadata == p_next->m_metadata);
78 p_nd = next_2_pointer(next_after_0_pointer(p_nd));
86 next_2_pointer(const_node_pointer p_nd)
88 if (p_nd == NULL)
91 node_pointer p_next = p_nd->m_p_next_sibling
[all...] |
| 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;
|
| insert_fn_imps.hpp | 52 node_pointer p_nd = base_type::get_new_node_for_insert(r_val); local
54 p_nd->m_p_l_child = p_nd->m_p_prev_or_parent = NULL;
55 p_nd->m_metadata = 0;
58 base_type::m_p_max = p_nd;
60 p_nd->m_p_next_sibling = base_type::m_p_root;
63 base_type::m_p_root->m_p_prev_or_parent = p_nd;
65 base_type::m_p_root = p_nd;
67 if (p_nd->m_p_next_sibling != NULL&& p_nd->m_p_next_sibling->m_metadata == 0
[all...] |
| /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_/ |
| insert_fn_imps.hpp | 48 node_pointer p_nd = base_type::get_new_node_for_insert(r_val); local
50 insert_node(p_nd);
56 return point_iterator(p_nd);
62 insert_node(node_pointer p_nd)
66 p_nd->m_p_next_sibling = p_nd->m_p_prev_or_parent =
67 p_nd->m_p_l_child = NULL;
69 p_nd->m_metadata = 0;
71 base_type::m_p_root = p_nd;
78 p_nd->m_p_prev_or_parent = p_nd->m_p_l_child = NULL
175 node_pointer p_nd = it.m_p_nd; local
[all...] |
| 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/thin_heap_/ |
| insert_fn_imps.hpp | 48 node_pointer p_nd = base_type::get_new_node_for_insert(r_val); local
50 p_nd->m_metadata = 0;
52 p_nd->m_p_prev_or_parent = p_nd->m_p_l_child = NULL;
56 p_nd->m_p_next_sibling = NULL;
58 m_p_max = base_type::m_p_root = p_nd;
62 return point_iterator(p_nd);
65 p_nd->m_p_next_sibling = base_type::m_p_root;
69 base_type::m_p_root = p_nd;
71 update_max(p_nd);
270 node_pointer p_nd = it.m_p_nd; local
[all...] |
| 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...] |
| /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...] |
