| /dragonfly/contrib/gcc-8.0/libstdc++-v3/include/bits/ |
| D | char_traits.h | 108 compare(const char_type* __s1, const char_type* __s2, std::size_t __n); in _GLIBCXX_VISIBILITY()
114 find(const char_type* __s, std::size_t __n, const char_type& __a); in _GLIBCXX_VISIBILITY()
117 move(char_type* __s1, const char_type* __s2, std::size_t __n); in _GLIBCXX_VISIBILITY()
120 copy(char_type* __s1, const char_type* __s2, std::size_t __n); in _GLIBCXX_VISIBILITY()
123 assign(char_type* __s, std::size_t __n, char_type __a); in _GLIBCXX_VISIBILITY()
149 compare(const char_type* __s1, const char_type* __s2, std::size_t __n) in _GLIBCXX_VISIBILITY()
151 for (std::size_t __i = 0; __i < __n; ++__i) in _GLIBCXX_VISIBILITY()
173 find(const char_type* __s, std::size_t __n, const char_type& __a) in _GLIBCXX_VISIBILITY()
175 for (std::size_t __i = 0; __i < __n; ++__i) in _GLIBCXX_VISIBILITY()
184 move(char_type* __s1, const char_type* __s2, std::size_t __n) in _GLIBCXX_VISIBILITY()
[all …]
|
| D | valarray_array.h | 52 __valarray_get_memory(size_t __n) in _GLIBCXX_VISIBILITY()
53 { return operator new(__n); } in _GLIBCXX_VISIBILITY()
57 __valarray_get_storage(size_t __n) in _GLIBCXX_VISIBILITY()
60 (std::__valarray_get_memory(__n * sizeof(_Tp))); in _GLIBCXX_VISIBILITY()
172 __valarray_copy_construct (const _Tp* __restrict__ __a, size_t __n, in _GLIBCXX_VISIBILITY()
176 while (__n--) in _GLIBCXX_VISIBILITY()
182 while (__n--) in _GLIBCXX_VISIBILITY()
194 _Tp* __restrict__ __o, size_t __n) in _GLIBCXX_VISIBILITY()
197 while (__n--) in _GLIBCXX_VISIBILITY()
200 while (__n--) in _GLIBCXX_VISIBILITY()
[all …]
|
| D | string_view.tcc | 48 find(const _CharT* __str, size_type __pos, size_type __n) const noexcept in find()
50 __glibcxx_requires_string_len(__str, __n); in find()
52 if (__n == 0) in find()
55 if (__n <= this->_M_len) in find()
57 for (; __pos <= this->_M_len - __n; ++__pos) in find()
60 __str + 1, __n - 1) == 0) in find()
74 const size_type __n = this->_M_len - __pos; in find() local
75 const _CharT* __p = traits_type::find(this->_M_str + __pos, __n, __c); in find()
85 rfind(const _CharT* __str, size_type __pos, size_type __n) const noexcept in rfind()
87 __glibcxx_requires_string_len(__str, __n); in rfind()
[all …]
|
| D | stl_iterator_base_funcs.h | 86 typename iterator_traits<_InputIterator>::difference_type __n = 0; in _GLIBCXX_VISIBILITY()
90 ++__n; in _GLIBCXX_VISIBILITY()
92 return __n; in _GLIBCXX_VISIBILITY()
147 __advance(_InputIterator& __i, _Distance __n, input_iterator_tag) in _GLIBCXX_VISIBILITY()
151 __glibcxx_assert(__n >= 0); in _GLIBCXX_VISIBILITY()
152 while (__n--) in _GLIBCXX_VISIBILITY()
158 __advance(_BidirectionalIterator& __i, _Distance __n, in _GLIBCXX_VISIBILITY()
164 if (__n > 0) in _GLIBCXX_VISIBILITY()
165 while (__n--) in _GLIBCXX_VISIBILITY()
168 while (__n++) in _GLIBCXX_VISIBILITY()
[all …]
|
| D | vector.tcc | 67 reserve(size_type __n) in reserve() argument
69 if (__n > this->max_size()) in reserve()
71 if (this->capacity() < __n) in reserve()
74 pointer __tmp = _M_allocate_and_copy(__n, in reserve()
85 this->_M_impl._M_end_of_storage = this->_M_impl._M_start + __n; in reserve()
125 const size_type __n = __position - begin(); in insert() local
154 return iterator(this->_M_impl._M_start + __n); in insert()
246 _M_fill_assign(size_t __n, const value_type& __val) in _M_fill_assign() argument
248 if (__n > capacity()) in _M_fill_assign()
250 vector __tmp(__n, __val, _M_get_Tp_allocator()); in _M_fill_assign()
[all …]
|
| D | basic_string.tcc | 238 _M_construct(size_type __n, _CharT __c) in _M_construct() argument
240 if (__n > size_type(_S_local_capacity)) in _M_construct()
242 _M_data(_M_create(__n, size_type(0))); in _M_construct()
243 _M_capacity(__n); in _M_construct()
246 if (__n) in _M_construct()
247 this->_S_assign(_M_data(), __n, __c); in _M_construct()
249 _M_set_length(__n); in _M_construct()
335 _M_erase(size_type __pos, size_type __n) in _M_erase() argument
337 const size_type __how_much = length() - __pos - __n; in _M_erase()
339 if (__how_much && __n) in _M_erase()
[all …]
|
| D | valarray_array.tcc | 41 __valarray_fill(_Array<_Tp> __a, size_t __n, _Array<bool> __m, in __valarray_fill() argument
46 for (size_t __i=0; __i < __n; ++__i, ++__ok, ++__p) in __valarray_fill()
66 size_t __n) in __valarray_copy() argument
70 for (_Tp* __q = __b._M_data; __q < __b._M_data + __n; in __valarray_copy()
90 __valarray_copy(_Array<_Tp> __a, size_t __n, _Array<_Tp> __b, in __valarray_copy() argument
95 for (_Tp* __p = __a._M_data; __p < __a._M_data+__n; in __valarray_copy()
114 __valarray_copy(_Array<_Tp> __a, _Array<bool> __m, size_t __n, in __valarray_copy() argument
121 for (size_t __i = 0; __i < __n; in __valarray_copy()
142 __valarray_copy(const _Expr<_Dom, _Tp>& __e, size_t __n, _Array<_Tp> __a) in __valarray_copy() argument
145 for (size_t __i = 0; __i < __n; ++__i, ++__p) in __valarray_copy()
[all …]
|
| D | stl_vector.h | 153 _S_grow(_Vector_impl& __impl, size_type __n) in _GLIBCXX_VISIBILITY()
154 { _S_adjust(__impl, __impl._M_finish, __impl._M_finish + __n); } in _GLIBCXX_VISIBILITY()
157 _S_shrink(_Vector_impl& __impl, size_type __n) in _GLIBCXX_VISIBILITY()
158 { _S_adjust(__impl, __impl._M_finish + __n, __impl._M_finish); } in _GLIBCXX_VISIBILITY()
195 _Grow(_Vector_impl& __impl, size_type __n) in _GLIBCXX_VISIBILITY()
196 : _M_impl(__impl), _M_n(__n) in _GLIBCXX_VISIBILITY()
197 { _S_grow(_M_impl, __n); } in _GLIBCXX_VISIBILITY()
201 void _M_grew(size_type __n) { _M_n -= __n; } in _GLIBCXX_VISIBILITY()
254 _Vector_base(size_t __n) in _GLIBCXX_VISIBILITY()
256 { _M_create_storage(__n); } in _GLIBCXX_VISIBILITY()
[all …]
|
| D | hashtable.h | 358 _M_allocate_buckets(size_type __n) in _GLIBCXX_VISIBILITY()
360 if (__builtin_expect(__n == 1, false)) in _GLIBCXX_VISIBILITY()
366 return __hashtable_alloc::_M_allocate_buckets(__n); in _GLIBCXX_VISIBILITY()
370 _M_deallocate_buckets(__bucket_type* __bkts, size_type __n) in _GLIBCXX_VISIBILITY()
375 __hashtable_alloc::_M_deallocate_buckets(__bkts, __n); in _GLIBCXX_VISIBILITY()
441 _Hashtable(size_type __n, in _GLIBCXX_VISIBILITY()
445 : _Hashtable(__n, __hf, _H2(), _Hash(), __eql, in _GLIBCXX_VISIBILITY()
451 size_type __n = 0, in _GLIBCXX_VISIBILITY()
455 : _Hashtable(__f, __l, __n, __hf, _H2(), _Hash(), __eql, in _GLIBCXX_VISIBILITY()
460 size_type __n = 0, in _GLIBCXX_VISIBILITY()
[all …]
|
| /dragonfly/contrib/gcc-4.7/libstdc++-v3/include/bits/ |
| D | valarray_array.h | 54 __valarray_get_memory(size_t __n) in _GLIBCXX_VISIBILITY()
55 { return operator new(__n); } in _GLIBCXX_VISIBILITY()
59 __valarray_get_storage(size_t __n) in _GLIBCXX_VISIBILITY()
62 (std::__valarray_get_memory(__n * sizeof(_Tp))); in _GLIBCXX_VISIBILITY()
171 __valarray_copy_construct (const _Tp* __restrict__ __a, size_t __n, in _GLIBCXX_VISIBILITY()
175 while (__n--) in _GLIBCXX_VISIBILITY()
181 while (__n--) in _GLIBCXX_VISIBILITY()
193 _Tp* __restrict__ __o, size_t __n) in _GLIBCXX_VISIBILITY()
196 while (__n--) in _GLIBCXX_VISIBILITY()
199 while (__n--) in _GLIBCXX_VISIBILITY()
[all …]
|
| D | char_traits.h | 106 compare(const char_type* __s1, const char_type* __s2, std::size_t __n); in _GLIBCXX_VISIBILITY()
112 find(const char_type* __s, std::size_t __n, const char_type& __a); in _GLIBCXX_VISIBILITY()
115 move(char_type* __s1, const char_type* __s2, std::size_t __n); in _GLIBCXX_VISIBILITY()
118 copy(char_type* __s1, const char_type* __s2, std::size_t __n); in _GLIBCXX_VISIBILITY()
121 assign(char_type* __s, std::size_t __n, char_type __a); in _GLIBCXX_VISIBILITY()
147 compare(const char_type* __s1, const char_type* __s2, std::size_t __n) in _GLIBCXX_VISIBILITY()
149 for (std::size_t __i = 0; __i < __n; ++__i) in _GLIBCXX_VISIBILITY()
171 find(const char_type* __s, std::size_t __n, const char_type& __a) in _GLIBCXX_VISIBILITY()
173 for (std::size_t __i = 0; __i < __n; ++__i) in _GLIBCXX_VISIBILITY()
182 move(char_type* __s1, const char_type* __s2, std::size_t __n) in _GLIBCXX_VISIBILITY()
[all …]
|
| D | basic_string.tcc | 155 _S_construct(size_type __n, _CharT __c, const _Alloc& __a) in _S_construct() argument
158 if (__n == 0 && __a == _Alloc()) in _S_construct()
162 _Rep* __r = _Rep::_S_create(__n, size_type(0), __a); in _S_construct()
163 if (__n) in _S_construct()
164 _M_assign(__r->_M_refdata(), __n, __c); in _S_construct()
166 __r->_M_set_length_and_sharable(__n); in _S_construct()
186 basic_string(const basic_string& __str, size_type __pos, size_type __n) in basic_string() argument
190 __str._M_data() + __str._M_limit(__pos, __n) in basic_string()
197 size_type __n, const _Alloc& __a) in basic_string() argument
201 __str._M_data() + __str._M_limit(__pos, __n) in basic_string()
[all …]
|
| D | stl_vector.h | 131 _Vector_base(size_t __n) in _GLIBCXX_VISIBILITY()
133 { _M_create_storage(__n); } in _GLIBCXX_VISIBILITY()
135 _Vector_base(size_t __n, const allocator_type& __a) in _GLIBCXX_VISIBILITY()
137 { _M_create_storage(__n); } in _GLIBCXX_VISIBILITY()
154 size_t __n = __x._M_impl._M_finish - __x._M_impl._M_start; in _GLIBCXX_VISIBILITY() local
155 _M_create_storage(__n); in _GLIBCXX_VISIBILITY()
168 _M_allocate(size_t __n) in _GLIBCXX_VISIBILITY()
169 { return __n != 0 ? _M_impl.allocate(__n) : 0; } in _GLIBCXX_VISIBILITY()
172 _M_deallocate(pointer __p, size_t __n) in _GLIBCXX_VISIBILITY()
175 _M_impl.deallocate(__p, __n); in _GLIBCXX_VISIBILITY()
[all …]
|
| D | vector.tcc | 67 reserve(size_type __n) in reserve() argument
69 if (__n > this->max_size()) in reserve()
71 if (this->capacity() < __n) in reserve()
74 pointer __tmp = _M_allocate_and_copy(__n, in reserve()
84 this->_M_impl._M_end_of_storage = this->_M_impl._M_start + __n; in reserve()
111 const size_type __n = __position - begin(); in insert() local
130 return iterator(this->_M_impl._M_start + __n); in insert()
220 _M_fill_assign(size_t __n, const value_type& __val) in _M_fill_assign() argument
222 if (__n > capacity()) in _M_fill_assign()
224 vector __tmp(__n, __val, _M_get_Tp_allocator()); in _M_fill_assign()
[all …]
|
| D | stl_iterator_base_funcs.h | 79 typename iterator_traits<_InputIterator>::difference_type __n = 0; in _GLIBCXX_VISIBILITY()
83 ++__n; in _GLIBCXX_VISIBILITY()
85 return __n; in _GLIBCXX_VISIBILITY()
123 __advance(_InputIterator& __i, _Distance __n, input_iterator_tag) in _GLIBCXX_VISIBILITY()
127 while (__n--) in _GLIBCXX_VISIBILITY()
133 __advance(_BidirectionalIterator& __i, _Distance __n, in _GLIBCXX_VISIBILITY()
139 if (__n > 0) in _GLIBCXX_VISIBILITY()
140 while (__n--) in _GLIBCXX_VISIBILITY()
143 while (__n++) in _GLIBCXX_VISIBILITY()
149 __advance(_RandomAccessIterator& __i, _Distance __n, in _GLIBCXX_VISIBILITY()
[all …]
|
| D | valarray_array.tcc | 42 __valarray_fill(_Array<_Tp> __a, size_t __n, _Array<bool> __m, in __valarray_fill() argument
47 for (size_t __i=0; __i < __n; ++__i, ++__ok, ++__p) in __valarray_fill()
67 size_t __n) in __valarray_copy() argument
71 for (_Tp* __q = __b._M_data; __q < __b._M_data + __n; in __valarray_copy()
91 __valarray_copy(_Array<_Tp> __a, size_t __n, _Array<_Tp> __b, in __valarray_copy() argument
96 for (_Tp* __p = __a._M_data; __p < __a._M_data+__n; in __valarray_copy()
115 __valarray_copy(_Array<_Tp> __a, _Array<bool> __m, size_t __n, in __valarray_copy() argument
122 for (size_t __i = 0; __i < __n; in __valarray_copy()
143 __valarray_copy(const _Expr<_Dom, _Tp>& __e, size_t __n, _Array<_Tp> __a) in __valarray_copy() argument
146 for (size_t __i = 0; __i < __n; ++__i, ++__p) in __valarray_copy()
[all …]
|
| D | stl_bvector.h | 143 difference_type __n = __i + _M_offset; in _GLIBCXX_VISIBILITY() local
144 _M_p += __n / int(_S_word_bit); in _GLIBCXX_VISIBILITY()
145 __n = __n % int(_S_word_bit); in _GLIBCXX_VISIBILITY()
146 if (__n < 0) in _GLIBCXX_VISIBILITY()
148 __n += int(_S_word_bit); in _GLIBCXX_VISIBILITY()
151 _M_offset = static_cast<unsigned int>(__n); in _GLIBCXX_VISIBILITY()
268 operator+(ptrdiff_t __n, const _Bit_iterator& __x) in _GLIBCXX_VISIBILITY()
269 { return __x + __n; } in _GLIBCXX_VISIBILITY()
354 operator+(ptrdiff_t __n, const _Bit_const_iterator& __x) in _GLIBCXX_VISIBILITY()
355 { return __x + __n; } in _GLIBCXX_VISIBILITY()
[all …]
|
| /dragonfly/contrib/gcc-4.7/libstdc++-v3/include/tr1/ |
| D | poly_laguerre.tcc | 71 __poly_laguerre_large_n(const unsigned __n, const _Tpa __alpha1, in __poly_laguerre_large_n() argument
74 const _Tp __a = -_Tp(__n); in __poly_laguerre_large_n()
85 const _Tp __lg_b = std::tr1::lgamma(_Tp(__n) + __b); in __poly_laguerre_large_n()
86 const _Tp __lnfact = std::tr1::lgamma(_Tp(__n + 1)); in __poly_laguerre_large_n()
88 const _Tp __lg_b = __log_gamma(_Tp(__n) + __b); in __poly_laguerre_large_n()
89 const _Tp __lnfact = __log_gamma(_Tp(__n + 1)); in __poly_laguerre_large_n()
126 __poly_laguerre_hyperg(const unsigned int __n, const _Tpa __alpha1, in __poly_laguerre_hyperg() argument
132 : ((__n % 2 == 1) ? -_Tp(1) : _Tp(1))); in __poly_laguerre_hyperg()
136 for (unsigned int __k = 1; __k <= __n; ++__k) in __poly_laguerre_hyperg()
141 for (int __k = int(__n) - 1; __k >= 0; --__k) in __poly_laguerre_hyperg()
[all …]
|
| D | gamma.tcc | 71 _Tp __bernoulli_series(unsigned int __n) in __bernoulli_series() argument
91 if (__n == 0) in __bernoulli_series()
94 if (__n == 1) in __bernoulli_series()
98 if (__n % 2 == 1) in __bernoulli_series()
102 if (__n < 28) in __bernoulli_series()
103 return __num[__n]; in __bernoulli_series()
107 if ((__n / 2) % 2 == 0) in __bernoulli_series()
109 for (unsigned int __k = 1; __k <= __n; ++__k) in __bernoulli_series()
116 _Tp __term = std::pow(_Tp(__i), -_Tp(__n)); in __bernoulli_series()
134 __bernoulli(const int __n) in __bernoulli() argument
[all …]
|
| /dragonfly/contrib/gcc-8.0/libstdc++-v3/include/tr1/ |
| D | poly_laguerre.tcc | 77 __poly_laguerre_large_n(unsigned __n, _Tpa __alpha1, _Tp __x) in __poly_laguerre_large_n() argument
79 const _Tp __a = -_Tp(__n); in __poly_laguerre_large_n()
90 const _Tp __lg_b = _GLIBCXX_MATH_NS::lgamma(_Tp(__n) + __b); in __poly_laguerre_large_n()
91 const _Tp __lnfact = _GLIBCXX_MATH_NS::lgamma(_Tp(__n + 1)); in __poly_laguerre_large_n()
93 const _Tp __lg_b = __log_gamma(_Tp(__n) + __b); in __poly_laguerre_large_n()
94 const _Tp __lnfact = __log_gamma(_Tp(__n + 1)); in __poly_laguerre_large_n()
131 __poly_laguerre_hyperg(unsigned int __n, _Tpa __alpha1, _Tp __x) in __poly_laguerre_hyperg() argument
136 : ((__n % 2 == 1) ? -_Tp(1) : _Tp(1))); in __poly_laguerre_hyperg()
140 for (unsigned int __k = 1; __k <= __n; ++__k) in __poly_laguerre_hyperg()
145 for (int __k = int(__n) - 1; __k >= 0; --__k) in __poly_laguerre_hyperg()
[all …]
|
| D | gamma.tcc | 78 __bernoulli_series(unsigned int __n) in __bernoulli_series() argument
98 if (__n == 0) in __bernoulli_series()
101 if (__n == 1) in __bernoulli_series()
105 if (__n % 2 == 1) in __bernoulli_series()
109 if (__n < 28) in __bernoulli_series()
110 return __num[__n]; in __bernoulli_series()
114 if ((__n / 2) % 2 == 0) in __bernoulli_series()
116 for (unsigned int __k = 1; __k <= __n; ++__k) in __bernoulli_series()
123 _Tp __term = std::pow(_Tp(__i), -_Tp(__n)); in __bernoulli_series()
141 __bernoulli(int __n) in __bernoulli() argument
[all …]
|
| /dragonfly/contrib/gcc-8.0/libstdc++-v3/include/experimental/bits/ |
| D | string_view.tcc | 52 find(const _CharT* __str, size_type __pos, size_type __n) const noexcept in find()
54 __glibcxx_requires_string_len(__str, __n); in find()
56 if (__n == 0) in find()
59 if (__n <= this->_M_len) in find()
61 for (; __pos <= this->_M_len - __n; ++__pos) in find()
64 __str + 1, __n - 1) == 0) in find()
78 const size_type __n = this->_M_len - __pos; in find() local
79 const _CharT* __p = traits_type::find(this->_M_str + __pos, __n, __c); in find()
89 rfind(const _CharT* __str, size_type __pos, size_type __n) const noexcept in rfind()
91 __glibcxx_requires_string_len(__str, __n); in rfind()
[all …]
|
| /dragonfly/contrib/gcc-8.0/libstdc++-v3/include/tr2/ |
| D | dynamic_bitset.tcc | 52 for (size_t __n = this->_M_w.size() - 1; __n >= __wshift; --__n) in _M_do_left_shift() local
53 this->_M_w[__n] = this->_M_w[__n - __wshift]; in _M_do_left_shift()
57 for (size_t __n = _M_w.size() - 1; __n > __wshift; --__n) in _M_do_left_shift() local
58 this->_M_w[__n] = ((this->_M_w[__n - __wshift] << __offset) in _M_do_left_shift()
59 | (this->_M_w[__n - __wshift - 1] >> __sub_offset)); in _M_do_left_shift()
79 for (size_t __n = 0; __n <= __limit; ++__n) in _M_do_right_shift() local
80 this->_M_w[__n] = this->_M_w[__n + __wshift]; in _M_do_right_shift()
85 for (size_t __n = 0; __n < __limit; ++__n) in _M_do_right_shift() local
86 this->_M_w[__n] = ((this->_M_w[__n + __wshift] >> __offset) in _M_do_right_shift()
87 | (this->_M_w[__n + __wshift + 1] << __sub_offset)); in _M_do_right_shift()
[all …]
|
| /dragonfly/contrib/gcc-8.0/libstdc++-v3/include/backward/ |
| D | hashtable.h | 125 _Hashtable_iterator(_Node* __n, _Hashtable* __tab) in _GLIBCXX_VISIBILITY()
126 : _M_cur(__n), _M_ht(__tab) { } in _GLIBCXX_VISIBILITY()
177 _Hashtable_const_iterator(const _Node* __n, const _Hashtable* __tab) in _GLIBCXX_VISIBILITY()
178 : _M_cur(__n), _M_ht(__tab) { } in _GLIBCXX_VISIBILITY()
238 __stl_next_prime(unsigned long __n) in _GLIBCXX_VISIBILITY()
242 const unsigned long* pos = std::lower_bound(__first, __last, __n); in _GLIBCXX_VISIBILITY()
337 hashtable(size_type __n, const _HashFcn& __hf, in _GLIBCXX_VISIBILITY()
342 { _M_initialize_buckets(__n); } in _GLIBCXX_VISIBILITY()
344 hashtable(size_type __n, const _HashFcn& __hf, in _GLIBCXX_VISIBILITY()
349 { _M_initialize_buckets(__n); } in _GLIBCXX_VISIBILITY()
[all …]
|
| /dragonfly/contrib/gcc-4.7/libstdc++-v3/include/backward/ |
| D | hashtable.h | 126 _Hashtable_iterator(_Node* __n, _Hashtable* __tab) in _GLIBCXX_VISIBILITY()
127 : _M_cur(__n), _M_ht(__tab) { } in _GLIBCXX_VISIBILITY()
178 _Hashtable_const_iterator(const _Node* __n, const _Hashtable* __tab) in _GLIBCXX_VISIBILITY()
179 : _M_cur(__n), _M_ht(__tab) { } in _GLIBCXX_VISIBILITY()
239 __stl_next_prime(unsigned long __n) in _GLIBCXX_VISIBILITY()
243 const unsigned long* pos = std::lower_bound(__first, __last, __n); in _GLIBCXX_VISIBILITY()
338 hashtable(size_type __n, const _HashFcn& __hf, in _GLIBCXX_VISIBILITY()
343 { _M_initialize_buckets(__n); } in _GLIBCXX_VISIBILITY()
345 hashtable(size_type __n, const _HashFcn& __hf, in _GLIBCXX_VISIBILITY()
350 { _M_initialize_buckets(__n); } in _GLIBCXX_VISIBILITY()
[all …]
|