| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/ext/pb_ds/detail/pat_trie_/ |
| find_fn_imps.hpp | 47 node_pointer p_nd = find_imp(r_key); local
49 if (p_nd == 0 || p_nd->m_type != leaf_node)
55 if (synth_access_traits::equal_keys(PB_DS_V2F(static_cast<leaf_pointer>(p_nd)->value()), r_key))
58 return iterator(p_nd);
72 node_const_pointer p_nd = const_cast<PB_DS_CLASS_C_DEC* >(this)->find_imp(r_key); local
74 if (p_nd == 0 || p_nd->m_type != leaf_node)
80 if (synth_access_traits::equal_keys(PB_DS_V2F(static_cast<leaf_const_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...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.6/include/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 != 0);
71 _GLIBCXX_DEBUG_ASSERT(base_type::parent(p_nd) == 0);
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 != 0)
81 p_nd->m_p_prev_or_parent->m_p_next_sibling = p_nd->m_p_next_sibling
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.6/include/ext/pb_ds/detail/pat_trie_/ |
| erase_fn_imps.hpp | 46 node_pointer p_nd = find_imp(r_key); local
47 if (p_nd == 0 || 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 == 0 || 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 == 0 || 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...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.7/include/ext/pb_ds/detail/binomial_heap_base_/ |
| erase_fn_imps.hpp | 53 node_pointer p_nd = m_p_max; local
55 base_type::actual_erase_node(p_nd);
63 remove_parentless_node(node_pointer p_nd)
65 _GLIBCXX_DEBUG_ASSERT(p_nd != 0);
66 _GLIBCXX_DEBUG_ASSERT(base_type::parent(p_nd) == 0);
68 node_pointer p_cur_root = p_nd == base_type::m_p_root?
69 p_nd->m_p_next_sibling : base_type::m_p_root;
74 if (p_nd->m_p_prev_or_parent != 0)
75 p_nd->m_p_prev_or_parent->m_p_next_sibling = p_nd->m_p_next_sibling
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.7/include/ext/pb_ds/detail/pat_trie_/ |
| erase_fn_imps.hpp | 46 node_pointer p_nd = find_imp(r_key); local
47 if (p_nd == 0 || p_nd->m_type == i_node)
53 _GLIBCXX_DEBUG_ASSERT(p_nd->m_type == leaf_node);
54 if (!synth_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(inode_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 == 0 || p_nd->m_type != leaf_node)
55 if (synth_access_traits::equal_keys(PB_DS_V2F(static_cast<leaf_pointer>(p_nd)->value()), r_key))
58 return iterator(p_nd);
72 node_const_pointer p_nd = const_cast<PB_DS_CLASS_C_DEC* >(this)->find_imp(r_key); local
74 if (p_nd == 0 || p_nd->m_type != leaf_node)
80 if (synth_access_traits::equal_keys(PB_DS_V2F(static_cast<leaf_const_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...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/include/ext/pb_ds/detail/binomial_heap_base_/ |
| erase_fn_imps.hpp | 53 node_pointer p_nd = m_p_max; local
55 base_type::actual_erase_node(p_nd);
63 remove_parentless_node(node_pointer p_nd)
65 _GLIBCXX_DEBUG_ASSERT(p_nd != 0);
66 _GLIBCXX_DEBUG_ASSERT(base_type::parent(p_nd) == 0);
68 node_pointer p_cur_root = p_nd == base_type::m_p_root?
69 p_nd->m_p_next_sibling : base_type::m_p_root;
74 if (p_nd->m_p_prev_or_parent != 0)
75 p_nd->m_p_prev_or_parent->m_p_next_sibling = p_nd->m_p_next_sibling
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/include/ext/pb_ds/detail/pat_trie_/ |
| erase_fn_imps.hpp | 46 node_pointer p_nd = find_imp(r_key); local
47 if (p_nd == 0 || p_nd->m_type == i_node)
53 _GLIBCXX_DEBUG_ASSERT(p_nd->m_type == leaf_node);
54 if (!synth_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(inode_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 == 0 || p_nd->m_type != leaf_node)
55 if (synth_access_traits::equal_keys(PB_DS_V2F(static_cast<leaf_pointer>(p_nd)->value()), r_key))
58 return iterator(p_nd);
72 node_const_pointer p_nd = const_cast<PB_DS_CLASS_C_DEC* >(this)->find_imp(r_key); local
74 if (p_nd == 0 || p_nd->m_type != leaf_node)
80 if (synth_access_traits::equal_keys(PB_DS_V2F(static_cast<leaf_const_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...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.9/include/ext/pb_ds/detail/binomial_heap_base_/ |
| erase_fn_imps.hpp | 53 node_pointer p_nd = m_p_max; local
55 base_type::actual_erase_node(p_nd);
63 remove_parentless_node(node_pointer p_nd)
65 _GLIBCXX_DEBUG_ASSERT(p_nd != 0);
66 _GLIBCXX_DEBUG_ASSERT(base_type::parent(p_nd) == 0);
68 node_pointer p_cur_root = p_nd == base_type::m_p_root?
69 p_nd->m_p_next_sibling : base_type::m_p_root;
74 if (p_nd->m_p_prev_or_parent != 0)
75 p_nd->m_p_prev_or_parent->m_p_next_sibling = p_nd->m_p_next_sibling
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.9/include/ext/pb_ds/detail/pat_trie_/ |
| erase_fn_imps.hpp | 46 node_pointer p_nd = find_imp(r_key); local
47 if (p_nd == 0 || p_nd->m_type == i_node)
53 _GLIBCXX_DEBUG_ASSERT(p_nd->m_type == leaf_node);
54 if (!synth_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(inode_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 == 0 || p_nd->m_type != leaf_node)
55 if (synth_access_traits::equal_keys(PB_DS_V2F(static_cast<leaf_pointer>(p_nd)->value()), r_key))
58 return iterator(p_nd);
72 node_const_pointer p_nd = const_cast<PB_DS_CLASS_C_DEC* >(this)->find_imp(r_key); local
74 if (p_nd == 0 || p_nd->m_type != leaf_node)
80 if (synth_access_traits::equal_keys(PB_DS_V2F(static_cast<leaf_const_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...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.6/x86_64-linux/include/c++/4.6/ext/pb_ds/detail/pat_trie_/ |
| 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...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.6/x86_64-linux/include/c++/4.6/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 = 0;
56 p_nd->m_p_next_sibling = 0;
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...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/thin_heap_/ |
| insert_fn_imps.hpp | 47 node_pointer p_nd = base_type::get_new_node_for_insert(r_val); local
48 p_nd->m_metadata = 0;
49 p_nd->m_p_prev_or_parent = p_nd->m_p_l_child = 0;
52 p_nd->m_p_next_sibling = 0;
53 m_p_max = base_type::m_p_root = p_nd;
55 return point_iterator(p_nd);
58 p_nd->m_p_next_sibling = base_type::m_p_root;
60 base_type::m_p_root = p_nd;
61 update_max(p_nd);
235 node_pointer p_nd = it.m_p_nd; local
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/ext/pb_ds/detail/thin_heap_/ |
| insert_fn_imps.hpp | 47 node_pointer p_nd = base_type::get_new_node_for_insert(r_val); local
48 p_nd->m_metadata = 0;
49 p_nd->m_p_prev_or_parent = p_nd->m_p_l_child = 0;
52 p_nd->m_p_next_sibling = 0;
53 m_p_max = base_type::m_p_root = p_nd;
55 return point_iterator(p_nd);
58 p_nd->m_p_next_sibling = base_type::m_p_root;
60 base_type::m_p_root = p_nd;
61 update_max(p_nd);
235 node_pointer p_nd = it.m_p_nd; local
[all...] |
| /prebuilts/ndk/5/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/detail/pat_trie_/ |
| 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...] |
| /prebuilts/ndk/5/sources/cxx-stl/gnu-libstdc++/include/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...] |
| /prebuilts/ndk/6/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/detail/pat_trie_/ |
| 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...] |
| /prebuilts/ndk/6/sources/cxx-stl/gnu-libstdc++/include/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...] |
| /prebuilts/ndk/7/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/detail/pat_trie_/ |
| 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...] |
| /prebuilts/ndk/7/sources/cxx-stl/gnu-libstdc++/include/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...] |
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.4.3/include/ext/pb_ds/detail/pat_trie_/ |
| 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...] |
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.4.3/include/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...] |
