/freebsd-9.3-release/contrib/libstdc++/include/ext/pb_ds/detail/list_update_map_/ |
H A D | trace_fn_imps.hpp | 55 const_entry_pointer p_l = m_p_l; local 56 while (p_l != NULL) 58 std::cerr << PB_DS_V2F(p_l->m_value) << std::endl; 59 p_l = p_l->m_p_next;
|
H A D | insert_fn_imps.hpp | 55 entry_pointer p_l = find_imp(PB_DS_V2F(r_val)); local 57 if (p_l != NULL) 60 return std::make_pair(point_iterator(&p_l->m_value), false); 65 p_l = allocate_new_entry(r_val, traits_base::m_no_throw_copies_indicator); 66 p_l->m_p_next = m_p_l; 67 m_p_l = p_l; 69 return std::make_pair(point_iterator(&p_l->m_value), true); 77 entry_pointer p_l = s_entry_allocator.allocate(1); local 78 cond_dealtor_t cond(p_l); 79 new (const_cast<void* >(static_cast<const void* >(&p_l 93 entry_pointer p_l = s_entry_allocator.allocate(1); local 104 init_entry_metadata(entry_pointer p_l, type_to_type<Metadata>) argument [all...] |
H A D | erase_fn_imps.hpp | 64 entry_pointer p_l = m_p_l; local 65 while (p_l->m_p_next != NULL) 66 if (s_eq_fn(r_key, PB_DS_V2F(p_l->m_p_next->m_value))) 68 erase_next(p_l); 72 p_l = p_l->m_p_next; 103 entry_pointer p_l = m_p_l; 104 while (p_l->m_p_next != NULL) 106 if (pred(p_l->m_p_next->m_value)) 109 erase_next(p_l); 122 erase_next(entry_pointer p_l) argument 135 actual_erase_entry(entry_pointer p_l) argument [all...] |
H A D | find_fn_imps.hpp | 61 entry_pointer p_l = m_p_l; local 62 while (p_l->m_p_next != NULL) 64 entry_pointer p_next = p_l->m_p_next; 69 p_l->m_p_next = p_next->m_p_next; 77 p_l = p_next; 88 apply_update(entry_pointer p_l, type_to_type<Metadata>) argument 89 { return s_update_policy(p_l->m_update_metadata); }
|
H A D | constructor_destructor_fn_imps.hpp | 100 entry_pointer p_l = allocate_new_entry(*it, local 103 p_l->m_p_next = m_p_l; 104 m_p_l = p_l; 133 entry_pointer p_l = m_p_l; local 134 while (p_l != NULL) 136 entry_pointer p_next_l = p_l->m_p_next; 137 actual_erase_entry(p_l); 138 p_l = p_next_l;
|
/freebsd-9.3-release/contrib/libstdc++/include/ext/pb_ds/detail/cc_hash_table_map_/ |
H A D | trace_fn_imps.hpp | 68 trace_list(const_entry_pointer p_l) const 71 while (p_l != NULL) 73 std::cerr << PB_DS_V2F(p_l->m_value) << " "; 74 p_l = p_l->m_p_next;
|
/freebsd-9.3-release/contrib/libstdc++/include/ext/pb_ds/detail/pat_trie_/ |
H A D | insert_join_fn_imps.hpp | 108 rec_join_prep(const_node_pointer p_l, const_node_pointer p_r, split_join_branch_bag& r_bag) argument 110 if (p_l->m_type == pat_trie_leaf_node_type) 114 rec_join_prep(static_cast<const_leaf_pointer>(p_l), 120 rec_join_prep(static_cast<const_leaf_pointer>(p_l), 125 _GLIBCXX_DEBUG_ASSERT(p_l->m_type == pat_trie_internal_node_type); 128 rec_join_prep(static_cast<const_internal_node_pointer>(p_l), 135 rec_join_prep(static_cast<const_internal_node_pointer>(p_l), 142 rec_join_prep(const_leaf_pointer /*p_l*/, const_leaf_pointer /*p_r*/, 149 rec_join_prep(const_leaf_pointer /*p_l*/, const_internal_node_pointer /*p_r*/, 156 rec_join_prep(const_internal_node_pointer /*p_l*/, const_leaf_pointe 163 rec_join_prep(const_internal_node_pointer p_l, const_internal_node_pointer p_r, split_join_branch_bag& r_bag) argument 203 rec_join(node_pointer p_l, node_pointer p_r, size_type checked_ind, split_join_branch_bag& r_bag) argument 252 rec_join(leaf_pointer p_l, leaf_pointer p_r, split_join_branch_bag& r_bag) argument 265 rec_join(leaf_pointer p_l, internal_node_pointer p_r, size_type checked_ind, split_join_branch_bag& r_bag) argument 282 rec_join(internal_node_pointer p_l, leaf_pointer p_r, size_type checked_ind, split_join_branch_bag& r_bag) argument 320 rec_join(internal_node_pointer p_l, internal_node_pointer p_r, split_join_branch_bag& r_bag) argument 438 insert_branch(node_pointer p_l, node_pointer p_r, split_join_branch_bag& r_bag) argument [all...] |
H A D | erase_fn_imps.hpp | 123 actual_erase_leaf(leaf_pointer p_l) argument 127 _GLIBCXX_DEBUG_ONLY(erase_existing(PB_DS_V2F(p_l->value()))); 128 p_l->~leaf(); 129 s_leaf_allocator.deallocate(p_l, 1); 277 erase_leaf(leaf_pointer p_l) argument 279 update_min_max_for_erased_leaf(p_l); 280 if (p_l->m_p_parent->m_type == pat_trie_head_node_type) 288 _GLIBCXX_DEBUG_ASSERT(p_l->m_p_parent->m_type == 292 static_cast<internal_node_pointer>(p_l->m_p_parent); 294 p_parent->remove_child(p_l); 302 update_min_max_for_erased_leaf(leaf_pointer p_l) argument [all...] |
/freebsd-9.3-release/contrib/libstdc++/include/ext/pb_ds/detail/rb_tree_map_/ |
H A D | split_join_fn_imps.hpp | 158 find_join_pos_right(node_pointer p_l, size_type h_l, size_type h_r) argument 168 if (p_l->m_red == false) 174 p_l_parent = p_l; 175 p_l = p_l->m_p_right; 178 if (!is_effectively_black(p_l)) 180 p_l_parent = p_l; 181 p_l = p_l->m_p_right; 184 _GLIBCXX_DEBUG_ASSERT(is_effectively_black(p_l)); 286 node_pointer p_l = p_nd->m_p_left; local [all...] |
/freebsd-9.3-release/contrib/libstdc++/include/ext/pb_ds/detail/splay_tree_/ |
H A D | erase_fn_imps.hpp | 123 node_pointer p_l = p_nd->m_p_left; local 130 base_type::m_p_head->m_p_parent = p_l; 131 if (p_l != NULL) 132 p_l->m_p_parent = base_type::m_p_head; 147 p_target_r->m_p_left = p_l; 148 if (p_l != NULL) 149 p_l->m_p_parent = p_target_r;
|
/freebsd-9.3-release/lib/msun/src/ |
H A D | e_pow.c | 99 double z,ax,z_h,z_l,p_h,p_l; local 246 p_l = v-(p_h-u); 248 z_l = cp_l*p_h+p_l*cp+dp_l[k]; 259 p_l = (y-y1)*t1+y*t2; 261 z = p_l+p_h; 267 if(p_l+ovt>z-p_h) return s*huge*huge; /* overflow */ 273 if(p_l<=z-p_h) return s*tiny*tiny; /* underflow */ 277 * compute 2**(p_h+p_l) 291 t = p_l+p_h; 294 v = (p_l [all...] |
H A D | e_powf.c | 58 float z,ax,z_h,z_l,p_h,p_l; local 191 p_l = v-(p_h-u); 193 z_l = cp_l*p_h+p_l*cp+dp_l[k]; 205 p_l = (y-y1)*t1+y*t2; 207 z = p_l+p_h; 212 if(p_l+ovt>z-p_h) return sn*huge*huge; /* overflow */ 217 if(p_l<=z-p_h) return sn*tiny*tiny; /* underflow */ 220 * compute 2**(p_h+p_l) 233 t = p_l+p_h; 237 v = (p_l [all...] |