Home
last modified time | relevance | path

Searched refs:__n (Results 1 – 25 of 322) sorted by relevance

12345678910>>...13

/openbsd/gnu/llvm/libcxx/include/__iterator/
H A Dadvance.h38 for (; __n > 0; --__n) in __advance()
45 if (__n >= 0) in __advance()
46 for (; __n > 0; --__n) in __advance()
49 for (; __n < 0; ++__n) in __advance()
56 __i += __n; in __advance()
85 --__n; in __advance_forward()
94 ++__n; in __advance_backward()
109 __i += __n; in operator()
175 --__n; in operator()
182 ++__n; in operator()
[all …]
/openbsd/gnu/llvm/libcxx/include/__string.d/__string/
H A Dchar_traits.h97 for (; __n; --__n, ++__s1, ++__s2) in compare()
115 for (; __n; --__n) in find()
129 for (; __n; --__n, ++__s1, ++__s2) in move()
136 for (; __n; --__n) in move()
148 for (; __n; --__n, ++__s1, ++__s2) in copy()
156 for (; __n; --__n, ++__s) in assign()
411 for (; __n; --__n)
483 for (; __n; --__n, ++__s1, ++__s2)
507 for (; __n; --__n)
575 for (; __n; --__n, ++__s1, ++__s2)
[all …]
/openbsd/gnu/lib/libstdc++/libstdc++/include/bits/
H A Dvalarray_array.h56 __valarray_get_memory(size_t __n) in __valarray_get_memory() argument
57 { return operator new(__n); } in __valarray_get_memory()
61 __valarray_get_storage(size_t __n) in __valarray_get_storage() argument
185 while (__n--) *__o++ = __a[*__i++];
203 { while (__n--) *__a++ = __t; }
244 _S_do_it(__a, __n, __b);
258 size_t __n, size_t __s)
268 for (size_t __i = 0; __i < __n; ++__i)
296 for (size_t __k = 0; __k < __n; ++__k)
449 _Array<_Tp>::_Array (size_t __n)
[all …]
H A Dstl_bvector.h118 __n = __n % _M_word_bit; in _M_incr()
119 if (__n < 0) { in _M_incr()
202 operator+(ptrdiff_t __n, const _Bit_iterator& __x) { return __x + __n; }
261 operator+(ptrdiff_t __n, const _Bit_const_iterator& __x) { return __x + __n; }
414 _M_initialize(__n); in _M_initialize_range()
485 { _M_range_check(__n); return (*this)[__n]; } in at()
487 { _M_range_check(__n); return (*this)[__n]; } in at()
496 _M_initialize(__n);
503 _M_initialize(__n); in vector()
516 _M_initialize(__n); in _M_initialize_dispatch()
[all …]
H A Dstl_vector.h97 _M_allocate(size_t __n) { return _M_data_allocator.allocate(__n); } in _M_allocate() argument
127 _M_allocate(size_t __n) { return _Alloc_type::allocate(__n); } in _M_allocate() argument
130 _M_deallocate(_Tp* __p, size_t __n) { _Alloc_type::deallocate(__p, __n);} in _M_deallocate() argument
156 _M_start = _M_allocate(__n); in _Vector_base()
240 : _Base(__n, __a) in _Base() argument
251 vector(size_type __n) in vector() argument
501 operator[](size_type __n) { return *(begin() + __n); }
515 operator[](size_type __n) const { return *(begin() + __n); }
522 if (__n >= this->size()) in _M_range_check()
539 at(size_type __n) { _M_range_check(__n); return (*this)[__n]; } in at() argument
[all …]
H A Dchar_traits.h124 for (std::size_t __i = 0; __i < __n; ++__i) in compare()
148 for (std::size_t __i = 0; __i < __n; ++__i) in find()
160 __n * sizeof(char_type))); in move()
169 std::copy(__s2, __s2 + __n, __s1); in copy()
179 std::fill_n(__s, __n, __a); in assign()
225 { return memcmp(__s1, __s2, __n); }
295 { return wmemcmp(__s1, __s2, __n); }
303 { return wmemchr(__s, __a, __n); }
307 { return wmemmove(__s1, __s2, __n); }
311 { return wmemcpy(__s1, __s2, __n); }
[all …]
H A Dstl_alloc.h107 allocate(size_t __n) in allocate() argument
136 allocate(size_t __n) in allocate() argument
172 _S_oom_malloc(size_t __n) in _S_oom_malloc() argument
228 allocate(size_t __n) in allocate() argument
231 if (__n) in allocate()
242 { if (0 != __n) _Alloc::deallocate(__p, __n * sizeof (_Tp)); } in deallocate()
271 allocate(size_t __n) in allocate() argument
366 _S_refill(size_t __n);
387 allocate(size_t __n) in allocate() argument
670 if (__n)
[all …]
H A Dstl_iterator_base_funcs.h82 ++__first; ++__n; in __distance()
84 return __n; in __distance()
123 while (__n--) ++__i; in __advance()
128 __advance(_BidirectionalIterator& __i, _Distance __n, in __advance() argument
134 if (__n > 0) in __advance()
135 while (__n--) ++__i; in __advance()
137 while (__n++) --__i; in __advance()
142 __advance(_RandomAccessIterator& __i, _Distance __n, in __advance() argument
147 __i += __n; in __advance()
164 advance(_InputIterator& __i, _Distance __n) in advance() argument
[all …]
H A Dvalarray_array.tcc44 for (size_t __i=0; __i<__n; ++__i, ++__ok, ++__p) { in __valarray_fill()
85 __valarray_copy (const _Expr<_Dom, _Tp>& __e, size_t __n, _Array<_Tp> __a) in __valarray_copy() argument
88 for (size_t __i=0; __i<__n; ++__i, ++__p) *__p = __e[__i]; in __valarray_copy()
93 __valarray_copy (const _Expr<_Dom, _Tp>& __e, size_t __n, in __valarray_copy() argument
97 for (size_t __i=0; __i<__n; ++__i, __p+=__s) *__p = __e[__i]; in __valarray_copy()
102 __valarray_copy (const _Expr<_Dom, _Tp>& __e, size_t __n, in __valarray_copy() argument
111 __valarray_copy (const _Expr<_Dom, _Tp>& __e, size_t __n, in __valarray_copy() argument
116 for (size_t __i=0; __i<__n; ++__i, ++__ok, ++__p) { in __valarray_copy()
128 __valarray_copy_construct (const _Expr<_Dom, _Tp>& __e, size_t __n, in __valarray_copy_construct() argument
132 for (size_t __i=0; __i<__n; ++__i, ++__p) new (__p) _Tp(__e[__i]); in __valarray_copy_construct()
[all …]
H A Dbasic_string.tcc176 if (__n)
184 __r->_M_length = __n;
285 if (__pos >= __n) in assign()
335 traits_type::copy(__p, __s + __n, __n); in insert()
339 traits_type::copy(__p + (__p-__s), __p + __n, __n - (__p-__s)); in insert()
606 if (__size < __n) in resize()
609 this->erase(__n); in resize()
694 __n) + this->size(); in append()
781 return __n; in copy()
823 if (__n <= __size) in rfind()
[all …]
H A Dvector.tcc69 reserve(size_type __n) in reserve() argument
71 if (__n > this->max_size()) in reserve()
73 if (this->capacity() < __n) in reserve()
98 return begin() + __n; in insert()
160 if (__n > capacity()) in _M_fill_assign()
165 else if (__n > size()) in _M_fill_assign()
310 if (__n != 0) in _M_fill_insert()
317 if (__elems_after > __n) in _M_fill_insert()
320 _M_finish += __n; in _M_fill_insert()
389 if (__elems_after > __n) in _M_range_insert()
[all …]
/openbsd/gnu/gcc/libstdc++-v3/include/bits/
H A Dvalarray_array.h57 __valarray_get_memory(size_t __n) in _GLIBCXX_BEGIN_NAMESPACE()
58 { return operator new(__n); } in _GLIBCXX_BEGIN_NAMESPACE()
182 while (__n--)
188 while (__n--)
203 while (__n--)
206 while (__n--)
228 while (__n--)
246 size_t __n, const _Tp& __t)
260 while(__n--)
296 size_t __n, size_t __s)
[all …]
H A Dchar_traits.h151 for (std::size_t __i = 0; __i < __n; ++__i) in compare()
175 for (std::size_t __i = 0; __i < __n; ++__i) in find()
187 __n * sizeof(char_type))); in move()
195 std::copy(__s2, __s2 + __n, __s1); in copy()
204 std::fill_n(__s, __n, __a); in assign()
254 { return memcmp(__s1, __s2, __n); }
324 { return wmemcmp(__s1, __s2, __n); }
332 { return wmemchr(__s, __a, __n); }
336 { return wmemmove(__s1, __s2, __n); }
340 { return wmemcpy(__s1, __s2, __n); }
[all …]
H A Dbasic_string.tcc174 if (__n)
288 if (__n) in append()
306 if (__n) in append()
350 __n = __str._M_limit(__pos, __n); in append()
351 if (__n) in append()
382 _M_copy(__p, __s + __n, __n); in insert()
387 _M_copy(__p + __nleft, __p + __n, __n - __nleft); in insert()
708 __n = _M_limit(__pos, __n); in copy()
710 if (__n) in copy()
713 return __n; in copy()
[all …]
H A Dstl_bvector.h144 __n = __n % int(_S_word_bit); in _M_incr()
145 if (__n < 0) in _M_incr()
268 { return __x + __n; }
603 + __n / int(_S_word_bit), __n % int(_S_word_bit)); in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
610 + __n / int(_S_word_bit), __n % int(_S_word_bit)); in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
623 at(size_type __n) in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
624 { _M_range_check(__n); return (*this)[__n]; } in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
628 { _M_range_check(__n); return (*this)[__n]; } in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
797 _M_initialize(__n); in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
824 _M_initialize(__n); in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
[all …]
H A Dvalarray_array.tcc49 for (size_t __i=0; __i < __n; ++__i, ++__ok, ++__p) in _GLIBCXX_BEGIN_NAMESPACE()
69 size_t __n) in __valarray_copy() argument
73 for (_Tp* __q = __b._M_data; __q < __b._M_data + __n; in __valarray_copy()
98 for (_Tp* __p = __a._M_data; __p < __a._M_data+__n; in __valarray_copy()
124 for (size_t __i = 0; __i < __n; in __valarray_copy()
148 for (size_t __i = 0; __i < __n; ++__i, ++__p) in __valarray_copy()
160 for (size_t __i = 0; __i < __n; ++__i, __p += __s) in __valarray_copy()
172 for (size_t __k = 0; __k < __n; ++__k, ++__j) in __valarray_copy()
181 size_t __n, in __valarray_copy() argument
221 for (size_t __i = 0; __i < __n; ++__i, ++__p) in __valarray_copy_construct()
[all …]
H A Dstl_vector.h127 _M_allocate(size_t __n) in _M_allocate()
134 _M_impl.deallocate(__p, __n); in _M_deallocate()
212 : _Base(__n, __a) in _Base() argument
459 reserve(size_type __n);
497 if (__n >= this->size()) in _M_range_check()
514 at(size_type __n) in at() argument
516 _M_range_check(__n); in at()
517 return (*this)[__n]; in at()
532 at(size_type __n) const in at() argument
534 _M_range_check(__n); in at()
[all …]
H A Dstl_iterator_base_funcs.h85 ++__n; in _GLIBCXX_BEGIN_NAMESPACE()
87 return __n; in _GLIBCXX_BEGIN_NAMESPACE()
124 __advance(_InputIterator& __i, _Distance __n, input_iterator_tag) in __advance() argument
128 while (__n--) in __advance()
134 __advance(_BidirectionalIterator& __i, _Distance __n, in __advance() argument
140 if (__n > 0) in __advance()
141 while (__n--) in __advance()
144 while (__n++) in __advance()
150 __advance(_RandomAccessIterator& __i, _Distance __n, in __advance() argument
156 __i += __n; in __advance()
[all …]
H A Dvector.tcc69 reserve(size_type __n) in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
71 if (__n > this->max_size()) in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
73 if (this->capacity() < __n) in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
173 if (__n > capacity()) in _M_fill_assign()
178 else if (__n > size()) in _M_fill_assign()
182 __n - size(), __val, in _M_fill_assign()
309 if (__n != 0) in _M_fill_insert()
317 if (__elems_after > __n) in _M_fill_insert()
332 __n - __elems_after, in _M_fill_insert()
365 __new_finish += __n; in _M_fill_insert()
[all …]
/openbsd/gnu/llvm/libcxx/include/__random/
H A Dseed_seq.h121 if (++__kmodn == __n) in generate()
123 if (++__k1modn == __n) in generate()
125 if (++__kpmodn == __n) in generate()
127 if (++__kqmodn == __n) in generate()
138 if (++__kmodn == __n) in generate()
140 if (++__k1modn == __n) in generate()
142 if (++__kpmodn == __n) in generate()
144 if (++__kqmodn == __n) in generate()
155 if (++__kmodn == __n) in generate()
157 if (++__k1modn == __n) in generate()
[all …]
/openbsd/gnu/gcc/libstdc++-v3/include/std/
H A Dstd_istream.h178 operator>>(bool& __n) in _GLIBCXX_BEGIN_NAMESPACE()
179 { return _M_extract(__n); } in _GLIBCXX_BEGIN_NAMESPACE()
182 operator>>(short& __n); in _GLIBCXX_BEGIN_NAMESPACE()
186 { return _M_extract(__n); } in _GLIBCXX_BEGIN_NAMESPACE()
189 operator>>(int& __n); in _GLIBCXX_BEGIN_NAMESPACE()
193 { return _M_extract(__n); } in _GLIBCXX_BEGIN_NAMESPACE()
196 operator>>(long& __n) in _GLIBCXX_BEGIN_NAMESPACE()
205 operator>>(long long& __n) in _GLIBCXX_BEGIN_NAMESPACE()
444 ignore(streamsize __n); in _GLIBCXX_BEGIN_NAMESPACE()
610 ignore(streamsize __n);
[all …]
/openbsd/gnu/gcc/libstdc++-v3/include/ext/
H A Dhashtable.h387 for (size_type __n = 0; __n < _M_buckets.size(); ++__n)
400 for (size_type __n = 0; __n < _M_buckets.size(); ++__n)
429 for (_Node* __n = _M_buckets[__bucket]; __n; __n = __n->_M_next)
489 for ( ; __n > 0; --__n, ++__f)
500 for ( ; __n > 0; --__n, ++__f)
605 __n->_M_next = 0;
609 return __n;
622 _M_put_node(__n);
701 for (size_t __n = 0; __n < __ht1._M_buckets.size(); ++__n)
961 for (size_type __n = __f_bucket + 1; __n < __l_bucket; ++__n)
[all …]
/openbsd/gnu/llvm/libcxx/include/__format/
H A Dbuffer.h105 __size_ += __n; in __copy()
118 __n -= __chunk; in __copy()
120 } while (__n); in __copy()
134 __size_ += __n; in __transform()
146 __n -= __chunk; in __transform()
148 } while (__n); in __transform()
156 __size_ += __n; in __fill()
167 __n -= __chunk; in __fill()
169 } while (__n); in __fill()
412 __size_ += __n;
[all …]
/openbsd/gnu/llvm/libcxx/include/
H A D__bit_reference207 if (__n > 0)
246 if (__n > 0)
291 if (__n > 0)
322 if (__n > 0)
364 if (__n > 0)
395 if (__n > 0)
408 if (__n > 0)
439 if (__n > 0)
486 if (__n > 0)
576 if (__n > 0)
[all …]
/openbsd/gnu/lib/libstdc++/libstdc++/include/ext/
H A Dstl_hashtable.h340 for (size_type __n = 0; __n < _M_buckets.size(); ++__n)
350 for (size_type __n = 0; __n < _M_buckets.size(); ++__n)
425 for ( ; __n > 0; --__n, ++__f)
435 for ( ; __n > 0; --__n, ++__f)
525 __n->_M_next = 0;
528 return __n;
532 _M_put_node(__n);
540 _M_put_node(__n);
607 for (size_t __n = 0; __n < __ht1._M_buckets.size(); ++__n) {
844 for (size_type __n = __f_bucket + 1; __n < __l_bucket; ++__n)
[all …]

12345678910>>...13