Searched defs:__last (Results 1 - 25 of 559) sorted by relevance

1234567891011>>

/prebuilts/ndk/current/sources/cxx-stl/stlport/src/
H A Dbitset.cpp31 const unsigned char *__last)
89 while ( __first < __last ) {
30 _S_count(const unsigned char *__first, const unsigned char *__last) argument
/prebuilts/ndk/r11/sources/cxx-stl/stlport/src/
H A Dbitset.cpp31 const unsigned char *__last)
89 while ( __first < __last ) {
30 _S_count(const unsigned char *__first, const unsigned char *__last) argument
/prebuilts/ndk/r13/sources/cxx-stl/stlport/src/
H A Dbitset.cpp31 const unsigned char *__last)
89 while ( __first < __last ) {
30 _S_count(const unsigned char *__first, const unsigned char *__last) argument
/prebuilts/ndk/current/sources/cxx-stl/stlport/stlport/stl/
H A D_heap.h39 push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last);
44 push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,
54 __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, argument
58 __adjust_heap(__first, _Distance(0), _Distance(__last - __first), __val);
63 _RandomAccessIterator __last);
74 __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, argument
79 __adjust_heap(__first, _Distance(0), _Distance(__last - __first),
86 _RandomAccessIterator __last, _Compare __comp);
90 make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last);
95 _RandomAccessIterator __last, _Compar
99 sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) argument
108 sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) argument
[all...]
H A D_threads.c61 unsigned _STLP_mutex_spin<__inst>::__last = 0; member in class:__inst
122 unsigned __my_last_spins = _STLP_mutex_spin<0>::__last;
136 _STLP_mutex_spin<0>::__last = __i; member in class:_STLP_mutex_spin
/prebuilts/ndk/r10/sources/cxx-stl/stlport/stlport/stl/
H A D_heap.h39 push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last);
44 push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,
54 __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, argument
58 __adjust_heap(__first, _Distance(0), _Distance(__last - __first), __val);
63 _RandomAccessIterator __last);
74 __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, argument
79 __adjust_heap(__first, _Distance(0), _Distance(__last - __first),
86 _RandomAccessIterator __last, _Compare __comp);
90 make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last);
95 _RandomAccessIterator __last, _Compar
99 sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) argument
108 sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) argument
[all...]
/prebuilts/ndk/r11/sources/cxx-stl/stlport/stlport/stl/
H A D_heap.h39 push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last);
44 push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,
54 __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, argument
58 __adjust_heap(__first, _Distance(0), _Distance(__last - __first), __val);
63 _RandomAccessIterator __last);
74 __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, argument
79 __adjust_heap(__first, _Distance(0), _Distance(__last - __first),
86 _RandomAccessIterator __last, _Compare __comp);
90 make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last);
95 _RandomAccessIterator __last, _Compar
99 sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) argument
108 sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) argument
[all...]
/prebuilts/ndk/r13/sources/cxx-stl/stlport/stlport/stl/
H A D_heap.h39 push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last);
44 push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,
54 __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, argument
58 __adjust_heap(__first, _Distance(0), _Distance(__last - __first), __val);
63 _RandomAccessIterator __last);
74 __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, argument
79 __adjust_heap(__first, _Distance(0), _Distance(__last - __first),
86 _RandomAccessIterator __last, _Compare __comp);
90 make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last);
95 _RandomAccessIterator __last, _Compar
99 sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) argument
108 sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) argument
[all...]
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/bits/
H A Dstl_construct.h100 __destroy(_ForwardIterator __first, _ForwardIterator __last) argument
102 for (; __first != __last; ++__first)
122 _Destroy(_ForwardIterator __first, _ForwardIterator __last) argument
127 __destroy(__first, __last);
138 _Destroy(_ForwardIterator __first, _ForwardIterator __last, argument
142 for (; __first != __last; ++__first)
148 _Destroy(_ForwardIterator __first, _ForwardIterator __last, argument
151 _Destroy(__first, __last);
H A Dstl_iterator_base_funcs.h73 __distance(_InputIterator __first, _InputIterator __last, argument
80 while (__first != __last)
90 __distance(_RandomAccessIterator __first, _RandomAccessIterator __last, argument
96 return __last - __first;
102 * @param __last An input iterator.
105 * Returns @c n such that __first + n == __last. This requires
106 * that @p __last must be reachable from @p __first. Note that @c
114 distance(_InputIterator __first, _InputIterator __last) argument
117 return std::__distance(__first, __last,
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/profile/impl/
H A Dprofiler_algos.h84 __for_each(_InputIterator __first, _InputIterator __last, _Function __f) argument
86 for (; __first != __last; ++__first)
94 __remove(_ForwardIterator __first, _ForwardIterator __last, argument
97 if(__first == __last)
101 for(; __first != __last; ++__first)
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/bits/
H A Dstl_construct.h100 __destroy(_ForwardIterator __first, _ForwardIterator __last) argument
102 for (; __first != __last; ++__first)
122 _Destroy(_ForwardIterator __first, _ForwardIterator __last) argument
127 __destroy(__first, __last);
138 _Destroy(_ForwardIterator __first, _ForwardIterator __last, argument
142 for (; __first != __last; ++__first)
148 _Destroy(_ForwardIterator __first, _ForwardIterator __last, argument
151 _Destroy(__first, __last);
H A Dstl_iterator_base_funcs.h73 __distance(_InputIterator __first, _InputIterator __last, argument
80 while (__first != __last)
90 __distance(_RandomAccessIterator __first, _RandomAccessIterator __last, argument
96 return __last - __first;
102 * @param __last An input iterator.
105 * Returns @c n such that __first + n == __last. This requires
106 * that @p __last must be reachable from @p __first. Note that @c
114 distance(_InputIterator __first, _InputIterator __last) argument
117 return std::__distance(__first, __last,
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/profile/impl/
H A Dprofiler_algos.h84 __for_each(_InputIterator __first, _InputIterator __last, _Function __f) argument
86 for (; __first != __last; ++__first)
94 __remove(_ForwardIterator __first, _ForwardIterator __last, argument
97 if(__first == __last)
101 for(; __first != __last; ++__first)
/prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/mingw/include/c++/4.8.3/bits/
H A Dstl_construct.h100 __destroy(_ForwardIterator __first, _ForwardIterator __last) argument
102 for (; __first != __last; ++__first)
122 _Destroy(_ForwardIterator __first, _ForwardIterator __last) argument
127 __destroy(__first, __last);
138 _Destroy(_ForwardIterator __first, _ForwardIterator __last, argument
142 for (; __first != __last; ++__first)
148 _Destroy(_ForwardIterator __first, _ForwardIterator __last, argument
151 _Destroy(__first, __last);
H A Dstl_iterator_base_funcs.h73 __distance(_InputIterator __first, _InputIterator __last, argument
80 while (__first != __last)
90 __distance(_RandomAccessIterator __first, _RandomAccessIterator __last, argument
96 return __last - __first;
102 * @param __last An input iterator.
105 * Returns @c n such that __first + n == __last. This requires
106 * that @p __last must be reachable from @p __first. Note that @c
114 distance(_InputIterator __first, _InputIterator __last) argument
117 return std::__distance(__first, __last,
/prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/mingw/include/c++/4.8.3/profile/impl/
H A Dprofiler_algos.h84 __for_each(_InputIterator __first, _InputIterator __last, _Function __f) argument
86 for (; __first != __last; ++__first)
94 __remove(_ForwardIterator __first, _ForwardIterator __last, argument
97 if(__first == __last)
101 for(; __first != __last; ++__first)
/prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/bits/
H A Dstl_construct.h100 __destroy(_ForwardIterator __first, _ForwardIterator __last) argument
102 for (; __first != __last; ++__first)
122 _Destroy(_ForwardIterator __first, _ForwardIterator __last) argument
127 __destroy(__first, __last);
138 _Destroy(_ForwardIterator __first, _ForwardIterator __last, argument
142 for (; __first != __last; ++__first)
148 _Destroy(_ForwardIterator __first, _ForwardIterator __last, argument
151 _Destroy(__first, __last);
H A Dstl_iterator_base_funcs.h73 __distance(_InputIterator __first, _InputIterator __last, argument
80 while (__first != __last)
90 __distance(_RandomAccessIterator __first, _RandomAccessIterator __last, argument
96 return __last - __first;
102 * @param __last An input iterator.
105 * Returns @c n such that __first + n == __last. This requires
106 * that @p __last must be reachable from @p __first. Note that @c
114 distance(_InputIterator __first, _InputIterator __last) argument
117 return std::__distance(__first, __last,
/prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/profile/impl/
H A Dprofiler_algos.h84 __for_each(_InputIterator __first, _InputIterator __last, _Function __f) argument
86 for (; __first != __last; ++__first)
94 __remove(_ForwardIterator __first, _ForwardIterator __last, argument
97 if(__first == __last)
101 for(; __first != __last; ++__first)
/prebuilts/ndk/current/sources/cxx-stl/gnu-libstdc++/4.9/include/bits/
H A Dstl_construct.h100 __destroy(_ForwardIterator __first, _ForwardIterator __last) argument
102 for (; __first != __last; ++__first)
122 _Destroy(_ForwardIterator __first, _ForwardIterator __last) argument
127 __destroy(__first, __last);
138 _Destroy(_ForwardIterator __first, _ForwardIterator __last, argument
142 for (; __first != __last; ++__first)
148 _Destroy(_ForwardIterator __first, _ForwardIterator __last, argument
151 _Destroy(__first, __last);
H A Dstl_iterator_base_funcs.h73 __distance(_InputIterator __first, _InputIterator __last, argument
80 while (__first != __last)
90 __distance(_RandomAccessIterator __first, _RandomAccessIterator __last, argument
96 return __last - __first;
102 * @param __last An input iterator.
105 * Returns @c n such that __first + n == __last. This requires
106 * that @p __last must be reachable from @p __first. Note that @c
114 distance(_InputIterator __first, _InputIterator __last) argument
117 return std::__distance(__first, __last,
/prebuilts/ndk/current/sources/cxx-stl/gnu-libstdc++/4.9/include/profile/impl/
H A Dprofiler_algos.h84 __for_each(_InputIterator __first, _InputIterator __last, _Function __f) argument
86 for (; __first != __last; ++__first)
94 __remove(_ForwardIterator __first, _ForwardIterator __last, argument
97 if(__first == __last)
101 for(; __first != __last; ++__first)
/prebuilts/ndk/r10/sources/cxx-stl/gnu-libstdc++/4.9/include/bits/
H A Dstl_construct.h100 __destroy(_ForwardIterator __first, _ForwardIterator __last) argument
102 for (; __first != __last; ++__first)
122 _Destroy(_ForwardIterator __first, _ForwardIterator __last) argument
127 __destroy(__first, __last);
138 _Destroy(_ForwardIterator __first, _ForwardIterator __last, argument
142 for (; __first != __last; ++__first)
148 _Destroy(_ForwardIterator __first, _ForwardIterator __last, argument
151 _Destroy(__first, __last);
H A Dstl_iterator_base_funcs.h73 __distance(_InputIterator __first, _InputIterator __last, argument
80 while (__first != __last)
90 __distance(_RandomAccessIterator __first, _RandomAccessIterator __last, argument
96 return __last - __first;
102 * @param __last An input iterator.
105 * Returns @c n such that __first + n == __last. This requires
106 * that @p __last must be reachable from @p __first. Note that @c
114 distance(_InputIterator __first, _InputIterator __last) argument
117 return std::__distance(__first, __last,

Completed in 843 milliseconds

1234567891011>>