Searched defs:__i (Results 26 - 39 of 39) sorted by relevance

12

/external/stlport/stlport/stl/
H A D_bvector.h131 void _M_advance (difference_type __i) { argument
132 difference_type __n = __i + _M_offset;
208 _Self& operator+=(difference_type __i) { argument
209 _M_advance(__i);
212 _Self& operator-=(difference_type __i) { argument
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;
227 operator [](difference_type __i) argument
406 iterator __i = _STLP_STD::copy(begin(), __position, iterator(__q, 0)); local
459 iterator __i = _STLP_STD::copy(begin(), __position, iterator(__q, 0)); local
732 iterator __i = _STLP_STD::copy(begin(), __position, iterator(__q, 0)); local
753 iterator __i = _STLP_STD::copy(begin(), __position, iterator(__q, 0)); local
774 iterator __i = _STLP_STD::copy(begin(), __position, iterator(__q, 0)); local
[all...]
H A D_list.h610 void splice(iterator __pos, _Self& __x, iterator __i) { argument
611 iterator __j = __i;
613 if (__pos == __i || __pos == __j) return;
615 _STLP_PRIV _List_global_inst::_Transfer(__pos._M_node, __i._M_node, __j._M_node);
618 insert(__pos, *__i);
619 __x.erase(__i);
H A D_rope.c192 int __i = -1; local
197 __x._M_path_end._M_data[++__i] = __path[__j++];
199 __x._M_leaf_index = __i;
252 int __i; local
253 for (__i = 0; __i < _S_path_cache_len-1; ++__i) {
254 __x._M_path_end._M_data[__i] = __x._M_path_end._M_data[__i+1];
744 size_t __i; local
777 size_t __i; local
1031 int __i; local
1083 int __i; // forest[0..__i-1] is empty local
1123 _S_fetch(_RopeRep* __r, size_type __i) argument
1170 _S_fetch_ptr(_RopeRep* __r, size_type __i) argument
[all...]
H A D_slist.h484 for (size_type __i = 0; __i < __n; ++__i)
751 // Linear in distance(begin(), __pos), and in distance(__x.begin(), __i).
752 void splice(iterator __pos, _Self& __x, iterator __i) { argument
755 _STLP_PRIV _Sl_global_inst::__previous(&__x._M_head._M_data, __i._M_node),
756 __i._M_node);
759 insert(__pos, *__i);
760 __x.erase(__i);
888 insert_iterator(_Container& __x, typename _Container::iterator __i) argument
[all...]
H A D_tree.h510 iterator __i = find(__x); local
511 if (__i._M_node != &this->_M_header._M_data) {
512 erase(__i);
H A D_vector.h613 pointer __i = _STLP_PRIV __copy_ptrs(__last, this->_M_finish, __first, _TrivialCopy()); local
614 _STLP_STD::_Destroy_Range(__i, this->_M_finish);
615 this->_M_finish = __i;
H A D_algo.c226 _ForwardIter __i = __first; local
227 ++__i;
228 while (__i != __last && __n != 0 && __pred(*__i, __val)) {
229 ++__i;
234 else if (__i != __last)
235 for (__first = ++__i; (__first != __last) && !__pred(*__first, __val); ++__first) {}
463 for (_Distance __i = 0; __i < __d; __i
[all...]
H A D_rope.h258 size_t __i = _M_buf_count; local
260 for (; __j < __len; __i++, __j++) {
261 _M_buffer[__i] = __s[__j];
791 // (_M_path_directions >> __i) & 1 is 1
792 // if we got from _M_path_end[leaf_index - __i - 1]
793 // to _M_path_end[leaf_index - __i] by going to the
1743 void insert(size_t __p, const _CharT* __i, size_t __n) { argument
1748 _S_concat_char_iter(__left, __i, __n));
1768 void insert(size_t __p, const _CharT* __i, const _CharT* __j) { argument
1769 _Self __r(__i, __
1773 insert(size_t __p, const const_iterator& __i, const const_iterator& __j) argument
1779 insert(size_t __p, const iterator& __i, const iterator& __j) argument
1791 replace(size_t __p, size_t __n, const _CharT* __i, size_t __i_len) argument
1807 replace(size_t __p, size_t __n, const _CharT* __i, const _CharT* __j) argument
1813 replace(size_t __p, size_t __n, const const_iterator& __i, const const_iterator& __j) argument
1819 replace(size_t __p, size_t __n, const iterator& __i, const iterator& __j) argument
1836 replace(size_t __p, const _CharT* __i, size_t __i_len) argument
1844 replace(size_t __p, const _CharT* __i, const _CharT* __j) argument
1848 replace(size_t __p, const const_iterator& __i, const const_iterator& __j) argument
1853 replace(size_t __p, const iterator& __i, const iterator& __j) argument
1880 insert(const iterator& __p, const _CharT* __i, size_t __n) argument
1882 insert(const iterator& __p, const _CharT* __i, const _CharT* __j) argument
1885 insert(const iterator& __p, const const_iterator& __i, const const_iterator& __j) argument
1888 insert(const iterator& __p, const iterator& __i, const iterator& __j) argument
1901 replace(const iterator& __p, const iterator& __q, const _CharT* __i, size_t __n) argument
1904 replace(const iterator& __p, const iterator& __q, const _CharT* __i, const _CharT* __j) argument
1907 replace(const iterator& __p, const iterator& __q, const const_iterator& __i, const const_iterator& __j) argument
1910 replace(const iterator& __p, const iterator& __q, const iterator& __i, const iterator& __j) argument
1921 replace(const iterator& __p, const _CharT* __i, size_t __n) argument
1923 replace(const iterator& __p, const _CharT* __i, const _CharT* __j) argument
1925 replace(const iterator& __p, const_iterator __i, const_iterator __j) argument
1928 replace(const iterator& __p, iterator __i, iterator __j) argument
2304 __mutable_reference_at(crope& __c, size_t __i) argument
2308 __mutable_reference_at(wrope& __c, size_t __i) argument
[all...]
/external/clang/lib/Headers/
H A Dxmmintrin.h784 _mm_setcsr(unsigned int __i) argument
786 __builtin_ia32_ldmxcsr(__i);
H A Davxintrin.h1037 _mm256_set1_epi32(int __i) argument
1039 return (__m256i)(__v8si){ __i, __i, __i, __i, __i, __i, __i, __i };
H A Demmintrin.h1125 _mm_set1_epi32(int __i) argument
1127 return (__m128i)(__v4si){ __i, __i, __i, __i };
/external/clang/lib/include/
H A Dxmmintrin.h784 _mm_setcsr(unsigned int __i) argument
786 __builtin_ia32_ldmxcsr(__i);
H A Davxintrin.h1037 _mm256_set1_epi32(int __i) argument
1039 return (__m256i)(__v8si){ __i, __i, __i, __i, __i, __i, __i, __i };
H A Demmintrin.h1125 _mm_set1_epi32(int __i) argument
1127 return (__m128i)(__v4si){ __i, __i, __i, __i };

Completed in 1667 milliseconds

12