Home	Sort by relevance Sort by last modified time

Full Search Definition Symbol File Path History   | | Help

    Searched defs:__val (Results 151 - 175 of 183) sorted by null

1 2 3 4 5 67 8

/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.6/x86_64-linux/include/c++/4.6/bits/
stl_deque.h	1705 std::fill(begin(), end(), __val); local 1706 insert(end(), __n - size(), __val); local 1711 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-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/5/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...]
stl_deque.h	849 assign(size_type __n, const value_type& __val) 850 { _M_fill_assign(__n, __val); } 1542 std::fill(begin(), end(), __val); local 1543 insert(end(), __n - size(), __val); local 1548 std::fill(begin(), end(), __val); local     [all...]
/prebuilts/ndk/5/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/6/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...]
stl_deque.h	849 assign(size_type __n, const value_type& __val) 850 { _M_fill_assign(__n, __val); } 1542 std::fill(begin(), end(), __val); local 1543 insert(end(), __n - size(), __val); local 1548 std::fill(begin(), end(), __val); local     [all...]
/prebuilts/ndk/6/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/7/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...]
stl_deque.h	849 assign(size_type __n, const value_type& __val) 850 { _M_fill_assign(__n, __val); } 1542 std::fill(begin(), end(), __val); local 1543 insert(end(), __n - size(), __val); local 1548 std::fill(begin(), end(), __val); local     [all...]
/prebuilts/ndk/7/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/8/sources/cxx-stl/gnu-libstdc++/4.4.3/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...]
stl_deque.h	849 assign(size_type __n, const value_type& __val) 850 { _M_fill_assign(__n, __val); } 1538 std::fill(begin(), end(), __val); local 1539 insert(end(), __n - size(), __val); local 1544 std::fill(begin(), end(), __val); local     [all...]
/prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/bits/
stl_deque.h	1705 std::fill(begin(), end(), __val); local 1706 insert(end(), __n - size(), __val); local 1711 std::fill(begin(), end(), __val); local     [all...]
/prebuilts/ndk/8/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/9/sources/cxx-stl/EH/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/9/sources/cxx-stl/gnu-libstdc++/4.6/include/bits/
stl_deque.h	1705 std::fill(begin(), end(), __val); local 1706 insert(end(), __n - size(), __val); local 1711 std::fill(begin(), end(), __val); local     [all...]

Completed in 2331 milliseconds

1 2 3 4 5 67 8