00001 /* ///////////////////////////////////////////////////////////////////////// 00002 * File: stlsoft/algorithms/std/ext.hpp 00003 * 00004 * Purpose: Extensions to standard algorithms. 00005 * 00006 * Created: 17th January 2002 00007 * Updated: 10th August 2009 00008 * 00009 * Home: http://stlsoft.org/ 00010 * 00011 * Copyright (c) 2002-2009, Matthew Wilson and Synesis Software 00012 * All rights reserved. 00013 * 00014 * Redistribution and use in source and binary forms, with or without 00015 * modification, are permitted provided that the following conditions are met: 00016 * 00017 * - Redistributions of source code must retain the above copyright notice, this 00018 * list of conditions and the following disclaimer. 00019 * - Redistributions in binary form must reproduce the above copyright notice, 00020 * this list of conditions and the following disclaimer in the documentation 00021 * and/or other materials provided with the distribution. 00022 * - Neither the name(s) of Matthew Wilson and Synesis Software nor the names of 00023 * any contributors may be used to endorse or promote products derived from 00024 * this software without specific prior written permission. 00025 * 00026 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" 00027 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 00028 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 00029 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE 00030 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR 00031 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF 00032 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS 00033 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN 00034 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) 00035 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE 00036 * POSSIBILITY OF SUCH DAMAGE. 00037 * 00038 * ////////////////////////////////////////////////////////////////////// */ 00039 00040 00047 #ifndef STLSOFT_INCL_STLSOFT_ALGORITHMS_STD_HPP_EXT 00048 #define STLSOFT_INCL_STLSOFT_ALGORITHMS_STD_HPP_EXT 00049 00050 #ifndef STLSOFT_DOCUMENTATION_SKIP_SECTION 00051 # define STLSOFT_VER_STLSOFT_ALGORITHMS_STD_HPP_EXT_MAJOR 3 00052 # define STLSOFT_VER_STLSOFT_ALGORITHMS_STD_HPP_EXT_MINOR 2 00053 # define STLSOFT_VER_STLSOFT_ALGORITHMS_STD_HPP_EXT_REVISION 5 00054 # define STLSOFT_VER_STLSOFT_ALGORITHMS_STD_HPP_EXT_EDIT 72 00055 #endif /* !STLSOFT_DOCUMENTATION_SKIP_SECTION */ 00056 00057 /* ///////////////////////////////////////////////////////////////////////// 00058 * Includes 00059 */ 00060 00061 #ifndef STLSOFT_INCL_STLSOFT_H_STLSOFT 00062 # include <stlsoft/stlsoft.h> 00063 #endif /* !STLSOFT_INCL_STLSOFT_H_STLSOFT */ 00064 00065 #ifdef STLSOFT_UNITTEST 00066 # if defined(STLSOFT_COMPILER_IS_BORLAND) 00067 # include <memory.h> // for memcpy() 00068 # else /* ? compiler */ 00069 # include <string.h> // for memcpy() 00070 # endif /* compiler */ 00071 #endif /* STLSOFT_UNITTEST */ 00072 00073 /* ///////////////////////////////////////////////////////////////////////// 00074 * Namespace 00075 */ 00076 00077 #ifndef _STLSOFT_NO_NAMESPACE 00078 namespace stlsoft 00079 { 00080 #endif /* _STLSOFT_NO_NAMESPACE */ 00081 00082 /* ///////////////////////////////////////////////////////////////////////// 00083 * Algorithms 00084 */ 00085 00101 template< ss_typename_param_k I 00102 , ss_typename_param_k O 00103 , ss_typename_param_k UP 00104 > 00105 // [[synesis:function:algorithm: copy_if(T<I> first, T<I> last, T<O> dest, T<UP> pred)]] 00106 inline O copy_if(I first, I last, O dest, UP pred) 00107 { 00108 for(; first != last; ++first) 00109 { 00110 if(pred(*first)) 00111 { 00112 *dest++ = *first; 00113 } 00114 } 00115 00116 return dest; 00117 } 00118 00133 template< ss_typename_param_k I 00134 , ss_typename_param_k UF 00135 , ss_typename_param_k UP 00136 > 00137 // [[synesis:function:algorithm: for_each_if(T<I> first, T<I> last, T<UF> func, T<UP> pred)]] 00138 inline UF for_each_if(I first, I last, UF func, UP pred) 00139 { 00140 for(; first != last; ++first) 00141 { 00142 if(pred(*first)) 00143 { 00144 func(*first); 00145 } 00146 } 00147 00148 return func; 00149 } 00150 00151 #ifndef STLSOFT_DOCUMENTATION_SKIP_SECTION 00152 template< ss_typename_param_k I 00153 , ss_typename_param_k UF 00154 , ss_typename_param_k UP 00155 > 00156 // [[synesis:function:algorithm: for_each_ifnot(T<I> first, T<I> last, T<UF> func, T<UP> pred)]] 00157 inline UF for_each_ifnot(I first, I last, UF func, UP pred) 00158 { 00159 for(; first != last; ++first) 00160 { 00161 if(!pred(*first)) 00162 { 00163 func(*first); 00164 } 00165 } 00166 00167 return func; 00168 } 00169 #endif /* !STLSOFT_DOCUMENTATION_SKIP_SECTION */ 00170 00171 00172 00173 00188 template< ss_typename_param_k O 00189 , ss_typename_param_k V 00190 , ss_typename_param_k UP 00191 > 00192 // [[synesis:function:algorithm: fill_if(T<O> first, T<O> last, T<V> const& value, T<UP> pred)]] 00193 inline void fill_if(O first, O last, V const& value, UP pred) 00194 { 00195 for(; first != last; ++first) 00196 { 00197 if(pred(*first)) 00198 { 00199 *first = value; 00200 } 00201 } 00202 } 00203 00204 00206 // Unit-testing 00207 00208 #ifdef STLSOFT_UNITTEST 00209 # include "./unittest/ext_unittest_.h" 00210 #endif /* STLSOFT_UNITTEST */ 00211 00212 /* ////////////////////////////////////////////////////////////////////// */ 00213 00214 #ifndef _STLSOFT_NO_NAMESPACE 00215 } // namespace stlsoft 00216 #endif /* _STLSOFT_NO_NAMESPACE */ 00217 00218 /* ////////////////////////////////////////////////////////////////////// */ 00219 00220 #endif /* !STLSOFT_INCL_STLSOFT_ALGORITHMS_STD_HPP_EXT */ 00221 00222 /* ///////////////////////////// end of file //////////////////////////// */