📄 transform_iterator.hpp
字号:
/* /////////////////////////////////////////////////////////////////////////
* File: stlsoft/iterators/transform_iterator.hpp (formerly MTTrnsIt.h; ::SynesisStl)
*
* Purpose: An iterator adaptor that uses a unary function object to transform
* the values from the iterator's underlying sequence.
*
* Created: 6th February 1999
* Updated: 13th June 2006
*
* Home: http://stlsoft.org/
*
* Copyright (c) 1999-2006, 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/iterators/transform_iterator.hpp
///
/// An iterator adaptor that uses a predicate to filter desired values from the iterator's underlying sequence.
#ifndef STLSOFT_INCL_STLSOFT_ITERATORS_HPP_TRANSFORM_ITERATOR
#define STLSOFT_INCL_STLSOFT_ITERATORS_HPP_TRANSFORM_ITERATOR
#ifndef STLSOFT_DOCUMENTATION_SKIP_SECTION
# define STLSOFT_VER_STLSOFT_ITERATORS_HPP_TRANSFORM_ITERATOR_MAJOR 2
# define STLSOFT_VER_STLSOFT_ITERATORS_HPP_TRANSFORM_ITERATOR_MINOR 0
# define STLSOFT_VER_STLSOFT_ITERATORS_HPP_TRANSFORM_ITERATOR_REVISION 13
# define STLSOFT_VER_STLSOFT_ITERATORS_HPP_TRANSFORM_ITERATOR_EDIT 106
#endif /* !STLSOFT_DOCUMENTATION_SKIP_SECTION */
/* /////////////////////////////////////////////////////////////////////////
* Compatibility
*/
/*
[Incompatibilies-start]
STLSOFT_COMPILER_IS_WATCOM:
[Incompatibilies-end]
*/
/* /////////////////////////////////////////////////////////////////////////
* Includes
*/
#ifndef STLSOFT_INCL_STLSOFT_H_STLSOFT
# include <stlsoft/stlsoft.h>
#endif /* !STLSOFT_INCL_STLSOFT_H_STLSOFT */
#ifndef STLSOFT_INCL_STLSOFT_HPP_ITERATOR
# include <stlsoft/iterator.hpp> // for stlsoft::iterator, and macros
#endif /* !STLSOFT_INCL_STLSOFT_HPP_ITERATOR */
#ifdef STLSOFT_UNITTEST
# include <algorithm>
# include <functional>
# include <string>
# include <vector>
# include <stlsoft/conversion/integer_to_string.hpp>
#endif /* STLSOFT_UNITTEST */
// #define STLSOFT_TRANSFORM_ITERATOR_IS_COMPATIBLE_WITH_HETEROGENOUS_ITERATOR_ALGOS
/* /////////////////////////////////////////////////////////////////////////
* Compiler & library compatibility
*/
#ifdef STLSOFT_ITER_TXFM_ITER_OLD_DW
# undef STLSOFT_ITER_TXFM_ITER_OLD_DW
#endif /* STLSOFT_ITER_TXFM_ITER_OLD_DW */
#if defined(STLSOFT_CF_STD_LIBRARY_IS_DINKUMWARE_VC) && \
STLSOFT_CF_STD_LIBRARY_DINKUMWARE_VC_VERSION < STLSOFT_CF_DINKUMWARE_VC_VERSION_7_1
# define STLSOFT_ITER_TXFM_ITER_OLD_DW
#endif /* library */
/* /////////////////////////////////////////////////////////////////////////
* Namespace
*/
#ifndef _STLSOFT_NO_NAMESPACE
namespace stlsoft
{
#endif /* _STLSOFT_NO_NAMESPACE */
/* ////////////////////////////////////////////////////////////////////// */
/// \weakgroup iterators Iterators
/// \brief STL-compatible iterators
/// \weakgroup adaptors Adaptors
/// \brief Adaptor functions and classes used throughout the STLSoft libraries
/// \weakgroup adaptors_iterator Iterator Adaptors
/// \brief Classes that provide iterator adaptation
/// \ingroup iterators adaptors
/// @{
/* /////////////////////////////////////////////////////////////////////////
* Classes
*/
#if 0
struct null_function
{
public:
typedef void *result_type;
};
#endif /* 0 */
/// Transforms the elements of an iterator
///
/// I The iterator to transform
/// F The unary function that will be used to transform the values
///
/// \note The iterator provides the same iterator category as the base iterator type I
/// (which is mapped to the member type \c iterator_type), but it always provides
/// By-Value Temporary (BVT) element references, so its pointer and reference member types
/// are always void.
template< ss_typename_param_k I
, ss_typename_param_k F
>
// [[synesis:class:iterator: transform_iterator<T<I>, T<F>>]]
class transform_iterator
#if 0
: public stlsoft_ns_qual(iterator_base)<ss_typename_type_k stlsoft_ns_qual_std(iterator_traits)<I>::iterator_category
, ss_typename_type_k transform_function_type::result_type
, ????
, void
, void
>
#endif /* 0 */
{
/// \name Member Types
/// @{
public:
/// The iterator to transform
typedef I iterator_type;
/// The unary function that will be used to transform the values
typedef F transform_function_type;
/// The value type
typedef ss_typename_type_k transform_function_type::result_type value_type;
#ifdef STLSOFT_ITER_TXFM_ITER_OLD_DW
/// The iterator category
typedef stlsoft_ns_qual_std(input_iterator_tag) iterator_category;
/// The difference type
typedef void difference_type;
#else /* ? STLSOFT_ITER_TXFM_ITER_OLD_DW */
typedef stlsoft_ns_qual_std(iterator_traits)<I> traits_type;
/// The iterator category
typedef ss_typename_type_k traits_type::iterator_category iterator_category;
/// The difference type
typedef ss_typename_type_k traits_type::difference_type difference_type;
#endif /* STLSOFT_ITER_TXFM_ITER_OLD_DW */
/// The parameterisation of the type
typedef transform_iterator<I, F> class_type;
/// The mutating (non-const) pointer type
///
/// \note Since a transforming iterator <i>must</i> have the By-Value Temporary element
/// reference category, the \c pointer member must be \c void.
typedef void pointer;
/// The mutating (non-const) reference type
///
/// \note Since a transforming iterator <i>must</i> have the By-Value Temporary element
/// reference category, the \c reference member must be \c void.
typedef void reference;
/// The effective mutating (non-const) reference type
///
/// \note Since a transforming iterator <i>must</i> have the By-Value Temporary element
/// reference category, this member must be \c value_type.
typedef value_type effective_reference;
/// The effective mutating (non-const) reference type
///
/// \note Since a transforming iterator <i>must</i> have the By-Value Temporary element
/// reference category, this member must be \c const value_type.
typedef const value_type effective_const_reference;
/// @}
/// \name Construction
/// @{
public:
transform_iterator(iterator_type it, transform_function_type pr)
: m_it(it)
, m_transformer(pr)
{}
transform_iterator()
: m_it()
, m_transformer()
{}
/// \brief A copy of the base iterator
iterator_type base() const
{
return m_it;
}
/// @}
/// \name Conversion
/// @{
public:
#if 0
# if 1
transform_iterator(class_type const &rhs)
: m_it(rhs.m_it)
, m_transformer(rhs.m_transformer)
{}
# endif /* 0 */
template <ss_typename_param_k F2>
transform_iterator(transform_iterator<I, F2> const &rhs)
: m_it(rhs.m_it)
, m_transformer()
{}
# if 0
template <ss_typename_param_k F2>
operator transform_iterator<I, F2>() const
{
return transform_iterator<I, F2>(m_it, F2());
}
# endif /* 0 */
#endif /* 0 */
/// @}
/// \name Accessors
/// @{
public:
effective_reference operator *()
{
m_current = m_transformer(*m_it);
return m_current;
}
effective_const_reference operator *() const
{
m_current = m_transformer(*m_it);
return m_current;
}
/// @}
/// \name Forward Iterator methods
/// @{
public:
class_type &operator ++()
{
++m_it;
return *this;
}
class_type operator ++(int)
{
class_type ret(*this);
operator ++();
return ret;
}
/// @}
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -