00001
00002
00003
00004
00005
00006
00007
00008
00009
00010
00011
00012
00013
00014
00015
00016
00017
00018
00019
00020
00021
00022
00023
00024
00025
00026
00027
00028
00029
00030
00031
00032
00033 #ifndef _GLIBCXX_PARALLEL_FIND_SELECTORS_H
00034 #define _GLIBCXX_PARALLEL_FIND_SELECTORS_H 1
00035
00036 #include <parallel/tags.h>
00037 #include <parallel/basic_iterator.h>
00038 #include <bits/stl_pair.h>
00039
00040 namespace __gnu_parallel
00041 {
00042
00043 struct __generic_find_selector
00044 { };
00045
00046
00047
00048
00049
00050 struct __find_if_selector : public __generic_find_selector
00051 {
00052
00053
00054
00055
00056
00057 template<typename _RAIter1, typename _RAIter2,
00058 typename _Pred>
00059 bool
00060 operator()(_RAIter1 __i1, _RAIter2 __i2, _Pred __pred)
00061 { return __pred(*__i1); }
00062
00063
00064
00065
00066
00067
00068
00069 template<typename _RAIter1, typename _RAIter2,
00070 typename _Pred>
00071 std::pair<_RAIter1, _RAIter2>
00072 _M_sequential_algorithm(_RAIter1 __begin1,
00073 _RAIter1 __end1,
00074 _RAIter2 __begin2, _Pred __pred)
00075 { return std::make_pair(find_if(__begin1, __end1, __pred,
00076 sequential_tag()), __begin2); }
00077 };
00078
00079
00080 struct __adjacent_find_selector : public __generic_find_selector
00081 {
00082
00083
00084
00085
00086
00087 template<typename _RAIter1, typename _RAIter2,
00088 typename _Pred>
00089 bool
00090 operator()(_RAIter1 __i1, _RAIter2 __i2, _Pred __pred)
00091 {
00092
00093 return __pred(*__i1, *(__i1 + 1));
00094 }
00095
00096
00097
00098
00099
00100
00101
00102 template<typename _RAIter1, typename _RAIter2,
00103 typename _Pred>
00104 std::pair<_RAIter1, _RAIter2>
00105 _M_sequential_algorithm(_RAIter1 __begin1,
00106 _RAIter1 __end1,
00107 _RAIter2 __begin2, _Pred __pred)
00108 {
00109
00110 _RAIter1 __spot = adjacent_find(__begin1, __end1 + 1,
00111 __pred, sequential_tag());
00112 if (__spot == (__end1 + 1))
00113 __spot = __end1;
00114 return std::make_pair(__spot, __begin2);
00115 }
00116 };
00117
00118
00119 struct __mismatch_selector : public __generic_find_selector
00120 {
00121
00122
00123
00124
00125
00126
00127 template<typename _RAIter1, typename _RAIter2,
00128 typename _Pred>
00129 bool
00130 operator()(_RAIter1 __i1, _RAIter2 __i2, _Pred __pred)
00131 { return !__pred(*__i1, *__i2); }
00132
00133
00134
00135
00136
00137
00138
00139
00140 template<typename _RAIter1, typename _RAIter2,
00141 typename _Pred>
00142 std::pair<_RAIter1, _RAIter2>
00143 _M_sequential_algorithm(_RAIter1 __begin1,
00144 _RAIter1 __end1,
00145 _RAIter2 __begin2, _Pred __pred)
00146 { return mismatch(__begin1, __end1, __begin2,
00147 __pred, sequential_tag()); }
00148 };
00149
00150
00151
00152 template<typename _FIterator>
00153 struct __find_first_of_selector : public __generic_find_selector
00154 {
00155 _FIterator _M_begin;
00156 _FIterator _M_end;
00157
00158 explicit __find_first_of_selector(_FIterator __begin,
00159 _FIterator __end)
00160 : _M_begin(__begin), _M_end(__end) { }
00161
00162
00163
00164
00165
00166 template<typename _RAIter1, typename _RAIter2,
00167 typename _Pred>
00168 bool
00169 operator()(_RAIter1 __i1, _RAIter2 __i2, _Pred __pred)
00170 {
00171 for (_FIterator __pos_in_candidates = _M_begin;
00172 __pos_in_candidates != _M_end; ++__pos_in_candidates)
00173 if (__pred(*__i1, *__pos_in_candidates))
00174 return true;
00175 return false;
00176 }
00177
00178
00179
00180
00181
00182
00183 template<typename _RAIter1, typename _RAIter2,
00184 typename _Pred>
00185 std::pair<_RAIter1, _RAIter2>
00186 _M_sequential_algorithm(_RAIter1 __begin1,
00187 _RAIter1 __end1,
00188 _RAIter2 __begin2, _Pred __pred)
00189 {
00190 return std::make_pair(find_first_of(__begin1, __end1,
00191 _M_begin, _M_end, __pred,
00192 sequential_tag()), __begin2);
00193 }
00194 };
00195 }
00196
00197 #endif