| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/sysroot/usr/include/asm/ |
| posix_types_32.h | 45 int __val[2];
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/sysroot/usr/include/rpcsvc/ |
| ypclnt.h | 57 char *__val, int __vallen, char *__data);
|
| /prebuilts/ndk/android-ndk-r4/platforms/android-5/arch-x86/usr/include/asm/ |
| posix_types_32.h | 50 int __val[2];
|
| /prebuilts/ndk/android-ndk-r4/platforms/android-8/arch-x86/usr/include/asm/ |
| posix_types_32.h | 50 int __val[2];
|
| /prebuilts/ndk/android-ndk-r5/sources/cxx-stl/stlport/stlport/stl/ |
| _vector.h | 227 void _M_initialize(size_type __n, const _Tp& __val = _STLP_DEFAULT_CONSTRUCTED(_Tp))
228 { this->_M_finish = _STLP_PRIV __uninitialized_init(this->_M_start, __n, __val); }
233 vector(size_type __n, const _Tp& __val, const allocator_type& __a = allocator_type())
238 vector(size_type __n, const _Tp& __val)
240 { this->_M_finish = _STLP_PRIV __uninitialized_fill_n(this->_M_start, __n, __val); }
241 vector(size_type __n, const _Tp& __val, const allocator_type& __a)
244 { this->_M_finish = _STLP_PRIV __uninitialized_fill_n(this->_M_start, __n, __val); }
261 void _M_initialize_aux(_Integer __n, _Integer __val,
266 this->_M_finish = _STLP_PRIV __uninitialized_fill_n(this->_M_start, __n, __val);
315 void assign(size_type __n, const _Tp& __val) { _M_fill_assign(__n, __val);
[all...] |
| _algo.c | 155 _Integer __count, const _Tp& __val, _BinaryPred __pred,
168 while ( !__pred(*__lookAhead, __val) ) { // the skip loop...
182 for (__backTrack = __lookAhead; __pred(*--__backTrack, __val); ) {
193 while ( __pred(*__lookAhead, __val) ) {
200 } while (__pred(*--__backTrack, __val));
221 _Integer __count, const _Tp& __val, _BinaryPred __pred,
223 for (; (__first != __last) && !__pred(*__first, __val); ++__first) {}
228 while (__i != __last && __n != 0 && __pred(*__i, __val)) {
235 for (__first = ++__i; (__first != __last) && !__pred(*__first, __val); ++__first) {}
244 // search_n. Search for __count consecutive copies of __val
298 _Tp __val = *__first; local
[all...] |
| /prebuilts/ndk/android-ndk-r6/platforms/android-9/arch-x86/usr/include/asm/ |
| posix_types_32.h | 50 int __val[2];
|
| /prebuilts/ndk/android-ndk-r6/sources/cxx-stl/stlport/stlport/stl/ |
| _vector.h | 227 void _M_initialize(size_type __n, const _Tp& __val = _STLP_DEFAULT_CONSTRUCTED(_Tp))
228 { this->_M_finish = _STLP_PRIV __uninitialized_init(this->_M_start, __n, __val); }
233 vector(size_type __n, const _Tp& __val, const allocator_type& __a = allocator_type())
238 vector(size_type __n, const _Tp& __val)
240 { this->_M_finish = _STLP_PRIV __uninitialized_fill_n(this->_M_start, __n, __val); }
241 vector(size_type __n, const _Tp& __val, const allocator_type& __a)
244 { this->_M_finish = _STLP_PRIV __uninitialized_fill_n(this->_M_start, __n, __val); }
261 void _M_initialize_aux(_Integer __n, _Integer __val,
266 this->_M_finish = _STLP_PRIV __uninitialized_fill_n(this->_M_start, __n, __val);
315 void assign(size_type __n, const _Tp& __val) { _M_fill_assign(__n, __val);
[all...] |
| _algo.c | 155 _Integer __count, const _Tp& __val, _BinaryPred __pred,
168 while ( !__pred(*__lookAhead, __val) ) { // the skip loop...
182 for (__backTrack = __lookAhead; __pred(*--__backTrack, __val); ) {
193 while ( __pred(*__lookAhead, __val) ) {
200 } while (__pred(*--__backTrack, __val));
221 _Integer __count, const _Tp& __val, _BinaryPred __pred,
223 for (; (__first != __last) && !__pred(*__first, __val); ++__first) {}
228 while (__i != __last && __n != 0 && __pred(*__i, __val)) {
235 for (__first = ++__i; (__first != __last) && !__pred(*__first, __val); ++__first) {}
244 // search_n. Search for __count consecutive copies of __val
298 _Tp __val = *__first; local
[all...] |
| /prebuilts/ndk/android-ndk-r7/platforms/android-14/arch-x86/usr/include/asm/ |
| posix_types_32.h | 50 int __val[2];
|
| /prebuilts/ndk/android-ndk-r7/platforms/android-9/arch-x86/usr/include/asm/ |
| posix_types_32.h | 50 int __val[2];
|
| /prebuilts/ndk/android-ndk-r7/sources/cxx-stl/stlport/stlport/stl/ |
| _vector.h | 227 void _M_initialize(size_type __n, const _Tp& __val = _STLP_DEFAULT_CONSTRUCTED(_Tp))
228 { this->_M_finish = _STLP_PRIV __uninitialized_init(this->_M_start, __n, __val); }
233 vector(size_type __n, const _Tp& __val, const allocator_type& __a = allocator_type())
238 vector(size_type __n, const _Tp& __val)
240 { this->_M_finish = _STLP_PRIV __uninitialized_fill_n(this->_M_start, __n, __val); }
241 vector(size_type __n, const _Tp& __val, const allocator_type& __a)
244 { this->_M_finish = _STLP_PRIV __uninitialized_fill_n(this->_M_start, __n, __val); }
261 void _M_initialize_aux(_Integer __n, _Integer __val,
266 this->_M_finish = _STLP_PRIV __uninitialized_fill_n(this->_M_start, __n, __val);
315 void assign(size_type __n, const _Tp& __val) { _M_fill_assign(__n, __val);
[all...] |
| _algo.c | 155 _Integer __count, const _Tp& __val, _BinaryPred __pred,
168 while ( !__pred(*__lookAhead, __val) ) { // the skip loop...
182 for (__backTrack = __lookAhead; __pred(*--__backTrack, __val); ) {
193 while ( __pred(*__lookAhead, __val) ) {
200 } while (__pred(*--__backTrack, __val));
221 _Integer __count, const _Tp& __val, _BinaryPred __pred,
223 for (; (__first != __last) && !__pred(*__first, __val); ++__first) {}
228 while (__i != __last && __n != 0 && __pred(*__i, __val)) {
235 for (__first = ++__i; (__first != __last) && !__pred(*__first, __val); ++__first) {}
244 // search_n. Search for __count consecutive copies of __val
298 _Tp __val = *__first; 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 | 181 const _Tp& __val, input_iterator_tag)
183 while (__first != __last && !(*__first == __val))
203 const _Tp& __val, random_access_iterator_tag)
210 if (*__first == __val)
214 if (*__first == __val)
218 if (*__first == __val)
222 if (*__first == __val)
230 if (*__first == __val)
234 if (*__first == __val)
238 if (*__first == __val)
2143 __val = *__i; local
2165 __val = *__i; local
[all...] |
| /prebuilts/ndk/android-ndk-r5/sources/cxx-stl/gnu-libstdc++/include/bits/ |
| stl_algo.h | 181 const _Tp& __val, input_iterator_tag)
183 while (__first != __last && !(*__first == __val))
203 const _Tp& __val, random_access_iterator_tag)
210 if (*__first == __val)
214 if (*__first == __val)
218 if (*__first == __val)
222 if (*__first == __val)
230 if (*__first == __val)
234 if (*__first == __val)
238 if (*__first == __val)
2143 __val = *__i; local
2165 __val = *__i; local
[all...] |
| /prebuilts/ndk/android-ndk-r6/sources/cxx-stl/gnu-libstdc++/include/bits/ |
| stl_algo.h | 181 const _Tp& __val, input_iterator_tag)
183 while (__first != __last && !(*__first == __val))
203 const _Tp& __val, random_access_iterator_tag)
210 if (*__first == __val)
214 if (*__first == __val)
218 if (*__first == __val)
222 if (*__first == __val)
230 if (*__first == __val)
234 if (*__first == __val)
238 if (*__first == __val)
2143 __val = *__i; local
2165 __val = *__i; local
[all...] |
| /prebuilts/ndk/android-ndk-r7/sources/cxx-stl/gnu-libstdc++/include/bits/ |
| stl_algo.h | 181 const _Tp& __val, input_iterator_tag)
183 while (__first != __last && !(*__first == __val))
203 const _Tp& __val, random_access_iterator_tag)
210 if (*__first == __val)
214 if (*__first == __val)
218 if (*__first == __val)
222 if (*__first == __val)
230 if (*__first == __val)
234 if (*__first == __val)
238 if (*__first == __val)
2143 __val = *__i; local
2165 __val = *__i; local
[all...] |
| /external/stlport/stlport/stl/ |
| _algo.c | 155 _Integer __count, const _Tp& __val, _BinaryPred __pred,
168 while ( !__pred(*__lookAhead, __val) ) { // the skip loop...
182 for (__backTrack = __lookAhead; __pred(*--__backTrack, __val); ) {
193 while ( __pred(*__lookAhead, __val) ) {
200 } while (__pred(*--__backTrack, __val));
221 _Integer __count, const _Tp& __val, _BinaryPred __pred,
223 for (; (__first != __last) && !__pred(*__first, __val); ++__first) {}
228 while (__i != __last && __n != 0 && __pred(*__i, __val)) {
235 for (__first = ++__i; (__first != __last) && !__pred(*__first, __val); ++__first) {}
244 // search_n. Search for __count consecutive copies of __val
298 _Tp __val = *__first; local
[all...] |
| _vector.c | 210 void vector<_Tp, _Alloc>::_M_fill_assign(size_t __n, const _Tp& __val) {
212 vector<_Tp, _Alloc> __tmp(__n, __val, get_allocator());
215 fill(begin(), end(), __val); local
216 this->_M_finish = _STLP_PRIV __uninitialized_fill_n(this->_M_finish, __n - size(), __val);
218 erase(_STLP_PRIV __fill_n(begin(), __n, __val), end());
|
| /external/stlport/stlport/stl/pointers/ |
| _slist.h | 145 void assign(size_type __n, const value_type& __val)
146 { _M_impl.assign(__n, cast_traits::to_storage_type_cref(__val)); }
152 void _M_assign_dispatch(_Integer __n, _Integer __val,
154 { _M_impl.assign(__n, __val); }
245 void _M_insert_after_dispatch(iterator __pos, _Integer __n, _Integer __val,
247 _M_impl.insert_after(_BaseIte(__pos._M_node), __n, __val); local
306 void _M_insert_dispatch(iterator __pos, _Integer __n, _Integer __val,
308 _M_impl.insert(_BaseIte(__pos._M_node), __n, __val); local
383 void remove(const value_type& __val) { _M_impl.remove(cast_traits::to_storage_type_cref(__val)); }
[all...] |
| /ndk/sources/cxx-stl/stlport/stlport/stl/ |
| _algo.c | 155 _Integer __count, const _Tp& __val, _BinaryPred __pred,
168 while ( !__pred(*__lookAhead, __val) ) { // the skip loop...
182 for (__backTrack = __lookAhead; __pred(*--__backTrack, __val); ) {
193 while ( __pred(*__lookAhead, __val) ) {
200 } while (__pred(*--__backTrack, __val));
221 _Integer __count, const _Tp& __val, _BinaryPred __pred,
223 for (; (__first != __last) && !__pred(*__first, __val); ++__first) {}
228 while (__i != __last && __n != 0 && __pred(*__i, __val)) {
235 for (__first = ++__i; (__first != __last) && !__pred(*__first, __val); ++__first) {}
244 // search_n. Search for __count consecutive copies of __val
298 _Tp __val = *__first; local
[all...] |
| /ndk/sources/cxx-stl/stlport/stlport/stl/pointers/ |
| _slist.h | 145 void assign(size_type __n, const value_type& __val)
146 { _M_impl.assign(__n, cast_traits::to_storage_type_cref(__val)); }
152 void _M_assign_dispatch(_Integer __n, _Integer __val,
154 { _M_impl.assign(__n, __val); }
245 void _M_insert_after_dispatch(iterator __pos, _Integer __n, _Integer __val,
247 _M_impl.insert_after(_BaseIte(__pos._M_node), __n, __val); local
306 void _M_insert_dispatch(iterator __pos, _Integer __n, _Integer __val,
308 _M_impl.insert(_BaseIte(__pos._M_node), __n, __val); local
383 void remove(const value_type& __val) { _M_impl.remove(cast_traits::to_storage_type_cref(__val)); }
[all...] |
| /prebuilts/ndk/android-ndk-r5/sources/cxx-stl/stlport/stlport/stl/pointers/ |
| _slist.h | 145 void assign(size_type __n, const value_type& __val)
146 { _M_impl.assign(__n, cast_traits::to_storage_type_cref(__val)); }
152 void _M_assign_dispatch(_Integer __n, _Integer __val,
154 { _M_impl.assign(__n, __val); }
245 void _M_insert_after_dispatch(iterator __pos, _Integer __n, _Integer __val,
247 _M_impl.insert_after(_BaseIte(__pos._M_node), __n, __val); local
306 void _M_insert_dispatch(iterator __pos, _Integer __n, _Integer __val,
308 _M_impl.insert(_BaseIte(__pos._M_node), __n, __val); local
383 void remove(const value_type& __val) { _M_impl.remove(cast_traits::to_storage_type_cref(__val)); }
[all...] |
| /prebuilts/ndk/android-ndk-r6/sources/cxx-stl/stlport/stlport/stl/pointers/ |
| _slist.h | 145 void assign(size_type __n, const value_type& __val)
146 { _M_impl.assign(__n, cast_traits::to_storage_type_cref(__val)); }
152 void _M_assign_dispatch(_Integer __n, _Integer __val,
154 { _M_impl.assign(__n, __val); }
245 void _M_insert_after_dispatch(iterator __pos, _Integer __n, _Integer __val,
247 _M_impl.insert_after(_BaseIte(__pos._M_node), __n, __val); local
306 void _M_insert_dispatch(iterator __pos, _Integer __n, _Integer __val,
308 _M_impl.insert(_BaseIte(__pos._M_node), __n, __val); local
383 void remove(const value_type& __val) { _M_impl.remove(cast_traits::to_storage_type_cref(__val)); }
[all...] |
| /prebuilts/ndk/android-ndk-r7/sources/cxx-stl/stlport/stlport/stl/pointers/ |
| _slist.h | 145 void assign(size_type __n, const value_type& __val)
146 { _M_impl.assign(__n, cast_traits::to_storage_type_cref(__val)); }
152 void _M_assign_dispatch(_Integer __n, _Integer __val,
154 { _M_impl.assign(__n, __val); }
245 void _M_insert_after_dispatch(iterator __pos, _Integer __n, _Integer __val,
247 _M_impl.insert_after(_BaseIte(__pos._M_node), __n, __val); local
306 void _M_insert_dispatch(iterator __pos, _Integer __n, _Integer __val,
308 _M_impl.insert(_BaseIte(__pos._M_node), __n, __val); local
383 void remove(const value_type& __val) { _M_impl.remove(cast_traits::to_storage_type_cref(__val)); }
[all...] |
