Home
last modified time | relevance | path

Searched refs:__j (Results 1 – 10 of 10) sorted by relevance

/haiku/headers/cpp/std/
H A Dvalarray_array.h62 { for (size_t __j=0; __j<__n; ++__j, ++__i) __a[*__i] = __t; } in __valarray_fill() local
91 { for (size_t __j=0; __j<__n; ++__j, ++__b, ++__i) *__b = __a[*__i]; } in __valarray_copy() local
98 { for (size_t __j=0; __j<__n; ++__j, ++__a, ++__i) __b[*__i] = *__a; } in __valarray_copy() local
250 for (size_t* __j=__i._M_data; __j<__i._M_data+__n; ++__j, ++__q) \
251 __a._M_data[*__j] _Op##= *__q; \
260 for (size_t* __j=__i._M_data; __j<__i._M_data+__n; ++__j, ++__p) \
261 *__p _Op##= __b._M_data[*__j]; \
269 size_t* __j (__i._M_data); \
270 for (size_t __k=0; __k<__n; ++__k, ++__j) \
271 __a._M_data[*__j] _Op##= __e[__k]; \
H A Dvalarray_array.tcc104 size_t* __j (__i._M_data); in __valarray_copy() local
105 for (size_t __k=0; __k<__n; ++__k, ++__j) __a._M_data[*__j] = __e[__k]; in __valarray_copy()
/haiku/src/libs/stdc++/legacy/
H A Dvalarray.cc30 for (size_t __j=0; __j<__z; ++__j) { in __gslice_to_index() local
32 __i[__j] += __s[__k]*__t[__k]; in __gslice_to_index()
/haiku/headers/cpp/
H A Dstl_rope.h162 size_t __j = 0; in append() local
163 for (; __j < __len; __i++, __j++) { in append()
164 _M_buffer[__i] = __s[__j]; in append()
2012 void insert(size_t __p, const _CharT* __i, const _CharT* __j) {
2013 rope __r(__i, __j);
2018 const const_iterator& __j) {
2019 rope __r(__i, __j);
2024 const iterator& __j) {
2025 rope __r(__i, __j);
2055 const _CharT* __i, const _CharT* __j) {
[all …]
H A Dbitset279 for ( size_t __j = 0; __j < sizeof(_WordT); __j++ ) {
283 return __i*__BITS_PER_WORDT(_WordT) + __j*CHAR_BIT +
317 for ( size_t __j = _S_whichbyte(__prev); __j < sizeof(_WordT); __j++ ) {
321 return __i*__BITS_PER_WORDT(_WordT) + __j*CHAR_BIT +
334 for ( size_t __j = 0; __j < sizeof(_WordT); __j++ ) {
338 return __i*__BITS_PER_WORDT(_WordT) + __j*CHAR_BIT +
452 for ( size_t __j = 0; __j < sizeof(_WordT); __j++ ) {
456 return __j*CHAR_BIT + _First_one<true>::_S_first_one[__this_byte];
487 for ( size_t __j = _S_whichbyte(__prev); __j < sizeof(_WordT); __j++ ) {
491 return __j*CHAR_BIT + _First_one<true>::_S_first_one[__this_byte];
[all …]
H A Dstl_tree.h887 iterator __j = iterator(__y); in insert_unique() local
889 if (__j == begin()) in insert_unique()
892 --__j; in insert_unique()
893 if (_M_key_compare(_S_key(__j._M_node), _KeyOfValue()(__v))) in insert_unique()
895 return pair<iterator,bool>(__j, false); in insert_unique()
1126 iterator __j = iterator(__y); in find() local
1127 return (__j == end() || _M_key_compare(__k, _S_key(__j._M_node))) ? in find()
1128 end() : __j; in find()
1145 const_iterator __j = const_iterator(__y); in find() local
1146 return (__j == end() || _M_key_compare(__k, _S_key(__j._M_node))) ? in find()
[all …]
H A Dstl_algo.h788 for (_Distance __j = 0; __j < __l/__d; __j++) { in __rotate() local
800 for (_Distance __j = 0; __j < __k/__d - 1; __j ++) { in __rotate() local
2543 _BidirectionalIter __j = __last; in next_permutation() local
2544 while (!(*__i < *--__j)) in next_permutation()
2546 iter_swap(__i, __j); in next_permutation()
2573 _BidirectionalIter __j = __last; in next_permutation() local
2574 while (!__comp(*__i, *--__j)) in next_permutation()
2576 iter_swap(__i, __j); in next_permutation()
2602 _BidirectionalIter __j = __last; in prev_permutation() local
2603 while (!(*--__j < *__i)) in prev_permutation()
[all …]
H A Dstl_deque.h1588 for (size_type __j = 1; __j < __i; ++__j) in _M_new_elements_at_front() local
1589 _M_deallocate_node(*(_M_start._M_node - __j)); in _M_new_elements_at_front()
1609 for (size_type __j = 1; __j < __i; ++__j) in _M_new_elements_at_back() local
1610 _M_deallocate_node(*(_M_finish._M_node + __j)); in _M_new_elements_at_back()
H A Dstl_list.h489 iterator __j = __i; in splice() local
490 ++__j; in splice()
491 if (__position == __i || __position == __j) return; in splice()
492 transfer(__position, __i, __j); in splice()
H A Dropeimpl.h137 int __j = __curr_depth + 1 - _S_path_cache_len; in _S_setcache() local
139 if (__j < 0) __j = 0; in _S_setcache()
140 while (__j <= __curr_depth) { in _S_setcache()
141 __x._M_path_end[++__i] = __path[__j++]; in _S_setcache()