| /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_/ |
| info_fn_imps.hpp | 44 is_effectively_black(const node_pointer p_nd)
45 { return (p_nd == NULL || !p_nd->m_red); }
|
| insert_fn_imps.hpp | 62 insert_fixup(node_pointer p_nd)
64 _GLIBCXX_DEBUG_ASSERT(p_nd->m_red == true);
65 while (p_nd != base_type::m_p_head->m_p_parent && p_nd->m_p_parent->m_red)
67 if (p_nd->m_p_parent == p_nd->m_p_parent->m_p_parent->m_p_left)
69 node_pointer p_y = p_nd->m_p_parent->m_p_parent->m_p_right;
72 p_nd->m_p_parent->m_red = false;
74 p_nd->m_p_parent->m_p_parent->m_red = true;
75 p_nd = p_nd->m_p_parent->m_p_parent
[all...] |
| debug_fn_imps.hpp | 46 assert_node_consistent(const node_pointer p_nd) const
48 if (p_nd == NULL)
51 const size_type l_height = assert_node_consistent(p_nd->m_p_left);
52 const size_type r_height = assert_node_consistent(p_nd->m_p_right);
53 if (p_nd->m_red)
55 _GLIBCXX_DEBUG_ASSERT(is_effectively_black(p_nd->m_p_left));
56 _GLIBCXX_DEBUG_ASSERT(is_effectively_black(p_nd->m_p_right));
59 return (p_nd->m_red ? 0 : 1) + l_height;
|
| /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/splay_tree_/ |
| debug_fn_imps.hpp | 56 assert_special_imp(const node_pointer p_nd) const
58 if (p_nd == NULL)
61 if (p_nd == base_type::m_p_head)
63 _GLIBCXX_DEBUG_ASSERT(p_nd->m_special);
64 assert_special_imp(p_nd->m_p_parent);
68 _GLIBCXX_DEBUG_ASSERT(!p_nd->m_special);
69 assert_special_imp(p_nd->m_p_left);
70 assert_special_imp(p_nd->m_p_right);
|
| 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...] |
| splay_fn_imps.hpp | 44 splay(node_pointer p_nd)
46 while (p_nd->m_p_parent != base_type::m_p_head)
55 _GLIBCXX_DEBUG_ONLY(base_type::assert_node_consistent(p_nd);)
57 if (p_nd->m_p_parent->m_p_parent == base_type::m_p_head)
59 base_type::rotate_parent(p_nd);
60 _GLIBCXX_DEBUG_ASSERT(p_nd == this->m_p_head->m_p_parent);
64 const node_pointer p_parent = p_nd->m_p_parent;
73 if (p_parent->m_p_left == p_nd &&
75 splay_zig_zag_left(p_nd, p_parent, p_grandparent);
76 else if (p_parent->m_p_right == p_nd &&
[all...] |
| insert_fn_imps.hpp | 64 node_pointer p_nd = base_type::m_p_head->m_p_parent;
67 while (p_nd != NULL)
68 if (!Cmp_Fn::operator()(PB_DS_V2F(p_nd->m_value), PB_DS_V2F(r_value)))
70 if (!Cmp_Fn::operator()(PB_DS_V2F(r_value), PB_DS_V2F(p_nd->m_value)))
72 return std::make_pair(point_iterator(p_nd), false);
74 p_pot = p_nd;
75 p_nd = p_nd->m_p_left;
78 p_nd = p_nd->m_p_right
[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...] |
| debug_fn_imps.hpp | 69 assert_node_consistent(const_node_pointer p_nd, bool strictly_binomial,
73 base_type::assert_node_consistent(p_nd, false);
74 if (p_nd == NULL)
76 _GLIBCXX_DEBUG_ASSERT(p_nd->m_metadata == base_type::degree(p_nd));
77 _GLIBCXX_DEBUG_ASSERT(base_type::size_under_node(p_nd) ==
78 static_cast<size_type>(1 << p_nd->m_metadata));
79 assert_node_consistent(p_nd->m_p_next_sibling, strictly_binomial, increasing);
80 assert_node_consistent(p_nd->m_p_l_child, true, false);
81 if (p_nd->m_p_next_sibling != 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_/ |
| trace_fn_imps.hpp | 58 trace_node(const_node_pointer p_nd, size_type level)
60 while (p_nd != NULL)
65 std::cerr << p_nd <<
66 " prev = " << p_nd->m_p_prev_or_parent <<
67 " next " << p_nd->m_p_next_sibling <<
68 " left = " << p_nd->m_p_l_child << " ";
70 trace_node_metadata(p_nd, type_to_type<node_metadata>());
72 std::cerr << p_nd->m_value << std::endl;
74 trace_node(p_nd->m_p_l_child, level + 1);
76 p_nd = p_nd->m_p_next_sibling
[all...] |
| 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...] |
| debug_fn_imps.hpp | 59 assert_node_consistent(const_node_pointer p_nd, bool single_link) const
61 if (p_nd == NULL)
64 assert_node_consistent(p_nd->m_p_l_child, false);
65 assert_node_consistent(p_nd->m_p_next_sibling, single_link);
68 _GLIBCXX_DEBUG_ASSERT(p_nd->m_p_prev_or_parent == NULL);
69 else if (p_nd->m_p_next_sibling != NULL)
70 _GLIBCXX_DEBUG_ASSERT(p_nd->m_p_next_sibling->m_p_prev_or_parent == p_nd);
72 if (p_nd->m_p_l_child == NULL)
75 const_node_pointer p_child = p_nd->m_p_l_child
[all...] |
| insert_fn_imps.hpp | 88 make_child_of(node_pointer p_nd, node_pointer p_new_parent)
90 _GLIBCXX_DEBUG_ASSERT(p_nd != NULL);
93 p_nd->m_p_next_sibling = p_new_parent->m_p_l_child;
96 p_new_parent->m_p_l_child->m_p_prev_or_parent = p_nd;
98 p_nd->m_p_prev_or_parent = p_new_parent;
100 p_new_parent->m_p_l_child = p_nd;
106 parent(node_pointer p_nd)
110 node_pointer p_pot = p_nd->m_p_prev_or_parent;
112 if (p_pot == NULL || p_pot->m_p_l_child == p_nd)
115 p_nd = p_pot
[all...] |
| 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...] |
| /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_/ |
| 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...] |
| 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...] |
| /prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/ext/pb_ds/detail/thin_heap_/ |
| debug_fn_imps.hpp | 84 assert_node_consistent(const_node_pointer p_nd, bool root) const
86 base_type::assert_node_consistent(p_nd, root);
87 if (p_nd == NULL)
90 assert_node_consistent(p_nd->m_p_next_sibling, root);
91 assert_node_consistent(p_nd->m_p_l_child, false);
94 if (p_nd->m_metadata == 0)
95 _GLIBCXX_DEBUG_ASSERT(p_nd->m_p_next_sibling == NULL);
97 _GLIBCXX_DEBUG_ASSERT(p_nd->m_metadata == p_nd->m_p_next_sibling->m_metadata + 1);
100 if (p_nd->m_p_l_child != NULL
[all...] |
| 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...] |
| /prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/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);
|
| 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...] |
| update_fn_imps.hpp | 44 apply_update(node_pointer /*p_nd*/, null_node_update_pointer)
51 apply_update(node_pointer p_nd, Node_Update_* /*p_update*/)
53 Node_Update_::operator()(node_iterator(p_nd, this),
|
| 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...] |
| /prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/ext/pb_ds/detail/pairing_heap_/ |
| erase_fn_imps.hpp | 74 remove_node(node_pointer p_nd)
78 node_pointer p_new_child = join_node_children(p_nd);
85 if (p_nd == base_type::m_p_root)
94 _GLIBCXX_DEBUG_ASSERT(p_nd->m_p_prev_or_parent != NULL);
95 if (p_nd->m_p_prev_or_parent->m_p_l_child == p_nd)
99 p_new_child->m_p_prev_or_parent = p_nd->m_p_prev_or_parent;
100 p_new_child->m_p_next_sibling = p_nd->m_p_next_sibling;
103 p_nd->m_p_prev_or_parent->m_p_l_child = p_new_child;
104 _GLIBCXX_DEBUG_ONLY(base_type::assert_node_consistent(p_nd->m_p_prev_or_parent, false);
[all...] |
| insert_fn_imps.hpp | 60 push_imp(node_pointer p_nd)
62 p_nd->m_p_l_child = NULL;
66 p_nd->m_p_next_sibling = p_nd->m_p_prev_or_parent = NULL;
68 base_type::m_p_root = p_nd;
70 else if (Cmp_Fn::operator()(base_type::m_p_root->m_value, p_nd->m_value))
72 p_nd->m_p_next_sibling = p_nd->m_p_prev_or_parent = NULL;
74 base_type::make_child_of(base_type::m_p_root, p_nd);
75 _GLIBCXX_DEBUG_ONLY(base_type::assert_node_consistent(p_nd, false))
[all...] |
