00001 /* ///////////////////////////////////////////////////////////////////////// 00002 * File: stlsoft/algorithms/deprecated.hpp 00003 * 00004 * Purpose: Deprecated 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_DEPRECATED 00048 #define STLSOFT_INCL_STLSOFT_ALGORITHMS_HPP_DEPRECATED 00049 00050 #ifndef STLSOFT_DOCUMENTATION_SKIP_SECTION 00051 # define STLSOFT_VER_STLSOFT_ALGORITHMS_HPP_DEPRECATED_MAJOR 3 00052 # define STLSOFT_VER_STLSOFT_ALGORITHMS_HPP_DEPRECATED_MINOR 0 00053 # define STLSOFT_VER_STLSOFT_ALGORITHMS_HPP_DEPRECATED_REVISION 4 00054 # define STLSOFT_VER_STLSOFT_ALGORITHMS_HPP_DEPRECATED_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_ALGORITHMS_HPP_UNORDERED 00065 # include <stlsoft/algorithms/unordered.hpp> 00066 #endif /* !STLSOFT_INCL_STLSOFT_ALGORITHMS_HPP_UNORDERED */ 00067 #ifndef STLSOFT_INCL_STLSOFT_ALGORITHMS_STD_HPP_EXT 00068 # include <stlsoft/algorithms/std/ext.hpp> 00069 #endif /* !STLSOFT_INCL_STLSOFT_ALGORITHMS_STD_HPP_EXT */ 00070 #ifndef STLSOFT_INCL_STLSOFT_ALGORITHMS_STD_HPP_ALT 00071 # include <stlsoft/algorithms/std/alt.hpp> 00072 #endif /* !STLSOFT_INCL_STLSOFT_ALGORITHMS_STD_HPP_ALT */ 00073 00074 /* ///////////////////////////////////////////////////////////////////////// 00075 * Namespace 00076 */ 00077 00078 #ifndef _STLSOFT_NO_NAMESPACE 00079 namespace stlsoft 00080 { 00081 #endif /* _STLSOFT_NO_NAMESPACE */ 00082 00083 /* ///////////////////////////////////////////////////////////////////////// 00084 * Algorithms 00085 */ 00086 00099 template< ss_typename_param_k I 00100 , ss_typename_param_k P 00101 > 00102 // [[synesis:function:algorithm: for_each_count_success(T<I> first, T<I> last, T<UP> pred)]] 00103 inline ss_size_t for_each_count_success(I first, I last, P pred) 00104 { 00105 return std_count_if(first, last, pred); 00106 } 00107 00108 00122 template< ss_typename_param_k I 00123 , ss_typename_param_k V 00124 > 00125 // [[synesis:function:algorithm: for_each_set_value(T<I> first, T<I> last, T<V> value)]] 00126 inline V const& for_each_set_value(I begin, I end, V const& value) 00127 { 00128 std_fill(begin, end); 00129 00130 return value; 00131 } 00132 00133 00145 // [[synesis:function:algorithm: for_each_set_value_if(T<I> first, T<I> last, T<V> value, T<UP> pred)]] 00146 template< ss_typename_param_k O 00147 , ss_typename_param_k V 00148 , ss_typename_param_k P 00149 > 00150 inline V const& for_each_set_value_if(O begin, O end, V const& value, P pred) 00151 { 00152 fill_if(begin, end, value, pred); 00153 00154 return value; 00155 } 00156 00157 00158 #if 0 00159 00170 template< ss_typename_param_k C 00171 , ss_typename_param_k P 00172 > 00173 // [[synesis:function:algorithm: remove_duplicates_from_unordered_sequence(T<C> container, T<UP> pred)]] 00174 inline void remove_duplicates_from_unordered_sequence(C &container, P pred) 00175 { 00176 // unordered_unique(container.begin(), container.end() 00177 static_assert(0); 00178 } 00179 #endif /* 0 */ 00180 00181 00183 // Unit-testing 00184 00185 #ifdef STLSOFT_UNITTEST 00186 # include "./unittest/deprecated_unittest_.h" 00187 #endif /* STLSOFT_UNITTEST */ 00188 00189 /* ////////////////////////////////////////////////////////////////////// */ 00190 00191 #ifndef _STLSOFT_NO_NAMESPACE 00192 } // namespace stlsoft 00193 #endif /* _STLSOFT_NO_NAMESPACE */ 00194 00195 /* ////////////////////////////////////////////////////////////////////// */ 00196 00197 #endif /* !STLSOFT_INCL_STLSOFT_ALGORITHMS_HPP_DEPRECATED */ 00198 00199 /* ///////////////////////////// end of file //////////////////////////// */