⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 zorder_iterator.hpp

📁 新版本TR1的stl
💻 HPP
字号:
/* /////////////////////////////////////////////////////////////////////////
 * File:        winstl/window/zorder_iterator.hpp
 *
 * Purpose:     Z-order iteration.
 *
 * Created:     11th July 2005
 * Updated:     8th April 2007
 *
 * Home:        http://stlsoft.org/
 *
 * Copyright (c) 2005-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 winstl/window/zorder_iterator.hpp
 *
 * \brief [C++ only] Definition of the winstl::zorder_iterator class
 *   (\ref group__library__windows_window "Windows Window" Library).
 */

#ifndef WINSTL_INCL_WINSTL_WINDOW_HPP_ZORDER_ITERATOR
#define WINSTL_INCL_WINSTL_WINDOW_HPP_ZORDER_ITERATOR

#ifndef STLSOFT_DOCUMENTATION_SKIP_SECTION
# define WINSTL_VER_WINSTL_WINDOW_HPP_ZORDER_ITERATOR_MAJOR     2
# define WINSTL_VER_WINSTL_WINDOW_HPP_ZORDER_ITERATOR_MINOR     0
# define WINSTL_VER_WINSTL_WINDOW_HPP_ZORDER_ITERATOR_REVISION  2
# define WINSTL_VER_WINSTL_WINDOW_HPP_ZORDER_ITERATOR_EDIT      36
#endif /* !STLSOFT_DOCUMENTATION_SKIP_SECTION */

/* /////////////////////////////////////////////////////////////////////////
 * Includes
 */

#ifndef WINSTL_INCL_WINSTL_H_WINSTL
# include <winstl/winstl.h>
#endif /* !WINSTL_INCL_WINSTL_H_WINSTL */
#ifndef STLSOFT_INCL_STLSOFT_UTIL_STD_HPP_ITERATOR_HELPER
# include <stlsoft/util/std/iterator_helper.hpp>
#endif /* !STLSOFT_INCL_STLSOFT_UTIL_STD_HPP_ITERATOR_HELPER */
#ifndef STLSOFT_INCL_STLSOFT_ERROR_HPP_EXTERNAL_ITERATOR_INVALIDATION
# include <stlsoft/error/external_iterator_invalidation.hpp>
#endif /* !STLSOFT_INCL_STLSOFT_ERROR_HPP_EXTERNAL_ITERATOR_INVALIDATION */

/* /////////////////////////////////////////////////////////////////////////
 * Namespace
 */

#ifndef _WINSTL_NO_NAMESPACE
# if defined(_STLSOFT_NO_NAMESPACE) || \
     defined(STLSOFT_DOCUMENTATION_SKIP_SECTION)
