新版本TR1的stl

源代码在线查看: debug.hpp

软件大小: 2131 K
上传用户: xueyulanlian
关键词: TR1 stl 版本
下载地址: 免注册下载 普通下载 VIP

相关代码

				/* /////////////////////////////////////////////////////////////////////////
				 * File:        stlsoft/algorithms/debug.hpp
				 *
				 * Purpose:     Debug algorithms.
				 *
				 * Created:     17th January 2002
				 * Updated:     10th January 2007
				 *
				 * Home:        http://stlsoft.org/
				 *
				 * Copyright (c) 2002-2007, Matthew Wilson and Synesis Software
				 * All rights reserved.
				 *
				 * Redistribution and use in source and binary forms, with or without
				 * modification, are permitted provided that the following conditions are met:
				 *
				 * - Redistributions of source code must retain the above copyright notice, this
				 *   list of conditions and the following disclaimer.
				 * - Redistributions in binary form must reproduce the above copyright notice,
				 *   this list of conditions and the following disclaimer in the documentation
				 *   and/or other materials provided with the distribution.
				 * - Neither the name(s) of Matthew Wilson and Synesis Software nor the names of
				 *   any contributors may be used to endorse or promote products derived from
				 *   this software without specific prior written permission.
				 *
				 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
				 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
				 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
				 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
				 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
				 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
				 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
				 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
				 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
				 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
				 * POSSIBILITY OF SUCH DAMAGE.
				 *
				 * ////////////////////////////////////////////////////////////////////////// */
				
				
				/** \file stlsoft/algorithms/debug.hpp
				 *
				 * \brief [C++ only] Debug algorithms
				 *   (\ref group__library__algorithms "Algorithms" Library).
				 */
				
				#ifndef STLSOFT_INCL_STLSOFT_ALGORITHMS_HPP_DEBUG
				#define STLSOFT_INCL_STLSOFT_ALGORITHMS_HPP_DEBUG
				
				#ifndef STLSOFT_DOCUMENTATION_SKIP_SECTION
				# define STLSOFT_VER_STLSOFT_ALGORITHMS_HPP_DEBUG_MAJOR     3
				# define STLSOFT_VER_STLSOFT_ALGORITHMS_HPP_DEBUG_MINOR     0
				# define STLSOFT_VER_STLSOFT_ALGORITHMS_HPP_DEBUG_REVISION  3
				# define STLSOFT_VER_STLSOFT_ALGORITHMS_HPP_DEBUG_EDIT      66
				#endif /* !STLSOFT_DOCUMENTATION_SKIP_SECTION */
				
				/* /////////////////////////////////////////////////////////////////////////
				 * Compatibility
				 */
				
				/* /////////////////////////////////////////////////////////////////////////
				 * Includes
				 */
				
				#ifndef STLSOFT_INCL_STLSOFT_H_STLSOFT
				# include 
				#endif /* !STLSOFT_INCL_STLSOFT_H_STLSOFT */
				
				/* /////////////////////////////////////////////////////////////////////////
				 * Namespace
				 */
				
				#ifndef _STLSOFT_NO_NAMESPACE
				namespace stlsoft
				{
				#endif /* _STLSOFT_NO_NAMESPACE */
				
				/* /////////////////////////////////////////////////////////////////////////
				 * Algorithms
				 */
				
				/** \brief Carries out for_each on the range, using pre-increment on the iterator
				 *
				 * \ingroup group__library__algorithms
				 *
				 * \param first The start of the sequence
				 * \param last The end of the sequence
				 * \param func The function
				 */
				// [[synesis:function:algorithm: for_each_preinc(T first, T last, T func)]]
				template<   ss_typename_param_k I
				        ,   ss_typename_param_k UF
				        >
				inline UF for_each_preinc(I first, I last, UF func)
				{
				    for(; first != last; ++first)
				    {
				        func(*first);
				    }
				
				    return func;
				}
				
				/** \brief Carries out for_each on the range, using post-increment on the iterator
				 *
				 * \ingroup group__library__algorithms
				 *
				 * \param first The start of the sequence
				 * \param last The end of the sequence
				 * \param func The function
				 */
				// [[synesis:function:algorithm: for_each_postinc(T first, T last, T func)]]
				template<   ss_typename_param_k I
				        ,   ss_typename_param_k UF
				        >
				inline UF for_each_postinc(I first, I last, UF func)
				{
				    for(; first != last; first++)
				    {
				        func(*first);
				    }
				
				    return func;
				}
				
				////////////////////////////////////////////////////////////////////////////
				// Unit-testing
				
				#ifdef STLSOFT_UNITTEST
				# include "./unittest/debug_unittest_.h"
				#endif /* STLSOFT_UNITTEST */
				
				/* ////////////////////////////////////////////////////////////////////// */
				
				#ifndef _STLSOFT_NO_NAMESPACE
				} // namespace stlsoft
				#endif /* _STLSOFT_NO_NAMESPACE */
				
				/* ////////////////////////////////////////////////////////////////////// */
				
				#endif /* !STLSOFT_INCL_STLSOFT_ALGORITHMS_HPP_DEBUG */
				
				/* ////////////////////////////////////////////////////////////////////// */
							

相关资源