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 RandomAccessIterator1, typename RandomAccessIterator2,
00058 typename Pred>
00059 bool
00060 operator()(RandomAccessIterator1 i1, RandomAccessIterator2 i2, Pred pred)
00061 { return pred(*i1); }
00062
00063
00064
00065
00066
00067
00068
00069 template<typename RandomAccessIterator1, typename RandomAccessIterator2,
00070 typename Pred>
00071 std::pair<RandomAccessIterator1, RandomAccessIterator2>
00072 sequential_algorithm(RandomAccessIterator1 begin1,
00073 RandomAccessIterator1 end1,
00074 RandomAccessIterator2 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 RandomAccessIterator1, typename RandomAccessIterator2,
00088 typename Pred>
00089 bool
00090 operator()(RandomAccessIterator1 i1, RandomAccessIterator2 i2, Pred pred)
00091 {
00092
00093 return pred(*i1, *(i1 + 1));
00094 }
00095
00096
00097
00098
00099
00100
00101
00102 template<typename RandomAccessIterator1, typename RandomAccessIterator2,
00103 typename Pred>
00104 std::pair<RandomAccessIterator1, RandomAccessIterator2>
00105 sequential_algorithm(RandomAccessIterator1 begin1,
00106 RandomAccessIterator1 end1,
00107 RandomAccessIterator2 begin2, Pred pred)
00108 {
00109
00110 RandomAccessIterator1 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 RandomAccessIterator1, typename RandomAccessIterator2,
00128 typename Pred>
00129 bool
00130 operator()(RandomAccessIterator1 i1, RandomAccessIterator2 i2, Pred pred)
00131 { return !pred(*i1, *i2); }
00132
00133
00134
00135
00136
00137
00138
00139
00140 template<typename RandomAccessIterator1, typename RandomAccessIterator2,
00141 typename Pred>
00142 std::pair<RandomAccessIterator1, RandomAccessIterator2>
00143 sequential_algorithm(RandomAccessIterator1 begin1,
00144 RandomAccessIterator1 end1,
00145 RandomAccessIterator2 begin2, Pred pred)
00146 { return mismatch(begin1, end1, begin2, pred, sequential_tag()); }
00147 };
00148
00149
00150
00151 template<typename ForwardIterator>
00152 struct find_first_of_selector : public generic_find_selector
00153 {
00154 ForwardIterator begin;
00155 ForwardIterator end;
00156
00157 explicit find_first_of_selector(ForwardIterator begin, ForwardIterator end)
00158 : begin(begin), end(end) { }
00159
00160
00161
00162
00163
00164 template<typename RandomAccessIterator1, typename RandomAccessIterator2,
00165 typename Pred>
00166 bool
00167 operator()(RandomAccessIterator1 i1, RandomAccessIterator2 i2, Pred pred)
00168 {
00169 for (ForwardIterator pos_in_candidates = begin;
00170 pos_in_candidates != end; ++pos_in_candidates)
00171 if (pred(*i1, *pos_in_candidates))
00172 return true;
00173 return false;
00174 }
00175
00176
00177
00178
00179
00180
00181 template<typename RandomAccessIterator1, typename RandomAccessIterator2,
00182 typename Pred>
00183 std::pair<RandomAccessIterator1, RandomAccessIterator2>
00184 sequential_algorithm(RandomAccessIterator1 begin1,
00185 RandomAccessIterator1 end1,
00186 RandomAccessIterator2 begin2, Pred pred)
00187 { return std::make_pair(find_first_of(begin1, end1, begin, end, pred,
00188 sequential_tag()), begin2); }
00189 };
00190 }
00191
00192 #endif