/* There is no stlsoft namespace, so must define ::winstl */
namespace winstl
{
# else
/* Define stlsoft::winstl_project */

namespace stlsoft
{

namespace winstl_project
{

# endif /* _STLSOFT_NO_NAMESPACE */
#endif /* !_WINSTL_NO_NAMESPACE */

/* /////////////////////////////////////////////////////////////////////////
 * Classes
 */

#ifndef STLSOFT_DOCUMENTATION_SKIP_SECTION

struct zorder_iterator_base
{
public:
    enum search
    {
            fromFirstPeer   =   1   //!< Positions the iterator at the start of the list of peers of the given window
        ,   fromCurrent     =   2   //!< Positions the iterator at point of the given window in its list of window peers
        ,   atLastPeer      =   3   //!< Positions the iterator at the end of the list of peers of the given window
        ,   fromFirstChild  =   4   //!< Positions the iterator at the start of the list of children of the given window
        ,   atLastChild     =   5   //!< Positions the iterator at the end of the list of children of the given window
    };
};

struct zorder_iterator_forward_traits;
struct zorder_iterator_reverse_traits;

struct zorder_iterator_forward_traits
{
public:
    typedef zorder_iterator_forward_traits  this_type;
    typedef zorder_iterator_reverse_traits  alternate_type;
public:
    static HWND get_first_child(HWND hwnd)
    {
        return ::GetWindow(hwnd, GW_CHILD);
    }
    static HWND get_first_peer(HWND hwnd)
    {
        return ::GetWindow(hwnd, GW_HWNDFIRST);
    }
    static HWND get_next_peer(HWND hwnd)
    {
        return ::GetWindow(hwnd, GW_HWNDNEXT);
    }
    static HWND get_previous_peer(HWND hwnd)
    {
        return ::GetWindow(hwnd, GW_HWNDPREV);
    }
    static HWND get_last_peer(HWND hwnd)
    {
        return ::GetWindow(hwnd, GW_HWNDLAST);
    }
};

struct zorder_iterator_reverse_traits
{
public:
    typedef zorder_iterator_reverse_traits  this_type;
    typedef zorder_iterator_forward_traits  alternate_type;
public:
    static HWND get_first_child(HWND hwnd)
    {
        return ::GetWindow(::GetWindow(hwnd, GW_CHILD), GW_HWNDLAST);
    }
    static HWND get_first_peer(HWND hwnd)
    {
        return ::GetWindow(hwnd, GW_HWNDLAST);
    }
    static HWND get_next_peer(HWND hwnd)
    {
        return ::GetWindow(hwnd, GW_HWNDPREV);
    }
    static HWND get_previous_peer(HWND hwnd)
    {
        return ::GetWindow(hwnd, GW_HWNDNEXT);
    }
    static HWND get_last_peer(HWND hwnd)
    {
        return ::GetWindow(hwnd, GW_HWNDFIRST);
    }
};

#endif /* !STLSOFT_DOCUMENTATION_SKIP_SECTION */

/** \brief Iterates over the Z-order of window peers
 *
 * \ingroup group__library__windows_window
 */
template <ss_typename_param_k T>
class zorder_iterator_tmpl
    : public zorder_iterator_base
#if 0
    , public stlsoft_ns_qual(iterator_base)<winstl_ns_qual_std(bidirectional_iterator_tag)
#else /* ? 0 */
    , public stlsoft_ns_qual(iterator_base)<winstl_ns_qual_std(input_iterator_tag)
#endif /* 0 */
                                        ,   HWND
                                        ,   ws_ptrdiff_t
                                        ,   void    // By-Value Temporary reference
                                        ,   HWND    // By-Value Temporary reference: This has to be non-void, otherwise reverse_iterator::operator *() will return void
                                        >
{
/// \name Types
/// @{
public:
    typedef T                                                                       traits_type;
    typedef HWND                                                                    value_type;
    typedef ws_size_t                                                               size_type;
    typedef ws_ptrdiff_t                                                            difference_type;
    typedef zorder_iterator_tmpl<T>                                                 class_type;
    typedef zorder_iterator_tmpl<ss_typename_type_k traits_type::alternate_type>    base_iterator_type;
    typedef base_iterator_type                                                      iterator_type;
/// @}

/// \name Construction
/// @{
private:
    zorder_iterator_tmpl(HWND hwndRoot, HWND hwndCurrent);
public:
    zorder_iterator_tmpl();
    ~zorder_iterator_tmpl() stlsoft_throw_0();

    class_type& operator =(class_type const&);

    static class_type create(HWND hwndRoot, search from);
/// @}

/// \name Iteration
/// @{
public:
    /// \name Input Iterator Methods
    /// @{
    class_type& operator ++();
    class_type  operator ++(int);
    value_type  operator *() const;
    /// @}

    /// \name Bidirectional Iterator Methods
    /// @{
    class_type& operator --();
    class_type  operator --(int);
    /// @}
    base_iterator_type base() const;
/// @}

/// \name Comparison
/// @{
public:
    bool equal(class_type const& rhs) const;
/// @}

/// \name Implementation
/// @{
private:
    static HWND get_next_window_(HWND hwnd, HWND (*pfn)(HWND )) /* throw(stlsoft::external_iterator_invalidation) */;
/// @}

/// \name Members
/// @{
private:
    HWND    m_hwndRoot;
    HWND    m_hwndCurrent;
/// @}
};

/* /////////////////////////////////////////////////////////////////////////
 * Typedefs
 */

/** \brief Specialisation of \link winstl::zorder_iterator_tmpl zorder_iterator_tmpl\endlink
 *    that searches a set of window peers in the forward direction.
 *
 * \ingroup group__library__windows_window
 */
typedef zorder_iterator_tmpl<zorder_iterator_forward_traits>    zorder_iterator;

/* /////////////////////////////////////////////////////////////////////////
 * Proscribe the use of std::reverse_iterator
 */

#if 0
STLSOFT_TEMPLATE_SPECIALISATION
class std::ostream_iterator<zorder_iterator_tmpl<zorder_iterator_forward_traits> >;

STLSOFT_TEMPLATE_SPECIALISATION
class std::ostream_iterator<zorder_iterator_tmpl<zorder_iterator_reverse_traits> >;
#endif /* 0 */

/* /////////////////////////////////////////////////////////////////////////
 * Operators
 */

template <ss_typename_param_k T>
inline bool operator ==(zorder_iterator_tmpl<T> const& lhs
                    ,   zorder_iterator_tmpl<T> const& rhs)
{
    return lhs.equal(rhs);
}
template <ss_typename_param_k T>
inline bool operator !=(zorder_iterator_tmpl<T> const& lhs
                    ,   zorder_iterator_tmpl<T> const& rhs)
{
    return !lhs.equal(rhs);
}

/* /////////////////////////////////////////////////////////////////////////
 * Implementation
 */

#ifndef STLSOFT_DOCUMENTATION_SKIP_SECTION

template <ss_typename_param_k T>
inline /* static */ HWND zorder_iterator_tmpl<T>::get_next_window_(HWND hwnd, HWND (*pfn)(HWND )) /* throw(stlsoft::external_iterator_invalidation) */
{
    hwnd = (*pfn)(hwnd);

    if(NULL == hwnd)
    {
        DWORD   dwErr   =   ::GetLastError();

//        if(ERROR_INVALID_WINDOW_HANDLE == dwErr)
        if(ERROR_SUCCESS != dwErr)
        {
            STLSOFT_THROW_X(stlsoft_ns_qual(external_iterator_invalidation)("z-order search failed: window has been destroyed", static_cast<long>(dwErr)));
        }
    }

    return hwnd;
}

template <ss_typename_param_k T>
inline zorder_iterator_tmpl<T>::zorder_iterator_tmpl()
    : m_hwndRoot(NULL)
    , m_hwndCurrent(NULL)
{}

template <ss_typename_param_k T>
inline zorder_iterator_tmpl<T>::zorder_iterator_tmpl(HWND hwndRoot, HWND hwndCurrent)
    : m_hwndRoot(hwndRoot)
    , m_hwndCurrent(hwndCurrent)
{}

template <ss_typename_param_k T>
inline zorder_iterator_tmpl<T>::~zorder_iterator_tmpl() stlsoft_throw_0()
{}

template <ss_typename_param_k T>
inline ss_typename_type_k zorder_iterator_tmpl<T>::class_type &zorder_iterator_tmpl<T>::operator =(ss_typename_type_k zorder_iterator_tmpl<T>::class_type const& rhs)
{
    WINSTL_ASSERT(NULL == m_hwndRoot || NULL == rhs.m_hwndRoot || (rhs.m_hwndRoot == m_hwndRoot));

    m_hwndCurrent   =   rhs.m_hwndCurrent;

    return *this;
}

template <ss_typename_param_k T>
inline /* static */ zorder_iterator_tmpl<T> zorder_iterator_tmpl<T>::create(HWND hwndRoot, search from)
{
    HWND    hwndCurrent;

    switch(from)
    {
        case    fromFirstChild:
        case    atLastChild:
            hwndRoot = get_next_window_(hwndRoot, traits_type::get_first_child);
        default:
            break;
    }

    switch(from)
    {
        case    fromCurrent:
            hwndCurrent = hwndRoot;
            break;
        case    fromFirstPeer:
        case    fromFirstChild:
            hwndCurrent = get_next_window_(hwndRoot, traits_type::get_first_peer);
            break;
        case    atLastChild:
        case    atLastPeer:
            hwndCurrent = NULL;
            break;
    }

    return zorder_iterator_tmpl<T>(hwndRoot, hwndCurrent);
}

template <ss_typename_param_k T>
inline ss_typename_type_k zorder_iterator_tmpl<T>::class_type &zorder_iterator_tmpl<T>::operator ++()
{
    WINSTL_MESSAGE_ASSERT("Attempt to increment an invalid / out-of-range iterator", NULL != m_hwndCurrent);

    m_hwndCurrent  = class_type::get_next_window_(m_hwndCurrent, traits_type::get_next_peer);

    return *this;
}

template <ss_typename_param_k T>
inline ss_typename_type_k zorder_iterator_tmpl<T>::class_type zorder_iterator_tmpl<T>::operator ++(int)
{
    class_type  ret(*this);

    operator ++();

    return ret;
}

template <ss_typename_param_k T>
inline ss_typename_type_k zorder_iterator_tmpl<T>::class_type &zorder_iterator_tmpl<T>::operator --()
{
    WINSTL_MESSAGE_ASSERT("Attempt to decrement an invalid / out-of-range iterator", NULL != m_hwndRoot);

    if(NULL != m_hwndCurrent)
    {
        m_hwndCurrent  = class_type::get_next_window_(m_hwndCurrent, traits_type::get_previous_peer);
    }
    else
    {
        m_hwndCurrent  = class_type::get_next_window_(m_hwndRoot, traits_type::get_last_peer);
    }

    return *this;
}

template <ss_typename_param_k T>
inline ss_typename_type_k zorder_iterator_tmpl<T>::class_type zorder_iterator_tmpl<T>::operator --(int)
{
    class_type  ret(*this);

    operator --();

    return ret;
}

template <ss_typename_param_k T>
inline ss_typename_type_k zorder_iterator_tmpl<T>::base_iterator_type zorder_iterator_tmpl<T>::base() const
{
    base_iterator_type  it = base_iterator_type::create(m_hwndCurrent, fromCurrent);

    return ++it;
}

template <ss_typename_param_k T>
inline ss_typename_type_k zorder_iterator_tmpl<T>::value_type zorder_iterator_tmpl<T>::operator *() const
{
    return m_hwndCurrent;
}

template <ss_typename_param_k T>
inline bool zorder_iterator_tmpl<T>::equal(ss_typename_type_k zorder_iterator_tmpl<T>::class_type const& rhs) const
{
    WINSTL_MESSAGE_ASSERT("Iterators are not endpoint iterators, and refer to different collections", NULL == m_hwndRoot || NULL == rhs.m_hwndRoot || (rhs.m_hwndRoot == m_hwndRoot));

    return m_hwndCurrent == rhs.m_hwndCurrent;
}

#endif /* !STLSOFT_DOCUMENTATION_SKIP_SECTION */

/* /////////////////////////////////////////////////////////////////////////
 * Namespace
 */

#ifndef _WINSTL_NO_NAMESPACE
# if defined(_STLSOFT_NO_NAMESPACE) || \
     defined(STLSOFT_DOCUMENTATION_SKIP_SECTION)
} // namespace winstl
# else
} // namespace winstl_project
} // namespace stlsoft
# endif /* _STLSOFT_NO_NAMESPACE */
#endif /* !_WINSTL_NO_NAMESPACE */

/* ////////////////////////////////////////////////////////////////////// */

#endif /* WINSTL_INCL_WINSTL_WINDOW_HPP_ZORDER_ITERATOR */

/* ////////////////////////////////////////////////////////////////////// */

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -