/haiku/src/libs/stdc++/legacy/ |
H A D | valarray.cc | 25 const size_t __n = __l.size(); local
|
/haiku/headers/cpp/std/ |
H A D | valarray_array.h | 47 __valarray_fill (_Tp* __restrict__ __a, size_t __n, const _Tp& __t) argument 53 __valarray_fill (_Tp* __restrict__ __a, size_t __n, argument 60 __valarray_fill(_Tp* __restrict__ __a, const size_t* __restrict__ __i, size_t __n, const _Tp& __t) argument 67 __valarray_copy(const _Tp* __restrict__ __a, size_t __n, _Tp* __restrict__ __b) argument 74 __valarray_copy(const _Tp* __restrict__ __a, size_t __n, size_t __s, _Tp* __restrict__ __b) argument 81 __valarray_copy(const _Tp* __restrict__ __a, _Tp* __restrict__ __b, size_t __n, size_t __s) argument 88 __valarray_copy(const _Tp* __restrict__ __a, const size_t* __restrict__ __i, _Tp* __restrict__ __b, size_t __n) argument 96 __valarray_copy(const _Tp* __restrict__ __a, size_t __n, _Tp* __restrict__ __b, const size_t* __restrict__ __i) argument 121 __valarray_fill(_Array<_Tp> __a, size_t __n, const _Tp& __t) argument 126 __valarray_fill(_Array<_Tp> __a, size_t __n, size_t __s, const _Tp& __t) argument 131 __valarray_fill(_Array<_Tp> __a, _Array<size_t> __i, size_t __n, const _Tp& __t) argument 137 __valarray_copy(_Array<_Tp> __a, size_t __n, _Array<_Tp> __b) argument 142 __valarray_copy(_Array<_Tp> __a, size_t __n, size_t __s, _Array<_Tp> __b) argument 147 __valarray_copy(_Array<_Tp> __a, _Array<_Tp> __b, size_t __n, size_t __s) argument 152 __valarray_copy(_Array<_Tp> __a, _Array<size_t> __i, _Array<_Tp> __b, size_t __n) argument 158 __valarray_copy(_Array<_Tp> __a, size_t __n, _Array<_Tp> __b, _Array<size_t> __i) argument 164 _Array(size_t __n) argument [all...] |
H A D | std_valarray.h | 288 inline valarray<_Tp>::valarray (size_t __n) argument 292 inline valarray<_Tp>::valarray (const _Tp& __t, size_t __n) argument 297 inline valarray<_Tp>::valarray (const _Tp* __restrict__ __pT, size_t __n) argument 528 resize(size_t __n, _Tp __c) argument [all...] |
/haiku/headers/cpp/ |
H A D | stl_numeric.h | 180 _Tp __power(_Tp __x, _Integer __n, _MonoidOperation __oper) argument 203 __power(_Tp __x, _Integer __n) argument 212 power(_Tp __x, _Integer __n, _MonoidOperation __oper) argument 218 power(_Tp __x, _Integer __n) argument [all...] |
H A D | stl_uninitialized.h | 185 __uninitialized_fill_n_aux(_ForwardIter __first, _Size __n, argument 193 __uninitialized_fill_n_aux(_ForwardIter __first, _Size __n, argument 207 __uninitialized_fill_n(_ForwardIter __first, _Size __n, const _Tp& __x, _Tp1*) argument 215 uninitialized_fill_n(_ForwardIter __first, _Size __n, const _Tp& __x) argument
|
H A D | stl_algobase.h | 353 _OutputIter fill_n(_OutputIter __first, _Size __n, const _Tp& __value) { argument
|
H A D | stl_hash_map.h | 83 explicit hash_map(size_type __n) argument 85 hash_map(size_type __n, const hasher& __hf) argument 87 hash_map(size_type __n, const hasher& __hf, const key_equal& __eql, argument 97 hash_map(_InputIterator __f, _InputIterator __l, size_type __n) argument 101 hash_map(_InputIterator __f, _InputIterator __l, size_type __n, argument 106 hash_map(_InputIterator __f, _InputIterator __l, size_type __n, const hasher& __hf, const key_equal& __eql, const allocator_type& __a = allocator_type()) argument 116 hash_map(const value_type* __f, const value_type* __l, size_type __n) argument 119 hash_map(const value_type* __f, const value_type* __l, size_type __n, const hasher& __hf) argument 123 hash_map(const value_type* __f, const value_type* __l, size_type __n, const hasher& __hf, const key_equal& __eql, const allocator_type& __a = allocator_type()) argument 132 hash_map(const_iterator __f, const_iterator __l, size_type __n) argument 135 hash_map(const_iterator __f, const_iterator __l, size_type __n, const hasher& __hf) argument 139 hash_map(const_iterator __f, const_iterator __l, size_type __n, const hasher& __hf, const key_equal& __eql, const allocator_type& __a = allocator_type()) argument 266 hash_multimap(size_type __n) argument 268 hash_multimap(size_type __n, const hasher& __hf) argument 270 hash_multimap(size_type __n, const hasher& __hf, const key_equal& __eql, const allocator_type& __a = allocator_type()) argument 280 hash_multimap(_InputIterator __f, _InputIterator __l, size_type __n) argument 284 hash_multimap(_InputIterator __f, _InputIterator __l, size_type __n, const hasher& __hf) argument 289 hash_multimap(_InputIterator __f, _InputIterator __l, size_type __n, const hasher& __hf, const key_equal& __eql, const allocator_type& __a = allocator_type()) argument 299 hash_multimap(const value_type* __f, const value_type* __l, size_type __n) argument 302 hash_multimap(const value_type* __f, const value_type* __l, size_type __n, const hasher& __hf) argument 306 hash_multimap(const value_type* __f, const value_type* __l, size_type __n, const hasher& __hf, const key_equal& __eql, const allocator_type& __a = allocator_type()) argument 315 hash_multimap(const_iterator __f, const_iterator __l, size_type __n) argument 318 hash_multimap(const_iterator __f, const_iterator __l, size_type __n, const hasher& __hf) argument 322 hash_multimap(const_iterator __f, const_iterator __l, size_type __n, const hasher& __hf, const key_equal& __eql, const allocator_type& __a = allocator_type()) argument [all...] |
H A D | stl_hash_set.h | 81 explicit hash_set(size_type __n) argument 83 hash_set(size_type __n, const hasher& __hf) argument 85 hash_set(size_type __n, const hasher& __hf, const key_equal& __eql, argument 95 hash_set(_InputIterator __f, _InputIterator __l, size_type __n) argument 99 hash_set(_InputIterator __f, _InputIterator __l, size_type __n, argument 104 hash_set(_InputIterator __f, _InputIterator __l, size_type __n, const hasher& __hf, const key_equal& __eql, const allocator_type& __a = allocator_type()) argument 114 hash_set(const value_type* __f, const value_type* __l, size_type __n) argument 117 hash_set(const value_type* __f, const value_type* __l, size_type __n, const hasher& __hf) argument 121 hash_set(const value_type* __f, const value_type* __l, size_type __n, const hasher& __hf, const key_equal& __eql, const allocator_type& __a = allocator_type()) argument 130 hash_set(const_iterator __f, const_iterator __l, size_type __n) argument 133 hash_set(const_iterator __f, const_iterator __l, size_type __n, const hasher& __hf) argument 137 hash_set(const_iterator __f, const_iterator __l, size_type __n, const hasher& __hf, const key_equal& __eql, const allocator_type& __a = allocator_type()) argument 260 hash_multiset(size_type __n) argument 262 hash_multiset(size_type __n, const hasher& __hf) argument 264 hash_multiset(size_type __n, const hasher& __hf, const key_equal& __eql, const allocator_type& __a = allocator_type()) argument 274 hash_multiset(_InputIterator __f, _InputIterator __l, size_type __n) argument 278 hash_multiset(_InputIterator __f, _InputIterator __l, size_type __n, const hasher& __hf) argument 283 hash_multiset(_InputIterator __f, _InputIterator __l, size_type __n, const hasher& __hf, const key_equal& __eql, const allocator_type& __a = allocator_type()) argument 293 hash_multiset(const value_type* __f, const value_type* __l, size_type __n) argument 296 hash_multiset(const value_type* __f, const value_type* __l, size_type __n, const hasher& __hf) argument 300 hash_multiset(const value_type* __f, const value_type* __l, size_type __n, const hasher& __hf, const key_equal& __eql, const allocator_type& __a = allocator_type()) argument 309 hash_multiset(const_iterator __f, const_iterator __l, size_type __n) argument 312 hash_multiset(const_iterator __f, const_iterator __l, size_type __n, const hasher& __hf) argument 316 hash_multiset(const_iterator __f, const_iterator __l, size_type __n, const hasher& __hf, const key_equal& __eql, const allocator_type& __a = allocator_type()) argument [all...] |
H A D | stl_iterator.h | 289 typename iterator_traits<_InputIterator>::difference_type __n = 0; local 314 inline void __advance(_InputIter& __i, _Distance __n, input_iterator_ta argument 262 __distance(_InputIterator __first, _InputIterator __last, _Distance& __n, input_iterator_tag) argument 269 __distance(_RandomAccessIterator __first, _RandomAccessIterator __last, _Distance& __n, random_access_iterator_tag) argument 277 distance(_InputIterator __first, _InputIterator __last, _Distance& __n) argument 323 __advance(_BidirectionalIterator& __i, _Distance __n, bidirectional_iterator_tag) argument 336 __advance(_RandomAccessIterator& __i, _Distance __n, random_access_iterator_tag) argument 342 advance(_InputIterator& __i, _Distance __n) argument 631 operator +=(difference_type __n) argument 638 operator -=(difference_type __n) argument 666 operator +(typename reverse_iterator<_Iterator>::difference_type __n, const reverse_iterator<_Iterator>& __x) argument 723 operator +=(_Distance __n) argument 730 operator -=(_Distance __n) argument 799 operator +(_Dist __n, const reverse_iterator<_RandAccIter, _Tp, _Ref, _Dist>& __x) argument [all...] |
H A D | stl_alloc.h | 159 static void* allocate(size_t __n) argument 196 __malloc_alloc_template<__inst>::_S_oom_malloc(size_t __n) argument 211 void* __malloc_alloc_template<__inst>::_S_oom_realloc(void* __p, size_t __n) argument 231 static _Tp* allocate(size_t __n) argument 235 deallocate(_Tp* __p, size_t __n) argument 257 allocate(size_t __n) argument 264 deallocate(void* __p, size_t __n) argument 405 allocate(size_t __n) argument 431 deallocate(void* __p, size_t __n) argument 532 _S_refill(size_t __n) argument 758 allocate(size_type __n, const void* = 0) argument 764 deallocate(pointer __p, size_type __n) argument 835 allocate(size_type __n, const void* = 0) argument 842 deallocate(pointer __p, size_type __n) argument [all...] |
H A D | stl_bvector.h | 118 difference_type __n = __i + _M_offset; local 205 difference_type __n = __i + _M_offset; local 261 _M_bit_alloc(size_t __n) argument 291 _M_bit_alloc(size_t __n) argument 335 _M_bit_alloc(size_t __n) argument 414 _M_initialize(size_type __n) argument 452 size_type __n = 0; local 473 size_type __n = 0; local 516 operator [](size_type __n) argument 526 __BVECTOR(size_type __n, bool __value, const allocator_type& __a = allocator_type()) argument 534 __BVECTOR(size_type __n) argument 558 _M_initialize_dispatch(_Integer __n, _Integer __x, __true_type) argument 573 size_type __n = 0; local 582 size_type __n = 0; local 607 assign(size_t __n, bool __x) argument 627 _M_assign_dispatch(_Integer __n, _Integer __val, __true_type) argument 663 reserve(size_type __n) argument 689 difference_type __n = __position - begin(); local 707 _M_insert_dispatch(iterator __pos, _Integer __n, _Integer __x, __true_type) argument 763 insert(iterator __position, size_type __n, bool __x) argument [all...] |
H A D | stl_hashtable.h | 91 _Hashtable_iterator(_Node* __n, _Hashtable* __tab) argument 130 _Hashtable_const_iterator(const _Node* __n, const _Hashtable* __tab) argument 159 inline unsigned long __stl_next_prime(unsigned long __n) argument 259 _M_initialize_buckets(__n); variable 273 _M_initialize_buckets(__n); variable 402 size_type __n = 0; local 413 size_type __n = 0; local 423 size_type __n = __l - __f; local 431 size_type __n = __l - __f; local 439 size_type __n = 0; local 448 size_type __n = 0; local 460 size_type __n = _M_bkt_num_key(__key); local 471 size_type __n = _M_bkt_num_key(__key); local 482 const size_type __n = _M_bkt_num_key(__key); local 511 _M_initialize_buckets(size_type __n) argument 541 _Node* __n = _M_get_node(); local 550 _M_delete_node(_Node* __n) argument 702 const size_type __n = _M_bkt_num(__obj); local 721 const size_type __n = _M_bkt_num(__obj); local 746 size_type __n = _M_bkt_num(__obj); local 766 const size_type __n = _M_bkt_num_key(__key); local 789 const size_type __n = _M_bkt_num_key(__key); local 815 const size_type __n = _M_bkt_num_key(__key); local 849 const size_type __n = _M_bkt_num(__p->_M_val); local 922 const size_type __n = _M_next_size(__num_elements_hint); local 957 _M_erase_bucket(const size_type __n, _Node* __first, _Node* __last) argument 979 _M_erase_bucket(const size_type __n, _Node* __last) argument [all...] |
H A D | stl_list.h | 356 void _M_insert_dispatch(iterator __pos, _Integer __n, _Integer __x, argument 404 list(size_type __n, const _Tp& __value, argument 407 { insert(begin(), __n, __value); } local 408 explicit list(size_type __n) argument 410 { insert(begin(), __n, _Tp()); } local 458 void _M_assign_dispatch(_Integer __n, _Integer __val, __true_type) argument 586 insert(iterator __position, size_type __n, const _Tp& __x) argument 633 assign(size_type __n, const _Tp& __val) argument 638 insert(end(), __n, __val); local [all...] |
H A D | stl_vector.h | 69 _Tp* _M_allocate(size_t __n) argument 71 void _M_deallocate(_Tp* __p, size_t __n) argument 94 _Tp* _M_allocate(size_t __n) argument 96 void _M_deallocate(_Tp* __p, size_t __n) argument 111 _Vector_base(size_t __n, const allocator_type& __a) : _Base(__a) { argument 220 operator [](size_type __n) argument 223 at(size_type __n) argument 238 vector(size_type __n, const _Tp& __value, const allocator_type& __a = allocator_type()) argument 243 vector(size_type __n) argument 261 _M_initialize_aux(_Integer __n, _Integer __value, __true_type) argument 283 reserve(size_type __n) argument 311 _M_assign_dispatch(_Integer __n, _Integer __val, __true_type) argument 356 size_type __n = __position - begin(); local 366 size_type __n = __position - begin(); local 384 _M_insert_dispatch(iterator __pos, _Integer __n, _Integer __val, __true_type) argument 433 _M_allocate_and_copy(size_type __n, _ForwardIterator __first, _ForwardIterator __last) argument 444 _M_allocate_and_copy(size_type __n, const_iterator __first, const_iterator __last) argument 471 size_type __n = 0; local 544 assign(size_t __n, const value_type& __val) argument 664 insert(iterator __position, size_type __n, const _Tp& __x) argument 731 size_type __n = 0; local 783 size_type __n = 0; local [all...] |
H A D | ropeimpl.h | 216 void _Rope_iterator_base<_CharT,_Alloc>::_M_incr(size_t __n) { argument 232 void _Rope_iterator_base<_CharT,_Alloc>::_M_decr(size_t __n) { argument 298 _S_free_string(_CharT* __s, size_t __n, allocator_type __a) argument 759 operator ()(const _CharT* __leaf, size_t __n) argument 775 operator ()(const _CharT* __leaf, size_t __n) argument 802 operator ()(const _CharT* __leaf, size_t __n) argument 811 operator ()(const char* __leaf, size_t __n) argument 891 _Rope_fill(ostream& __o, size_t __n) argument 1371 rope(size_t __n, _CharT __c, const allocator_type& __a) argument [all...] |
H A D | stl_deque.h | 92 __deque_buf_size(size_t __n, size_t __size) argument 174 _Self& operator+=(difference_type __n) argument 196 _Self& operator-=(difference_type __n) { return *this += -__n; } argument 296 _M_allocate_map(size_t __n) argument 298 _M_deallocate_map(_Tp** __p, size_t __n) argument 325 _M_allocate_map(size_t __n) argument 327 _M_deallocate_map(_Tp** __p, size_t __n) argument 410 _M_allocate_map(size_t __n) argument 412 _M_deallocate_map(_Tp** __p, size_t __n) argument 543 operator [](size_type __n) argument 570 deque(size_type __n, const value_type& __value, const allocator_type& __a = allocator_type()) argument 573 deque(size_type __n) argument 587 _M_initialize_dispatch(_Integer __n, _Integer __x, __true_type) argument 640 assign(size_type __n, const _Tp& __val) argument 662 _M_assign_dispatch(_Integer __n, _Integer __val, __true_type) argument 782 _M_insert_dispatch(iterator __pos, _Integer __n, _Integer __x, __true_type) argument 895 _M_reserve_elements_at_front(size_type __n) argument 902 _M_reserve_elements_at_back(size_type __n) argument 966 insert(iterator __pos, size_type __n, const value_type& __x) argument 989 size_type __n = __last - __first; local 1016 size_type __n = __last - __first; local 1049 difference_type __n = __last - __first; local 1125 size_type __n = 0; local 1253 size_type __n = 0; local 1340 _M_insert_aux(iterator __pos, size_type __n, const value_type& __x) argument 1399 _M_insert_aux(iterator __pos, _ForwardIterator __first, _ForwardIterator __last, size_type __n) argument 1460 _M_insert_aux(iterator __pos, const value_type* __first, const value_type* __last, size_type __n) argument 1518 _M_insert_aux(iterator __pos, const_iterator __first, const_iterator __last, size_type __n) argument [all...] |
H A D | stl_slist.h | 355 slist(size_type __n, const value_type& __x, argument 359 explicit slist(size_type __n) : _Base(allocator_type()) argument 403 void _M_assign_dispatch(_Integer __n, _Integer __val, __true_type) argument 482 void _M_insert_after_range(_Node_base* __pos, _Integer __n, _Intege argument 465 _M_insert_after_fill(_Node_base* __pos, size_type __n, const value_type& __x) argument 527 insert_after(iterator __pos, size_type __n, const value_type& __x) argument 563 insert(iterator __pos, size_type __n, const value_type& __x) argument 564 _M_insert_after_fill(__slist_previous(&_M_head, __pos._M_node), __n, __x); local 707 assign(size_type __n, const _Tp& __val) argument [all...] |
H A D | stl_tree.h | 1043 size_type __n = 0; local 1157 size_type __n = 0; local
|
H A D | stl_algo.h | 258 typename iterator_traits<_InputIter>::difference_type __n = 0; local 268 typename iterator_traits<_InputIter>::difference_type __n = 0; local 238 count(_InputIter __first, _InputIter __last, const _Tp& __value, _Size& __n) argument 246 count_if(_InputIter __first, _InputIter __last, _Predicate __pred, _Size& __n) argument 384 _Integer __n = __count - 1; local 413 _Integer __n = __count - 1; local 510 generate_n(_OutputIter __first, _Size __n, _Generator __gen) argument 693 __gcd(_EuclideanRingElement __m, _EuclideanRingElement __n) argument 771 _Distance __n = __last - __first; local 837 __random_number(_Distance __n) argument 866 random_sample_n(_ForwardIter __first, _ForwardIter __last, _OutputIter __out, const _Distance __n) argument 888 random_sample_n(_ForwardIter __first, _ForwardIter __last, _OutputIter __out, const _Distance __n, _RandomNumberGenerator& __rand) argument 910 __random_sample(_InputIter __first, _InputIter __last, _RandomAccessIter __out, const _Distance __n) argument 932 __random_sample(_InputIter __first, _InputIter __last, _RandomAccessIter __out, _RandomNumberGenerator& __rand, const _Distance __n) argument 1266 __lg(_Size __n) argument 2809 __is_heap(_RandomAccessIter __first, _Distance __n) argument 2822 __is_heap(_RandomAccessIter __first, _StrictWeakOrdering __comp, _Distance __n) argument [all...] |
H A D | stl_rope.h | 542 _S_rounded_up_size(size_t __n) argument 975 operator +=(ptrdiff_t __n) argument 987 operator -=(ptrdiff_t __n) argument 1017 operator [](size_t __n) argument 1097 operator +=(difference_type __n) argument 1109 operator -=(difference_type __n) argument 1127 operator [](ptrdiff_t __n) argument 1413 _S_rounded_up_size(size_t __n) argument 1417 _S_allocated_capacity(size_t __n) argument 1756 copy(size_type __pos, size_type __n, _CharT* __buffer) const argument 1879 append(const _CharT* __iter, size_t __n) argument 1935 append(size_t __n, _CharT __c) argument 1984 insert(size_t __p, size_t __n, _CharT __c) argument 1989 insert(size_t __p, const _CharT* __i, size_t __n) 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 2105 erase(size_t __p, size_t __n) argument 2119 insert(const iterator& __p, size_t __n, _CharT __c) argument 2127 insert(const iterator& __p, const _CharT* __i, size_t __n) argument 2148 replace(const iterator& __p, const iterator& __q, const _CharT* __i, size_t __n) argument 2168 replace(const iterator& __p, const _CharT* __i, size_t __n) argument 2270 resize(size_type __n, _CharT __c) argument 2271 resize(size_type __n) argument 2280 copy(_CharT* __buffer, size_type __n, size_type __pos = 0) const argument 2332 operator -(const _Rope_const_iterator<_CharT,_Alloc>& __x, ptrdiff_t __n) argument 2339 operator +(const _Rope_const_iterator<_CharT,_Alloc>& __x, ptrdiff_t __n) argument 2346 operator +(ptrdiff_t __n, const _Rope_const_iterator<_CharT,_Alloc>& __x) argument 2372 operator -(const _Rope_iterator<_CharT,_Alloc>& __x, ptrdiff_t __n) argument 2380 operator +(const _Rope_iterator<_CharT,_Alloc>& __x, ptrdiff_t __n) argument 2388 operator +(ptrdiff_t __n, const _Rope_iterator<_CharT,_Alloc>& __x) argument [all...] |