| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/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 != 0)
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 == 0)
91 node_pointer p_next = p_nd->m_p_next_sibling
[all...] |
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/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 != 0)
50 if (Cmp_Fn::operator()(PB_DS_V2F(p_nd->m_value), r_key))
51 p_nd = p_nd->m_p_right;
54 p_pot = p_nd;
55 p_nd = p_nd->m_p_left;
66 node_pointer p_nd = m_p_head->m_p_parent; local
68 while (p_nd != 0
85 node_pointer p_nd = m_p_head->m_p_parent; local
104 node_pointer p_nd = m_p_head->m_p_parent; local
124 node_pointer p_nd = m_p_head->m_p_parent; local
152 node_pointer p_nd = m_p_head->m_p_parent; local
[all...] |
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/ext/pb_ds/detail/pat_trie_/ |
| debug_fn_imps.hpp | 90 node_const_pointer p_nd = local
92 PB_DS_DEBUG_VERIFY(p_nd == it.m_p_nd);
100 recursive_count_leafs(node_const_pointer p_nd, const char* __file, int __line)
102 if (p_nd == 0)
104 if (p_nd->m_type == leaf_node)
106 PB_DS_DEBUG_VERIFY(p_nd->m_type == i_node);
108 for (typename inode::const_iterator it = static_cast<inode_const_pointer>(p_nd)->begin();
109 it != static_cast<inode_const_pointer>(p_nd)->end();
|
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/ext/pb_ds/detail/rc_binomial_heap_/ |
| debug_fn_imps.hpp | 64 node_const_pointer p_nd = next_2_pointer(base_type::m_p_root); local
68 while (p_nd != 0)
70 PB_DS_DEBUG_VERIFY(*it == p_nd);
71 node_const_pointer p_next = p_nd->m_p_next_sibling;
73 PB_DS_DEBUG_VERIFY(p_nd->m_metadata == p_next->m_metadata);
78 p_nd = next_2_pointer(next_after_0_pointer(p_nd));
86 next_2_pointer(node_const_pointer p_nd)
88 if (p_nd == 0)
91 node_pointer p_next = p_nd->m_p_next_sibling
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.6/include/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 == 0)
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();
|
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.6/include/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 != 0)
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 == 0)
91 node_pointer p_next = p_nd->m_p_next_sibling
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.7/include/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 != 0)
50 if (Cmp_Fn::operator()(PB_DS_V2F(p_nd->m_value), r_key))
51 p_nd = p_nd->m_p_right;
54 p_pot = p_nd;
55 p_nd = p_nd->m_p_left;
66 node_pointer p_nd = m_p_head->m_p_parent; local
68 while (p_nd != 0
85 node_pointer p_nd = m_p_head->m_p_parent; local
104 node_pointer p_nd = m_p_head->m_p_parent; local
124 node_pointer p_nd = m_p_head->m_p_parent; local
152 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/pat_trie_/ |
| debug_fn_imps.hpp | 90 node_const_pointer p_nd = local
92 PB_DS_DEBUG_VERIFY(p_nd == it.m_p_nd);
100 recursive_count_leafs(node_const_pointer p_nd, const char* __file, int __line)
102 if (p_nd == 0)
104 if (p_nd->m_type == leaf_node)
106 PB_DS_DEBUG_VERIFY(p_nd->m_type == i_node);
108 for (typename inode::const_iterator it = static_cast<inode_const_pointer>(p_nd)->begin();
109 it != static_cast<inode_const_pointer>(p_nd)->end();
|
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.7/include/ext/pb_ds/detail/rc_binomial_heap_/ |
| debug_fn_imps.hpp | 64 node_const_pointer p_nd = next_2_pointer(base_type::m_p_root); local
68 while (p_nd != 0)
70 PB_DS_DEBUG_VERIFY(*it == p_nd);
71 node_const_pointer p_next = p_nd->m_p_next_sibling;
73 PB_DS_DEBUG_VERIFY(p_nd->m_metadata == p_next->m_metadata);
78 p_nd = next_2_pointer(next_after_0_pointer(p_nd));
86 next_2_pointer(node_const_pointer p_nd)
88 if (p_nd == 0)
91 node_pointer p_next = p_nd->m_p_next_sibling
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/include/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 != 0)
50 if (Cmp_Fn::operator()(PB_DS_V2F(p_nd->m_value), r_key))
51 p_nd = p_nd->m_p_right;
54 p_pot = p_nd;
55 p_nd = p_nd->m_p_left;
66 node_pointer p_nd = m_p_head->m_p_parent; local
68 while (p_nd != 0
85 node_pointer p_nd = m_p_head->m_p_parent; local
104 node_pointer p_nd = m_p_head->m_p_parent; local
124 node_pointer p_nd = m_p_head->m_p_parent; local
152 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/pat_trie_/ |
| debug_fn_imps.hpp | 90 node_const_pointer p_nd = local
92 PB_DS_DEBUG_VERIFY(p_nd == it.m_p_nd);
100 recursive_count_leafs(node_const_pointer p_nd, const char* __file, int __line)
102 if (p_nd == 0)
104 if (p_nd->m_type == leaf_node)
106 PB_DS_DEBUG_VERIFY(p_nd->m_type == i_node);
108 for (typename inode::const_iterator it = static_cast<inode_const_pointer>(p_nd)->begin();
109 it != static_cast<inode_const_pointer>(p_nd)->end();
|
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/include/ext/pb_ds/detail/rc_binomial_heap_/ |
| debug_fn_imps.hpp | 64 node_const_pointer p_nd = next_2_pointer(base_type::m_p_root); local
68 while (p_nd != 0)
70 PB_DS_DEBUG_VERIFY(*it == p_nd);
71 node_const_pointer p_next = p_nd->m_p_next_sibling;
73 PB_DS_DEBUG_VERIFY(p_nd->m_metadata == p_next->m_metadata);
78 p_nd = next_2_pointer(next_after_0_pointer(p_nd));
86 next_2_pointer(node_const_pointer p_nd)
88 if (p_nd == 0)
91 node_pointer p_next = p_nd->m_p_next_sibling
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.9/include/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 != 0)
50 if (Cmp_Fn::operator()(PB_DS_V2F(p_nd->m_value), r_key))
51 p_nd = p_nd->m_p_right;
54 p_pot = p_nd;
55 p_nd = p_nd->m_p_left;
66 node_pointer p_nd = m_p_head->m_p_parent; local
68 while (p_nd != 0
85 node_pointer p_nd = m_p_head->m_p_parent; local
104 node_pointer p_nd = m_p_head->m_p_parent; local
124 node_pointer p_nd = m_p_head->m_p_parent; local
152 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/pat_trie_/ |
| debug_fn_imps.hpp | 90 node_const_pointer p_nd = local
92 PB_DS_DEBUG_VERIFY(p_nd == it.m_p_nd);
100 recursive_count_leafs(node_const_pointer p_nd, const char* __file, int __line)
102 if (p_nd == 0)
104 if (p_nd->m_type == leaf_node)
106 PB_DS_DEBUG_VERIFY(p_nd->m_type == i_node);
108 for (typename inode::const_iterator it = static_cast<inode_const_pointer>(p_nd)->begin();
109 it != static_cast<inode_const_pointer>(p_nd)->end();
|
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.9/include/ext/pb_ds/detail/rc_binomial_heap_/ |
| debug_fn_imps.hpp | 64 node_const_pointer p_nd = next_2_pointer(base_type::m_p_root); local
68 while (p_nd != 0)
70 PB_DS_DEBUG_VERIFY(*it == p_nd);
71 node_const_pointer p_next = p_nd->m_p_next_sibling;
73 PB_DS_DEBUG_VERIFY(p_nd->m_metadata == p_next->m_metadata);
78 p_nd = next_2_pointer(next_after_0_pointer(p_nd));
86 next_2_pointer(node_const_pointer p_nd)
88 if (p_nd == 0)
91 node_pointer p_next = p_nd->m_p_next_sibling
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.6/x86_64-linux/include/c++/4.6/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 = 0;
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 = 0
175 node_pointer p_nd = it.m_p_nd; 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_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...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.6/x86_64-linux/include/c++/4.6/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 != 0)
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 = 0;
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 != 0&& p_nd->m_p_next_sibling->m_metadata == 0
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/binomial_heap_base_/ |
| insert_fn_imps.hpp | 47 node_pointer p_nd = base_type::get_new_node_for_insert(r_val); local
48 insert_node(p_nd);
51 return point_iterator(p_nd);
57 insert_node(node_pointer p_nd)
61 p_nd->m_p_next_sibling = 0;
62 p_nd->m_p_prev_or_parent = 0;
63 p_nd->m_p_l_child = 0;
64 p_nd->m_metadata = 0;
65 base_type::m_p_root = p_nd;
71 p_nd->m_p_prev_or_parent = p_nd->m_p_l_child = 0
147 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/pat_trie_/ |
| trace_fn_imps.hpp | 58 trace_node(node_const_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 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)
79 inode_const_pointer p_internal = static_cast<inode_const_pointer>(p_nd);
99 trace_node_metadata(node_const_pointer p_nd, type_to_type<Metadata_>)
101 std::cerr << "(" << static_cast<unsigned long>(p_nd->get_metadata()) << ") "
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/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 != 0)
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 = 0;
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 != 0&& p_nd->m_p_next_sibling->m_metadata == 0
[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/binomial_heap_base_/ |
| insert_fn_imps.hpp | 47 node_pointer p_nd = base_type::get_new_node_for_insert(r_val); local
48 insert_node(p_nd);
51 return point_iterator(p_nd);
57 insert_node(node_pointer p_nd)
61 p_nd->m_p_next_sibling = 0;
62 p_nd->m_p_prev_or_parent = 0;
63 p_nd->m_p_l_child = 0;
64 p_nd->m_metadata = 0;
65 base_type::m_p_root = p_nd;
71 p_nd->m_p_prev_or_parent = p_nd->m_p_l_child = 0
147 node_pointer p_nd = it.m_p_nd; local
[all...] |
