Searched defs:__p (Results 1 - 17 of 17) sorted by relevance

/haiku-fatelf/headers/cpp/
H A Dstl_construct.h47 inline void construct(_T1* __p, const _T2& __value) { argument
52 inline void construct(_T1* __p) { argument
H A Dstl_pair.h48 pair(const pair<_U1, _U2>& __p) : first(__p.first), second(__p.second) {} argument
H A Dstl_tempbuf.h74 void return_temporary_buffer(_Tp* __p) { argument
H A Dstl_hash_set.h158 pair<typename _Ht::iterator, bool> __p = _M_ht.insert_unique(__obj); local
174 pair<typename _Ht::iterator, bool> __p = local
H A Dstl_set.h133 pair<typename _Rep_type::iterator, bool> __p = _M_t.insert_unique(__x); local
H A Dstl_alloc.h166 static void deallocate(void* __p, size_t /* __n */) argument
171 static void* reallocate(void* __p, size_t /* old_sz */, size_t __new_sz) argument
211 void* __malloc_alloc_template<__inst>::_S_oom_realloc(void* __p, size_t __n) argument
235 static void deallocate(_Tp* __p, size_t __n) argument
237 static void deallocate(_Tp* __p) argument
264 deallocate(void* __p, size_t __n) argument
271 reallocate(void* __p, size_t __old_sz, size_t __new_sz) argument
431 deallocate(void* __p, size_t __n) argument
498 _Obj* __p; local
563 reallocate(void* __p, size_t __old_sz, size_t __new_sz) argument
764 deallocate(pointer __p, size_type __n) argument
770 construct(pointer __p, const _Tp& __val) argument
771 destroy(pointer __p) argument
842 deallocate(pointer __p, size_type __n) argument
848 construct(pointer __p, const _Tp& __val) argument
849 destroy(pointer __p) argument
[all...]
H A Dstl_function.h527 _Ret operator()(_Tp* __p, _Arg __x) const { return (__p->*_M_f)(__x); } argument
536 _Ret operator()(const _Tp* __p, _Arg __x) const argument
602 operator ()(_Tp* __p, _Arg __x) const argument
612 operator ()(const _Tp* __p, _Arg __x) const argument
[all...]
H A Dstl_hashtable.h214 void _M_put_node(_Node* __p) { _M_node_allocator.deallocate(__p, 1); } argument
223 void _M_put_node(_Node* __p) { _M_node_allocator_type::deallocate(__p, 1); } argument
H A Dstl_list.h145 void _M_put_node(_List_node<_Tp>* __p) argument
169 void _M_put_node(_List_node<_Tp>* __p) { _Alloc_type::deallocate(__p, 1); } argument
223 void _M_put_node(_List_node<_Tp>* __p) { _Alloc_type::deallocate(__p, 1); } argument
291 _Node* __p = _M_get_node(); local
301 _Node* __p = _M_get_node(); local
[all...]
H A Dstl_vector.h69 void _M_deallocate(_Tp* __p, size_t __n) argument
94 void _M_deallocate(_Tp* __p, size_t __n) argument
H A Dropeimpl.h275 const _CharT* __p = __s; local
772 _Rope_find_char_char_consumer(_CharT __p) argument
H A Dstl_deque.h293 void _M_deallocate_node(_Tp* __p) { argument
298 void _M_deallocate_map(_Tp** __p, size_t __n) argument
322 void _M_deallocate_node(_Tp* __p) argument
327 void _M_deallocate_map(_Tp** __p, size_t __n) argument
407 void _M_deallocate_node(_Tp* __p) argument
412 _M_deallocate_map(_Tp** __p, size_t __n) argument
[all...]
H A Dstl_slist.h195 void _M_put_node(_Slist_node<_Tp>* __p) argument
218 void _M_put_node(_Slist_node<_Tp>* __p) { _Alloc_type::deallocate(__p, 1); } argument
265 void _M_put_node(_Slist_node<_Tp>* __p) { _Alloc_type::deallocate(__p, 1); } argument
H A Dstl_tree.h455 void _M_put_node(_Rb_tree_node<_Tp>* __p) argument
476 void _M_put_node(_Rb_tree_node<_Tp>* __p) argument
515 void _M_put_node(_Rb_tree_node<_Tp>* __p) argument
571 void destroy_node(_Link_type __p) argument
1042 pair<iterator,iterator> __p = equal_range(__x); local
1052 _M_copy(_Link_type __x, _Link_type __p) argument
1156 pair<const_iterator, const_iterator> __p = equal_range(__k); local
[all...]
H A Dstl_algo.h785 _RandomAccessIter __p = __first; local
[all...]
H A Dstl_rope.h737 _Rope_self_destruct_ptr(_Rope_RopeRep<_CharT,_Alloc>* __p) : _M_ptr(__p) {} argument
768 _Rope_char_ref_proxy(_My_rope* __r, size_t __p) : argument
776 _Rope_char_ref_proxy(_My_rope* __r, size_t __p, _CharT __c) argument
1291 _S_atomic_swap(_Cstrptr* __p, _Cstrptr __q) argument
1301 _S_atomic_swap(_Cstrptr* __p, _Cstrptr __q) argument
1310 _S_atomic_swap(_Cstrptr* __p, _Cstrptr __q) argument
1318 _S_atomic_swap(_Cstrptr* __p, _Cstrptr __q) argument
1974 insert(size_t __p, const rope& __r) argument
1984 insert(size_t __p, size_t __n, _CharT __c) argument
1989 insert(size_t __p, const _CharT* __i, size_t __n) argument
1999 insert(size_t __p, const _CharT* __c_string) argument
2003 insert(size_t __p, _CharT __c) argument
2007 insert(size_t __p) argument
2012 insert(size_t __p, const _CharT* __i, const _CharT* __j) argument
2017 insert(size_t __p, const const_iterator& __i, const const_iterator& __j) argument
2023 insert(size_t __p, const iterator& __i, const iterator& __j) argument
2031 replace(size_t __p, size_t __n, const rope& __r) argument
2038 replace(size_t __p, size_t __n, const _CharT* __i, size_t __i_len) argument
2044 replace(size_t __p, size_t __n, _CharT __c) argument
2049 replace(size_t __p, size_t __n, const _CharT* __c_string) argument
2054 replace(size_t __p, size_t __n, const _CharT* __i, const _CharT* __j) argument
2060 replace(size_t __p, size_t __n, const const_iterator& __i, const const_iterator& __j) argument
2066 replace(size_t __p, size_t __n, const iterator& __i, const iterator& __j) argument
2073 replace(size_t __p, _CharT __c) argument
2078 replace(size_t __p, const rope& __r) argument
2082 replace(size_t __p, const _CharT* __i, size_t __i_len) argument
2086 replace(size_t __p, const _CharT* __c_string) argument
2090 replace(size_t __p, const _CharT* __i, const _CharT* __j) argument
2094 replace(size_t __p, const const_iterator& __i, const const_iterator& __j) argument
2099 replace(size_t __p, const iterator& __i, const iterator& __j) argument
2105 erase(size_t __p, size_t __n) argument
2112 erase(size_t __p) argument
2117 insert(const iterator& __p, const rope& __r) argument
2119 insert(const iterator& __p, size_t __n, _CharT __c) argument
2121 insert(const iterator& __p, _CharT __c) argument
2125 insert(const iterator& __p, const _CharT* c_string) argument
2127 insert(const iterator& __p, const _CharT* __i, size_t __n) argument
2129 insert(const iterator& __p, const _CharT* __i, const _CharT* __j) argument
2132 insert(const iterator& __p, const const_iterator& __i, const const_iterator& __j) argument
2135 insert(const iterator& __p, const iterator& __i, const iterator& __j) argument
2140 replace(const iterator& __p, const iterator& __q, const rope& __r) argument
2143 replace(const iterator& __p, const iterator& __q, _CharT __c) argument
2145 replace(const iterator& __p, const iterator& __q, const _CharT* __c_string) argument
2148 replace(const iterator& __p, const iterator& __q, const _CharT* __i, size_t __n) argument
2151 replace(const iterator& __p, const iterator& __q, const _CharT* __i, const _CharT* __j) argument
2154 replace(const iterator& __p, const iterator& __q, const const_iterator& __i, const const_iterator& __j) argument
2157 replace(const iterator& __p, const iterator& __q, const iterator& __i, const iterator& __j) argument
2162 replace(const iterator& __p, const rope& __r) argument
2164 replace(const iterator& __p, _CharT __c) argument
2166 replace(const iterator& __p, const _CharT* __c_string) argument
2168 replace(const iterator& __p, const _CharT* __i, size_t __n) argument
2170 replace(const iterator& __p, const _CharT* __i, const _CharT* __j) argument
2172 replace(const iterator& __p, const_iterator __i, const_iterator __j) argument
2175 replace(const iterator& __p, iterator __i, iterator __j) argument
2179 erase(const iterator& __p, const iterator& __q) argument
2184 erase(const iterator& __p) argument
[all...]
/haiku-fatelf/headers/cpp/std/
H A Dvalarray_array.h168 _Array<_Tp>::_Array (_Tp* const __restrict__ __p) : _M_data (__p) {} argument
[all...]

Completed in 89 milliseconds