| /prebuilts/ndk/6/sources/cxx-stl/stlport/stlport/stl/ |
| _set.h | 89 explicit set(const _Compare& __comp = _Compare(),
94 explicit set(const _Compare& __comp)
95 : _M_t(__comp, allocator_type()) {}
96 set(const _Compare& __comp, const allocator_type& __a)
98 : _M_t(__comp, __a) {}
108 set(_InputIterator __first, _InputIterator __last, const _Compare& __comp)
109 : _M_t(__comp, allocator_type()) { _M_t.insert_unique(__first, __last); }
112 set(_InputIterator __first, _InputIterator __last, const _Compare& __comp,
114 : _M_t(__comp, __a) { _M_t.insert_unique(__first, __last); }
121 const value_type* __last, const _Compare& __comp,
[all...] |
| /prebuilts/ndk/7/sources/cxx-stl/stlport/stlport/stl/ |
| _set.h | 89 explicit set(const _Compare& __comp = _Compare(),
94 explicit set(const _Compare& __comp)
95 : _M_t(__comp, allocator_type()) {}
96 set(const _Compare& __comp, const allocator_type& __a)
98 : _M_t(__comp, __a) {}
108 set(_InputIterator __first, _InputIterator __last, const _Compare& __comp)
109 : _M_t(__comp, allocator_type()) { _M_t.insert_unique(__first, __last); }
112 set(_InputIterator __first, _InputIterator __last, const _Compare& __comp,
114 : _M_t(__comp, __a) { _M_t.insert_unique(__first, __last); }
121 const value_type* __last, const _Compare& __comp,
[all...] |
| /prebuilts/ndk/8/sources/cxx-stl/stlport/stlport/stl/ |
| _set.h | 89 explicit set(const _Compare& __comp = _Compare(),
94 explicit set(const _Compare& __comp)
95 : _M_t(__comp, allocator_type()) {}
96 set(const _Compare& __comp, const allocator_type& __a)
98 : _M_t(__comp, __a) {}
108 set(_InputIterator __first, _InputIterator __last, const _Compare& __comp)
109 : _M_t(__comp, allocator_type()) { _M_t.insert_unique(__first, __last); }
112 set(_InputIterator __first, _InputIterator __last, const _Compare& __comp,
114 : _M_t(__comp, __a) { _M_t.insert_unique(__first, __last); }
121 const value_type* __last, const _Compare& __comp,
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/EH/stlport/stlport/stl/ |
| _set.h | 89 explicit set(const _Compare& __comp = _Compare(),
94 explicit set(const _Compare& __comp)
95 : _M_t(__comp, allocator_type()) {}
96 set(const _Compare& __comp, const allocator_type& __a)
98 : _M_t(__comp, __a) {}
108 set(_InputIterator __first, _InputIterator __last, const _Compare& __comp)
109 : _M_t(__comp, allocator_type()) { _M_t.insert_unique(__first, __last); }
112 set(_InputIterator __first, _InputIterator __last, const _Compare& __comp,
114 : _M_t(__comp, __a) { _M_t.insert_unique(__first, __last); }
121 const value_type* __last, const _Compare& __comp,
[all...] |
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/bits/ |
| stl_heap.h | 90 _Compare __comp)
95 if (__comp(__first[__parent], __first[__child]))
113 __is_heap(_RandomAccessIterator __first, _Compare __comp, _Distance __n)
114 { return std::__is_heap_until(__first, __n, __comp) == __n; }
124 _Compare __comp)
125 { return std::__is_heap(__first, __comp, std::distance(__first, __last)); }
180 _Distance __topIndex, _Tp __value, _Compare __comp)
184 && __comp(*(__first + __parent), __value))
197 * @param __comp Comparison functor.
208 _Compare __comp)
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.7/include/bits/ |
| stl_heap.h | 90 _Compare __comp)
95 if (__comp(__first[__parent], __first[__child]))
113 __is_heap(_RandomAccessIterator __first, _Compare __comp, _Distance __n)
114 { return std::__is_heap_until(__first, __n, __comp) == __n; }
124 _Compare __comp)
125 { return std::__is_heap(__first, __comp, std::distance(__first, __last)); }
180 _Distance __topIndex, _Tp __value, _Compare __comp)
184 && __comp(*(__first + __parent), __value))
197 * @param __comp Comparison functor.
208 _Compare __comp)
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/include/bits/ |
| stl_heap.h | 89 _Compare __comp)
94 if (__comp(__first[__parent], __first[__child]))
112 __is_heap(_RandomAccessIterator __first, _Compare __comp, _Distance __n)
113 { return std::__is_heap_until(__first, __n, __comp) == __n; }
123 _Compare __comp)
124 { return std::__is_heap(__first, __comp, std::distance(__first, __last)); }
179 _Distance __topIndex, _Tp __value, _Compare __comp)
183 && __comp(*(__first + __parent), __value))
196 * @param __comp Comparison functor.
207 _Compare __comp)
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/include/parallel/ |
| quicksort.h | 43 * @param __comp Comparator.
52 _Compare __comp, typename std::iterator_traits
76 __gnu_sequential::sort(__samples, __samples + __num_samples, __comp);
81 __pred(__comp, __pivot);
95 * @param __comp Comparator.
102 _Compare __comp,
111 __gnu_sequential::sort(__begin, __end, __comp);
130 (__begin, __end, __comp, __pivot_rank,
137 __comp, __num_threads_left);
140 __comp, __num_threads - __num_threads_left)
[all...] |
| balanced_quicksort.h | 94 * @param __comp Comparator.
101 _Compare __comp, _ThreadIndex __num_threads)
111 __end - 1, __comp);
117 _GLIBCXX_PARALLEL_ASSERT((!__comp(*__pivot_pos, *__begin)
118 && !__comp(*(__begin + __n / 2),
120 || (!__comp(*__pivot_pos, *__begin)
121 && !__comp(*(__end - 1), *__pivot_pos))
122 || (!__comp(*__pivot_pos, *(__begin + __n / 2))
123 && !__comp(*__begin, *__pivot_pos))
124 || (!__comp(*__pivot_pos, *(__begin + __n / 2)
[all...] |
| multiway_merge.h | 83 _Compare& __comp; member in class:__gnu_parallel::_GuardedIterator
89 * @param __comp Comparator provided for associated overloaded
91 _GuardedIterator(_RAIter __begin, _RAIter __end, _Compare& __comp)
92 : _M_current(__begin), _M_end(__end), __comp(__comp)
127 return (__bi1.__comp)(*__bi1, *__bi2); // normal compare
142 return !(__bi1.__comp)(*__bi2, *__bi1); // normal compare
153 _Compare& __comp; member in class:__gnu_parallel::_UnguardedIterator
159 * @param __comp Unused, only for compatibility. */
161 _RAIter /* __end */, _Compare& __comp)
[all...] |
| merge.h | 51 * @param __comp Comparator.
60 _DifferenceTp __max_length, _Compare __comp)
66 if (__comp(*__begin2, *__begin1))
99 * @param __comp Comparator.
108 _DifferenceTp __max_length, _Compare __comp)
127 if (__comp(__element2, __element1))
165 * @param __comp Comparator.
174 _Compare __comp)
179 __target, __max_length, __comp);
190 * @param __comp Comparator
[all...] |
| checkers.h | 43 * to @c __comp.
46 * @param __comp Comparator.
51 __is_sorted(_IIter __begin, _IIter __end, _Compare __comp)
61 if (__comp(*__current, *__recent))
|
| set_operations.h | 74 __symmetric_difference_func(_Compare __comp) : _M_comp(__comp) {}
151 __difference_func(_Compare __comp) : _M_comp(__comp) {}
219 __intersection_func(_Compare __comp) : _M_comp(__comp) {}
282 __union_func(_Compare __comp) : _M_comp(__comp) {}
477 _OutputIterator __result, _Compare __comp)
482 _Compare>(__comp));
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/include/ |
| algorithm | [all...] |
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/bits/ |
| stl_heap.h | 88 _Compare __comp)
93 if (__comp(__first[__parent], __first[__child]))
111 __is_heap(_RandomAccessIterator __first, _Compare __comp, _Distance __n)
112 { return std::__is_heap_until(__first, __n, __comp) == __n; }
122 _Compare __comp)
123 { return std::__is_heap(__first, __comp, std::distance(__first, __last)); }
177 _Distance __topIndex, _Tp __value, _Compare __comp)
181 && __comp(*(__first + __parent), __value))
204 _Compare __comp)
215 __glibcxx_requires_heap_pred(__first, __last - 1, __comp);
[all...] |
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/bits/ |
| stl_heap.h | 90 _Compare __comp)
95 if (__comp(__first[__parent], __first[__child]))
113 __is_heap(_RandomAccessIterator __first, _Compare __comp, _Distance __n)
114 { return std::__is_heap_until(__first, __n, __comp) == __n; }
124 _Compare __comp)
125 { return std::__is_heap(__first, __comp, std::distance(__first, __last)); }
179 _Distance __topIndex, _Tp __value, _Compare __comp)
183 && __comp(*(__first + __parent), __value))
206 _Compare __comp)
217 __glibcxx_requires_heap_pred(__first, __last - 1, __comp);
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/bits/ |
| stl_heap.h | 90 _Compare __comp)
95 if (__comp(__first[__parent], __first[__child]))
113 __is_heap(_RandomAccessIterator __first, _Compare __comp, _Distance __n)
114 { return std::__is_heap_until(__first, __n, __comp) == __n; }
124 _Compare __comp)
125 { return std::__is_heap(__first, __comp, std::distance(__first, __last)); }
179 _Distance __topIndex, _Tp __value, _Compare __comp)
183 && __comp(*(__first + __parent), __value))
206 _Compare __comp)
217 __glibcxx_requires_heap_pred(__first, __last - 1, __comp);
[all...] |
| /prebuilts/ndk/5/sources/cxx-stl/gnu-libstdc++/include/bits/ |
| stl_heap.h | 88 _Compare __comp)
93 if (__comp(__first[__parent], __first[__child]))
111 __is_heap(_RandomAccessIterator __first, _Compare __comp, _Distance __n)
112 { return std::__is_heap_until(__first, __n, __comp) == __n; }
122 _Compare __comp)
123 { return std::__is_heap(__first, __comp, std::distance(__first, __last)); }
177 _Distance __topIndex, _Tp __value, _Compare __comp)
181 && __comp(*(__first + __parent), __value))
204 _Compare __comp)
215 __glibcxx_requires_heap_pred(__first, __last - 1, __comp);
[all...] |
| /prebuilts/ndk/6/sources/cxx-stl/gnu-libstdc++/include/bits/ |
| stl_heap.h | 88 _Compare __comp)
93 if (__comp(__first[__parent], __first[__child]))
111 __is_heap(_RandomAccessIterator __first, _Compare __comp, _Distance __n)
112 { return std::__is_heap_until(__first, __n, __comp) == __n; }
122 _Compare __comp)
123 { return std::__is_heap(__first, __comp, std::distance(__first, __last)); }
177 _Distance __topIndex, _Tp __value, _Compare __comp)
181 && __comp(*(__first + __parent), __value))
204 _Compare __comp)
215 __glibcxx_requires_heap_pred(__first, __last - 1, __comp);
[all...] |
| /prebuilts/ndk/7/sources/cxx-stl/gnu-libstdc++/include/bits/ |
| stl_heap.h | 88 _Compare __comp)
93 if (__comp(__first[__parent], __first[__child]))
111 __is_heap(_RandomAccessIterator __first, _Compare __comp, _Distance __n)
112 { return std::__is_heap_until(__first, __n, __comp) == __n; }
122 _Compare __comp)
123 { return std::__is_heap(__first, __comp, std::distance(__first, __last)); }
177 _Distance __topIndex, _Tp __value, _Compare __comp)
181 && __comp(*(__first + __parent), __value))
204 _Compare __comp)
215 __glibcxx_requires_heap_pred(__first, __last - 1, __comp);
[all...] |
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.4.3/include/bits/ |
| stl_heap.h | 88 _Compare __comp)
93 if (__comp(__first[__parent], __first[__child]))
111 __is_heap(_RandomAccessIterator __first, _Compare __comp, _Distance __n)
112 { return std::__is_heap_until(__first, __n, __comp) == __n; }
122 _Compare __comp)
123 { return std::__is_heap(__first, __comp, std::distance(__first, __last)); }
177 _Distance __topIndex, _Tp __value, _Compare __comp)
181 && __comp(*(__first + __parent), __value))
204 _Compare __comp)
215 __glibcxx_requires_heap_pred(__first, __last - 1, __comp);
[all...] |
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/bits/ |
| stl_heap.h | 90 _Compare __comp)
95 if (__comp(__first[__parent], __first[__child]))
113 __is_heap(_RandomAccessIterator __first, _Compare __comp, _Distance __n)
114 { return std::__is_heap_until(__first, __n, __comp) == __n; }
124 _Compare __comp)
125 { return std::__is_heap(__first, __comp, std::distance(__first, __last)); }
179 _Distance __topIndex, _Tp __value, _Compare __comp)
183 && __comp(*(__first + __parent), __value))
206 _Compare __comp)
217 __glibcxx_requires_heap_pred(__first, __last - 1, __comp);
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.6/include/bits/ |
| stl_heap.h | 90 _Compare __comp)
95 if (__comp(__first[__parent], __first[__child]))
113 __is_heap(_RandomAccessIterator __first, _Compare __comp, _Distance __n)
114 { return std::__is_heap_until(__first, __n, __comp) == __n; }
124 _Compare __comp)
125 { return std::__is_heap(__first, __comp, std::distance(__first, __last)); }
179 _Distance __topIndex, _Tp __value, _Compare __comp)
183 && __comp(*(__first + __parent), __value))
206 _Compare __comp)
217 __glibcxx_requires_heap_pred(__first, __last - 1, __comp);
[all...] |
| /external/stlport/stlport/stl/ |
| _map.h | 101 explicit map(const _Compare& __comp,
104 explicit map(const _Compare& __comp)
105 : _M_t(__comp, allocator_type()) {}
106 explicit map(const _Compare& __comp, const allocator_type& __a)
108 : _M_t(__comp, __a) {}
117 map(_InputIterator __first, _InputIterator __last, const _Compare& __comp,
119 : _M_t(__comp, __a) { _M_t.insert_unique(__first, __last); }
123 map(_InputIterator __first, _InputIterator __last, const _Compare& __comp)
124 : _M_t(__comp, allocator_type()) { _M_t.insert_unique(__first, __last); }
133 const value_type* __last, const _Compare& __comp,
[all...] |
| /ndk/sources/cxx-stl/stlport/stlport/stl/ |
| _map.h | 101 explicit map(const _Compare& __comp,
104 explicit map(const _Compare& __comp)
105 : _M_t(__comp, allocator_type()) {}
106 explicit map(const _Compare& __comp, const allocator_type& __a)
108 : _M_t(__comp, __a) {}
117 map(_InputIterator __first, _InputIterator __last, const _Compare& __comp,
119 : _M_t(__comp, __a) { _M_t.insert_unique(__first, __last); }
123 map(_InputIterator __first, _InputIterator __last, const _Compare& __comp)
124 : _M_t(__comp, allocator_type()) { _M_t.insert_unique(__first, __last); }
133 const value_type* __last, const _Compare& __comp,
[all...] |
