| /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_/ |
| 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/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...] |
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/ext/pb_ds/detail/pat_trie_/ |
| 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/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/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 = 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/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/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/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/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/9/sources/cxx-stl/gnu-libstdc++/4.6/include/ext/pb_ds/detail/pat_trie_/ |
| 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/ndk/9/sources/cxx-stl/gnu-libstdc++/4.6/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 = 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/ndk/9/sources/cxx-stl/gnu-libstdc++/4.7/include/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/ndk/9/sources/cxx-stl/gnu-libstdc++/4.7/include/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/9/sources/cxx-stl/gnu-libstdc++/4.8/include/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/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/include/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/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/ext/pb_ds/detail/left_child_next_sibling_heap_/ |
| erase_fn_imps.hpp | 54 actual_erase_node(node_pointer p_nd)
58 p_nd->~node();
59 s_node_allocator.deallocate(p_nd, 1);
65 clear_imp(node_pointer p_nd)
67 while (p_nd != NULL)
69 clear_imp(p_nd->m_p_l_child);
70 node_pointer p_next = p_nd->m_p_next_sibling;
71 actual_erase_node(p_nd);
72 p_nd = p_next;
141 bubble_to_top(node_pointer p_nd)
[all...] |
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/ext/pb_ds/detail/left_child_next_sibling_heap_/ |
| erase_fn_imps.hpp | 54 actual_erase_node(node_pointer p_nd)
58 p_nd->~node();
59 s_node_allocator.deallocate(p_nd, 1);
65 clear_imp(node_pointer p_nd)
67 while (p_nd != 0)
69 clear_imp(p_nd->m_p_l_child);
70 node_pointer p_next = p_nd->m_p_next_sibling;
71 actual_erase_node(p_nd);
72 p_nd = p_next;
141 bubble_to_top(node_pointer p_nd)
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/ext/pb_ds/detail/left_child_next_sibling_heap_/ |
| erase_fn_imps.hpp | 54 actual_erase_node(node_pointer p_nd)
58 p_nd->~node();
59 s_node_allocator.deallocate(p_nd, 1);
65 clear_imp(node_pointer p_nd)
67 while (p_nd != 0)
69 clear_imp(p_nd->m_p_l_child);
70 node_pointer p_next = p_nd->m_p_next_sibling;
71 actual_erase_node(p_nd);
72 p_nd = p_next;
141 bubble_to_top(node_pointer p_nd)
[all...] |
| /prebuilts/ndk/5/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/detail/left_child_next_sibling_heap_/ |
| erase_fn_imps.hpp | 54 actual_erase_node(node_pointer p_nd)
58 p_nd->~node();
59 s_node_allocator.deallocate(p_nd, 1);
65 clear_imp(node_pointer p_nd)
67 while (p_nd != NULL)
69 clear_imp(p_nd->m_p_l_child);
70 node_pointer p_next = p_nd->m_p_next_sibling;
71 actual_erase_node(p_nd);
72 p_nd = p_next;
141 bubble_to_top(node_pointer p_nd)
[all...] |
| /prebuilts/ndk/6/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/detail/left_child_next_sibling_heap_/ |
| erase_fn_imps.hpp | 54 actual_erase_node(node_pointer p_nd)
58 p_nd->~node();
59 s_node_allocator.deallocate(p_nd, 1);
65 clear_imp(node_pointer p_nd)
67 while (p_nd != NULL)
69 clear_imp(p_nd->m_p_l_child);
70 node_pointer p_next = p_nd->m_p_next_sibling;
71 actual_erase_node(p_nd);
72 p_nd = p_next;
141 bubble_to_top(node_pointer p_nd)
[all...] |
| /prebuilts/ndk/7/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/detail/left_child_next_sibling_heap_/ |
| erase_fn_imps.hpp | 54 actual_erase_node(node_pointer p_nd)
58 p_nd->~node();
59 s_node_allocator.deallocate(p_nd, 1);
65 clear_imp(node_pointer p_nd)
67 while (p_nd != NULL)
69 clear_imp(p_nd->m_p_l_child);
70 node_pointer p_next = p_nd->m_p_next_sibling;
71 actual_erase_node(p_nd);
72 p_nd = p_next;
141 bubble_to_top(node_pointer p_nd)
[all...] |
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.4.3/include/ext/pb_ds/detail/left_child_next_sibling_heap_/ |
| erase_fn_imps.hpp | 54 actual_erase_node(node_pointer p_nd)
58 p_nd->~node();
59 s_node_allocator.deallocate(p_nd, 1);
65 clear_imp(node_pointer p_nd)
67 while (p_nd != NULL)
69 clear_imp(p_nd->m_p_l_child);
70 node_pointer p_next = p_nd->m_p_next_sibling;
71 actual_erase_node(p_nd);
72 p_nd = p_next;
141 bubble_to_top(node_pointer p_nd)
[all...] |
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/ext/pb_ds/detail/left_child_next_sibling_heap_/ |
| erase_fn_imps.hpp | 54 actual_erase_node(node_pointer p_nd)
58 p_nd->~node();
59 s_node_allocator.deallocate(p_nd, 1);
65 clear_imp(node_pointer p_nd)
67 while (p_nd != 0)
69 clear_imp(p_nd->m_p_l_child);
70 node_pointer p_next = p_nd->m_p_next_sibling;
71 actual_erase_node(p_nd);
72 p_nd = p_next;
141 bubble_to_top(node_pointer p_nd)
[all...] |
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/ext/pb_ds/detail/left_child_next_sibling_heap_/ |
| erase_fn_imps.hpp | 54 actual_erase_node(node_pointer p_nd)
58 p_nd->~node();
59 s_node_allocator.deallocate(p_nd, 1);
65 clear_imp(node_pointer p_nd)
67 while (p_nd != 0)
69 clear_imp(p_nd->m_p_l_child);
70 node_pointer p_next = p_nd->m_p_next_sibling;
71 actual_erase_node(p_nd);
72 p_nd = p_next;
141 bubble_to_top(node_pointer p_nd)
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.6/include/ext/pb_ds/detail/left_child_next_sibling_heap_/ |
| erase_fn_imps.hpp | 54 actual_erase_node(node_pointer p_nd)
58 p_nd->~node();
59 s_node_allocator.deallocate(p_nd, 1);
65 clear_imp(node_pointer p_nd)
67 while (p_nd != 0)
69 clear_imp(p_nd->m_p_l_child);
70 node_pointer p_next = p_nd->m_p_next_sibling;
71 actual_erase_node(p_nd);
72 p_nd = p_next;
141 bubble_to_top(node_pointer p_nd)
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.7/include/ext/pb_ds/detail/left_child_next_sibling_heap_/ |
| erase_fn_imps.hpp | 54 actual_erase_node(node_pointer p_nd)
58 p_nd->~node();
59 s_node_allocator.deallocate(p_nd, 1);
65 clear_imp(node_pointer p_nd)
67 while (p_nd != 0)
69 clear_imp(p_nd->m_p_l_child);
70 node_pointer p_next = p_nd->m_p_next_sibling;
71 actual_erase_node(p_nd);
72 p_nd = p_next;
141 bubble_to_top(node_pointer p_nd)
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/include/ext/pb_ds/detail/left_child_next_sibling_heap_/ |
| erase_fn_imps.hpp | 54 actual_erase_node(node_pointer p_nd)
58 p_nd->~node();
59 s_node_allocator.deallocate(p_nd, 1);
65 clear_imp(node_pointer p_nd)
67 while (p_nd != 0)
69 clear_imp(p_nd->m_p_l_child);
70 node_pointer p_next = p_nd->m_p_next_sibling;
71 actual_erase_node(p_nd);
72 p_nd = p_next;
141 bubble_to_top(node_pointer p_nd)
[all...] |
