/freebsd-9.3-release/contrib/libstdc++/include/ext/pb_ds/detail/pairing_heap_/ |
H A D | debug_fn_imps.hpp | 54 _GLIBCXX_DEBUG_ASSERT(base_type::m_p_root == NULL 55 || base_type::m_p_root->m_p_next_sibling == NULL); 56 base_type::assert_valid();
|
H A D | find_fn_imps.hpp | 53 _GLIBCXX_DEBUG_ASSERT(!base_type::empty()); 55 return base_type::m_p_root->m_value;
|
H A D | split_join_fn_imps.hpp | 58 if (base_type::empty()) 66 base_type::to_linked_list(); 68 node_pointer p_out = base_type::prune(pred); 72 _GLIBCXX_DEBUG_ASSERT(base_type::m_size > 0); 73 --base_type::m_size; 88 node_pointer p_cur = base_type::m_p_root; 90 base_type::m_p_root = NULL; 123 if (base_type::m_p_root == NULL) 124 base_type::m_p_root = other.m_p_root; 125 else if (Cmp_Fn::operator()(base_type [all...] |
H A D | insert_fn_imps.hpp | 54 node_pointer p_new_nd = base_type::get_new_node_for_insert(r_val); 70 if (base_type::m_p_root == 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)) 80 base_type::make_child_of(base_type::m_p_root, p_nd); 81 _GLIBCXX_DEBUG_ONLY(base_type::assert_node_consistent(p_nd, false)); 83 base_type::m_p_root = p_nd; 87 base_type::make_child_of(p_nd, base_type [all...] |
/freebsd-9.3-release/contrib/libstdc++/include/ext/pb_ds/detail/left_child_next_sibling_heap_/ |
H A D | const_iterator.hpp | 73 typedef PB_DS_BASE_C_DEC base_type; typedef in class:pb_ds::detail::left_child_next_sibling_heap_const_iterator_ 84 typedef typename base_type::value_type value_type; 87 typedef typename base_type::pointer pointer; 90 typedef typename base_type::const_pointer const_pointer; 93 typedef typename base_type::reference reference; 96 typedef typename base_type::const_reference const_reference; 101 left_child_next_sibling_heap_const_iterator_(node_pointer p_nd) : base_type(p_nd) 111 left_child_next_sibling_heap_const_iterator_(const PB_DS_CLASS_C_DEC& other) : base_type(other) 117 { return (base_type::m_p_nd == other.m_p_nd); } 122 { return (base_type [all...] |
/freebsd-9.3-release/contrib/libstdc++/include/ext/pb_ds/detail/binomial_heap_/ |
H A D | debug_fn_imps.hpp | 53 { base_type::assert_valid(true); }
|
H A D | binomial_heap_.hpp | 79 typedef PB_DS_BASE_C_DEC base_type; typedef in class:pb_ds::detail::binomial_heap_ 80 typedef typename base_type::node_pointer node_pointer; 81 typedef typename base_type::const_node_pointer const_node_pointer; 87 typedef typename base_type::pointer pointer; 88 typedef typename base_type::const_pointer const_pointer; 89 typedef typename base_type::reference reference; 90 typedef typename base_type::const_reference const_reference; 91 typedef typename base_type::const_point_iterator const_point_iterator; 92 typedef typename base_type::point_iterator point_iterator; 93 typedef typename base_type [all...] |
/freebsd-9.3-release/contrib/libstdc++/include/ext/pb_ds/detail/rc_binomial_heap_/ |
H A D | trace_fn_imps.hpp | 54 base_type::trace();
|
H A D | insert_fn_imps.hpp | 58 node_pointer p_nd = base_type::get_new_node_for_insert(r_val); 63 if (base_type::m_p_max == NULL || Cmp_Fn::operator()(base_type::m_p_max->m_value, r_val)) 64 base_type::m_p_max = p_nd; 66 p_nd->m_p_next_sibling = base_type::m_p_root; 68 if (base_type::m_p_root != NULL) 69 base_type::m_p_root->m_p_prev_or_parent = p_nd; 71 base_type::m_p_root = p_nd; 90 base_type::modify(it, r_new_val); 92 base_type [all...] |
H A D | split_join_fn_imps.hpp | 59 base_type::split(pred, other); 61 base_type::find_max(); 79 base_type::join(other); 81 base_type::find_max();
|
H A D | erase_fn_imps.hpp | 53 _GLIBCXX_DEBUG_ASSERT(!base_type::empty()); 54 base_type::pop(); 55 base_type::find_max(); 63 base_type::clear(); 72 node_pointer p_nd = base_type::m_p_root; 98 const size_type ersd = base_type::erase_if(pred); 99 base_type::find_max(); 110 base_type::erase(it); 111 base_type::find_max();
|
/freebsd-9.3-release/contrib/libstdc++/include/ext/pb_ds/detail/binary_heap_/ |
H A D | const_iterator.hpp | 76 typedef PB_DS_BASE_C_DEC base_type; typedef in class:pb_ds::detail::binary_heap_const_iterator_ 87 typedef typename base_type::value_type value_type; 90 typedef typename base_type::pointer pointer; 93 typedef typename base_type::const_pointer const_pointer; 96 typedef typename base_type::reference reference; 99 typedef typename base_type::const_reference const_reference; 104 binary_heap_const_iterator_(entry_pointer p_e) : base_type(p_e) 114 binary_heap_const_iterator_(const PB_DS_CLASS_C_DEC& other) : base_type(other) 121 return base_type::m_p_e == other.m_p_e; 128 return base_type [all...] |
/freebsd-9.3-release/contrib/libstdc++/include/ext/pb_ds/detail/list_update_policy/ |
H A D | counter_lu_policy_imp.hpp | 51 { return (base_type::operator()(max_count)); } 57 { return (base_type::operator()(r_data, max_count)); }
|
/freebsd-9.3-release/contrib/libstdc++/include/ext/pb_ds/detail/binomial_heap_base_/ |
H A D | erase_fn_imps.hpp | 53 _GLIBCXX_DEBUG_ASSERT(!base_type::empty()); 64 base_type::actual_erase_node(p_nd); 77 _GLIBCXX_DEBUG_ASSERT(base_type::parent(p_nd) == NULL); 79 node_pointer p_cur_root = p_nd == base_type::m_p_root? 81 base_type::m_p_root; 104 base_type::m_p_root = join(p_cur_root, p_child); 112 base_type::clear(); 123 _GLIBCXX_DEBUG_ASSERT(!base_type::empty()); 125 base_type::bubble_to_top(it.m_p_nd); 129 base_type [all...] |
H A D | insert_fn_imps.hpp | 54 node_pointer p_nd = base_type::get_new_node_for_insert(r_val); 70 if (base_type::m_p_root == NULL) 77 base_type::m_p_root = p_nd; 82 if (base_type::m_p_root->m_metadata > 0) 86 p_nd->m_p_next_sibling = base_type::m_p_root; 88 base_type::m_p_root->m_p_prev_or_parent = p_nd; 90 base_type::m_p_root = p_nd; 97 if (Cmp_Fn::operator()(base_type::m_p_root->m_value, p_nd->m_value)) 99 p_nd->m_p_next_sibling = base_type::m_p_root->m_p_next_sibling; 105 p_nd->m_p_l_child = base_type [all...] |
H A D | debug_fn_imps.hpp | 54 base_type::assert_valid(); 55 assert_node_consistent(base_type::m_p_root, strictly_binomial, true); 66 _GLIBCXX_DEBUG_ASSERT(base_type::parent(m_p_max) == NULL); 67 for (const_iterator it = base_type::begin(); it != base_type::end(); ++it) 77 base_type::assert_node_consistent(p_nd, false); 80 _GLIBCXX_DEBUG_ASSERT(p_nd->m_metadata == base_type::degree(p_nd)); 81 _GLIBCXX_DEBUG_ASSERT(base_type::size_under_node(p_nd) ==
|
/freebsd-9.3-release/contrib/libstdc++/include/ext/pb_ds/detail/pat_trie_/ |
H A D | synth_e_access_traits.hpp | 71 typedef E_Access_Traits base_type; typedef in struct:pb_ds::detail::synth_e_access_traits 85 equal_prefixes(typename base_type::const_iterator b_l, typename base_type::const_iterator e_l, typename base_type::const_iterator b_r, typename base_type::const_iterator e_r, bool compare_after = true) const; 91 cmp_prefixes(typename base_type::const_iterator b_l, typename base_type::const_iterator e_l, typename base_type::const_iterator b_r, typename base_type::const_iterator e_r, bool compare_after = false) const; 133 equal_prefixes(typename base_type [all...] |
/freebsd-9.3-release/contrib/libstdc++/include/ext/pb_ds/detail/unordered_iterator/ |
H A D | iterator.hpp | 106 _GLIBCXX_DEBUG_ASSERT(base_type::m_p_value != NULL); 108 return (const_cast<pointer>(base_type::m_p_value)); 115 _GLIBCXX_DEBUG_ASSERT(base_type::m_p_value != NULL); 117 return (const_cast<reference>(*base_type::m_p_value)); 124 base_type::m_p_tbl->inc_it_state(base_type::m_p_value, base_type::m_pos); 135 base_type::m_p_tbl->inc_it_state(base_type::m_p_value, base_type 141 typedef const_iterator_ base_type; typedef in class:iterator_ [all...] |
/freebsd-9.3-release/contrib/libstdc++/include/ext/pb_ds/detail/rb_tree_map_/ |
H A D | split_join_fn_imps.hpp | 54 _GLIBCXX_DEBUG_ONLY(other.base_type::assert_valid();) 55 if (base_type::join_prep(other) == false) 64 base_type::join_finish(other); 66 _GLIBCXX_DEBUG_ONLY(base_type::assert_valid();) 68 _GLIBCXX_DEBUG_ONLY(other.base_type::assert_valid();) 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 [all...] |
H A D | constructors_destructor_fn_imps.hpp | 68 base_type(r_cmp_fn) 77 base_type(r_cmp_fn, r_node_update) 86 base_type(other) 98 base_type::swap(other); 106 { base_type::m_p_head->m_red = true; }
|
/freebsd-9.3-release/contrib/libstdc++/include/ext/pb_ds/detail/splay_tree_/ |
H A D | insert_fn_imps.hpp | 66 _GLIBCXX_DEBUG_ONLY(base_type::structure_only_assert_valid();) 67 if (base_type::m_size == 0) 68 return std::make_pair(base_type::insert_imp_empty(r_value), true); 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); 89 _GLIBCXX_DEBUG_ONLY(base_type::check_key_does_not_exist(PB_DS_V2F(r_value))); 93 return (std::make_pair(base_type [all...] |
H A D | debug_fn_imps.hpp | 54 base_type::assert_valid(); 55 const node_pointer p_head = base_type::m_p_head; 67 if (p_nd == base_type::m_p_head)
|
/freebsd-9.3-release/contrib/libstdc++/include/ext/pb_ds/detail/ov_tree_map_/ |
H A D | node_iterators.hpp | 219 typedef PB_DS_OV_TREE_CONST_NODE_ITERATOR_C_DEC base_type; typedef in class:pb_ds::detail::ov_tree_node_it_ 221 typedef typename base_type::pointer pointer; 223 typedef typename base_type::const_pointer const_pointer; 226 typename base_type::const_metadata_pointer 254 ov_tree_node_it_(const_pointer p_nd = NULL, const_pointer p_begin_nd = NULL, const_pointer p_end_nd = NULL, const_metadata_pointer p_metadata = NULL) : base_type( p_nd, p_begin_nd, p_end_nd, p_metadata) 260 { return reference(base_type::m_p_value); } 266 if (base_type::m_p_begin_value == base_type::m_p_value) 267 return (this_type(base_type::m_p_begin_value, base_type [all...] |
/freebsd-9.3-release/contrib/libstdc++/include/ext/pb_ds/ |
H A D | priority_queue.hpp | 65 typedef typename detail::priority_queue_base_dispatch<Value_Type,Cmp_Fn,Tag,Allocator>::type base_type; typedef in class:pb_ds::priority_queue 81 typedef typename base_type::const_point_iterator const_point_iterator; 82 typedef typename base_type::point_iterator point_iterator; 83 typedef typename base_type::const_iterator const_iterator; 84 typedef typename base_type::iterator iterator; 90 priority_queue(const cmp_fn& r_cmp_fn) : base_type(r_cmp_fn) { } 97 { base_type::copy_from_range(first_it, last_it); } 105 : base_type(r_cmp_fn) 106 { base_type::copy_from_range(first_it, last_it); } 109 : base_type((cons [all...] |
/freebsd-9.3-release/contrib/libstdc++/include/ext/pb_ds/detail/thin_heap_/ |
H A D | split_join_fn_imps.hpp | 58 if (base_type::empty()) 66 base_type::to_linked_list(); 68 node_pointer p_out = base_type::prune(pred); 72 _GLIBCXX_DEBUG_ASSERT(base_type::m_size > 0); 73 --base_type::m_size; 86 node_pointer p_cur = base_type::m_p_root; 90 base_type::m_p_root = NULL; 124 base_type::m_size += other.m_size;
|