00001 /* ///////////////////////////////////////////////////////////////////////// 00002 * File: stlsoft/algorithms/collection.hpp 00003 * 00004 * Purpose: Whole collection 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_HPP_COLLECTION 00048 #define STLSOFT_INCL_STLSOFT_ALGORITHMS_HPP_COLLECTION 00049 00050 #ifndef STLSOFT_DOCUMENTATION_SKIP_SECTION 00051 # define STLSOFT_VER_STLSOFT_ALGORITHMS_HPP_COLLECTION_MAJOR 3 00052 # define STLSOFT_VER_STLSOFT_ALGORITHMS_HPP_COLLECTION_MINOR 1 00053 # define STLSOFT_VER_STLSOFT_ALGORITHMS_HPP_COLLECTION_REVISION 1 00054 # define STLSOFT_VER_STLSOFT_ALGORITHMS_HPP_COLLECTION_EDIT 69 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 #ifndef STLSOFT_INCL_STLSOFT_ALGORITHM_STD_HPP_ALT 00065 # include <stlsoft/algorithms/std/alt.hpp> 00066 #endif /* !STLSOFT_INCL_STLSOFT_ALGORITHM_STD_HPP_ALT */ 00067 00068 /* ///////////////////////////////////////////////////////////////////////// 00069 * Namespace 00070 */ 00071 00072 #ifndef _STLSOFT_NO_NAMESPACE 00073 namespace stlsoft 00074 { 00075 #endif /* _STLSOFT_NO_NAMESPACE */ 00076 00077 /* ///////////////////////////////////////////////////////////////////////// 00078 * Algorithms 00079 */ 00080 00088 template< ss_typename_param_k C 00089 , ss_typename_param_k V 00090 > 00091 // [[synesis:function:algorithm: fill_all(T<C> &container, T<T> const& value)]] 00092 inline void fill_all(C &container, V const& value) 00093 { 00094 fill(container.begin(), container.end(), value); 00095 } 00096 00097 #ifdef STLSOFT_CF_STATIC_ARRAY_SIZE_DETERMINATION_SUPPORT 00098 00105 // [[synesis:function:algorithm: fill_all(T-A<T, N> ar, T<T> const& value)]] 00106 template< ss_typename_param_k T 00107 , ss_size_t N 00108 , ss_typename_param_k V 00109 > 00110 inline void fill_all(T (&ar)[N], V const& value) 00111 { 00112 fill(&ar[0], &ar[N], value); 00113 } 00114 #endif /* STLSOFT_CF_STATIC_ARRAY_SIZE_DETERMINATION_SUPPORT */ 00115 00116 00117 00125 template< ss_typename_param_k C 00126 , ss_typename_param_k UF 00127 > 00128 // [[synesis:function:algorithm: for_all(T<C> &container, T<UF> func)]] 00129 inline UF for_all(C &container, UF func) 00130 { 00131 return std_for_each(container.begin(), container.end(), func); 00132 } 00133 00134 #ifdef STLSOFT_CF_STATIC_ARRAY_SIZE_DETERMINATION_SUPPORT 00135 00142 // [[synesis:function:algorithm: for_all(T-A<T, N> ar, T<UF> func)]] 00143 template< ss_typename_param_k T 00144 , ss_size_t N 00145 , ss_typename_param_k UF 00146 > 00147 inline UF for_all(T (&ar)[N], UF func) 00148 { 00149 return std_for_each(&ar[0], &ar[N], func); 00150 } 00151 #endif /* STLSOFT_CF_STATIC_ARRAY_SIZE_DETERMINATION_SUPPORT */ 00152 00153 00154 00162 // [[synesis:function:algorithm: for_all_r(T<C> &container, T<UF> func)]] 00163 template< ss_typename_param_k C 00164 , ss_typename_param_k UF 00165 > 00166 inline UF for_all_r(C &container, UF func) 00167 { 00168 return std_for_each(container.rbegin(), container.rend(), func); 00169 } 00170 00171 00172 00180 // [[synesis:function:algorithm: copy_all(T<C> &container, T<O> dest)]] 00181 template< ss_typename_param_k C 00182 , ss_typename_param_k O 00183 > 00184 inline O copy_all(C &container, O dest) 00185 { 00186 return std_copy(container.begin(), container.end(), dest); 00187 } 00188 00189 #ifdef STLSOFT_CF_STATIC_ARRAY_SIZE_DETERMINATION_SUPPORT 00190 00197 template< ss_typename_param_k T 00198 , ss_size_t N 00199 , ss_typename_param_k O 00200 > 00201 // [[synesis:function:algorithm: copy_all(T-A<T, N> ar, T<O> dest)]] 00202 inline O copy_all(T (&ar)[N], O dest) 00203 { 00204 return std_copy(&ar[0], &ar[N], dest); 00205 } 00206 #endif /* STLSOFT_CF_STATIC_ARRAY_SIZE_DETERMINATION_SUPPORT */ 00207 00209 // Unit-testing 00210 00211 #ifdef STLSOFT_UNITTEST 00212 # include "./unittest/collection_unittest_.h" 00213 #endif /* STLSOFT_UNITTEST */ 00214 00215 /* ////////////////////////////////////////////////////////////////////// */ 00216 00217 #ifndef _STLSOFT_NO_NAMESPACE 00218 } // namespace stlsoft 00219 #endif /* _STLSOFT_NO_NAMESPACE */ 00220 00221 /* ////////////////////////////////////////////////////////////////////// */ 00222 00223 #endif /* !STLSOFT_INCL_STLSOFT_ALGORITHMS_HPP_COLLECTION */ 00224 00225 /* ///////////////////////////// end of file //////////////////////////// */