📄 findfile_sequence.hpp
字号:
/* /////////////////////////////////////////////////////////////////////////
* File: inetstl/findfile_sequence.hpp (formerly MInetEnm.h)
*
* Purpose: Contains the basic_findfile_sequence template class, and ANSI
* and Unicode specialisations thereof.
*
* Created: 30th April 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 inetstl/findfile_sequence.hpp
///
/// Contains the basic_findfile_sequence template class, and ANSI and Unicode specialisations thereof.
#ifndef INETSTL_INCL_INETSTL_HPP_FINDFILE_SEQUENCE
#define INETSTL_INCL_INETSTL_HPP_FINDFILE_SEQUENCE
#ifndef STLSOFT_DOCUMENTATION_SKIP_SECTION
# define INETSTL_VER_INETSTL_HPP_FINDFILE_SEQUENCE_MAJOR 2
# define INETSTL_VER_INETSTL_HPP_FINDFILE_SEQUENCE_MINOR 11
# define INETSTL_VER_INETSTL_HPP_FINDFILE_SEQUENCE_REVISION 6
# define INETSTL_VER_INETSTL_HPP_FINDFILE_SEQUENCE_EDIT 108
#endif /* !STLSOFT_DOCUMENTATION_SKIP_SECTION */
/* /////////////////////////////////////////////////////////////////////////
* Compatibility
*/
/*
[Incompatibilies-start]
STLSOFT_COMPILER_IS_MSVC: _MSC_VER<1100
[Incompatibilies-end]
*/
/* /////////////////////////////////////////////////////////////////////////
* Includes
*/
#ifndef INETSTL_INCL_INETSTL_H_INETSTL
# include <inetstl/inetstl.h>
#endif /* !INETSTL_INCL_INETSTL_H_INETSTL */
#ifndef INETSTL_INCL_INETSTL_HPP_FILESYSTEM_TRAITS
# include <inetstl/filesystem_traits.hpp>
#endif /* !INETSTL_INCL_INETSTL_HPP_FILESYSTEM_TRAITS */
#ifdef STLSOFT_CF_EXCEPTION_SUPPORT
# ifndef INETSTL_INCL_INETSTL_HPP_EXCEPTIONS
# include <inetstl/exceptions.hpp> // for throw_internet_exception_policy
# endif /* !INETSTL_INCL_INETSTL_HPP_EXCEPTIONS */
#else /* ? STLSOFT_CF_EXCEPTION_SUPPORT */
# ifndef STLSOFT_INCL_STLSOFT_HPP_EXCEPTIONS
# include <stlsoft/exceptions.hpp> // for stlsoft::null_exception_policy
# endif /* !STLSOFT_INCL_STLSOFT_HPP_EXCEPTIONS */
#endif /* STLSOFT_CF_EXCEPTION_SUPPORT */
#ifndef STLSOFT_INCL_STLSOFT_COLLECTIONS_HPP_COLLECTIONS
# include <stlsoft/collections/collections.hpp>
#endif /* !STLSOFT_INCL_STLSOFT_COLLECTIONS_HPP_COLLECTIONS */
#ifndef STLSOFT_INCL_STLSOFT_STRING_HPP_SIMPLE_STRING
# include <stlsoft/string/simple_string.hpp>
#endif /* !STLSOFT_INCL_STLSOFT_STRING_HPP_SIMPLE_STRING */
#ifndef STLSOFT_INCL_STLSOFT_TOKENISING_HPP_TOKENISER_FUNCTIONS
# include <stlsoft/tokenising/tokeniser_functions.hpp> // for find_next_token
#endif /* !STLSOFT_INCL_STLSOFT_TOKENISING_HPP_TOKENISER_FUNCTIONS */
#ifndef STLSOFT_INCL_STLSOFT_HPP_ITERATOR
# include <stlsoft/iterator.hpp>
#endif /* !STLSOFT_INCL_STLSOFT_HPP_ITERATOR */
#ifndef STLSOFT_INCL_STLSOFT_HPP_STRING_ACCESS
# include <stlsoft/string_access.hpp>
#endif /* !STLSOFT_INCL_STLSOFT_HPP_STRING_ACCESS */
#ifdef STLSOFT_UNITTEST
# include <stlsoft/conversion/integer_to_string.hpp>
# include <inetstl/connection.hpp>
# include <inetstl/session.hpp>
# include <stdio.h>
# include <string.h>
#endif /* STLSOFT_UNITTEST */
/* /////////////////////////////////////////////////////////////////////////
* Namespace
*/
#ifndef _INETSTL_NO_NAMESPACE
# if defined(_STLSOFT_NO_NAMESPACE) || \
defined(STLSOFT_DOCUMENTATION_SKIP_SECTION)
/* There is no stlsoft namespace, so must define ::inetstl */
namespace inetstl
{
# else
/* Define stlsoft::inetstl_project */
namespace stlsoft
{
namespace inetstl_project
{
# endif /* _STLSOFT_NO_NAMESPACE */
#endif /* !_INETSTL_NO_NAMESPACE */
/* /////////////////////////////////////////////////////////////////////////
* Forward declarations
*/
#ifndef STLSOFT_DOCUMENTATION_SKIP_SECTION
template< ss_typename_param_k C
, ss_typename_param_k T
, ss_typename_param_k X
>
class basic_findfile_sequence;
template< ss_typename_param_k C
, ss_typename_param_k T
, ss_typename_param_k X
>
class basic_findfile_sequence_value_type;
template< ss_typename_param_k C
, ss_typename_param_k T
, ss_typename_param_k X
, ss_typename_param_k V
>
class basic_findfile_sequence_const_input_iterator;
#endif /* !STLSOFT_DOCUMENTATION_SKIP_SECTION */
/* /////////////////////////////////////////////////////////////////////////
* Classes
*/
// class basic_findfile_sequence
/// Presents an STL-like sequence interface over the items on the file-system
///
/// \param C The character type
/// \param T The traits type. On translators that support default template arguments this defaults to filesystem_traits<C>
///
/// \note This class was described in detail in the article
/// "Adapting Windows Enumeration Models to STL Iterator Concepts"
/// (http://www.windevnet.com/documents/win0303a/), in the March 2003 issue of
/// Windows Developer Network (http://windevnet.com).
template< ss_typename_param_k C
#ifdef STLSOFT_CF_TEMPLATE_CLASS_DEFAULT_CLASS_ARGUMENT_SUPPORT
, ss_typename_param_k T = filesystem_traits<C>
# ifdef STLSOFT_CF_EXCEPTION_SUPPORT
, ss_typename_param_k X = throw_internet_exception_policy
# else /* ? STLSOFT_CF_EXCEPTION_SUPPORT */
, ss_typename_param_k X = stlsoft_ns_qual(null_exception_policy)
# endif /* STLSOFT_CF_EXCEPTION_SUPPORT */
#else /* ? STLSOFT_CF_TEMPLATE_CLASS_DEFAULT_CLASS_ARGUMENT_SUPPORT */
, ss_typename_param_k T /* = filesystem_traits<C> */
, ss_typename_param_k X /* = throw_internet_exception_policy */
#endif /* STLSOFT_CF_TEMPLATE_CLASS_DEFAULT_CLASS_ARGUMENT_SUPPORT */
>
class basic_findfile_sequence
: public stlsoft_ns_qual(stl_collection_tag)
{
/// \name Member Types
/// @{
public:
/// The character type
typedef C char_type;
/// The exception policy type
typedef X exception_policy_type;
/// The type thrown
typedef ss_typename_param_k exception_policy_type::thrown_type thrown_type;
/// The traits type
typedef T traits_type;
/// The current parameterisation of the type
typedef basic_findfile_sequence<C, T, X> class_type;
/// The value type
typedef basic_findfile_sequence_value_type<C, T, X> value_type;
/// The non-mutating (const) iterator type supporting the Input Iterator concept
typedef basic_findfile_sequence_const_input_iterator<C, T, X, value_type> const_input_iterator;
/// The non-mutating (const) iterator type
typedef const_input_iterator const_iterator;
/// The reference type
typedef value_type &reference;
/// The non-mutable (const) reference type
typedef value_type const &const_reference;
/// The find-data type
typedef ss_typename_type_k traits_type::find_data_type find_data_type;
/// The difference type
typedef is_ptrdiff_t difference_type;
/// The size type
typedef is_size_t size_type;
/// The Boolean type
typedef is_bool_t bool_type;
private:
typedef is_sint_t flags_type;
typedef stlsoft_ns_qual(basic_simple_string)<char_type> string_type;
/// @}
/// \name Flags
/// @{
public:
enum search_flags
{
includeDots = 0x0008 //!< Causes the search to include the "." and ".." directories, which are elided by default
, directories = 0x0010 //!< Causes the search to include directories
, files = 0x0020 //!< Causes the search to include files
#ifndef STLSOFT_DOCUMENTATION_SKIP_SECTION
, noSort = 0 /* 0x0100 */ //!<
#endif /* !STLSOFT_DOCUMENTATION_SKIP_SECTION */
};
/// @}
/// \name Construction
/// @{
public:
/// Commence a search according to the given search pattern and flags
basic_findfile_sequence(HINTERNET hconn
, char_type const *pattern
, flags_type flags = directories | files);
/// Commence a search according to the given search pattern and flags, relative to \c directory
basic_findfile_sequence(HINTERNET hconn
, char_type const *directory
, char_type const *pattern
, flags_type flags = directories | files);
/// Commence a search according to the given search pattern and flags, relative to \c directory
basic_findfile_sequence(HINTERNET hconn
, char_type const *directory
, char_type const *patterns
, char_type delim
, flags_type flags = directories | files);
/// Destructor
~basic_findfile_sequence() stlsoft_throw_0();
/// @}
/// \name Iteration
/// @{
public:
/// Begins the iteration
///
/// \return An iterator representing the start of the sequence
const_iterator begin() const;
/// Ends the iteration
///
/// \return An iterator representing the end of the sequence
const_iterator end() const;
/// @}
/// \name Attributes
/// @{
public:
/// Returns the directory of the search
///
/// \note Will be the empty string for instances created with the first constructor
char_type const *get_directory() const;
/// @}
/// \name State
/// @{
public:
#ifdef STLSOFT_OBSOLETE
/// Returns the number of items in the sequence
///
/// \note This is a potentially very expensive operation
/// \deprecated
size_type size() const;
#endif /* STLSOFT_OBSOLETE */
/// Indicates whether the sequence is empty
bool_type empty() const;
/// Returns the maximum number of items in the sequence
static size_type max_size();
/// @}
/// \name Members
/// @{
private:
friend class basic_findfile_sequence_value_type<C, T, X>;
friend class basic_findfile_sequence_const_input_iterator<C, T, X, value_type>;
const HINTERNET m_hconn;
const char_type m_delim;
const flags_type m_flags;
const string_type m_rootDir;
const string_type m_patterns;
/// @}
/// \name Invariant
/// @{
private:
bool_type is_valid() const;
/// @}
/// \name Implementation
/// @{
private:
static flags_type validate_flags_(flags_type flags);
static void extract_subpath_(HINTERNET hconn, char_type *dest, char_type const *pattern);
static HINTERNET find_first_file_(HINTERNET hconn, char_type const *spec, flags_type flags, find_data_type *findData);
/// @}
/// \name Not to be implemented
/// @{
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -