/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/bin_search_tree_/ |
H A D | constructors_destructor_fn_imps.hpp | 53 PB_DS_CLASS_NAME() : m_p_head(s_node_allocator.allocate(1)), m_size(0) 62 Cmp_Fn(r_cmp_fn), m_p_head(s_node_allocator.allocate(1)), m_size(0) 73 m_p_head(s_node_allocator.allocate(1)), 91 m_p_head(s_node_allocator.allocate(1)), 100 m_p_head->m_p_parent = recursive_copy_node(other.m_p_head->m_p_parent); 101 if (m_p_head->m_p_parent != NULL) 102 m_p_head->m_p_parent->m_p_parent = m_p_head; 109 s_node_allocator.deallocate(m_p_head, [all...] |
H A D | iterators_fn_imps.hpp | 52 return (iterator(m_p_head->m_p_left)); 60 return (const_iterator(m_p_head->m_p_left)); 68 return (iterator(m_p_head)); 76 return (const_iterator(m_p_head)); 84 return (const_reverse_iterator(m_p_head->m_p_right)); 92 return (reverse_iterator(m_p_head->m_p_right)); 100 return (reverse_iterator(m_p_head)); 108 return (const_reverse_iterator(m_p_head)); 116 return (const_node_iterator(m_p_head->m_p_parent)); 124 return (node_iterator(m_p_head [all...] |
H A D | find_fn_imps.hpp | 52 node_pointer p_pot = m_p_head; 53 node_pointer p_nd = m_p_head->m_p_parent; 75 node_pointer p_pot = m_p_head; 76 node_pointer p_nd = m_p_head->m_p_parent; 98 node_pointer p_pot = m_p_head; 99 node_pointer p_nd = m_p_head->m_p_parent; 120 node_pointer p_pot = m_p_head; 121 node_pointer p_nd = m_p_head->m_p_parent; 144 node_pointer p_pot = m_p_head; 145 node_pointer p_nd = m_p_head [all...] |
H A D | erase_fn_imps.hpp | 69 m_p_head->m_p_left = m_p_head->m_p_right = m_p_head; 74 if (m_p_head->m_p_left == p_z) 80 m_p_head->m_p_left = it.m_p_nd; 82 else if (m_p_head->m_p_right == p_z) 88 m_p_head->m_p_right = it.m_p_nd; 99 clear_imp(m_p_head->m_p_parent);
|
H A D | r_erase_fn_imps.hpp | 69 m_p_head->m_p_left = m_p_head->m_p_right = m_p_head; 74 if (m_p_head->m_p_left == p_z) 80 m_p_head->m_p_left = it.m_p_nd; 82 else if (m_p_head->m_p_right == p_z) 88 m_p_head->m_p_right = it.m_p_nd; 99 clear_imp(m_p_head->m_p_parent);
|
H A D | debug_fn_imps.hpp | 58 if (m_p_head->m_p_parent == NULL) 73 _GLIBCXX_DEBUG_ASSERT(m_p_head != NULL); 74 if (m_p_head->m_p_parent == NULL) 76 _GLIBCXX_DEBUG_ASSERT(m_p_head->m_p_left == m_p_head); 77 _GLIBCXX_DEBUG_ASSERT(m_p_head->m_p_right == m_p_head); 81 _GLIBCXX_DEBUG_ASSERT(m_p_head->m_p_parent->m_p_parent == m_p_head); 82 _GLIBCXX_DEBUG_ASSERT(m_p_head [all...] |
H A D | insert_fn_imps.hpp | 59 node_pointer p_nd = m_p_head->m_p_parent; 60 node_pointer p_pot = m_p_head; 74 if (p_pot == m_p_head) 76 insert_leaf_new(r_value, m_p_head->m_p_right, false), 125 if (m_p_head->m_p_left == p_nd) 126 m_p_head->m_p_left = p_new_nd; 137 if (m_p_head->m_p_right == p_nd) 138 m_p_head->m_p_right = p_new_nd; 163 m_p_head->m_p_left = m_p_head [all...] |
H A D | split_join_fn_imps.hpp | 63 const bool greater = Cmp_Fn::operator()(PB_DS_V2F(m_p_head->m_p_right->m_value), PB_DS_V2F(other.m_p_head->m_p_left->m_value)); 65 const bool lesser = Cmp_Fn::operator()(PB_DS_V2F(other.m_p_head->m_p_right->m_value), PB_DS_V2F(m_p_head->m_p_left->m_value)); 103 if (Cmp_Fn::operator()(r_key, PB_DS_V2F(m_p_head->m_p_left->m_value))) 111 if (!Cmp_Fn::operator()(r_key, PB_DS_V2F(m_p_head->m_p_right->m_value)))
|
H A D | rotate_fn_imps.hpp | 61 if (p_x == m_p_head->m_p_parent) 62 m_p_head->m_p_parent = p_y; 92 if (p_x == m_p_head->m_p_parent) 93 m_p_head->m_p_parent = p_y; 149 while (p_nd != m_p_head)
|
/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/pat_trie_/ |
H A D | debug_fn_imps.hpp | 54 if (m_p_head->m_p_parent != NULL) 55 m_p_head->m_p_parent->assert_valid(this); 58 if (m_p_head->m_p_parent == NULL) 60 _GLIBCXX_DEBUG_ASSERT(m_p_head->m_p_min == m_p_head); 61 _GLIBCXX_DEBUG_ASSERT(m_p_head->m_p_max == m_p_head); 66 _GLIBCXX_DEBUG_ASSERT(m_p_head->m_p_min->m_type == pat_trie_leaf_node_type); 67 _GLIBCXX_DEBUG_ASSERT(m_p_head->m_p_max->m_type == pat_trie_leaf_node_type);
|
H A D | constructors_destructor_fn_imps.hpp | 62 m_p_head(s_head_allocator.allocate(1)), 73 m_p_head(s_head_allocator.allocate(1)), 88 m_p_head(s_head_allocator.allocate(1)), 94 if (other.m_p_head->m_p_parent == NULL) 101 m_p_head->m_p_parent = recursive_copy_node(other.m_p_head->m_p_parent); 105 s_head_allocator.deallocate(m_p_head, 1); 109 m_p_head->m_p_min = leftmost_descendant(m_p_head->m_p_parent); 110 m_p_head [all...] |
H A D | split_fn_imps.hpp | 66 m_p_head->m_p_parent = rec_split(m_p_head->m_p_parent, 72 m_p_head->m_p_parent->m_p_parent = m_p_head; 74 other.m_p_head->m_p_max = m_p_head->m_p_max; 75 m_p_head->m_p_max = rightmost_descendant(m_p_head->m_p_parent); 76 other.m_p_head->m_p_min = 77 other.leftmost_descendant(other.m_p_head [all...] |
H A D | iterators_fn_imps.hpp | 51 { return iterator(m_p_head->m_p_min); } 57 { return const_iterator(m_p_head->m_p_min); } 63 { return iterator(m_p_head); } 69 { return const_iterator(m_p_head); } 95 { return reverse_iterator(m_p_head); } 101 { return const_reverse_iterator(m_p_head); } 107 { return const_node_iterator(m_p_head->m_p_parent, this); } 113 { return node_iterator(m_p_head->m_p_parent, this); }
|
H A D | r_erase_fn_imps.hpp | 66 m_p_head->m_p_left = m_p_head->m_p_right = m_p_head; 70 if (m_p_head->m_p_left == p_z) 74 m_p_head->m_p_left = it.m_p_nd; 76 else if (m_p_head->m_p_right == p_z) 80 m_p_head->m_p_right = it.m_p_nd; 90 clear_imp(m_p_head->m_p_parent);
|
H A D | insert_join_fn_imps.hpp | 62 m_p_head->m_p_parent = rec_join(m_p_head->m_p_parent, 63 other.m_p_head->m_p_parent, 0, bag); 65 m_p_head->m_p_parent->m_p_parent = m_p_head; 69 m_p_head->m_p_min = leftmost_descendant(m_p_head->m_p_parent); 70 m_p_head->m_p_max = rightmost_descendant(m_p_head->m_p_parent); 91 m_p_head [all...] |
H A D | erase_fn_imps.hpp | 81 if (p_parent == m_p_head) 82 m_p_head->m_p_parent =* p_nd->begin(); 97 if (p_parent == m_p_head) 141 clear_imp(m_p_head->m_p_parent); 217 if (it.m_p_nd == m_p_head) 236 if (it.m_p_nd == m_p_head) 306 m_p_head->m_p_min = m_p_head; 307 m_p_head->m_p_max = m_p_head; [all...] |
H A D | rotate_fn_imps.hpp | 59 if (p_x == m_p_head->m_p_parent) 60 m_p_head->m_p_parent = p_y; 88 if (p_x == m_p_head->m_p_parent) 89 m_p_head->m_p_parent = p_y; 144 while (p_nd != m_p_head)
|
H A D | trace_fn_imps.hpp | 55 if (m_p_head->m_p_parent == NULL) 57 trace_node(m_p_head->m_p_parent, 0);
|
/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/splay_tree_/ |
H A D | split_join_fn_imps.hpp | 61 node_pointer p_target_r = other.leftmost(other.m_p_head); 65 _GLIBCXX_DEBUG_ASSERT(p_target_r == other.m_p_head->m_p_parent); 68 p_target_r->m_p_left = base_type::m_p_head->m_p_parent; 73 base_type::m_p_head->m_p_parent = p_target_r; 74 p_target_r->m_p_parent = base_type::m_p_head; 102 _GLIBCXX_DEBUG_ASSERT(p_upper_bound->m_p_parent == this->m_p_head); 107 base_type::m_p_head->m_p_parent = p_new_root; 108 p_new_root->m_p_parent = base_type::m_p_head; 109 other.m_p_head->m_p_parent = p_upper_bound; 110 p_upper_bound->m_p_parent = other.m_p_head; [all...] |
H A D | debug_fn_imps.hpp | 55 const node_pointer p_head = base_type::m_p_head; 67 if (p_nd == base_type::m_p_head)
|
H A D | find_fn_imps.hpp | 53 if (p_found != base_type::m_p_head) 64 if (p_found != base_type::m_p_head) 75 node_pointer p_nd = base_type::m_p_head->m_p_parent; 85 return base_type::m_p_head; 94 node_pointer p_nd = base_type::m_p_head->m_p_parent; 104 return base_type::m_p_head;
|
H A D | erase_fn_imps.hpp | 80 if (it.m_p_nd == base_type::m_p_head) 121 _GLIBCXX_DEBUG_ASSERT(p_nd == this->m_p_head->m_p_parent); 130 base_type::m_p_head->m_p_parent = p_l; 132 p_l->m_p_parent = base_type::m_p_head; 139 p_r->m_p_parent = base_type::m_p_head; 140 base_type::m_p_head->m_p_parent = p_r; 144 _GLIBCXX_DEBUG_ASSERT(p_target_r->m_p_parent == this->m_p_head); 145 _GLIBCXX_DEBUG_ASSERT(this->m_p_head->m_p_parent == p_target_r);
|
H A D | insert_fn_imps.hpp | 70 node_pointer p_nd = base_type::m_p_head->m_p_parent; 71 node_pointer p_pot = base_type::m_p_head; 86 if (p_pot == base_type::m_p_head) 87 return std::make_pair(base_type::insert_leaf_new(r_value, base_type::m_p_head->m_p_right, false), true);
|
H A D | splay_fn_imps.hpp | 52 while (p_nd->m_p_parent != base_type::m_p_head) 56 node_pointer p_head = base_type::m_p_head; 63 if (p_nd->m_p_parent->m_p_parent == base_type::m_p_head) 66 _GLIBCXX_DEBUG_ASSERT(p_nd == this->m_p_head->m_p_parent); 255 const bool grandparent_head = p_grandparent->m_p_parent == base_type::m_p_head; 259 base_type::m_p_head->m_p_parent = base_type::m_p_head->m_p_parent; 260 p_nd->m_p_parent = base_type::m_p_head; 280 if (p_nd->m_p_parent == base_type::m_p_head) 281 base_type::m_p_head [all...] |
/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/rb_tree_map_/ |
H A D | split_join_fn_imps.hpp | 63 join_imp(p_x, other.m_p_head->m_p_parent); 80 const size_type h = black_height(base_type::m_p_head->m_p_parent); 88 join_pos = find_join_pos_right(base_type::m_p_head->m_p_parent, 95 p_x_l = base_type::m_p_head->m_p_parent; 96 base_type::m_p_head->m_p_parent = p_r; 98 p_r->m_p_parent = base_type::m_p_head; 100 join_pos = find_join_pos_left(base_type::m_p_head->m_p_parent, 106 if (p_parent == base_type::m_p_head) 108 base_type::m_p_head->m_p_parent = p_x; 109 p_x->m_p_parent = base_type::m_p_head; [all...] |