| /external/stlport/stlport/stl/ |
| _algobase.c | 39 bool lexicographical_compare(_InputIter1 __first1, _InputIter1 __last1,
41 _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first1, __last1))
43 for ( ; __first1 != __last1 && __first2 != __last2
44 ; ++__first1, ++__first2) {
45 if (*__first1 < *__first2) {
46 _STLP_VERBOSE_ASSERT(!(*__first2 < *__first1), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
49 if (*__first2 < *__first1)
52 return __first1 == __last1 && __first2 != __last2;
56 bool lexicographical_compare(_InputIter1 __first1, _InputIter1 __last1,
59 _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first1, __last1)
[all...] |
| _algo.c | 51 _BidirectionalIter3 __merge_backward(_BidirectionalIter1 __first1,
112 _ForwardIter1 search(_ForwardIter1 __first1, _ForwardIter1 __last1,
114 _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first1, __last1))
117 if (__first1 == __last1 || __first2 == __last2)
118 return __first1;
124 return find(__first1, __last1, *__first2);
128 for ( ; ; ) { // __first1 != __last1 will be checked in find below
129 __first1 = find(__first1, __last1, *__first2);
130 if (__first1 == __last1
[all...] |
| _list.c | 109 iterator __first1 = begin();
113 while (__first1 != __last1 && __first2 != __last2)
114 *__first1++ = *__first2++;
116 erase(__first1, __last1);
171 _Literator __first1 = __that.begin(); local
176 while (__first1 != __last1 && __first2 != __last2) {
177 if (__comp(*__first2, *__first1)) {
178 _STLP_VERBOSE_ASSERT(!__comp(*__first1, *__first2), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
180 _List_global_inst::_Transfer(__first1._M_node, __first2._M_node, (++__next)._M_node);
184 ++__first1;
[all...] |
| /ndk/sources/cxx-stl/stlport/stlport/stl/ |
| _algobase.c | 39 bool lexicographical_compare(_InputIter1 __first1, _InputIter1 __last1,
41 _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first1, __last1))
43 for ( ; __first1 != __last1 && __first2 != __last2
44 ; ++__first1, ++__first2) {
45 if (*__first1 < *__first2) {
46 _STLP_VERBOSE_ASSERT(!(*__first2 < *__first1), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
49 if (*__first2 < *__first1)
52 return __first1 == __last1 && __first2 != __last2;
56 bool lexicographical_compare(_InputIter1 __first1, _InputIter1 __last1,
59 _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first1, __last1)
[all...] |
| _algo.c | 51 _BidirectionalIter3 __merge_backward(_BidirectionalIter1 __first1,
112 _ForwardIter1 search(_ForwardIter1 __first1, _ForwardIter1 __last1,
114 _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first1, __last1))
117 if (__first1 == __last1 || __first2 == __last2)
118 return __first1;
124 return find(__first1, __last1, *__first2);
128 for ( ; ; ) { // __first1 != __last1 will be checked in find below
129 __first1 = find(__first1, __last1, *__first2);
130 if (__first1 == __last1
[all...] |
| _list.c | 109 iterator __first1 = begin();
113 while (__first1 != __last1 && __first2 != __last2)
114 *__first1++ = *__first2++;
116 erase(__first1, __last1);
171 _Literator __first1 = __that.begin(); local
176 while (__first1 != __last1 && __first2 != __last2) {
177 if (__comp(*__first2, *__first1)) {
178 _STLP_VERBOSE_ASSERT(!__comp(*__first1, *__first2), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
180 _List_global_inst::_Transfer(__first1._M_node, __first2._M_node, (++__next)._M_node);
184 ++__first1;
[all...] |
| /prebuilts/ndk/5/sources/cxx-stl/stlport/stlport/stl/ |
| _algobase.c | 39 bool lexicographical_compare(_InputIter1 __first1, _InputIter1 __last1,
41 _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first1, __last1))
43 for ( ; __first1 != __last1 && __first2 != __last2
44 ; ++__first1, ++__first2) {
45 if (*__first1 < *__first2) {
46 _STLP_VERBOSE_ASSERT(!(*__first2 < *__first1), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
49 if (*__first2 < *__first1)
52 return __first1 == __last1 && __first2 != __last2;
56 bool lexicographical_compare(_InputIter1 __first1, _InputIter1 __last1,
59 _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first1, __last1)
[all...] |
| _algo.c | 51 _BidirectionalIter3 __merge_backward(_BidirectionalIter1 __first1,
112 _ForwardIter1 search(_ForwardIter1 __first1, _ForwardIter1 __last1,
114 _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first1, __last1))
117 if (__first1 == __last1 || __first2 == __last2)
118 return __first1;
124 return find(__first1, __last1, *__first2);
128 for ( ; ; ) { // __first1 != __last1 will be checked in find below
129 __first1 = find(__first1, __last1, *__first2);
130 if (__first1 == __last1
[all...] |
| _list.c | 109 iterator __first1 = begin();
113 while (__first1 != __last1 && __first2 != __last2)
114 *__first1++ = *__first2++;
116 erase(__first1, __last1);
171 _Literator __first1 = __that.begin(); local
176 while (__first1 != __last1 && __first2 != __last2) {
177 if (__comp(*__first2, *__first1)) {
178 _STLP_VERBOSE_ASSERT(!__comp(*__first1, *__first2), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
180 _List_global_inst::_Transfer(__first1._M_node, __first2._M_node, (++__next)._M_node);
184 ++__first1;
[all...] |
| /prebuilts/ndk/6/sources/cxx-stl/stlport/stlport/stl/ |
| _algobase.c | 39 bool lexicographical_compare(_InputIter1 __first1, _InputIter1 __last1,
41 _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first1, __last1))
43 for ( ; __first1 != __last1 && __first2 != __last2
44 ; ++__first1, ++__first2) {
45 if (*__first1 < *__first2) {
46 _STLP_VERBOSE_ASSERT(!(*__first2 < *__first1), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
49 if (*__first2 < *__first1)
52 return __first1 == __last1 && __first2 != __last2;
56 bool lexicographical_compare(_InputIter1 __first1, _InputIter1 __last1,
59 _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first1, __last1)
[all...] |
| _algo.c | 51 _BidirectionalIter3 __merge_backward(_BidirectionalIter1 __first1,
112 _ForwardIter1 search(_ForwardIter1 __first1, _ForwardIter1 __last1,
114 _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first1, __last1))
117 if (__first1 == __last1 || __first2 == __last2)
118 return __first1;
124 return find(__first1, __last1, *__first2);
128 for ( ; ; ) { // __first1 != __last1 will be checked in find below
129 __first1 = find(__first1, __last1, *__first2);
130 if (__first1 == __last1
[all...] |
| _list.c | 109 iterator __first1 = begin();
113 while (__first1 != __last1 && __first2 != __last2)
114 *__first1++ = *__first2++;
116 erase(__first1, __last1);
171 _Literator __first1 = __that.begin(); local
176 while (__first1 != __last1 && __first2 != __last2) {
177 if (__comp(*__first2, *__first1)) {
178 _STLP_VERBOSE_ASSERT(!__comp(*__first1, *__first2), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
180 _List_global_inst::_Transfer(__first1._M_node, __first2._M_node, (++__next)._M_node);
184 ++__first1;
[all...] |
| /prebuilts/ndk/7/sources/cxx-stl/stlport/stlport/stl/ |
| _algobase.c | 39 bool lexicographical_compare(_InputIter1 __first1, _InputIter1 __last1,
41 _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first1, __last1))
43 for ( ; __first1 != __last1 && __first2 != __last2
44 ; ++__first1, ++__first2) {
45 if (*__first1 < *__first2) {
46 _STLP_VERBOSE_ASSERT(!(*__first2 < *__first1), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
49 if (*__first2 < *__first1)
52 return __first1 == __last1 && __first2 != __last2;
56 bool lexicographical_compare(_InputIter1 __first1, _InputIter1 __last1,
59 _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first1, __last1)
[all...] |
| _algo.c | 51 _BidirectionalIter3 __merge_backward(_BidirectionalIter1 __first1,
112 _ForwardIter1 search(_ForwardIter1 __first1, _ForwardIter1 __last1,
114 _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first1, __last1))
117 if (__first1 == __last1 || __first2 == __last2)
118 return __first1;
124 return find(__first1, __last1, *__first2);
128 for ( ; ; ) { // __first1 != __last1 will be checked in find below
129 __first1 = find(__first1, __last1, *__first2);
130 if (__first1 == __last1
[all...] |
| _list.c | 109 iterator __first1 = begin();
113 while (__first1 != __last1 && __first2 != __last2)
114 *__first1++ = *__first2++;
116 erase(__first1, __last1);
171 _Literator __first1 = __that.begin(); local
176 while (__first1 != __last1 && __first2 != __last2) {
177 if (__comp(*__first2, *__first1)) {
178 _STLP_VERBOSE_ASSERT(!__comp(*__first1, *__first2), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
180 _List_global_inst::_Transfer(__first1._M_node, __first2._M_node, (++__next)._M_node);
184 ++__first1;
[all...] |
| /prebuilts/ndk/8/sources/cxx-stl/stlport/stlport/stl/ |
| _algobase.c | 39 bool lexicographical_compare(_InputIter1 __first1, _InputIter1 __last1,
41 _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first1, __last1))
43 for ( ; __first1 != __last1 && __first2 != __last2
44 ; ++__first1, ++__first2) {
45 if (*__first1 < *__first2) {
46 _STLP_VERBOSE_ASSERT(!(*__first2 < *__first1), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
49 if (*__first2 < *__first1)
52 return __first1 == __last1 && __first2 != __last2;
56 bool lexicographical_compare(_InputIter1 __first1, _InputIter1 __last1,
59 _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first1, __last1)
[all...] |
| _algo.c | 51 _BidirectionalIter3 __merge_backward(_BidirectionalIter1 __first1,
112 _ForwardIter1 search(_ForwardIter1 __first1, _ForwardIter1 __last1,
114 _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first1, __last1))
117 if (__first1 == __last1 || __first2 == __last2)
118 return __first1;
124 return find(__first1, __last1, *__first2);
128 for ( ; ; ) { // __first1 != __last1 will be checked in find below
129 __first1 = find(__first1, __last1, *__first2);
130 if (__first1 == __last1
[all...] |
| _list.c | 109 iterator __first1 = begin();
113 while (__first1 != __last1 && __first2 != __last2)
114 *__first1++ = *__first2++;
116 erase(__first1, __last1);
171 _Literator __first1 = __that.begin(); local
176 while (__first1 != __last1 && __first2 != __last2) {
177 if (__comp(*__first2, *__first1)) {
178 _STLP_VERBOSE_ASSERT(!__comp(*__first1, *__first2), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
180 _List_global_inst::_Transfer(__first1._M_node, __first2._M_node, (++__next)._M_node);
184 ++__first1;
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/EH/stlport/stlport/stl/ |
| _algobase.c | 39 bool lexicographical_compare(_InputIter1 __first1, _InputIter1 __last1,
41 _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first1, __last1))
43 for ( ; __first1 != __last1 && __first2 != __last2
44 ; ++__first1, ++__first2) {
45 if (*__first1 < *__first2) {
46 _STLP_VERBOSE_ASSERT(!(*__first2 < *__first1), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
49 if (*__first2 < *__first1)
52 return __first1 == __last1 && __first2 != __last2;
56 bool lexicographical_compare(_InputIter1 __first1, _InputIter1 __last1,
59 _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first1, __last1)
[all...] |
| _algo.c | 51 _BidirectionalIter3 __merge_backward(_BidirectionalIter1 __first1,
112 _ForwardIter1 search(_ForwardIter1 __first1, _ForwardIter1 __last1,
114 _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first1, __last1))
117 if (__first1 == __last1 || __first2 == __last2)
118 return __first1;
124 return find(__first1, __last1, *__first2);
128 for ( ; ; ) { // __first1 != __last1 will be checked in find below
129 __first1 = find(__first1, __last1, *__first2);
130 if (__first1 == __last1
[all...] |
| _list.c | 109 iterator __first1 = begin();
113 while (__first1 != __last1 && __first2 != __last2)
114 *__first1++ = *__first2++;
116 erase(__first1, __last1);
171 _Literator __first1 = __that.begin(); local
176 while (__first1 != __last1 && __first2 != __last2) {
177 if (__comp(*__first2, *__first1)) {
178 _STLP_VERBOSE_ASSERT(!__comp(*__first1, *__first2), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
180 _List_global_inst::_Transfer(__first1._M_node, __first2._M_node, (++__next)._M_node);
184 ++__first1;
[all...] |
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/bits/ |
| stl_algobase.h | 148 * @param __first1 A forward iterator.
159 swap_ranges(_ForwardIterator1 __first1, _ForwardIterator1 __last1,
167 __glibcxx_requires_valid_range(__first1, __last1);
169 for (; __first1 != __last1; ++__first1, ++__first2)
170 std::iter_swap(__first1, __first2);
788 equal(_II1 __first1, _II1 __last1, _II2 __first2)
790 for (; __first1 != __last1; ++__first1, ++__first2)
791 if (!(*__first1 == *__first2)
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.7/include/bits/ |
| stl_algobase.h | 148 * @param __first1 A forward iterator.
159 swap_ranges(_ForwardIterator1 __first1, _ForwardIterator1 __last1,
167 __glibcxx_requires_valid_range(__first1, __last1);
169 for (; __first1 != __last1; ++__first1, ++__first2)
170 std::iter_swap(__first1, __first2);
788 equal(_II1 __first1, _II1 __last1, _II2 __first2)
790 for (; __first1 != __last1; ++__first1, ++__first2)
791 if (!(*__first1 == *__first2)
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/include/ |
| algorithm | 874 __find_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1,
886 if (__first1 == __last1) // if source exhausted return last correct answer
888 if (__pred(*__first1, *__first2))
890 ++__first1;
892 // *__first1 matches *__first2, now match elements after here
893 _ForwardIterator1 __m1 = __first1;
899 __r = __first1;
900 ++__first1;
907 ++__first1;
916 __find_end(_BidirectionalIterator1 __first1, _BidirectionalIterator1 __last1
[all...] |
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/bits/ |
| stl_algobase.h | 158 swap_ranges(_ForwardIterator1 __first1, _ForwardIterator1 __last1,
166 __glibcxx_requires_valid_range(__first1, __last1);
168 for (; __first1 != __last1; ++__first1, ++__first2)
169 std::iter_swap(__first1, __first2);
799 equal(_II1 __first1, _II1 __last1, _II2 __first2)
801 for (; __first1 != __last1; ++__first1, ++__first2)
802 if (!(*__first1 == *__first2))
813 equal(const _Tp* __first1, const _Tp* __last1, const _Tp* __first2
[all...] |
