| /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...] |
| _deque.h | 492 void _M_initialize(size_type __n, const value_type& __val = _STLP_DEFAULT_CONSTRUCTED(_Tp)) {
494 _M_fill_initialize(__val, _TrivialInit());
500 deque(size_type __n, const value_type& __val, const allocator_type& __a = allocator_type())
507 deque(size_type __n, const value_type& __val)
509 { _M_fill_initialize(__val, __false_type()); }
510 deque(size_type __n, const value_type& __val, const allocator_type& __a)
513 { _M_fill_initialize(__val, __false_type()); }
587 void _M_fill_assign(size_type __n, const _Tp& __val) {
589 _STLP_STD::fill(begin(), end(), __val); local
590 insert(end(), __n - size(), __val); local
594 _STLP_STD::fill(begin(), end(), __val); local
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/bits/ |
| stl_algo.h | 137 const _Tp& __val, input_iterator_tag)
139 while (__first != __last && !(*__first == __val))
159 const _Tp& __val, random_access_iterator_tag)
166 if (*__first == __val)
170 if (*__first == __val)
174 if (*__first == __val)
178 if (*__first == __val)
186 if (*__first == __val)
190 if (*__first == __val)
194 if (*__first == __val)
2095 __val = _GLIBCXX_MOVE(*__last); local
2114 __val = _GLIBCXX_MOVE(*__last); local
2140 __val = _GLIBCXX_MOVE(*__i); local
2162 __val = _GLIBCXX_MOVE(*__i); local
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/bits/ |
| stl_algo.h | 137 const _Tp& __val, input_iterator_tag)
139 while (__first != __last && !(*__first == __val))
159 const _Tp& __val, random_access_iterator_tag)
166 if (*__first == __val)
170 if (*__first == __val)
174 if (*__first == __val)
178 if (*__first == __val)
186 if (*__first == __val)
190 if (*__first == __val)
194 if (*__first == __val)
2095 __val = _GLIBCXX_MOVE(*__last); local
2114 __val = _GLIBCXX_MOVE(*__last); local
2140 __val = _GLIBCXX_MOVE(*__i); local
2162 __val = _GLIBCXX_MOVE(*__i); local
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/bits/ |
| stl_algo.h | 137 const _Tp& __val, input_iterator_tag)
139 while (__first != __last && !(*__first == __val))
159 const _Tp& __val, random_access_iterator_tag)
166 if (*__first == __val)
170 if (*__first == __val)
174 if (*__first == __val)
178 if (*__first == __val)
186 if (*__first == __val)
190 if (*__first == __val)
194 if (*__first == __val)
2095 __val = _GLIBCXX_MOVE(*__last); local
2114 __val = _GLIBCXX_MOVE(*__last); local
2140 __val = _GLIBCXX_MOVE(*__i); local
2162 __val = _GLIBCXX_MOVE(*__i); local
[all...] |
| /prebuilts/ndk/current/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...] |
| _deque.h | 492 void _M_initialize(size_type __n, const value_type& __val = _STLP_DEFAULT_CONSTRUCTED(_Tp)) {
494 _M_fill_initialize(__val, _TrivialInit());
500 deque(size_type __n, const value_type& __val, const allocator_type& __a = allocator_type())
507 deque(size_type __n, const value_type& __val)
509 { _M_fill_initialize(__val, __false_type()); }
510 deque(size_type __n, const value_type& __val, const allocator_type& __a)
513 { _M_fill_initialize(__val, __false_type()); }
587 void _M_fill_assign(size_type __n, const _Tp& __val) {
589 _STLP_STD::fill(begin(), end(), __val); local
590 insert(end(), __n - size(), __val); local
594 _STLP_STD::fill(begin(), end(), __val); local
[all...] |
| /prebuilts/ndk/current/sources/cxx-stl/gnu-libstdc++/4.9/include/bits/ |
| stl_algo.h | 1858 __val = _GLIBCXX_MOVE(*__last); local
1883 __val = _GLIBCXX_MOVE(*__i); local
[all...] |
| /external/valgrind/perf/ |
| test_input_for_tinycc.c | 185 __extension__ typedef struct { int __val[2]; } __fsid_t; member in struct:__anon26346
345 unsigned long int __val[(1024 / (8 * sizeof (unsigned long int)))]; member in struct:__anon26347
[all...] |
