Home
last modified time | relevance | path

Searched refs:__i (Results 1 – 25 of 71) sorted by relevance

123

/ndk/sources/cxx-stl/stlport/stlport/stl/
D_valarray.h181 for (size_t __i = 0; __i < this->size(); ++__i) variable
182 __tmp[__i] = -(*this)[__i];
188 for (size_t __i = 0; __i < this->size(); ++__i) variable
189 __tmp[__i] = ~(*this)[__i];
197 for (size_t __i = 0; __i < this->size(); ++__i) variable
198 (*this)[__i] *= __x;
203 for (size_t __i = 0; __i < this->size(); ++__i) variable
204 (*this)[__i] /= __x;
209 for (size_t __i = 0; __i < this->size(); ++__i) variable
210 (*this)[__i] %= __x;
[all …]
D_valarray.c38 for (size_t __i = 0; __i < this->size(); ++__i) variable
39 __tmp[__i] = !(*this)[__i];
48 for (size_t __i = 0; variable
49 __i < __x._M_slice.size();
50 ++__i, __index += __x._M_slice.stride())
51 (*this)[__i] = __x._M_array[__index];
59 for (size_t __i = 0; variable
60 __i < __slice.size();
61 ++__i, __index += __slice.stride())
62 __tmp[__i] = (*this)[__index];
[all …]
Dconcept_checks.h407 __dereference_operator_requirement_violation(_Iterator __i) {
408 __sink_unused_warning(*__i);
412 __dereference_operator_and_assignment_requirement_violation(_Iterator __i) {
413 *__i = *__i;
417 __preincrement_operator_requirement_violation(_Iterator __i) {
418 ++__i;
422 __postincrement_operator_requirement_violation(_Iterator __i) {
423 __i++;
427 __predecrement_operator_requirement_violation(_Iterator __i) {
428 --__i;
[all …]
D_carray.h38 for (size_t __i = 0; __i < _Nb; ++__i) { in _CArray() local
39 _Copy_Construct(__REINTERPRET_CAST(_Tp*, _M_data + __i * sizeof(_Tp)), __val); in _CArray()
48 _Tp& operator [] (size_t __i) {
49 _STLP_ASSERT(__i < _Nb)
50 return *__REINTERPRET_CAST(_Tp*, _M_data + __i * sizeof(_Tp));
D_threads.c124 unsigned __i; in _M_do_lock() local
126 for (__i = 0; __i < __my_spin_max; ++__i) { in _M_do_lock()
127 if (__i < __my_last_spins/2 || *__lock) { in _M_do_lock()
136 _STLP_mutex_spin<0>::__last = __i; in _M_do_lock()
146 for (__i = 0 ;; ++__i) { in _M_do_lock()
147 int __log_nsec = __i + 6; in _M_do_lock()
153 _S_nsec_sleep(__log_nsec, __i); in _M_do_lock()
D_bitset.c81 for (size_t __i = 1; __i < _Nw; ++__i) in _M_do_to_ulong() local
82 if (_M_w[__i]) in _M_do_to_ulong()
89 for ( size_t __i = 0; __i < _Nw; __i++ ) { in _M_do_find_first() local
90 _WordT __thisword = _M_w[__i]; in _M_do_find_first()
97 return __i*__BITS_PER_WORD + __j*CHAR_BIT + in _M_do_find_first()
120 size_t __i = _S_whichword(__prev); in _M_do_find_next() local
121 _WordT __thisword = _M_w[__i]; in _M_do_find_next()
134 return __i*__BITS_PER_WORD + __j*CHAR_BIT + in _M_do_find_next()
142 ++__i; in _M_do_find_next()
143 for ( ; __i < _Nw; ++__i ) { in _M_do_find_next()
[all …]
D_bitset.h139 for ( size_t __i = 0; __i < _Nw; __i++ ) { in _M_do_and() local
140 _M_w[__i] &= __x._M_w[__i]; in _M_do_and()
145 for ( size_t __i = 0; __i < _Nw; __i++ ) { in _M_do_or() local
146 _M_w[__i] |= __x._M_w[__i]; in _M_do_or()
151 for ( size_t __i = 0; __i < _Nw; __i++ ) { in _M_do_xor() local
152 _M_w[__i] ^= __x._M_w[__i]; in _M_do_xor()
161 for ( size_t __i = 0; __i < _Nw; __i++ ) { in _M_do_flip() local
162 _M_w[__i] = ~_M_w[__i]; in _M_do_flip()
167 for ( size_t __i = 0; __i < _Nw; __i++ ) { in _M_do_set() local
168 _M_w[__i] = ~__STATIC_CAST(_WordT,0); in _M_do_set()
[all …]
D_list.c96 iterator __i = begin(); in resize() local
98 for ( ; __i != end() && __len < __new_size; ++__i, ++__len); in resize()
101 erase(__i, end()); in resize()
125 iterator __i = begin(); in _M_fill_assign() local
126 for ( ; __i != end() && __n > 0; ++__i, --__n) in _M_fill_assign()
127 *__i = __val; in _M_fill_assign()
131 erase(__i, end()); in _M_fill_assign()
218 int __i = 0; in _S_sort() local
219 while (__i < __fill && !__counter[__i].empty()) { in _S_sort()
220 _S_merge(__counter[__i], __carry, __comp); in _S_sort()
[all …]
Dchar_traits.h147 for (size_t __i = 0; __i < __n; ++__i) in compare() local
148 if (!eq(__s1[__i], __s2[__i])) in compare()
149 return __s1[__i] < __s2[__i] ? -1 : 1; in compare()
155 size_t __i(0); in length()
156 for (; !eq(__s[__i], _NullChar); ++__i) {} in length()
157 return __i; in length()
176 for (size_t __i = 0; __i < __n; ++__i) in assign() local
177 __s[__i] = __c; in assign()
D_rope.c192 int __i = -1; in _S_setcache() local
197 __x._M_path_end._M_data[++__i] = __path[__j++]; in _S_setcache()
199 __x._M_leaf_index = __i; in _S_setcache()
252 int __i; in _S_setcache_for_incr() local
253 for (__i = 0; __i < _S_path_cache_len-1; ++__i) { in _S_setcache_for_incr()
254 __x._M_path_end._M_data[__i] = __x._M_path_end._M_data[__i+1]; in _S_setcache_for_incr()
744 size_t __i; in operator() local
745 for (__i = 0; __i < __n; ++__i) { in operator()
746 if (__leaf[__i] == _M_pattern) { in operator()
747 _M_count += __i; return false; in operator()
[all …]
D_slist.c193 int __i = 0; in _Slist_sort() local
194 while (__i < __fill && !__counter[__i].empty()) { in _Slist_sort()
195 _STLP_PRIV _Slist_merge(__counter[__i], __carry, __comp); in _Slist_sort()
196 __carry.swap(__counter[__i]); in _Slist_sort()
197 ++__i; in _Slist_sort()
199 __carry.swap(__counter[__i]); in _Slist_sort()
200 if (__i == __fill) { in _Slist_sort()
209 for (int __i = 1; __i < __fill; ++__i) in _Slist_sort() local
210 _STLP_PRIV _Slist_merge(__counter[__i], __counter[__i - 1], __comp); in _Slist_sort()
D_string_hash.h38 for ( size_t __i = 0; __i < __len; ++__i) in __stl_string_hash() local
39 __h = /* 5 *__h */(__h << 2) + __h + __data[__i]; in __stl_string_hash()
D_complex.h124 value_type __i = _M_re * __z._M_im + _M_im * __z._M_re; member
126 _M_im = __i;
132 value_type __i; member
133 _div(_M_re, _M_im, __z._M_re, __z._M_im, __r, __i);
135 _M_im = __i;
154 value_type __i = _M_re * __z._M_im + _M_im * __z._M_re; member
156 _M_im = __i;
162 value_type __i; member
163 _div(_M_re, _M_im, __z._M_re, __z._M_im, __r, __i);
165 _M_im = __i;
[all …]
D_time_facets.c81 difference_type __i, __start = 0; in __match() local
91 for (__i = __start; __i < __n; ++__i) { in __match()
92 if (!__do_not_check[__i]) { in __match()
93 if (*__first == __name[__i][__pos]) { in __match()
94 if (__pos == (__name[__i].size() - 1)) { in __match()
95 __matching_name_index = __i; in __match()
96 __do_not_check[__i] = true; in __match()
97 if (__i == __start) ++__start; in __match()
104 __new_n = __i + 1; in __match()
107 __do_not_check[__i] = true; in __match()
[all …]
D_bvector.h131 void _M_advance (difference_type __i) {
132 difference_type __n = __i + _M_offset;
208 _Self& operator+=(difference_type __i) {
209 _M_advance(__i);
212 _Self& operator-=(difference_type __i) {
213 *this += -__i;
216 _Self operator+(difference_type __i) const {
218 return __tmp += __i;
220 _Self operator-(difference_type __i) const {
222 return __tmp -= __i;
[all …]
D_algo.c226 _ForwardIter __i = __first; in __search_n() local
227 ++__i; in __search_n()
228 while (__i != __last && __n != 0 && __pred(*__i, __val)) { in __search_n()
229 ++__i; in __search_n()
234 else if (__i != __last) in __search_n()
235 for (__first = ++__i; (__first != __last) && !__pred(*__first, __val); ++__first) {} in __search_n()
463 for (_Distance __i = 0; __i < __d; __i++) { in __rotate_aux() local
544 for (_RandomAccessIter __i = __first + 1; __i != __last; ++__i) in random_shuffle() local
545 iter_swap(__i, __first + _STLP_PRIV __random_number((__i - __first) + 1)); in random_shuffle()
553 for (_RandomAccessIter __i = __first + 1; __i != __last; ++__i) in random_shuffle() local
[all …]
/ndk/sources/cxx-stl/llvm-libc++/libcxx/src/
Dvalarray.cpp25 for (size_t __i = 0; __i < __size_.size(); ++__i) in __init() local
26 __k *= __size_[__i]; in __init()
34 size_t __i = __indices.size() - 1; in __init() local
37 if (++__indices[__i] < __size_[__i]) in __init()
40 __1d_[__k] = __1d_[__k-1] + __stride_[__i]; in __init()
41 for (size_t __j = __i + 1; __j != __indices.size(); ++__j) in __init()
47 if (__i == 0) in __init()
49 __indices[__i--] = 0; in __init()
Ddebug.cpp111 __libcpp_db::__find_c_from_i(void* __i) const in __find_c_from_i()
116 __i_node* i = __find_iterator(__i); in __find_c_from_i()
122 __libcpp_db::__insert_ic(void* __i, const void* __c) in __insert_ic() argument
139 __i_node* i = __insert_iterator(__i); in __insert_ic()
193 __libcpp_db::__erase_i(void* __i) in __erase_i() argument
200 size_t hi = hash<void*>()(__i) % static_cast<size_t>(__iend_ - __ibeg_); in __erase_i()
205 while (p->__i_ != __i) in __erase_i()
347 __libcpp_db::__iterator_copy(void* __i, const void* __i0) in __iterator_copy() argument
352 __i_node* i = __find_iterator(__i); in __iterator_copy()
356 i = __insert_iterator(__i); in __iterator_copy()
[all …]
/ndk/sources/cxx-stl/llvm-libc++/libcxx/include/
D__debug51 __i_node(void* __i, __i_node* __next, __c_node* __c)
52 : __i_(__i), __next_(__next), __c_(__c) {}
83 void __add(__i_node* __i);
84 _LIBCPP_HIDDEN void __remove(__i_node* __i);
102 _C_node<_Cont>::__dereferenceable(const void* __i) const
105 const iterator* __j = static_cast<const iterator*>(__i);
112 _C_node<_Cont>::__decrementable(const void* __i) const
115 const iterator* __j = static_cast<const iterator*>(__i);
122 _C_node<_Cont>::__addable(const void* __i, ptrdiff_t __n) const
125 const iterator* __j = static_cast<const iterator*>(__i);
[all …]
Dvalarray423 result_type operator[](size_t __i) const {return __op_(__a0_[__i]);}
444 value_type operator[](size_t __i) const {return __op_(__a0_[__i], __a1_[__i]);}
668 result_type operator[](size_t __i) const
669 {return __expr_[__start_ + __i * __stride_];}
715 ptrdiff_t __i = static_cast<ptrdiff_t>(__j);
716 ptrdiff_t __m = (__sn_ * __i - __ul_) >> _Np;
717 return (__expr_[(__i + __n_) & __m] & __m) | (value_type() & ~__m);
763 result_type operator[](size_t __i) const
765 if (__i < __m_)
766 return __expr_[__i + __o1_];
[all …]
Dbitset229 for (size_t __i = 0; __i < sizeof(__t)/sizeof(__t[0]); ++__i, __v >>= __bits_per_word)
230 __t[__i] = static_cast<__storage_type>(__v);
271 for (size_type __i = 0; __i < _N_words; ++__i)
272 __first_[__i] &= __v.__first_[__i];
280 for (size_type __i = 0; __i < _N_words; ++__i)
281 __first_[__i] |= __v.__first_[__i];
289 for (size_type __i = 0; __i < _N_words; ++__i)
290 __first_[__i] ^= __v.__first_[__i];
317 const_iterator __i = _VSTD::find(__make_iter(sizeof(unsigned long) * CHAR_BIT), __e, true);
318 if (__i != __e)
[all …]
Dalgorithm1075 _ForwardIterator __i = __first;
1076 while (++__i != __last)
1078 if (__pred(*__first, *__i))
1080 __first = __i;
1271 for (_ForwardIterator1 __i = __first1; __i != __last1; ++__i)
1273 // Have we already counted the number of *__i in [f1, l1)?
1274 for (_ForwardIterator1 __j = __first1; __j != __i; ++__j)
1275 if (__pred(*__j, *__i))
1278 // Count number of *__i in [f2, l2)
1281 if (__pred(*__i, *__j))
[all …]
Dlist728 const_iterator* __i = static_cast<const_iterator*>((*__p)->__i_);
729 if (__i->__ptr_ != __l)
780 const_iterator* __i = static_cast<const_iterator*>((*__p)->__i_);
781 if (__i->__ptr_ == static_cast<__node_pointer>(
794 const_iterator* __i = static_cast<const_iterator*>((*__p)->__i_);
795 if (__i->__ptr_ == static_cast<__node_pointer>(
1014 void splice(const_iterator __p, list& __c, const_iterator __i);
1017 void splice(const_iterator __p, list&& __c, const_iterator __i)
1018 {splice(__p, __c, __i);}
1054 bool __dereferenceable(const const_iterator* __i) const;
[all …]
D__hash_table127 __hash_iterator(const __hash_iterator& __i)
128 : __node_(__i.__node_)
130 __get_db()->__iterator_copy(this, &__i);
140 __hash_iterator& operator=(const __hash_iterator& __i)
142 if (this != &__i)
144 __get_db()->__iterator_copy(this, &__i);
145 __node_ = __i.__node_;
274 __hash_const_iterator(const __hash_const_iterator& __i)
275 : __node_(__i.__node_)
277 __get_db()->__iterator_copy(this, &__i);
[all …]
/ndk/sources/cxx-stl/stlport/src/
Dallocators.cpp404 for (size_t __i = _p_size; __i <= (size_t)_MAX_BYTES; __i += (size_t)_ALIGN) { in _S_chunk_alloc() local
405 __my_free_list = _S_free_list + _S_FREELIST_INDEX(__i); in _S_chunk_alloc()
410 _S_end_free = _S_start_free + __i; in _S_chunk_alloc()
598 for (size_t __i = _p_size; __i <= (size_t)_MAX_BYTES; __i += (size_t)_ALIGN) { in _S_chunk_alloc() local
599 _Obj* __p = _S_free_list[_S_FREELIST_INDEX(__i)].pop(); in _S_chunk_alloc()
601 if (__i < sizeof(_FreeBlockHeader)) { in _S_chunk_alloc()
604 __nobjs = (int)(__i/_p_size); in _S_chunk_alloc()
606 size_t __bytes_left = __i - __total_bytes; in _S_chunk_alloc()
616 __newblock->_M_end = __REINTERPRET_CAST(char*, __p) + __i; in _S_chunk_alloc()
676 for (size_t __i = 0; __i < _STLP_NFREELISTS; ++__i) { in _S_chunk_dealloc() local
[all …]

123