/macosx-10.10.1/libstdcxx-104.1/include/c++/4.2.1/ext/pb_ds/detail/rb_tree_map_/ |
H A D | info_fn_imps.hpp | 50 is_effectively_black(const node_pointer p_nd) argument 51 { return (p_nd == NULL || !p_nd->m_red); }
|
H A D | insert_fn_imps.hpp | 68 insert_fixup(node_pointer p_nd) argument 70 _GLIBCXX_DEBUG_ASSERT(p_nd->m_red == true); 71 while (p_nd != base_type::m_p_head->m_p_parent && p_nd->m_p_parent->m_red) 73 if (p_nd->m_p_parent == p_nd->m_p_parent->m_p_parent->m_p_left) 75 node_pointer p_y = p_nd->m_p_parent->m_p_parent->m_p_right; 78 p_nd->m_p_parent->m_red = false; 80 p_nd->m_p_parent->m_p_parent->m_red = true; 81 p_nd [all...] |
H A D | debug_fn_imps.hpp | 52 assert_node_consistent(const node_pointer p_nd) const 54 if (p_nd == NULL) 57 const size_type l_height = assert_node_consistent(p_nd->m_p_left); 58 const size_type r_height = assert_node_consistent(p_nd->m_p_right); 59 if (p_nd->m_red) 61 _GLIBCXX_DEBUG_ASSERT(is_effectively_black(p_nd->m_p_left)); 62 _GLIBCXX_DEBUG_ASSERT(is_effectively_black(p_nd->m_p_right)); 65 return (p_nd->m_red ? 0 : 1) + l_height;
|
/macosx-10.10.1/libstdcxx-104.1/include/c++/4.2.1/ext/pb_ds/detail/bin_search_tree_/ |
H A D | find_fn_imps.hpp | 53 node_pointer p_nd = m_p_head->m_p_parent; local 55 while (p_nd != NULL) 57 PB_DS_V2F(p_nd->m_value), 59 p_nd = p_nd->m_p_right; 62 p_pot = p_nd; 64 p_nd = p_nd->m_p_left; 76 node_pointer p_nd = m_p_head->m_p_parent; local 78 while (p_nd ! 99 node_pointer p_nd = m_p_head->m_p_parent; local 121 node_pointer p_nd = m_p_head->m_p_parent; local 145 node_pointer p_nd = m_p_head->m_p_parent; local 171 node_pointer p_nd = m_p_head->m_p_parent; local [all...] |
H A D | cond_dtor_entry_dealtor.hpp | 51 bin_search_tree_cond_dtor_entry_dealtor_(node_pointer p_nd) : m_p_nd(p_nd), argument
|
/macosx-10.10.1/libstdcxx-104.1/include/c++/4.2.1/ext/pb_ds/detail/left_child_next_sibling_heap_/ |
H A D | iterators_fn_imps.hpp | 52 node_pointer p_nd = m_p_root; local 54 if (p_nd == NULL) 57 while (p_nd->m_p_l_child != NULL) 58 p_nd = p_nd->m_p_l_child; 60 return (iterator(p_nd)); 68 node_pointer p_nd = m_p_root; local 70 if (p_nd == NULL) 73 while (p_nd->m_p_l_child != NULL) 74 p_nd [all...] |
H A D | trace_fn_imps.hpp | 64 trace_node(const_node_pointer p_nd, size_type level) argument 66 while (p_nd != NULL) 71 std::cerr << p_nd << 72 " prev = " << p_nd->m_p_prev_or_parent << 73 " next " << p_nd->m_p_next_sibling << 74 " left = " << p_nd->m_p_l_child << " "; 76 trace_node_metadata(p_nd, type_to_type<node_metadata>()); 78 std::cerr << p_nd->m_value << std::endl; 80 trace_node(p_nd->m_p_l_child, level + 1); 82 p_nd 90 trace_node_metadata(const_node_pointer p_nd, type_to_type<Metadata_>) argument [all...] |
H A D | insert_fn_imps.hpp | 94 make_child_of(node_pointer p_nd, node_pointer p_new_parent) argument 96 _GLIBCXX_DEBUG_ASSERT(p_nd != NULL); 99 p_nd->m_p_next_sibling = p_new_parent->m_p_l_child; 102 p_new_parent->m_p_l_child->m_p_prev_or_parent = p_nd; 104 p_nd->m_p_prev_or_parent = p_new_parent; 106 p_new_parent->m_p_l_child = p_nd; 112 parent(node_pointer p_nd) argument 116 node_pointer p_pot = p_nd->m_p_prev_or_parent; 118 if (p_pot == NULL || p_pot->m_p_l_child == p_nd) 121 p_nd 128 swap_with_parent(node_pointer p_nd, node_pointer p_parent) argument [all...] |
H A D | debug_fn_imps.hpp | 65 assert_node_consistent(const_node_pointer p_nd, bool single_link) const argument 67 if (p_nd == NULL) 70 assert_node_consistent(p_nd->m_p_l_child, false); 71 assert_node_consistent(p_nd->m_p_next_sibling, single_link); 74 _GLIBCXX_DEBUG_ASSERT(p_nd->m_p_prev_or_parent == NULL); 75 else if (p_nd->m_p_next_sibling != NULL) 76 _GLIBCXX_DEBUG_ASSERT(p_nd->m_p_next_sibling->m_p_prev_or_parent == p_nd); 78 if (p_nd->m_p_l_child == NULL) 81 const_node_pointer p_child = p_nd 115 size_under_node(const_node_pointer p_nd) argument 121 size_from_node(const_node_pointer p_nd) argument 135 degree(const_node_pointer p_nd) argument [all...] |
/macosx-10.10.1/libstdcxx-104.1/include/c++/4.2.1/ext/pb_ds/detail/splay_tree_/ |
H A D | debug_fn_imps.hpp | 62 assert_special_imp(const node_pointer p_nd) const 64 if (p_nd == NULL) 67 if (p_nd == base_type::m_p_head) 69 _GLIBCXX_DEBUG_ASSERT(p_nd->m_special); 70 assert_special_imp(p_nd->m_p_parent); 74 _GLIBCXX_DEBUG_ASSERT(!p_nd->m_special); 75 assert_special_imp(p_nd->m_p_left); 76 assert_special_imp(p_nd->m_p_right);
|
H A D | find_fn_imps.hpp | 75 node_pointer p_nd = base_type::m_p_head->m_p_parent; local 76 while (p_nd != NULL) 77 if (!Cmp_Fn::operator()(PB_DS_V2F(p_nd->m_value), r_key)) 79 if (!Cmp_Fn::operator()(r_key, PB_DS_V2F(p_nd->m_value))) 80 return p_nd; 81 p_nd = p_nd->m_p_left; 84 p_nd = p_nd->m_p_right; 94 node_pointer p_nd local [all...] |
H A D | splay_fn_imps.hpp | 50 splay(node_pointer p_nd) argument 52 while (p_nd->m_p_parent != base_type::m_p_head) 61 _GLIBCXX_DEBUG_ONLY(base_type::assert_node_consistent(p_nd);) 63 if (p_nd->m_p_parent->m_p_parent == base_type::m_p_head) 65 base_type::rotate_parent(p_nd); 66 _GLIBCXX_DEBUG_ASSERT(p_nd == this->m_p_head->m_p_parent); 70 const node_pointer p_parent = p_nd->m_p_parent; 79 if (p_parent->m_p_left == p_nd && 81 splay_zig_zag_left(p_nd, p_parent, p_grandparent); 82 else if (p_parent->m_p_right == p_nd 100 splay_zig_zag_left(node_pointer p_nd, node_pointer p_parent, node_pointer p_grandparent) argument 136 splay_zig_zag_right(node_pointer p_nd, node_pointer p_parent, node_pointer p_grandparent) argument 172 splay_zig_zig_left(node_pointer p_nd, node_pointer p_parent, node_pointer p_grandparent) argument 208 splay_zig_zig_right(node_pointer p_nd, node_pointer p_parent, node_pointer p_grandparent) argument 243 splay_zz_start(node_pointer p_nd, node_pointer p_parent, node_pointer p_grandparent) argument 277 splay_zz_end(node_pointer p_nd, node_pointer p_parent, node_pointer p_grandparent) argument [all...] |
H A D | insert_fn_imps.hpp | 70 node_pointer p_nd = base_type::m_p_head->m_p_parent; 73 while (p_nd != NULL) 74 if (!Cmp_Fn::operator()(PB_DS_V2F(p_nd->m_value), PB_DS_V2F(r_value))) 76 if (!Cmp_Fn::operator()(PB_DS_V2F(r_value), PB_DS_V2F(p_nd->m_value))) 78 return std::make_pair(point_iterator(p_nd), false); 80 p_pot = p_nd; 81 p_nd = p_nd->m_p_left; 84 p_nd = p_nd [all...] |
/macosx-10.10.1/libstdcxx-104.1/include/c++/4.2.1/ext/pb_ds/detail/binomial_heap_base_/ |
H A D | insert_fn_imps.hpp | 54 node_pointer p_nd = base_type::get_new_node_for_insert(r_val); local 56 insert_node(p_nd); 62 return point_iterator(p_nd); 68 insert_node(node_pointer p_nd) argument 72 p_nd->m_p_next_sibling = p_nd->m_p_prev_or_parent = 73 p_nd->m_p_l_child = NULL; 75 p_nd->m_metadata = 0; 77 base_type::m_p_root = p_nd; 84 p_nd 181 node_pointer p_nd = it.m_p_nd; local [all...] |
H A D | debug_fn_imps.hpp | 74 assert_node_consistent(const_node_pointer p_nd, bool strictly_binomial, bool increasing) const argument 77 base_type::assert_node_consistent(p_nd, false); 78 if (p_nd == NULL) 80 _GLIBCXX_DEBUG_ASSERT(p_nd->m_metadata == base_type::degree(p_nd)); 81 _GLIBCXX_DEBUG_ASSERT(base_type::size_under_node(p_nd) == 82 static_cast<size_type>(1 << p_nd->m_metadata)); 83 assert_node_consistent(p_nd->m_p_next_sibling, strictly_binomial, increasing); 84 assert_node_consistent(p_nd->m_p_l_child, true, false); 85 if (p_nd [all...] |
/macosx-10.10.1/libstdcxx-104.1/include/c++/4.2.1/ext/pb_ds/detail/rc_binomial_heap_/ |
H A D | insert_fn_imps.hpp | 58 node_pointer p_nd = base_type::get_new_node_for_insert(r_val); local 60 p_nd->m_p_l_child = p_nd->m_p_prev_or_parent = NULL; 61 p_nd->m_metadata = 0; 64 base_type::m_p_max = p_nd; 66 p_nd->m_p_next_sibling = base_type::m_p_root; 69 base_type::m_p_root->m_p_prev_or_parent = p_nd; 71 base_type::m_p_root = p_nd; 73 if (p_nd->m_p_next_sibling != NULL&& p_nd 100 link_with_next_sibling(node_pointer p_nd) argument [all...] |
H A D | debug_fn_imps.hpp | 70 const_node_pointer p_nd = next_2_pointer(base_type::m_p_root); local 74 while (p_nd != NULL) 76 _GLIBCXX_DEBUG_ASSERT(*it == p_nd); 77 const_node_pointer p_next = p_nd->m_p_next_sibling; 79 _GLIBCXX_DEBUG_ASSERT(p_nd->m_metadata == p_next->m_metadata); 84 p_nd = next_2_pointer(next_after_0_pointer(p_nd)); 92 next_2_pointer(const_node_pointer p_nd) argument 94 if (p_nd == NULL) 97 node_pointer p_next = p_nd 111 next_after_0_pointer(const_node_pointer p_nd) argument [all...] |
/macosx-10.10.1/libstdcxx-104.1/include/c++/4.2.1/ext/pb_ds/detail/thin_heap_/ |
H A D | debug_fn_imps.hpp | 90 assert_node_consistent(const_node_pointer p_nd, bool root) const argument 92 base_type::assert_node_consistent(p_nd, root); 93 if (p_nd == NULL) 96 assert_node_consistent(p_nd->m_p_next_sibling, root); 97 assert_node_consistent(p_nd->m_p_l_child, false); 100 if (p_nd->m_metadata == 0) 101 _GLIBCXX_DEBUG_ASSERT(p_nd->m_p_next_sibling == NULL); 103 _GLIBCXX_DEBUG_ASSERT(p_nd->m_metadata == p_nd->m_p_next_sibling->m_metadata + 1); 106 if (p_nd [all...] |
H A D | insert_fn_imps.hpp | 54 node_pointer p_nd = base_type::get_new_node_for_insert(r_val); local 56 p_nd->m_metadata = 0; 58 p_nd->m_p_prev_or_parent = p_nd->m_p_l_child = NULL; 62 p_nd->m_p_next_sibling = NULL; 64 m_p_max = base_type::m_p_root = p_nd; 68 return point_iterator(p_nd); 71 p_nd->m_p_next_sibling = base_type::m_p_root; 75 base_type::m_p_root = p_nd; 77 update_max(p_nd); 87 make_root(node_pointer p_nd) argument 98 make_root_and_link(node_pointer p_nd) argument 276 node_pointer p_nd = it.m_p_nd; local 327 update_max(node_pointer p_nd) argument [all...] |
/macosx-10.10.1/libstdcxx-104.1/include/c++/4.2.1/ext/pb_ds/detail/pat_trie_/ |
H A D | split_join_branch_bag.hpp | 62 internal_node_pointer p_nd = s_internal_node_allocator.allocate(1); local 65 m_bag.push_back(p_nd); 69 s_internal_node_allocator.deallocate(p_nd, 1); 78 internal_node_pointer p_nd =* m_bag.begin(); local 80 return p_nd; 87 internal_node_pointer p_nd =* m_bag.begin(); local 88 s_internal_node_allocator.deallocate(p_nd, 1);
|
H A D | find_fn_imps.hpp | 53 node_pointer p_nd = find_imp(r_key); local 55 if (p_nd == NULL || p_nd->m_type != pat_trie_leaf_node_type) 61 if (synth_e_access_traits::equal_keys(PB_DS_V2F(static_cast<leaf_pointer>(p_nd)->value()), r_key)) 64 return iterator(p_nd); 78 const_node_pointer p_nd = const_cast<PB_DS_CLASS_C_DEC* >(this)->find_imp(r_key); local 80 if (p_nd == NULL || p_nd->m_type != pat_trie_leaf_node_type) 86 if (synth_e_access_traits::equal_keys(PB_DS_V2F(static_cast<const_leaf_pointer>(p_nd)->value()), r_key)) 89 return const_iterator(const_cast<node_pointer>(p_nd)); 109 node_pointer p_nd = m_p_head->m_p_parent; local 215 pref_begin(const_node_pointer p_nd) argument 227 pref_end(const_node_pointer p_nd) argument 239 leftmost_descendant(const_node_pointer p_nd) argument 249 leftmost_descendant(node_pointer p_nd) argument 259 rightmost_descendant(const_node_pointer p_nd) argument 269 rightmost_descendant(node_pointer p_nd) argument [all...] |
H A D | update_fn_imps.hpp | 50 apply_update(node_pointer /*p_nd*/, null_node_update_pointer) 57 apply_update(node_pointer p_nd, Node_Update_* /*p_update*/) argument 59 Node_Update_::operator()(node_iterator(p_nd, this),
|
H A D | trace_fn_imps.hpp | 64 trace_node(const_node_pointer p_nd, size_type level) argument 68 std::cerr << p_nd << " "; local 69 std::cerr << ((p_nd->m_type == pat_trie_leaf_node_type) ? "l " : "i "); 71 trace_node_metadata(p_nd, type_to_type<typename node::metadata_type>()); 72 typename e_access_traits::const_iterator el_it = pref_begin(p_nd); 73 while (el_it != pref_end(p_nd)) 79 if (p_nd->m_type == pat_trie_leaf_node_type) 86 static_cast<const_internal_node_pointer>(p_nd); 107 trace_node_metadata(const_node_pointer p_nd, type_to_type<Metadata_>) argument 109 std::cerr << "(" << static_cast<unsigned long>(p_nd [all...] |
/macosx-10.10.1/libstdcxx-104.1/include/c++/4.2.1/ext/pb_ds/detail/pairing_heap_/ |
H A D | erase_fn_imps.hpp | 80 remove_node(node_pointer p_nd) argument 84 node_pointer p_new_child = join_node_children(p_nd); 91 if (p_nd == base_type::m_p_root) 100 _GLIBCXX_DEBUG_ASSERT(p_nd->m_p_prev_or_parent != NULL); 101 if (p_nd->m_p_prev_or_parent->m_p_l_child == p_nd) 105 p_new_child->m_p_prev_or_parent = p_nd->m_p_prev_or_parent; 106 p_new_child->m_p_next_sibling = p_nd->m_p_next_sibling; 109 p_nd->m_p_prev_or_parent->m_p_l_child = p_new_child; 110 _GLIBCXX_DEBUG_ONLY(base_type::assert_node_consistent(p_nd 141 join_node_children(node_pointer p_nd) argument 158 forward_join(node_pointer p_nd, node_pointer p_next) argument 187 back_join(node_pointer p_nd, node_pointer p_next) argument [all...] |
H A D | insert_fn_imps.hpp | 66 push_imp(node_pointer p_nd) argument 68 p_nd->m_p_l_child = NULL; 72 p_nd->m_p_next_sibling = p_nd->m_p_prev_or_parent = NULL; 74 base_type::m_p_root = p_nd; 76 else if (Cmp_Fn::operator()(base_type::m_p_root->m_value, p_nd->m_value)) 78 p_nd->m_p_next_sibling = p_nd->m_p_prev_or_parent = NULL; 80 base_type::make_child_of(base_type::m_p_root, p_nd); 81 _GLIBCXX_DEBUG_ONLY(base_type::assert_node_consistent(p_nd, fals [all...] |