| /external/stlport/stlport/stl/ |
| _algo.c | 46 _Compare __comp);
56 _Compare __comp);
83 __median(const _Tp& __a, const _Tp& __b, const _Tp& __c, _Compare __comp) {
84 if (__comp(__a, __b)) {
85 _STLP_VERBOSE_ASSERT(!__comp(__b, __a), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
86 if (__comp(__b, __c)) {
87 _STLP_VERBOSE_ASSERT(!__comp(__c, __b), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
90 else if (__comp(__a, __c)) {
91 _STLP_VERBOSE_ASSERT(!__comp(__c, __a), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
97 else if (__comp(__a, __c))
[all...] |
| _heap.c | 77 _Distance __topIndex, _Tp __val, _Compare __comp)
80 while (__holeIndex > __topIndex && __comp(*(__first + __parent), __val)) {
81 _STLP_VERBOSE_ASSERT(!__comp(__val, *(__first + __parent)), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
93 _RandomAccessIterator __last, _Compare __comp,
97 _Tp(*(__last - 1)), __comp);
103 _Compare __comp)
105 __push_heap_aux(__first, __last, __comp,
147 _Distance __len, _Tp __val, _Compare __comp)
152 if (__comp(*(__first + __secondChild), *(__first + (__secondChild - 1)))) {
153 _STLP_VERBOSE_ASSERT(!__comp(*(__first + (__secondChild - 1)), *(__first + __secondChild))
[all...] |
| _heap.h | 45 _Compare __comp);
69 _Distance __len, _Tp __val, _Compare __comp);
75 _RandomAccessIterator __result, _Tp __val, _Compare __comp,
80 __val, __comp);
86 _RandomAccessIterator __last, _Compare __comp);
95 _RandomAccessIterator __last, _Compare __comp);
109 _RandomAccessIterator __last, _Compare __comp)
112 pop_heap(__first, __last--, __comp);
|
| _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...] |
| /ndk/sources/cxx-stl/stlport/stlport/stl/ |
| _algo.c | 46 _Compare __comp);
56 _Compare __comp);
83 __median(const _Tp& __a, const _Tp& __b, const _Tp& __c, _Compare __comp) {
84 if (__comp(__a, __b)) {
85 _STLP_VERBOSE_ASSERT(!__comp(__b, __a), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
86 if (__comp(__b, __c)) {
87 _STLP_VERBOSE_ASSERT(!__comp(__c, __b), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
90 else if (__comp(__a, __c)) {
91 _STLP_VERBOSE_ASSERT(!__comp(__c, __a), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
97 else if (__comp(__a, __c))
[all...] |
| _heap.c | 77 _Distance __topIndex, _Tp __val, _Compare __comp)
80 while (__holeIndex > __topIndex && __comp(*(__first + __parent), __val)) {
81 _STLP_VERBOSE_ASSERT(!__comp(__val, *(__first + __parent)), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
93 _RandomAccessIterator __last, _Compare __comp,
97 _Tp(*(__last - 1)), __comp);
103 _Compare __comp)
105 __push_heap_aux(__first, __last, __comp,
147 _Distance __len, _Tp __val, _Compare __comp)
152 if (__comp(*(__first + __secondChild), *(__first + (__secondChild - 1)))) {
153 _STLP_VERBOSE_ASSERT(!__comp(*(__first + (__secondChild - 1)), *(__first + __secondChild))
[all...] |
| _heap.h | 45 _Compare __comp);
69 _Distance __len, _Tp __val, _Compare __comp);
75 _RandomAccessIterator __result, _Tp __val, _Compare __comp,
80 __val, __comp);
86 _RandomAccessIterator __last, _Compare __comp);
95 _RandomAccessIterator __last, _Compare __comp);
109 _RandomAccessIterator __last, _Compare __comp)
112 pop_heap(__first, __last--, __comp);
|
| _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/android-ndk-r5/sources/cxx-stl/stlport/stlport/stl/ |
| _algo.c | 46 _Compare __comp);
56 _Compare __comp);
83 __median(const _Tp& __a, const _Tp& __b, const _Tp& __c, _Compare __comp) {
84 if (__comp(__a, __b)) {
85 _STLP_VERBOSE_ASSERT(!__comp(__b, __a), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
86 if (__comp(__b, __c)) {
87 _STLP_VERBOSE_ASSERT(!__comp(__c, __b), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
90 else if (__comp(__a, __c)) {
91 _STLP_VERBOSE_ASSERT(!__comp(__c, __a), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
97 else if (__comp(__a, __c))
[all...] |
| _heap.c | 77 _Distance __topIndex, _Tp __val, _Compare __comp)
80 while (__holeIndex > __topIndex && __comp(*(__first + __parent), __val)) {
81 _STLP_VERBOSE_ASSERT(!__comp(__val, *(__first + __parent)), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
93 _RandomAccessIterator __last, _Compare __comp,
97 _Tp(*(__last - 1)), __comp);
103 _Compare __comp)
105 __push_heap_aux(__first, __last, __comp,
147 _Distance __len, _Tp __val, _Compare __comp)
152 if (__comp(*(__first + __secondChild), *(__first + (__secondChild - 1)))) {
153 _STLP_VERBOSE_ASSERT(!__comp(*(__first + (__secondChild - 1)), *(__first + __secondChild))
[all...] |
| _heap.h | 45 _Compare __comp);
69 _Distance __len, _Tp __val, _Compare __comp);
75 _RandomAccessIterator __result, _Tp __val, _Compare __comp,
80 __val, __comp);
86 _RandomAccessIterator __last, _Compare __comp);
95 _RandomAccessIterator __last, _Compare __comp);
109 _RandomAccessIterator __last, _Compare __comp)
112 pop_heap(__first, __last--, __comp);
|
| _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/android-ndk-r6/sources/cxx-stl/stlport/stlport/stl/ |
| _algo.c | 46 _Compare __comp);
56 _Compare __comp);
83 __median(const _Tp& __a, const _Tp& __b, const _Tp& __c, _Compare __comp) {
84 if (__comp(__a, __b)) {
85 _STLP_VERBOSE_ASSERT(!__comp(__b, __a), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
86 if (__comp(__b, __c)) {
87 _STLP_VERBOSE_ASSERT(!__comp(__c, __b), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
90 else if (__comp(__a, __c)) {
91 _STLP_VERBOSE_ASSERT(!__comp(__c, __a), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
97 else if (__comp(__a, __c))
[all...] |
| _heap.c | 77 _Distance __topIndex, _Tp __val, _Compare __comp)
80 while (__holeIndex > __topIndex && __comp(*(__first + __parent), __val)) {
81 _STLP_VERBOSE_ASSERT(!__comp(__val, *(__first + __parent)), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
93 _RandomAccessIterator __last, _Compare __comp,
97 _Tp(*(__last - 1)), __comp);
103 _Compare __comp)
105 __push_heap_aux(__first, __last, __comp,
147 _Distance __len, _Tp __val, _Compare __comp)
152 if (__comp(*(__first + __secondChild), *(__first + (__secondChild - 1)))) {
153 _STLP_VERBOSE_ASSERT(!__comp(*(__first + (__secondChild - 1)), *(__first + __secondChild))
[all...] |
| _heap.h | 45 _Compare __comp);
69 _Distance __len, _Tp __val, _Compare __comp);
75 _RandomAccessIterator __result, _Tp __val, _Compare __comp,
80 __val, __comp);
86 _RandomAccessIterator __last, _Compare __comp);
95 _RandomAccessIterator __last, _Compare __comp);
109 _RandomAccessIterator __last, _Compare __comp)
112 pop_heap(__first, __last--, __comp);
|
| _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/android-ndk-r7/sources/cxx-stl/stlport/stlport/stl/ |
| _algo.c | 46 _Compare __comp);
56 _Compare __comp);
83 __median(const _Tp& __a, const _Tp& __b, const _Tp& __c, _Compare __comp) {
84 if (__comp(__a, __b)) {
85 _STLP_VERBOSE_ASSERT(!__comp(__b, __a), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
86 if (__comp(__b, __c)) {
87 _STLP_VERBOSE_ASSERT(!__comp(__c, __b), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
90 else if (__comp(__a, __c)) {
91 _STLP_VERBOSE_ASSERT(!__comp(__c, __a), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
97 else if (__comp(__a, __c))
[all...] |
| _heap.c | 77 _Distance __topIndex, _Tp __val, _Compare __comp)
80 while (__holeIndex > __topIndex && __comp(*(__first + __parent), __val)) {
81 _STLP_VERBOSE_ASSERT(!__comp(__val, *(__first + __parent)), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
93 _RandomAccessIterator __last, _Compare __comp,
97 _Tp(*(__last - 1)), __comp);
103 _Compare __comp)
105 __push_heap_aux(__first, __last, __comp,
147 _Distance __len, _Tp __val, _Compare __comp)
152 if (__comp(*(__first + __secondChild), *(__first + (__secondChild - 1)))) {
153 _STLP_VERBOSE_ASSERT(!__comp(*(__first + (__secondChild - 1)), *(__first + __secondChild))
[all...] |
| _heap.h | 45 _Compare __comp);
69 _Distance __len, _Tp __val, _Compare __comp);
75 _RandomAccessIterator __result, _Tp __val, _Compare __comp,
80 __val, __comp);
86 _RandomAccessIterator __last, _Compare __comp);
95 _RandomAccessIterator __last, _Compare __comp);
109 _RandomAccessIterator __last, _Compare __comp)
112 pop_heap(__first, __last--, __comp);
|
| _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/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/android-ndk-r5/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/android-ndk-r6/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...] |
