| /prebuilts/ndk/9/sources/cxx-stl/EH/stlport/stlport/stl/ |
| _tree.h | 510 iterator __i = find(__x); local
511 if (__i._M_node != &this->_M_header._M_data) {
512 erase(__i);
|
| _vector.h | 613 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;
|
| /external/stlport/stlport/stl/ |
| _algo.c | 226 _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...] |
| _bvector.h | 131 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;
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...] |
| _rope.c | 192 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
[all...] |
| /ndk/sources/cxx-stl/stlport/stlport/stl/ |
| _algo.c | 226 _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...] |
| _bvector.h | 131 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;
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...] |
| _rope.c | 192 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
[all...] |
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/bits/ |
| stl_algo.h | 385 _ForwardIterator __i = __first; local
386 ++__i;
387 while (__i != __last && __n != 1 && *__i == __val)
389 ++__i;
394 if (__i == __last)
396 __first = _GLIBCXX_STD_P::find(++__i, __last, __val);
473 _ForwardIterator __i = __first; local
474 ++__i;
475 while (__i != __last && __n != 1 && bool(__binary_pred(*__i, __val))
2801 _ForwardIterator __i = std::lower_bound(__first, __last, __val); local
2837 _ForwardIterator __i = std::lower_bound(__first, __last, __val, local
[all...] |
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/ext/ |
| ropeimpl.h | 173 int __i = -1; local
178 __x._M_path_end[++__i] = __path[__j++];
179 __x._M_leaf_index = __i;
237 int __i; local
238 for (__i = 0; __i < int(_S_path_cache_len) - 1; __i++)
239 __x._M_path_end[__i] = __x._M_path_end[__i+1];
876 size_t __i; local
911 size_t __i; local
986 size_t __i; local
1205 int __i; local
1269 int __i; \/\/ forest[0..__i-1] is empty local
[all...] |
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/ext/ |
| ropeimpl.h | 175 int __i = -1; local
180 __x._M_path_end[++__i] = __path[__j++];
181 __x._M_leaf_index = __i;
239 int __i; local
240 for (__i = 0; __i < int(_S_path_cache_len) - 1; __i++)
241 __x._M_path_end[__i] = __x._M_path_end[__i+1];
878 size_t __i; local
913 size_t __i; local
988 size_t __i; local
1207 int __i; local
1271 int __i; \/\/ forest[0..__i-1] is empty local
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/ext/ |
| ropeimpl.h | 175 int __i = -1; local
180 __x._M_path_end[++__i] = __path[__j++];
181 __x._M_leaf_index = __i;
239 int __i; local
240 for (__i = 0; __i < int(_S_path_cache_len) - 1; __i++)
241 __x._M_path_end[__i] = __x._M_path_end[__i+1];
878 size_t __i; local
913 size_t __i; local
988 size_t __i; local
1207 int __i; local
1271 int __i; \/\/ forest[0..__i-1] is empty local
[all...] |
| /prebuilts/ndk/5/sources/cxx-stl/gnu-libstdc++/include/bits/ |
| stl_algo.h | 385 _ForwardIterator __i = __first; local
386 ++__i;
387 while (__i != __last && __n != 1 && *__i == __val)
389 ++__i;
394 if (__i == __last)
396 __first = _GLIBCXX_STD_P::find(++__i, __last, __val);
473 _ForwardIterator __i = __first; local
474 ++__i;
475 while (__i != __last && __n != 1 && bool(__binary_pred(*__i, __val))
2801 _ForwardIterator __i = std::lower_bound(__first, __last, __val); local
2837 _ForwardIterator __i = std::lower_bound(__first, __last, __val, local
[all...] |
| /prebuilts/ndk/5/sources/cxx-stl/gnu-libstdc++/include/ext/ |
| ropeimpl.h | 173 int __i = -1; local
178 __x._M_path_end[++__i] = __path[__j++];
179 __x._M_leaf_index = __i;
237 int __i; local
238 for (__i = 0; __i < int(_S_path_cache_len) - 1; __i++)
239 __x._M_path_end[__i] = __x._M_path_end[__i+1];
876 size_t __i; local
911 size_t __i; local
986 size_t __i; local
1205 int __i; local
1269 int __i; \/\/ forest[0..__i-1] is empty local
[all...] |
| /prebuilts/ndk/5/sources/cxx-stl/stlport/stlport/stl/ |
| _algo.c | 226 _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...] |
| _bvector.h | 131 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;
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...] |
| _rope.c | 192 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
[all...] |
| /prebuilts/ndk/6/sources/cxx-stl/gnu-libstdc++/include/bits/ |
| stl_algo.h | 385 _ForwardIterator __i = __first; local
386 ++__i;
387 while (__i != __last && __n != 1 && *__i == __val)
389 ++__i;
394 if (__i == __last)
396 __first = _GLIBCXX_STD_P::find(++__i, __last, __val);
473 _ForwardIterator __i = __first; local
474 ++__i;
475 while (__i != __last && __n != 1 && bool(__binary_pred(*__i, __val))
2801 _ForwardIterator __i = std::lower_bound(__first, __last, __val); local
2837 _ForwardIterator __i = std::lower_bound(__first, __last, __val, local
[all...] |
| /prebuilts/ndk/6/sources/cxx-stl/gnu-libstdc++/include/ext/ |
| ropeimpl.h | 173 int __i = -1; local
178 __x._M_path_end[++__i] = __path[__j++];
179 __x._M_leaf_index = __i;
237 int __i; local
238 for (__i = 0; __i < int(_S_path_cache_len) - 1; __i++)
239 __x._M_path_end[__i] = __x._M_path_end[__i+1];
876 size_t __i; local
911 size_t __i; local
986 size_t __i; local
1205 int __i; local
1269 int __i; \/\/ forest[0..__i-1] is empty local
[all...] |
| /prebuilts/ndk/6/sources/cxx-stl/stlport/stlport/stl/ |
| _algo.c | 226 _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...] |
| _bvector.h | 131 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;
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...] |
| _rope.c | 192 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
[all...] |
| /prebuilts/ndk/7/sources/cxx-stl/gnu-libstdc++/include/bits/ |
| stl_algo.h | 385 _ForwardIterator __i = __first; local
386 ++__i;
387 while (__i != __last && __n != 1 && *__i == __val)
389 ++__i;
394 if (__i == __last)
396 __first = _GLIBCXX_STD_P::find(++__i, __last, __val);
473 _ForwardIterator __i = __first; local
474 ++__i;
475 while (__i != __last && __n != 1 && bool(__binary_pred(*__i, __val))
2801 _ForwardIterator __i = std::lower_bound(__first, __last, __val); local
2837 _ForwardIterator __i = std::lower_bound(__first, __last, __val, local
[all...] |
| /prebuilts/ndk/7/sources/cxx-stl/gnu-libstdc++/include/ext/ |
| ropeimpl.h | 173 int __i = -1; local
178 __x._M_path_end[++__i] = __path[__j++];
179 __x._M_leaf_index = __i;
237 int __i; local
238 for (__i = 0; __i < int(_S_path_cache_len) - 1; __i++)
239 __x._M_path_end[__i] = __x._M_path_end[__i+1];
876 size_t __i; local
911 size_t __i; local
986 size_t __i; local
1205 int __i; local
1269 int __i; \/\/ forest[0..__i-1] is empty local
[all...] |
| /prebuilts/ndk/7/sources/cxx-stl/stlport/stlport/stl/ |
| _algo.c | 226 _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...] |
