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
00034
00035
00036
00037
00038
00039
00040
00065 #ifndef RANGELIB_INCL_RANGELIB_HPP_SALGORITHMS
00066 #define RANGELIB_INCL_RANGELIB_HPP_SALGORITHMS
00067
00068 #ifndef STLSOFT_DOCUMENTATION_SKIP_SECTION
00069 # define RANGELIB_VER_RANGELIB_HPP_SALGORITHMS_MAJOR 1
00070 # define RANGELIB_VER_RANGELIB_HPP_SALGORITHMS_MINOR 1
00071 # define RANGELIB_VER_RANGELIB_HPP_SALGORITHMS_REVISION 3
00072 # define RANGELIB_VER_RANGELIB_HPP_SALGORITHMS_EDIT 17
00073 #endif
00074
00075
00076
00077
00078
00079
00080
00081
00082
00083
00084
00085
00086
00087
00088
00089
00090
00091 #ifndef RANGELIB_INCL_RANGELIB_HPP_RANGELIB
00092 # include <rangelib/rangelib.hpp>
00093 #endif
00094 #ifndef RANGELIB_INCL_RANGELIB_HPP_ALGORITHMS
00095 # include <rangelib/algorithms.hpp>
00096 #endif
00097 #ifndef RANGELIB_INCL_RANGELIB_HPP_SEQUENCE_RANGE
00098 # include <rangelib/sequence_range.hpp>
00099 #endif
00100 #if defined(STLSOFT_CF_TEMPLATE_PARTIAL_SPECIALISATION_SUPPORT)
00101 # ifndef STLSOFT_INCL_STLSOFT_META_DETECTOR_HPP_HAS_CONST_ITERATOR
00102 # include <stlsoft/meta/detector/has_const_iterator.hpp>
00103 # endif
00104 # ifndef STLSOFT_INCL_STLSOFT_META_DETECTOR_HPP_HAS_ITERATOR
00105 # include <stlsoft/meta/detector/has_iterator.hpp>
00106 # endif
00107 #endif
00108
00109
00110
00111
00112
00113 #ifndef RANGELIB_NO_NAMESPACE
00114 # if defined(_STLSOFT_NO_NAMESPACE) || \
00115 defined(STLSOFT_DOCUMENTATION_SKIP_SECTION)
00116
00117 namespace rangelib
00118 {
00119 # else
00120
00121
00122 namespace stlsoft
00123 {
00124
00125 namespace rangelib_project
00126 {
00127
00128 # endif
00129 #endif
00130
00131
00132
00133
00134
00135 template< ss_typename_param_k S
00136 , ss_typename_param_k T
00137 >
00138 inline T sr_accumulate(S &s, T val)
00139 {
00140 #if defined(STLSOFT_CF_TEMPLATE_PARTIAL_SPECIALISATION_SUPPORT)
00141 STLSOFT_STATIC_ASSERT(stlsoft::has_iterator<S>::value || stlsoft::has_const_iterator<S>::value);
00142 #endif
00143
00144 return r_accumulate(sequence_range<S>(s), val);
00145 }
00146
00147 template< ss_typename_param_k S
00148 , ss_typename_param_k T
00149 , ss_typename_param_k P
00150 >
00151 inline T sr_accumulate(S &s, T val, P pred)
00152 {
00153 #if defined(STLSOFT_CF_TEMPLATE_PARTIAL_SPECIALISATION_SUPPORT)
00154 STLSOFT_STATIC_ASSERT(stlsoft::has_iterator<S>::value || stlsoft::has_const_iterator<S>::value);
00155 #endif
00156
00157 return r_accumulate(sequence_range<S>(s), val, pred);
00158 }
00159
00160 template< ss_typename_param_k S
00161 , ss_typename_param_k O
00162 >
00163 inline O sr_copy(S &s, O o)
00164 {
00165 return r_copy(sequence_range<S>(s), o);
00166 }
00167
00168 template< ss_typename_param_k S
00169 , ss_typename_param_k O
00170 , ss_typename_param_k P
00171 >
00172 inline O sr_copy_if(S &s, O o, P pred)
00173 {
00174 return r_copy_if(sequence_range<S>(s), o, pred);
00175 }
00176
00177 template< ss_typename_param_k S
00178 , ss_typename_param_k V
00179 >
00180 inline size_t sr_count(S &s, V const& val)
00181 {
00182 #if defined(STLSOFT_CF_TEMPLATE_PARTIAL_SPECIALISATION_SUPPORT)
00183 STLSOFT_STATIC_ASSERT(stlsoft::has_iterator<S>::value || stlsoft::has_const_iterator<S>::value);
00184 #endif
00185
00186 return r_count(sequence_range<S>(s), val);
00187 }
00188
00189 template< ss_typename_param_k S
00190 , ss_typename_param_k P
00191 >
00192 inline size_t sr_count_if(S &s, P pred)
00193 {
00194 #if defined(STLSOFT_CF_TEMPLATE_PARTIAL_SPECIALISATION_SUPPORT)
00195 STLSOFT_STATIC_ASSERT(stlsoft::has_iterator<S>::value || stlsoft::has_const_iterator<S>::value);
00196 #endif
00197
00198 return r_count_if(sequence_range<S>(s), pred);
00199 }
00200
00201 template <ss_typename_param_k S>
00202 inline ss_ptrdiff_t sr_distance(S &s)
00203 {
00204 return r_distance(sequence_range<S>(s));
00205 }
00206
00207 template< ss_typename_param_k S1
00208 , ss_typename_param_k S2
00209 >
00210 inline ss_bool_t sr_equal(S1 &s1, S2 &s2)
00211 {
00212 STLSOFT_ASSERT(sr_distance(s1) <= sr_distance(s2));
00213
00214 return r_equal(sequence_range<S1>(s1), sequence_range<S2>(s2));
00215 }
00216
00217 template< ss_typename_param_k S
00218 , ss_typename_param_k T
00219 >
00220 inline ss_bool_t sr_exists(S &s, T const& val)
00221 {
00222 return r_exists(sequence_range<S>(s), val);
00223 }
00224
00225 template< ss_typename_param_k S
00226 , ss_typename_param_k P
00227 >
00228 inline ss_bool_t sr_exists_if(S &s, P pred)
00229 {
00230 return r_exists_if(sequence_range<S>(s), pred);
00231 }
00232
00233 template< ss_typename_param_k S
00234 , ss_typename_param_k T
00235 >
00236 inline void sr_fill(S &s, T const& val)
00237 {
00238 r_fill(sequence_range<S>(s), val);
00239 }
00240
00241 template< ss_typename_param_k S
00242 , ss_typename_param_k N
00243 , ss_typename_param_k T
00244 >
00245 inline void sr_fill_n(S &s, N n, T const& val)
00246 {
00247 STLSOFT_ASSERT(n <= r_distance(s));
00248
00249 r_fill_n(sequence_range<S>(s), n, val);
00250 }
00251
00252 template< ss_typename_param_k S
00253 , ss_typename_param_k F
00254 >
00255 inline F sr_for_each(S &s, F f)
00256 {
00257 #if defined(STLSOFT_CF_TEMPLATE_PARTIAL_SPECIALISATION_SUPPORT)
00258 STLSOFT_STATIC_ASSERT(stlsoft::has_iterator<S>::value || stlsoft::has_const_iterator<S>::value);
00259 #endif
00260
00261 return r_for_each(sequence_range<S>(s), f);
00262 }
00263
00264 template< ss_typename_param_k S
00265 , ss_typename_param_k F
00266 >
00267 inline void sr_generate(S &s, F f)
00268 {
00269 r_generate(sequence_range<S>(s), f);
00270 }
00271
00272 template <ss_typename_param_k S>
00273 inline ss_typename_type_ret_k S::value_type sr_max_element(S &s)
00274 {
00275 STLSOFT_ASSERT(sr_distance(s) > 0);
00276
00277 return r_max_element(sequence_range<S>(s));
00278 }
00279 template< ss_typename_param_k S
00280 , ss_typename_param_k F
00281 >
00282 inline ss_typename_type_ret_k S::value_type sr_max_element(S &s, F f)
00283 {
00284 STLSOFT_ASSERT(sr_distance(s) > 0);
00285
00286 return r_max_element(sequence_range<S>(s), f);
00287 }
00288
00289 template <ss_typename_param_k S>
00290 inline ss_typename_type_ret_k S::value_type sr_min_element(S &s)
00291 {
00292 STLSOFT_ASSERT(sr_distance(s) > 0);
00293
00294 return r_min_element(sequence_range<S>(s));
00295 }
00296 template< ss_typename_param_k S
00297 , ss_typename_param_k F
00298 >
00299 inline ss_typename_type_ret_k S::value_type sr_min_element(S &s, F f)
00300 {
00301 STLSOFT_ASSERT(sr_distance(s) > 0);
00302
00303 return r_min_element(sequence_range<S>(s), f);
00304 }
00305
00306 template< ss_typename_param_k S
00307 , ss_typename_param_k T
00308 >
00309 inline void sr_replace(S &s, T oldVal, T newVal)
00310 {
00311 r_replace(sequence_range<S>(s), oldVal, newVal);
00312 }
00313
00314 template< ss_typename_param_k S
00315 , ss_typename_param_k P
00316 , ss_typename_param_k T
00317 >
00318 inline void sr_replace_if(S &s, P pred, T newVal)
00319 {
00320 r_replace_if(sequence_range<S>(s), pred, newVal);
00321 }
00322
00323
00324
00325 #ifndef RANGELIB_NO_NAMESPACE
00326 # if defined(_STLSOFT_NO_NAMESPACE) || \
00327 defined(STLSOFT_DOCUMENTATION_SKIP_SECTION)
00328 }
00329 # else
00330 }
00331 }
00332 # endif
00333 #endif
00334
00335
00336
00337 #endif
00338
00339