00001 /* ///////////////////////////////////////////////////////////////////////// 00002 * File: stlsoft/algorithms/bounded.hpp 00003 * 00004 * Purpose: Bounded algorithms. 00005 * 00006 * Created: 23rd October 2004 00007 * Updated: 10th August 2009 00008 * 00009 * Home: http://stlsoft.org/ 00010 * 00011 * Copyright (c) 2004-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_HPP_BOUNDED 00048 #define STLSOFT_INCL_STLSOFT_ALGORITHMS_HPP_BOUNDED 00049 00050 #ifndef STLSOFT_DOCUMENTATION_SKIP_SECTION 00051 # define STLSOFT_VER_STLSOFT_ALGORITHMS_HPP_BOUNDED_MAJOR 2 00052 # define STLSOFT_VER_STLSOFT_ALGORITHMS_HPP_BOUNDED_MINOR 1 00053 # define STLSOFT_VER_STLSOFT_ALGORITHMS_HPP_BOUNDED_REVISION 1 00054 # define STLSOFT_VER_STLSOFT_ALGORITHMS_HPP_BOUNDED_EDIT 22 00055 #endif /* !STLSOFT_DOCUMENTATION_SKIP_SECTION */ 00056 00057 /* ///////////////////////////////////////////////////////////////////////// 00058 * Compatibility 00059 */ 00060 00061 /* 00062 [Incompatibilies-start] 00063 STLSOFT_COMPILER_IS_WATCOM: 00064 [Incompatibilies-end] 00065 */ 00066 00067 /* ///////////////////////////////////////////////////////////////////////// 00068 * Includes 00069 */ 00070 00071 #ifndef STLSOFT_INCL_STLSOFT_H_STLSOFT 00072 # include <stlsoft/stlsoft.h> 00073 #endif /* !STLSOFT_INCL_STLSOFT_H_STLSOFT */ 00074 #ifndef STLSOFT_INCL_STLSOFT_ALGORITHM_STD_HPP_ALT 00075 # include <stlsoft/algorithms/std/alt.hpp> 00076 #endif /* !STLSOFT_INCL_STLSOFT_ALGORITHM_STD_HPP_ALT */ 00077 #ifdef STLSOFT_CF_std_NAMESPACE 00078 # include <iterator> // for the iterator tags 00079 # include <utility> // for std::pair 00080 #endif /* STLSOFT_CF_std_NAMESPACE */ 00081 00082 #ifdef STLSOFT_UNITTEST 00083 # include <string.h> // for strcmp 00084 #endif /* STLSOFT_UNITTEST */ 00085 00086 /* ///////////////////////////////////////////////////////////////////////// 00087 * Namespace 00088 */ 00089 00090 #ifndef _STLSOFT_NO_NAMESPACE 00091 namespace stlsoft 00092 { 00093 #endif /* _STLSOFT_NO_NAMESPACE */ 00094 00095 /* ///////////////////////////////////////////////////////////////////////// 00096 * Algorithms 00097 */ 00098 00108 template< ss_typename_param_k I 00109 , ss_typename_param_k O 00110 > 00111 // [[synesis:function:algorithm: copy_n(T<I> src, size_t n, T<O> dest)]] 00112 inline O copy_n(I src, ss_size_t n, O dest) 00113 { 00114 for(; n != 0; ++src, ++dest, --n) 00115 { 00116 *dest = *src; 00117 } 00118 00119 return dest; 00120 } 00121 00122 00133 template< ss_typename_param_k I 00134 , ss_typename_param_k T 00135 > 00136 // [[synesis:function:algorithm: replace_n(T<I> src, size_t n, T<T> const& oldValue, T<T> const& newValue)]] 00137 inline void replace_n(I src, ss_size_t n, T const& oldValue, T const& newValue) 00138 { 00139 #if 0 00140 00141 // NOTE: Why this is not valid!!!!!!!! 00142 00143 std_replace(src, src + n, oldValue, newValue); 00144 #else /* ? 0 */ 00145 for(; 0 != n; ++src, --n) 00146 { 00147 if(oldValue == *src) 00148 { 00149 *src = newValue; 00150 } 00151 } 00152 #endif /* 0 */ 00153 } 00154 00156 // Unit-testing 00157 00158 #ifdef STLSOFT_UNITTEST 00159 # include "./unittest/bounded_unittest_.h" 00160 #endif /* STLSOFT_UNITTEST */ 00161 00162 /* ////////////////////////////////////////////////////////////////////// */ 00163 00164 #ifndef _STLSOFT_NO_NAMESPACE 00165 } // namespace stlsoft 00166 #endif /* _STLSOFT_NO_NAMESPACE */ 00167 00168 /* ////////////////////////////////////////////////////////////////////// */ 00169 00170 #endif /* !STLSOFT_INCL_STLSOFT_ALGORITHMS_HPP_BOUNDED */ 00171 00172 /* ///////////////////////////// end of file //////////////////////////// */