| /dports/games/warmux/warmux-11.04/build/symbian/lib/stlport/stlport/stl/ |
| H A D | _algobase.c | 84 return !(__first1 == __last1); in __lexicographical_compare_3way()
245 if (__first1 == __last1) { in search()
246 return __last1; in search()
250 if (++__current == __last1) return __last1; in search()
255 if (++__current == __last1) in search()
256 return __last1; in search()
278 return __last1; in __find_first_of()
294 return __last1; in __find_end()
296 _ForwardIter1 __result = __last1; in __find_end()
299 if (__new_result == __last1) in __find_end()
[all …]
|
| /dports/games/diaspora/Diaspora_R1_Linux/Diaspora/fs2_open/STLport-5.2.1/stlport/stl/ |
| H A D | _algobase.c | 91 return !(__first1 == __last1); in __lexicographical_compare_3way()
252 if (__first1 == __last1) { in search()
253 return __last1; in search()
257 if (++__current == __last1) return __last1; in search()
262 if (++__current == __last1) in search()
263 return __last1; in search()
358 return __last1;
374 return __last1;
376 _ForwardIter1 __result = __last1;
379 if (__new_result == __last1)
[all …]
|
| /dports/devel/wasi-libcxx/llvm-project-13.0.1.src/libcxx/include/__algorithm/ |
| H A D | find_end.h | 33 _ForwardIterator1 __r = __last1; // __last1 is the "default" answer in __find_end()
38 if (__first1 == __last1) // if source exhausted return last correct answer in __find_end()
53 if (++__m1 == __last1) // Source exhausted, return last answer in __find_end()
70 return __last1; // Everything matches an empty sequence in __find_end()
71 _BidirectionalIterator1 __l1 = __last1; in __find_end()
78 return __last1; in __find_end()
89 return __last1; in __find_end()
105 return __last1; in __find_end()
108 return __last1; in __find_end()
110 _RandomAccessIterator1 __l1 = __last1; in __find_end()
[all …]
|
| H A D | search.h | 30 _LIBCPP_CONSTEXPR_AFTER_CXX11 __search(_ForwardIterator1 __first1, _ForwardIterator1 __last1, in __search() argument
38 if (__first1 == __last1) // return __last1 if no element matches *__first2 in __search()
39 return _VSTD::make_pair(__last1, __last1); in __search()
50 if (++__m1 == __last1) // Otherwise if source exhaused, pattern not found in __search()
51 return _VSTD::make_pair(__last1, __last1); in __search()
63 __search(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1, _RandomAccessIterator2 __… in __search() argument
72 const _D1 __len1 = __last1 - __first1; in __search()
74 return _VSTD::make_pair(__last1, __last1); in __search()
80 return _VSTD::make_pair(__last1, __last1); in __search()
105 __first1, __last1, __first2, __last2, __pred, in search()
[all …]
|
| H A D | is_permutation.h | 33 for (; __first1 != __last1; ++__first1, (void)++__first2) in is_permutation()
36 if (__first1 == __last1) in is_permutation()
41 _D1 __l1 = _VSTD::distance(__first1, __last1); in is_permutation()
47 for (_ForwardIterator1 __i = __first1; __i != __last1; ++__i) { in is_permutation()
63 for (_ForwardIterator1 __j = _VSTD::next(__i); __j != __last1; ++__j) in is_permutation()
87 for (; __first1 != __last1 && __first2 != __last2; ++__first1, (void)++__first2) in __is_permutation()
90 if (__first1 == __last1) in __is_permutation()
96 _D1 __l1 = _VSTD::distance(__first1, __last1); in __is_permutation()
105 for (_ForwardIterator1 __i = __first1; __i != __last1; ++__i) { in __is_permutation()
121 for (_ForwardIterator1 __j = _VSTD::next(__i); __j != __last1; ++__j) in __is_permutation()
[all …]
|
| H A D | equal.h | 29 equal(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _BinaryPredicate… in equal() argument
30 for (; __first1 != __last1; ++__first1, (void)++__first2) in equal()
38 equal(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2) { in equal() argument
41 return _VSTD::equal(__first1, __last1, __first2, __equal_to<__v1, __v2>()); in equal()
47 __equal(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator… in __equal() argument
49 for (; __first1 != __last1 && __first2 != __last2; ++__first1, (void)++__first2) in __equal()
52 return __first1 == __last1 && __first2 == __last2; in __equal()
57 __equal(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1, _RandomAccessIterator2 __f… in __equal() argument
60 if (_VSTD::distance(__first1, __last1) != _VSTD::distance(__first2, __last2)) in __equal()
68 equal(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 … in equal() argument
[all …]
|
| /dports/devel/llvm-devel/llvm-project-f05c95f10fc1d8171071735af8ad3a9e87633120/libcxx/include/__algorithm/ |
| H A D | find_end.h | 29 _ForwardIterator1 __r = __last1; // __last1 is the "default" answer in __find_end()
34 if (__first1 == __last1) // if source exhausted return last correct answer in __find_end()
49 if (++__m1 == __last1) // Source exhausted, return last answer in __find_end()
66 return __last1; // Everything matches an empty sequence in __find_end()
67 _BidirectionalIterator1 __l1 = __last1; in __find_end()
74 return __last1; in __find_end()
85 return __last1; in __find_end()
101 return __last1; in __find_end()
104 return __last1; in __find_end()
106 _RandomAccessIterator1 __l1 = __last1; in __find_end()
[all …]
|
| H A D | search.h | 26 _LIBCPP_CONSTEXPR_AFTER_CXX11 __search(_ForwardIterator1 __first1, _ForwardIterator1 __last1, in __search() argument
34 if (__first1 == __last1) // return __last1 if no element matches *__first2 in __search()
35 return _VSTD::make_pair(__last1, __last1); in __search()
46 if (++__m1 == __last1) // Otherwise if source exhaused, pattern not found in __search()
47 return _VSTD::make_pair(__last1, __last1); in __search()
59 __search(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1, _RandomAccessIterator2 __… in __search() argument
68 const _D1 __len1 = __last1 - __first1; in __search()
70 return _VSTD::make_pair(__last1, __last1); in __search()
76 return _VSTD::make_pair(__last1, __last1); in __search()
101 __first1, __last1, __first2, __last2, __pred, in search()
[all …]
|
| H A D | is_permutation.h | 30 for (; __first1 != __last1; ++__first1, (void)++__first2) in is_permutation()
33 if (__first1 == __last1) in is_permutation()
38 _D1 __l1 = _VSTD::distance(__first1, __last1); in is_permutation()
44 for (_ForwardIterator1 __i = __first1; __i != __last1; ++__i) { in is_permutation()
60 for (_ForwardIterator1 __j = _VSTD::next(__i); __j != __last1; ++__j) in is_permutation()
84 for (; __first1 != __last1 && __first2 != __last2; ++__first1, (void)++__first2) in __is_permutation()
87 if (__first1 == __last1) in __is_permutation()
93 _D1 __l1 = _VSTD::distance(__first1, __last1); in __is_permutation()
102 for (_ForwardIterator1 __i = __first1; __i != __last1; ++__i) { in __is_permutation()
118 for (_ForwardIterator1 __j = _VSTD::next(__i); __j != __last1; ++__j) in __is_permutation()
[all …]
|
| H A D | equal.h | 26 equal(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _BinaryPredicate… in equal() argument
27 for (; __first1 != __last1; ++__first1, (void)++__first2) in equal()
35 equal(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2) { in equal() argument
38 return _VSTD::equal(__first1, __last1, __first2, __equal_to<__v1, __v2>()); in equal()
46 for (; __first1 != __last1 && __first2 != __last2; ++__first1, (void)++__first2) in __equal()
49 return __first1 == __last1 && __first2 == __last2; in __equal()
54 __equal(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1, _RandomAccessIterator2 __f… in __equal() argument
57 if (_VSTD::distance(__first1, __last1) != _VSTD::distance(__first2, __last2)) in __equal()
60 _BinaryPredicate&>(__first1, __last1, __first2, __pred); in __equal()
65 equal(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 … in equal() argument
[all …]
|
| /dports/devel/wasi-compiler-rt13/llvm-project-13.0.1.src/libcxx/include/__algorithm/ |
| H A D | find_end.h | 33 _ForwardIterator1 __r = __last1; // __last1 is the "default" answer in __find_end()
38 if (__first1 == __last1) // if source exhausted return last correct answer in __find_end()
53 if (++__m1 == __last1) // Source exhausted, return last answer in __find_end()
70 return __last1; // Everything matches an empty sequence in __find_end()
71 _BidirectionalIterator1 __l1 = __last1; in __find_end()
78 return __last1; in __find_end()
89 return __last1; in __find_end()
105 return __last1; in __find_end()
108 return __last1; in __find_end()
110 _RandomAccessIterator1 __l1 = __last1; in __find_end()
[all …]
|
| H A D | search.h | 30 _LIBCPP_CONSTEXPR_AFTER_CXX11 __search(_ForwardIterator1 __first1, _ForwardIterator1 __last1, in __search() argument
38 if (__first1 == __last1) // return __last1 if no element matches *__first2 in __search()
39 return _VSTD::make_pair(__last1, __last1); in __search()
50 if (++__m1 == __last1) // Otherwise if source exhaused, pattern not found in __search()
51 return _VSTD::make_pair(__last1, __last1); in __search()
63 __search(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1, _RandomAccessIterator2 __… in __search() argument
72 const _D1 __len1 = __last1 - __first1; in __search()
74 return _VSTD::make_pair(__last1, __last1); in __search()
80 return _VSTD::make_pair(__last1, __last1); in __search()
105 __first1, __last1, __first2, __last2, __pred, in search()
[all …]
|
| H A D | is_permutation.h | 33 for (; __first1 != __last1; ++__first1, (void)++__first2) in is_permutation()
36 if (__first1 == __last1) in is_permutation()
41 _D1 __l1 = _VSTD::distance(__first1, __last1); in is_permutation()
47 for (_ForwardIterator1 __i = __first1; __i != __last1; ++__i) { in is_permutation()
63 for (_ForwardIterator1 __j = _VSTD::next(__i); __j != __last1; ++__j) in is_permutation()
87 for (; __first1 != __last1 && __first2 != __last2; ++__first1, (void)++__first2) in __is_permutation()
90 if (__first1 == __last1) in __is_permutation()
96 _D1 __l1 = _VSTD::distance(__first1, __last1); in __is_permutation()
105 for (_ForwardIterator1 __i = __first1; __i != __last1; ++__i) { in __is_permutation()
121 for (_ForwardIterator1 __j = _VSTD::next(__i); __j != __last1; ++__j) in __is_permutation()
[all …]
|
| H A D | equal.h | 29 equal(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _BinaryPredicate… in equal() argument
30 for (; __first1 != __last1; ++__first1, (void)++__first2) in equal()
38 equal(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2) { in equal() argument
41 return _VSTD::equal(__first1, __last1, __first2, __equal_to<__v1, __v2>()); in equal()
47 __equal(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator… in __equal() argument
49 for (; __first1 != __last1 && __first2 != __last2; ++__first1, (void)++__first2) in __equal()
52 return __first1 == __last1 && __first2 == __last2; in __equal()
57 __equal(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1, _RandomAccessIterator2 __f… in __equal() argument
60 if (_VSTD::distance(__first1, __last1) != _VSTD::distance(__first2, __last2)) in __equal()
68 equal(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 … in equal() argument
[all …]
|
| /dports/lang/zig/zig-0.9.0/lib/libcxx/include/__algorithm/ |
| H A D | find_end.h | 33 _ForwardIterator1 __r = __last1; // __last1 is the "default" answer in __find_end()
38 if (__first1 == __last1) // if source exhausted return last correct answer in __find_end()
53 if (++__m1 == __last1) // Source exhausted, return last answer in __find_end()
70 return __last1; // Everything matches an empty sequence in __find_end()
71 _BidirectionalIterator1 __l1 = __last1; in __find_end()
78 return __last1; in __find_end()
89 return __last1; in __find_end()
105 return __last1; in __find_end()
108 return __last1; in __find_end()
110 _RandomAccessIterator1 __l1 = __last1; in __find_end()
[all …]
|
| H A D | search.h | 30 _LIBCPP_CONSTEXPR_AFTER_CXX11 __search(_ForwardIterator1 __first1, _ForwardIterator1 __last1, in __search() argument
38 if (__first1 == __last1) // return __last1 if no element matches *__first2 in __search()
39 return _VSTD::make_pair(__last1, __last1); in __search()
50 if (++__m1 == __last1) // Otherwise if source exhaused, pattern not found in __search()
51 return _VSTD::make_pair(__last1, __last1); in __search()
63 __search(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1, _RandomAccessIterator2 __… in __search() argument
72 const _D1 __len1 = __last1 - __first1; in __search()
74 return _VSTD::make_pair(__last1, __last1); in __search()
80 return _VSTD::make_pair(__last1, __last1); in __search()
105 __first1, __last1, __first2, __last2, __pred, in search()
[all …]
|
| H A D | is_permutation.h | 33 for (; __first1 != __last1; ++__first1, (void)++__first2) in is_permutation()
36 if (__first1 == __last1) in is_permutation()
41 _D1 __l1 = _VSTD::distance(__first1, __last1); in is_permutation()
47 for (_ForwardIterator1 __i = __first1; __i != __last1; ++__i) { in is_permutation()
63 for (_ForwardIterator1 __j = _VSTD::next(__i); __j != __last1; ++__j) in is_permutation()
87 for (; __first1 != __last1 && __first2 != __last2; ++__first1, (void)++__first2) in __is_permutation()
90 if (__first1 == __last1) in __is_permutation()
96 _D1 __l1 = _VSTD::distance(__first1, __last1); in __is_permutation()
105 for (_ForwardIterator1 __i = __first1; __i != __last1; ++__i) { in __is_permutation()
121 for (_ForwardIterator1 __j = _VSTD::next(__i); __j != __last1; ++__j) in __is_permutation()
[all …]
|
| H A D | equal.h | 29 equal(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _BinaryPredicate… in equal() argument
30 for (; __first1 != __last1; ++__first1, (void)++__first2) in equal()
38 equal(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2) { in equal() argument
41 return _VSTD::equal(__first1, __last1, __first2, __equal_to<__v1, __v2>()); in equal()
47 __equal(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator… in __equal() argument
49 for (; __first1 != __last1 && __first2 != __last2; ++__first1, (void)++__first2) in __equal()
52 return __first1 == __last1 && __first2 == __last2; in __equal()
57 __equal(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1, _RandomAccessIterator2 __f… in __equal() argument
60 if (_VSTD::distance(__first1, __last1) != _VSTD::distance(__first2, __last2)) in __equal()
68 equal(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 … in equal() argument
[all …]
|
| /dports/lang/zig-devel/zig-0.9.0/lib/libcxx/include/__algorithm/ |
| H A D | find_end.h | 33 _ForwardIterator1 __r = __last1; // __last1 is the "default" answer in __find_end()
38 if (__first1 == __last1) // if source exhausted return last correct answer in __find_end()
53 if (++__m1 == __last1) // Source exhausted, return last answer in __find_end()
70 return __last1; // Everything matches an empty sequence in __find_end()
71 _BidirectionalIterator1 __l1 = __last1; in __find_end()
78 return __last1; in __find_end()
89 return __last1; in __find_end()
105 return __last1; in __find_end()
108 return __last1; in __find_end()
110 _RandomAccessIterator1 __l1 = __last1; in __find_end()
[all …]
|
| H A D | search.h | 30 _LIBCPP_CONSTEXPR_AFTER_CXX11 __search(_ForwardIterator1 __first1, _ForwardIterator1 __last1, in __search() argument
38 if (__first1 == __last1) // return __last1 if no element matches *__first2 in __search()
39 return _VSTD::make_pair(__last1, __last1); in __search()
50 if (++__m1 == __last1) // Otherwise if source exhaused, pattern not found in __search()
51 return _VSTD::make_pair(__last1, __last1); in __search()
63 __search(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1, _RandomAccessIterator2 __… in __search() argument
72 const _D1 __len1 = __last1 - __first1; in __search()
74 return _VSTD::make_pair(__last1, __last1); in __search()
80 return _VSTD::make_pair(__last1, __last1); in __search()
105 __first1, __last1, __first2, __last2, __pred, in search()
[all …]
|
| H A D | is_permutation.h | 33 for (; __first1 != __last1; ++__first1, (void)++__first2) in is_permutation()
36 if (__first1 == __last1) in is_permutation()
41 _D1 __l1 = _VSTD::distance(__first1, __last1); in is_permutation()
47 for (_ForwardIterator1 __i = __first1; __i != __last1; ++__i) { in is_permutation()
63 for (_ForwardIterator1 __j = _VSTD::next(__i); __j != __last1; ++__j) in is_permutation()
87 for (; __first1 != __last1 && __first2 != __last2; ++__first1, (void)++__first2) in __is_permutation()
90 if (__first1 == __last1) in __is_permutation()
96 _D1 __l1 = _VSTD::distance(__first1, __last1); in __is_permutation()
105 for (_ForwardIterator1 __i = __first1; __i != __last1; ++__i) { in __is_permutation()
121 for (_ForwardIterator1 __j = _VSTD::next(__i); __j != __last1; ++__j) in __is_permutation()
[all …]
|
| H A D | equal.h | 29 equal(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _BinaryPredicate… in equal() argument
30 for (; __first1 != __last1; ++__first1, (void)++__first2) in equal()
38 equal(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2) { in equal() argument
41 return _VSTD::equal(__first1, __last1, __first2, __equal_to<__v1, __v2>()); in equal()
47 __equal(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator… in __equal() argument
49 for (; __first1 != __last1 && __first2 != __last2; ++__first1, (void)++__first2) in __equal()
52 return __first1 == __last1 && __first2 == __last2; in __equal()
57 __equal(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1, _RandomAccessIterator2 __f… in __equal() argument
60 if (_VSTD::distance(__first1, __last1) != _VSTD::distance(__first2, __last2)) in __equal()
68 equal(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 … in equal() argument
[all …]
|
| /dports/devel/llvm13/llvm-project-13.0.1.src/libcxx/include/__algorithm/ |
| H A D | find_end.h | 33 _ForwardIterator1 __r = __last1; // __last1 is the "default" answer
38 if (__first1 == __last1) // if source exhausted return last correct answer
53 if (++__m1 == __last1) // Source exhausted, return last answer
70 return __last1; // Everything matches an empty sequence
71 _BidirectionalIterator1 __l1 = __last1;
78 return __last1;
89 return __last1;
105 return __last1;
108 return __last1;
110 _RandomAccessIterator1 __l1 = __last1;
[all …]
|
| H A D | search.h | 30 _LIBCPP_CONSTEXPR_AFTER_CXX11 __search(_ForwardIterator1 __first1, _ForwardIterator1 __last1, in __search() argument
38 if (__first1 == __last1) // return __last1 if no element matches *__first2 in __search()
39 return _VSTD::make_pair(__last1, __last1); in __search()
50 if (++__m1 == __last1) // Otherwise if source exhaused, pattern not found in __search()
51 return _VSTD::make_pair(__last1, __last1); in __search()
63 __search(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1, _RandomAccessIterator2 __… in __search() argument
72 const _D1 __len1 = __last1 - __first1; in __search()
74 return _VSTD::make_pair(__last1, __last1); in __search()
80 return _VSTD::make_pair(__last1, __last1); in __search()
105 __first1, __last1, __first2, __last2, __pred, in search()
[all …]
|
| H A D | is_permutation.h | 33 for (; __first1 != __last1; ++__first1, (void)++__first2) in is_permutation()
36 if (__first1 == __last1) in is_permutation()
41 _D1 __l1 = _VSTD::distance(__first1, __last1); in is_permutation()
47 for (_ForwardIterator1 __i = __first1; __i != __last1; ++__i) { in is_permutation()
63 for (_ForwardIterator1 __j = _VSTD::next(__i); __j != __last1; ++__j) in is_permutation()
87 for (; __first1 != __last1 && __first2 != __last2; ++__first1, (void)++__first2) in __is_permutation()
90 if (__first1 == __last1) in __is_permutation()
96 _D1 __l1 = _VSTD::distance(__first1, __last1); in __is_permutation()
105 for (_ForwardIterator1 __i = __first1; __i != __last1; ++__i) { in __is_permutation()
121 for (_ForwardIterator1 __j = _VSTD::next(__i); __j != __last1; ++__j) in __is_permutation()
[all …]
|